26
26
// gdb-command: print empty_btree_map
27
27
// gdb-check:$4 = BTreeMap<i32, u32>(len: 0)
28
28
29
+ // gdb-command: print nasty_btree_map
30
+ // gdb-check:$5 = BTreeMap<i32, pretty_std_collections::MyLeafNode>(len: 1) = {[1] = pretty_std_collections::MyLeafNode (11)}
31
+
29
32
// gdb-command: print vec_deque
30
- // gdb-check:$5 = VecDeque<i32>(len: 3, cap: 8) = {5, 3, 7}
33
+ // gdb-check:$6 = VecDeque<i32>(len: 3, cap: 8) = {5, 3, 7}
31
34
32
35
// gdb-command: print vec_deque2
33
- // gdb-check:$6 = VecDeque<i32>(len: 7, cap: 8) = {2, 3, 4, 5, 6, 7, 8}
36
+ // gdb-check:$7 = VecDeque<i32>(len: 7, cap: 8) = {2, 3, 4, 5, 6, 7, 8}
34
37
35
38
#![ allow( unused_variables) ]
36
39
use std:: collections:: BTreeMap ;
37
40
use std:: collections:: BTreeSet ;
38
41
use std:: collections:: VecDeque ;
39
42
43
+ struct MyLeafNode ( i32 ) ; // helps to ensure we don't blindly replace substring "LeafNode"
44
+
40
45
fn main ( ) {
41
46
// BTreeSet
42
47
let mut btree_set = BTreeSet :: new ( ) ;
@@ -54,6 +59,9 @@ fn main() {
54
59
55
60
let mut empty_btree_map: BTreeMap < i32 , u32 > = BTreeMap :: new ( ) ;
56
61
62
+ let mut nasty_btree_map: BTreeMap < i32 , MyLeafNode > = BTreeMap :: new ( ) ;
63
+ nasty_btree_map. insert ( 1 , MyLeafNode ( 11 ) ) ;
64
+
57
65
// VecDeque
58
66
let mut vec_deque = VecDeque :: new ( ) ;
59
67
vec_deque. push_back ( 5 ) ;
0 commit comments