keep sorting for content hash computation backwards compatible

This commit is contained in:
zadam 2021-07-25 10:58:50 +02:00
parent 17a6c94f66
commit b6b6d11ef7

View file

@ -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 = {};