MCPcopy Create free account

hub / github.com/BurntSushi/duration-unit-lookup / functions

Functions103 in github.com/BurntSushi/duration-unit-lookup

↓ 36 callersFunctionlookup
(input: &'i [u8])
src/phf.rs:65
↓ 28 callersMethodlen
(&self)
src/trie4.rs:242
↓ 13 callersMethodlen
(&self)
src/trie5.rs:222
↓ 10 callersMethodlen
(&self)
src/trie1.rs:397
↓ 8 callersMethodalphabet_len
(&self)
src/trie4.rs:246
↓ 8 callersMethodlen
(&self)
src/trie2.rs:212
↓ 8 callersMethodlen
(&self)
src/trie3.rs:222
↓ 6 callersMethodenqueue
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 callersMethodfind
(&self, haystack: &'h [u8])
src/trie4.rs:209
↓ 5 callersMethodtransition_len
(&self, node_capacity: usize)
src/trie4.rs:250
↓ 3 callersMethodalphabet
(&self)
src/trie4.rs:254
↓ 3 callersMethodalphabet
(&self)
src/trie5.rs:234
↓ 3 callersMethodalphabet_len
(&self)
src/trie5.rs:226
↓ 3 callersMethodalphabet_len
(&self)
src/trie2.rs:131
↓ 3 callersMethodalphabet_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 callersMethodalphabet_len
(&self)
src/trie3.rs:141
↓ 3 callersMethodequiv_id
(&self, byte: u8)
src/trie2.rs:217
↓ 3 callersMethodequiv_id
(&self, byte: u8)
src/trie1.rs:406
↓ 3 callersMethodequiv_id
(&self, byte: u8)
src/trie3.rs:227
↓ 3 callersMethodtransition_len
(&self, node_capacity: usize)
src/trie5.rs:230
↓ 2 callersMethodalphabet
(&self)
src/trie2.rs:135
↓ 2 callersMethodalphabet
Returns the alphabet corresponding to this set of needles.
src/trie1.rs:300
↓ 2 callersMethodalphabet
(&self)
src/trie3.rs:145
↓ 2 callersMethoddequeue
Pop a state ID from the queue.
gendfa/main.rs:323
↓ 2 callersMethodequiv_id
(&self, byte: u8)
src/trie4.rs:336
↓ 2 callersMethodequiv_id
(&self, byte: u8)
src/trie5.rs:316
↓ 2 callersFunctionfind
(haystack: &[u8])
src/gendfa1.rs:4
↓ 2 callersMethodgen_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 callersMethodinto_map
(self)
gendfa/main.rs:362
↓ 2 callersMethodnext
(&self, current_id: TrieNodeId, byte: u8)
src/trie1.rs:254
↓ 1 callersFunctionfind
(input: &[u8])
src/hashify.rs:32
↓ 1 callersMethodfind
( &self, haystack: &'h [u8], )
src/trie1.rs:219
↓ 1 callersFunctiongencdfa1_find
src/gencdfa1.c:22
↓ 1 callersMethodnext
(&self, current_id: TrieNodeId, byte: u8)
src/trie2.rs:107
↓ 1 callersMethodnext
(&self, current_id: TrieNodeId, byte: u8)
src/trie3.rs:117
↓ 1 callersFunctionprint_c_dfa
( dfa: &DFA<Vec<u32>>, labels: &[(&str, Unit)], out: &mut dyn Write, )
gendfa/main.rs:149
↓ 1 callersFunctionprint_rust_dfa
( dfa: &DFA<Vec<u32>>, labels: &[(&str, Unit)], out: &mut dyn Write, )
gendfa/main.rs:41
Functionaaa
()
src/trie4.rs:386
Functionaaa
()
src/trie5.rs:367
Functionaaa
()
src/trie2.rs:256
Functionaaa
()
src/trie1.rs:445
Functionaaa
()
src/trie3.rs:266
Functionaho_corasick
(c: &mut Criterion)
src/bench.rs:64
Functionby_gencdfa1
(c: &mut Criterion)
src/bench.rs:307
Functionby_gendfa1
(c: &mut Criterion)
src/bench.rs:280
Functionby_trie1
(c: &mut Criterion)
src/bench.rs:145
Functionby_trie2
(c: &mut Criterion)
src/bench.rs:172
Functionby_trie3
(c: &mut Criterion)
src/bench.rs:199
Functionby_trie4
(c: &mut Criterion)
src/bench.rs:226
Functionby_trie5
(c: &mut Criterion)
src/bench.rs:253
Functionempty
()
src/trie4.rs:352
Functionempty
()
src/trie5.rs:332
Functionempty
()
src/trie2.rs:233
Functionempty
()
src/trie1.rs:422
Functionempty
()
src/trie3.rs:243
Functionfind
(haystack: &[u8])
src/one_big_match_prefix_gen.rs:4
Methodfind
(&self, haystack: &'h [u8])
src/trie5.rs:196
Methodfind
(&self, haystack: &'h [u8])
src/trie2.rs:91
Methodfind
(&self, haystack: &'h [u8])
src/trie3.rs:95
Methodfind_offset
(&self, haystack: &[u8])
src/trie1.rs:243
Methodfmt
(&self, f: &mut std::fmt::Formatter)
gen-match-prefix/main.rs:35
Methodfmt
(&self, f: &mut std::fmt::Formatter)
gendfa/main.rs:284
Methodfmt
(&self, f: &mut core::fmt::Formatter)
src/trie4.rs:342
Methodfmt
(&self, f: &mut core::fmt::Formatter)
src/trie5.rs:322
Methodfmt
(&self, f: &mut core::fmt::Formatter)
src/trie2.rs:223
Methodfmt
(&self, f: &mut core::fmt::Formatter)
src/trie1.rs:412
Methodfmt
(&self, f: &mut core::fmt::Formatter)
src/trie3.rs:233
Functionfubar
()
src/trie4.rs:368
Functionfubar
()
src/trie5.rs:348
Functionfubar
()
src/trie2.rs:243
Functionfubar
()
src/trie1.rs:432
Functionfubar
()
src/trie3.rs:253
Functionhashify
(c: &mut Criterion)
src/bench.rs:118
Functionlookup
(input: &'i [u8])
src/by_gendfa1.rs:4
Functionlookup
(input: &'i [u8])
src/by_gencdfa1.rs:14
Functionlookup
(input: &'i [u8])
src/one_big_match_prefix.rs:4
Functionlookup
(input: &'i [u8])
src/hashify.rs:4
Functionlookup
(input: &'i [u8])
src/by_trie4.rs:76
Functionlookup
(input: &'i [u8])
src/one_big_match.rs:4
Functionlookup
(input: &'i [u8])
src/by_trie1.rs:71
Functionlookup
(input: &'i [u8])
src/by_trie2.rs:71
Functionlookup
(input: &'i [u8])
src/by_trie3.rs:71
Functionlookup
(input: &'i [u8])
src/aho.rs:136
Functionlookup
(input: &'i [u8])
src/by_trie5.rs:76
Functionmain
()
build.rs:1
Functionmain
()
gen-match-prefix/main.rs:3
Functionmain
()
gendfa/main.rs:13
Methodnew
(dfa: &'a DFA<Vec<u32>>, sid: StateID)
gendfa/main.rs:358
Methodnew
( needles: &TrieNeedles<V>, default: V, )
src/trie4.rs:53
Methodnew
( needles: &TrieNeedles<V>, default: V, )
src/trie5.rs:40
Methodnew
( needles: &TrieNeedles<V>, )
src/trie2.rs:28
Methodnew
Create a new trie from the given set of needles.
src/trie1.rs:151
Methodnew
( needles: &TrieNeedles<V>, )
src/trie3.rs:32
Methodnext
(&mut self)
gendfa/main.rs:378
Functionone_big_match
(c: &mut Criterion)
src/bench.rs:7
Functionone_big_match_prefix
(c: &mut Criterion)
src/bench.rs:34
Functionphf
(c: &mut Criterion)
src/bench.rs:91
Functionsize
()
src/by_trie4.rs:101
Functionsize
()
src/by_trie1.rs:96
Functionsize
()
src/by_trie2.rs:96
next →1–100 of 103, ranked by callers