1 // Copyright 2013 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 use std::collections::LinkedList;
12 use std::iter::Iterator;
17 // Test that for all possible sequences of push_front / push_back,
18 // we end up with a LinkedList of the correct size
21 let mut tester = LinkedList::new();
22 assert_eq!(tester.len(), 0);
23 assert_eq!(tester.front(), None);
24 for case in 0..(1 << len) {
25 assert_eq!(tester.len(), 0);
27 if case & (1 << bit) != 0 {
28 tester.push_front(());
33 assert_eq!(tester.len(), len);
34 assert_eq!(tester.iter().count(), len);