mirror of
https://github.com/zadam/trilium.git
synced 2025-10-26 07:46:30 +01:00
keep sorting for content hash computation backwards compatible
This commit is contained in:
@@ -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 = {};
|
||||
|
||||
|
||||
Reference in New Issue
Block a user