MCPcopy Create free account

hub / github.com/cloudflare/trie-hard / functions

Functions63 in github.com/cloudflare/trie-hard

↓ 31 callersMethoditer
Create an iterator over the entire trie. Emitted items will be ordered by their keys ``` # use trie_hard::TrieHard; let trie = ["dad", "ant", "and",
src/lib.rs:292
↓ 7 callersFunctionget_big_text
()
benches/divan_bench.rs:194
↓ 7 callersFunctionget_header_text
()
benches/divan_bench.rs:210
↓ 7 callersFunctionget_small_text
()
benches/divan_bench.rs:202
↓ 4 callersFunctiongenerate_samples
(hits: &[&'a str], hit_percent: i32)
benches/divan_bench.rs:238
↓ 3 callersMethodget
Get the value stored for the given key. Any key type can be used here as long as the type implements `AsRef<[u8]>`. The byte slice referenced will ser
src/lib.rs:245
↓ 3 callersFunctionmake_trie
(words: &[&'a str])
benches/criterion_bench.rs:52
↓ 2 callersFunctionmake_hashmap
(words: &[&'a str])
benches/divan_bench.rs:226
↓ 2 callersFunctionmake_radix_trie
(words: &[&'a str])
benches/divan_bench.rs:230
↓ 2 callersFunctionmake_trie
(words: &[&'a str])
benches/divan_bench.rs:222
↓ 2 callersMethodnext
(&mut self)
src/lib.rs:424
↓ 1 callersMethodadd_assign
(&mut self, rhs: u64)
src/u256.rs:68
↓ 1 callersMethodancestor
Find the closest ancestor to the given key, where an ancestor is defined as the longest string present in the trie that appears as a prefix of the giv
src/lib.rs:349
↓ 1 callersFunctionget_big_text
()
benches/criterion_bench.rs:24
↓ 1 callersFunctionget_header_text
()
benches/criterion_bench.rs:40
↓ 1 callersFunctionget_random_text
()
benches/divan_bench.rs:214
↓ 1 callersFunctionget_random_text
()
benches/criterion_bench.rs:44
↓ 1 callersFunctionget_small_text
()
benches/criterion_bench.rs:32
↓ 1 callersMethodprefix_search
Create an iterator over the portion of the trie starting with the given prefix ``` # use trie_hard::TrieHard; let trie = ["dad", "ant", "and", "dot",
src/lib.rs:317
↓ 1 callersMethodshl_assign
(&mut self, rhs: u32)
src/u256.rs:106
↓ 1 callersMethodsub_assign
(&mut self, rhs: u64)
src/u256.rs:87
Methodadd
(mut self, rhs: u64)
src/u256.rs:80
Functionargs
()
benches/divan_bench.rs:173
Methodbitand
(mut self, rhs: Self)
src/u256.rs:33
Methodbitor_assign
(&mut self, rhs: Self)
src/u256.rs:43
Methodcount_ones
(&self)
src/u256.rs:26
Methoddefault
()
src/lib.rs:50
Methodempty
(trie: &'b TrieHardSized<'a, T, I>)
src/lib.rs:400
Methodeq
(&self, other: &u64)
src/u256.rs:52
Methodfmt
(&self, f: &mut std::fmt::Formatter<'_>)
benches/divan_bench.rs:167
Methodfrom_iter
(values: I)
src/lib.rs:440
Functiongenerate_samples
(hits: &[&'a str], hit_percent: i32)
benches/criterion_bench.rs:77
Methodget_from_bytes
Get the value stored for the given byte-slice key ``` # use trie_hard::TrieHard; let trie = ["and", "ant", "dad", "do", "dot"] .into_iter() .collect::
src/lib.rs:267
Functionhashmap_get
(bencher: divan::Bencher, input: &Input)
benches/divan_bench.rs:77
Functionhashmap_insert
(bencher: divan::Bencher, size: &Size)
benches/divan_bench.rs:140
Functionmain
()
build.rs:12
Functionmain
()
benches/divan_bench.rs:28
Methodnew
(used_bytes: BTreeSet<u8>)
src/lib.rs:66
Methodpartial_cmp
(&self, other: &u64)
src/u256.rs:58
Functionphf_get
(bencher: divan::Bencher, input: &Input)
benches/divan_bench.rs:99
Functionradix_trie_get
(bencher: divan::Bencher, input: &Input)
benches/divan_bench.rs:57
Functionradix_trie_insert
(bencher: divan::Bencher, size: &Size)
benches/divan_bench.rs:129
Methodshl
(mut self, rhs: u32)
src/u256.rs:121
Methodsub
(mut self, rhs: u64)
src/u256.rs:99
Functiontest_add
()
src/u256.rs:142
Functiontest_ancestor
( #[case] input: &[&str], #[case] key: &str, #[case] output: Option<&str>, )
src/lib.rs:1046
Functiontest_and
()
src/u256.rs:133
Functiontest_full_text
(#[case] text: &str)
src/lib.rs:964
Functiontest_iter
(#[case] input: &[&str], #[case] output: &[&str])
src/lib.rs:1001
Functiontest_ord
()
src/u256.rs:186
Functiontest_prefix_search
( #[case] input: &[&str], #[case] prefix: &str, #[case] output: &[&str], )
src/lib.rs:1017
Functiontest_shl
()
src/u256.rs:168
Functiontest_sizes
(#[case] bits: usize)
src/lib.rs:943
Functiontest_skip_to_leaf
()
src/lib.rs:930
Functiontest_small_get
(#[case] key: &str, #[case] expected: Option<&str>)
src/lib.rs:922
Functiontest_sub
()
src/u256.rs:155
Functiontest_trivial
()
src/lib.rs:906
Functiontest_unicode
()
src/lib.rs:986
Functiontrie_hard_get
(bencher: divan::Bencher, input: &Input)
benches/divan_bench.rs:37
Functiontrie_hard_insert
(bencher: divan::Bencher, size: &Size)
benches/divan_bench.rs:118
Functiontrie_insert_big
(b: &mut Criterion)
benches/criterion_bench.rs:56
Functiontrie_insert_headers
(b: &mut Criterion)
benches/criterion_bench.rs:70
Functiontrie_insert_small
(b: &mut Criterion)
benches/criterion_bench.rs:63