Free a node.
(&mut self, node: Node)
| 53 | |
| 54 | /// Free a node. |
| 55 | pub fn free_node(&mut self, node: Node) { |
| 56 | // Quick check for a double free. |
| 57 | debug_assert!(!self.nodes[node].is_free(), "{node} is already free"); |
| 58 | self.nodes[node] = NodeData::Free { |
| 59 | next: self.freelist, |
| 60 | }; |
| 61 | self.freelist = Some(node); |
| 62 | } |
| 63 | |
| 64 | /// Free the entire tree rooted at `node`. |
| 65 | pub fn free_tree(&mut self, node: Node) { |
no outgoing calls
no test coverage detected