4 use std::panic::{catch_unwind, AssertUnwindSafe};
7 use rand::{thread_rng, RngCore};
11 let mut m = LinkedList::<Box<_>>::new();
12 assert_eq!(m.pop_front(), None);
13 assert_eq!(m.pop_back(), None);
14 assert_eq!(m.pop_front(), None);
15 m.push_front(Box::new(1));
16 assert_eq!(m.pop_front(), Some(Box::new(1)));
17 m.push_back(Box::new(2));
18 m.push_back(Box::new(3));
19 assert_eq!(m.len(), 2);
20 assert_eq!(m.pop_front(), Some(Box::new(2)));
21 assert_eq!(m.pop_front(), Some(Box::new(3)));
22 assert_eq!(m.len(), 0);
23 assert_eq!(m.pop_front(), None);
24 m.push_back(Box::new(1));
25 m.push_back(Box::new(3));
26 m.push_back(Box::new(5));
27 m.push_back(Box::new(7));
28 assert_eq!(m.pop_front(), Some(Box::new(1)));
30 let mut n = LinkedList::new();
34 assert_eq!(n.front().unwrap(), &3);
35 let x = n.front_mut().unwrap();
40 assert_eq!(n.back().unwrap(), &2);
41 let y = n.back_mut().unwrap();
45 assert_eq!(n.pop_front(), Some(0));
46 assert_eq!(n.pop_front(), Some(1));
49 fn generate_test() -> LinkedList<i32> {
50 list_from(&[0, 1, 2, 3, 4, 5, 6])
53 fn list_from<T: Clone>(v: &[T]) -> LinkedList<T> {
54 v.iter().cloned().collect()
57 pub fn check_links<T>(list: &LinkedList<T>) {
60 let mut last_ptr: Option<&Node<T>> = None;
61 let mut node_ptr: &Node<T>;
64 // tail node should also be None.
65 assert!(list.tail.is_none());
66 assert_eq!(0, list.len);
69 Some(node) => node_ptr = &*node.as_ptr(),
72 match (last_ptr, node_ptr.prev) {
74 (None, _) => panic!("prev link for head"),
75 (Some(p), Some(pptr)) => {
76 assert_eq!(p as *const Node<T>, pptr.as_ptr() as *const Node<T>);
78 _ => panic!("prev link is none, not good"),
82 last_ptr = Some(node_ptr);
83 node_ptr = &*next.as_ptr();
93 // verify that the tail node points to the last node.
94 let tail = list.tail.as_ref().expect("some tail node").as_ref();
95 assert_eq!(tail as *const Node<T>, node_ptr as *const Node<T>);
96 // check that len matches interior links.
97 assert_eq!(len, list.len);
105 let mut m = LinkedList::<i32>::new();
106 let mut n = LinkedList::new();
109 assert_eq!(m.len(), 0);
110 assert_eq!(n.len(), 0);
112 // Non-empty to empty
114 let mut m = LinkedList::new();
115 let mut n = LinkedList::new();
119 assert_eq!(m.len(), 1);
120 assert_eq!(m.pop_back(), Some(2));
121 assert_eq!(n.len(), 0);
124 // Empty to non-empty
126 let mut m = LinkedList::new();
127 let mut n = LinkedList::new();
131 assert_eq!(m.len(), 1);
132 assert_eq!(m.pop_back(), Some(2));
136 // Non-empty to non-empty
137 let v = vec![1, 2, 3, 4, 5];
138 let u = vec![9, 8, 1, 2, 3, 4, 5];
139 let mut m = list_from(&v);
140 let mut n = list_from(&u);
144 sum.extend_from_slice(&u);
145 assert_eq!(sum.len(), m.len());
147 assert_eq!(m.pop_front(), Some(elt))
149 assert_eq!(n.len(), 0);
150 // Let's make sure it's working properly, since we
151 // did some direct changes to private members.
153 assert_eq!(n.len(), 1);
154 assert_eq!(n.pop_front(), Some(3));
160 let m = generate_test();
161 for (i, elt) in m.iter().enumerate() {
162 assert_eq!(i as i32, *elt);
164 let mut n = LinkedList::new();
165 assert_eq!(n.iter().next(), None);
167 let mut it = n.iter();
168 assert_eq!(it.size_hint(), (1, Some(1)));
169 assert_eq!(it.next().unwrap(), &4);
170 assert_eq!(it.size_hint(), (0, Some(0)));
171 assert_eq!(it.next(), None);
175 fn test_iterator_clone() {
176 let mut n = LinkedList::new();
180 let mut it = n.iter();
182 let mut jt = it.clone();
183 assert_eq!(it.next(), jt.next());
184 assert_eq!(it.next_back(), jt.next_back());
185 assert_eq!(it.next(), jt.next());
189 fn test_iterator_double_end() {
190 let mut n = LinkedList::new();
191 assert_eq!(n.iter().next(), None);
195 let mut it = n.iter();
196 assert_eq!(it.size_hint(), (3, Some(3)));
197 assert_eq!(it.next().unwrap(), &6);
198 assert_eq!(it.size_hint(), (2, Some(2)));
199 assert_eq!(it.next_back().unwrap(), &4);
200 assert_eq!(it.size_hint(), (1, Some(1)));
201 assert_eq!(it.next_back().unwrap(), &5);
202 assert_eq!(it.next_back(), None);
203 assert_eq!(it.next(), None);
208 let m = generate_test();
209 for (i, elt) in m.iter().rev().enumerate() {
210 assert_eq!((6 - i) as i32, *elt);
212 let mut n = LinkedList::new();
213 assert_eq!(n.iter().rev().next(), None);
215 let mut it = n.iter().rev();
216 assert_eq!(it.size_hint(), (1, Some(1)));
217 assert_eq!(it.next().unwrap(), &4);
218 assert_eq!(it.size_hint(), (0, Some(0)));
219 assert_eq!(it.next(), None);
224 let mut m = generate_test();
225 let mut len = m.len();
226 for (i, elt) in m.iter_mut().enumerate() {
227 assert_eq!(i as i32, *elt);
231 let mut n = LinkedList::new();
232 assert!(n.iter_mut().next().is_none());
235 let mut it = n.iter_mut();
236 assert_eq!(it.size_hint(), (2, Some(2)));
237 assert!(it.next().is_some());
238 assert!(it.next().is_some());
239 assert_eq!(it.size_hint(), (0, Some(0)));
240 assert!(it.next().is_none());
244 fn test_iterator_mut_double_end() {
245 let mut n = LinkedList::new();
246 assert!(n.iter_mut().next_back().is_none());
250 let mut it = n.iter_mut();
251 assert_eq!(it.size_hint(), (3, Some(3)));
252 assert_eq!(*it.next().unwrap(), 6);
253 assert_eq!(it.size_hint(), (2, Some(2)));
254 assert_eq!(*it.next_back().unwrap(), 4);
255 assert_eq!(it.size_hint(), (1, Some(1)));
256 assert_eq!(*it.next_back().unwrap(), 5);
257 assert!(it.next_back().is_none());
258 assert!(it.next().is_none());
262 fn test_mut_rev_iter() {
263 let mut m = generate_test();
264 for (i, elt) in m.iter_mut().rev().enumerate() {
265 assert_eq!((6 - i) as i32, *elt);
267 let mut n = LinkedList::new();
268 assert!(n.iter_mut().rev().next().is_none());
270 let mut it = n.iter_mut().rev();
271 assert!(it.next().is_some());
272 assert!(it.next().is_none());
276 fn test_clone_from() {
277 // Short cloned from long
279 let v = vec![1, 2, 3, 4, 5];
280 let u = vec![8, 7, 6, 2, 3, 4, 5];
281 let mut m = list_from(&v);
282 let n = list_from(&u);
287 assert_eq!(m.pop_front(), Some(elt))
290 // Long cloned from short
292 let v = vec![1, 2, 3, 4, 5];
293 let u = vec![6, 7, 8];
294 let mut m = list_from(&v);
295 let n = list_from(&u);
300 assert_eq!(m.pop_front(), Some(elt))
303 // Two equal length lists
305 let v = vec![1, 2, 3, 4, 5];
306 let u = vec![9, 8, 1, 2, 3];
307 let mut m = list_from(&v);
308 let n = list_from(&u);
313 assert_eq!(m.pop_front(), Some(elt))
319 #[cfg_attr(target_os = "emscripten", ignore)]
321 let n = list_from(&[1, 2, 3]);
322 thread::spawn(move || {
324 let a: &[_] = &[&1, &2, &3];
325 assert_eq!(a, &*n.iter().collect::<Vec<_>>());
334 let mut n = list_from(&[]);
335 let mut m = list_from(&[]);
342 let n = list_from(&[2, 3, 4]);
343 let m = list_from(&[1, 2, 3]);
349 let n = list_from(&[]);
350 let m = list_from(&[1, 2, 3]);
359 let nan = 0.0f64 / 0.0;
360 let n = list_from(&[nan]);
361 let m = list_from(&[nan]);
367 let n = list_from(&[nan]);
368 let one = list_from(&[1.0f64]);
371 assert!(!(n <= one));
372 assert!(!(n >= one));
374 let u = list_from(&[1.0f64, 2.0, nan]);
375 let v = list_from(&[1.0f64, 2.0, 3.0]);
381 let s = list_from(&[1.0f64, 2.0, 4.0, 2.0]);
382 let t = list_from(&[1.0f64, 2.0, 3.0, 2.0]);
385 assert!(!(s <= one));
391 // There was a bug in split_off that failed to null out the RHS's head's prev ptr.
392 // This caused the RHS's dtor to walk up into the LHS at drop and delete all of
395 // https://github.com/rust-lang/rust/issues/26021
396 let mut v1 = LinkedList::new();
401 let _ = v1.split_off(3); // Dropping this now should not cause laundry consumption
402 assert_eq!(v1.len(), 3);
404 assert_eq!(v1.iter().len(), 3);
405 assert_eq!(v1.iter().collect::<Vec<_>>().len(), 3);
409 fn test_split_off() {
410 let mut v1 = LinkedList::new();
417 for ix in 0..1 + v1.len() {
418 let mut a = v1.clone();
419 let b = a.split_off(ix);
428 fn test_split_off_2() {
431 let mut m = LinkedList::new();
434 let p = m.split_off(0);
435 assert_eq!(m.len(), 0);
436 assert_eq!(p.len(), 1);
437 assert_eq!(p.back(), Some(&1));
438 assert_eq!(p.front(), Some(&1));
441 // not singleton, forwards
443 let u = vec![1, 2, 3, 4, 5];
444 let mut m = list_from(&u);
445 let mut n = m.split_off(2);
446 assert_eq!(m.len(), 2);
447 assert_eq!(n.len(), 3);
449 assert_eq!(m.pop_front(), Some(elt));
452 assert_eq!(n.pop_front(), Some(elt));
455 // not singleton, backwards
457 let u = vec![1, 2, 3, 4, 5];
458 let mut m = list_from(&u);
459 let mut n = m.split_off(4);
460 assert_eq!(m.len(), 4);
461 assert_eq!(n.len(), 1);
463 assert_eq!(m.pop_front(), Some(elt));
466 assert_eq!(n.pop_front(), Some(elt));
470 // no-op on the last index
472 let mut m = LinkedList::new();
475 let p = m.split_off(1);
476 assert_eq!(m.len(), 1);
477 assert_eq!(p.len(), 0);
478 assert_eq!(m.back(), Some(&1));
479 assert_eq!(m.front(), Some(&1));
483 fn fuzz_test(sz: i32) {
484 let mut m: LinkedList<_> = LinkedList::new();
488 let r: u8 = thread_rng().next_u32() as u8;
514 for (a, &b) in m.into_iter().zip(&v) {
518 assert_eq!(i, v.len());
526 #[cfg(not(miri))] // Miri is too slow
533 let list: LinkedList<_> = (0..10).collect();
534 assert_eq!(format!("{list:?}"), "[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]");
536 let list: LinkedList<_> = ["just", "one", "test", "more"].into_iter().collect();
537 assert_eq!(format!("{list:?}"), "[\"just\", \"one\", \"test\", \"more\"]");
541 fn drain_filter_test() {
542 let mut m: LinkedList<u32> = LinkedList::new();
543 m.extend(&[1, 2, 3, 4, 5, 6]);
544 let deleted = m.drain_filter(|v| *v < 4).collect::<Vec<_>>();
548 assert_eq!(deleted, &[1, 2, 3]);
549 assert_eq!(m.into_iter().collect::<Vec<_>>(), &[4, 5, 6]);
553 fn drain_to_empty_test() {
554 let mut m: LinkedList<u32> = LinkedList::new();
555 m.extend(&[1, 2, 3, 4, 5, 6]);
556 let deleted = m.drain_filter(|_| true).collect::<Vec<_>>();
560 assert_eq!(deleted, &[1, 2, 3, 4, 5, 6]);
561 assert_eq!(m.into_iter().collect::<Vec<_>>(), &[]);
565 fn test_cursor_move_peek() {
566 let mut m: LinkedList<u32> = LinkedList::new();
567 m.extend(&[1, 2, 3, 4, 5, 6]);
568 let mut cursor = m.cursor_front();
569 assert_eq!(cursor.current(), Some(&1));
570 assert_eq!(cursor.peek_next(), Some(&2));
571 assert_eq!(cursor.peek_prev(), None);
572 assert_eq!(cursor.index(), Some(0));
574 assert_eq!(cursor.current(), None);
575 assert_eq!(cursor.peek_next(), Some(&1));
576 assert_eq!(cursor.peek_prev(), Some(&6));
577 assert_eq!(cursor.index(), None);
580 assert_eq!(cursor.current(), Some(&2));
581 assert_eq!(cursor.peek_next(), Some(&3));
582 assert_eq!(cursor.peek_prev(), Some(&1));
583 assert_eq!(cursor.index(), Some(1));
585 let mut cursor = m.cursor_back();
586 assert_eq!(cursor.current(), Some(&6));
587 assert_eq!(cursor.peek_next(), None);
588 assert_eq!(cursor.peek_prev(), Some(&5));
589 assert_eq!(cursor.index(), Some(5));
591 assert_eq!(cursor.current(), None);
592 assert_eq!(cursor.peek_next(), Some(&1));
593 assert_eq!(cursor.peek_prev(), Some(&6));
594 assert_eq!(cursor.index(), None);
597 assert_eq!(cursor.current(), Some(&5));
598 assert_eq!(cursor.peek_next(), Some(&6));
599 assert_eq!(cursor.peek_prev(), Some(&4));
600 assert_eq!(cursor.index(), Some(4));
602 let mut m: LinkedList<u32> = LinkedList::new();
603 m.extend(&[1, 2, 3, 4, 5, 6]);
604 let mut cursor = m.cursor_front_mut();
605 assert_eq!(cursor.current(), Some(&mut 1));
606 assert_eq!(cursor.peek_next(), Some(&mut 2));
607 assert_eq!(cursor.peek_prev(), None);
608 assert_eq!(cursor.index(), Some(0));
610 assert_eq!(cursor.current(), None);
611 assert_eq!(cursor.peek_next(), Some(&mut 1));
612 assert_eq!(cursor.peek_prev(), Some(&mut 6));
613 assert_eq!(cursor.index(), None);
616 assert_eq!(cursor.current(), Some(&mut 2));
617 assert_eq!(cursor.peek_next(), Some(&mut 3));
618 assert_eq!(cursor.peek_prev(), Some(&mut 1));
619 assert_eq!(cursor.index(), Some(1));
620 let mut cursor2 = cursor.as_cursor();
621 assert_eq!(cursor2.current(), Some(&2));
622 assert_eq!(cursor2.index(), Some(1));
624 assert_eq!(cursor2.current(), Some(&3));
625 assert_eq!(cursor2.index(), Some(2));
626 assert_eq!(cursor.current(), Some(&mut 2));
627 assert_eq!(cursor.index(), Some(1));
629 let mut m: LinkedList<u32> = LinkedList::new();
630 m.extend(&[1, 2, 3, 4, 5, 6]);
631 let mut cursor = m.cursor_back_mut();
632 assert_eq!(cursor.current(), Some(&mut 6));
633 assert_eq!(cursor.peek_next(), None);
634 assert_eq!(cursor.peek_prev(), Some(&mut 5));
635 assert_eq!(cursor.index(), Some(5));
637 assert_eq!(cursor.current(), None);
638 assert_eq!(cursor.peek_next(), Some(&mut 1));
639 assert_eq!(cursor.peek_prev(), Some(&mut 6));
640 assert_eq!(cursor.index(), None);
643 assert_eq!(cursor.current(), Some(&mut 5));
644 assert_eq!(cursor.peek_next(), Some(&mut 6));
645 assert_eq!(cursor.peek_prev(), Some(&mut 4));
646 assert_eq!(cursor.index(), Some(4));
647 let mut cursor2 = cursor.as_cursor();
648 assert_eq!(cursor2.current(), Some(&5));
649 assert_eq!(cursor2.index(), Some(4));
651 assert_eq!(cursor2.current(), Some(&4));
652 assert_eq!(cursor2.index(), Some(3));
653 assert_eq!(cursor.current(), Some(&mut 5));
654 assert_eq!(cursor.index(), Some(4));
658 fn test_cursor_mut_insert() {
659 let mut m: LinkedList<u32> = LinkedList::new();
660 m.extend(&[1, 2, 3, 4, 5, 6]);
661 let mut cursor = m.cursor_front_mut();
662 cursor.insert_before(7);
663 cursor.insert_after(8);
665 assert_eq!(m.iter().cloned().collect::<Vec<_>>(), &[7, 1, 8, 2, 3, 4, 5, 6]);
666 let mut cursor = m.cursor_front_mut();
668 cursor.insert_before(9);
669 cursor.insert_after(10);
671 assert_eq!(m.iter().cloned().collect::<Vec<_>>(), &[10, 7, 1, 8, 2, 3, 4, 5, 6, 9]);
672 let mut cursor = m.cursor_front_mut();
674 assert_eq!(cursor.remove_current(), None);
677 assert_eq!(cursor.remove_current(), Some(7));
681 assert_eq!(cursor.remove_current(), Some(9));
683 assert_eq!(cursor.remove_current(), Some(10));
685 assert_eq!(m.iter().cloned().collect::<Vec<_>>(), &[1, 8, 2, 3, 4, 5, 6]);
686 let mut cursor = m.cursor_front_mut();
687 let mut p: LinkedList<u32> = LinkedList::new();
688 p.extend(&[100, 101, 102, 103]);
689 let mut q: LinkedList<u32> = LinkedList::new();
690 q.extend(&[200, 201, 202, 203]);
691 cursor.splice_after(p);
692 cursor.splice_before(q);
695 m.iter().cloned().collect::<Vec<_>>(),
696 &[200, 201, 202, 203, 1, 100, 101, 102, 103, 8, 2, 3, 4, 5, 6]
698 let mut cursor = m.cursor_front_mut();
700 let tmp = cursor.split_before();
701 assert_eq!(m.into_iter().collect::<Vec<_>>(), &[]);
703 let mut cursor = m.cursor_front_mut();
710 let tmp = cursor.split_after();
711 assert_eq!(tmp.into_iter().collect::<Vec<_>>(), &[102, 103, 8, 2, 3, 4, 5, 6]);
713 assert_eq!(m.iter().cloned().collect::<Vec<_>>(), &[200, 201, 202, 203, 1, 100, 101]);
717 fn test_cursor_push_front_back() {
718 let mut ll: LinkedList<u32> = LinkedList::new();
719 ll.extend(&[1, 2, 3, 4, 5, 6, 7, 8, 9, 10]);
720 let mut c = ll.cursor_front_mut();
721 assert_eq!(c.current(), Some(&mut 1));
722 assert_eq!(c.index(), Some(0));
724 assert_eq!(c.current(), Some(&mut 1));
725 assert_eq!(c.peek_prev(), Some(&mut 0));
726 assert_eq!(c.index(), Some(1));
729 let p = ll.cursor_back().front().unwrap();
731 assert_eq!(ll, (0..12).collect());
736 fn test_cursor_pop_front_back() {
737 let mut ll: LinkedList<u32> = LinkedList::new();
738 ll.extend(&[1, 2, 3, 4, 5, 6]);
739 let mut c = ll.cursor_back_mut();
740 assert_eq!(c.pop_front(), Some(1));
744 assert_eq!(c.pop_back(), Some(6));
745 let c = c.as_cursor();
746 assert_eq!(c.front(), Some(&2));
747 assert_eq!(c.back(), Some(&5));
748 assert_eq!(c.index(), Some(1));
750 assert_eq!(ll, (2..6).collect());
752 let mut c = ll.cursor_back_mut();
753 assert_eq!(c.current(), Some(&mut 5));
754 assert_eq!(c.index, 3);
755 assert_eq!(c.pop_back(), Some(5));
756 assert_eq!(c.current(), None);
757 assert_eq!(c.index, 3);
758 assert_eq!(c.pop_back(), Some(4));
759 assert_eq!(c.current(), None);
760 assert_eq!(c.index, 2);
764 fn test_extend_ref() {
765 let mut a = LinkedList::new();
768 a.extend(&[2, 3, 4]);
770 assert_eq!(a.len(), 4);
771 assert_eq!(a, list_from(&[1, 2, 3, 4]));
773 let mut b = LinkedList::new();
778 assert_eq!(a.len(), 6);
779 assert_eq!(a, list_from(&[1, 2, 3, 4, 5, 6]));
784 let mut a = LinkedList::new();
786 a.extend(vec![2, 3, 4]); // uses iterator
788 assert_eq!(a.len(), 4);
789 assert!(a.iter().eq(&[1, 2, 3, 4]));
791 let b: LinkedList<_> = [5, 6, 7].into_iter().collect();
792 a.extend(b); // specializes to `append`
794 assert_eq!(a.len(), 7);
795 assert!(a.iter().eq(&[1, 2, 3, 4, 5, 6, 7]));
800 let mut l = LinkedList::new();
801 l.extend(&[2, 3, 4]);
803 assert!(l.contains(&3));
804 assert!(!l.contains(&1));
808 assert!(!l.contains(&3));
812 fn drain_filter_empty() {
813 let mut list: LinkedList<i32> = LinkedList::new();
816 let mut iter = list.drain_filter(|_| true);
817 assert_eq!(iter.size_hint(), (0, Some(0)));
818 assert_eq!(iter.next(), None);
819 assert_eq!(iter.size_hint(), (0, Some(0)));
820 assert_eq!(iter.next(), None);
821 assert_eq!(iter.size_hint(), (0, Some(0)));
824 assert_eq!(list.len(), 0);
825 assert_eq!(list.into_iter().collect::<Vec<_>>(), vec![]);
829 fn drain_filter_zst() {
830 let mut list: LinkedList<_> = [(), (), (), (), ()].into_iter().collect();
831 let initial_len = list.len();
835 let mut iter = list.drain_filter(|_| true);
836 assert_eq!(iter.size_hint(), (0, Some(initial_len)));
837 while let Some(_) = iter.next() {
839 assert_eq!(iter.size_hint(), (0, Some(initial_len - count)));
841 assert_eq!(iter.size_hint(), (0, Some(0)));
842 assert_eq!(iter.next(), None);
843 assert_eq!(iter.size_hint(), (0, Some(0)));
846 assert_eq!(count, initial_len);
847 assert_eq!(list.len(), 0);
848 assert_eq!(list.into_iter().collect::<Vec<_>>(), vec![]);
852 fn drain_filter_false() {
853 let mut list: LinkedList<_> = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10].into_iter().collect();
855 let initial_len = list.len();
859 let mut iter = list.drain_filter(|_| false);
860 assert_eq!(iter.size_hint(), (0, Some(initial_len)));
861 for _ in iter.by_ref() {
864 assert_eq!(iter.size_hint(), (0, Some(0)));
865 assert_eq!(iter.next(), None);
866 assert_eq!(iter.size_hint(), (0, Some(0)));
869 assert_eq!(count, 0);
870 assert_eq!(list.len(), initial_len);
871 assert_eq!(list.into_iter().collect::<Vec<_>>(), vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10]);
875 fn drain_filter_true() {
876 let mut list: LinkedList<_> = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10].into_iter().collect();
878 let initial_len = list.len();
882 let mut iter = list.drain_filter(|_| true);
883 assert_eq!(iter.size_hint(), (0, Some(initial_len)));
884 while let Some(_) = iter.next() {
886 assert_eq!(iter.size_hint(), (0, Some(initial_len - count)));
888 assert_eq!(iter.size_hint(), (0, Some(0)));
889 assert_eq!(iter.next(), None);
890 assert_eq!(iter.size_hint(), (0, Some(0)));
893 assert_eq!(count, initial_len);
894 assert_eq!(list.len(), 0);
895 assert_eq!(list.into_iter().collect::<Vec<_>>(), vec![]);
899 fn drain_filter_complex() {
901 // [+xxx++++++xxxxx++++x+x++]
903 1, 2, 4, 6, 7, 9, 11, 13, 15, 17, 18, 20, 22, 24, 26, 27, 29, 31, 33, 34, 35, 36, 37,
907 .collect::<LinkedList<_>>();
909 let removed = list.drain_filter(|x| *x % 2 == 0).collect::<Vec<_>>();
910 assert_eq!(removed.len(), 10);
911 assert_eq!(removed, vec![2, 4, 6, 18, 20, 22, 24, 26, 34, 36]);
913 assert_eq!(list.len(), 14);
915 list.into_iter().collect::<Vec<_>>(),
916 vec![1, 7, 9, 11, 13, 15, 17, 27, 29, 31, 33, 35, 37, 39]
921 // [xxx++++++xxxxx++++x+x++]
923 [2, 4, 6, 7, 9, 11, 13, 15, 17, 18, 20, 22, 24, 26, 27, 29, 31, 33, 34, 35, 36, 37, 39]
925 .collect::<LinkedList<_>>();
927 let removed = list.drain_filter(|x| *x % 2 == 0).collect::<Vec<_>>();
928 assert_eq!(removed.len(), 10);
929 assert_eq!(removed, vec![2, 4, 6, 18, 20, 22, 24, 26, 34, 36]);
931 assert_eq!(list.len(), 13);
933 list.into_iter().collect::<Vec<_>>(),
934 vec![7, 9, 11, 13, 15, 17, 27, 29, 31, 33, 35, 37, 39]
939 // [xxx++++++xxxxx++++x+x]
941 [2, 4, 6, 7, 9, 11, 13, 15, 17, 18, 20, 22, 24, 26, 27, 29, 31, 33, 34, 35, 36]
943 .collect::<LinkedList<_>>();
945 let removed = list.drain_filter(|x| *x % 2 == 0).collect::<Vec<_>>();
946 assert_eq!(removed.len(), 10);
947 assert_eq!(removed, vec![2, 4, 6, 18, 20, 22, 24, 26, 34, 36]);
949 assert_eq!(list.len(), 11);
951 list.into_iter().collect::<Vec<_>>(),
952 vec![7, 9, 11, 13, 15, 17, 27, 29, 31, 33, 35]
957 // [xxxxxxxxxx+++++++++++]
958 let mut list = [2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 1, 3, 5, 7, 9, 11, 13, 15, 17, 19]
960 .collect::<LinkedList<_>>();
962 let removed = list.drain_filter(|x| *x % 2 == 0).collect::<Vec<_>>();
963 assert_eq!(removed.len(), 10);
964 assert_eq!(removed, vec![2, 4, 6, 8, 10, 12, 14, 16, 18, 20]);
966 assert_eq!(list.len(), 10);
967 assert_eq!(list.into_iter().collect::<Vec<_>>(), vec![1, 3, 5, 7, 9, 11, 13, 15, 17, 19]);
971 // [+++++++++++xxxxxxxxxx]
972 let mut list = [1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20]
974 .collect::<LinkedList<_>>();
976 let removed = list.drain_filter(|x| *x % 2 == 0).collect::<Vec<_>>();
977 assert_eq!(removed.len(), 10);
978 assert_eq!(removed, vec![2, 4, 6, 8, 10, 12, 14, 16, 18, 20]);
980 assert_eq!(list.len(), 10);
981 assert_eq!(list.into_iter().collect::<Vec<_>>(), vec![1, 3, 5, 7, 9, 11, 13, 15, 17, 19]);
986 fn drain_filter_drop_panic_leak() {
987 static mut DROPS: i32 = 0;
998 panic!("panic in `drop`");
1003 let mut q = LinkedList::new();
1004 q.push_back(D(false));
1005 q.push_back(D(false));
1006 q.push_back(D(false));
1007 q.push_back(D(false));
1008 q.push_back(D(false));
1009 q.push_front(D(false));
1010 q.push_front(D(true));
1011 q.push_front(D(false));
1013 catch_unwind(AssertUnwindSafe(|| drop(q.drain_filter(|_| true)))).ok();
1015 assert_eq!(unsafe { DROPS }, 8);
1016 assert!(q.is_empty());
1020 fn drain_filter_pred_panic_leak() {
1021 static mut DROPS: i32 = 0;
1027 fn drop(&mut self) {
1034 let mut q = LinkedList::new();
1044 catch_unwind(AssertUnwindSafe(|| {
1045 drop(q.drain_filter(|item| if item.0 >= 2 { panic!() } else { true }))
1049 assert_eq!(unsafe { DROPS }, 2); // 0 and 1
1050 assert_eq!(q.len(), 6);
1055 static mut DROPS: i32 = 0;
1057 impl Drop for Elem {
1058 fn drop(&mut self) {
1065 let mut ring = LinkedList::new();
1066 ring.push_back(Elem);
1067 ring.push_front(Elem);
1068 ring.push_back(Elem);
1069 ring.push_front(Elem);
1072 assert_eq!(unsafe { DROPS }, 4);
1076 fn test_drop_with_pop() {
1077 static mut DROPS: i32 = 0;
1079 impl Drop for Elem {
1080 fn drop(&mut self) {
1087 let mut ring = LinkedList::new();
1088 ring.push_back(Elem);
1089 ring.push_front(Elem);
1090 ring.push_back(Elem);
1091 ring.push_front(Elem);
1093 drop(ring.pop_back());
1094 drop(ring.pop_front());
1095 assert_eq!(unsafe { DROPS }, 2);
1098 assert_eq!(unsafe { DROPS }, 4);
1102 fn test_drop_clear() {
1103 static mut DROPS: i32 = 0;
1105 impl Drop for Elem {
1106 fn drop(&mut self) {
1113 let mut ring = LinkedList::new();
1114 ring.push_back(Elem);
1115 ring.push_front(Elem);
1116 ring.push_back(Elem);
1117 ring.push_front(Elem);
1119 assert_eq!(unsafe { DROPS }, 4);
1122 assert_eq!(unsafe { DROPS }, 4);
1126 fn test_drop_panic() {
1127 static mut DROPS: i32 = 0;
1132 fn drop(&mut self) {
1138 panic!("panic in `drop`");
1143 let mut q = LinkedList::new();
1144 q.push_back(D(false));
1145 q.push_back(D(false));
1146 q.push_back(D(false));
1147 q.push_back(D(false));
1148 q.push_back(D(false));
1149 q.push_front(D(false));
1150 q.push_front(D(false));
1151 q.push_front(D(true));
1153 catch_unwind(move || drop(q)).ok();
1155 assert_eq!(unsafe { DROPS }, 8);