MCPcopy Create free account

hub / github.com/beling/bsuccinct-rs / functions

Functions1,609 in github.com/beling/bsuccinct-rs

⨍ Functions 1,609◇ Types & classes 258
↓ 2 callersMethodget_stats
(&self, key: &K, access_stats: &mut A)
ph/src/fmph/gofunction.rs:490
↓ 2 callersMethodget_stats
(&self, key: &K, access_stats: &mut A)
ph/src/fmph/function.rs:420
↓ 2 callersMethodget_unchecked
Returns an item with given `index`. The result is undefined if `index` is out of bounds.
cseq/src/wavelet_matrix.rs:231
↓ 2 callersMethodget_unchecked
(&self, fragment_nr: u32, degree: impl TreeDegree)
minimum_redundancy/src/code.rs:41
↓ 2 callersMethodhas_par_for_each_key
(&self)
ph/src/fmph/keyset.rs:143
↓ 2 callersMethodin_slice
(&self, key: u64, seed: u16)
ph/src/phast/conf.rs:126
↓ 2 callersMethodindex
Returns index of the value about to return by `next`.
cseq/src/elias_fano.rs:498
↓ 2 callersMethodinit_seed
(&self, vec: &mut [Self::VecElement], index: usize, seed: u16)
ph/src/seeds.rs:118
↓ 2 callersMethodinit_successive_bits
(&mut self, begin: &mut usize, v: u64, len: u8)
bitm/src/bitvec.rs:249
↓ 2 callersMethoditer
(&self, degree: D)
minimum_redundancy/src/code.rs:76
↓ 2 callersFunctionkphf_test
(f: &Perfect<C, SS, SeedKCore, S>, keys: &[K])
ph/src/phast/perfect.rs:360
↓ 2 callersFunctionkv_dominated_lo
Construct benchmark data with: - length `len`, - number of different values `different_values` (up to 256), - occurrence of each value except one is `
csf_benchmark/src/distribution.rs:114
↓ 2 callersFunctionkv_dominated_lo_entropy
(len: u32, mut different_values: u32, lo_count: u32)
csf_benchmark/src/distribution.rs:124
↓ 2 callersMethodlevel_size_groups_segments
(&self, desired_total_size: usize)
ph/src/fmph/goindexing.rs:181
↓ 2 callersMethodlevels
(&self)
internal/phast/src/phast.rs:9
↓ 2 callersFunctionlsmap_1bpv_conf
(conf: MapConf<BM>)
csf/src/ls/map.rs:330
↓ 2 callersFunctionlsmap_2bpv_conf
(conf: MapConf<BM>)
csf/src/ls/map.rs:348
↓ 2 callersFunctionlsmap_3bpv_conf
(conf: MapConf<BM>)
csf/src/ls/map.rs:367
↓ 2 callersMethodmany_tries
(&self)
internal/phast/src/conf.rs:294
↓ 2 callersMethodmax_size_segments
(&self, max_level_size: usize)
csf/src/fp/level_sizer.rs:44
↓ 2 callersMethodmaybe_par_map_each_key
(&self, map: M, retained_hint: P, use_mt: bool)
ph/src/fmph/keyset.rs:50
↓ 2 callersMethodmaybe_par_retain_keys
(&mut self, filter: F, retained_earlier: P, remove_count: R, use_mt: bool)
ph/src/fmph/keyset.rs:74
↓ 2 callersMethodmaybe_par_retain_keys_with_indices
(&mut self, index_filter: IF, filter: F, retained_earlier: P, remove_count: R, use_mt: bool)
ph/src/fmph/keyset.rs:111
↓ 2 callersMethodminimal_generic_f_core
(&self, num_of_keys: usize, bits_per_seed: u8, bucket_size_100: u16, preferred_slice_len: u16)
ph/src/phast/seed_chooser/mod.rs:163
↓ 2 callersMethodminimum
(&self, value_mask: u16)
csf/src/fp/collision_solver.rs:214
↓ 2 callersFunctionmix
(a: u64, b: u64)
ph/src/phast/conf.rs:24
↓ 2 callersMethodnew
Constructs [`SlicesMutSource`] with given `keys`, `values` and `bits_per_value` (which can be `0` for auto-detection)
csf/src/fp/kvset.rs:150
↓ 2 callersFunctionnew_cmph_io_struct_vector_adapter
(keys: &[K])
mphf_benchmark/src/cmph.rs:117
↓ 2 callersMethodnext
(&mut self)
csf/src/coding/mod.rs:140
↓ 2 callersMethodnum_of_slices
(&self)
ph/src/phast/conf.rs:227
↓ 2 callersMethodoccurrences
(&self)
minimum_redundancy/src/frequencies.rs:162
↓ 2 callersMethodoptimize_weights5
(&self, seed_chooser: SC)
internal/phast/src/conf.rs:499
↓ 2 callersMethodoptimize_weights_delta
(&self, seed_chooser: SC)
internal/phast/src/conf.rs:495
↓ 2 callersMethodpar_for_each_key
(&self, f: F, _retained_hint: P)
ph/src/fmph/keyset.rs:154
↓ 2 callersMethodpar_into_vec
(self, _retained_hint: P)
ph/src/fmph/keyset.rs:202
↓ 2 callersMethodpar_map_each_key
(&self, map: M, _retained_hint: P)
ph/src/fmph/keyset.rs:160
↓ 2 callersMethodpar_retain_keys
(&mut self, filter: F, _retained_earlier: P, remove_count: R)
ph/src/fmph/keyset.rs:172
↓ 2 callersMethodpeel_with_values
Returns a sequence of the graph edges *v0=(a0, b0, c0), v1=(a1, b1, c1), ... such that the vertex *ai* is not incident to the edge *vj* for all *j>i*.
csf/src/ls/graph3.rs:185
↓ 2 callersFunctionphf_test
(f: &Perfect<C, SS, SCC, S>, keys: &[K])
ph/src/phast/perfect.rs:354
↓ 2 callersMethodposition_at_unchecked
(&self, index: usize)
cseq/src/elias_fano.rs:366
↓ 2 callersMethodposition_next
(&self, position: &mut Position)
cseq/src/elias_fano.rs:207
↓ 2 callersMethodposition_next_unchecked
(&self, position: &mut Position)
cseq/src/elias_fano.rs:200
↓ 2 callersMethodposition_of
(&self, value: u64)
cseq/src/elias_fano.rs:415
↓ 2 callersMethodprint
(&self, x: &[f64])
internal/phast/src/optim.rs:100
↓ 2 callersMethodprint
(&self, tries: u32, key_num: u32, evals_per_try: u32, k: u16)
internal/phast/src/benchmark.rs:52
↓ 2 callersMethodprint_avg
(&self, conf: &Conf)
internal/phast/src/benchmark.rs:130
↓ 2 callersFunctionprint_input_stats
(setname: &str, strings: &[Box<[u8]>])
mphf_benchmark/src/stats.rs:97
↓ 2 callersMethodprint_try
(&self, try_nr: u32, conf: &Conf)
internal/phast/src/benchmark.rs:123
↓ 2 callersMethodrand_gen
Returns random number generator.
cseq_benchmark/src/main.rs:526
↓ 2 callersFunctionrank
(c: &mut Criterion)
bitm/benches/rank_select.rs:4
↓ 2 callersMethodrank_unchecked
(&self, index: usize)
bitm/src/rank_select/mod.rs:232
↓ 2 callersMethodremove_edge
(&mut self, v0: usize, v1: usize)
csf/src/ls/graph3.rs:63
↓ 2 callersMethodretain_keys
(&mut self, mut filter: F/*, _retained_earlier: P, _remove_count: R*/)
csf/src/fp/kvset.rs:185
↓ 2 callersMethodreverse_code
(&self, codeword: &mut Code)
minimum_redundancy/src/lib.rs:265
↓ 2 callersMethodreversed_codes_for_values
Returns a map from (clones of) values to their reversed codes.
minimum_redundancy/src/lib.rs:334
↓ 2 callersMethodreversed_codes_for_values_array
Returns array indexed by values that contains their reversed codes.
minimum_redundancy/src/lib.rs:363
↓ 2 callersMethodselect0_unchecked
(&self, rank: usize)
bitm/src/rank_select/mod.rs:209
↓ 2 callersFunctionset_bit_to
(to_change: &mut u64, bit_nr: usize, value: bool)
bitm/src/bitvec.rs:541
↓ 2 callersFunctionshifts0
(keys: &'k [u64], conf: &'c C)
ph/src/phast/seed_chooser/shift.rs:16
↓ 2 callersMethodsize_bytes_dyn
(&self)
dyn_size_of/src/lib.rs:46
↓ 2 callersMethodsize_segments_for_values
(&self, mut values: F, values_len: usize, bits_per_value: u8)
csf/src/fp/level_sizer.rs:155
↓ 2 callersMethodslice_len
(&self, output_range: usize, bits_per_seed: u8, preferred_slice_len: u16)
ph/src/phast/seed_chooser/shift_wrap.rs:84
↓ 2 callersMethodslice_len
Returns slice length suitable to given `output_range`, `bits_per_seed` and `preferred_slice_len`. Usually it returns `preferred_slice_len` (if its no
ph/src/phast/seed_chooser/mod.rs:63
↓ 2 callersFunctionspace_lower_bound
Returns approximation of lower bound of space (in bits/key) needed to represent minimal `k`-perfect function.
ph/src/phast/seed_chooser/utils.rs:58
↓ 2 callersMethodspan_end
(&self)
ph/src/phast/builder.rs:529
↓ 2 callersFunctiontest_fpcmap_invariants
(fpmap: &GOCMap<C, GS, SS>)
csf/src/fp/gocmap/mod.rs:397
↓ 2 callersFunctiontest_fpmap_invariants
(fpmap: &CMap<C>)
csf/src/fp/cmap/mod.rs:330
↓ 2 callersFunctiontest_kmphf
(k: u16, mphf_keys: &[K], kmphf: G)
ph/src/utils.rs:67
↓ 2 callersFunctiontest_primitive
(v: T)
dyn_size_of/src/lib.rs:180
↓ 2 callersFunctiontest_read_write
(fpmap: &CMap<C>)
csf/src/fp/cmap/mod.rs:321
↓ 2 callersFunctiontest_read_write
(fpmap: &GOCMap<C, GS, SS>)
csf/src/fp/gocmap/mod.rs:384
↓ 2 callersFunctiontest_read_write
(h: &KFunction::<C, SS>)
ph/src/phast/kfunction.rs:346
↓ 2 callersFunctiontest_read_write
(h: &Function2::<C, SS>)
ph/src/phast/function2.rs:425
↓ 2 callersFunctiontest_read_write
(h: &Function::<C, SS>)
ph/src/phast/function.rs:531
↓ 2 callersMethodto_collision_array
(self)
csf/src/fp/collision_solver.rs:114
↓ 2 callersMethodtry_count_in_range
Returns the number of `item` occurrences in the given `range`, or [`None`] if `range` is out of bounds.
cseq/src/wavelet_matrix.rs:256
↓ 2 callersMethodtry_select
(&self, rank: usize, len: usize)
cseq/src/wavelet_matrix.rs:78
↓ 2 callersMethodtry_select0
(&self, rank: usize, len: usize)
cseq/src/wavelet_matrix.rs:84
↓ 2 callersMethodvalidate
Panics if the configuration is incorrect.
ph/src/fmph/gofunction.rs:111
↓ 2 callersMethodvalue
Returns the current value of the sum. The complexities are: - time: from *O(1)* (optimistic) to *O(n)* (pessimistic), where *n* is the number of valu
fsum/src/lib.rs:140
↓ 2 callersMethodvalue_at_position
(&self, position: Position)
cseq/src/elias_fano.rs:231
↓ 2 callersFunctionverify_queue
(text: &[u8], compressed_text: Box<[u64]>, coding: &Coding<u8>, total_size_bits: usize)
coding_benchmark/src/minimum_redundancy.rs:104
↓ 2 callersFunctionverify_stack
(text: &[u8], compressed_text: Box<[u64]>, coding: &Coding<u8>, total_size_bits: usize)
coding_benchmark/src/minimum_redundancy.rs:110
↓ 2 callersMethodwrite
Writes `self` to the `output`.
cseq/src/elias_fano.rs:279
↓ 2 callersMethodwrite
Writes `self` to the `output`.
ph/src/fmph/function.rs:468
↓ 2 callersMethodwrite_internal_nodes_count
Writes `internal_nodes_count` to `output` as the following `internal_nodes_count.len()`, VByte values: `internal_nodes_count.len()-1` (=l), `internal_
minimum_redundancy/src/lib.rs:187
↓ 2 callersMethodwrite_values
Writes `values` to the given `output`, using `write_value` to write each value.
minimum_redundancy/src/lib.rs:213
↓ 1 callersMethodadd_all
Increases the sum by all values from `iter`. Returns `self`. # Example ``` use fsum::FSum; assert_eq!(FSum::new().add_all((0..10).map(|_| 0.1)).val
fsum/src/lib.rs:118
↓ 1 callersMethodadd_data
(&'_ self, mut add: F)
cseq_benchmark/src/main.rs:452
↓ 1 callersMethodadd_occurences_of
Calls [`Self::add_occurrence_of`] for all items exposed by `iter`.
minimum_redundancy/src/frequencies.rs:88
↓ 1 callersMethodadd_occurrence_of
(&mut self, value: Value)
minimum_redundancy/src/frequencies.rs:164
↓ 1 callersMethodadd_used
(&self, free_values: &mut Self::UsedValues, value: usize)
ph/src/phast/seed_chooser/k.rs:371
↓ 1 callersMethodas_f64
(self)
minimum_redundancy/src/frequencies.rs:23
↓ 1 callersFunctionbenchmark
Builds, tests, and returns MPHF.
mphf_benchmark/src/builder.rs:135
↓ 1 callersFunctionbenchmark
(conf: &super::Conf)
cseq_benchmark/src/elias_fano.rs:7
↓ 1 callersFunctionbenchmark_build
Builds MPHF and measure the time of building. Returns: MPHF, and either single-thread and multiple-thread time of building, and one NaN.
mphf_benchmark/src/builder.rs:82
↓ 1 callersMethodbest_seed
(&mut self, bucket_nr: usize)
ph/src/phast/builder.rs:522
↓ 1 callersFunctionbest_seed_k
(k: u16, seed_chooser: &SC, seed_evaluator: &SE, best_value: &mut SE::Value, best_seed: &mut u16, free_values:
ph/src/phast/seed_chooser/k.rs:333
↓ 1 callersMethodbit_iter
(&'_ self)
bitm/src/bitvec.rs:624
↓ 1 callersMethodbit_zeros
(&'_ self)
bitm/src/bitvec.rs:620
← previousnext →401–500 of 1,609, ranked by callers