mirrors
/
restic
mirror of https://github.com/restic/restic.git
2
0
Fork 0
Code Issues Projects Releases Wiki Activity
restic/internal/index
History
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
..
index.go index: Optimize generatePackList 2023-01-14 20:41:07 +01:00
index_parallel.go repository: Reuse buffers in Repository.LoadUnpacked 2023-01-30 22:01:01 +01:00
index_parallel_test.go repository: split index into a separate package 2022-10-08 21:15:34 +02:00
index_test.go index: Optimize generatePackList 2023-01-14 20:41:07 +01:00
indexmap.go index: store indexEntries in hashed array tree 2023-05-29 00:24:15 +02:00
indexmap_test.go repository: split index into a separate package 2022-10-08 21:15:34 +02:00
master_index.go repository: split index into a separate package 2022-10-08 21:15:34 +02:00
master_index_test.go index: add garbage collection benchmark 2023-05-29 00:23:04 +02:00
testing.go repository: split index into a separate package 2022-10-08 21:15:34 +02:00