fn bounded_iterator_resumption() {
        let list = StableList::new();
        let mut iter = list.bounded_iter(0, Some(5));
        assert_eq!(iter.next(), None);
        for i in 1000..1010 {
            list.push(i);
        }
        assert_eq!(list.len(), 10);
        for i in 1000..1005 {
            assert_eq!(iter.next(), Some(&i));
        }
        assert_eq!(iter.next(), None);
    }
/// Test that iterator can be bounded and retain resumption
Test that iterator can be bounded and retain resumption
Test that iterator can be bounded and retain resumption
fn bounded_iterator_resumption() {
        let list = StableList::new();
        let mut iter = list.bounded_iter(0, Some(5));
        assert_eq!(iter.next(), None);
        for i in 1000..1010 {
            list.push(i);
        }
        assert_eq!(list.len(), 10);
        for i in 1000..1005 {
            assert_eq!(iter.next(), Some(&i));
        }
        assert_eq!(iter.next(), None);
    }
fn bounded_iterator_resumption ( ) { let list = StableList :: new ( ) ; let mut iter = list . bounded_iter ( 0 , Some ( 5 ) ) ; assert_eq ! ( iter next ( ) None ) ; for i in 1000 .. 1010 { list . push ( i ) ; } assert_eq ! ( list len ( ) 10 ) ; for i in 1000 .. 1005 { assert_eq ! ( iter next ( ) Some ( i ) ) ; } assert_eq ! ( iter next ( ) None ) ; }
Test that iterator can be bounded and retain resumption
Test that iterator can be bounded and retain resumption