Convert most main functions to the ivec signature

Converting rustc will still take a snapshot
This commit is contained in:
Brian Anderson 2011-08-13 22:34:16 -07:00
parent 184eac90ab
commit f32079f7c0
25 changed files with 39 additions and 48 deletions

@ -29,7 +29,7 @@ for t in os.listdir(run_pass):
if not ("xfail-stage2" in s or
"xfail-fast" in s):
stage2_tests.append(t)
if "main(args: vec[str])" in s:
if "main(args: [str])" in s:
take_args[t] = True
f.close()
@ -60,7 +60,7 @@ for t in stage2_tests:
p = p.replace("\\", "\\\\")
d.write(" out.write_str(\"run-pass [stage2]: %s\\n\");\n" % p)
if t in take_args:
d.write(" t_%d::main([\"arg0\"]);\n" % i)
d.write(" t_%d::main(~[\"arg0\"]);\n" % i)
else:
d.write(" t_%d::main();\n" % i)
i += 1

@ -345,14 +345,13 @@ fn check_variants(files: &[str]) {
}
}
fn main(args: vec[str]) {
let iargs = ivec::from_vec(args);
if ivec::len(iargs) != 2u {
log_err #fmt("usage: %s <testdir>", iargs.(0));
fn main(args: [str]) {
if ivec::len(args) != 2u {
log_err #fmt("usage: %s <testdir>", args.(0));
ret;
}
let files = ~[];
let root = iargs.(1);
let root = args.(1);
find_rust_files(files, root);
check_convergence(files);

@ -56,7 +56,7 @@ fn fannkuch(n: int) -> int {
ret flips;
}
fn main(args: vec[str]) {
fn main(args: [str]) {
let n = 7;
log #fmt("Pfannkuchen(%d) = %d", n, fannkuch(n));
}

@ -67,7 +67,7 @@ fn make_repeat_fasta(id: str, desc: str, s: str, n: int) {
fn acid(ch: char, prob: u32) -> aminoacids { ret {ch: ch, prob: prob}; }
fn main(args: vec[str]) {
fn main(args: [str]) {
let iub: [aminoacids] =
make_cumulative(
~[acid('a', 27u32), acid('c', 12u32), acid('g', 12u32),

@ -79,20 +79,19 @@ fn stress(num_tasks: int) {
for t in tasks { task::join_id(t); }
}
fn main(argv: vec[str]) {
let iargv = ivec::from_vec(argv);
if ivec::len(iargv) == 1u {
fn main(argv: [str]) {
if ivec::len(argv) == 1u {
assert (fib(8) == 21);
log fib(8);
} else {
// Interactive mode! Wooo!!!!
let opts = parse_opts(iargv);
let opts = parse_opts(argv);
if opts.stress {
stress(2);
} else {
let max = uint::parse_buf(str::bytes(iargv.(1)), 10u) as int;
let max = uint::parse_buf(str::bytes(argv.(1)), 10u) as int;
let num_trials = 10;

@ -14,13 +14,12 @@ fn f(n: uint) {
fn g() {}
fn main(args: vec[str]) {
fn main(args: [str]) {
let iargs = ivec::from_vec(args);
let n = if ivec::len(iargs) < 2u {
let n = if ivec::len(args) < 2u {
10u
} else {
uint::parse_buf(str::bytes(iargs.(1)), 10u)
uint::parse_buf(str::bytes(args.(1)), 10u)
};
let i = 0u;
while i < n {

@ -198,12 +198,11 @@ mod map_reduce {
}
}
fn main(argv: vec[str]) {
let iargv = ivec::from_vec(argv);
if ivec::len(iargv) < 2u {
fn main(argv: [str]) {
if ivec::len(argv) < 2u {
let out = io::stdout();
out.write_line(#fmt("Usage: %s <filename> ...", iargv.(0)));
out.write_line(#fmt("Usage: %s <filename> ...", argv.(0)));
// TODO: run something just to make sure the code hasn't
// broken yet. This is the unit test mode of this program.
@ -217,7 +216,7 @@ fn main(argv: vec[str]) {
let start = time::precise_time_ns();
map_reduce::map_reduce(ivec::slice(iargv, 1u, ivec::len(iargv)));
map_reduce::map_reduce(ivec::slice(argv, 1u, ivec::len(argv)));
let stop = time::precise_time_ns();
let elapsed = stop - start;

@ -2,4 +2,4 @@
mod m1 { }
fn main(args: vec[str]) { log m1::a; }
fn main(args: [str]) { log m1::a; }

@ -4,4 +4,4 @@ mod m1 {
mod a { }
}
fn main(args: vec[str]) { log m1::a; }
fn main(args: [str]) { log m1::a; }

@ -4,4 +4,4 @@ import zed::baz;
mod zed {
fn bar() { log "bar"; }
}
fn main(args: vec[str]) { bar(); }
fn main(args: [str]) { bar(); }

@ -4,4 +4,4 @@ mod baz { }
mod zed {
fn bar() { log "bar3"; }
}
fn main(args: vec[str]) { bar(); }
fn main(args: [str]) { bar(); }

@ -1,4 +1,4 @@
// error-pattern: unresolved modulename
import main::bar;
fn main(args: vec[str]) { log "foo"; }
fn main(args: [str]) { log "foo"; }

@ -3,4 +3,4 @@
import zed::bar;
import bar::zed;
fn main(args: vec[str]) { log "loop"; }
fn main(args: [str]) { log "loop"; }

@ -22,11 +22,9 @@ import common::mode_pretty;
import common::mode;
import util::logv;
fn main(args: vec[str]) {
fn main(args: [str]) {
let ivec_args = ivec::from_vec(args);
let config = parse_config(ivec_args);
let config = parse_config(args);
log_config(config);
run_tests(config);
}

@ -1,8 +1,5 @@
use std;
import std::ivec;
fn main(args: vec[str]) {
fn main(args: [str]) {
let vs: [str] = ~["hi", "there", "this", "is", "a", "vec"];
let vvs: [[str]] = ~[ivec::from_vec(args), vs];
let vvs: [[str]] = ~[args, vs];
for vs: [str] in vvs { for s: str in vs { log s; } }
}

@ -1,3 +1,3 @@
fn main(args: vec[str]) { log args.(0); }
fn main(args: [str]) { log args.(0); }

@ -5,4 +5,4 @@ mod zed {
fn bar() { log "bar"; }
}
fn main(args: vec[str]) { let zed = 42; bar(); }
fn main(args: [str]) { let zed = 42; bar(); }

@ -7,4 +7,4 @@ mod foo {
}
}
fn main(args: vec[str]) { bar(); }
fn main(args: [str]) { bar(); }

@ -12,4 +12,4 @@ mod bar {
mod zed { }
}
}
fn main(args: vec[str]) { baz(); }
fn main(args: [str]) { baz(); }

@ -4,4 +4,4 @@ iter x() -> int { }
fn f() -> bool { for each i: int in x() { ret true; } ret false; }
fn main(args: vec[str]) { f(); }
fn main(args: [str]) { f(); }

@ -15,4 +15,4 @@ native "cdecl" mod libc = "" {
native "cdecl" mod baz = "" { }
fn main(args: vec[str]) { }
fn main(args: [str]) { }

@ -4,4 +4,4 @@ mod foo {
fn bar(offset: uint) { }
}
fn main(args: vec[str]) { foo::bar(0u); }
fn main(args: [str]) { foo::bar(0u); }

@ -6,4 +6,4 @@ fn foo() {
fn baz() { zed(nil); }
}
fn main(args: vec[str]) { }
fn main(args: [str]) { }

@ -2,4 +2,4 @@
type lteq[T] = fn(&T) -> bool ;
fn main(args: vec[str]) { }
fn main(args: [str]) { }

@ -2,4 +2,4 @@ fn f(a: *int) -> *int { ret a; }
fn g(a: *int) -> *int { let b = f(a); ret b; }
fn main(args: vec[str]) { ret; }
fn main(args: [str]) { ret; }