7f928d150e
declared with the same name in the same scope.
This breaks several common patterns. First are unused imports:
use foo::bar;
use baz::bar;
Change this code to the following:
use baz::bar;
Second, this patch breaks globs that import names that are shadowed by
subsequent imports. For example:
use foo::*; // including `bar`
use baz::bar;
Change this code to remove the glob:
use foo::{boo, quux};
use baz::bar;
Or qualify all uses of `bar`:
use foo::{boo, quux};
use baz;
... baz::bar ...
Finally, this patch breaks code that, at top level, explicitly imports
`std` and doesn't disable the prelude.
extern crate std;
Because the prelude imports `std` implicitly, there is no need to
explicitly import it; just remove such directives.
The old behavior can be opted into via the `import_shadowing` feature
gate. Use of this feature gate is discouraged.
This implements RFC #116.
Closes #16464.
[breaking-change]
35 lines
996 B
Rust
35 lines
996 B
Rust
// Copyright 2014 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.
|
|
|
|
extern crate collections;
|
|
|
|
use std::collections::Bitv;
|
|
|
|
fn main() {
|
|
// Generate sieve of Eratosthenes for n up to 1e6
|
|
let n = 1000000u;
|
|
let mut sieve = Bitv::with_capacity(n+1, true);
|
|
let limit: uint = (n as f32).sqrt() as uint;
|
|
for i in range(2, limit+1) {
|
|
if sieve[i] {
|
|
let mut j = 0;
|
|
while i*i + j*i <= n {
|
|
sieve.set(i*i+j*i, false);
|
|
j += 1;
|
|
}
|
|
}
|
|
}
|
|
for i in range(2, n+1) {
|
|
if sieve[i] {
|
|
}
|
|
}
|
|
}
|
|
|