54 agent_patroot->
koffset_, node, node);
56 bool ret = agent_patroot->
Insert(agent_patnode);
72 bool ret = agent_patroot->
Remove(agent_patnode);
108 agent_patnode = agent_patroot->
GetNext(agent_patnode);
109 if (!agent_patnode) {
123 if (!agent_patnode) {
137 agent_patnode = agent_patroot->
GetNext(agent_patnode);
138 if (!agent_patnode) {
142 return (
patnode *)agent_patnode->knode_;
150 agent_patnode = agent_patroot->
GetPrev(agent_patnode);
151 if (!agent_patnode) {
155 return (
patnode *)agent_patnode->knode_;
163 agent_patroot->
koffset_, node, node);
164 if (!agent_patnode) {
171 delete agent_patnode;
175 found = agent_patroot->
GetNext(agent_patnode);
177 delete agent_patnode;
PatriciaMap< PatriciaNode,&PatriciaNode::node_, PatriciaNode::Key > PatriciaMapTable
void patricia_root_delete(patroot *root)
patnode * patricia_lookup_least(patroot *root)
patnode * patricia_lookup_greatest(patroot *root)
D * GetPrev(const D *data)
patnode * patricia_get_next(patroot *root, patnode *node)
patnode * patricia_get_previous(patroot *root, patnode *node)
boolean patricia_add(patroot *root, patnode *node)
patnode * patricia_lookup(patroot *root, const void *key)
patroot * patricia_root_init(patroot *root, boolean key_is_ptr, uint16_t klen, uint8_t koffset)
boolean patricia_delete(patroot *root, patnode *node)
patnode * patricia_lookup_geq(patroot *root, patnode *node)