mathieu/os-rust
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions 1

move 'test zip ...' tests

Browse source
This commit is contained in:
Alexis Bourget 2020-09-08 23:04:03 +02:00
parent af44a2a857
commit fc152cd67e
2 changed files with 95 additions and 103 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

95
library/core/tests/iter.rs
View file

@ -376,6 +376,101 @@ fn test_zip_next_back_side_effects_exhausted() {
assert_eq!(b, vec![200, 300, 400]);
}
#[derive(Debug)]
struct CountClone(Cell<i32>);
fn count_clone() -> CountClone { CountClone(Cell::new(0)) }
impl PartialEq<i32> for CountClone {
fn eq(&self, rhs: &i32) -> bool {
self.0.get() == *rhs
}
}
impl Clone for CountClone {
fn clone(&self) -> Self {
let ret = CountClone(self.0.clone());
let n = self.0.get();
self.0.set(n + 1);
ret
}
}
#[test]
fn test_zip_cloned_sideffectful() {
let xs = [count_clone(), count_clone(), count_clone(), count_clone()];
let ys = [count_clone(), count_clone()];
for _ in xs.iter().cloned().zip(ys.iter().cloned()) { }
assert_eq!(&xs, &[1, 1, 1, 0][..]);
assert_eq!(&ys, &[1, 1][..]);
let xs = [count_clone(), count_clone()];
let ys = [count_clone(), count_clone(), count_clone(), count_clone()];
for _ in xs.iter().cloned().zip(ys.iter().cloned()) { }
assert_eq!(&xs, &[1, 1][..]);
assert_eq!(&ys, &[1, 1, 0, 0][..]);
}
#[test]
fn test_zip_map_sideffectful() {
let mut xs = [0; 6];
let mut ys = [0; 4];
for _ in xs.iter_mut().map(|x| *x += 1).zip(ys.iter_mut().map(|y| *y += 1)) { }
assert_eq!(&xs, &[1, 1, 1, 1, 1, 0]);
assert_eq!(&ys, &[1, 1, 1, 1]);
let mut xs = [0; 4];
let mut ys = [0; 6];
for _ in xs.iter_mut().map(|x| *x += 1).zip(ys.iter_mut().map(|y| *y += 1)) { }
assert_eq!(&xs, &[1, 1, 1, 1]);
assert_eq!(&ys, &[1, 1, 1, 1, 0, 0]);
}
#[test]
fn test_zip_map_rev_sideffectful() {
let mut xs = [0; 6];
let mut ys = [0; 4];
{
let mut it = xs.iter_mut().map(|x| *x += 1).zip(ys.iter_mut().map(|y| *y += 1));
it.next_back();
}
assert_eq!(&xs, &[0, 0, 0, 1, 1, 1]);
assert_eq!(&ys, &[0, 0, 0, 1]);
let mut xs = [0; 6];
let mut ys = [0; 4];
{
let mut it = xs.iter_mut().map(|x| *x += 1).zip(ys.iter_mut().map(|y| *y += 1));
(&mut it).take(5).count();
it.next_back();
}
assert_eq!(&xs, &[1, 1, 1, 1, 1, 1]);
assert_eq!(&ys, &[1, 1, 1, 1]);
}
#[test]
fn test_zip_nested_sideffectful() {
let mut xs = [0; 6];
let ys = [0; 4];
{
// test that it has the side effect nested inside enumerate
let it = xs.iter_mut().map(|x| *x = 1).enumerate().zip(&ys);
it.count();
}
assert_eq!(&xs, &[1, 1, 1, 1, 1, 0]);
}
#[test]
fn test_zip_nth_back_side_effects_exhausted() {
let mut a = Vec::new();

103
src/test/ui/iterators/iter-zip.rs
View file

@ -1,103 +0,0 @@
// run-pass
// Test that .zip() specialization preserves side effects
// in sideeffectful iterator adaptors.
use std::cell::Cell;
#[derive(Debug)]
struct CountClone(Cell<i32>);
fn count_clone() -> CountClone { CountClone(Cell::new(0)) }
impl PartialEq<i32> for CountClone {
fn eq(&self, rhs: &i32) -> bool {
self.0.get() == *rhs
}
}
impl Clone for CountClone {
fn clone(&self) -> Self {
let ret = CountClone(self.0.clone());
let n = self.0.get();
self.0.set(n + 1);
ret
}
}
fn test_zip_cloned_sideffectful() {
let xs = [count_clone(), count_clone(), count_clone(), count_clone()];
let ys = [count_clone(), count_clone()];
for _ in xs.iter().cloned().zip(ys.iter().cloned()) { }
assert_eq!(&xs, &[1, 1, 1, 0][..]);
assert_eq!(&ys, &[1, 1][..]);
let xs = [count_clone(), count_clone()];
let ys = [count_clone(), count_clone(), count_clone(), count_clone()];
for _ in xs.iter().cloned().zip(ys.iter().cloned()) { }
assert_eq!(&xs, &[1, 1][..]);
assert_eq!(&ys, &[1, 1, 0, 0][..]);
}
fn test_zip_map_sideffectful() {
let mut xs = [0; 6];
let mut ys = [0; 4];
for _ in xs.iter_mut().map(|x| *x += 1).zip(ys.iter_mut().map(|y| *y += 1)) { }
assert_eq!(&xs, &[1, 1, 1, 1, 1, 0]);
assert_eq!(&ys, &[1, 1, 1, 1]);
let mut xs = [0; 4];
let mut ys = [0; 6];
for _ in xs.iter_mut().map(|x| *x += 1).zip(ys.iter_mut().map(|y| *y += 1)) { }
assert_eq!(&xs, &[1, 1, 1, 1]);
assert_eq!(&ys, &[1, 1, 1, 1, 0, 0]);
}
fn test_zip_map_rev_sideffectful() {
let mut xs = [0; 6];
let mut ys = [0; 4];
{
let mut it = xs.iter_mut().map(|x| *x += 1).zip(ys.iter_mut().map(|y| *y += 1));
it.next_back();
}
assert_eq!(&xs, &[0, 0, 0, 1, 1, 1]);
assert_eq!(&ys, &[0, 0, 0, 1]);
let mut xs = [0; 6];
let mut ys = [0; 4];
{
let mut it = xs.iter_mut().map(|x| *x += 1).zip(ys.iter_mut().map(|y| *y += 1));
(&mut it).take(5).count();
it.next_back();
}
assert_eq!(&xs, &[1, 1, 1, 1, 1, 1]);
assert_eq!(&ys, &[1, 1, 1, 1]);
}
fn test_zip_nested_sideffectful() {
let mut xs = [0; 6];
let ys = [0; 4];
{
// test that it has the side effect nested inside enumerate
let it = xs.iter_mut().map(|x| *x = 1).enumerate().zip(&ys);
it.count();
}
assert_eq!(&xs, &[1, 1, 1, 1, 1, 0]);
}
fn main() {
test_zip_cloned_sideffectful();
test_zip_map_sideffectful();
test_zip_map_rev_sideffectful();
test_zip_nested_sideffectful();
}