]>
Commit | Line | Data |
---|---|---|
1 | //@ ignore-windows failing on win32 bot | |
2 | //@ ignore-freebsd: gdb package too new | |
3 | //@ ignore-android: FIXME(#10381) | |
4 | //@ compile-flags:-g | |
5 | ||
6 | // The pretty printers being tested here require the patch from | |
7 | // https://sourceware.org/bugzilla/show_bug.cgi?id=21763 | |
8 | //@ min-gdb-version: 8.1 | |
9 | ||
10 | //@ min-lldb-version: 310 | |
11 | ||
12 | // === GDB TESTS =================================================================================== | |
13 | ||
14 | // gdb-command: run | |
15 | ||
16 | // gdb-command: print btree_set | |
17 | // gdb-check:$1 = BTreeSet(size=15) = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14} | |
18 | ||
19 | // gdb-command: print empty_btree_set | |
20 | // gdb-check:$2 = BTreeSet(size=0) | |
21 | ||
22 | // gdb-command: print btree_map | |
23 | // 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} | |
24 | ||
25 | // gdb-command: print empty_btree_map | |
26 | // gdb-check:$4 = BTreeMap(size=0) | |
27 | ||
28 | // gdb-command: print option_btree_map | |
29 | // gdb-check:$5 = BTreeMap(size=2) = {[false] = [...], [true] = [...]} | |
30 | // (abbreviated because both values vary wildly over gdb versions and/or linux distributions) | |
31 | ||
32 | // gdb-command: print nasty_btree_map | |
33 | // gdb-check:$6 = BTreeMap(size=15) = {[0] = pretty_std_collections::MyLeafNode (0), [...]} | |
34 | // (abbreviated because it's boring but we need enough elements to include internal nodes) | |
35 | ||
36 | // gdb-command: print zst_key_btree_map | |
37 | // gdb-check:$7 = BTreeMap(size=1) = {[()] = 1} | |
38 | ||
39 | // gdb-command: print zst_val_btree_map | |
40 | // gdb-check:$8 = BTreeMap(size=1) = {[1] = ()} | |
41 | ||
42 | // gdb-command: print zst_key_val_btree_map | |
43 | // gdb-check:$9 = BTreeMap(size=1) = {[()] = ()} | |
44 | ||
45 | // gdb-command: print vec_deque | |
46 | // gdb-check:$10 = VecDeque(size=3) = {5, 3, 7} | |
47 | ||
48 | // gdb-command: print vec_deque2 | |
49 | // gdb-check:$11 = VecDeque(size=7) = {2, 3, 4, 5, 6, 7, 8} | |
50 | ||
51 | // gdb-command: print hash_map | |
52 | // gdb-check:$12 = HashMap(size=4) = {[1] = 10, [2] = 20, [3] = 30, [4] = 40} | |
53 | ||
54 | // gdb-command: print hash_set | |
55 | // gdb-check:$13 = HashSet(size=4) = {1, 2, 3, 4} | |
56 | ||
57 | // === LLDB TESTS ================================================================================== | |
58 | ||
59 | // lldb-command:run | |
60 | ||
61 | // lldb-command:v vec_deque | |
62 | // lldbg-check:[...] size=3 { [0] = 5 [1] = 3 [2] = 7 } | |
63 | // lldbr-check:(alloc::collections::vec_deque::VecDeque<i32>) vec_deque = size=3 = { [0] = 5 [1] = 3 [2] = 7 } | |
64 | ||
65 | // lldb-command:v vec_deque2 | |
66 | // lldbg-check:[...] size=7 { [0] = 2 [1] = 3 [2] = 4 [3] = 5 [4] = 6 [5] = 7 [6] = 8 } | |
67 | // 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 } | |
68 | ||
69 | // lldb-command:v hash_map | |
70 | // lldbg-check:[...] size=4 { [0] = { 0 = 1 1 = 10 } [1] = { 0 = 2 1 = 20 } [2] = { 0 = 3 1 = 30 } [3] = { 0 = 4 1 = 40 } } | |
71 | // 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 } } | |
72 | ||
73 | // lldb-command:v hash_set | |
74 | // lldbg-check:[...] size=4 { [0] = 1 [1] = 2 [2] = 3 [3] = 4 } | |
75 | // lldbr-check:(std::collections::hash::set::HashSet<u64, [...]>) hash_set = size=4 { [0] = 1 [1] = 2 [2] = 3 [3] = 4 } | |
76 | ||
77 | #![allow(unused_variables)] | |
78 | use std::collections::BTreeMap; | |
79 | use std::collections::BTreeSet; | |
80 | use std::collections::HashMap; | |
81 | use std::collections::HashSet; | |
82 | use std::collections::VecDeque; | |
83 | use std::hash::{BuildHasherDefault, Hasher}; | |
84 | ||
85 | struct MyLeafNode(i32); // helps to ensure we don't blindly replace substring "LeafNode" | |
86 | ||
87 | #[derive(Default)] | |
88 | struct SimpleHasher { hash: u64 } | |
89 | ||
90 | impl Hasher for SimpleHasher { | |
91 | fn finish(&self) -> u64 { self.hash } | |
92 | fn write(&mut self, bytes: &[u8]) {} | |
93 | fn write_u64(&mut self, i: u64) { self.hash = i } | |
94 | } | |
95 | ||
96 | fn main() { | |
97 | // BTreeSet | |
98 | let mut btree_set = BTreeSet::new(); | |
99 | for i in 0..15 { | |
100 | btree_set.insert(i); | |
101 | } | |
102 | ||
103 | let empty_btree_set: BTreeSet<i32> = BTreeSet::new(); | |
104 | ||
105 | // BTreeMap | |
106 | let mut btree_map = BTreeMap::new(); | |
107 | for i in 0..15 { | |
108 | btree_map.insert(i, i); | |
109 | } | |
110 | ||
111 | let empty_btree_map: BTreeMap<i32, u32> = BTreeMap::new(); | |
112 | ||
113 | let mut option_btree_map: BTreeMap<bool, Option<bool>> = BTreeMap::new(); | |
114 | option_btree_map.insert(false, None); | |
115 | option_btree_map.insert(true, Some(true)); | |
116 | ||
117 | let mut nasty_btree_map: BTreeMap<i32, MyLeafNode> = BTreeMap::new(); | |
118 | for i in 0..15 { | |
119 | nasty_btree_map.insert(i, MyLeafNode(i)); | |
120 | } | |
121 | ||
122 | let mut zst_key_btree_map: BTreeMap<(), i32> = BTreeMap::new(); | |
123 | zst_key_btree_map.insert((), 1); | |
124 | ||
125 | let mut zst_val_btree_map: BTreeMap<i32, ()> = BTreeMap::new(); | |
126 | zst_val_btree_map.insert(1, ()); | |
127 | ||
128 | let mut zst_key_val_btree_map: BTreeMap<(), ()> = BTreeMap::new(); | |
129 | zst_key_val_btree_map.insert((), ()); | |
130 | ||
131 | // VecDeque | |
132 | let mut vec_deque = VecDeque::new(); | |
133 | vec_deque.push_back(5); | |
134 | vec_deque.push_back(3); | |
135 | vec_deque.push_back(7); | |
136 | ||
137 | // VecDeque where an element was popped. | |
138 | let mut vec_deque2 = VecDeque::new(); | |
139 | for i in 1..8 { | |
140 | vec_deque2.push_back(i) | |
141 | } | |
142 | vec_deque2.pop_front(); | |
143 | vec_deque2.push_back(8); | |
144 | ||
145 | // HashMap | |
146 | let mut hash_map = HashMap::<u64, u64, BuildHasherDefault<SimpleHasher>>::default(); | |
147 | for i in 1..5 { | |
148 | hash_map.insert(i, i * 10); | |
149 | } | |
150 | ||
151 | // HashSet | |
152 | let mut hash_set = HashSet::<u64, BuildHasherDefault<SimpleHasher>>::default(); | |
153 | for i in 1..5 { | |
154 | hash_set.insert(i); | |
155 | } | |
156 | ||
157 | zzz(); // #break | |
158 | } | |
159 | ||
160 | fn zzz() { | |
161 | () | |
162 | } |