diff options
| author | Youngmin Yoo <youngmin.yoo@samsung.com> | 2013-05-14 18:52:12 +0900 |
|---|---|---|
| committer | Youngmin Yoo <youngmin.yoo@samsung.com> | 2013-05-15 11:05:28 +0900 |
| commit | a2a8596c3dd963e7b51f11998cffc46033bf6d63 (patch) | |
| tree | 2ea272be21c9a7b7d486be08fe0a3dcb10c8a132 /src/libfuzzer | |
| parent | c30414f980eb3e8010640f6c83a5ef6f8e6ab047 (diff) | |
| download | rust-a2a8596c3dd963e7b51f11998cffc46033bf6d63.tar.gz rust-a2a8596c3dd963e7b51f11998cffc46033bf6d63.zip | |
Rename vec::len(var) to var.len()
Diffstat (limited to 'src/libfuzzer')
| -rw-r--r-- | src/libfuzzer/ast_match.rs | 4 | ||||
| -rw-r--r-- | src/libfuzzer/cycles.rs | 2 | ||||
| -rw-r--r-- | src/libfuzzer/rand_util.rs | 6 |
3 files changed, 6 insertions, 6 deletions
diff --git a/src/libfuzzer/ast_match.rs b/src/libfuzzer/ast_match.rs index 806a7aedd31..2502830250d 100644 --- a/src/libfuzzer/ast_match.rs +++ b/src/libfuzzer/ast_match.rs @@ -15,8 +15,8 @@ fn vec_equal<T>(v: ~[T], u: ~[T], element_equality_test: @fn(&&T, &&T) -> bool) -> bool { - let Lv = vec::len(v); - if Lv != vec::len(u) { return false; } + let Lv = v.len(); + if Lv != u.len() { return false; } let i = 0u; while i < Lv { if !element_equality_test(v[i], u[i]) { return false; } diff --git a/src/libfuzzer/cycles.rs b/src/libfuzzer/cycles.rs index c18d1f43b56..a6434d64cdc 100644 --- a/src/libfuzzer/cycles.rs +++ b/src/libfuzzer/cycles.rs @@ -19,7 +19,7 @@ fn under(r : rand::rng, n : uint) -> uint { // random choice from a vec fn choice<T:copy>(r : rand::rng, v : ~[const T]) -> T { - assert!(vec::len(v) != 0u); v[under(r, vec::len(v))] + assert!(v.len() != 0u); v[under(r, v.len())] } // k in n chance of being true diff --git a/src/libfuzzer/rand_util.rs b/src/libfuzzer/rand_util.rs index 2422c146e24..c239e8ab933 100644 --- a/src/libfuzzer/rand_util.rs +++ b/src/libfuzzer/rand_util.rs @@ -18,7 +18,7 @@ fn under(r : rand::rng, n : uint) -> uint { // random choice from a vec fn choice<T:copy>(r : rand::rng, v : ~[T]) -> T { - assert!(vec::len(v) != 0u); v[under(r, vec::len(v))] + assert!(v.len() != 0u); v[under(r, v.len())] } // 1 in n chance of being true @@ -26,7 +26,7 @@ fn unlikely(r : rand::rng, n : uint) -> bool { under(r, n) == 0u } // shuffle a vec in place fn shuffle<T>(r : rand::rng, &v : ~[T]) { - let i = vec::len(v); + let i = v.len(); while i >= 2u { // Loop invariant: elements with index >= i have been locked in place. i -= 1u; @@ -49,7 +49,7 @@ fn shuffled<T:copy>(r : rand::rng, v : ~[T]) -> ~[T] { // * weighted_vec is O(total weight) space type weighted<T> = { weight: uint, item: T }; fn weighted_choice<T:copy>(r : rand::rng, v : ~[weighted<T>]) -> T { - assert!(vec::len(v) != 0u); + assert!(v.len() != 0u); let total = 0u; for {weight: weight, item: _} in v { total += weight; |
