convert remaining range(a, b) to a..b
This commit is contained in:
parent
7d661af9c8
commit
efc97a51ff
48 changed files with 101 additions and 102 deletions
|
|
@ -49,7 +49,7 @@ fn rotate(x: &mut [i32]) {
|
|||
}
|
||||
|
||||
fn next_permutation(perm: &mut [i32], count: &mut [i32]) {
|
||||
for i in range(1, perm.len()) {
|
||||
for i in 1..perm.len() {
|
||||
rotate(&mut perm[..i + 1]);
|
||||
let count_i = &mut count[i];
|
||||
if *count_i >= i as i32 {
|
||||
|
|
|
|||
|
|
@ -158,7 +158,7 @@ fn main() {
|
|||
|
||||
// initialize each sequence sorter
|
||||
let sizes = vec!(1u,2,3,4,6,12,18);
|
||||
let mut streams = range(0, sizes.len()).map(|_| {
|
||||
let mut streams = (0..sizes.len()).map(|_| {
|
||||
Some(channel::<String>())
|
||||
}).collect::<Vec<_>>();
|
||||
let mut from_child = Vec::new();
|
||||
|
|
|
|||
|
|
@ -199,8 +199,8 @@ fn is_board_unfeasible(board: u64, masks: &Vec<Vec<Vec<u64>>>) -> bool {
|
|||
|
||||
// Filter the masks that we can prove to result to unfeasible board.
|
||||
fn filter_masks(masks: &mut Vec<Vec<Vec<u64>>>) {
|
||||
for i in range(0, masks.len()) {
|
||||
for j in range(0, (*masks)[i].len()) {
|
||||
for i in 0..masks.len() {
|
||||
for j in 0..(*masks)[i].len() {
|
||||
masks[i][j] =
|
||||
(*masks)[i][j].iter().map(|&m| m)
|
||||
.filter(|&m| !is_board_unfeasible(m, masks))
|
||||
|
|
|
|||
|
|
@ -9,7 +9,7 @@
|
|||
// except according to those terms.
|
||||
|
||||
fn main() {
|
||||
range(0, 4)
|
||||
(0..4)
|
||||
.map(|x| x * 2)
|
||||
.collect::<Vec<'a, usize, 'b>>()
|
||||
//~^ ERROR lifetime parameters must be declared prior to type parameters
|
||||
|
|
|
|||
|
|
@ -29,7 +29,7 @@ fn foo(name: String, samples_chan: Sender<Msg>) {
|
|||
|
||||
// `box() (...)` syntax is needed to make pretty printer converge in one try:
|
||||
let callback: SamplesFn = box() (move |buffer| {
|
||||
for i in range(0u, buffer.len()) {
|
||||
for i in 0u..buffer.len() {
|
||||
println!("{}: {}", i, buffer[i])
|
||||
}
|
||||
});
|
||||
|
|
|
|||
|
|
@ -37,7 +37,7 @@ pub fn main() {
|
|||
box BarStruct{ x: 2 } as Box<FooTrait>
|
||||
);
|
||||
|
||||
for i in range(0u, foos.len()) {
|
||||
for i in 0u..foos.len() {
|
||||
assert_eq!(i, foos[i].foo());
|
||||
}
|
||||
}
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue