Skip to content

Commit eada4d1

Browse files
committed
Add diagnostic items
1 parent 4a6e67e commit eada4d1

File tree

6 files changed

+10
-0
lines changed

6 files changed

+10
-0
lines changed

compiler/rustc_span/src/symbol.rs

Lines changed: 5 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -126,6 +126,9 @@ symbols! {
126126
Argument,
127127
ArgumentV1,
128128
Arguments,
129+
BTreeMap,
130+
BTreeSet,
131+
BinaryHeap,
129132
C,
130133
CString,
131134
Center,
@@ -163,6 +166,7 @@ symbols! {
163166
Iterator,
164167
Layout,
165168
Left,
169+
LinkedList,
166170
LintPass,
167171
None,
168172
Ok,
@@ -1258,6 +1262,7 @@ symbols! {
12581262
variant_count,
12591263
vec,
12601264
vec_type,
1265+
vecdeque_type,
12611266
version,
12621267
vis,
12631268
visible_private_types,

library/alloc/src/collections/binary_heap.rs

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -247,6 +247,7 @@ use super::SpecExtend;
247247
/// [peek]: BinaryHeap::peek
248248
/// [peek\_mut]: BinaryHeap::peek_mut
249249
#[stable(feature = "rust1", since = "1.0.0")]
250+
#[cfg_attr(not(test), rustc_diagnostic_item = "BinaryHeap")]
250251
pub struct BinaryHeap<T> {
251252
data: Vec<T>,
252253
}

library/alloc/src/collections/btree/map.rs

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -138,6 +138,7 @@ pub(super) const MIN_LEN: usize = node::MIN_LEN_AFTER_SPLIT;
138138
/// *stat += random_stat_buff();
139139
/// ```
140140
#[stable(feature = "rust1", since = "1.0.0")]
141+
#[cfg_attr(not(test), rustc_diagnostic_item = "BTreeMap")]
141142
pub struct BTreeMap<K, V> {
142143
root: Option<Root<K, V>>,
143144
length: usize,

library/alloc/src/collections/btree/set.rs

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -61,6 +61,7 @@ use super::Recover;
6161
/// ```
6262
#[derive(Hash, PartialEq, Eq, Ord, PartialOrd)]
6363
#[stable(feature = "rust1", since = "1.0.0")]
64+
#[cfg_attr(not(test), rustc_diagnostic_item = "BTreeSet")]
6465
pub struct BTreeSet<T> {
6566
map: BTreeMap<T, ()>,
6667
}

library/alloc/src/collections/linked_list.rs

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -35,6 +35,7 @@ mod tests;
3535
/// array-based containers are generally faster,
3636
/// more memory efficient, and make better use of CPU cache.
3737
#[stable(feature = "rust1", since = "1.0.0")]
38+
#[cfg_attr(not(test), rustc_diagnostic_item = "LinkedList")]
3839
pub struct LinkedList<T> {
3940
head: Option<NonNull<Node<T>>>,
4041
tail: Option<NonNull<Node<T>>>,

library/std/src/sync/mpsc/mod.rs

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -310,6 +310,7 @@ mod cache_aligned;
310310
/// println!("{}", recv.recv().unwrap()); // Received after 2 seconds
311311
/// ```
312312
#[stable(feature = "rust1", since = "1.0.0")]
313+
#[cfg_attr(not(test), rustc_diagnostic_item = "Receiver")]
313314
pub struct Receiver<T> {
314315
inner: UnsafeCell<Flavor<T>>,
315316
}

0 commit comments

Comments
 (0)