mirror of
https://github.com/zadam/trilium.git
synced 2025-02-24 23:13:43 +08:00
keep sorting for content hash computation backwards compatible
This commit is contained in:
parent
17a6c94f66
commit
b6b6d11ef7
1 changed files with 1 additions and 1 deletions
|
@ -37,7 +37,7 @@ function getEntityHashes() {
|
|||
|
||||
// sorting is faster in memory
|
||||
// sorting by entityId is enough, hashes will be segmented by entityName later on anyway
|
||||
hashRows.sort((a, b) => a[0] < b[0] ? -1 : 1);
|
||||
hashRows.sort((a, b) => a[1] < b[1] ? -1 : 1);
|
||||
|
||||
const hashMap = {};
|
||||
|
||||
|
|
Loading…
Reference in a new issue