Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/cloudflare/trie-hard
/ functions
Functions
63 in github.com/cloudflare/trie-hard
⨍
Functions
63
◇
Types & classes
14
↓ 31 callers
Method
iter
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 callers
Function
get_big_text
()
benches/divan_bench.rs:194
↓ 7 callers
Function
get_header_text
()
benches/divan_bench.rs:210
↓ 7 callers
Function
get_small_text
()
benches/divan_bench.rs:202
↓ 4 callers
Function
generate_samples
(hits: &[&'a str], hit_percent: i32)
benches/divan_bench.rs:238
↓ 3 callers
Method
get
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 callers
Function
make_trie
(words: &[&'a str])
benches/criterion_bench.rs:52
↓ 2 callers
Function
make_hashmap
(words: &[&'a str])
benches/divan_bench.rs:226
↓ 2 callers
Function
make_radix_trie
(words: &[&'a str])
benches/divan_bench.rs:230
↓ 2 callers
Function
make_trie
(words: &[&'a str])
benches/divan_bench.rs:222
↓ 2 callers
Method
next
(&mut self)
src/lib.rs:424
↓ 1 callers
Method
add_assign
(&mut self, rhs: u64)
src/u256.rs:68
↓ 1 callers
Method
ancestor
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 callers
Function
get_big_text
()
benches/criterion_bench.rs:24
↓ 1 callers
Function
get_header_text
()
benches/criterion_bench.rs:40
↓ 1 callers
Function
get_random_text
()
benches/divan_bench.rs:214
↓ 1 callers
Function
get_random_text
()
benches/criterion_bench.rs:44
↓ 1 callers
Function
get_small_text
()
benches/criterion_bench.rs:32
↓ 1 callers
Method
prefix_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 callers
Method
shl_assign
(&mut self, rhs: u32)
src/u256.rs:106
↓ 1 callers
Method
sub_assign
(&mut self, rhs: u64)
src/u256.rs:87
Method
add
(mut self, rhs: u64)
src/u256.rs:80
Function
args
()
benches/divan_bench.rs:173
Method
bitand
(mut self, rhs: Self)
src/u256.rs:33
Method
bitor_assign
(&mut self, rhs: Self)
src/u256.rs:43
Method
count_ones
(&self)
src/u256.rs:26
Method
default
()
src/lib.rs:50
Method
empty
(trie: &'b TrieHardSized<'a, T, I>)
src/lib.rs:400
Method
eq
(&self, other: &u64)
src/u256.rs:52
Method
fmt
(&self, f: &mut std::fmt::Formatter<'_>)
benches/divan_bench.rs:167
Method
from_iter
(values: I)
src/lib.rs:440
Function
generate_samples
(hits: &[&'a str], hit_percent: i32)
benches/criterion_bench.rs:77
Method
get_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
Function
hashmap_get
(bencher: divan::Bencher, input: &Input)
benches/divan_bench.rs:77
Function
hashmap_insert
(bencher: divan::Bencher, size: &Size)
benches/divan_bench.rs:140
Function
main
()
build.rs:12
Function
main
()
benches/divan_bench.rs:28
Method
new
(used_bytes: BTreeSet<u8>)
src/lib.rs:66
Method
partial_cmp
(&self, other: &u64)
src/u256.rs:58
Function
phf_get
(bencher: divan::Bencher, input: &Input)
benches/divan_bench.rs:99
Function
radix_trie_get
(bencher: divan::Bencher, input: &Input)
benches/divan_bench.rs:57
Function
radix_trie_insert
(bencher: divan::Bencher, size: &Size)
benches/divan_bench.rs:129
Method
shl
(mut self, rhs: u32)
src/u256.rs:121
Method
sub
(mut self, rhs: u64)
src/u256.rs:99
Function
test_add
()
src/u256.rs:142
Function
test_ancestor
( #[case] input: &[&str], #[case] key: &str, #[case] output: Option<&str>, )
src/lib.rs:1046
Function
test_and
()
src/u256.rs:133
Function
test_full_text
(#[case] text: &str)
src/lib.rs:964
Function
test_iter
(#[case] input: &[&str], #[case] output: &[&str])
src/lib.rs:1001
Function
test_ord
()
src/u256.rs:186
Function
test_prefix_search
( #[case] input: &[&str], #[case] prefix: &str, #[case] output: &[&str], )
src/lib.rs:1017
Function
test_shl
()
src/u256.rs:168
Function
test_sizes
(#[case] bits: usize)
src/lib.rs:943
Function
test_skip_to_leaf
()
src/lib.rs:930
Function
test_small_get
(#[case] key: &str, #[case] expected: Option<&str>)
src/lib.rs:922
Function
test_sub
()
src/u256.rs:155
Function
test_trivial
()
src/lib.rs:906
Function
test_unicode
()
src/lib.rs:986
Function
trie_hard_get
(bencher: divan::Bencher, input: &Input)
benches/divan_bench.rs:37
Function
trie_hard_insert
(bencher: divan::Bencher, size: &Size)
benches/divan_bench.rs:118
Function
trie_insert_big
(b: &mut Criterion)
benches/criterion_bench.rs:56
Function
trie_insert_headers
(b: &mut Criterion)
benches/criterion_bench.rs:70
Function
trie_insert_small
(b: &mut Criterion)
benches/criterion_bench.rs:63