2017-10-21 21:10:33 -04:00
|
|
|
"use strict";
|
|
|
|
|
2017-10-15 19:47:05 -04:00
|
|
|
const sql = require('../../services/sql');
|
2018-04-01 21:27:46 -04:00
|
|
|
const optionService = require('../../services/options');
|
2019-11-16 11:23:28 +01:00
|
|
|
const treeService = require('../../services/tree');
|
2018-04-16 20:40:18 -04:00
|
|
|
|
2020-06-20 12:31:38 +02:00
|
|
|
function getNotesAndBranchesAndAttributes(noteIds) {
|
2020-12-10 21:27:21 +01:00
|
|
|
const notes = treeService.getNotesIncludingAscendants(noteIds);
|
2019-10-25 21:47:14 +02:00
|
|
|
|
2020-12-10 21:27:21 +01:00
|
|
|
noteIds = new Set(notes.map(note => note.noteId));
|
|
|
|
|
|
|
|
sql.fillNoteIdList(noteIds);
|
2018-04-16 20:40:18 -04:00
|
|
|
|
2019-12-17 22:17:03 +01:00
|
|
|
// joining child note to filter out not completely synchronised notes which would then cause errors later
|
|
|
|
// cannot do that with parent because of root note's 'none' parent
|
2020-12-10 21:27:21 +01:00
|
|
|
const branches = sql.getRows(`
|
2019-10-25 21:47:14 +02:00
|
|
|
SELECT
|
|
|
|
branches.branchId,
|
|
|
|
branches.noteId,
|
|
|
|
branches.parentNoteId,
|
|
|
|
branches.notePosition,
|
|
|
|
branches.prefix,
|
|
|
|
branches.isExpanded
|
2020-12-10 21:27:21 +01:00
|
|
|
FROM param_list
|
2020-12-11 15:24:44 +01:00
|
|
|
JOIN branches ON param_list.paramId = branches.parentNoteId
|
2019-12-17 22:17:03 +01:00
|
|
|
JOIN notes AS child ON child.noteId = branches.noteId
|
2020-12-10 21:27:21 +01:00
|
|
|
WHERE branches.isDeleted = 0`);
|
2018-08-31 17:29:54 +02:00
|
|
|
|
2020-12-11 15:27:57 +01:00
|
|
|
if (noteIds.has('root')) {
|
|
|
|
branches.push({
|
|
|
|
branchId: 'root',
|
|
|
|
noteId: 'root',
|
|
|
|
parentNoteId: 'none',
|
|
|
|
notePosition: 0,
|
|
|
|
prefix: '',
|
|
|
|
isExpanded: true
|
|
|
|
});
|
|
|
|
}
|
|
|
|
|
2020-12-10 21:27:21 +01:00
|
|
|
const attributes = sql.getRows(`
|
2020-01-25 11:52:45 +01:00
|
|
|
SELECT
|
2020-12-10 21:27:21 +01:00
|
|
|
attributes.attributeId,
|
|
|
|
attributes.noteId,
|
|
|
|
attributes.type,
|
|
|
|
attributes.name,
|
|
|
|
attributes.value,
|
|
|
|
attributes.position,
|
|
|
|
attributes.isInheritable
|
|
|
|
FROM param_list
|
|
|
|
JOIN attributes ON attributes.noteId = param_list.paramId
|
|
|
|
OR (attributes.type = 'relation' AND attributes.value = param_list.paramId)
|
|
|
|
WHERE attributes.isDeleted = 0`);
|
|
|
|
|
|
|
|
// we don't really care about the direction of the relation
|
|
|
|
const missingTemplateNoteIds = attributes
|
|
|
|
.filter(attr => attr.type === 'relation'
|
|
|
|
&& attr.name === 'template'
|
|
|
|
&& !noteIds.has(attr.value))
|
|
|
|
.map(attr => attr.value);
|
|
|
|
|
|
|
|
if (missingTemplateNoteIds.length > 0) {
|
|
|
|
const templateData = getNotesAndBranchesAndAttributes(missingTemplateNoteIds);
|
|
|
|
|
|
|
|
// there are going to be duplicates with simple concatenation, however:
|
|
|
|
// 1) shouldn't matter for the frontend which will update the entity twice
|
|
|
|
// 2) there shouldn't be many duplicates. There isn't that many templates
|
|
|
|
addArrays(notes, templateData.notes);
|
|
|
|
addArrays(branches, templateData.branches);
|
|
|
|
addArrays(attributes, templateData.attributes);
|
|
|
|
}
|
2020-01-25 11:52:45 +01:00
|
|
|
|
2020-01-25 14:37:12 +01:00
|
|
|
// sorting in memory is faster
|
2020-12-10 21:27:21 +01:00
|
|
|
branches.sort((a, b) => a.notePosition - b.notePosition < 0 ? -1 : 1);
|
2020-01-25 14:37:12 +01:00
|
|
|
attributes.sort((a, b) => a.position - b.position < 0 ? -1 : 1);
|
|
|
|
|
2019-10-25 21:47:14 +02:00
|
|
|
return {
|
|
|
|
branches,
|
2020-01-25 13:46:55 +01:00
|
|
|
notes,
|
|
|
|
attributes
|
2019-10-25 21:47:14 +02:00
|
|
|
};
|
2018-04-16 20:40:18 -04:00
|
|
|
}
|
2017-10-14 23:31:44 -04:00
|
|
|
|
2020-12-10 21:27:21 +01:00
|
|
|
// should be fast based on https://stackoverflow.com/a/64826145/944162
|
|
|
|
// in this case it is assumed that target is potentially much larger than elementsToAdd
|
|
|
|
function addArrays(target, elementsToAdd) {
|
|
|
|
while (elementsToAdd.length) {
|
|
|
|
target.push(elementsToAdd.shift());
|
|
|
|
}
|
|
|
|
|
|
|
|
return target;
|
|
|
|
}
|
|
|
|
|
2020-08-26 16:50:16 +02:00
|
|
|
function getTree(req) {
|
2020-11-22 23:05:02 +01:00
|
|
|
const subTreeNoteId = req.query.subTreeNoteId || 'root';
|
2018-12-11 21:53:56 +01:00
|
|
|
|
2020-10-24 00:00:24 +02:00
|
|
|
// FIXME: this query does not return ascendants of template notes
|
2020-06-20 12:31:38 +02:00
|
|
|
const noteIds = sql.getColumn(`
|
2018-04-16 16:26:47 -04:00
|
|
|
WITH RECURSIVE
|
2020-10-24 00:00:24 +02:00
|
|
|
treeWithDescendants(noteId, isExpanded) AS (
|
|
|
|
SELECT noteId, isExpanded FROM branches WHERE parentNoteId = ? AND isDeleted = 0
|
2020-08-26 16:50:16 +02:00
|
|
|
UNION
|
2020-10-24 00:00:24 +02:00
|
|
|
SELECT branches.noteId, branches.isExpanded FROM branches
|
2020-08-26 16:50:16 +02:00
|
|
|
JOIN treeWithDescendants ON branches.parentNoteId = treeWithDescendants.noteId
|
2020-10-24 00:00:24 +02:00
|
|
|
WHERE treeWithDescendants.isExpanded = 1
|
2020-08-26 16:50:16 +02:00
|
|
|
AND branches.isDeleted = 0
|
|
|
|
)
|
2020-12-10 21:27:21 +01:00
|
|
|
SELECT noteId FROM treeWithDescendants`, [subTreeNoteId]);
|
2018-04-16 16:26:47 -04:00
|
|
|
|
2020-11-23 23:11:21 +01:00
|
|
|
noteIds.push(subTreeNoteId);
|
2018-12-12 20:39:56 +01:00
|
|
|
|
2020-06-20 12:31:38 +02:00
|
|
|
return getNotesAndBranchesAndAttributes(noteIds);
|
2018-04-16 20:40:18 -04:00
|
|
|
}
|
2018-04-16 16:26:47 -04:00
|
|
|
|
2020-06-20 12:31:38 +02:00
|
|
|
function load(req) {
|
|
|
|
return getNotesAndBranchesAndAttributes(req.body.noteIds);
|
2018-03-30 12:57:22 -04:00
|
|
|
}
|
2017-10-14 23:31:44 -04:00
|
|
|
|
2018-03-30 12:57:22 -04:00
|
|
|
module.exports = {
|
2018-04-16 20:40:18 -04:00
|
|
|
getTree,
|
|
|
|
load
|
2018-03-30 12:57:22 -04:00
|
|
|
};
|