MCPcopy Create free account

hub / github.com/arpitbbhayani/tripod / functions

Functions96 in github.com/arpitbbhayani/tripod

⨍ Functions 96◇ Types & classes 2
↓ 30 callersMethodPut
Adds the []rune key to the PrefixStore and returns if key was succesfully added and any error encountered. A non nil error is returned if len(key) > m
prefixstorerunetrie.go:32
↓ 24 callersMethodPrefixSearch
Does the prefix search on the PrefixStore and returns a reference to list (*list.List) containings all entries from the store for the given prefix. Ea
prefixstorerunetrie.go:137
↓ 20 callersFunctionbenchmarkPrefixSearch
(b *testing.B, size int, count int)
benchmarks/bytetrie_test.go:63
↓ 20 callersFunctionbenchmarkRuneTriePrefixSearch
(b *testing.B, size int, count int)
benchmarks/runetrie_test.go:64
↓ 18 callersMethodExists
Checks and returns if given key is present in the PrefixStore
prefixstorerunetrie.go:60
↓ 5 callersFunctionbenchmarkExists
(b *testing.B, size int)
benchmarks/bytetrie_test.go:33
↓ 5 callersFunctionbenchmarkPut
(b *testing.B, size int)
benchmarks/bytetrie_test.go:18
↓ 5 callersFunctionbenchmarkRunTrieExists
(b *testing.B, size int)
benchmarks/runetrie_test.go:34
↓ 5 callersFunctionbenchmarkRunTriePut
(b *testing.B, size int)
benchmarks/runetrie_test.go:18
↓ 4 callersFunctiongetRandomByteSlice
(size int)
benchmarks/bytetrie_test.go:9
↓ 4 callersFunctiongetRandomUTF8RuneSlice
(size int)
benchmarks/runetrie_test.go:9
↓ 3 callersFunctiongetRandomUTF8RuneSlice
(size int)
tests/runetrie_test.go:10
↓ 2 callersFunctionpopulatePrefixStoreByteTrie
(tr *tripod.PrefixStoreByteTrie)
tests/bytetrie_test.go:30
↓ 2 callersFunctionpopulatePrefixStoreRuneTrie
(tr *tripod.PrefixStoreRuneTrie)
tests/runetrie_test.go:19
↓ 1 callersFunctionCreatePrefixStoreByteTrie
Creates and returns reference to a new instance of PrefixStoreByteTrie. maxKeySizeInBytes is the maximum size of the key ([]byte) that should be allow
prefixstorebytetrie.go:22
↓ 1 callersFunctionCreatePrefixStoreRuneTrie
Creates and returns reference to a new instance of PrefixStoreRuneTrie. maxKeySizeInRunes is the maximum size of the key ([]rune) that should be allow
prefixstorerunetrie.go:22
↓ 1 callersFunction_dfs
The DFS Function which recursively calls the children and as it encounters a valid existing key, creates a copy of the temporary buffer and appends pr
prefixstorebytetrie.go:117
↓ 1 callersFunction_dfs_rune
The DFS Function which recursively calls the children and as it encounters a valid existing key, creates a copy of the temporary buffer and appends pr
prefixstorerunetrie.go:117
↓ 1 callersMethodget
For a given instance of PrefixStore t, this method returns a reference to subPrefixStore that ends at the key.
prefixstorerunetrie.go:80
↓ 1 callersMethodget
For a given instance of PrefixStore t, this method returns a reference to subPrefixStore that ends at the key.
prefixstorebytetrie.go:80
↓ 1 callersFunctiongetRandomByteSlice
(size int)
tests/bytetrie_test.go:21
↓ 1 callersMethodlist
Does a Depth First Search traversal on the PrefixStoreRuneTrie and returns a List (Double Linked List) containing the keys present in the PrefixStore
prefixstorerunetrie.go:101
↓ 1 callersMethodlist
Does a Depth First Search traversal on the PrefixStoreByteTrie and returns a List (Double Linked List) containing the keys present in the PrefixStore
prefixstorebytetrie.go:101
↓ 1 callersFunctionpopulatePrefixStoreByteTrieForPrefix
(tr *tripod.PrefixStoreByteTrie, size int, count int, b byte)
benchmarks/bytetrie_test.go:55
↓ 1 callersFunctionpopulatePrefixStoreRuneTrieForPrefix
(tr *tripod.PrefixStoreRuneTrie, size int, count int, b rune)
benchmarks/runetrie_test.go:56
FunctionBenchmarkByteTrieExists128
(b *testing.B)
benchmarks/bytetrie_test.go:47
FunctionBenchmarkByteTrieExists16
(b *testing.B)
benchmarks/bytetrie_test.go:44
FunctionBenchmarkByteTrieExists32
(b *testing.B)
benchmarks/bytetrie_test.go:45
FunctionBenchmarkByteTrieExists64
(b *testing.B)
benchmarks/bytetrie_test.go:46
FunctionBenchmarkByteTrieExists8
(b *testing.B)
benchmarks/bytetrie_test.go:43
FunctionBenchmarkByteTriePrefixSearch128_10
(b *testing.B)
benchmarks/bytetrie_test.go:77
FunctionBenchmarkByteTriePrefixSearch128_100
(b *testing.B)
benchmarks/bytetrie_test.go:89
FunctionBenchmarkByteTriePrefixSearch128_200
(b *testing.B)
benchmarks/bytetrie_test.go:95
FunctionBenchmarkByteTriePrefixSearch128_50
(b *testing.B)
benchmarks/bytetrie_test.go:83
FunctionBenchmarkByteTriePrefixSearch16_10
(b *testing.B)
benchmarks/bytetrie_test.go:74
FunctionBenchmarkByteTriePrefixSearch16_100
(b *testing.B)
benchmarks/bytetrie_test.go:86
FunctionBenchmarkByteTriePrefixSearch16_200
(b *testing.B)
benchmarks/bytetrie_test.go:92
FunctionBenchmarkByteTriePrefixSearch16_50
(b *testing.B)
benchmarks/bytetrie_test.go:80
FunctionBenchmarkByteTriePrefixSearch32_10
(b *testing.B)
benchmarks/bytetrie_test.go:75
FunctionBenchmarkByteTriePrefixSearch32_100
(b *testing.B)
benchmarks/bytetrie_test.go:87
FunctionBenchmarkByteTriePrefixSearch32_200
(b *testing.B)
benchmarks/bytetrie_test.go:93
FunctionBenchmarkByteTriePrefixSearch32_50
(b *testing.B)
benchmarks/bytetrie_test.go:81
FunctionBenchmarkByteTriePrefixSearch64_10
(b *testing.B)
benchmarks/bytetrie_test.go:76
FunctionBenchmarkByteTriePrefixSearch64_100
(b *testing.B)
benchmarks/bytetrie_test.go:88
FunctionBenchmarkByteTriePrefixSearch64_200
(b *testing.B)
benchmarks/bytetrie_test.go:94
FunctionBenchmarkByteTriePrefixSearch64_50
(b *testing.B)
benchmarks/bytetrie_test.go:82
FunctionBenchmarkByteTriePrefixSearch8_10
(b *testing.B)
benchmarks/bytetrie_test.go:73
FunctionBenchmarkByteTriePrefixSearch8_100
(b *testing.B)
benchmarks/bytetrie_test.go:85
FunctionBenchmarkByteTriePrefixSearch8_200
(b *testing.B)
benchmarks/bytetrie_test.go:91
FunctionBenchmarkByteTriePrefixSearch8_50
(b *testing.B)
benchmarks/bytetrie_test.go:79
FunctionBenchmarkByteTriePut128
(b *testing.B)
benchmarks/bytetrie_test.go:31
FunctionBenchmarkByteTriePut16
(b *testing.B)
benchmarks/bytetrie_test.go:28
FunctionBenchmarkByteTriePut32
(b *testing.B)
benchmarks/bytetrie_test.go:29
FunctionBenchmarkByteTriePut64
(b *testing.B)
benchmarks/bytetrie_test.go:30
FunctionBenchmarkByteTriePut8
(b *testing.B)
benchmarks/bytetrie_test.go:27
FunctionBenchmarkRuneTrieExists128
(b *testing.B)
benchmarks/runetrie_test.go:48
FunctionBenchmarkRuneTrieExists16
(b *testing.B)
benchmarks/runetrie_test.go:45
FunctionBenchmarkRuneTrieExists32
(b *testing.B)
benchmarks/runetrie_test.go:46
FunctionBenchmarkRuneTrieExists64
(b *testing.B)
benchmarks/runetrie_test.go:47
FunctionBenchmarkRuneTrieExists8
(b *testing.B)
benchmarks/runetrie_test.go:44
FunctionBenchmarkRuneTriePrefixSearch128_10
(b *testing.B)
benchmarks/runetrie_test.go:78
FunctionBenchmarkRuneTriePrefixSearch128_100
(b *testing.B)
benchmarks/runetrie_test.go:90
FunctionBenchmarkRuneTriePrefixSearch128_200
(b *testing.B)
benchmarks/runetrie_test.go:96
FunctionBenchmarkRuneTriePrefixSearch128_50
(b *testing.B)
benchmarks/runetrie_test.go:84
FunctionBenchmarkRuneTriePrefixSearch16_10
(b *testing.B)
benchmarks/runetrie_test.go:75
FunctionBenchmarkRuneTriePrefixSearch16_100
(b *testing.B)
benchmarks/runetrie_test.go:87
FunctionBenchmarkRuneTriePrefixSearch16_200
(b *testing.B)
benchmarks/runetrie_test.go:93
FunctionBenchmarkRuneTriePrefixSearch16_50
(b *testing.B)
benchmarks/runetrie_test.go:81
FunctionBenchmarkRuneTriePrefixSearch32_10
(b *testing.B)
benchmarks/runetrie_test.go:76
FunctionBenchmarkRuneTriePrefixSearch32_100
(b *testing.B)
benchmarks/runetrie_test.go:88
FunctionBenchmarkRuneTriePrefixSearch32_200
(b *testing.B)
benchmarks/runetrie_test.go:94
FunctionBenchmarkRuneTriePrefixSearch32_50
(b *testing.B)
benchmarks/runetrie_test.go:82
FunctionBenchmarkRuneTriePrefixSearch64_10
(b *testing.B)
benchmarks/runetrie_test.go:77
FunctionBenchmarkRuneTriePrefixSearch64_100
(b *testing.B)
benchmarks/runetrie_test.go:89
FunctionBenchmarkRuneTriePrefixSearch64_200
(b *testing.B)
benchmarks/runetrie_test.go:95
FunctionBenchmarkRuneTriePrefixSearch64_50
(b *testing.B)
benchmarks/runetrie_test.go:83
FunctionBenchmarkRuneTriePrefixSearch8_10
(b *testing.B)
benchmarks/runetrie_test.go:74
FunctionBenchmarkRuneTriePrefixSearch8_100
(b *testing.B)
benchmarks/runetrie_test.go:86
FunctionBenchmarkRuneTriePrefixSearch8_200
(b *testing.B)
benchmarks/runetrie_test.go:92
FunctionBenchmarkRuneTriePrefixSearch8_50
(b *testing.B)
benchmarks/runetrie_test.go:80
FunctionBenchmarkRuneTriePut128
(b *testing.B)
benchmarks/runetrie_test.go:32
FunctionBenchmarkRuneTriePut16
(b *testing.B)
benchmarks/runetrie_test.go:29
FunctionBenchmarkRuneTriePut32
(b *testing.B)
benchmarks/runetrie_test.go:30
FunctionBenchmarkRuneTriePut64
(b *testing.B)
benchmarks/runetrie_test.go:31
FunctionBenchmarkRuneTriePut8
(b *testing.B)
benchmarks/runetrie_test.go:28
MethodExists
Checks and returns if given key is present in the PrefixStore
prefixstorebytetrie.go:60
MethodPrefixSearch
Does the prefix search on the PrefixStore and returns a reference to list (*list.List) containings all entries from the store for the given prefix. Ea
prefixstorebytetrie.go:137
MethodPut
Adds the []byte key to the PrefixStore and returns if key was succesfully added and any error encountered. A non nil error is returned if len(key) > m
prefixstorebytetrie.go:32
FunctionTestPrefixStoreByteTrieExists
(t *testing.T)
tests/bytetrie_test.go:79
FunctionTestPrefixStoreByteTriePrefixSearch
(t *testing.T)
tests/bytetrie_test.go:112
FunctionTestPrefixStoreByteTriePut
(t *testing.T)
tests/bytetrie_test.go:36
FunctionTestPrefixStoreRuneTrieExists
(t *testing.T)
tests/runetrie_test.go:93
FunctionTestPrefixStoreRuneTriePrefixSearch
(t *testing.T)
tests/runetrie_test.go:126
FunctionTestPrefixStoreRuneTriePut
(t *testing.T)
tests/runetrie_test.go:25
FunctionpopulatePrefixStoreByteTrie
(tr *tripod.PrefixStoreByteTrie, size int, count int)
benchmarks/bytetrie_test.go:49
FunctionpopulatePrefixStoreRuneTrie
(tr *tripod.PrefixStoreRuneTrie, size int, count int)
benchmarks/runetrie_test.go:50