3 Commits

Author	SHA1	Message	Date
Michael Eischer	fed33295c3	index: store indexEntries in hashed array tree ... This data structure reduces the wasted memory to O(sqrt(n)). The top-layer of the hashed array tree (HAT) also has a size of O(sqrt(n)), which makes it cache efficient. The top-layer should be small enough to easily fit into the CPU cache and thus only adds little overhead compared to directly accessing an index entry via a pointer.	2023-05-29 00:24:15 +02:00
Michael Eischer	b217f38ee7	index: Remove pointers from within indexentrys ... The indexEntry objects are now allocated in a separate array. References to an indexEntry are now stored as array indices. This has the benefit of allowing the garbage collector to ignore the indexEntry objects as these do not contain pointers and are part of a single large allocation.	2023-05-29 00:24:15 +02:00
Michael Eischer	2e3f1c08c5	repository: split index into a separate package	2022-10-08 21:15:34 +02:00