 |
Pixie
|
|
Pixie
|
| ▼ include | |
| ▼ pixie | |
| ▼ detail | |
| byte_histogram.h | Dependency-reduced histogram construction for byte streams |
| serialization.h | |
| ▼ experimental | |
| excess.h | |
| grouped_slot_order256.h | Single-node 16x16 child-order experiment |
| permuted_bit_block.h | |
| power_of_two_sequence.h | Experimental packed sequence with configurable storage policies |
| power_of_two_value_block.h | |
| select.h | |
| sequence_tree_policy.h | |
| slot_order.h | Experimental split-bit and byte orders for 32/64 physical slots |
| slot_order16.h | Packed ordering primitive for the intermediate-node experiment |
| ▼ file_archive | |
| implementations.h | Native Pixie storage-backed file-archive types |
| ▼ integer_vector | |
| implementations.h | All integer-vector implementations provided by Pixie |
| monotone.h | Validated monotone adapters for immutable integer vectors |
| packed.h | Runtime-width packed immutable integer vectors |
| packed_monotone.h | Monotone integer vectors backed by runtime-width packing |
| ▼ io | |
| file_output_sink.h | |
| mapped_file.h | |
| ▼ permutations | |
| ► detail | |
| immer_sequence.h | Optional by-value permutable sequence backed by pinned Immer |
| permutation.h | |
| permutation_implementations.h | Production permutation catalog for benchmarks |
| sequence.h | |
| sequence_implementations.h | Production permutable-sequence catalog for benchmarks |
| sorted_sequence.h | Sorted owning wrapper over a permutable sequence |
| sorted_vector.h | Sorted logical vector backed by append-only values and a permutation |
| ▼ rank_select | |
| ► detail | |
| ► experimental | |
| compressed.h | Compressed rank/select support with metadata-validated source prefetch |
| implementations.h | All rank/select support implementations provided by Pixie |
| orzo.h | |
| pasta.h | |
| sdsl.h | |
| succinct_bitvec.h | |
| support.h | |
| three_star.h | |
| ▼ rmm | |
| btree.h | |
| implementations.h | All RmM implementations provided or adapted by Pixie |
| sdsl.h | |
| tree.h | |
| ▼ rmq | |
| ► utils | |
| cartesian_hybrid_btree.h | |
| cartesian_rmm.h | |
| hybrid_btree.h | |
| implementations.h | All RMQ implementations provided by Pixie and their benchmark comparison |
| sdsl_sct.h | |
| segment_tree.h | |
| sparse_table.h | |
| ▼ storage | |
| aligned.h | |
| implementations.h | Catalog of Pixie storage implementations |
| read_only_view.h | |
| sliding_window.h | Fixed-capacity ring-backed sliding byte storage |
| ▼ tree | |
| bp.h | |
| dfuds.h | |
| implementations.h | All rooted ordered-tree encodings provided by Pixie |
| louds.h | |
| ▼ wavelet_tree | |
| ► detail | |
| implementations.h | All wavelet-tree implementations provided by Pixie |
| index.h | |
| bits.h | |
| file_archive.h | Self-contained byte-oriented file archives with line extraction |
| integer_vector.h | Common interfaces for immutable positional integer vectors |
| memory_usage.h | |
| packed_bit_builder.h | |
| permutable_sequence.h | Lightweight immutable-read permutable-sequence CRTP contract |
| permutation.h | Lightweight permutation CRTP contract |
| rank_select.h | Common interface for rank/select support over packed bit sequences |
| rmm.h | Common interface for rank/select and range min-max indexes |
| rmq.h | Common interface for static range-minimum-query indexes |
| sequence_options.h | Shared compile-time sequence tuning options |
| serialization.h | Checked byte-oriented binary serialization primitives |
| split_span.h | Allocation-free logical ranges split across at most two spans |
| storage.h | Common interface for byte-addressable storage |
| tree.h | Common interface and node handle for rooted ordered trees |
| utils.h | |
| wavelet_tree.h | Common interface for wavelet-tree indexes |
| ▼ references | |
| naive_rmm_tree.h |
1.13.2