26
26
// gdb-command: print empty_btree_map
27
27
// gdb-check:$4 = BTreeMap<i32, u32>(len: 0)
28
28
29
+ // gdb-command: print option_btree_map
30
+ // gdb-check:$5 = BTreeMap<bool, core::option::Option<bool>>(len: 2) = {[false] = [...], [true] = [...]}
31
+ // (abbreviated because both values vary wildly over gdb versions and/or linux distributions)
32
+
29
33
// gdb-command: print nasty_btree_map
30
- // gdb-check:$5 = BTreeMap<i32, pretty_std_collections::MyLeafNode>(len: 1) = {[1] = pretty_std_collections::MyLeafNode (11)}
34
+ // gdb-check:$6 = BTreeMap<i32, pretty_std_collections::MyLeafNode>(len: 15) = {[0] = pretty_std_collections::MyLeafNode (0), [...]}
35
+ // (abbreviated because it's boring but we need enough elements to include internal nodes)
31
36
32
37
// gdb-command: print vec_deque
33
- // gdb-check:$6 = VecDeque<i32>(len: 3, cap: 8) = {5, 3, 7}
38
+ // gdb-check:$7 = VecDeque<i32>(len: 3, cap: 8) = {5, 3, 7}
34
39
35
40
// gdb-command: print vec_deque2
36
- // gdb-check:$7 = VecDeque<i32>(len: 7, cap: 8) = {2, 3, 4, 5, 6, 7, 8}
41
+ // gdb-check:$8 = VecDeque<i32>(len: 7, cap: 8) = {2, 3, 4, 5, 6, 7, 8}
37
42
38
43
#![ allow( unused_variables) ]
39
44
use std:: collections:: BTreeMap ;
@@ -59,8 +64,14 @@ fn main() {
59
64
60
65
let mut empty_btree_map: BTreeMap < i32 , u32 > = BTreeMap :: new ( ) ;
61
66
67
+ let mut option_btree_map: BTreeMap < bool , Option < bool > > = BTreeMap :: new ( ) ;
68
+ option_btree_map. insert ( false , None ) ;
69
+ option_btree_map. insert ( true , Some ( true ) ) ;
70
+
62
71
let mut nasty_btree_map: BTreeMap < i32 , MyLeafNode > = BTreeMap :: new ( ) ;
63
- nasty_btree_map. insert ( 1 , MyLeafNode ( 11 ) ) ;
72
+ for i in 0 ..15 {
73
+ nasty_btree_map. insert ( i, MyLeafNode ( i) ) ;
74
+ }
64
75
65
76
// VecDeque
66
77
let mut vec_deque = VecDeque :: new ( ) ;
0 commit comments