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, emptying (but not 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(&mut 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 let values = replace(&mut self.v, vec!());
294 IntoIter { iter: values.into_iter().enumerate().filter_map(filter) }
297 /// Return the number of elements in the map.
302 /// use std::collections::VecMap;
304 /// let mut a = VecMap::new();
305 /// assert_eq!(a.len(), 0);
306 /// a.insert(1, "a");
307 /// assert_eq!(a.len(), 1);
310 pub fn len(&self) -> uint {
311 self.v.iter().filter(|elt| elt.is_some()).count()
314 /// Return true if the map contains no elements.
319 /// use std::collections::VecMap;
321 /// let mut a = VecMap::new();
322 /// assert!(a.is_empty());
323 /// a.insert(1, "a");
324 /// assert!(!a.is_empty());
327 pub fn is_empty(&self) -> bool {
328 self.v.iter().all(|elt| elt.is_none())
331 /// Clears the map, removing all key-value pairs.
336 /// use std::collections::VecMap;
338 /// let mut a = VecMap::new();
339 /// a.insert(1, "a");
341 /// assert!(a.is_empty());
344 pub fn clear(&mut self) { self.v.clear() }
346 /// Returns a reference to the value corresponding to the key.
351 /// use std::collections::VecMap;
353 /// let mut map = VecMap::new();
354 /// map.insert(1, "a");
355 /// assert_eq!(map.get(&1), Some(&"a"));
356 /// assert_eq!(map.get(&2), None);
359 pub fn get(&self, key: &uint) -> Option<&V> {
360 if *key < self.v.len() {
362 Some(ref value) => Some(value),
370 /// Returns true if the map contains a value for the specified key.
375 /// use std::collections::VecMap;
377 /// let mut map = VecMap::new();
378 /// map.insert(1, "a");
379 /// assert_eq!(map.contains_key(&1), true);
380 /// assert_eq!(map.contains_key(&2), false);
384 pub fn contains_key(&self, key: &uint) -> bool {
385 self.get(key).is_some()
388 /// Returns a mutable reference to the value corresponding to the key.
393 /// use std::collections::VecMap;
395 /// let mut map = VecMap::new();
396 /// map.insert(1, "a");
397 /// match map.get_mut(&1) {
398 /// Some(x) => *x = "b",
401 /// assert_eq!(map[1], "b");
404 pub fn get_mut(&mut self, key: &uint) -> Option<&mut V> {
405 if *key < self.v.len() {
406 match *(&mut self.v[*key]) {
407 Some(ref mut value) => Some(value),
415 /// Inserts a key-value pair from the map. If the key already had a value
416 /// present in the map, that value is returned. Otherwise, `None` is returned.
421 /// use std::collections::VecMap;
423 /// let mut map = VecMap::new();
424 /// assert_eq!(map.insert(37, "a"), None);
425 /// assert_eq!(map.is_empty(), false);
427 /// map.insert(37, "b");
428 /// assert_eq!(map.insert(37, "c"), Some("b"));
429 /// assert_eq!(map[37], "c");
432 pub fn insert(&mut self, key: uint, value: V) -> Option<V> {
433 let len = self.v.len();
435 self.v.extend(range(0, key - len + 1).map(|_| None));
437 replace(&mut self.v[key], Some(value))
440 /// Removes a key from the map, returning the value at the key if the key
441 /// was previously in the map.
446 /// use std::collections::VecMap;
448 /// let mut map = VecMap::new();
449 /// map.insert(1, "a");
450 /// assert_eq!(map.remove(&1), Some("a"));
451 /// assert_eq!(map.remove(&1), None);
454 pub fn remove(&mut self, key: &uint) -> Option<V> {
455 if *key >= self.v.len() {
458 let result = &mut self.v[*key];
464 impl<V: PartialEq> PartialEq for VecMap<V> {
465 fn eq(&self, other: &VecMap<V>) -> bool {
466 iter::order::eq(self.iter(), other.iter())
471 impl<V: Eq> Eq for VecMap<V> {}
474 impl<V: PartialOrd> PartialOrd for VecMap<V> {
476 fn partial_cmp(&self, other: &VecMap<V>) -> Option<Ordering> {
477 iter::order::partial_cmp(self.iter(), other.iter())
482 impl<V: Ord> Ord for VecMap<V> {
484 fn cmp(&self, other: &VecMap<V>) -> Ordering {
485 iter::order::cmp(self.iter(), other.iter())
490 impl<V: fmt::Show> fmt::Show for VecMap<V> {
491 fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
492 try!(write!(f, "VecMap {{"));
494 for (i, (k, v)) in self.iter().enumerate() {
495 if i != 0 { try!(write!(f, ", ")); }
496 try!(write!(f, "{}: {:?}", k, *v));
504 impl<V> FromIterator<(uint, V)> for VecMap<V> {
505 fn from_iter<Iter: Iterator<Item=(uint, V)>>(iter: Iter) -> VecMap<V> {
506 let mut map = VecMap::new();
513 impl<V> Extend<(uint, V)> for VecMap<V> {
514 fn extend<Iter: Iterator<Item=(uint, V)>>(&mut self, mut iter: Iter) {
521 impl<V> Index<uint> for VecMap<V> {
525 fn index<'a>(&'a self, i: &uint) -> &'a V {
526 self.get(i).expect("key not present")
531 impl<V> IndexMut<uint> for VecMap<V> {
535 fn index_mut<'a>(&'a mut self, i: &uint) -> &'a mut V {
536 self.get_mut(i).expect("key not present")
540 macro_rules! iterator {
541 (impl $name:ident -> $elem:ty, $($getter:ident),+) => {
543 impl<'a, V> Iterator for $name<'a, V> {
547 fn next(&mut self) -> Option<$elem> {
548 while self.front < self.back {
549 match self.iter.next() {
551 match elem$(. $getter ())+ {
553 let index = self.front;
555 return Some((index, x));
568 fn size_hint(&self) -> (uint, Option<uint>) {
569 (0, Some(self.back - self.front))
575 macro_rules! double_ended_iterator {
576 (impl $name:ident -> $elem:ty, $($getter:ident),+) => {
578 impl<'a, V> DoubleEndedIterator for $name<'a, V> {
580 fn next_back(&mut self) -> Option<$elem> {
581 while self.front < self.back {
582 match self.iter.next_back() {
584 match elem$(. $getter ())+ {
587 return Some((self.back, x));
602 /// An iterator over the key-value pairs of a map.
604 pub struct Iter<'a, V:'a> {
607 iter: slice::Iter<'a, Option<V>>
610 // FIXME(#19839) Remove in favor of `#[derive(Clone)]`
611 impl<'a, V> Clone for Iter<'a, V> {
612 fn clone(&self) -> Iter<'a, V> {
616 iter: self.iter.clone()
621 iterator! { impl Iter -> (uint, &'a V), as_ref }
622 double_ended_iterator! { impl Iter -> (uint, &'a V), as_ref }
624 /// An iterator over the key-value pairs of a map, with the
625 /// values being mutable.
627 pub struct IterMut<'a, V:'a> {
630 iter: slice::IterMut<'a, Option<V>>
633 iterator! { impl IterMut -> (uint, &'a mut V), as_mut }
634 double_ended_iterator! { impl IterMut -> (uint, &'a mut V), as_mut }
636 /// An iterator over the keys of a map.
638 pub struct Keys<'a, V: 'a> {
639 iter: Map<(uint, &'a V), uint, Iter<'a, V>, fn((uint, &'a V)) -> uint>
642 // FIXME(#19839) Remove in favor of `#[derive(Clone)]`
643 impl<'a, V> Clone for Keys<'a, V> {
644 fn clone(&self) -> Keys<'a, V> {
646 iter: self.iter.clone()
651 /// An iterator over the values of a map.
653 pub struct Values<'a, V: 'a> {
654 iter: Map<(uint, &'a V), &'a V, Iter<'a, V>, fn((uint, &'a V)) -> &'a V>
657 // FIXME(#19839) Remove in favor of `#[derive(Clone)]`
658 impl<'a, V> Clone for Values<'a, V> {
659 fn clone(&self) -> Values<'a, V> {
661 iter: self.iter.clone()
666 /// A consuming iterator over the key-value pairs of a map.
668 pub struct IntoIter<V> {
672 Enumerate<vec::IntoIter<Option<V>>>,
673 fn((uint, Option<V>)) -> Option<(uint, V)>>
677 impl<'a, V> Iterator for Keys<'a, V> {
680 fn next(&mut self) -> Option<uint> { self.iter.next() }
681 fn size_hint(&self) -> (uint, Option<uint>) { self.iter.size_hint() }
684 impl<'a, V> DoubleEndedIterator for Keys<'a, V> {
685 fn next_back(&mut self) -> Option<uint> { self.iter.next_back() }
689 impl<'a, V> Iterator for Values<'a, V> {
692 fn next(&mut self) -> Option<(&'a V)> { self.iter.next() }
693 fn size_hint(&self) -> (uint, Option<uint>) { self.iter.size_hint() }
696 impl<'a, V> DoubleEndedIterator for Values<'a, V> {
697 fn next_back(&mut self) -> Option<(&'a V)> { self.iter.next_back() }
701 impl<V> Iterator for IntoIter<V> {
702 type Item = (uint, V);
704 fn next(&mut self) -> Option<(uint, V)> { self.iter.next() }
705 fn size_hint(&self) -> (uint, Option<uint>) { self.iter.size_hint() }
708 impl<V> DoubleEndedIterator for IntoIter<V> {
709 fn next_back(&mut self) -> Option<(uint, V)> { self.iter.next_back() }
715 use core::hash::{hash, SipHasher};
721 let mut m = VecMap::new();
722 assert!(m.insert(1, 12i).is_none());
723 assert!(m.insert(2, 8).is_none());
724 assert!(m.insert(5, 14).is_none());
726 match m.get_mut(&5) {
727 None => panic!(), Some(x) => *x = new
729 assert_eq!(m.get(&5), Some(&new));
734 let mut map = VecMap::new();
735 assert_eq!(map.len(), 0);
736 assert!(map.is_empty());
737 assert!(map.insert(5, 20i).is_none());
738 assert_eq!(map.len(), 1);
739 assert!(!map.is_empty());
740 assert!(map.insert(11, 12).is_none());
741 assert_eq!(map.len(), 2);
742 assert!(!map.is_empty());
743 assert!(map.insert(14, 22).is_none());
744 assert_eq!(map.len(), 3);
745 assert!(!map.is_empty());
750 let mut map = VecMap::new();
751 assert!(map.insert(5, 20i).is_none());
752 assert!(map.insert(11, 12).is_none());
753 assert!(map.insert(14, 22).is_none());
755 assert!(map.is_empty());
756 assert!(map.get(&5).is_none());
757 assert!(map.get(&11).is_none());
758 assert!(map.get(&14).is_none());
763 let mut m = VecMap::new();
764 assert_eq!(m.insert(1, 2i), None);
765 assert_eq!(m.insert(1, 3i), Some(2));
766 assert_eq!(m.insert(1, 4i), Some(3));
771 let mut m = VecMap::new();
773 assert_eq!(m.remove(&1), Some(2));
774 assert_eq!(m.remove(&1), None);
779 let mut map = VecMap::new();
783 let keys = map.keys().collect::<Vec<uint>>();
784 assert_eq!(keys.len(), 3);
785 assert!(keys.contains(&1));
786 assert!(keys.contains(&2));
787 assert!(keys.contains(&3));
792 let mut map = VecMap::new();
796 let values = map.values().map(|&v| v).collect::<Vec<char>>();
797 assert_eq!(values.len(), 3);
798 assert!(values.contains(&'a'));
799 assert!(values.contains(&'b'));
800 assert!(values.contains(&'c'));
805 let mut m = VecMap::new();
807 assert!(m.insert(0, 1i).is_none());
808 assert!(m.insert(1, 2).is_none());
809 assert!(m.insert(3, 5).is_none());
810 assert!(m.insert(6, 10).is_none());
811 assert!(m.insert(10, 11).is_none());
813 let mut it = m.iter();
814 assert_eq!(it.size_hint(), (0, Some(11)));
815 assert_eq!(it.next().unwrap(), (0, &1));
816 assert_eq!(it.size_hint(), (0, Some(10)));
817 assert_eq!(it.next().unwrap(), (1, &2));
818 assert_eq!(it.size_hint(), (0, Some(9)));
819 assert_eq!(it.next().unwrap(), (3, &5));
820 assert_eq!(it.size_hint(), (0, Some(7)));
821 assert_eq!(it.next().unwrap(), (6, &10));
822 assert_eq!(it.size_hint(), (0, Some(4)));
823 assert_eq!(it.next().unwrap(), (10, &11));
824 assert_eq!(it.size_hint(), (0, Some(0)));
825 assert!(it.next().is_none());
829 fn test_iterator_size_hints() {
830 let mut m = VecMap::new();
832 assert!(m.insert(0, 1i).is_none());
833 assert!(m.insert(1, 2).is_none());
834 assert!(m.insert(3, 5).is_none());
835 assert!(m.insert(6, 10).is_none());
836 assert!(m.insert(10, 11).is_none());
838 assert_eq!(m.iter().size_hint(), (0, Some(11)));
839 assert_eq!(m.iter().rev().size_hint(), (0, Some(11)));
840 assert_eq!(m.iter_mut().size_hint(), (0, Some(11)));
841 assert_eq!(m.iter_mut().rev().size_hint(), (0, Some(11)));
845 fn test_mut_iterator() {
846 let mut m = VecMap::new();
848 assert!(m.insert(0, 1i).is_none());
849 assert!(m.insert(1, 2).is_none());
850 assert!(m.insert(3, 5).is_none());
851 assert!(m.insert(6, 10).is_none());
852 assert!(m.insert(10, 11).is_none());
854 for (k, v) in m.iter_mut() {
858 let mut it = m.iter();
859 assert_eq!(it.next().unwrap(), (0, &1));
860 assert_eq!(it.next().unwrap(), (1, &3));
861 assert_eq!(it.next().unwrap(), (3, &8));
862 assert_eq!(it.next().unwrap(), (6, &16));
863 assert_eq!(it.next().unwrap(), (10, &21));
864 assert!(it.next().is_none());
868 fn test_rev_iterator() {
869 let mut m = VecMap::new();
871 assert!(m.insert(0, 1i).is_none());
872 assert!(m.insert(1, 2).is_none());
873 assert!(m.insert(3, 5).is_none());
874 assert!(m.insert(6, 10).is_none());
875 assert!(m.insert(10, 11).is_none());
877 let mut it = m.iter().rev();
878 assert_eq!(it.next().unwrap(), (10, &11));
879 assert_eq!(it.next().unwrap(), (6, &10));
880 assert_eq!(it.next().unwrap(), (3, &5));
881 assert_eq!(it.next().unwrap(), (1, &2));
882 assert_eq!(it.next().unwrap(), (0, &1));
883 assert!(it.next().is_none());
887 fn test_mut_rev_iterator() {
888 let mut m = VecMap::new();
890 assert!(m.insert(0, 1i).is_none());
891 assert!(m.insert(1, 2).is_none());
892 assert!(m.insert(3, 5).is_none());
893 assert!(m.insert(6, 10).is_none());
894 assert!(m.insert(10, 11).is_none());
896 for (k, v) in m.iter_mut().rev() {
900 let mut it = m.iter();
901 assert_eq!(it.next().unwrap(), (0, &1));
902 assert_eq!(it.next().unwrap(), (1, &3));
903 assert_eq!(it.next().unwrap(), (3, &8));
904 assert_eq!(it.next().unwrap(), (6, &16));
905 assert_eq!(it.next().unwrap(), (10, &21));
906 assert!(it.next().is_none());
910 fn test_move_iter() {
911 let mut m = VecMap::new();
913 let mut called = false;
914 for (k, v) in m.into_iter() {
918 assert_eq!(v, box 2i);
926 let mut map = VecMap::new();
927 let empty = VecMap::<int>::new();
932 let map_str = format!("{:?}", map);
933 assert!(map_str == "VecMap {1: 2i, 3: 4i}" || map_str == "{3: 4i, 1: 2i}");
934 assert_eq!(format!("{:?}", empty), "VecMap {}");
939 let mut a = VecMap::new();
945 assert!(a.clone() == a);
950 let mut a = VecMap::new();
951 let mut b = VecMap::new();
954 assert!(a.insert(0, 5i).is_none());
956 assert!(b.insert(0, 4i).is_none());
958 assert!(a.insert(5, 19).is_none());
960 assert!(!b.insert(0, 5).is_none());
962 assert!(b.insert(5, 19).is_none());
966 b = VecMap::with_capacity(1);
972 let mut a = VecMap::new();
973 let mut b = VecMap::new();
975 assert!(!(a < b) && !(b < a));
976 assert!(b.insert(2u, 5i).is_none());
978 assert!(a.insert(2, 7).is_none());
979 assert!(!(a < b) && b < a);
980 assert!(b.insert(1, 0).is_none());
982 assert!(a.insert(0, 6).is_none());
984 assert!(a.insert(6, 2).is_none());
985 assert!(a < b && !(b < a));
990 let mut a = VecMap::new();
991 let mut b = VecMap::new();
993 assert!(a <= b && a >= b);
994 assert!(a.insert(1u, 1i).is_none());
995 assert!(a > b && a >= b);
996 assert!(b < a && b <= a);
997 assert!(b.insert(2, 2).is_none());
998 assert!(b > a && b >= a);
999 assert!(a < b && a <= b);
1004 let mut x = VecMap::new();
1005 let mut y = VecMap::new();
1007 assert!(hash::<_, SipHasher>(&x) == hash::<_, SipHasher>(&y));
1016 assert!(hash::<_, SipHasher>(&x) == hash::<_, SipHasher>(&y));
1018 x.insert(1000, 'd');
1021 assert!(hash::<_, SipHasher>(&x) == hash::<_, SipHasher>(&y));
1025 fn test_from_iter() {
1026 let xs: Vec<(uint, char)> = vec![(1u, 'a'), (2, 'b'), (3, 'c'), (4, 'd'), (5, 'e')];
1028 let map: VecMap<char> = xs.iter().map(|&x| x).collect();
1030 for &(k, v) in xs.iter() {
1031 assert_eq!(map.get(&k), Some(&v));
1037 let mut map: VecMap<int> = VecMap::new();
1043 assert_eq!(map[3], 4);
1048 fn test_index_nonexistent() {
1049 let mut map: VecMap<int> = VecMap::new();
1063 use bench::{insert_rand_n, insert_seq_n, find_rand_n, find_seq_n};
1066 pub fn insert_rand_100(b: &mut Bencher) {
1067 let mut m : VecMap<uint> = VecMap::new();
1068 insert_rand_n(100, &mut m, b,
1069 |m, i| { m.insert(i, 1); },
1070 |m, i| { m.remove(&i); });
1074 pub fn insert_rand_10_000(b: &mut Bencher) {
1075 let mut m : VecMap<uint> = VecMap::new();
1076 insert_rand_n(10_000, &mut m, b,
1077 |m, i| { m.insert(i, 1); },
1078 |m, i| { m.remove(&i); });
1083 pub fn insert_seq_100(b: &mut Bencher) {
1084 let mut m : VecMap<uint> = VecMap::new();
1085 insert_seq_n(100, &mut m, b,
1086 |m, i| { m.insert(i, 1); },
1087 |m, i| { m.remove(&i); });
1091 pub fn insert_seq_10_000(b: &mut Bencher) {
1092 let mut m : VecMap<uint> = VecMap::new();
1093 insert_seq_n(10_000, &mut m, b,
1094 |m, i| { m.insert(i, 1); },
1095 |m, i| { m.remove(&i); });
1100 pub fn find_rand_100(b: &mut Bencher) {
1101 let mut m : VecMap<uint> = VecMap::new();
1102 find_rand_n(100, &mut m, b,
1103 |m, i| { m.insert(i, 1); },
1104 |m, i| { m.get(&i); });
1108 pub fn find_rand_10_000(b: &mut Bencher) {
1109 let mut m : VecMap<uint> = VecMap::new();
1110 find_rand_n(10_000, &mut m, b,
1111 |m, i| { m.insert(i, 1); },
1112 |m, i| { m.get(&i); });
1117 pub fn find_seq_100(b: &mut Bencher) {
1118 let mut m : VecMap<uint> = VecMap::new();
1119 find_seq_n(100, &mut m, b,
1120 |m, i| { m.insert(i, 1); },
1121 |m, i| { m.get(&i); });
1125 pub fn find_seq_10_000(b: &mut Bencher) {
1126 let mut m : VecMap<uint> = VecMap::new();
1127 find_seq_n(10_000, &mut m, b,
1128 |m, i| { m.insert(i, 1); },
1129 |m, i| { m.get(&i); });