|
|
|
@ -1,7 +1,7 @@
|
|
|
|
"use strict";
|
|
|
|
"use strict";
|
|
|
|
|
|
|
|
|
|
|
|
const treeChanges = (function() {
|
|
|
|
const treeChanges = (function() {
|
|
|
|
async function moveBeforeNode(node, beforeNode) {
|
|
|
|
async function moveBeforeNode(node, beforeNode, changeInPath = true) {
|
|
|
|
await $.ajax({
|
|
|
|
await $.ajax({
|
|
|
|
url: baseApiUrl + 'notes/' + node.data.note_tree_id + '/moveBefore/' + beforeNode.data.note_tree_id,
|
|
|
|
url: baseApiUrl + 'notes/' + node.data.note_tree_id + '/moveBefore/' + beforeNode.data.note_tree_id,
|
|
|
|
type: 'PUT',
|
|
|
|
type: 'PUT',
|
|
|
|
@ -10,10 +10,14 @@ const treeChanges = (function() {
|
|
|
|
|
|
|
|
|
|
|
|
node.moveTo(beforeNode, 'before');
|
|
|
|
node.moveTo(beforeNode, 'before');
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
if (changeInPath) {
|
|
|
|
|
|
|
|
recentNotes.removeRecentNote(noteTree.getCurrentNotePath());
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
noteTree.setCurrentNotePathToHash(node);
|
|
|
|
noteTree.setCurrentNotePathToHash(node);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
async function moveAfterNode(node, afterNode) {
|
|
|
|
async function moveAfterNode(node, afterNode, changeInPath = true) {
|
|
|
|
await $.ajax({
|
|
|
|
await $.ajax({
|
|
|
|
url: baseApiUrl + 'notes/' + node.data.note_tree_id + '/moveAfter/' + afterNode.data.note_tree_id,
|
|
|
|
url: baseApiUrl + 'notes/' + node.data.note_tree_id + '/moveAfter/' + afterNode.data.note_tree_id,
|
|
|
|
type: 'PUT',
|
|
|
|
type: 'PUT',
|
|
|
|
@ -22,6 +26,10 @@ const treeChanges = (function() {
|
|
|
|
|
|
|
|
|
|
|
|
node.moveTo(afterNode, 'after');
|
|
|
|
node.moveTo(afterNode, 'after');
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
if (changeInPath) {
|
|
|
|
|
|
|
|
recentNotes.removeRecentNote(noteTree.getCurrentNotePath());
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
noteTree.setCurrentNotePathToHash(node);
|
|
|
|
noteTree.setCurrentNotePathToHash(node);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
@ -55,6 +63,8 @@ const treeChanges = (function() {
|
|
|
|
toNode.folder = true;
|
|
|
|
toNode.folder = true;
|
|
|
|
toNode.renderTitle();
|
|
|
|
toNode.renderTitle();
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
recentNotes.removeRecentNote(noteTree.getCurrentNotePath());
|
|
|
|
|
|
|
|
|
|
|
|
noteTree.setCurrentNotePathToHash(node);
|
|
|
|
noteTree.setCurrentNotePathToHash(node);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
@ -88,7 +98,7 @@ const treeChanges = (function() {
|
|
|
|
node.getParent().renderTitle();
|
|
|
|
node.getParent().renderTitle();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
recentNotes.removeRecentNote(node.note_tree_id);
|
|
|
|
recentNotes.removeRecentNote(noteTree.getCurrentNotePath());
|
|
|
|
|
|
|
|
|
|
|
|
let next = node.getNextSibling();
|
|
|
|
let next = node.getNextSibling();
|
|
|
|
if (!next) {
|
|
|
|
if (!next) {
|
|
|
|
@ -103,24 +113,25 @@ const treeChanges = (function() {
|
|
|
|
noteTree.setCurrentNotePathToHash(next);
|
|
|
|
noteTree.setCurrentNotePathToHash(next);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
async function moveNodeUp(node) {
|
|
|
|
async function moveNodeUpInHierarchy(node) {
|
|
|
|
if (node.getParent() !== null) {
|
|
|
|
if (node.getParent() === null) {
|
|
|
|
$.ajax({
|
|
|
|
return;
|
|
|
|
url: baseApiUrl + 'notes/' + node.data.note_tree_id + '/moveAfter/' + node.getParent().data.note_tree_id,
|
|
|
|
}
|
|
|
|
type: 'PUT',
|
|
|
|
|
|
|
|
contentType: "application/json",
|
|
|
|
await $.ajax({
|
|
|
|
success: () => {
|
|
|
|
url: baseApiUrl + 'notes/' + node.data.note_tree_id + '/moveAfter/' + node.getParent().data.note_tree_id,
|
|
|
|
if (node.getParent() !== null && node.getParent().getChildren().length <= 1) {
|
|
|
|
type: 'PUT',
|
|
|
|
node.getParent().folder = false;
|
|
|
|
contentType: "application/json",
|
|
|
|
node.getParent().renderTitle();
|
|
|
|
});
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
if (node.getParent() !== null && node.getParent().getChildren().length <= 1) {
|
|
|
|
node.moveTo(node.getParent(), 'after');
|
|
|
|
node.getParent().folder = false;
|
|
|
|
|
|
|
|
node.getParent().renderTitle();
|
|
|
|
noteTree.setCurrentNotePathToHash(node);
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
});
|
|
|
|
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
node.moveTo(node.getParent(), 'after');
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
noteTree.setCurrentNotePathToHash(node);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
return {
|
|
|
|
return {
|
|
|
|
@ -128,7 +139,7 @@ const treeChanges = (function() {
|
|
|
|
moveAfterNode,
|
|
|
|
moveAfterNode,
|
|
|
|
moveToNode,
|
|
|
|
moveToNode,
|
|
|
|
deleteNode,
|
|
|
|
deleteNode,
|
|
|
|
moveNodeUp,
|
|
|
|
moveNodeUpInHierarchy,
|
|
|
|
cloneNoteAfter,
|
|
|
|
cloneNoteAfter,
|
|
|
|
cloneNoteTo
|
|
|
|
cloneNoteTo
|
|
|
|
};
|
|
|
|
};
|
|
|
|
|