gaschz/trilium
1
0
Fork 0
mirror of https://github.com/zadam/trilium.git synced 2025-03-01 14:22:32 +01:00
Code Issues Actions Packages Projects Releases Wiki Activity

better algorithm to find note if note path is invalid

Browse Source
This commit is contained in:
azivner 2017-11-30 00:02:32 -05:00
parent d0a0366b05
commit 7c7a5f19f5
1 changed files with 11 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

22
public/javascripts/note_tree.js
View File

@ -191,8 +191,11 @@ const noteTree = (function() {
let i = 0;
while (true) {
const parentNoteId = i < path.length ? path[i] : null;
i++;
if (i >= path.length) {
break;
}
const parentNoteId = path[i++];
if (childNoteId !== null) {
const parents = childToParents[childNoteId];
@ -202,20 +205,17 @@ const noteTree = (function() {
return;
}
if (parentNoteId === null || !parents.includes(parentNoteId)) {
if (!parents.includes(parentNoteId)) {
console.log("Did not find parent " + parentNoteId + " for child " + childNoteId);
if (parents.length > 0) {
if (parents[0] === 'root') {
console.log("Reached root.");
break;
const pathToRoot = getSomeNotePath(parents[0]).split("/").reverse();
for (const noteId of pathToRoot) {
effectivePath.push(noteId);
}
childNoteId = parents[0];
effectivePath.push(childNoteId);
console.log("Choosing parent " + childNoteId + " instead.");
continue;
break;
}
else {
console.log("No parents, can't activate node.");