1 // Copyright 2012-2014 The Rust Project Developers. See the COPYRIGHT
2 // file at the top-level directory of this distribution and at
3 // http://rust-lang.org/COPYRIGHT.
5 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
6 // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
7 // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
8 // option. This file may not be copied, modified, or distributed
9 // except according to those terms.
11 //! A simple map based on a vector for small integer keys. Space requirements
12 //! are O(highest integer key).
14 #![allow(missing_docs)]
18 use core::cmp::Ordering;
19 use core::default::Default;
21 use core::hash::{Hash, Writer, Hasher};
22 use core::iter::{Enumerate, FilterMap, Map, FromIterator};
24 use core::mem::replace;
25 use core::ops::{Index, IndexMut};
30 // FIXME(conventions): capacity management???
32 /// A map optimized for small integer keys.
37 /// use std::collections::VecMap;
39 /// let mut months = VecMap::new();
40 /// months.insert(1, "Jan");
41 /// months.insert(2, "Feb");
42 /// months.insert(3, "Mar");
44 /// if !months.contains_key(&12) {
45 /// println!("The end is near!");
48 /// assert_eq!(months.get(&1), Some(&"Jan"));
50 /// match months.get_mut(&3) {
51 /// Some(value) => *value = "Venus",
55 /// assert_eq!(months.get(&3), Some(&"Venus"));
57 /// // Print out all months
58 /// for (key, value) in months.iter() {
59 /// println!("month {} is {}", key, value);
63 /// assert!(months.is_empty());
65 pub struct VecMap<V> {
70 impl<V> Default for VecMap<V> {
73 fn default() -> VecMap<V> { VecMap::new() }
76 impl<V:Clone> Clone for VecMap<V> {
78 fn clone(&self) -> VecMap<V> {
79 VecMap { v: self.v.clone() }
83 fn clone_from(&mut self, source: &VecMap<V>) {
84 self.v.clone_from(&source.v);
88 impl<S: Writer + Hasher, V: Hash<S>> Hash<S> for VecMap<V> {
89 fn hash(&self, state: &mut S) {
90 // In order to not traverse the `VecMap` twice, count the elements
92 let mut count: uint = 0;
93 for elt in self.iter() {
102 /// Creates an empty `VecMap`.
107 /// use std::collections::VecMap;
108 /// let mut map: VecMap<&str> = VecMap::new();
111 pub fn new() -> VecMap<V> { VecMap { v: vec![] } }
113 /// Creates an empty `VecMap` with space for at least `capacity`
114 /// elements before resizing.
119 /// use std::collections::VecMap;
120 /// let mut map: VecMap<&str> = VecMap::with_capacity(10);
123 pub fn with_capacity(capacity: uint) -> VecMap<V> {
124 VecMap { v: Vec::with_capacity(capacity) }
127 /// Returns the number of elements the `VecMap` can hold without
133 /// use std::collections::VecMap;
134 /// let map: VecMap<String> = VecMap::with_capacity(10);
135 /// assert!(map.capacity() >= 10);
139 pub fn capacity(&self) -> uint {
143 /// Reserves capacity for the given `VecMap` to contain `len` distinct keys.
144 /// In the case of `VecMap` this means reallocations will not occur as long
145 /// as all inserted keys are less than `len`.
147 /// The collection may reserve more space to avoid frequent reallocations.
152 /// use std::collections::VecMap;
153 /// let mut map: VecMap<&str> = VecMap::new();
154 /// map.reserve_len(10);
155 /// assert!(map.capacity() >= 10);
158 pub fn reserve_len(&mut self, len: uint) {
159 let cur_len = self.v.len();
161 self.v.reserve(len - cur_len);
165 /// Reserves the minimum capacity for the given `VecMap` to contain `len` distinct keys.
166 /// In the case of `VecMap` this means reallocations will not occur as long as all inserted
167 /// keys are less than `len`.
169 /// Note that the allocator may give the collection more space than it requests.
170 /// Therefore capacity cannot be relied upon to be precisely minimal. Prefer
171 /// `reserve_len` if future insertions are expected.
176 /// use std::collections::VecMap;
177 /// let mut map: VecMap<&str> = VecMap::new();
178 /// map.reserve_len_exact(10);
179 /// assert!(map.capacity() >= 10);
182 pub fn reserve_len_exact(&mut self, len: uint) {
183 let cur_len = self.v.len();
185 self.v.reserve_exact(len - cur_len);
189 /// Returns an iterator visiting all keys in ascending order by the keys.
190 /// The iterator's element type is `uint`.
192 pub fn keys<'r>(&'r self) -> Keys<'r, V> {
193 fn first<A, B>((a, _): (A, B)) -> A { a }
194 let first: fn((uint, &'r V)) -> uint = first; // coerce to fn pointer
196 Keys { iter: self.iter().map(first) }
199 /// Returns an iterator visiting all values in ascending order by the keys.
200 /// The iterator's element type is `&'r V`.
202 pub fn values<'r>(&'r self) -> Values<'r, V> {
203 fn second<A, B>((_, b): (A, B)) -> B { b }
204 let second: fn((uint, &'r V)) -> &'r V = second; // coerce to fn pointer
206 Values { iter: self.iter().map(second) }
209 /// Returns an iterator visiting all key-value pairs in ascending order by the keys.
210 /// The iterator's element type is `(uint, &'r V)`.
215 /// use std::collections::VecMap;
217 /// let mut map = VecMap::new();
218 /// map.insert(1, "a");
219 /// map.insert(3, "c");
220 /// map.insert(2, "b");
222 /// // Print `1: a` then `2: b` then `3: c`
223 /// for (key, value) in map.iter() {
224 /// println!("{}: {}", key, value);
228 pub fn iter<'r>(&'r self) -> Iter<'r, V> {
236 /// Returns an iterator visiting all key-value pairs in ascending order by the keys,
237 /// with mutable references to the values.
238 /// The iterator's element type is `(uint, &'r mut V)`.
243 /// use std::collections::VecMap;
245 /// let mut map = VecMap::new();
246 /// map.insert(1, "a");
247 /// map.insert(2, "b");
248 /// map.insert(3, "c");
250 /// for (key, value) in map.iter_mut() {
254 /// for (key, value) in map.iter() {
255 /// assert_eq!(value, &"x");
259 pub fn iter_mut<'r>(&'r mut self) -> IterMut<'r, V> {
263 iter: self.v.iter_mut()
267 /// Returns an iterator visiting all key-value pairs in ascending order by
268 /// the keys, consuming the original `VecMap`.
269 /// The iterator's element type is `(uint, &'r V)`.
274 /// use std::collections::VecMap;
276 /// let mut map = VecMap::new();
277 /// map.insert(1, "a");
278 /// map.insert(3, "c");
279 /// map.insert(2, "b");
281 /// // Not possible with .iter()
282 /// let vec: Vec<(uint, &str)> = map.into_iter().collect();
284 /// assert_eq!(vec, vec![(1, "a"), (2, "b"), (3, "c")]);
287 pub fn into_iter(self) -> IntoIter<V> {
288 fn filter<A>((i, v): (uint, Option<A>)) -> Option<(uint, A)> {
291 let filter: fn((uint, Option<V>)) -> Option<(uint, V)> = filter; // coerce to fn ptr
293 IntoIter { iter: self.v.into_iter().enumerate().filter_map(filter) }
296 /// Return the number of elements in the map.
301 /// use std::collections::VecMap;
303 /// let mut a = VecMap::new();
304 /// assert_eq!(a.len(), 0);
305 /// a.insert(1, "a");
306 /// assert_eq!(a.len(), 1);
309 pub fn len(&self) -> uint {
310 self.v.iter().filter(|elt| elt.is_some()).count()
313 /// Return true if the map contains no elements.
318 /// use std::collections::VecMap;
320 /// let mut a = VecMap::new();
321 /// assert!(a.is_empty());
322 /// a.insert(1, "a");
323 /// assert!(!a.is_empty());
326 pub fn is_empty(&self) -> bool {
327 self.v.iter().all(|elt| elt.is_none())
330 /// Clears the map, removing all key-value pairs.
335 /// use std::collections::VecMap;
337 /// let mut a = VecMap::new();
338 /// a.insert(1, "a");
340 /// assert!(a.is_empty());
343 pub fn clear(&mut self) { self.v.clear() }
345 /// Returns a reference to the value corresponding to the key.
350 /// use std::collections::VecMap;
352 /// let mut map = VecMap::new();
353 /// map.insert(1, "a");
354 /// assert_eq!(map.get(&1), Some(&"a"));
355 /// assert_eq!(map.get(&2), None);
358 pub fn get(&self, key: &uint) -> Option<&V> {
359 if *key < self.v.len() {
361 Some(ref value) => Some(value),
369 /// Returns true if the map contains a value for the specified key.
374 /// use std::collections::VecMap;
376 /// let mut map = VecMap::new();
377 /// map.insert(1, "a");
378 /// assert_eq!(map.contains_key(&1), true);
379 /// assert_eq!(map.contains_key(&2), false);
383 pub fn contains_key(&self, key: &uint) -> bool {
384 self.get(key).is_some()
387 /// Returns a mutable reference to the value corresponding to the key.
392 /// use std::collections::VecMap;
394 /// let mut map = VecMap::new();
395 /// map.insert(1, "a");
396 /// match map.get_mut(&1) {
397 /// Some(x) => *x = "b",
400 /// assert_eq!(map[1], "b");
403 pub fn get_mut(&mut self, key: &uint) -> Option<&mut V> {
404 if *key < self.v.len() {
405 match *(&mut self.v[*key]) {
406 Some(ref mut value) => Some(value),
414 /// Inserts a key-value pair from the map. If the key already had a value
415 /// present in the map, that value is returned. Otherwise, `None` is returned.
420 /// use std::collections::VecMap;
422 /// let mut map = VecMap::new();
423 /// assert_eq!(map.insert(37, "a"), None);
424 /// assert_eq!(map.is_empty(), false);
426 /// map.insert(37, "b");
427 /// assert_eq!(map.insert(37, "c"), Some("b"));
428 /// assert_eq!(map[37], "c");
431 pub fn insert(&mut self, key: uint, value: V) -> Option<V> {
432 let len = self.v.len();
434 self.v.extend(range(0, key - len + 1).map(|_| None));
436 replace(&mut self.v[key], Some(value))
439 /// Removes a key from the map, returning the value at the key if the key
440 /// was previously in the map.
445 /// use std::collections::VecMap;
447 /// let mut map = VecMap::new();
448 /// map.insert(1, "a");
449 /// assert_eq!(map.remove(&1), Some("a"));
450 /// assert_eq!(map.remove(&1), None);
453 pub fn remove(&mut self, key: &uint) -> Option<V> {
454 if *key >= self.v.len() {
457 let result = &mut self.v[*key];
463 impl<V: PartialEq> PartialEq for VecMap<V> {
464 fn eq(&self, other: &VecMap<V>) -> bool {
465 iter::order::eq(self.iter(), other.iter())
470 impl<V: Eq> Eq for VecMap<V> {}
473 impl<V: PartialOrd> PartialOrd for VecMap<V> {
475 fn partial_cmp(&self, other: &VecMap<V>) -> Option<Ordering> {
476 iter::order::partial_cmp(self.iter(), other.iter())
481 impl<V: Ord> Ord for VecMap<V> {
483 fn cmp(&self, other: &VecMap<V>) -> Ordering {
484 iter::order::cmp(self.iter(), other.iter())
489 impl<V: fmt::Show> fmt::Show for VecMap<V> {
490 fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
491 try!(write!(f, "VecMap {{"));
493 for (i, (k, v)) in self.iter().enumerate() {
494 if i != 0 { try!(write!(f, ", ")); }
495 try!(write!(f, "{}: {:?}", k, *v));
503 impl<V> FromIterator<(uint, V)> for VecMap<V> {
504 fn from_iter<Iter: Iterator<Item=(uint, V)>>(iter: Iter) -> VecMap<V> {
505 let mut map = VecMap::new();
512 impl<V> Extend<(uint, V)> for VecMap<V> {
513 fn extend<Iter: Iterator<Item=(uint, V)>>(&mut self, mut iter: Iter) {
520 impl<V> Index<uint> for VecMap<V> {
524 fn index<'a>(&'a self, i: &uint) -> &'a V {
525 self.get(i).expect("key not present")
530 impl<V> IndexMut<uint> for VecMap<V> {
534 fn index_mut<'a>(&'a mut self, i: &uint) -> &'a mut V {
535 self.get_mut(i).expect("key not present")
539 macro_rules! iterator {
540 (impl $name:ident -> $elem:ty, $($getter:ident),+) => {
542 impl<'a, V> Iterator for $name<'a, V> {
546 fn next(&mut self) -> Option<$elem> {
547 while self.front < self.back {
548 match self.iter.next() {
550 match elem$(. $getter ())+ {
552 let index = self.front;
554 return Some((index, x));
567 fn size_hint(&self) -> (uint, Option<uint>) {
568 (0, Some(self.back - self.front))
574 macro_rules! double_ended_iterator {
575 (impl $name:ident -> $elem:ty, $($getter:ident),+) => {
577 impl<'a, V> DoubleEndedIterator for $name<'a, V> {
579 fn next_back(&mut self) -> Option<$elem> {
580 while self.front < self.back {
581 match self.iter.next_back() {
583 match elem$(. $getter ())+ {
586 return Some((self.back, x));
601 /// An iterator over the key-value pairs of a map.
603 pub struct Iter<'a, V:'a> {
606 iter: slice::Iter<'a, Option<V>>
609 // FIXME(#19839) Remove in favor of `#[derive(Clone)]`
610 impl<'a, V> Clone for Iter<'a, V> {
611 fn clone(&self) -> Iter<'a, V> {
615 iter: self.iter.clone()
620 iterator! { impl Iter -> (uint, &'a V), as_ref }
621 double_ended_iterator! { impl Iter -> (uint, &'a V), as_ref }
623 /// An iterator over the key-value pairs of a map, with the
624 /// values being mutable.
626 pub struct IterMut<'a, V:'a> {
629 iter: slice::IterMut<'a, Option<V>>
632 iterator! { impl IterMut -> (uint, &'a mut V), as_mut }
633 double_ended_iterator! { impl IterMut -> (uint, &'a mut V), as_mut }
635 /// An iterator over the keys of a map.
637 pub struct Keys<'a, V: 'a> {
638 iter: Map<(uint, &'a V), uint, Iter<'a, V>, fn((uint, &'a V)) -> uint>
641 // FIXME(#19839) Remove in favor of `#[derive(Clone)]`
642 impl<'a, V> Clone for Keys<'a, V> {
643 fn clone(&self) -> Keys<'a, V> {
645 iter: self.iter.clone()
650 /// An iterator over the values of a map.
652 pub struct Values<'a, V: 'a> {
653 iter: Map<(uint, &'a V), &'a V, Iter<'a, V>, fn((uint, &'a V)) -> &'a V>
656 // FIXME(#19839) Remove in favor of `#[derive(Clone)]`
657 impl<'a, V> Clone for Values<'a, V> {
658 fn clone(&self) -> Values<'a, V> {
660 iter: self.iter.clone()
665 /// A consuming iterator over the key-value pairs of a map.
667 pub struct IntoIter<V> {
671 Enumerate<vec::IntoIter<Option<V>>>,
672 fn((uint, Option<V>)) -> Option<(uint, V)>>
676 impl<'a, V> Iterator for Keys<'a, V> {
679 fn next(&mut self) -> Option<uint> { self.iter.next() }
680 fn size_hint(&self) -> (uint, Option<uint>) { self.iter.size_hint() }
683 impl<'a, V> DoubleEndedIterator for Keys<'a, V> {
684 fn next_back(&mut self) -> Option<uint> { self.iter.next_back() }
688 impl<'a, V> Iterator for Values<'a, V> {
691 fn next(&mut self) -> Option<(&'a V)> { self.iter.next() }
692 fn size_hint(&self) -> (uint, Option<uint>) { self.iter.size_hint() }
695 impl<'a, V> DoubleEndedIterator for Values<'a, V> {
696 fn next_back(&mut self) -> Option<(&'a V)> { self.iter.next_back() }
700 impl<V> Iterator for IntoIter<V> {
701 type Item = (uint, V);
703 fn next(&mut self) -> Option<(uint, V)> { self.iter.next() }
704 fn size_hint(&self) -> (uint, Option<uint>) { self.iter.size_hint() }
707 impl<V> DoubleEndedIterator for IntoIter<V> {
708 fn next_back(&mut self) -> Option<(uint, V)> { self.iter.next_back() }
714 use core::hash::{hash, SipHasher};
720 let mut m = VecMap::new();
721 assert!(m.insert(1, 12i).is_none());
722 assert!(m.insert(2, 8).is_none());
723 assert!(m.insert(5, 14).is_none());
725 match m.get_mut(&5) {
726 None => panic!(), Some(x) => *x = new
728 assert_eq!(m.get(&5), Some(&new));
733 let mut map = VecMap::new();
734 assert_eq!(map.len(), 0);
735 assert!(map.is_empty());
736 assert!(map.insert(5, 20i).is_none());
737 assert_eq!(map.len(), 1);
738 assert!(!map.is_empty());
739 assert!(map.insert(11, 12).is_none());
740 assert_eq!(map.len(), 2);
741 assert!(!map.is_empty());
742 assert!(map.insert(14, 22).is_none());
743 assert_eq!(map.len(), 3);
744 assert!(!map.is_empty());
749 let mut map = VecMap::new();
750 assert!(map.insert(5, 20i).is_none());
751 assert!(map.insert(11, 12).is_none());
752 assert!(map.insert(14, 22).is_none());
754 assert!(map.is_empty());
755 assert!(map.get(&5).is_none());
756 assert!(map.get(&11).is_none());
757 assert!(map.get(&14).is_none());
762 let mut m = VecMap::new();
763 assert_eq!(m.insert(1, 2i), None);
764 assert_eq!(m.insert(1, 3i), Some(2));
765 assert_eq!(m.insert(1, 4i), Some(3));
770 let mut m = VecMap::new();
772 assert_eq!(m.remove(&1), Some(2));
773 assert_eq!(m.remove(&1), None);
778 let mut map = VecMap::new();
782 let keys = map.keys().collect::<Vec<uint>>();
783 assert_eq!(keys.len(), 3);
784 assert!(keys.contains(&1));
785 assert!(keys.contains(&2));
786 assert!(keys.contains(&3));
791 let mut map = VecMap::new();
795 let values = map.values().map(|&v| v).collect::<Vec<char>>();
796 assert_eq!(values.len(), 3);
797 assert!(values.contains(&'a'));
798 assert!(values.contains(&'b'));
799 assert!(values.contains(&'c'));
804 let mut m = VecMap::new();
806 assert!(m.insert(0, 1i).is_none());
807 assert!(m.insert(1, 2).is_none());
808 assert!(m.insert(3, 5).is_none());
809 assert!(m.insert(6, 10).is_none());
810 assert!(m.insert(10, 11).is_none());
812 let mut it = m.iter();
813 assert_eq!(it.size_hint(), (0, Some(11)));
814 assert_eq!(it.next().unwrap(), (0, &1));
815 assert_eq!(it.size_hint(), (0, Some(10)));
816 assert_eq!(it.next().unwrap(), (1, &2));
817 assert_eq!(it.size_hint(), (0, Some(9)));
818 assert_eq!(it.next().unwrap(), (3, &5));
819 assert_eq!(it.size_hint(), (0, Some(7)));
820 assert_eq!(it.next().unwrap(), (6, &10));
821 assert_eq!(it.size_hint(), (0, Some(4)));
822 assert_eq!(it.next().unwrap(), (10, &11));
823 assert_eq!(it.size_hint(), (0, Some(0)));
824 assert!(it.next().is_none());
828 fn test_iterator_size_hints() {
829 let mut m = VecMap::new();
831 assert!(m.insert(0, 1i).is_none());
832 assert!(m.insert(1, 2).is_none());
833 assert!(m.insert(3, 5).is_none());
834 assert!(m.insert(6, 10).is_none());
835 assert!(m.insert(10, 11).is_none());
837 assert_eq!(m.iter().size_hint(), (0, Some(11)));
838 assert_eq!(m.iter().rev().size_hint(), (0, Some(11)));
839 assert_eq!(m.iter_mut().size_hint(), (0, Some(11)));
840 assert_eq!(m.iter_mut().rev().size_hint(), (0, Some(11)));
844 fn test_mut_iterator() {
845 let mut m = VecMap::new();
847 assert!(m.insert(0, 1i).is_none());
848 assert!(m.insert(1, 2).is_none());
849 assert!(m.insert(3, 5).is_none());
850 assert!(m.insert(6, 10).is_none());
851 assert!(m.insert(10, 11).is_none());
853 for (k, v) in m.iter_mut() {
857 let mut it = m.iter();
858 assert_eq!(it.next().unwrap(), (0, &1));
859 assert_eq!(it.next().unwrap(), (1, &3));
860 assert_eq!(it.next().unwrap(), (3, &8));
861 assert_eq!(it.next().unwrap(), (6, &16));
862 assert_eq!(it.next().unwrap(), (10, &21));
863 assert!(it.next().is_none());
867 fn test_rev_iterator() {
868 let mut m = VecMap::new();
870 assert!(m.insert(0, 1i).is_none());
871 assert!(m.insert(1, 2).is_none());
872 assert!(m.insert(3, 5).is_none());
873 assert!(m.insert(6, 10).is_none());
874 assert!(m.insert(10, 11).is_none());
876 let mut it = m.iter().rev();
877 assert_eq!(it.next().unwrap(), (10, &11));
878 assert_eq!(it.next().unwrap(), (6, &10));
879 assert_eq!(it.next().unwrap(), (3, &5));
880 assert_eq!(it.next().unwrap(), (1, &2));
881 assert_eq!(it.next().unwrap(), (0, &1));
882 assert!(it.next().is_none());
886 fn test_mut_rev_iterator() {
887 let mut m = VecMap::new();
889 assert!(m.insert(0, 1i).is_none());
890 assert!(m.insert(1, 2).is_none());
891 assert!(m.insert(3, 5).is_none());
892 assert!(m.insert(6, 10).is_none());
893 assert!(m.insert(10, 11).is_none());
895 for (k, v) in m.iter_mut().rev() {
899 let mut it = m.iter();
900 assert_eq!(it.next().unwrap(), (0, &1));
901 assert_eq!(it.next().unwrap(), (1, &3));
902 assert_eq!(it.next().unwrap(), (3, &8));
903 assert_eq!(it.next().unwrap(), (6, &16));
904 assert_eq!(it.next().unwrap(), (10, &21));
905 assert!(it.next().is_none());
909 fn test_move_iter() {
910 let mut m = VecMap::new();
912 let mut called = false;
913 for (k, v) in m.into_iter() {
917 assert_eq!(v, box 2i);
925 let mut map = VecMap::new();
926 let empty = VecMap::<int>::new();
931 let map_str = format!("{:?}", map);
932 assert!(map_str == "VecMap {1: 2i, 3: 4i}" || map_str == "{3: 4i, 1: 2i}");
933 assert_eq!(format!("{:?}", empty), "VecMap {}");
938 let mut a = VecMap::new();
944 assert!(a.clone() == a);
949 let mut a = VecMap::new();
950 let mut b = VecMap::new();
953 assert!(a.insert(0, 5i).is_none());
955 assert!(b.insert(0, 4i).is_none());
957 assert!(a.insert(5, 19).is_none());
959 assert!(!b.insert(0, 5).is_none());
961 assert!(b.insert(5, 19).is_none());
965 b = VecMap::with_capacity(1);
971 let mut a = VecMap::new();
972 let mut b = VecMap::new();
974 assert!(!(a < b) && !(b < a));
975 assert!(b.insert(2u, 5i).is_none());
977 assert!(a.insert(2, 7).is_none());
978 assert!(!(a < b) && b < a);
979 assert!(b.insert(1, 0).is_none());
981 assert!(a.insert(0, 6).is_none());
983 assert!(a.insert(6, 2).is_none());
984 assert!(a < b && !(b < a));
989 let mut a = VecMap::new();
990 let mut b = VecMap::new();
992 assert!(a <= b && a >= b);
993 assert!(a.insert(1u, 1i).is_none());
994 assert!(a > b && a >= b);
995 assert!(b < a && b <= a);
996 assert!(b.insert(2, 2).is_none());
997 assert!(b > a && b >= a);
998 assert!(a < b && a <= b);
1003 let mut x = VecMap::new();
1004 let mut y = VecMap::new();
1006 assert!(hash::<_, SipHasher>(&x) == hash::<_, SipHasher>(&y));
1015 assert!(hash::<_, SipHasher>(&x) == hash::<_, SipHasher>(&y));
1017 x.insert(1000, 'd');
1020 assert!(hash::<_, SipHasher>(&x) == hash::<_, SipHasher>(&y));
1024 fn test_from_iter() {
1025 let xs: Vec<(uint, char)> = vec![(1u, 'a'), (2, 'b'), (3, 'c'), (4, 'd'), (5, 'e')];
1027 let map: VecMap<char> = xs.iter().map(|&x| x).collect();
1029 for &(k, v) in xs.iter() {
1030 assert_eq!(map.get(&k), Some(&v));
1036 let mut map: VecMap<int> = VecMap::new();
1042 assert_eq!(map[3], 4);
1047 fn test_index_nonexistent() {
1048 let mut map: VecMap<int> = VecMap::new();
1062 use bench::{insert_rand_n, insert_seq_n, find_rand_n, find_seq_n};
1065 pub fn insert_rand_100(b: &mut Bencher) {
1066 let mut m : VecMap<uint> = VecMap::new();
1067 insert_rand_n(100, &mut m, b,
1068 |m, i| { m.insert(i, 1); },
1069 |m, i| { m.remove(&i); });
1073 pub fn insert_rand_10_000(b: &mut Bencher) {
1074 let mut m : VecMap<uint> = VecMap::new();
1075 insert_rand_n(10_000, &mut m, b,
1076 |m, i| { m.insert(i, 1); },
1077 |m, i| { m.remove(&i); });
1082 pub fn insert_seq_100(b: &mut Bencher) {
1083 let mut m : VecMap<uint> = VecMap::new();
1084 insert_seq_n(100, &mut m, b,
1085 |m, i| { m.insert(i, 1); },
1086 |m, i| { m.remove(&i); });
1090 pub fn insert_seq_10_000(b: &mut Bencher) {
1091 let mut m : VecMap<uint> = VecMap::new();
1092 insert_seq_n(10_000, &mut m, b,
1093 |m, i| { m.insert(i, 1); },
1094 |m, i| { m.remove(&i); });
1099 pub fn find_rand_100(b: &mut Bencher) {
1100 let mut m : VecMap<uint> = VecMap::new();
1101 find_rand_n(100, &mut m, b,
1102 |m, i| { m.insert(i, 1); },
1103 |m, i| { m.get(&i); });
1107 pub fn find_rand_10_000(b: &mut Bencher) {
1108 let mut m : VecMap<uint> = VecMap::new();
1109 find_rand_n(10_000, &mut m, b,
1110 |m, i| { m.insert(i, 1); },
1111 |m, i| { m.get(&i); });
1116 pub fn find_seq_100(b: &mut Bencher) {
1117 let mut m : VecMap<uint> = VecMap::new();
1118 find_seq_n(100, &mut m, b,
1119 |m, i| { m.insert(i, 1); },
1120 |m, i| { m.get(&i); });
1124 pub fn find_seq_10_000(b: &mut Bencher) {
1125 let mut m : VecMap<uint> = VecMap::new();
1126 find_seq_n(10_000, &mut m, b,
1127 |m, i| { m.insert(i, 1); },
1128 |m, i| { m.get(&i); });