1 // ignore-tidy-linelength
2 // ignore-windows failing on win32 bot
3 // ignore-freebsd: gdb package too new
4 // ignore-android: FIXME(#10381)
5 // ignore-macos: FIXME(#78665)
8 // The pretty printers being tested here require the patch from
9 // https://sourceware.org/bugzilla/show_bug.cgi?id=21763
10 // min-gdb-version: 8.1
12 // min-lldb-version: 310
14 // === GDB TESTS ===================================================================================
18 // gdb-command: print btree_set
19 // gdb-check:$1 = BTreeSet(size=15) = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14}
21 // gdb-command: print empty_btree_set
22 // gdb-check:$2 = BTreeSet(size=0)
24 // gdb-command: print btree_map
25 // gdb-check:$3 = BTreeMap(size=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}
27 // gdb-command: print empty_btree_map
28 // gdb-check:$4 = BTreeMap(size=0)
30 // gdb-command: print option_btree_map
31 // gdb-check:$5 = BTreeMap(size=2) = {[false] = [...], [true] = [...]}
32 // (abbreviated because both values vary wildly over gdb versions and/or linux distributions)
34 // gdb-command: print nasty_btree_map
35 // gdb-check:$6 = BTreeMap(size=15) = {[0] = pretty_std_collections::MyLeafNode (0), [...]}
36 // (abbreviated because it's boring but we need enough elements to include internal nodes)
38 // gdb-command: print zst_key_btree_map
39 // gdb-check:$7 = BTreeMap(size=1) = {[()] = 1}
41 // gdb-command: print zst_val_btree_map
42 // gdb-check:$8 = BTreeMap(size=1) = {[1] = ()}
44 // gdb-command: print zst_key_val_btree_map
45 // gdb-check:$9 = BTreeMap(size=1) = {[()] = ()}
47 // gdb-command: print vec_deque
48 // gdb-check:$10 = VecDeque(size=3) = {5, 3, 7}
50 // gdb-command: print vec_deque2
51 // gdb-check:$11 = VecDeque(size=7) = {2, 3, 4, 5, 6, 7, 8}
53 // gdb-command: print hash_map
54 // gdb-check:$12 = HashMap(size=4) = {[1] = 10, [2] = 20, [3] = 30, [4] = 40}
56 // gdb-command: print hash_set
57 // gdb-check:$13 = HashSet(size=4) = {1, 2, 3, 4}
59 // === LLDB TESTS ==================================================================================
63 // lldb-command:print vec_deque
64 // lldbg-check:[...]$0 = size=3 { [0] = 5 [1] = 3 [2] = 7 }
65 // lldbr-check:(alloc::collections::vec_deque::VecDeque<i32>) vec_deque = size=3 = { [0] = 5 [1] = 3 [2] = 7 }
67 // lldb-command:print vec_deque2
68 // lldbg-check:[...]$1 = size=7 { [0] = 2 [1] = 3 [2] = 4 [3] = 5 [4] = 6 [5] = 7 [6] = 8 }
69 // lldbr-check:(alloc::collections::vec_deque::VecDeque<i32>) vec_deque2 = size=7 = { [0] = 2 [1] = 3 [2] = 4 [3] = 5 [4] = 6 [5] = 7 [6] = 8 }
71 // lldb-command:print hash_map
72 // lldbg-check:[...]$2 = size=4 { [0] = { 0 = 1 1 = 10 } [1] = { 0 = 2 1 = 20 } [2] = { 0 = 3 1 = 30 } [3] = { 0 = 4 1 = 40 } }
73 // lldbr-check:(std::collections::hash::map::HashMap<u64, u64, [...]>) hash_map = size=4 size=4 { [0] = { 0 = 1 1 = 10 } [1] = { 0 = 2 1 = 20 } [2] = { 0 = 3 1 = 30 } [3] = { 0 = 4 1 = 40 } }
75 // lldb-command:print hash_set
76 // lldbg-check:[...]$3 = size=4 { [0] = 1 [1] = 2 [2] = 3 [3] = 4 }
77 // lldbr-check:(std::collections::hash::set::HashSet<u64, [...]>) hash_set = size=4 { [0] = 1 [1] = 2 [2] = 3 [3] = 4 }
79 #![allow(unused_variables)]
80 use std::collections::BTreeMap;
81 use std::collections::BTreeSet;
82 use std::collections::HashMap;
83 use std::collections::HashSet;
84 use std::collections::VecDeque;
85 use std::hash::{BuildHasherDefault, Hasher};
87 struct MyLeafNode(i32); // helps to ensure we don't blindly replace substring "LeafNode"
90 struct SimpleHasher { hash: u64 }
92 impl Hasher for SimpleHasher {
93 fn finish(&self) -> u64 { self.hash }
94 fn write(&mut self, bytes: &[u8]) {}
95 fn write_u64(&mut self, i: u64) { self.hash = i }
100 let mut btree_set = BTreeSet::new();
105 let empty_btree_set: BTreeSet<i32> = BTreeSet::new();
108 let mut btree_map = BTreeMap::new();
110 btree_map.insert(i, i);
113 let empty_btree_map: BTreeMap<i32, u32> = BTreeMap::new();
115 let mut option_btree_map: BTreeMap<bool, Option<bool>> = BTreeMap::new();
116 option_btree_map.insert(false, None);
117 option_btree_map.insert(true, Some(true));
119 let mut nasty_btree_map: BTreeMap<i32, MyLeafNode> = BTreeMap::new();
121 nasty_btree_map.insert(i, MyLeafNode(i));
124 let mut zst_key_btree_map: BTreeMap<(), i32> = BTreeMap::new();
125 zst_key_btree_map.insert((), 1);
127 let mut zst_val_btree_map: BTreeMap<i32, ()> = BTreeMap::new();
128 zst_val_btree_map.insert(1, ());
130 let mut zst_key_val_btree_map: BTreeMap<(), ()> = BTreeMap::new();
131 zst_key_val_btree_map.insert((), ());
134 let mut vec_deque = VecDeque::new();
135 vec_deque.push_back(5);
136 vec_deque.push_back(3);
137 vec_deque.push_back(7);
139 // VecDeque where an element was popped.
140 let mut vec_deque2 = VecDeque::new();
142 vec_deque2.push_back(i)
144 vec_deque2.pop_front();
145 vec_deque2.push_back(8);
148 let mut hash_map = HashMap::<u64, u64, BuildHasherDefault<SimpleHasher>>::default();
150 hash_map.insert(i, i * 10);
154 let mut hash_set = HashSet::<u64, BuildHasherDefault<SimpleHasher>>::default();