2626// gdb-command: print empty_btree_map
2727// gdb-check:$4 = BTreeMap<i32, u32>(len: 0)
2828
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+
2932// 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}
3134
3235// 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}
3437
3538#![ allow( unused_variables) ]
3639use std:: collections:: BTreeMap ;
3740use std:: collections:: BTreeSet ;
3841use std:: collections:: VecDeque ;
3942
43+ struct MyLeafNode ( i32 ) ; // helps to ensure we don't blindly replace substring "LeafNode"
44+
4045fn main ( ) {
4146 // BTreeSet
4247 let mut btree_set = BTreeSet :: new ( ) ;
@@ -54,6 +59,9 @@ fn main() {
5459
5560 let mut empty_btree_map: BTreeMap < i32 , u32 > = BTreeMap :: new ( ) ;
5661
62+ let mut nasty_btree_map: BTreeMap < i32 , MyLeafNode > = BTreeMap :: new ( ) ;
63+ nasty_btree_map. insert ( 1 , MyLeafNode ( 11 ) ) ;
64+
5765 // VecDeque
5866 let mut vec_deque = VecDeque :: new ( ) ;
5967 vec_deque. push_back ( 5 ) ;
0 commit comments