substack
bec900d97e
changes to not buffer results in memory while preserving existing api
5 yıl önce
Johannes Hofmann
31a48ba07f
Use binary search for inner loop in IndexedReader
This adds at least one memory allocation (`collect` into a `Vec`) but is still faster for a reasonable number of IDs.
5 yıl önce
Johannes Hofmann
bd0846d555
Use BTreeSet to check node IDs in IndexedReader
There is a performance penalty (+13%) but this collection enables cheap
deletions.
5 yıl önce
Johannes Hofmann
5290c2041b
Extract reading headers to speed up index creation
When creating an index (`IndexedReader::create_index`) the unused `Blob`s are not copied into memory, which really improves performance for this operation (5x faster).
5 yıl önce
Johannes Hofmann
e5fd662654
Add IndexedReader
This allows filtering elements and finding their dependencies by
decoding as few blobs as possible.
5 yıl önce