1717// gdb-command: print btree_set
1818// gdb-check:$1 = BTreeSet<i32>(len: 15) = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14}
1919
20+ // gdb-command: print empty_btree_set
21+ // gdb-check:$2 = BTreeSet<i32>(len: 0)
22+
2023// gdb-command: print btree_map
21- // gdb-check:$2 = BTreeMap<i32, i32>(len: 15) = {[0] = 0, [1] = 1, [2] = 2, [3] = 3, [4] = 4, [5] = 5, [6] = 6, [7] = 7, [8] = 8, [9] = 9, [10] = 10, [11] = 11, [12] = 12, [13] = 13, [14] = 14}
24+ // gdb-check:$3 = BTreeMap<i32, i32>(len: 15) = {[0] = 0, [1] = 1, [2] = 2, [3] = 3, [4] = 4, [5] = 5, [6] = 6, [7] = 7, [8] = 8, [9] = 9, [10] = 10, [11] = 11, [12] = 12, [13] = 13, [14] = 14}
25+
26+ // gdb-command: print empty_btree_map
27+ // gdb-check:$4 = BTreeMap<i32, u32>(len: 0)
2228
2329// gdb-command: print vec_deque
24- // gdb-check:$3 = VecDeque<i32>(len: 3, cap: 8) = {5, 3, 7}
30+ // gdb-check:$5 = VecDeque<i32>(len: 3, cap: 8) = {5, 3, 7}
2531
2632// gdb-command: print vec_deque2
27- // gdb-check:$4 = VecDeque<i32>(len: 7, cap: 8) = {2, 3, 4, 5, 6, 7, 8}
33+ // gdb-check:$6 = VecDeque<i32>(len: 7, cap: 8) = {2, 3, 4, 5, 6, 7, 8}
2834
2935#![ allow( unused_variables) ]
30- use std:: collections:: BTreeSet ;
3136use std:: collections:: BTreeMap ;
37+ use std:: collections:: BTreeSet ;
3238use std:: collections:: VecDeque ;
3339
34-
3540fn main ( ) {
36-
3741 // BTreeSet
3842 let mut btree_set = BTreeSet :: new ( ) ;
3943 for i in 0 ..15 {
4044 btree_set. insert ( i) ;
4145 }
4246
47+ let mut empty_btree_set: BTreeSet < i32 > = BTreeSet :: new ( ) ;
48+
4349 // BTreeMap
4450 let mut btree_map = BTreeMap :: new ( ) ;
4551 for i in 0 ..15 {
4652 btree_map. insert ( i, i) ;
4753 }
4854
55+ let mut empty_btree_map: BTreeMap < i32 , u32 > = BTreeMap :: new ( ) ;
56+
4957 // VecDeque
5058 let mut vec_deque = VecDeque :: new ( ) ;
5159 vec_deque. push_back ( 5 ) ;
@@ -63,4 +71,6 @@ fn main() {
6371 zzz ( ) ; // #break
6472}
6573
66- fn zzz ( ) { ( ) }
74+ fn zzz ( ) {
75+ ( )
76+ }
0 commit comments