mirror of
https://github.com/zadam/trilium.git
synced 2025-03-01 14:22:32 +01:00
229 lines
7.6 KiB
JavaScript
229 lines
7.6 KiB
JavaScript
"use strict";
|
|
|
|
const sql = require('../../services/sql');
|
|
const utils = require('../../services/utils');
|
|
const entityChangesService = require('../../services/entity_changes');
|
|
const treeService = require('../../services/tree');
|
|
const noteService = require('../../services/notes');
|
|
const becca = require('../../becca/becca');
|
|
const TaskContext = require('../../services/task_context');
|
|
const branchService = require("../../services/branches");
|
|
const log = require("../../services/log");
|
|
const ValidationError = require("../../errors/validation_error");
|
|
|
|
/**
|
|
* Code in this file deals with moving and cloning branches. The relationship between note and parent note is unique
|
|
* for not deleted branches. There may be multiple deleted note-parent note relationships.
|
|
*/
|
|
|
|
function moveBranchToParent(req) {
|
|
const {branchId, parentBranchId} = req.params;
|
|
|
|
const parentBranch = becca.getBranch(parentBranchId);
|
|
const branchToMove = becca.getBranch(branchId);
|
|
|
|
if (!parentBranch || !branchToMove) {
|
|
throw new ValidationError(`One or both branches '${branchId}', '${parentBranchId}' have not been found`);
|
|
}
|
|
|
|
return branchService.moveBranchToBranch(branchToMove, parentBranch, branchId);
|
|
}
|
|
|
|
function moveBranchBeforeNote(req) {
|
|
const {branchId, beforeBranchId} = req.params;
|
|
|
|
const branchToMove = becca.getBranchOrThrow(branchId);
|
|
const beforeBranch = becca.getBranchOrThrow(beforeBranchId);
|
|
|
|
const validationResult = treeService.validateParentChild(beforeBranch.parentNoteId, branchToMove.noteId, branchId);
|
|
|
|
if (!validationResult.success) {
|
|
return [200, validationResult];
|
|
}
|
|
|
|
const originalBeforeNotePosition = beforeBranch.notePosition;
|
|
|
|
// we don't change utcDateModified so other changes are prioritized in case of conflict
|
|
// also we would have to sync all those modified branches otherwise hash checks would fail
|
|
|
|
sql.execute("UPDATE branches SET notePosition = notePosition + 10 WHERE parentNoteId = ? AND notePosition >= ? AND isDeleted = 0",
|
|
[beforeBranch.parentNoteId, originalBeforeNotePosition]);
|
|
|
|
// also need to update becca positions
|
|
const parentNote = becca.getNote(beforeBranch.parentNoteId);
|
|
|
|
for (const childBranch of parentNote.getChildBranches()) {
|
|
if (childBranch.notePosition >= originalBeforeNotePosition) {
|
|
childBranch.notePosition += 10;
|
|
}
|
|
}
|
|
|
|
if (branchToMove.parentNoteId === beforeBranch.parentNoteId) {
|
|
branchToMove.notePosition = originalBeforeNotePosition;
|
|
branchToMove.save();
|
|
}
|
|
else {
|
|
const newBranch = branchToMove.createClone(beforeBranch.parentNoteId, originalBeforeNotePosition);
|
|
newBranch.save();
|
|
|
|
branchToMove.markAsDeleted();
|
|
}
|
|
|
|
treeService.sortNotesIfNeeded(parentNote.noteId);
|
|
|
|
// if sorting is not needed, then still the ordering might have changed above manually
|
|
entityChangesService.addNoteReorderingEntityChange(parentNote.noteId);
|
|
|
|
log.info(`Moved note ${branchToMove.noteId}, branch ${branchId} before note ${beforeBranch.noteId}, branch ${beforeBranchId}`);
|
|
|
|
return { success: true };
|
|
}
|
|
|
|
function moveBranchAfterNote(req) {
|
|
const {branchId, afterBranchId} = req.params;
|
|
|
|
const branchToMove = becca.getBranch(branchId);
|
|
const afterNote = becca.getBranch(afterBranchId);
|
|
|
|
const validationResult = treeService.validateParentChild(afterNote.parentNoteId, branchToMove.noteId, branchId);
|
|
|
|
if (!validationResult.success) {
|
|
return [200, validationResult];
|
|
}
|
|
|
|
const originalAfterNotePosition = afterNote.notePosition;
|
|
|
|
// we don't change utcDateModified so other changes are prioritized in case of conflict
|
|
// also we would have to sync all those modified branches otherwise hash checks would fail
|
|
sql.execute("UPDATE branches SET notePosition = notePosition + 10 WHERE parentNoteId = ? AND notePosition > ? AND isDeleted = 0",
|
|
[afterNote.parentNoteId, originalAfterNotePosition]);
|
|
|
|
// also need to update becca positions
|
|
const parentNote = becca.getNote(afterNote.parentNoteId);
|
|
|
|
for (const childBranch of parentNote.getChildBranches()) {
|
|
if (childBranch.notePosition > originalAfterNotePosition) {
|
|
childBranch.notePosition += 10;
|
|
}
|
|
}
|
|
|
|
const movedNotePosition = originalAfterNotePosition + 10;
|
|
|
|
if (branchToMove.parentNoteId === afterNote.parentNoteId) {
|
|
branchToMove.notePosition = movedNotePosition;
|
|
branchToMove.save();
|
|
}
|
|
else {
|
|
const newBranch = branchToMove.createClone(afterNote.parentNoteId, movedNotePosition);
|
|
newBranch.save();
|
|
|
|
branchToMove.markAsDeleted();
|
|
}
|
|
|
|
treeService.sortNotesIfNeeded(parentNote.noteId);
|
|
|
|
// if sorting is not needed, then still the ordering might have changed above manually
|
|
entityChangesService.addNoteReorderingEntityChange(parentNote.noteId);
|
|
|
|
log.info(`Moved note ${branchToMove.noteId}, branch ${branchId} after note ${afterNote.noteId}, branch ${afterBranchId}`);
|
|
|
|
return { success: true };
|
|
}
|
|
|
|
function setExpanded(req) {
|
|
const {branchId} = req.params;
|
|
const expanded = parseInt(req.params.expanded);
|
|
|
|
if (branchId !== 'none_root') {
|
|
sql.execute("UPDATE branches SET isExpanded = ? WHERE branchId = ?", [expanded, branchId]);
|
|
// we don't sync expanded label
|
|
// also this does not trigger updates to the frontend, this would trigger too many reloads
|
|
|
|
const branch = becca.branches[branchId];
|
|
|
|
if (branch) {
|
|
branch.isExpanded = !!expanded;
|
|
}
|
|
}
|
|
}
|
|
|
|
function setExpandedForSubtree(req) {
|
|
const {branchId} = req.params;
|
|
const expanded = parseInt(req.params.expanded);
|
|
|
|
let branchIds = sql.getColumn(`
|
|
WITH RECURSIVE
|
|
tree(branchId, noteId) AS (
|
|
SELECT branchId, noteId FROM branches WHERE branchId = ?
|
|
UNION
|
|
SELECT branches.branchId, branches.noteId FROM branches
|
|
JOIN tree ON branches.parentNoteId = tree.noteId
|
|
WHERE branches.isDeleted = 0
|
|
)
|
|
SELECT branchId FROM tree`, [branchId]);
|
|
|
|
// root is always expanded
|
|
branchIds = branchIds.filter(branchId => branchId !== 'none_root');
|
|
|
|
sql.executeMany(`UPDATE branches SET isExpanded = ${expanded} WHERE branchId IN (???)`, branchIds);
|
|
|
|
for (const branchId of branchIds) {
|
|
const branch = becca.branches[branchId];
|
|
|
|
if (branch) {
|
|
branch.isExpanded = !!expanded;
|
|
}
|
|
}
|
|
|
|
return {
|
|
branchIds
|
|
};
|
|
}
|
|
|
|
function deleteBranch(req) {
|
|
const last = req.query.last === 'true';
|
|
const eraseNotes = req.query.eraseNotes === 'true';
|
|
const branch = becca.getBranchOrThrow(req.params.branchId);
|
|
|
|
const taskContext = TaskContext.getInstance(req.query.taskId, 'deleteNotes');
|
|
|
|
const deleteId = utils.randomString(10);
|
|
let noteDeleted;
|
|
|
|
if (eraseNotes) {
|
|
// erase automatically means deleting all clones + note itself
|
|
branch.getNote().deleteNote(deleteId, taskContext);
|
|
noteService.eraseNotesWithDeleteId(deleteId);
|
|
noteDeleted = true;
|
|
} else {
|
|
noteDeleted = branch.deleteBranch(deleteId, taskContext);
|
|
}
|
|
|
|
if (last) {
|
|
taskContext.taskSucceeded();
|
|
}
|
|
|
|
return {
|
|
noteDeleted: noteDeleted
|
|
};
|
|
}
|
|
|
|
function setPrefix(req) {
|
|
const branchId = req.params.branchId;
|
|
const prefix = utils.isEmptyOrWhitespace(req.body.prefix) ? null : req.body.prefix;
|
|
|
|
const branch = becca.getBranch(branchId);
|
|
branch.prefix = prefix;
|
|
branch.save();
|
|
}
|
|
|
|
module.exports = {
|
|
moveBranchToParent,
|
|
moveBranchBeforeNote,
|
|
moveBranchAfterNote,
|
|
setExpanded,
|
|
setExpandedForSubtree,
|
|
deleteBranch,
|
|
setPrefix
|
|
};
|