(&self, ap: AccessPath)
| 250 | } |
| 251 | |
| 252 | fn get_node(&self, ap: AccessPath) -> Option<&TrieNode<T>> { |
| 253 | let mut node = match self.0.get(ap.root()) { |
| 254 | Some(n) => n, |
| 255 | None => return None, |
| 256 | }; |
| 257 | for offset in ap.offsets() { |
| 258 | node = match node.get_offset(offset) { |
| 259 | Some(n) => n, |
| 260 | None => return None, |
| 261 | } |
| 262 | } |
| 263 | Some(node) |
| 264 | } |
| 265 | |
| 266 | /// Removes node located at the given access path |
| 267 | /// Returns the node if it has been fully removed from the trie (i.e. it did not have any children) |
no test coverage detected