find_node.rs

fn find_node_with_visitor<F>(
    &self,
    k: &K,
    mut visitor: F
) -> NodePtr<K, V> where F: FnMut(&K) {
    if self.root.is_null() {
        return NodePtr::null();
    }
    let mut temp = &self.root;
    unsafe {
        loop {
            let key = &(*temp.0).key;
            let next = match k.cmp(key) {
                Ordering::Less => &mut (*temp.0).left,
                Ordering::Greater => &mut (*temp.0).right,
                Ordering::Equal => {
                    visitor(&key);
                    return *temp;
                }
            };
            visitor(&key);
            if next.is_null() {
                break;
            }
            temp = next;
        }
    }
    NodePtr::null()
}