2016-01-13 01:28:29 -05:00
|
|
|
// Copyright 2016 The Rust Project Developers. See the COPYRIGHT
|
|
|
|
// file at the top-level directory of this distribution and at
|
|
|
|
// http://rust-lang.org/COPYRIGHT.
|
|
|
|
//
|
|
|
|
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
|
|
|
|
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
|
|
|
|
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
|
|
|
|
// option. This file may not be copied, modified, or distributed
|
|
|
|
// except according to those terms.
|
|
|
|
|
|
|
|
// Test inclusive range syntax.
|
|
|
|
|
|
|
|
use std::ops::{RangeInclusive, RangeToInclusive};
|
|
|
|
|
|
|
|
fn foo() -> isize { 42 }
|
|
|
|
|
|
|
|
// Test that range syntax works in return statements
|
2017-09-19 05:40:04 +00:00
|
|
|
fn return_range_to() -> RangeToInclusive<i32> { return ..=1; }
|
2016-01-13 01:28:29 -05:00
|
|
|
|
|
|
|
pub fn main() {
|
|
|
|
let mut count = 0;
|
2017-09-19 05:40:04 +00:00
|
|
|
for i in 0_usize..=10 {
|
2016-01-13 01:28:29 -05:00
|
|
|
assert!(i >= 0 && i <= 10);
|
|
|
|
count += i;
|
|
|
|
}
|
|
|
|
assert_eq!(count, 55);
|
|
|
|
|
|
|
|
let mut count = 0;
|
2017-09-19 05:40:04 +00:00
|
|
|
let mut range = 0_usize..=10;
|
2016-01-13 01:28:29 -05:00
|
|
|
for i in range {
|
|
|
|
assert!(i >= 0 && i <= 10);
|
|
|
|
count += i;
|
|
|
|
}
|
|
|
|
assert_eq!(count, 55);
|
|
|
|
|
|
|
|
let mut count = 0;
|
2017-09-19 05:40:04 +00:00
|
|
|
for i in (0_usize..=10).step_by(2) {
|
2016-01-13 01:28:29 -05:00
|
|
|
assert!(i >= 0 && i <= 10 && i % 2 == 0);
|
|
|
|
count += i;
|
|
|
|
}
|
|
|
|
assert_eq!(count, 30);
|
|
|
|
|
2017-09-19 05:40:04 +00:00
|
|
|
let _ = 0_usize..=4+4-3;
|
|
|
|
let _ = 0..=foo();
|
2016-01-13 01:28:29 -05:00
|
|
|
|
2017-09-19 05:40:04 +00:00
|
|
|
let _ = { &42..=&100 }; // references to literals are OK
|
|
|
|
let _ = ..=42_usize;
|
2016-01-13 01:28:29 -05:00
|
|
|
|
|
|
|
// Test we can use two different types with a common supertype.
|
|
|
|
let x = &42;
|
|
|
|
{
|
|
|
|
let y = 42;
|
2017-09-19 05:40:04 +00:00
|
|
|
let _ = x..=&y;
|
2016-01-13 01:28:29 -05:00
|
|
|
}
|
|
|
|
|
2016-01-28 11:20:48 -05:00
|
|
|
// test collection indexing
|
2017-09-19 05:40:04 +00:00
|
|
|
let vec = (0..=10).collect::<Vec<_>>();
|
2016-01-28 11:20:48 -05:00
|
|
|
let slice: &[_] = &*vec;
|
|
|
|
let string = String::from("hello world");
|
|
|
|
let stir = "hello world";
|
|
|
|
|
2017-09-19 05:40:04 +00:00
|
|
|
assert_eq!(&vec[3..=6], &[3, 4, 5, 6]);
|
|
|
|
assert_eq!(&vec[ ..=6], &[0, 1, 2, 3, 4, 5, 6]);
|
2016-01-28 11:20:48 -05:00
|
|
|
|
2017-09-19 05:40:04 +00:00
|
|
|
assert_eq!(&slice[3..=6], &[3, 4, 5, 6]);
|
|
|
|
assert_eq!(&slice[ ..=6], &[0, 1, 2, 3, 4, 5, 6]);
|
2016-01-28 11:20:48 -05:00
|
|
|
|
2017-09-19 05:40:04 +00:00
|
|
|
assert_eq!(&string[3..=6], "lo w");
|
|
|
|
assert_eq!(&string[ ..=6], "hello w");
|
2016-01-28 11:20:48 -05:00
|
|
|
|
2017-09-19 05:40:04 +00:00
|
|
|
assert_eq!(&stir[3..=6], "lo w");
|
|
|
|
assert_eq!(&stir[ ..=6], "hello w");
|
2016-01-28 11:20:48 -05:00
|
|
|
|
2016-01-13 01:28:29 -05:00
|
|
|
// test the size hints and emptying
|
2017-09-19 05:40:04 +00:00
|
|
|
let mut long = 0..=255u8;
|
|
|
|
let mut short = 42..=42u8;
|
2016-01-13 01:28:29 -05:00
|
|
|
assert_eq!(long.size_hint(), (256, Some(256)));
|
|
|
|
assert_eq!(short.size_hint(), (1, Some(1)));
|
|
|
|
long.next();
|
|
|
|
short.next();
|
|
|
|
assert_eq!(long.size_hint(), (255, Some(255)));
|
|
|
|
assert_eq!(short.size_hint(), (0, Some(0)));
|
2017-09-19 05:40:04 +00:00
|
|
|
assert_eq!(short, 1..=0);
|
2016-01-13 01:28:29 -05:00
|
|
|
|
|
|
|
assert_eq!(long.len(), 255);
|
|
|
|
assert_eq!(short.len(), 0);
|
|
|
|
|
|
|
|
// test iterating backwards
|
|
|
|
assert_eq!(long.next_back(), Some(255));
|
|
|
|
assert_eq!(long.next_back(), Some(254));
|
|
|
|
assert_eq!(long.next_back(), Some(253));
|
|
|
|
assert_eq!(long.next(), Some(1));
|
|
|
|
assert_eq!(long.next(), Some(2));
|
|
|
|
assert_eq!(long.next_back(), Some(252));
|
2017-09-19 05:40:04 +00:00
|
|
|
for i in 3..=251 {
|
2016-01-13 01:28:29 -05:00
|
|
|
assert_eq!(long.next(), Some(i));
|
|
|
|
}
|
2017-09-19 05:40:04 +00:00
|
|
|
assert_eq!(long, 1..=0);
|
2016-01-13 01:28:29 -05:00
|
|
|
|
2016-02-27 01:56:19 -05:00
|
|
|
// check underflow
|
2017-09-19 05:40:04 +00:00
|
|
|
let mut narrow = 1..=0;
|
2016-02-27 01:56:19 -05:00
|
|
|
assert_eq!(narrow.next_back(), None);
|
2017-09-19 05:40:04 +00:00
|
|
|
assert_eq!(narrow, 1..=0);
|
|
|
|
let mut zero = 0u8..=0;
|
2016-03-04 18:57:22 -05:00
|
|
|
assert_eq!(zero.next_back(), Some(0));
|
|
|
|
assert_eq!(zero.next_back(), None);
|
2017-09-19 05:40:04 +00:00
|
|
|
assert_eq!(zero, 1..=0);
|
|
|
|
let mut high = 255u8..=255;
|
2016-03-04 18:57:22 -05:00
|
|
|
assert_eq!(high.next_back(), Some(255));
|
|
|
|
assert_eq!(high.next_back(), None);
|
2017-09-19 05:40:04 +00:00
|
|
|
assert_eq!(high, 1..=0);
|
2016-02-27 01:56:19 -05:00
|
|
|
|
2016-01-13 01:28:29 -05:00
|
|
|
// what happens if you have a nonsense range?
|
2017-09-19 05:40:04 +00:00
|
|
|
let mut nonsense = 10..=5;
|
2016-01-13 01:28:29 -05:00
|
|
|
assert_eq!(nonsense.next(), None);
|
2017-09-19 05:40:04 +00:00
|
|
|
assert_eq!(nonsense, 10..=5);
|
2016-01-13 01:28:29 -05:00
|
|
|
|
|
|
|
// output
|
2017-09-19 05:40:04 +00:00
|
|
|
assert_eq!(format!("{:?}", 0..=10), "0..=10");
|
|
|
|
assert_eq!(format!("{:?}", ..=10), "..=10");
|
|
|
|
assert_eq!(format!("{:?}", long), "1..=0");
|
2016-01-13 01:28:29 -05:00
|
|
|
}
|