mirror of
				https://github.com/zadam/trilium.git
				synced 2025-10-31 03:29:02 +01:00 
			
		
		
		
	faster content hash computation via in memory sorting
This commit is contained in:
		
							parent
							
								
									a9a9edf658
								
							
						
					
					
						commit
						620e896a89
					
				| @ -13,8 +13,10 @@ 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}`); | ||||
|         + (whereBranch ? ` WHERE ${whereBranch} ` : '')); | ||||
| 
 | ||||
|     // sorting is faster in memory
 | ||||
|     hashes.sort((a, b) => a.id < b.id ? -1 : 1); | ||||
| 
 | ||||
|     const map = {}; | ||||
| 
 | ||||
|  | ||||
		Loading…
	
	
			
			x
			
			
		
	
		Reference in New Issue
	
	Block a user
	 zadam
						zadam