Lines Matching refs:key

10 	An end node with data. This has a copy of the relevant key, along
16 	indexed	through a subset of the key. See Level Compression.
21 	The number of bits in the key segment used for indexing into the
25 	The position (in the key) of the key segment used for indexing into
30 	a segment of the key specified by the parent's "pos" and "bits"
33 	in the key skipped over because they represent a single path with no
37 	verify that they actually do match the key we are searching for.
76 	Looks up a key, deletes it and runs the level compression algorithm.
79 	The key function for the dynamic trie after any change in the trie
124 trie, key segment by key segment, until we find a leaf. check_leaf() does
130 starting out at the same as the key length, is reduced one step at a time,
141 chop off part of the key in order to find the longest matching prefix.