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 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.
309 pub fn is_empty(&self) -> bool {
310 self.list_head.is_none()
313 /// Returns the length of the `DList`.
315 /// This operation should compute in O(1) time.
318 pub fn len(&self) -> uint {
322 /// Removes all elements from the `DList`.
324 /// This operation should compute in O(n) time.
327 pub fn clear(&mut self) {
331 /// Provides a reference to the front element, or `None` if the list is
335 pub fn front(&self) -> Option<&T> {
336 self.list_head.as_ref().map(|head| &head.value)
339 /// Provides a mutable reference to the front element, or `None` if the list
343 pub fn front_mut(&mut self) -> Option<&mut T> {
344 self.list_head.as_mut().map(|head| &mut head.value)
347 /// Provides a reference to the back element, or `None` if the list is
351 pub fn back(&self) -> Option<&T> {
352 self.list_tail.resolve_immut().as_ref().map(|tail| &tail.value)
355 /// Provides a mutable reference to the back element, or `None` if the list
359 pub fn back_mut(&mut self) -> Option<&mut T> {
360 self.list_tail.resolve().map(|tail| &mut tail.value)
363 /// Adds an element first in the list.
365 /// This operation should compute in O(1) time.
367 pub fn push_front(&mut self, elt: T) {
368 self.push_front_node(box Node::new(elt))
371 /// Removes the first element and returns it, or `None` if the list is
374 /// This operation should compute in O(1) time.
376 pub fn pop_front(&mut self) -> Option<T> {
377 self.pop_front_node().map(|box Node{value, ..}| value)
380 /// Appends an element to the back of a list
385 /// use std::collections::DList;
387 /// let mut d = DList::new();
390 /// assert_eq!(3, *d.back().unwrap());
393 pub fn push_back(&mut self, elt: T) {
394 self.push_back_node(box Node::new(elt))
397 /// Removes the last element from a list and returns it, or `None` if
403 /// use std::collections::DList;
405 /// let mut d = DList::new();
406 /// assert_eq!(d.pop_back(), None);
409 /// assert_eq!(d.pop_back(), Some(3));
412 pub fn pop_back(&mut self) -> Option<T> {
413 self.pop_back_node().map(|box Node{value, ..}| value)
416 /// Splits the list into two at the given index. Returns everything after the given index,
417 /// including the index.
419 /// This operation should compute in O(n) time.
421 pub fn split_off(&mut self, at: uint) -> DList<T> {
422 let len = self.len();
423 assert!(at < len, "Cannot split off at a nonexistent index");
425 return mem::replace(self, DList::new());
428 // Below, we iterate towards the `i-1`th node, either from the start or the end,
429 // depending on which would be faster.
430 let mut split_node = if at - 1 <= len - 1 - (at - 1) {
431 let mut iter = self.iter_mut();
432 // instead of skipping using .skip() (which creates a new struct),
433 // we skip manually so we can access the head field without
434 // depending on implementation details of Skip
435 for _ in range(0, at - 1) {
440 // better off starting from the end
441 let mut iter = self.iter_mut();
442 for _ in range(0, len - 1 - (at - 1)) {
448 let mut splitted_list = DList {
450 list_tail: self.list_tail,
454 mem::swap(&mut split_node.resolve().unwrap().next, &mut splitted_list.list_head);
455 self.list_tail = split_node;
464 impl<T> Drop for DList<T> {
466 // Dissolve the dlist in backwards direction
467 // Just dropping the list_head can lead to stack exhaustion
468 // when length is >> 1_000_000
469 let mut tail = self.list_tail;
471 match tail.resolve() {
474 prev.next.take(); // release Box<Node<T>>
480 self.list_head = None;
481 self.list_tail = Rawlink::none();
486 impl<'a, A> Iterator for Iter<'a, A> {
490 fn next(&mut self) -> Option<&'a A> {
494 self.head.as_ref().map(|head| {
496 self.head = &head.next;
502 fn size_hint(&self) -> (uint, Option<uint>) {
503 (self.nelem, Some(self.nelem))
508 impl<'a, A> DoubleEndedIterator for Iter<'a, A> {
510 fn next_back(&mut self) -> Option<&'a A> {
514 self.tail.resolve_immut().as_ref().map(|prev| {
516 self.tail = prev.prev;
523 impl<'a, A> ExactSizeIterator for Iter<'a, A> {}
526 impl<'a, A> Iterator for IterMut<'a, A> {
527 type Item = &'a mut A;
529 fn next(&mut self) -> Option<&'a mut A> {
533 self.head.resolve().map(|next| {
535 self.head = match next.next {
536 Some(ref mut node) => Rawlink::some(&mut **node),
537 None => Rawlink::none(),
544 fn size_hint(&self) -> (uint, Option<uint>) {
545 (self.nelem, Some(self.nelem))
550 impl<'a, A> DoubleEndedIterator for IterMut<'a, A> {
552 fn next_back(&mut self) -> Option<&'a mut A> {
556 self.tail.resolve().map(|prev| {
558 self.tail = prev.prev;
565 impl<'a, A> ExactSizeIterator for IterMut<'a, A> {}
567 // private methods for IterMut
568 impl<'a, A> IterMut<'a, A> {
569 fn insert_next_node(&mut self, mut ins_node: Box<Node<A>>) {
570 // Insert before `self.head` so that it is between the
571 // previously yielded element and self.head.
573 // The inserted node will not appear in further iteration.
574 match self.head.resolve() {
575 None => { self.list.push_back_node(ins_node); }
577 let prev_node = match node.prev.resolve() {
578 None => return self.list.push_front_node(ins_node),
581 let node_own = prev_node.next.take().unwrap();
582 ins_node.next = link_with_prev(node_own, Rawlink::some(&mut *ins_node));
583 prev_node.next = link_with_prev(ins_node, Rawlink::some(prev_node));
584 self.list.length += 1;
590 impl<'a, A> IterMut<'a, A> {
591 /// Inserts `elt` just after the element most recently returned by `.next()`.
592 /// The inserted element does not appear in the iteration.
597 /// use std::collections::DList;
599 /// let mut list: DList<int> = vec![1, 3, 4].into_iter().collect();
602 /// let mut it = list.iter_mut();
603 /// assert_eq!(it.next().unwrap(), &1);
604 /// // insert `2` after `1`
605 /// it.insert_next(2);
608 /// let vec: Vec<int> = list.into_iter().collect();
609 /// assert_eq!(vec, vec![1i, 2, 3, 4]);
613 #[unstable = "this is probably better handled by a cursor type -- we'll see"]
614 pub fn insert_next(&mut self, elt: A) {
615 self.insert_next_node(box Node::new(elt))
618 /// Provides a reference to the next element, without changing the iterator.
623 /// use std::collections::DList;
625 /// let mut list: DList<int> = vec![1, 2, 3].into_iter().collect();
627 /// let mut it = list.iter_mut();
628 /// assert_eq!(it.next().unwrap(), &1);
629 /// assert_eq!(it.peek_next().unwrap(), &2);
630 /// // We just peeked at 2, so it was not consumed from the iterator.
631 /// assert_eq!(it.next().unwrap(), &2);
634 #[unstable = "this is probably better handled by a cursor type -- we'll see"]
635 pub fn peek_next(&mut self) -> Option<&mut A> {
639 self.head.resolve().map(|head| &mut head.value)
644 impl<A> Iterator for IntoIter<A> {
648 fn next(&mut self) -> Option<A> { self.list.pop_front() }
651 fn size_hint(&self) -> (uint, Option<uint>) {
652 (self.list.length, Some(self.list.length))
657 impl<A> DoubleEndedIterator for IntoIter<A> {
659 fn next_back(&mut self) -> Option<A> { self.list.pop_back() }
663 impl<A> FromIterator<A> for DList<A> {
664 fn from_iter<T: Iterator<Item=A>>(iterator: T) -> DList<A> {
665 let mut ret = DList::new();
666 ret.extend(iterator);
672 impl<A> Extend<A> for DList<A> {
673 fn extend<T: Iterator<Item=A>>(&mut self, mut iterator: T) {
674 for elt in iterator { self.push_back(elt); }
679 impl<A: PartialEq> PartialEq for DList<A> {
680 fn eq(&self, other: &DList<A>) -> bool {
681 self.len() == other.len() &&
682 iter::order::eq(self.iter(), other.iter())
685 fn ne(&self, other: &DList<A>) -> bool {
686 self.len() != other.len() ||
687 iter::order::ne(self.iter(), other.iter())
692 impl<A: Eq> Eq for DList<A> {}
695 impl<A: PartialOrd> PartialOrd for DList<A> {
696 fn partial_cmp(&self, other: &DList<A>) -> Option<Ordering> {
697 iter::order::partial_cmp(self.iter(), other.iter())
702 impl<A: Ord> Ord for DList<A> {
704 fn cmp(&self, other: &DList<A>) -> Ordering {
705 iter::order::cmp(self.iter(), other.iter())
710 impl<A: Clone> Clone for DList<A> {
711 fn clone(&self) -> DList<A> {
712 self.iter().map(|x| x.clone()).collect()
717 impl<A: fmt::Show> fmt::Show for DList<A> {
718 fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
719 try!(write!(f, "DList ["));
721 for (i, e) in self.iter().enumerate() {
722 if i != 0 { try!(write!(f, ", ")); }
723 try!(write!(f, "{:?}", *e));
731 impl<S: Writer + Hasher, A: Hash<S>> Hash<S> for DList<A> {
732 fn hash(&self, state: &mut S) {
733 self.len().hash(state);
734 for elt in self.iter() {
744 use std::hash::{self, SipHasher};
745 use std::thread::Thread;
749 use super::{DList, Node};
751 pub fn check_links<T>(list: &DList<T>) {
753 let mut last_ptr: Option<&Node<T>> = None;
754 let mut node_ptr: &Node<T>;
755 match list.list_head {
756 None => { assert_eq!(0u, list.length); return }
757 Some(ref node) => node_ptr = &**node,
760 match (last_ptr, node_ptr.prev.resolve_immut()) {
762 (None , _ ) => panic!("prev link for list_head"),
763 (Some(p), Some(pptr)) => {
764 assert_eq!(p as *const Node<T>, pptr as *const Node<T>);
766 _ => panic!("prev link is none, not good"),
768 match node_ptr.next {
770 last_ptr = Some(node_ptr);
780 assert_eq!(len, list.length);
785 let mut m: DList<Box<int>> = DList::new();
786 assert_eq!(m.pop_front(), None);
787 assert_eq!(m.pop_back(), None);
788 assert_eq!(m.pop_front(), None);
790 assert_eq!(m.pop_front(), Some(box 1));
793 assert_eq!(m.len(), 2);
794 assert_eq!(m.pop_front(), Some(box 2));
795 assert_eq!(m.pop_front(), Some(box 3));
796 assert_eq!(m.len(), 0);
797 assert_eq!(m.pop_front(), None);
802 assert_eq!(m.pop_front(), Some(box 1));
804 let mut n = DList::new();
808 assert_eq!(n.front().unwrap(), &3);
809 let x = n.front_mut().unwrap();
814 assert_eq!(n.back().unwrap(), &2);
815 let y = n.back_mut().unwrap();
819 assert_eq!(n.pop_front(), Some(0));
820 assert_eq!(n.pop_front(), Some(1));
824 fn generate_test() -> DList<int> {
825 list_from(&[0i,1,2,3,4,5,6])
829 fn list_from<T: Clone>(v: &[T]) -> DList<T> {
830 v.iter().map(|x| (*x).clone()).collect()
837 let mut m: DList<int> = DList::new();
838 let mut n = DList::new();
841 assert_eq!(m.len(), 0);
842 assert_eq!(n.len(), 0);
844 // Non-empty to empty
846 let mut m = DList::new();
847 let mut n = DList::new();
851 assert_eq!(m.len(), 1);
852 assert_eq!(m.pop_back(), Some(2));
853 assert_eq!(n.len(), 0);
856 // Empty to non-empty
858 let mut m = DList::new();
859 let mut n = DList::new();
863 assert_eq!(m.len(), 1);
864 assert_eq!(m.pop_back(), Some(2));
868 // Non-empty to non-empty
869 let v = vec![1i,2,3,4,5];
870 let u = vec![9i,8,1,2,3,4,5];
871 let mut m = list_from(v.as_slice());
872 let mut n = list_from(u.as_slice());
876 sum.push_all(u.as_slice());
877 assert_eq!(sum.len(), m.len());
878 for elt in sum.into_iter() {
879 assert_eq!(m.pop_front(), Some(elt))
881 assert_eq!(n.len(), 0);
882 // let's make sure it's working properly, since we
883 // did some direct changes to private members
885 assert_eq!(n.len(), 1);
886 assert_eq!(n.pop_front(), Some(3));
891 fn test_split_off() {
894 let mut m = DList::new();
897 let p = m.split_off(0);
898 assert_eq!(m.len(), 0);
899 assert_eq!(p.len(), 1);
900 assert_eq!(p.back(), Some(&1));
901 assert_eq!(p.front(), Some(&1));
904 // not singleton, forwards
906 let u = vec![1i,2,3,4,5];
907 let mut m = list_from(u.as_slice());
908 let mut n = m.split_off(2);
909 assert_eq!(m.len(), 2);
910 assert_eq!(n.len(), 3);
911 for elt in range(1i, 3) {
912 assert_eq!(m.pop_front(), Some(elt));
914 for elt in range(3i, 6) {
915 assert_eq!(n.pop_front(), Some(elt));
918 // not singleton, backwards
920 let u = vec![1i,2,3,4,5];
921 let mut m = list_from(u.as_slice());
922 let mut n = m.split_off(4);
923 assert_eq!(m.len(), 4);
924 assert_eq!(n.len(), 1);
925 for elt in range(1i, 5) {
926 assert_eq!(m.pop_front(), Some(elt));
928 for elt in range(5i, 6) {
929 assert_eq!(n.pop_front(), Some(elt));
937 let m = generate_test();
938 for (i, elt) in m.iter().enumerate() {
939 assert_eq!(i as int, *elt);
941 let mut n = DList::new();
942 assert_eq!(n.iter().next(), None);
944 let mut it = n.iter();
945 assert_eq!(it.size_hint(), (1, Some(1)));
946 assert_eq!(it.next().unwrap(), &4);
947 assert_eq!(it.size_hint(), (0, Some(0)));
948 assert_eq!(it.next(), None);
952 fn test_iterator_clone() {
953 let mut n = DList::new();
957 let mut it = n.iter();
959 let mut jt = it.clone();
960 assert_eq!(it.next(), jt.next());
961 assert_eq!(it.next_back(), jt.next_back());
962 assert_eq!(it.next(), jt.next());
966 fn test_iterator_double_end() {
967 let mut n = DList::new();
968 assert_eq!(n.iter().next(), None);
972 let mut it = n.iter();
973 assert_eq!(it.size_hint(), (3, Some(3)));
974 assert_eq!(it.next().unwrap(), &6);
975 assert_eq!(it.size_hint(), (2, Some(2)));
976 assert_eq!(it.next_back().unwrap(), &4);
977 assert_eq!(it.size_hint(), (1, Some(1)));
978 assert_eq!(it.next_back().unwrap(), &5);
979 assert_eq!(it.next_back(), None);
980 assert_eq!(it.next(), None);
985 let m = generate_test();
986 for (i, elt) in m.iter().rev().enumerate() {
987 assert_eq!((6 - i) as int, *elt);
989 let mut n = DList::new();
990 assert_eq!(n.iter().rev().next(), None);
992 let mut it = n.iter().rev();
993 assert_eq!(it.size_hint(), (1, Some(1)));
994 assert_eq!(it.next().unwrap(), &4);
995 assert_eq!(it.size_hint(), (0, Some(0)));
996 assert_eq!(it.next(), None);
1000 fn test_mut_iter() {
1001 let mut m = generate_test();
1002 let mut len = m.len();
1003 for (i, elt) in m.iter_mut().enumerate() {
1004 assert_eq!(i as int, *elt);
1008 let mut n = DList::new();
1009 assert!(n.iter_mut().next().is_none());
1012 let mut it = n.iter_mut();
1013 assert_eq!(it.size_hint(), (2, Some(2)));
1014 assert!(it.next().is_some());
1015 assert!(it.next().is_some());
1016 assert_eq!(it.size_hint(), (0, Some(0)));
1017 assert!(it.next().is_none());
1021 fn test_iterator_mut_double_end() {
1022 let mut n = DList::new();
1023 assert!(n.iter_mut().next_back().is_none());
1027 let mut it = n.iter_mut();
1028 assert_eq!(it.size_hint(), (3, Some(3)));
1029 assert_eq!(*it.next().unwrap(), 6);
1030 assert_eq!(it.size_hint(), (2, Some(2)));
1031 assert_eq!(*it.next_back().unwrap(), 4);
1032 assert_eq!(it.size_hint(), (1, Some(1)));
1033 assert_eq!(*it.next_back().unwrap(), 5);
1034 assert!(it.next_back().is_none());
1035 assert!(it.next().is_none());
1039 fn test_insert_prev() {
1040 let mut m = list_from(&[0i,2,4,6,8]);
1043 let mut it = m.iter_mut();
1049 it.insert_next(*elt + 1);
1050 match it.peek_next() {
1051 Some(x) => assert_eq!(*x, *elt + 2),
1052 None => assert_eq!(8, *elt),
1061 assert_eq!(m.len(), 3 + len * 2);
1062 assert_eq!(m.into_iter().collect::<Vec<int>>(), vec![-2,0,1,2,3,4,5,6,7,8,9,0,1]);
1066 fn test_mut_rev_iter() {
1067 let mut m = generate_test();
1068 for (i, elt) in m.iter_mut().rev().enumerate() {
1069 assert_eq!((6-i) as int, *elt);
1071 let mut n = DList::new();
1072 assert!(n.iter_mut().rev().next().is_none());
1074 let mut it = n.iter_mut().rev();
1075 assert!(it.next().is_some());
1076 assert!(it.next().is_none());
1081 let n = list_from(&[1i,2,3]);
1082 Thread::scoped(move || {
1084 let a: &[_] = &[&1,&2,&3];
1085 assert_eq!(a, n.iter().collect::<Vec<&int>>());
1086 }).join().ok().unwrap();
1091 let mut n: DList<u8> = list_from(&[]);
1092 let mut m = list_from(&[]);
1099 let n = list_from(&[2i,3,4]);
1100 let m = list_from(&[1i,2,3]);
1106 let mut x = DList::new();
1107 let mut y = DList::new();
1109 assert!(hash::hash::<_, SipHasher>(&x) == hash::hash::<_, SipHasher>(&y));
1119 assert!(hash::hash::<_, SipHasher>(&x) == hash::hash::<_, SipHasher>(&y));
1124 let n: DList<int> = list_from(&[]);
1125 let m = list_from(&[1i,2,3]);
1134 let nan = 0.0f64/0.0;
1135 let n = list_from(&[nan]);
1136 let m = list_from(&[nan]);
1142 let n = list_from(&[nan]);
1143 let one = list_from(&[1.0f64]);
1144 assert!(!(n < one));
1145 assert!(!(n > one));
1146 assert!(!(n <= one));
1147 assert!(!(n >= one));
1149 let u = list_from(&[1.0f64,2.0,nan]);
1150 let v = list_from(&[1.0f64,2.0,3.0]);
1156 let s = list_from(&[1.0f64,2.0,4.0,2.0]);
1157 let t = list_from(&[1.0f64,2.0,3.0,2.0]);
1160 assert!(!(s <= one));
1166 for _ in range(0u, 25) {
1175 let list: DList<int> = range(0i, 10).collect();
1176 assert_eq!(format!("{:?}", list), "DList [0i, 1i, 2i, 3i, 4i, 5i, 6i, 7i, 8i, 9i]");
1178 let list: DList<&str> = vec!["just", "one", "test", "more"].iter()
1181 assert_eq!(format!("{:?}", list), "DList [\"just\", \"one\", \"test\", \"more\"]");
1185 fn fuzz_test(sz: int) {
1186 let mut m: DList<int> = DList::new();
1188 for i in range(0, sz) {
1190 let r: u8 = rand::random();
1216 for (a, &b) in m.into_iter().zip(v.iter()) {
1220 assert_eq!(i, v.len());
1224 fn bench_collect_into(b: &mut test::Bencher) {
1227 let _: DList<int> = v.iter().map(|x| *x).collect();
1232 fn bench_push_front(b: &mut test::Bencher) {
1233 let mut m: DList<int> = DList::new();
1240 fn bench_push_back(b: &mut test::Bencher) {
1241 let mut m: DList<int> = DList::new();
1248 fn bench_push_back_pop_back(b: &mut test::Bencher) {
1249 let mut m: DList<int> = DList::new();
1257 fn bench_push_front_pop_front(b: &mut test::Bencher) {
1258 let mut m: DList<int> = DList::new();
1266 fn bench_iter(b: &mut test::Bencher) {
1268 let m: DList<int> = v.iter().map(|&x|x).collect();
1270 assert!(m.iter().count() == 128);
1274 fn bench_iter_mut(b: &mut test::Bencher) {
1276 let mut m: DList<int> = v.iter().map(|&x|x).collect();
1278 assert!(m.iter_mut().count() == 128);
1282 fn bench_iter_rev(b: &mut test::Bencher) {
1284 let m: DList<int> = v.iter().map(|&x|x).collect();
1286 assert!(m.iter().rev().count() == 128);
1290 fn bench_iter_mut_rev(b: &mut test::Bencher) {
1292 let mut m: DList<int> = v.iter().map(|&x|x).collect();
1294 assert!(m.iter_mut().rev().count() == 128);