mirror of
				https://github.com/zadam/trilium.git
				synced 2025-11-04 13:39:01 +01:00 
			
		
		
		
	keep sorting for content hash computation backwards compatible
This commit is contained in:
		
							parent
							
								
									17a6c94f66
								
							
						
					
					
						commit
						b6b6d11ef7
					
				@ -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…
	
	
			
			x
			
			
		
	
		Reference in New Issue
	
	Block a user