Rollup merge of #119853 - klensy:rustfmt-ignore, r=cuviper
rustfmt.toml: don't ignore just any tests path, only root one Previously ignored any `tests` path, now only /tests at repo root. For reference, https://git-scm.com/docs/gitignore#_pattern_format
This commit is contained in:
commit
b3d15ebb08
22 changed files with 126 additions and 95 deletions
|
@ -5,7 +5,8 @@ use termcolor::{BufferWriter, ColorChoice};
|
||||||
use super::*;
|
use super::*;
|
||||||
|
|
||||||
const INPUT: &str = include_str!("input.md");
|
const INPUT: &str = include_str!("input.md");
|
||||||
const OUTPUT_PATH: &[&str] = &[env!("CARGO_MANIFEST_DIR"), "src","markdown","tests","output.stdout"];
|
const OUTPUT_PATH: &[&str] =
|
||||||
|
&[env!("CARGO_MANIFEST_DIR"), "src", "markdown", "tests", "output.stdout"];
|
||||||
|
|
||||||
const TEST_WIDTH: usize = 80;
|
const TEST_WIDTH: usize = 80;
|
||||||
|
|
||||||
|
|
|
@ -55,12 +55,7 @@ fn test_btree_map() {
|
||||||
|
|
||||||
require_send_sync(async {
|
require_send_sync(async {
|
||||||
let _v = None::<
|
let _v = None::<
|
||||||
alloc::collections::btree_map::ExtractIf<
|
alloc::collections::btree_map::ExtractIf<'_, &u32, &u32, fn(&&u32, &mut &u32) -> bool>,
|
||||||
'_,
|
|
||||||
&u32,
|
|
||||||
&u32,
|
|
||||||
fn(&&u32, &mut &u32) -> bool,
|
|
||||||
>,
|
|
||||||
>;
|
>;
|
||||||
async {}.await;
|
async {}.await;
|
||||||
});
|
});
|
||||||
|
|
|
@ -1,7 +1,7 @@
|
||||||
use core::alloc::{Allocator, Layout};
|
use core::alloc::{Allocator, Layout};
|
||||||
use core::{assert_eq, assert_ne};
|
|
||||||
use core::num::NonZeroUsize;
|
use core::num::NonZeroUsize;
|
||||||
use core::ptr::NonNull;
|
use core::ptr::NonNull;
|
||||||
|
use core::{assert_eq, assert_ne};
|
||||||
use std::alloc::System;
|
use std::alloc::System;
|
||||||
use std::assert_matches::assert_matches;
|
use std::assert_matches::assert_matches;
|
||||||
use std::borrow::Cow;
|
use std::borrow::Cow;
|
||||||
|
@ -1221,11 +1221,7 @@ fn test_in_place_specialization_step_up_down() {
|
||||||
|
|
||||||
let src = vec![[0u8; 4]; 256];
|
let src = vec![[0u8; 4]; 256];
|
||||||
let srcptr = src.as_ptr();
|
let srcptr = src.as_ptr();
|
||||||
let iter = src
|
let iter = src.into_iter().flat_map(|a| a.into_iter().map(|b| b.wrapping_add(1)));
|
||||||
.into_iter()
|
|
||||||
.flat_map(|a| {
|
|
||||||
a.into_iter().map(|b| b.wrapping_add(1))
|
|
||||||
});
|
|
||||||
assert_in_place_trait(&iter);
|
assert_in_place_trait(&iter);
|
||||||
let sink = iter.collect::<Vec<_>>();
|
let sink = iter.collect::<Vec<_>>();
|
||||||
assert_eq!(srcptr as *const u8, sink.as_ptr());
|
assert_eq!(srcptr as *const u8, sink.as_ptr());
|
||||||
|
|
|
@ -1,6 +1,6 @@
|
||||||
use core::{array, assert_eq};
|
|
||||||
use core::num::NonZeroUsize;
|
use core::num::NonZeroUsize;
|
||||||
use core::sync::atomic::{AtomicUsize, Ordering};
|
use core::sync::atomic::{AtomicUsize, Ordering};
|
||||||
|
use core::{array, assert_eq};
|
||||||
|
|
||||||
#[test]
|
#[test]
|
||||||
fn array_from_ref() {
|
fn array_from_ref() {
|
||||||
|
|
|
@ -1,4 +1,4 @@
|
||||||
use core::error::{request_value, request_ref, Request};
|
use core::error::{request_ref, request_value, Request};
|
||||||
|
|
||||||
// Test the `Request` API.
|
// Test the `Request` API.
|
||||||
#[derive(Debug)]
|
#[derive(Debug)]
|
||||||
|
|
|
@ -35,7 +35,8 @@ impl Hasher for MyHasher {
|
||||||
#[test]
|
#[test]
|
||||||
fn test_writer_hasher() {
|
fn test_writer_hasher() {
|
||||||
// FIXME(#110395)
|
// FIXME(#110395)
|
||||||
/* const */ fn hash<T: Hash>(t: &T) -> u64 {
|
/* const */
|
||||||
|
fn hash<T: Hash>(t: &T) -> u64 {
|
||||||
let mut s = MyHasher { hash: 0 };
|
let mut s = MyHasher { hash: 0 };
|
||||||
t.hash(&mut s);
|
t.hash(&mut s);
|
||||||
s.finish()
|
s.finish()
|
||||||
|
@ -140,7 +141,8 @@ impl Hash for Custom {
|
||||||
#[test]
|
#[test]
|
||||||
fn test_custom_state() {
|
fn test_custom_state() {
|
||||||
// FIXME(#110395)
|
// FIXME(#110395)
|
||||||
/* const */ fn hash<T: Hash>(t: &T) -> u64 {
|
/* const */
|
||||||
|
fn hash<T: Hash>(t: &T) -> u64 {
|
||||||
let mut c = CustomHasher { output: 0 };
|
let mut c = CustomHasher { output: 0 };
|
||||||
t.hash(&mut c);
|
t.hash(&mut c);
|
||||||
c.finish()
|
c.finish()
|
||||||
|
|
|
@ -42,7 +42,10 @@ fn test_iterator_chain_advance_by() {
|
||||||
let mut iter = Unfuse::new(xs).chain(Unfuse::new(ys));
|
let mut iter = Unfuse::new(xs).chain(Unfuse::new(ys));
|
||||||
assert_eq!(iter.advance_by(xs.len() + i), Ok(()));
|
assert_eq!(iter.advance_by(xs.len() + i), Ok(()));
|
||||||
assert_eq!(iter.next(), Some(&ys[i]));
|
assert_eq!(iter.next(), Some(&ys[i]));
|
||||||
assert_eq!(iter.advance_by(100), Err(NonZeroUsize::new(100 - (ys.len() - i - 1)).unwrap()));
|
assert_eq!(
|
||||||
|
iter.advance_by(100),
|
||||||
|
Err(NonZeroUsize::new(100 - (ys.len() - i - 1)).unwrap())
|
||||||
|
);
|
||||||
assert_eq!(iter.advance_by(0), Ok(()));
|
assert_eq!(iter.advance_by(0), Ok(()));
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -71,7 +74,10 @@ fn test_iterator_chain_advance_back_by() {
|
||||||
let mut iter = Unfuse::new(xs).chain(Unfuse::new(ys));
|
let mut iter = Unfuse::new(xs).chain(Unfuse::new(ys));
|
||||||
assert_eq!(iter.advance_back_by(i), Ok(()));
|
assert_eq!(iter.advance_back_by(i), Ok(()));
|
||||||
assert_eq!(iter.next_back(), Some(&ys[ys.len() - i - 1]));
|
assert_eq!(iter.next_back(), Some(&ys[ys.len() - i - 1]));
|
||||||
assert_eq!(iter.advance_back_by(100), Err(NonZeroUsize::new(100 - (len - i - 1)).unwrap()));
|
assert_eq!(
|
||||||
|
iter.advance_back_by(100),
|
||||||
|
Err(NonZeroUsize::new(100 - (len - i - 1)).unwrap())
|
||||||
|
);
|
||||||
assert_eq!(iter.advance_back_by(0), Ok(()));
|
assert_eq!(iter.advance_back_by(0), Ok(()));
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -79,7 +85,10 @@ fn test_iterator_chain_advance_back_by() {
|
||||||
let mut iter = Unfuse::new(xs).chain(Unfuse::new(ys));
|
let mut iter = Unfuse::new(xs).chain(Unfuse::new(ys));
|
||||||
assert_eq!(iter.advance_back_by(ys.len() + i), Ok(()));
|
assert_eq!(iter.advance_back_by(ys.len() + i), Ok(()));
|
||||||
assert_eq!(iter.next_back(), Some(&xs[xs.len() - i - 1]));
|
assert_eq!(iter.next_back(), Some(&xs[xs.len() - i - 1]));
|
||||||
assert_eq!(iter.advance_back_by(100), Err(NonZeroUsize::new(100 - (xs.len() - i - 1)).unwrap()));
|
assert_eq!(
|
||||||
|
iter.advance_back_by(100),
|
||||||
|
Err(NonZeroUsize::new(100 - (xs.len() - i - 1)).unwrap())
|
||||||
|
);
|
||||||
assert_eq!(iter.advance_back_by(0), Ok(()));
|
assert_eq!(iter.advance_back_by(0), Ok(()));
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
|
@ -1,5 +1,5 @@
|
||||||
use core::assert_eq;
|
|
||||||
use super::*;
|
use super::*;
|
||||||
|
use core::assert_eq;
|
||||||
use core::iter::*;
|
use core::iter::*;
|
||||||
use core::num::NonZeroUsize;
|
use core::num::NonZeroUsize;
|
||||||
|
|
||||||
|
|
|
@ -245,7 +245,6 @@ fn test_step_by_skip() {
|
||||||
assert_eq!((200..=255u8).step_by(10).nth(3), Some(230));
|
assert_eq!((200..=255u8).step_by(10).nth(3), Some(230));
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
struct DeOpt<I: Iterator>(I);
|
struct DeOpt<I: Iterator>(I);
|
||||||
|
|
||||||
impl<I: Iterator> Iterator for DeOpt<I> {
|
impl<I: Iterator> Iterator for DeOpt<I> {
|
||||||
|
@ -265,8 +264,7 @@ impl<I: DoubleEndedIterator> DoubleEndedIterator for DeOpt<I> {
|
||||||
#[test]
|
#[test]
|
||||||
fn test_step_by_fold_range_specialization() {
|
fn test_step_by_fold_range_specialization() {
|
||||||
macro_rules! t {
|
macro_rules! t {
|
||||||
($range:expr, $var: ident, $body:tt) => {
|
($range:expr, $var: ident, $body:tt) => {{
|
||||||
{
|
|
||||||
// run the same tests for the non-optimized version
|
// run the same tests for the non-optimized version
|
||||||
let mut $var = DeOpt($range);
|
let mut $var = DeOpt($range);
|
||||||
$body
|
$body
|
||||||
|
@ -274,8 +272,7 @@ fn test_step_by_fold_range_specialization() {
|
||||||
{
|
{
|
||||||
let mut $var = $range;
|
let mut $var = $range;
|
||||||
$body
|
$body
|
||||||
}
|
}};
|
||||||
}
|
|
||||||
}
|
}
|
||||||
|
|
||||||
t!((1usize..5).step_by(1), r, {
|
t!((1usize..5).step_by(1), r, {
|
||||||
|
@ -288,7 +285,6 @@ fn test_step_by_fold_range_specialization() {
|
||||||
assert_eq!(r.sum::<usize>(), 2);
|
assert_eq!(r.sum::<usize>(), 2);
|
||||||
});
|
});
|
||||||
|
|
||||||
|
|
||||||
t!((0usize..5).step_by(2), r, {
|
t!((0usize..5).step_by(2), r, {
|
||||||
assert_eq!(r.next(), Some(0));
|
assert_eq!(r.next(), Some(0));
|
||||||
assert_eq!(r.sum::<usize>(), 6);
|
assert_eq!(r.sum::<usize>(), 6);
|
||||||
|
|
|
@ -93,7 +93,10 @@ fn test_take_advance_by() {
|
||||||
assert_eq!((0..2).take(1).advance_back_by(10), Err(NonZeroUsize::new(9).unwrap()));
|
assert_eq!((0..2).take(1).advance_back_by(10), Err(NonZeroUsize::new(9).unwrap()));
|
||||||
assert_eq!((0..0).take(1).advance_back_by(1), Err(NonZeroUsize::new(1).unwrap()));
|
assert_eq!((0..0).take(1).advance_back_by(1), Err(NonZeroUsize::new(1).unwrap()));
|
||||||
assert_eq!((0..0).take(1).advance_back_by(0), Ok(()));
|
assert_eq!((0..0).take(1).advance_back_by(0), Ok(()));
|
||||||
assert_eq!((0..usize::MAX).take(100).advance_back_by(usize::MAX), Err(NonZeroUsize::new(usize::MAX - 100).unwrap()));
|
assert_eq!(
|
||||||
|
(0..usize::MAX).take(100).advance_back_by(usize::MAX),
|
||||||
|
Err(NonZeroUsize::new(usize::MAX - 100).unwrap())
|
||||||
|
);
|
||||||
}
|
}
|
||||||
|
|
||||||
#[test]
|
#[test]
|
||||||
|
|
|
@ -168,7 +168,10 @@ fn test_iterator_advance_back_by() {
|
||||||
let mut iter = v.iter();
|
let mut iter = v.iter();
|
||||||
assert_eq!(iter.advance_back_by(i), Ok(()));
|
assert_eq!(iter.advance_back_by(i), Ok(()));
|
||||||
assert_eq!(iter.next_back().unwrap(), &v[v.len() - 1 - i]);
|
assert_eq!(iter.next_back().unwrap(), &v[v.len() - 1 - i]);
|
||||||
assert_eq!(iter.advance_back_by(100), Err(NonZeroUsize::new(100 - (v.len() - 1 - i)).unwrap()));
|
assert_eq!(
|
||||||
|
iter.advance_back_by(100),
|
||||||
|
Err(NonZeroUsize::new(100 - (v.len() - 1 - i)).unwrap())
|
||||||
|
);
|
||||||
}
|
}
|
||||||
|
|
||||||
assert_eq!(v.iter().advance_back_by(v.len()), Ok(()));
|
assert_eq!(v.iter().advance_back_by(v.len()), Ok(()));
|
||||||
|
@ -183,7 +186,10 @@ fn test_iterator_rev_advance_back_by() {
|
||||||
let mut iter = v.iter().rev();
|
let mut iter = v.iter().rev();
|
||||||
assert_eq!(iter.advance_back_by(i), Ok(()));
|
assert_eq!(iter.advance_back_by(i), Ok(()));
|
||||||
assert_eq!(iter.next_back().unwrap(), &v[i]);
|
assert_eq!(iter.next_back().unwrap(), &v[i]);
|
||||||
assert_eq!(iter.advance_back_by(100), Err(NonZeroUsize::new(100 - (v.len() - 1 - i)).unwrap()));
|
assert_eq!(
|
||||||
|
iter.advance_back_by(100),
|
||||||
|
Err(NonZeroUsize::new(100 - (v.len() - 1 - i)).unwrap())
|
||||||
|
);
|
||||||
}
|
}
|
||||||
|
|
||||||
assert_eq!(v.iter().rev().advance_back_by(v.len()), Ok(()));
|
assert_eq!(v.iter().rev().advance_back_by(v.len()), Ok(()));
|
||||||
|
|
|
@ -664,7 +664,11 @@ fn ipv6_properties() {
|
||||||
&[0x20, 1, 0, 0x20, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
|
&[0x20, 1, 0, 0x20, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
|
||||||
global | unicast_global
|
global | unicast_global
|
||||||
);
|
);
|
||||||
check!("2001:30::", &[0x20, 1, 0, 0x30, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], global | unicast_global);
|
check!(
|
||||||
|
"2001:30::",
|
||||||
|
&[0x20, 1, 0, 0x30, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
|
||||||
|
global | unicast_global
|
||||||
|
);
|
||||||
check!("2001:40::", &[0x20, 1, 0, 0x40, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], unicast_global);
|
check!("2001:40::", &[0x20, 1, 0, 0x40, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], unicast_global);
|
||||||
|
|
||||||
check!(
|
check!(
|
||||||
|
|
|
@ -478,7 +478,11 @@ fn align_offset_various_strides() {
|
||||||
x |= test_stride::<A9>(ptr::invalid::<A9>(ptr), align);
|
x |= test_stride::<A9>(ptr::invalid::<A9>(ptr), align);
|
||||||
|
|
||||||
#[repr(packed)]
|
#[repr(packed)]
|
||||||
struct A10(#[allow(dead_code)] u32, #[allow(dead_code)] u32, #[allow(dead_code)] u16);
|
struct A10(
|
||||||
|
#[allow(dead_code)] u32,
|
||||||
|
#[allow(dead_code)] u32,
|
||||||
|
#[allow(dead_code)] u16,
|
||||||
|
);
|
||||||
x |= test_stride::<A10>(ptr::invalid::<A10>(ptr), align);
|
x |= test_stride::<A10>(ptr::invalid::<A10>(ptr), align);
|
||||||
|
|
||||||
x |= test_stride::<u32>(ptr::invalid::<u32>(ptr), align);
|
x |= test_stride::<u32>(ptr::invalid::<u32>(ptr), align);
|
||||||
|
@ -532,7 +536,11 @@ fn align_offset_various_strides_const() {
|
||||||
test_stride::<A6>(ptr::invalid::<A6>(ptr), ptr, align);
|
test_stride::<A6>(ptr::invalid::<A6>(ptr), ptr, align);
|
||||||
|
|
||||||
#[repr(packed)]
|
#[repr(packed)]
|
||||||
struct A7(#[allow(dead_code)] u32, #[allow(dead_code)] u16, #[allow(dead_code)] u8);
|
struct A7(
|
||||||
|
#[allow(dead_code)] u32,
|
||||||
|
#[allow(dead_code)] u16,
|
||||||
|
#[allow(dead_code)] u8,
|
||||||
|
);
|
||||||
test_stride::<A7>(ptr::invalid::<A7>(ptr), ptr, align);
|
test_stride::<A7>(ptr::invalid::<A7>(ptr), ptr, align);
|
||||||
|
|
||||||
#[repr(packed)]
|
#[repr(packed)]
|
||||||
|
@ -540,11 +548,19 @@ fn align_offset_various_strides_const() {
|
||||||
test_stride::<A8>(ptr::invalid::<A8>(ptr), ptr, align);
|
test_stride::<A8>(ptr::invalid::<A8>(ptr), ptr, align);
|
||||||
|
|
||||||
#[repr(packed)]
|
#[repr(packed)]
|
||||||
struct A9(#[allow(dead_code)] u32, #[allow(dead_code)] u32, #[allow(dead_code)] u8);
|
struct A9(
|
||||||
|
#[allow(dead_code)] u32,
|
||||||
|
#[allow(dead_code)] u32,
|
||||||
|
#[allow(dead_code)] u8,
|
||||||
|
);
|
||||||
test_stride::<A9>(ptr::invalid::<A9>(ptr), ptr, align);
|
test_stride::<A9>(ptr::invalid::<A9>(ptr), ptr, align);
|
||||||
|
|
||||||
#[repr(packed)]
|
#[repr(packed)]
|
||||||
struct A10(#[allow(dead_code)] u32, #[allow(dead_code)] u32, #[allow(dead_code)] u16);
|
struct A10(
|
||||||
|
#[allow(dead_code)] u32,
|
||||||
|
#[allow(dead_code)] u32,
|
||||||
|
#[allow(dead_code)] u16,
|
||||||
|
);
|
||||||
test_stride::<A10>(ptr::invalid::<A10>(ptr), ptr, align);
|
test_stride::<A10>(ptr::invalid::<A10>(ptr), ptr, align);
|
||||||
|
|
||||||
test_stride::<u32>(ptr::invalid::<u32>(ptr), ptr, align);
|
test_stride::<u32>(ptr::invalid::<u32>(ptr), ptr, align);
|
||||||
|
|
|
@ -13,7 +13,7 @@ ignore = [
|
||||||
|
|
||||||
# tests for now are not formatted, as they are sometimes pretty-printing constrained
|
# tests for now are not formatted, as they are sometimes pretty-printing constrained
|
||||||
# (and generally rustfmt can move around comments in UI-testing incompatible ways)
|
# (and generally rustfmt can move around comments in UI-testing incompatible ways)
|
||||||
"tests",
|
"/tests/",
|
||||||
|
|
||||||
# do not format submodules
|
# do not format submodules
|
||||||
# FIXME: sync submodule list with tidy/bootstrap/etc
|
# FIXME: sync submodule list with tidy/bootstrap/etc
|
||||||
|
|
|
@ -32,9 +32,12 @@ fn download_ci_llvm() {
|
||||||
assert_eq!(parse_llvm("rust.channel = \"dev\""), if_unchanged);
|
assert_eq!(parse_llvm("rust.channel = \"dev\""), if_unchanged);
|
||||||
assert!(!parse_llvm("rust.channel = \"stable\""));
|
assert!(!parse_llvm("rust.channel = \"stable\""));
|
||||||
assert_eq!(parse_llvm("build.build = \"x86_64-unknown-linux-gnu\""), if_unchanged);
|
assert_eq!(parse_llvm("build.build = \"x86_64-unknown-linux-gnu\""), if_unchanged);
|
||||||
assert_eq!(parse_llvm(
|
assert_eq!(
|
||||||
|
parse_llvm(
|
||||||
"llvm.assertions = true \r\n build.build = \"x86_64-unknown-linux-gnu\" \r\n llvm.download-ci-llvm = \"if-unchanged\""
|
"llvm.assertions = true \r\n build.build = \"x86_64-unknown-linux-gnu\" \r\n llvm.download-ci-llvm = \"if-unchanged\""
|
||||||
), if_unchanged);
|
),
|
||||||
|
if_unchanged
|
||||||
|
);
|
||||||
assert!(!parse_llvm(
|
assert!(!parse_llvm(
|
||||||
"llvm.assertions = true \r\n build.build = \"aarch64-apple-darwin\" \r\n llvm.download-ci-llvm = \"if-unchanged\""
|
"llvm.assertions = true \r\n build.build = \"aarch64-apple-darwin\" \r\n llvm.download-ci-llvm = \"if-unchanged\""
|
||||||
));
|
));
|
||||||
|
|
|
@ -1,4 +1,4 @@
|
||||||
use crate::utils::helpers::{extract_beta_rev, hex_encode, make, check_cfg_arg};
|
use crate::utils::helpers::{check_cfg_arg, extract_beta_rev, hex_encode, make};
|
||||||
use std::path::PathBuf;
|
use std::path::PathBuf;
|
||||||
|
|
||||||
#[test]
|
#[test]
|
||||||
|
|
Loading…
Add table
Add a link
Reference in a new issue