1 // Copyright 2012-2015 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 doubly-linked list with owned nodes.
13 //! The `DList` allows pushing and popping elements at either end and is thus
14 //! efficiently usable as a double-ended queue.
16 // DList is constructed like a singly-linked list over the field `next`.
17 // including the last link being None; each Node owns its `next` field.
19 // Backlinks over DList::prev are raw pointers that form a full chain in
20 // the reverse direction.
26 use alloc::boxed::Box;
27 use core::cmp::Ordering;
28 use core::default::Default;
30 use core::hash::{Writer, Hasher, Hash};
31 use core::iter::{self, FromIterator};
35 /// A doubly-linked list.
40 list_tail: Rawlink<Node<T>>,
43 type Link<T> = Option<Box<Node<T>>>;
49 impl<T> Copy for Rawlink<T> {}
50 unsafe impl<T:'static+Send> Send for Rawlink<T> {}
51 unsafe impl<T:Send+Sync> Sync for Rawlink<T> {}
55 prev: Rawlink<Node<T>>,
59 /// An iterator over references to the items of a `DList`.
61 pub struct Iter<'a, T:'a> {
63 tail: Rawlink<Node<T>>,
67 // FIXME #19839: deriving is too aggressive on the bounds (T doesn't need to be Clone).
69 impl<'a, T> Clone for Iter<'a, T> {
70 fn clone(&self) -> Iter<'a, T> {
72 head: self.head.clone(),
79 /// An iterator over mutable references to the items of a `DList`.
81 pub struct IterMut<'a, T:'a> {
82 list: &'a mut DList<T>,
83 head: Rawlink<Node<T>>,
84 tail: Rawlink<Node<T>>,
88 /// An iterator over mutable references to the items of a `DList`.
91 pub struct IntoIter<T> {
95 /// Rawlink is a type like Option<T> but for holding a raw pointer
97 /// Like Option::None for Rawlink
98 fn none() -> Rawlink<T> {
99 Rawlink{p: ptr::null_mut()}
102 /// Like Option::Some for Rawlink
103 fn some(n: &mut T) -> Rawlink<T> {
107 /// Convert the `Rawlink` into an Option value
108 fn resolve_immut<'a>(&self) -> Option<&'a T> {
110 mem::transmute(self.p.as_ref())
114 /// Convert the `Rawlink` into an Option value
115 fn resolve<'a>(&mut self) -> Option<&'a mut T> {
116 if self.p.is_null() {
119 Some(unsafe { mem::transmute(self.p) })
123 /// Return the `Rawlink` and replace with `Rawlink::none()`
124 fn take(&mut self) -> Rawlink<T> {
125 mem::replace(self, Rawlink::none())
129 impl<T> Clone for Rawlink<T> {
131 fn clone(&self) -> Rawlink<T> {
137 fn new(v: T) -> Node<T> {
138 Node{value: v, next: None, prev: Rawlink::none()}
142 /// Set the .prev field on `next`, then return `Some(next)`
143 fn link_with_prev<T>(mut next: Box<Node<T>>, prev: Rawlink<Node<T>>)
151 /// Add a Node first in the list
153 fn push_front_node(&mut self, mut new_head: Box<Node<T>>) {
154 match self.list_head {
156 self.list_tail = Rawlink::some(&mut *new_head);
157 self.list_head = link_with_prev(new_head, Rawlink::none());
159 Some(ref mut head) => {
160 new_head.prev = Rawlink::none();
161 head.prev = Rawlink::some(&mut *new_head);
162 mem::swap(head, &mut new_head);
163 head.next = Some(new_head);
169 /// Remove the first Node and return it, or None if the list is empty
171 fn pop_front_node(&mut self) -> Option<Box<Node<T>>> {
172 self.list_head.take().map(|mut front_node| {
174 match front_node.next.take() {
175 Some(node) => self.list_head = link_with_prev(node, Rawlink::none()),
176 None => self.list_tail = Rawlink::none()
182 /// Add a Node last in the list
184 fn push_back_node(&mut self, mut new_tail: Box<Node<T>>) {
185 match self.list_tail.resolve() {
186 None => return self.push_front_node(new_tail),
188 self.list_tail = Rawlink::some(&mut *new_tail);
189 tail.next = link_with_prev(new_tail, Rawlink::some(tail));
195 /// Remove the last Node and return it, or None if the list is empty
197 fn pop_back_node(&mut self) -> Option<Box<Node<T>>> {
198 self.list_tail.resolve().map_or(None, |tail| {
200 self.list_tail = tail.prev;
201 match tail.prev.resolve() {
202 None => self.list_head.take(),
203 Some(tail_prev) => tail_prev.next.take()
210 impl<T> Default for DList<T> {
213 fn default() -> DList<T> { DList::new() }
217 /// Creates an empty `DList`.
220 pub fn new() -> DList<T> {
221 DList{list_head: None, list_tail: Rawlink::none(), length: 0}
224 /// Moves all elements from `other` to the end of the list.
226 /// This reuses all the nodes from `other` and moves them into `self`. After
227 /// this operation, `other` becomes empty.
229 /// This operation should compute in O(1) time and O(1) memory.
234 /// use std::collections::DList;
236 /// let mut a = DList::new();
237 /// let mut b = DList::new();
243 /// a.append(&mut b);
245 /// for e in a.iter() {
246 /// println!("{}", e); // prints 1, then 2, then 3, then 4
248 /// println!("{}", b.len()); // prints 0
250 pub fn append(&mut self, other: &mut DList<T>) {
251 match self.list_tail.resolve() {
253 self.length = other.length;
254 self.list_head = other.list_head.take();
255 self.list_tail = other.list_tail.take();
258 // Carefully empty `other`.
259 let o_tail = other.list_tail.take();
260 let o_length = other.length;
261 match other.list_head.take() {
264 tail.next = link_with_prev(node, self.list_tail);
265 self.list_tail = o_tail;
266 self.length += o_length;
274 /// Provides a forward iterator.
277 pub fn iter(&self) -> Iter<T> {
278 Iter{nelem: self.len(), head: &self.list_head, tail: self.list_tail}
281 /// Provides a forward iterator with mutable references.
284 pub fn iter_mut(&mut self) -> IterMut<T> {
285 let head_raw = match self.list_head {
286 Some(ref mut h) => Rawlink::some(&mut **h),
287 None => Rawlink::none(),
292 tail: self.list_tail,
297 /// Consumes the list into an iterator yielding elements by value.
300 pub fn into_iter(self) -> IntoIter<T> {
304 /// Returns `true` if the `DList` is empty.
306 /// This operation should compute in O(1) time.
311 /// use std::collections::DList;
313 /// let mut dl = DList::new();
314 /// assert!(dl.is_empty());
316 /// dl.push_front("foo");
317 /// assert!(!dl.is_empty());
321 pub fn is_empty(&self) -> bool {
322 self.list_head.is_none()
325 /// Returns the length of the `DList`.
327 /// This operation should compute in O(1) time.
332 /// use std::collections::DList;
334 /// let mut dl = DList::new();
336 /// dl.push_front(2is);
337 /// assert_eq!(dl.len(), 1);
339 /// dl.push_front(1);
340 /// assert_eq!(dl.len(), 2);
343 /// assert_eq!(dl.len(), 3);
348 pub fn len(&self) -> uint {
352 /// Removes all elements from the `DList`.
354 /// This operation should compute in O(n) time.
359 /// use std::collections::DList;
361 /// let mut dl = DList::new();
363 /// dl.push_front(2is);
364 /// dl.push_front(1);
365 /// assert_eq!(dl.len(), 2);
366 /// assert_eq!(dl.front(), Some(&1is));
369 /// assert_eq!(dl.len(), 0);
370 /// assert_eq!(dl.front(), None);
375 pub fn clear(&mut self) {
379 /// Provides a reference to the front element, or `None` if the list is
385 /// use std::collections::DList;
387 /// let mut dl = DList::new();
388 /// assert_eq!(dl.front(), None);
390 /// dl.push_front(1);
391 /// assert_eq!(dl.front(), Some(&1is));
396 pub fn front(&self) -> Option<&T> {
397 self.list_head.as_ref().map(|head| &head.value)
400 /// Provides a mutable reference to the front element, or `None` if the list
406 /// use std::collections::DList;
408 /// let mut dl = DList::new();
409 /// assert_eq!(dl.front(), None);
411 /// dl.push_front(1);
412 /// assert_eq!(dl.front(), Some(&1is));
414 /// match dl.front_mut() {
416 /// Some(x) => *x = 5is,
418 /// assert_eq!(dl.front(), Some(&5is));
423 pub fn front_mut(&mut self) -> Option<&mut T> {
424 self.list_head.as_mut().map(|head| &mut head.value)
427 /// Provides a reference to the back element, or `None` if the list is
433 /// use std::collections::DList;
435 /// let mut dl = DList::new();
436 /// assert_eq!(dl.back(), None);
439 /// assert_eq!(dl.back(), Some(&1is));
444 pub fn back(&self) -> Option<&T> {
445 self.list_tail.resolve_immut().as_ref().map(|tail| &tail.value)
448 /// Provides a mutable reference to the back element, or `None` if the list
454 /// use std::collections::DList;
456 /// let mut dl = DList::new();
457 /// assert_eq!(dl.back(), None);
460 /// assert_eq!(dl.back(), Some(&1is));
462 /// match dl.back_mut() {
464 /// Some(x) => *x = 5is,
466 /// assert_eq!(dl.back(), Some(&5is));
471 pub fn back_mut(&mut self) -> Option<&mut T> {
472 self.list_tail.resolve().map(|tail| &mut tail.value)
475 /// Adds an element first in the list.
477 /// This operation should compute in O(1) time.
482 /// use std::collections::DList;
484 /// let mut dl = DList::new();
486 /// dl.push_front(2is);
487 /// assert_eq!(dl.front().unwrap(), &2is);
489 /// dl.push_front(1);
490 /// assert_eq!(dl.front().unwrap(), &1);
494 pub fn push_front(&mut self, elt: T) {
495 self.push_front_node(box Node::new(elt))
498 /// Removes the first element and returns it, or `None` if the list is
501 /// This operation should compute in O(1) time.
506 /// use std::collections::DList;
508 /// let mut d = DList::new();
509 /// assert_eq!(d.pop_front(), None);
511 /// d.push_front(1is);
513 /// assert_eq!(d.pop_front(), Some(3));
514 /// assert_eq!(d.pop_front(), Some(1));
515 /// assert_eq!(d.pop_front(), None);
520 pub fn pop_front(&mut self) -> Option<T> {
521 self.pop_front_node().map(|box Node{value, ..}| value)
524 /// Appends an element to the back of a list
529 /// use std::collections::DList;
531 /// let mut d = DList::new();
534 /// assert_eq!(3, *d.back().unwrap());
537 pub fn push_back(&mut self, elt: T) {
538 self.push_back_node(box Node::new(elt))
541 /// Removes the last element from a list and returns it, or `None` if
547 /// use std::collections::DList;
549 /// let mut d = DList::new();
550 /// assert_eq!(d.pop_back(), None);
553 /// assert_eq!(d.pop_back(), Some(3));
556 pub fn pop_back(&mut self) -> Option<T> {
557 self.pop_back_node().map(|box Node{value, ..}| value)
560 /// Splits the list into two at the given index. Returns everything after the given index,
561 /// including the index.
563 /// This operation should compute in O(n) time.
567 /// use std::collections::DList;
569 /// let mut d = DList::new();
571 /// d.push_front(1is);
575 /// let mut splitted = d.split_off(2);
577 /// assert_eq!(splitted.pop_front(), Some(1));
578 /// assert_eq!(splitted.pop_front(), None);
581 pub fn split_off(&mut self, at: uint) -> DList<T> {
582 let len = self.len();
583 assert!(at < len, "Cannot split off at a nonexistent index");
585 return mem::replace(self, DList::new());
588 // Below, we iterate towards the `i-1`th node, either from the start or the end,
589 // depending on which would be faster.
590 let mut split_node = if at - 1 <= len - 1 - (at - 1) {
591 let mut iter = self.iter_mut();
592 // instead of skipping using .skip() (which creates a new struct),
593 // we skip manually so we can access the head field without
594 // depending on implementation details of Skip
595 for _ in range(0, at - 1) {
600 // better off starting from the end
601 let mut iter = self.iter_mut();
602 for _ in range(0, len - 1 - (at - 1)) {
608 let mut splitted_list = DList {
610 list_tail: self.list_tail,
614 mem::swap(&mut split_node.resolve().unwrap().next, &mut splitted_list.list_head);
615 self.list_tail = split_node;
624 impl<T> Drop for DList<T> {
626 // Dissolve the dlist in backwards direction
627 // Just dropping the list_head can lead to stack exhaustion
628 // when length is >> 1_000_000
629 let mut tail = self.list_tail;
631 match tail.resolve() {
634 prev.next.take(); // release Box<Node<T>>
640 self.list_head = None;
641 self.list_tail = Rawlink::none();
646 impl<'a, A> Iterator for Iter<'a, A> {
650 fn next(&mut self) -> Option<&'a A> {
654 self.head.as_ref().map(|head| {
656 self.head = &head.next;
662 fn size_hint(&self) -> (uint, Option<uint>) {
663 (self.nelem, Some(self.nelem))
668 impl<'a, A> DoubleEndedIterator for Iter<'a, A> {
670 fn next_back(&mut self) -> Option<&'a A> {
674 self.tail.resolve_immut().as_ref().map(|prev| {
676 self.tail = prev.prev;
683 impl<'a, A> ExactSizeIterator for Iter<'a, A> {}
686 impl<'a, A> Iterator for IterMut<'a, A> {
687 type Item = &'a mut A;
689 fn next(&mut self) -> Option<&'a mut A> {
693 self.head.resolve().map(|next| {
695 self.head = match next.next {
696 Some(ref mut node) => Rawlink::some(&mut **node),
697 None => Rawlink::none(),
704 fn size_hint(&self) -> (uint, Option<uint>) {
705 (self.nelem, Some(self.nelem))
710 impl<'a, A> DoubleEndedIterator for IterMut<'a, A> {
712 fn next_back(&mut self) -> Option<&'a mut A> {
716 self.tail.resolve().map(|prev| {
718 self.tail = prev.prev;
725 impl<'a, A> ExactSizeIterator for IterMut<'a, A> {}
727 // private methods for IterMut
728 impl<'a, A> IterMut<'a, A> {
729 fn insert_next_node(&mut self, mut ins_node: Box<Node<A>>) {
730 // Insert before `self.head` so that it is between the
731 // previously yielded element and self.head.
733 // The inserted node will not appear in further iteration.
734 match self.head.resolve() {
735 None => { self.list.push_back_node(ins_node); }
737 let prev_node = match node.prev.resolve() {
738 None => return self.list.push_front_node(ins_node),
741 let node_own = prev_node.next.take().unwrap();
742 ins_node.next = link_with_prev(node_own, Rawlink::some(&mut *ins_node));
743 prev_node.next = link_with_prev(ins_node, Rawlink::some(prev_node));
744 self.list.length += 1;
750 impl<'a, A> IterMut<'a, A> {
751 /// Inserts `elt` just after the element most recently returned by `.next()`.
752 /// The inserted element does not appear in the iteration.
757 /// use std::collections::DList;
759 /// let mut list: DList<int> = vec![1, 3, 4].into_iter().collect();
762 /// let mut it = list.iter_mut();
763 /// assert_eq!(it.next().unwrap(), &1);
764 /// // insert `2` after `1`
765 /// it.insert_next(2);
768 /// let vec: Vec<int> = list.into_iter().collect();
769 /// assert_eq!(vec, vec![1i, 2, 3, 4]);
773 #[unstable = "this is probably better handled by a cursor type -- we'll see"]
774 pub fn insert_next(&mut self, elt: A) {
775 self.insert_next_node(box Node::new(elt))
778 /// Provides a reference to the next element, without changing the iterator.
783 /// use std::collections::DList;
785 /// let mut list: DList<int> = vec![1, 2, 3].into_iter().collect();
787 /// let mut it = list.iter_mut();
788 /// assert_eq!(it.next().unwrap(), &1);
789 /// assert_eq!(it.peek_next().unwrap(), &2);
790 /// // We just peeked at 2, so it was not consumed from the iterator.
791 /// assert_eq!(it.next().unwrap(), &2);
794 #[unstable = "this is probably better handled by a cursor type -- we'll see"]
795 pub fn peek_next(&mut self) -> Option<&mut A> {
799 self.head.resolve().map(|head| &mut head.value)
804 impl<A> Iterator for IntoIter<A> {
808 fn next(&mut self) -> Option<A> { self.list.pop_front() }
811 fn size_hint(&self) -> (uint, Option<uint>) {
812 (self.list.length, Some(self.list.length))
817 impl<A> DoubleEndedIterator for IntoIter<A> {
819 fn next_back(&mut self) -> Option<A> { self.list.pop_back() }
823 impl<A> FromIterator<A> for DList<A> {
824 fn from_iter<T: Iterator<Item=A>>(iterator: T) -> DList<A> {
825 let mut ret = DList::new();
826 ret.extend(iterator);
832 impl<A> Extend<A> for DList<A> {
833 fn extend<T: Iterator<Item=A>>(&mut self, mut iterator: T) {
834 for elt in iterator { self.push_back(elt); }
839 impl<A: PartialEq> PartialEq for DList<A> {
840 fn eq(&self, other: &DList<A>) -> bool {
841 self.len() == other.len() &&
842 iter::order::eq(self.iter(), other.iter())
845 fn ne(&self, other: &DList<A>) -> bool {
846 self.len() != other.len() ||
847 iter::order::ne(self.iter(), other.iter())
852 impl<A: Eq> Eq for DList<A> {}
855 impl<A: PartialOrd> PartialOrd for DList<A> {
856 fn partial_cmp(&self, other: &DList<A>) -> Option<Ordering> {
857 iter::order::partial_cmp(self.iter(), other.iter())
862 impl<A: Ord> Ord for DList<A> {
864 fn cmp(&self, other: &DList<A>) -> Ordering {
865 iter::order::cmp(self.iter(), other.iter())
870 impl<A: Clone> Clone for DList<A> {
871 fn clone(&self) -> DList<A> {
872 self.iter().map(|x| x.clone()).collect()
877 impl<A: fmt::Show> fmt::Show for DList<A> {
878 fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
879 try!(write!(f, "DList ["));
881 for (i, e) in self.iter().enumerate() {
882 if i != 0 { try!(write!(f, ", ")); }
883 try!(write!(f, "{:?}", *e));
891 impl<S: Writer + Hasher, A: Hash<S>> Hash<S> for DList<A> {
892 fn hash(&self, state: &mut S) {
893 self.len().hash(state);
894 for elt in self.iter() {
904 use std::hash::{self, SipHasher};
905 use std::thread::Thread;
909 use super::{DList, Node};
911 pub fn check_links<T>(list: &DList<T>) {
913 let mut last_ptr: Option<&Node<T>> = None;
914 let mut node_ptr: &Node<T>;
915 match list.list_head {
916 None => { assert_eq!(0u, list.length); return }
917 Some(ref node) => node_ptr = &**node,
920 match (last_ptr, node_ptr.prev.resolve_immut()) {
922 (None , _ ) => panic!("prev link for list_head"),
923 (Some(p), Some(pptr)) => {
924 assert_eq!(p as *const Node<T>, pptr as *const Node<T>);
926 _ => panic!("prev link is none, not good"),
928 match node_ptr.next {
930 last_ptr = Some(node_ptr);
940 assert_eq!(len, list.length);
945 let mut m: DList<Box<int>> = DList::new();
946 assert_eq!(m.pop_front(), None);
947 assert_eq!(m.pop_back(), None);
948 assert_eq!(m.pop_front(), None);
950 assert_eq!(m.pop_front(), Some(box 1));
953 assert_eq!(m.len(), 2);
954 assert_eq!(m.pop_front(), Some(box 2));
955 assert_eq!(m.pop_front(), Some(box 3));
956 assert_eq!(m.len(), 0);
957 assert_eq!(m.pop_front(), None);
962 assert_eq!(m.pop_front(), Some(box 1));
964 let mut n = DList::new();
968 assert_eq!(n.front().unwrap(), &3);
969 let x = n.front_mut().unwrap();
974 assert_eq!(n.back().unwrap(), &2);
975 let y = n.back_mut().unwrap();
979 assert_eq!(n.pop_front(), Some(0));
980 assert_eq!(n.pop_front(), Some(1));
984 fn generate_test() -> DList<int> {
985 list_from(&[0i,1,2,3,4,5,6])
989 fn list_from<T: Clone>(v: &[T]) -> DList<T> {
990 v.iter().map(|x| (*x).clone()).collect()
997 let mut m: DList<int> = DList::new();
998 let mut n = DList::new();
1001 assert_eq!(m.len(), 0);
1002 assert_eq!(n.len(), 0);
1004 // Non-empty to empty
1006 let mut m = DList::new();
1007 let mut n = DList::new();
1011 assert_eq!(m.len(), 1);
1012 assert_eq!(m.pop_back(), Some(2));
1013 assert_eq!(n.len(), 0);
1016 // Empty to non-empty
1018 let mut m = DList::new();
1019 let mut n = DList::new();
1023 assert_eq!(m.len(), 1);
1024 assert_eq!(m.pop_back(), Some(2));
1028 // Non-empty to non-empty
1029 let v = vec![1i,2,3,4,5];
1030 let u = vec![9i,8,1,2,3,4,5];
1031 let mut m = list_from(v.as_slice());
1032 let mut n = list_from(u.as_slice());
1036 sum.push_all(u.as_slice());
1037 assert_eq!(sum.len(), m.len());
1038 for elt in sum.into_iter() {
1039 assert_eq!(m.pop_front(), Some(elt))
1041 assert_eq!(n.len(), 0);
1042 // let's make sure it's working properly, since we
1043 // did some direct changes to private members
1045 assert_eq!(n.len(), 1);
1046 assert_eq!(n.pop_front(), Some(3));
1051 fn test_split_off() {
1054 let mut m = DList::new();
1057 let p = m.split_off(0);
1058 assert_eq!(m.len(), 0);
1059 assert_eq!(p.len(), 1);
1060 assert_eq!(p.back(), Some(&1));
1061 assert_eq!(p.front(), Some(&1));
1064 // not singleton, forwards
1066 let u = vec![1i,2,3,4,5];
1067 let mut m = list_from(u.as_slice());
1068 let mut n = m.split_off(2);
1069 assert_eq!(m.len(), 2);
1070 assert_eq!(n.len(), 3);
1071 for elt in range(1i, 3) {
1072 assert_eq!(m.pop_front(), Some(elt));
1074 for elt in range(3i, 6) {
1075 assert_eq!(n.pop_front(), Some(elt));
1078 // not singleton, backwards
1080 let u = vec![1i,2,3,4,5];
1081 let mut m = list_from(u.as_slice());
1082 let mut n = m.split_off(4);
1083 assert_eq!(m.len(), 4);
1084 assert_eq!(n.len(), 1);
1085 for elt in range(1i, 5) {
1086 assert_eq!(m.pop_front(), Some(elt));
1088 for elt in range(5i, 6) {
1089 assert_eq!(n.pop_front(), Some(elt));
1096 fn test_iterator() {
1097 let m = generate_test();
1098 for (i, elt) in m.iter().enumerate() {
1099 assert_eq!(i as int, *elt);
1101 let mut n = DList::new();
1102 assert_eq!(n.iter().next(), None);
1104 let mut it = n.iter();
1105 assert_eq!(it.size_hint(), (1, Some(1)));
1106 assert_eq!(it.next().unwrap(), &4);
1107 assert_eq!(it.size_hint(), (0, Some(0)));
1108 assert_eq!(it.next(), None);
1112 fn test_iterator_clone() {
1113 let mut n = DList::new();
1117 let mut it = n.iter();
1119 let mut jt = it.clone();
1120 assert_eq!(it.next(), jt.next());
1121 assert_eq!(it.next_back(), jt.next_back());
1122 assert_eq!(it.next(), jt.next());
1126 fn test_iterator_double_end() {
1127 let mut n = DList::new();
1128 assert_eq!(n.iter().next(), None);
1132 let mut it = n.iter();
1133 assert_eq!(it.size_hint(), (3, Some(3)));
1134 assert_eq!(it.next().unwrap(), &6);
1135 assert_eq!(it.size_hint(), (2, Some(2)));
1136 assert_eq!(it.next_back().unwrap(), &4);
1137 assert_eq!(it.size_hint(), (1, Some(1)));
1138 assert_eq!(it.next_back().unwrap(), &5);
1139 assert_eq!(it.next_back(), None);
1140 assert_eq!(it.next(), None);
1144 fn test_rev_iter() {
1145 let m = generate_test();
1146 for (i, elt) in m.iter().rev().enumerate() {
1147 assert_eq!((6 - i) as int, *elt);
1149 let mut n = DList::new();
1150 assert_eq!(n.iter().rev().next(), None);
1152 let mut it = n.iter().rev();
1153 assert_eq!(it.size_hint(), (1, Some(1)));
1154 assert_eq!(it.next().unwrap(), &4);
1155 assert_eq!(it.size_hint(), (0, Some(0)));
1156 assert_eq!(it.next(), None);
1160 fn test_mut_iter() {
1161 let mut m = generate_test();
1162 let mut len = m.len();
1163 for (i, elt) in m.iter_mut().enumerate() {
1164 assert_eq!(i as int, *elt);
1168 let mut n = DList::new();
1169 assert!(n.iter_mut().next().is_none());
1172 let mut it = n.iter_mut();
1173 assert_eq!(it.size_hint(), (2, Some(2)));
1174 assert!(it.next().is_some());
1175 assert!(it.next().is_some());
1176 assert_eq!(it.size_hint(), (0, Some(0)));
1177 assert!(it.next().is_none());
1181 fn test_iterator_mut_double_end() {
1182 let mut n = DList::new();
1183 assert!(n.iter_mut().next_back().is_none());
1187 let mut it = n.iter_mut();
1188 assert_eq!(it.size_hint(), (3, Some(3)));
1189 assert_eq!(*it.next().unwrap(), 6);
1190 assert_eq!(it.size_hint(), (2, Some(2)));
1191 assert_eq!(*it.next_back().unwrap(), 4);
1192 assert_eq!(it.size_hint(), (1, Some(1)));
1193 assert_eq!(*it.next_back().unwrap(), 5);
1194 assert!(it.next_back().is_none());
1195 assert!(it.next().is_none());
1199 fn test_insert_prev() {
1200 let mut m = list_from(&[0i,2,4,6,8]);
1203 let mut it = m.iter_mut();
1209 it.insert_next(*elt + 1);
1210 match it.peek_next() {
1211 Some(x) => assert_eq!(*x, *elt + 2),
1212 None => assert_eq!(8, *elt),
1221 assert_eq!(m.len(), 3 + len * 2);
1222 assert_eq!(m.into_iter().collect::<Vec<int>>(), vec![-2,0,1,2,3,4,5,6,7,8,9,0,1]);
1226 fn test_mut_rev_iter() {
1227 let mut m = generate_test();
1228 for (i, elt) in m.iter_mut().rev().enumerate() {
1229 assert_eq!((6-i) as int, *elt);
1231 let mut n = DList::new();
1232 assert!(n.iter_mut().rev().next().is_none());
1234 let mut it = n.iter_mut().rev();
1235 assert!(it.next().is_some());
1236 assert!(it.next().is_none());
1241 let n = list_from(&[1i,2,3]);
1242 Thread::scoped(move || {
1244 let a: &[_] = &[&1,&2,&3];
1245 assert_eq!(a, n.iter().collect::<Vec<&int>>());
1246 }).join().ok().unwrap();
1251 let mut n: DList<u8> = list_from(&[]);
1252 let mut m = list_from(&[]);
1259 let n = list_from(&[2i,3,4]);
1260 let m = list_from(&[1i,2,3]);
1266 let mut x = DList::new();
1267 let mut y = DList::new();
1269 assert!(hash::hash::<_, SipHasher>(&x) == hash::hash::<_, SipHasher>(&y));
1279 assert!(hash::hash::<_, SipHasher>(&x) == hash::hash::<_, SipHasher>(&y));
1284 let n: DList<int> = list_from(&[]);
1285 let m = list_from(&[1i,2,3]);
1294 let nan = 0.0f64/0.0;
1295 let n = list_from(&[nan]);
1296 let m = list_from(&[nan]);
1302 let n = list_from(&[nan]);
1303 let one = list_from(&[1.0f64]);
1304 assert!(!(n < one));
1305 assert!(!(n > one));
1306 assert!(!(n <= one));
1307 assert!(!(n >= one));
1309 let u = list_from(&[1.0f64,2.0,nan]);
1310 let v = list_from(&[1.0f64,2.0,3.0]);
1316 let s = list_from(&[1.0f64,2.0,4.0,2.0]);
1317 let t = list_from(&[1.0f64,2.0,3.0,2.0]);
1320 assert!(!(s <= one));
1326 for _ in range(0u, 25) {
1335 let list: DList<int> = range(0i, 10).collect();
1336 assert_eq!(format!("{:?}", list), "DList [0i, 1i, 2i, 3i, 4i, 5i, 6i, 7i, 8i, 9i]");
1338 let list: DList<&str> = vec!["just", "one", "test", "more"].iter()
1341 assert_eq!(format!("{:?}", list), "DList [\"just\", \"one\", \"test\", \"more\"]");
1345 fn fuzz_test(sz: int) {
1346 let mut m: DList<int> = DList::new();
1348 for i in range(0, sz) {
1350 let r: u8 = rand::random();
1376 for (a, &b) in m.into_iter().zip(v.iter()) {
1380 assert_eq!(i, v.len());
1384 fn bench_collect_into(b: &mut test::Bencher) {
1387 let _: DList<int> = v.iter().map(|x| *x).collect();
1392 fn bench_push_front(b: &mut test::Bencher) {
1393 let mut m: DList<int> = DList::new();
1400 fn bench_push_back(b: &mut test::Bencher) {
1401 let mut m: DList<int> = DList::new();
1408 fn bench_push_back_pop_back(b: &mut test::Bencher) {
1409 let mut m: DList<int> = DList::new();
1417 fn bench_push_front_pop_front(b: &mut test::Bencher) {
1418 let mut m: DList<int> = DList::new();
1426 fn bench_iter(b: &mut test::Bencher) {
1428 let m: DList<int> = v.iter().map(|&x|x).collect();
1430 assert!(m.iter().count() == 128);
1434 fn bench_iter_mut(b: &mut test::Bencher) {
1436 let mut m: DList<int> = v.iter().map(|&x|x).collect();
1438 assert!(m.iter_mut().count() == 128);
1442 fn bench_iter_rev(b: &mut test::Bencher) {
1444 let m: DList<int> = v.iter().map(|&x|x).collect();
1446 assert!(m.iter().rev().count() == 128);
1450 fn bench_iter_mut_rev(b: &mut test::Bencher) {
1452 let mut m: DList<int> = v.iter().map(|&x|x).collect();
1454 assert!(m.iter_mut().rev().count() == 128);