trilium/src/entities/branch.js

75 lines
2.5 KiB
JavaScript
Raw Normal View History

2018-03-25 09:39:15 +08:00
"use strict";
const Entity = require('./entity');
2018-04-03 08:46:46 +08:00
const dateUtils = require('../services/date_utils');
2018-04-01 11:08:22 +08:00
const repository = require('../services/repository');
const sql = require('../services/sql');
2018-03-25 09:39:15 +08:00
2018-08-23 05:37:06 +08:00
/**
* Branch represents note's placement in the tree - it's essentially pair of noteId and parentNoteId.
* Each note can have multiple (at least one) branches, meaning it can be placed into multiple places in the tree.
*
2019-11-09 16:36:08 +08:00
* @property {string} branchId - primary key
* @property {string} noteId
* @property {string} parentNoteId
* @property {int} notePosition
* @property {string} prefix
* @property {boolean} isExpanded
* @property {boolean} isDeleted
2020-01-03 17:48:36 +08:00
* @property {string|null} deleteId - ID identifying delete transaction
2019-11-09 16:36:08 +08:00
* @property {string} utcDateModified
* @property {string} utcDateCreated
2018-08-23 05:37:06 +08:00
*
* @extends Entity
*/
2018-03-25 09:39:15 +08:00
class Branch extends Entity {
static get entityName() { return "branches"; }
2018-03-25 09:39:15 +08:00
static get primaryKeyName() { return "branchId"; }
2018-05-23 10:22:15 +08:00
// notePosition is not part of hash because it would produce a lot of updates in case of reordering
2020-01-03 17:48:36 +08:00
static get hashedProperties() { return ["branchId", "noteId", "parentNoteId", "isDeleted", "deleteId", "prefix"]; }
2018-04-01 10:15:06 +08:00
2018-09-03 15:40:22 +08:00
/** @returns {Note|null} */
2018-04-01 11:08:22 +08:00
async getNote() {
return await repository.getEntity("SELECT * FROM notes WHERE noteId = ?", [this.noteId]);
}
async beforeSaving() {
if (this.notePosition === undefined) {
const maxNotePos = await sql.getValue('SELECT MAX(notePosition) FROM branches WHERE parentNoteId = ? AND isDeleted = 0', [this.parentNoteId]);
2019-10-19 18:36:16 +08:00
this.notePosition = maxNotePos === null ? 0 : maxNotePos + 10;
}
if (!this.isExpanded) {
this.isExpanded = false;
}
2018-04-02 05:38:24 +08:00
if (!this.isDeleted) {
this.isDeleted = false;
}
2019-03-13 03:58:31 +08:00
if (!this.utcDateCreated) {
this.utcDateCreated = dateUtils.utcNowDateTime();
2018-05-27 00:38:25 +08:00
}
super.beforeSaving();
if (this.isChanged) {
this.utcDateModified = dateUtils.utcNowDateTime();
}
2018-04-01 10:15:06 +08:00
}
createClone(parentNoteId, notePosition) {
return new Branch({
noteId: this.noteId,
parentNoteId: parentNoteId,
notePosition: notePosition,
prefix: this.prefix,
isExpanded: this.isExpanded,
isDeleted: false,
utcDateCreated: this.utcDateCreated,
utcDateModified: this.utcDateModified
});
}
2018-03-25 09:39:15 +08:00
}
module.exports = Branch;