Auto merge of #91825 - matthiaskrgr:rollup-e4s8lwp, r=matthiaskrgr
Rollup of 6 pull requests Successful merges: - #91746 (Btree: assert more API compatibility) - #91748 (rustdoc: Add regression test for Iterator as notable trait on &mut T) - #91811 (bootstrap: Change unwrap() to expect() for WIX path) - #91814 (doc: fix typo in comments) - #91815 (better span for unexpected normalization failure in CTFE engine) - #91817 (rustbot: Add autolabeling for `T-rustdoc`) Failed merges: r? `@ghost` `@rustbot` modify labels: rollup
This commit is contained in:
commit
a0a4c7d1e4
|
@ -15,7 +15,7 @@ use rustc_middle::ty::{
|
|||
use rustc_mir_dataflow::storage::AlwaysLiveLocals;
|
||||
use rustc_query_system::ich::StableHashingContext;
|
||||
use rustc_session::Limit;
|
||||
use rustc_span::{Pos, Span, DUMMY_SP};
|
||||
use rustc_span::{Pos, Span};
|
||||
use rustc_target::abi::{Align, HasDataLayout, Size, TargetDataLayout};
|
||||
|
||||
use super::{
|
||||
|
@ -525,7 +525,7 @@ impl<'mir, 'tcx: 'mir, M: Machine<'mir, 'tcx>> InterpCx<'mir, 'tcx, M> {
|
|||
.try_subst_mir_and_normalize_erasing_regions(*self.tcx, self.param_env, value)
|
||||
.or_else(|e| {
|
||||
self.tcx.sess.delay_span_bug(
|
||||
DUMMY_SP,
|
||||
self.cur_span(),
|
||||
format!("failed to normalize {}", e.get_type_for_failure()).as_str(),
|
||||
);
|
||||
|
||||
|
|
|
@ -140,7 +140,7 @@ impl<'mir, 'tcx: 'mir, M: Machine<'mir, 'tcx>> InterpCx<'mir, 'tcx, M> {
|
|||
|
||||
sym::min_align_of_val | sym::size_of_val => {
|
||||
// Avoid `deref_operand` -- this is not a deref, the ptr does not have to be
|
||||
// dereferencable!
|
||||
// dereferenceable!
|
||||
let place = self.ref_to_mplace(&self.read_immediate(&args[0])?)?;
|
||||
let (size, align) = self
|
||||
.size_and_align_of_mplace(&place)?
|
||||
|
|
|
@ -327,7 +327,7 @@ where
|
|||
self.memory.get_mut(place.ptr, size, place.align)
|
||||
}
|
||||
|
||||
/// Check if this mplace is dereferencable and sufficiently aligned.
|
||||
/// Check if this mplace is dereferenceable and sufficiently aligned.
|
||||
fn check_mplace_access(
|
||||
&self,
|
||||
mplace: MPlaceTy<'tcx, M::PointerTag>,
|
||||
|
|
|
@ -1556,7 +1556,7 @@ fn test_clone_from() {
|
|||
}
|
||||
|
||||
#[allow(dead_code)]
|
||||
fn test_variance() {
|
||||
fn assert_covariance() {
|
||||
fn map_key<'new>(v: BTreeMap<&'static str, ()>) -> BTreeMap<&'new str, ()> {
|
||||
v
|
||||
}
|
||||
|
@ -1615,7 +1615,7 @@ fn test_variance() {
|
|||
}
|
||||
|
||||
#[allow(dead_code)]
|
||||
fn test_sync() {
|
||||
fn assert_sync() {
|
||||
fn map<T: Sync>(v: &BTreeMap<T, T>) -> impl Sync + '_ {
|
||||
v
|
||||
}
|
||||
|
@ -1684,7 +1684,7 @@ fn test_sync() {
|
|||
}
|
||||
|
||||
#[allow(dead_code)]
|
||||
fn test_send() {
|
||||
fn assert_send() {
|
||||
fn map<T: Send>(v: BTreeMap<T, T>) -> impl Send {
|
||||
v
|
||||
}
|
||||
|
|
|
@ -3,6 +3,7 @@ use super::super::testing::rng::DeterministicRng;
|
|||
use super::*;
|
||||
use crate::vec::Vec;
|
||||
use std::cmp::Ordering;
|
||||
use std::hash::{Hash, Hasher};
|
||||
use std::iter::FromIterator;
|
||||
use std::panic::{catch_unwind, AssertUnwindSafe};
|
||||
|
||||
|
@ -513,7 +514,7 @@ fn test_recovery() {
|
|||
}
|
||||
|
||||
#[allow(dead_code)]
|
||||
fn test_variance() {
|
||||
fn assert_covariance() {
|
||||
fn set<'new>(v: BTreeSet<&'static str>) -> BTreeSet<&'new str> {
|
||||
v
|
||||
}
|
||||
|
@ -530,7 +531,7 @@ fn test_variance() {
|
|||
}
|
||||
|
||||
#[allow(dead_code)]
|
||||
fn test_sync() {
|
||||
fn assert_sync() {
|
||||
fn set<T: Sync>(v: &BTreeSet<T>) -> impl Sync + '_ {
|
||||
v
|
||||
}
|
||||
|
@ -569,7 +570,7 @@ fn test_sync() {
|
|||
}
|
||||
|
||||
#[allow(dead_code)]
|
||||
fn test_send() {
|
||||
fn assert_send() {
|
||||
fn set<T: Send>(v: BTreeSet<T>) -> impl Send {
|
||||
v
|
||||
}
|
||||
|
@ -607,6 +608,37 @@ fn test_send() {
|
|||
}
|
||||
}
|
||||
|
||||
#[allow(dead_code)]
|
||||
// Check that the member-like functions conditionally provided by #[derive()]
|
||||
// are not overriden by genuine member functions with a different signature.
|
||||
fn assert_derives() {
|
||||
fn hash<T: Hash, H: Hasher>(v: BTreeSet<T>, state: &mut H) {
|
||||
v.hash(state);
|
||||
// Tested much more thoroughly outside the crate in btree_set_hash.rs
|
||||
}
|
||||
fn eq<T: PartialEq>(v: BTreeSet<T>) {
|
||||
let _ = v.eq(&v);
|
||||
}
|
||||
fn ne<T: PartialEq>(v: BTreeSet<T>) {
|
||||
let _ = v.ne(&v);
|
||||
}
|
||||
fn cmp<T: Ord>(v: BTreeSet<T>) {
|
||||
let _ = v.cmp(&v);
|
||||
}
|
||||
fn min<T: Ord>(v: BTreeSet<T>, w: BTreeSet<T>) {
|
||||
let _ = v.min(w);
|
||||
}
|
||||
fn max<T: Ord>(v: BTreeSet<T>, w: BTreeSet<T>) {
|
||||
let _ = v.max(w);
|
||||
}
|
||||
fn clamp<T: Ord>(v: BTreeSet<T>, w: BTreeSet<T>, x: BTreeSet<T>) {
|
||||
let _ = v.clamp(w, x);
|
||||
}
|
||||
fn partial_cmp<T: PartialOrd>(v: &BTreeSet<T>) {
|
||||
let _ = v.partial_cmp(&v);
|
||||
}
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn test_ord_absence() {
|
||||
fn set<K>(mut set: BTreeSet<K>) {
|
||||
|
|
|
@ -12,7 +12,7 @@ use super::{count, wrap_index, RingSlices};
|
|||
/// [`iter_mut`]: super::VecDeque::iter_mut
|
||||
#[stable(feature = "rust1", since = "1.0.0")]
|
||||
pub struct IterMut<'a, T: 'a> {
|
||||
// Internal safety invariant: the entire slice is dereferencable.
|
||||
// Internal safety invariant: the entire slice is dereferenceable.
|
||||
ring: *mut [T],
|
||||
tail: usize,
|
||||
head: usize,
|
||||
|
@ -42,7 +42,7 @@ impl<T: fmt::Debug> fmt::Debug for IterMut<'_, T> {
|
|||
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
|
||||
let (front, back) = RingSlices::ring_slices(self.ring, self.head, self.tail);
|
||||
// SAFETY: these are the elements we have not handed out yet, so aliasing is fine.
|
||||
// The `IterMut` invariant also ensures everything is dereferencable.
|
||||
// The `IterMut` invariant also ensures everything is dereferenceable.
|
||||
let (front, back) = unsafe { (&*front, &*back) };
|
||||
f.debug_tuple("IterMut").field(&front).field(&back).finish()
|
||||
}
|
||||
|
@ -78,7 +78,7 @@ impl<'a, T> Iterator for IterMut<'a, T> {
|
|||
{
|
||||
let (front, back) = RingSlices::ring_slices(self.ring, self.head, self.tail);
|
||||
// SAFETY: these are the elements we have not handed out yet, so aliasing is fine.
|
||||
// The `IterMut` invariant also ensures everything is dereferencable.
|
||||
// The `IterMut` invariant also ensures everything is dereferenceable.
|
||||
let (front, back) = unsafe { (&mut *front, &mut *back) };
|
||||
accum = front.iter_mut().fold(accum, &mut f);
|
||||
back.iter_mut().fold(accum, &mut f)
|
||||
|
@ -132,7 +132,7 @@ impl<'a, T> DoubleEndedIterator for IterMut<'a, T> {
|
|||
{
|
||||
let (front, back) = RingSlices::ring_slices(self.ring, self.head, self.tail);
|
||||
// SAFETY: these are the elements we have not handed out yet, so aliasing is fine.
|
||||
// The `IterMut` invariant also ensures everything is dereferencable.
|
||||
// The `IterMut` invariant also ensures everything is dereferenceable.
|
||||
let (front, back) = unsafe { (&mut *front, &mut *back) };
|
||||
accum = back.iter_mut().rfold(accum, &mut f);
|
||||
front.iter_mut().rfold(accum, &mut f)
|
||||
|
|
|
@ -1020,7 +1020,7 @@ impl<T, A: Allocator> VecDeque<T, A> {
|
|||
#[stable(feature = "rust1", since = "1.0.0")]
|
||||
pub fn iter_mut(&mut self) -> IterMut<'_, T> {
|
||||
// SAFETY: The internal `IterMut` safety invariant is established because the
|
||||
// `ring` we create is a dereferencable slice for lifetime '_.
|
||||
// `ring` we create is a dereferenceable slice for lifetime '_.
|
||||
let ring = ptr::slice_from_raw_parts_mut(self.ptr(), self.cap());
|
||||
|
||||
unsafe { IterMut::new(ring, self.tail, self.head, PhantomData) }
|
||||
|
@ -1209,7 +1209,7 @@ impl<T, A: Allocator> VecDeque<T, A> {
|
|||
let (tail, head) = self.range_tail_head(range);
|
||||
|
||||
// SAFETY: The internal `IterMut` safety invariant is established because the
|
||||
// `ring` we create is a dereferencable slice for lifetime '_.
|
||||
// `ring` we create is a dereferenceable slice for lifetime '_.
|
||||
let ring = ptr::slice_from_raw_parts_mut(self.ptr(), self.cap());
|
||||
|
||||
unsafe { IterMut::new(ring, tail, head, PhantomData) }
|
||||
|
|
|
@ -2121,7 +2121,7 @@ impl<T: ?Sized> Weak<T> {
|
|||
// a valid payload address, as the payload is at least as aligned as RcBox (usize).
|
||||
ptr as *const T
|
||||
} else {
|
||||
// SAFETY: if is_dangling returns false, then the pointer is dereferencable.
|
||||
// SAFETY: if is_dangling returns false, then the pointer is dereferenceable.
|
||||
// The payload may be dropped at this point, and we have to maintain provenance,
|
||||
// so use raw pointer manipulation.
|
||||
unsafe { ptr::addr_of_mut!((*ptr).value) }
|
||||
|
|
|
@ -1743,7 +1743,7 @@ impl<T: ?Sized> Weak<T> {
|
|||
// a valid payload address, as the payload is at least as aligned as ArcInner (usize).
|
||||
ptr as *const T
|
||||
} else {
|
||||
// SAFETY: if is_dangling returns false, then the pointer is dereferencable.
|
||||
// SAFETY: if is_dangling returns false, then the pointer is dereferenceable.
|
||||
// The payload may be dropped at this point, and we have to maintain provenance,
|
||||
// so use raw pointer manipulation.
|
||||
unsafe { ptr::addr_of_mut!((*ptr).data) }
|
||||
|
|
|
@ -119,7 +119,7 @@ impl<T: ?Sized> *const T {
|
|||
///
|
||||
/// * The pointer must be properly aligned.
|
||||
///
|
||||
/// * It must be "dereferencable" in the sense defined in [the module documentation].
|
||||
/// * It must be "dereferenceable" in the sense defined in [the module documentation].
|
||||
///
|
||||
/// * The pointer must point to an initialized instance of `T`.
|
||||
///
|
||||
|
@ -183,7 +183,7 @@ impl<T: ?Sized> *const T {
|
|||
///
|
||||
/// * The pointer must be properly aligned.
|
||||
///
|
||||
/// * It must be "dereferencable" in the sense defined in [the module documentation].
|
||||
/// * It must be "dereferenceable" in the sense defined in [the module documentation].
|
||||
///
|
||||
/// * You must enforce Rust's aliasing rules, since the returned lifetime `'a` is
|
||||
/// arbitrarily chosen and does not necessarily reflect the actual lifetime of the data.
|
||||
|
@ -1003,7 +1003,7 @@ impl<T> *const [T] {
|
|||
/// Returns a raw pointer to an element or subslice, without doing bounds
|
||||
/// checking.
|
||||
///
|
||||
/// Calling this method with an out-of-bounds index or when `self` is not dereferencable
|
||||
/// Calling this method with an out-of-bounds index or when `self` is not dereferenceable
|
||||
/// is *[undefined behavior]* even if the resulting pointer is not used.
|
||||
///
|
||||
/// [undefined behavior]: https://doc.rust-lang.org/reference/behavior-considered-undefined.html
|
||||
|
@ -1025,7 +1025,7 @@ impl<T> *const [T] {
|
|||
where
|
||||
I: SliceIndex<[T]>,
|
||||
{
|
||||
// SAFETY: the caller ensures that `self` is dereferencable and `index` in-bounds.
|
||||
// SAFETY: the caller ensures that `self` is dereferenceable and `index` in-bounds.
|
||||
unsafe { index.get_unchecked(self) }
|
||||
}
|
||||
|
||||
|
|
|
@ -122,7 +122,7 @@ impl<T: ?Sized> *mut T {
|
|||
///
|
||||
/// * The pointer must be properly aligned.
|
||||
///
|
||||
/// * It must be "dereferencable" in the sense defined in [the module documentation].
|
||||
/// * It must be "dereferenceable" in the sense defined in [the module documentation].
|
||||
///
|
||||
/// * The pointer must point to an initialized instance of `T`.
|
||||
///
|
||||
|
@ -189,7 +189,7 @@ impl<T: ?Sized> *mut T {
|
|||
///
|
||||
/// * The pointer must be properly aligned.
|
||||
///
|
||||
/// * It must be "dereferencable" in the sense defined in [the module documentation].
|
||||
/// * It must be "dereferenceable" in the sense defined in [the module documentation].
|
||||
///
|
||||
/// * You must enforce Rust's aliasing rules, since the returned lifetime `'a` is
|
||||
/// arbitrarily chosen and does not necessarily reflect the actual lifetime of the data.
|
||||
|
@ -368,7 +368,7 @@ impl<T: ?Sized> *mut T {
|
|||
///
|
||||
/// * The pointer must be properly aligned.
|
||||
///
|
||||
/// * It must be "dereferencable" in the sense defined in [the module documentation].
|
||||
/// * It must be "dereferenceable" in the sense defined in [the module documentation].
|
||||
///
|
||||
/// * The pointer must point to an initialized instance of `T`.
|
||||
///
|
||||
|
@ -434,7 +434,7 @@ impl<T: ?Sized> *mut T {
|
|||
///
|
||||
/// * The pointer must be properly aligned.
|
||||
///
|
||||
/// * It must be "dereferencable" in the sense defined in [the module documentation].
|
||||
/// * It must be "dereferenceable" in the sense defined in [the module documentation].
|
||||
///
|
||||
/// * You must enforce Rust's aliasing rules, since the returned lifetime `'a` is
|
||||
/// arbitrarily chosen and does not necessarily reflect the actual lifetime of the data.
|
||||
|
@ -1266,7 +1266,7 @@ impl<T> *mut [T] {
|
|||
/// Returns a raw pointer to an element or subslice, without doing bounds
|
||||
/// checking.
|
||||
///
|
||||
/// Calling this method with an out-of-bounds index or when `self` is not dereferencable
|
||||
/// Calling this method with an out-of-bounds index or when `self` is not dereferenceable
|
||||
/// is *[undefined behavior]* even if the resulting pointer is not used.
|
||||
///
|
||||
/// [undefined behavior]: https://doc.rust-lang.org/reference/behavior-considered-undefined.html
|
||||
|
@ -1288,7 +1288,7 @@ impl<T> *mut [T] {
|
|||
where
|
||||
I: SliceIndex<[T]>,
|
||||
{
|
||||
// SAFETY: the caller ensures that `self` is dereferencable and `index` in-bounds.
|
||||
// SAFETY: the caller ensures that `self` is dereferenceable and `index` in-bounds.
|
||||
unsafe { index.get_unchecked_mut(self) }
|
||||
}
|
||||
|
||||
|
|
|
@ -109,7 +109,7 @@ impl<T: Sized> NonNull<T> {
|
|||
///
|
||||
/// * The pointer must be properly aligned.
|
||||
///
|
||||
/// * It must be "dereferencable" in the sense defined in [the module documentation].
|
||||
/// * It must be "dereferenceable" in the sense defined in [the module documentation].
|
||||
///
|
||||
/// * You must enforce Rust's aliasing rules, since the returned lifetime `'a` is
|
||||
/// arbitrarily chosen and does not necessarily reflect the actual lifetime of the data.
|
||||
|
@ -142,7 +142,7 @@ impl<T: Sized> NonNull<T> {
|
|||
///
|
||||
/// * The pointer must be properly aligned.
|
||||
///
|
||||
/// * It must be "dereferencable" in the sense defined in [the module documentation].
|
||||
/// * It must be "dereferenceable" in the sense defined in [the module documentation].
|
||||
///
|
||||
/// * You must enforce Rust's aliasing rules, since the returned lifetime `'a` is
|
||||
/// arbitrarily chosen and does not necessarily reflect the actual lifetime of the data.
|
||||
|
@ -289,7 +289,7 @@ impl<T: ?Sized> NonNull<T> {
|
|||
///
|
||||
/// * The pointer must be properly aligned.
|
||||
///
|
||||
/// * It must be "dereferencable" in the sense defined in [the module documentation].
|
||||
/// * It must be "dereferenceable" in the sense defined in [the module documentation].
|
||||
///
|
||||
/// * The pointer must point to an initialized instance of `T`.
|
||||
///
|
||||
|
@ -338,7 +338,7 @@ impl<T: ?Sized> NonNull<T> {
|
|||
///
|
||||
/// * The pointer must be properly aligned.
|
||||
///
|
||||
/// * It must be "dereferencable" in the sense defined in [the module documentation].
|
||||
/// * It must be "dereferenceable" in the sense defined in [the module documentation].
|
||||
///
|
||||
/// * The pointer must point to an initialized instance of `T`.
|
||||
///
|
||||
|
@ -604,7 +604,7 @@ impl<T> NonNull<[T]> {
|
|||
/// Returns a raw pointer to an element or subslice, without doing bounds
|
||||
/// checking.
|
||||
///
|
||||
/// Calling this method with an out-of-bounds index or when `self` is not dereferencable
|
||||
/// Calling this method with an out-of-bounds index or when `self` is not dereferenceable
|
||||
/// is *[undefined behavior]* even if the resulting pointer is not used.
|
||||
///
|
||||
/// [undefined behavior]: https://doc.rust-lang.org/reference/behavior-considered-undefined.html
|
||||
|
@ -628,7 +628,7 @@ impl<T> NonNull<[T]> {
|
|||
where
|
||||
I: SliceIndex<[T]>,
|
||||
{
|
||||
// SAFETY: the caller ensures that `self` is dereferencable and `index` in-bounds.
|
||||
// SAFETY: the caller ensures that `self` is dereferenceable and `index` in-bounds.
|
||||
// As a consequence, the resulting pointer cannot be null.
|
||||
unsafe { NonNull::new_unchecked(self.as_ptr().get_unchecked_mut(index)) }
|
||||
}
|
||||
|
|
|
@ -380,7 +380,7 @@ impl<T> [T] {
|
|||
I: SliceIndex<Self>,
|
||||
{
|
||||
// SAFETY: the caller must uphold most of the safety requirements for `get_unchecked`;
|
||||
// the slice is dereferencable because `self` is a safe reference.
|
||||
// the slice is dereferenceable because `self` is a safe reference.
|
||||
// The returned pointer is safe because impls of `SliceIndex` have to guarantee that it is.
|
||||
unsafe { &*index.get_unchecked(self) }
|
||||
}
|
||||
|
@ -416,7 +416,7 @@ impl<T> [T] {
|
|||
I: SliceIndex<Self>,
|
||||
{
|
||||
// SAFETY: the caller must uphold the safety requirements for `get_unchecked_mut`;
|
||||
// the slice is dereferencable because `self` is a safe reference.
|
||||
// the slice is dereferenceable because `self` is a safe reference.
|
||||
// The returned pointer is safe because impls of `SliceIndex` have to guarantee that it is.
|
||||
unsafe { &mut *index.get_unchecked_mut(self) }
|
||||
}
|
||||
|
|
|
@ -416,7 +416,7 @@ impl str {
|
|||
#[inline]
|
||||
pub unsafe fn get_unchecked<I: SliceIndex<str>>(&self, i: I) -> &I::Output {
|
||||
// SAFETY: the caller must uphold the safety contract for `get_unchecked`;
|
||||
// the slice is dereferencable because `self` is a safe reference.
|
||||
// the slice is dereferenceable because `self` is a safe reference.
|
||||
// The returned pointer is safe because impls of `SliceIndex` have to guarantee that it is.
|
||||
unsafe { &*i.get_unchecked(self) }
|
||||
}
|
||||
|
@ -451,7 +451,7 @@ impl str {
|
|||
#[inline]
|
||||
pub unsafe fn get_unchecked_mut<I: SliceIndex<str>>(&mut self, i: I) -> &mut I::Output {
|
||||
// SAFETY: the caller must uphold the safety contract for `get_unchecked_mut`;
|
||||
// the slice is dereferencable because `self` is a safe reference.
|
||||
// the slice is dereferenceable because `self` is a safe reference.
|
||||
// The returned pointer is safe because impls of `SliceIndex` have to guarantee that it is.
|
||||
unsafe { &mut *i.get_unchecked_mut(self) }
|
||||
}
|
||||
|
@ -504,7 +504,7 @@ impl str {
|
|||
#[inline]
|
||||
pub unsafe fn slice_unchecked(&self, begin: usize, end: usize) -> &str {
|
||||
// SAFETY: the caller must uphold the safety contract for `get_unchecked`;
|
||||
// the slice is dereferencable because `self` is a safe reference.
|
||||
// the slice is dereferenceable because `self` is a safe reference.
|
||||
// The returned pointer is safe because impls of `SliceIndex` have to guarantee that it is.
|
||||
unsafe { &*(begin..end).get_unchecked(self) }
|
||||
}
|
||||
|
@ -537,7 +537,7 @@ impl str {
|
|||
#[inline]
|
||||
pub unsafe fn slice_mut_unchecked(&mut self, begin: usize, end: usize) -> &mut str {
|
||||
// SAFETY: the caller must uphold the safety contract for `get_unchecked_mut`;
|
||||
// the slice is dereferencable because `self` is a safe reference.
|
||||
// the slice is dereferenceable because `self` is a safe reference.
|
||||
// The returned pointer is safe because impls of `SliceIndex` have to guarantee that it is.
|
||||
unsafe { &mut *(begin..end).get_unchecked_mut(self) }
|
||||
}
|
||||
|
|
|
@ -1564,7 +1564,9 @@ impl Step for Extended {
|
|||
builder.install(&etc.join("gfx/rust-logo.ico"), &exe, 0o644);
|
||||
|
||||
// Generate msi installer
|
||||
let wix = PathBuf::from(env::var_os("WIX").unwrap());
|
||||
let wix_path = env::var_os("WIX")
|
||||
.expect("`WIX` environment variable must be set for generating MSI installer(s).");
|
||||
let wix = PathBuf::from(wix_path);
|
||||
let heat = wix.join("bin/heat.exe");
|
||||
let candle = wix.join("bin/candle.exe");
|
||||
let light = wix.join("bin/light.exe");
|
||||
|
|
|
@ -0,0 +1,23 @@
|
|||
//! Test case for [#80737].
|
||||
//!
|
||||
//! A SomeTrait that is implemented for `&mut T where T: SomeTrait`
|
||||
//! should not be marked as "notable" for return values that do not
|
||||
//! have bounds on the trait itself.
|
||||
//!
|
||||
//! [#80737]: https://github.com/rust-lang/rust/issues/80737
|
||||
|
||||
#![feature(rustdoc_internals)]
|
||||
#![no_std]
|
||||
|
||||
#[doc(primitive = "reference")]
|
||||
/// Some useless docs, wouhou!
|
||||
///
|
||||
/// We need to put this in here, because notable traits
|
||||
/// that are implemented on foreign types don't show up.
|
||||
mod reference {}
|
||||
|
||||
// @has doc_notable_trait_mut_t_is_not_an_iterator/fn.fn_no_matches.html
|
||||
// @!has - '//code[@class="content"]' 'Iterator'
|
||||
pub fn fn_no_matches<'a, T: 'a>() -> &'a mut T {
|
||||
panic!()
|
||||
}
|
|
@ -91,6 +91,29 @@ exclude_labels = [
|
|||
"requires-nightly",
|
||||
]
|
||||
|
||||
[autolabel."T-rustdoc"]
|
||||
trigger_files = [
|
||||
# Source code
|
||||
"src/librustdoc",
|
||||
"src/tools/rustdoc",
|
||||
"src/rustdoc-json-types",
|
||||
|
||||
# Tests
|
||||
"src/test/rustdoc",
|
||||
"src/test/rustdoc-ui",
|
||||
"src/test/rustdoc-gui",
|
||||
"src/test/rustdoc-js",
|
||||
"src/test/rustdoc-js-std",
|
||||
"src/test/rustdoc-json",
|
||||
|
||||
# Internal tooling
|
||||
"src/etc/htmldocck.py",
|
||||
"src/tools/jsondocck",
|
||||
"src/tools/rustdoc-gui",
|
||||
"src/tools/rustdoc-js",
|
||||
"src/tools/rustdoc-themes",
|
||||
]
|
||||
|
||||
[notify-zulip."I-prioritize"]
|
||||
zulip_stream = 245100 # #t-compiler/wg-prioritization/alerts
|
||||
topic = "#{number} {title}"
|
||||
|
|
Loading…
Reference in a new issue