Merge pull request #6394 from paritytech/trie_recursion
removed recursion from triedbmut::lookup
This commit is contained in:
commit
da91a07906
@ -367,44 +367,50 @@ impl<'a> TrieDBMut<'a> {
|
|||||||
}
|
}
|
||||||
|
|
||||||
// walk the trie, attempting to find the key's node.
|
// walk the trie, attempting to find the key's node.
|
||||||
fn lookup<'x, 'key>(&'x self, partial: NibbleSlice<'key>, handle: &NodeHandle) -> super::Result<Option<DBValue>>
|
fn lookup<'x, 'key>(&'x self, mut partial: NibbleSlice<'key>, handle: &NodeHandle) -> super::Result<Option<DBValue>>
|
||||||
where 'x: 'key
|
where 'x: 'key
|
||||||
{
|
{
|
||||||
match *handle {
|
let mut handle = handle;
|
||||||
NodeHandle::Hash(ref hash) => Lookup {
|
loop {
|
||||||
db: &*self.db,
|
let (mid, child) = match *handle {
|
||||||
query: DBValue::from_slice,
|
NodeHandle::Hash(ref hash) => return Lookup {
|
||||||
hash: hash.clone(),
|
db: &*self.db,
|
||||||
}.look_up(partial),
|
query: DBValue::from_slice,
|
||||||
NodeHandle::InMemory(ref handle) => match self.storage[handle] {
|
hash: hash.clone(),
|
||||||
Node::Empty => Ok(None),
|
}.look_up(partial),
|
||||||
Node::Leaf(ref key, ref value) => {
|
NodeHandle::InMemory(ref handle) => match self.storage[handle] {
|
||||||
if NibbleSlice::from_encoded(key).0 == partial {
|
Node::Empty => return Ok(None),
|
||||||
Ok(Some(DBValue::from_slice(value)))
|
Node::Leaf(ref key, ref value) => {
|
||||||
} else {
|
if NibbleSlice::from_encoded(key).0 == partial {
|
||||||
Ok(None)
|
return Ok(Some(DBValue::from_slice(value)));
|
||||||
|
} else {
|
||||||
|
return Ok(None);
|
||||||
|
}
|
||||||
}
|
}
|
||||||
}
|
Node::Extension(ref slice, ref child) => {
|
||||||
Node::Extension(ref slice, ref child) => {
|
let slice = NibbleSlice::from_encoded(slice).0;
|
||||||
let slice = NibbleSlice::from_encoded(slice).0;
|
if partial.starts_with(&slice) {
|
||||||
if partial.starts_with(&slice) {
|
(slice.len(), child)
|
||||||
self.lookup(partial.mid(slice.len()), child)
|
} else {
|
||||||
} else {
|
return Ok(None);
|
||||||
Ok(None)
|
}
|
||||||
}
|
}
|
||||||
}
|
Node::Branch(ref children, ref value) => {
|
||||||
Node::Branch(ref children, ref value) => {
|
if partial.is_empty() {
|
||||||
if partial.is_empty() {
|
return Ok(value.as_ref().map(|v| DBValue::from_slice(v)));
|
||||||
Ok(value.as_ref().map(|v| DBValue::from_slice(v)))
|
} else {
|
||||||
} else {
|
let idx = partial.at(0);
|
||||||
let idx = partial.at(0);
|
match children[idx as usize].as_ref() {
|
||||||
match children[idx as usize].as_ref() {
|
Some(child) => (1, child),
|
||||||
Some(child) => self.lookup(partial.mid(1), child),
|
None => return Ok(None),
|
||||||
None => Ok(None),
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
};
|
||||||
|
|
||||||
|
partial = partial.mid(mid);
|
||||||
|
handle = child;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
Loading…
Reference in New Issue
Block a user