93     fn new(k: K, v: V) -> NodePtr<K, V> {  in new()
100             value: v,  in new()
424             .all(|(key, value)| other.get(key).map_or(false, |v| *value == *v))  in eq()
459         for (k, v) in iter {  in extend()
460             self.insert(k, v);  in extend()
545         self.inner.next().map(|(_, v)| v)  in next()
593         self.inner.next().map(|(_, v)| v)  in next()
630         let (k, v) = unsafe {  in next()
638         Some((k, v))  in next()
659         let (k, v) = obj.pair();  in next_back()
662         Some((k, v))  in next_back()
712         let (k, v) = unsafe { (&(*self.head.0).key, &(*self.head.0).value) };  in next()
715         Some((k, v))  in next()
735         let (k, v) = unsafe { (&(*self.tail.0).key, &(*self.tail.0).value) };  in next_back()
738         Some((k, v))  in next_back()
788         let (k, v) = unsafe { (&(*self.head.0).key, &mut (*self.head.0).value) };  in next()
791         Some((k, v))  in next()
810         let (k, v) = unsafe { (&(*self.tail.0).key, &mut (*self.tail.0).value) };  in next_back()
813         Some((k, v))  in next_back()
946     pub fn replace_or_insert(&mut self, k: K, mut v: V) -> Option<V> {  in replace_or_insert()
949             self.insert(k, v);  in replace_or_insert()
954             mem::swap(&mut v, &mut (*node.0).value);  in replace_or_insert()
957         Some(v)  in replace_or_insert()
1021     pub fn insert(&mut self, k: K, v: V) {  in insert()
1023         let mut node = NodePtr::new(k, v);  in insert()
1606         for (k, v) in m.iter() {  in test_iterate()
1607             assert_eq!(*v, *k * 2);  in test_iterate()
1656             Some(v) => assert_eq!(*v, 2),  in test_find()
1698         for &(k, v) in &xs {  in test_from_iter()
1699             assert_eq!(map.get(&k), Some(&v));  in test_from_iter()