mirror of
https://github.com/zadam/trilium.git
synced 2025-02-24 06:54:44 +08:00
faster content hash computation via in memory sorting
This commit is contained in:
parent
a9a9edf658
commit
620e896a89
1 changed files with 5 additions and 3 deletions
|
@ -12,9 +12,11 @@ const RecentNote = require('../entities/recent_note');
|
|||
const Option = require('../entities/option');
|
||||
|
||||
function getSectorHashes(tableName, primaryKeyName, whereBranch) {
|
||||
const hashes = sql.getRows(`SELECT ${primaryKeyName} AS id, hash FROM ${tableName} `
|
||||
+ (whereBranch ? `WHERE ${whereBranch} ` : '')
|
||||
+ ` ORDER BY ${primaryKeyName}`);
|
||||
const hashes = sql.getRows(`SELECT ${primaryKeyName} AS id, hash FROM ${tableName}`
|
||||
+ (whereBranch ? ` WHERE ${whereBranch} ` : ''));
|
||||
|
||||
// sorting is faster in memory
|
||||
hashes.sort((a, b) => a.id < b.id ? -1 : 1);
|
||||
|
||||
const map = {};
|
||||
|
||||
|
|
Loading…
Reference in a new issue