Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/BurntSushi/duration-unit-lookup
/ functions
Functions
103 in github.com/BurntSushi/duration-unit-lookup
⨍
Functions
103
◇
Types & classes
34
↓ 36 callers
Function
lookup
(input: &'i [u8])
src/phf.rs:65
↓ 28 callers
Method
len
(&self)
src/trie4.rs:242
↓ 13 callers
Method
len
(&self)
src/trie5.rs:222
↓ 10 callers
Method
len
(&self)
src/trie1.rs:397
↓ 8 callers
Method
alphabet_len
(&self)
src/trie4.rs:246
↓ 8 callers
Method
len
(&self)
src/trie2.rs:212
↓ 8 callers
Method
len
(&self)
src/trie3.rs:222
↓ 6 callers
Method
enqueue
Push the given state on to the queue of states to visit. This is a no-op if the given state ID has been pushed to the queue before (thus, a state can
gendfa/main.rs:315
↓ 5 callers
Method
find
(&self, haystack: &'h [u8])
src/trie4.rs:209
↓ 5 callers
Method
transition_len
(&self, node_capacity: usize)
src/trie4.rs:250
↓ 3 callers
Method
alphabet
(&self)
src/trie4.rs:254
↓ 3 callers
Method
alphabet
(&self)
src/trie5.rs:234
↓ 3 callers
Method
alphabet_len
(&self)
src/trie5.rs:226
↓ 3 callers
Method
alphabet_len
(&self)
src/trie2.rs:131
↓ 3 callers
Method
alphabet_len
Returns the number of elements in the alphabet formed by these needles. The alphabet size is determined by the number of distinct bytes occurring acr
src/trie1.rs:295
↓ 3 callers
Method
alphabet_len
(&self)
src/trie3.rs:141
↓ 3 callers
Method
equiv_id
(&self, byte: u8)
src/trie2.rs:217
↓ 3 callers
Method
equiv_id
(&self, byte: u8)
src/trie1.rs:406
↓ 3 callers
Method
equiv_id
(&self, byte: u8)
src/trie3.rs:227
↓ 3 callers
Method
transition_len
(&self, node_capacity: usize)
src/trie5.rs:230
↓ 2 callers
Method
alphabet
(&self)
src/trie2.rs:135
↓ 2 callers
Method
alphabet
Returns the alphabet corresponding to this set of needles.
src/trie1.rs:300
↓ 2 callers
Method
alphabet
(&self)
src/trie3.rs:145
↓ 2 callers
Method
dequeue
Pop a state ID from the queue.
gendfa/main.rs:323
↓ 2 callers
Method
equiv_id
(&self, byte: u8)
src/trie4.rs:336
↓ 2 callers
Method
equiv_id
(&self, byte: u8)
src/trie5.rs:316
↓ 2 callers
Function
find
(haystack: &[u8])
src/gendfa1.rs:4
↓ 2 callers
Method
gen_id
Return the ID of the given state for use in the generated code. If one doesn't exist for the state given, then one is generated. This maintains a co
gendfa/main.rs:333
↓ 2 callers
Method
into_map
(self)
gendfa/main.rs:362
↓ 2 callers
Method
next
(&self, current_id: TrieNodeId, byte: u8)
src/trie1.rs:254
↓ 1 callers
Function
find
(input: &[u8])
src/hashify.rs:32
↓ 1 callers
Method
find
( &self, haystack: &'h [u8], )
src/trie1.rs:219
↓ 1 callers
Function
gencdfa1_find
src/gencdfa1.c:22
↓ 1 callers
Method
next
(&self, current_id: TrieNodeId, byte: u8)
src/trie2.rs:107
↓ 1 callers
Method
next
(&self, current_id: TrieNodeId, byte: u8)
src/trie3.rs:117
↓ 1 callers
Function
print_c_dfa
( dfa: &DFA<Vec<u32>>, labels: &[(&str, Unit)], out: &mut dyn Write, )
gendfa/main.rs:149
↓ 1 callers
Function
print_rust_dfa
( dfa: &DFA<Vec<u32>>, labels: &[(&str, Unit)], out: &mut dyn Write, )
gendfa/main.rs:41
Function
aaa
()
src/trie4.rs:386
Function
aaa
()
src/trie5.rs:367
Function
aaa
()
src/trie2.rs:256
Function
aaa
()
src/trie1.rs:445
Function
aaa
()
src/trie3.rs:266
Function
aho_corasick
(c: &mut Criterion)
src/bench.rs:64
Function
by_gencdfa1
(c: &mut Criterion)
src/bench.rs:307
Function
by_gendfa1
(c: &mut Criterion)
src/bench.rs:280
Function
by_trie1
(c: &mut Criterion)
src/bench.rs:145
Function
by_trie2
(c: &mut Criterion)
src/bench.rs:172
Function
by_trie3
(c: &mut Criterion)
src/bench.rs:199
Function
by_trie4
(c: &mut Criterion)
src/bench.rs:226
Function
by_trie5
(c: &mut Criterion)
src/bench.rs:253
Function
empty
()
src/trie4.rs:352
Function
empty
()
src/trie5.rs:332
Function
empty
()
src/trie2.rs:233
Function
empty
()
src/trie1.rs:422
Function
empty
()
src/trie3.rs:243
Function
find
(haystack: &[u8])
src/one_big_match_prefix_gen.rs:4
Method
find
(&self, haystack: &'h [u8])
src/trie5.rs:196
Method
find
(&self, haystack: &'h [u8])
src/trie2.rs:91
Method
find
(&self, haystack: &'h [u8])
src/trie3.rs:95
Method
find_offset
(&self, haystack: &[u8])
src/trie1.rs:243
Method
fmt
(&self, f: &mut std::fmt::Formatter)
gen-match-prefix/main.rs:35
Method
fmt
(&self, f: &mut std::fmt::Formatter)
gendfa/main.rs:284
Method
fmt
(&self, f: &mut core::fmt::Formatter)
src/trie4.rs:342
Method
fmt
(&self, f: &mut core::fmt::Formatter)
src/trie5.rs:322
Method
fmt
(&self, f: &mut core::fmt::Formatter)
src/trie2.rs:223
Method
fmt
(&self, f: &mut core::fmt::Formatter)
src/trie1.rs:412
Method
fmt
(&self, f: &mut core::fmt::Formatter)
src/trie3.rs:233
Function
fubar
()
src/trie4.rs:368
Function
fubar
()
src/trie5.rs:348
Function
fubar
()
src/trie2.rs:243
Function
fubar
()
src/trie1.rs:432
Function
fubar
()
src/trie3.rs:253
Function
hashify
(c: &mut Criterion)
src/bench.rs:118
Function
lookup
(input: &'i [u8])
src/by_gendfa1.rs:4
Function
lookup
(input: &'i [u8])
src/by_gencdfa1.rs:14
Function
lookup
(input: &'i [u8])
src/one_big_match_prefix.rs:4
Function
lookup
(input: &'i [u8])
src/hashify.rs:4
Function
lookup
(input: &'i [u8])
src/by_trie4.rs:76
Function
lookup
(input: &'i [u8])
src/one_big_match.rs:4
Function
lookup
(input: &'i [u8])
src/by_trie1.rs:71
Function
lookup
(input: &'i [u8])
src/by_trie2.rs:71
Function
lookup
(input: &'i [u8])
src/by_trie3.rs:71
Function
lookup
(input: &'i [u8])
src/aho.rs:136
Function
lookup
(input: &'i [u8])
src/by_trie5.rs:76
Function
main
()
build.rs:1
Function
main
()
gen-match-prefix/main.rs:3
Function
main
()
gendfa/main.rs:13
Method
new
(dfa: &'a DFA<Vec<u32>>, sid: StateID)
gendfa/main.rs:358
Method
new
( needles: &TrieNeedles<V>, default: V, )
src/trie4.rs:53
Method
new
( needles: &TrieNeedles<V>, default: V, )
src/trie5.rs:40
Method
new
( needles: &TrieNeedles<V>, )
src/trie2.rs:28
Method
new
Create a new trie from the given set of needles.
src/trie1.rs:151
Method
new
( needles: &TrieNeedles<V>, )
src/trie3.rs:32
Method
next
(&mut self)
gendfa/main.rs:378
Function
one_big_match
(c: &mut Criterion)
src/bench.rs:7
Function
one_big_match_prefix
(c: &mut Criterion)
src/bench.rs:34
Function
phf
(c: &mut Criterion)
src/bench.rs:91
Function
size
()
src/by_trie4.rs:101
Function
size
()
src/by_trie1.rs:96
Function
size
()
src/by_trie2.rs:96
next →
1–100 of 103, ranked by callers