Skip to content

Commit e6c82c0

Browse files
bstriebstrie
committed
RIMOV core::vec
Also remove as many uses as possible of vec::cast_to_mut and cast_from_mut
1 parent 4de76ae commit e6c82c0

File tree

17 files changed

+81
-108
lines changed

17 files changed

+81
-108
lines changed

‎src/compiletest/runtest.rs

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -322,8 +322,8 @@ fn check_expected_errors(expected_errors: ~[errors::ExpectedError],
322322
ProcRes: ProcRes) {
323323

324324
// true if we found the error in question
325-
let found_flags = vec::cast_to_mut(vec::from_elem(
326-
vec::len(expected_errors), false));
325+
let mut found_flags = vec::from_elem(
326+
vec::len(expected_errors), false);
327327

328328
if ProcRes.status == 0 {
329329
fatal(~"process did not return an error status");

‎src/libcore/os.rs

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -79,7 +79,7 @@ pub fn as_c_charp<T>(s: &str, f: fn(*c_char) -> T) -> T {
7979

8080
pub fn fill_charp_buf(f: fn(*mut c_char, size_t) -> bool)
8181
-> Option<~str> {
82-
let buf = vec::cast_to_mut(vec::from_elem(TMPBUF_SZ, 0u8 as c_char));
82+
let mut buf = vec::from_elem(TMPBUF_SZ, 0u8 as c_char);
8383
do vec::as_mut_buf(buf) |b, sz| {
8484
if f(b, sz as size_t) {
8585
unsafe {
@@ -108,7 +108,7 @@ pub mod win32 {
108108
let mut res = None;
109109
let mut done = false;
110110
while !done {
111-
let buf = vec::cast_to_mut(vec::from_elem(n as uint, 0u16));
111+
let mut buf = vec::from_elem(n as uint, 0u16);
112112
do vec::as_mut_buf(buf) |b, _sz| {
113113
let k : DWORD = f(b, TMPBUF_SZ as DWORD);
114114
if k == (0 as DWORD) {
@@ -1325,7 +1325,7 @@ mod tests {
13251325
};
13261326
assert (ostream as uint != 0u);
13271327
let s = ~"hello";
1328-
let mut buf = vec::cast_to_mut(str::to_bytes(s) + ~[0 as u8]);
1328+
let mut buf = str::to_bytes(s) + ~[0 as u8];
13291329
do vec::as_mut_buf(buf) |b, _len| {
13301330
assert (libc::fwrite(b as *c_void, 1u as size_t,
13311331
(str::len(s) + 1u) as size_t, ostream)

‎src/libcore/vec.rs

Lines changed: 15 additions & 45 deletions
Original file line numberDiff line numberDiff line change
@@ -558,10 +558,6 @@ pub fn consume<T>(mut v: ~[T], f: fn(uint, v: T)) {
558558
}
559559
}
560560
561-
pub fn consume_mut<T>(v: ~[mut T], f: fn(uint, v: T)) {
562-
consume(vec::cast_from_mut(v), f)
563-
}
564-
565561
/// Remove the last element from a vector and return it
566562
pub fn pop<T>(v: &mut ~[T]) -> T {
567563
let ln = v.len();
@@ -728,11 +724,6 @@ pub pure fn append_one<T>(lhs: ~[T], x: T) -> ~[T] {
728724
v
729725
}
730726

731-
#[inline(always)]
732-
pub pure fn append_mut<T: Copy>(lhs: ~[mut T], rhs: &[const T]) -> ~[mut T] {
733-
cast_to_mut(append(cast_from_mut(lhs), rhs))
734-
}
735-
736727
/**
737728
* Expands a vector in place, initializing the new elements to a given value
738729
*
@@ -1285,12 +1276,12 @@ pub pure fn zip<T, U>(mut v: ~[T], mut u: ~[U]) -> ~[(T, U)] {
12851276
* * a - The index of the first element
12861277
* * b - The index of the second element
12871278
*/
1288-
pub fn swap<T>(v: &[mut T], a: uint, b: uint) {
1279+
pub fn swap<T>(v: &mut [T], a: uint, b: uint) {
12891280
v[a] <-> v[b];
12901281
}
12911282

12921283
/// Reverse the order of elements in a vector, in place
1293-
pub fn reverse<T>(v: &[mut T]) {
1284+
pub fn reverse<T>(v: &mut [T]) {
12941285
let mut i: uint = 0;
12951286
let ln = len::<T>(v);
12961287
while i < ln / 2 { v[i] <-> v[ln - i - 1]; i += 1; }
@@ -1371,7 +1362,7 @@ pub pure fn each<T>(v: &r/[T], f: fn(&r/T) -> bool) {
13711362
/// a vector with mutable contents and you would like
13721363
/// to mutate the contents as you iterate.
13731364
#[inline(always)]
1374-
pub fn each_mut<T>(v: &[mut T], f: fn(elem: &mut T) -> bool) {
1365+
pub fn each_mut<T>(v: &mut [T], f: fn(elem: &mut T) -> bool) {
13751366
let mut i = 0;
13761367
let n = v.len();
13771368
while i < n {
@@ -1541,7 +1532,7 @@ pub pure fn as_const_buf<T,U>(s: &[const T],
15411532

15421533
/// Similar to `as_imm_buf` but passing a `*mut T`
15431534
#[inline(always)]
1544-
pub pure fn as_mut_buf<T,U>(s: &[mut T],
1535+
pub pure fn as_mut_buf<T,U>(s: &mut [T],
15451536
f: fn(*mut T, uint) -> U) -> U {
15461537

15471538
unsafe {
@@ -1653,21 +1644,14 @@ impl<T: Ord> @[T] : Ord {
16531644
pub mod traits {
16541645
use kinds::Copy;
16551646
use ops::Add;
1656-
use vec::{append, append_mut};
1647+
use vec::append;
16571648

16581649
impl<T: Copy> ~[T] : Add<&[const T],~[T]> {
16591650
#[inline(always)]
16601651
pure fn add(&self, rhs: & &self/[const T]) -> ~[T] {
16611652
append(copy *self, (*rhs))
16621653
}
16631654
}
1664-
1665-
impl<T: Copy> ~[mut T] : Add<&[const T],~[mut T]> {
1666-
#[inline(always)]
1667-
pure fn add(&self, rhs: & &self/[const T]) -> ~[mut T] {
1668-
append_mut(copy *self, (*rhs))
1669-
}
1670-
}
16711655
}
16721656

16731657
impl<T> &[const T]: Container {
@@ -2088,7 +2072,7 @@ pub mod raw {
20882072

20892073
/** see `to_ptr()` */
20902074
#[inline(always)]
2091-
pub unsafe fn to_mut_ptr<T>(v: &[mut T]) -> *mut T {
2075+
pub unsafe fn to_mut_ptr<T>(v: &mut [T]) -> *mut T {
20922076
let repr: **SliceRepr = ::cast::transmute(&v);
20932077
return ::cast::reinterpret_cast(&addr_of(&((**repr).data)));
20942078
}
@@ -2121,7 +2105,7 @@ pub mod raw {
21212105
* is newly allocated.
21222106
*/
21232107
#[inline(always)]
2124-
pub unsafe fn init_elem<T>(v: &[mut T], i: uint, val: T) {
2108+
pub unsafe fn init_elem<T>(v: &mut [T], i: uint, val: T) {
21252109
let mut box = Some(val);
21262110
do as_mut_buf(v) |p, _len| {
21272111
let mut box2 = None;
@@ -2155,7 +2139,7 @@ pub mod raw {
21552139
* may overlap.
21562140
*/
21572141
#[inline(always)]
2158-
pub unsafe fn copy_memory<T>(dst: &[mut T], src: &[const T],
2142+
pub unsafe fn copy_memory<T>(dst: &mut [T], src: &[const T],
21592143
count: uint) {
21602144
assert dst.len() >= count;
21612145
assert src.len() >= count;
@@ -2222,7 +2206,7 @@ pub mod bytes {
22222206
* may overlap.
22232207
*/
22242208
#[inline(always)]
2225-
pub fn copy_memory(dst: &[mut u8], src: &[const u8], count: uint) {
2209+
pub fn copy_memory(dst: &mut [u8], src: &[const u8], count: uint) {
22262210
// Bound checks are done at vec::raw::copy_memory.
22272211
unsafe { vec::raw::copy_memory(dst, src, count) }
22282212
}
@@ -3220,7 +3204,7 @@ mod tests {
32203204

32213205
#[test]
32223206
fn reverse_and_reversed() {
3223-
let v: ~[mut int] = ~[mut 10, 20];
3207+
let mut v: ~[int] = ~[10, 20];
32243208
assert (v[0] == 10);
32253209
assert (v[1] == 20);
32263210
reverse(v);
@@ -3235,13 +3219,13 @@ mod tests {
32353219

32363220
let v4 = reversed::<int>(~[]);
32373221
assert (v4 == ~[]);
3238-
let v3: ~[mut int] = ~[mut];
3222+
let mut v3: ~[int] = ~[];
32393223
reverse::<int>(v3);
32403224
}
32413225

32423226
#[test]
32433227
fn reversed_mut() {
3244-
let v2 = reversed::<int>(~[mut 10, 20]);
3228+
let mut v2 = reversed::<int>(~[10, 20]);
32453229
assert (v2[0] == 20);
32463230
assert (v2[1] == 10);
32473231
}
@@ -3625,20 +3609,6 @@ mod tests {
36253609
};
36263610
}
36273611

3628-
#[test]
3629-
#[ignore(windows)]
3630-
#[should_fail]
3631-
fn test_consume_mut_fail() {
3632-
let v = ~[mut (~0, @0), (~0, @0), (~0, @0), (~0, @0)];
3633-
let mut i = 0;
3634-
do consume_mut(v) |_i, _elt| {
3635-
if i == 2 {
3636-
die!()
3637-
}
3638-
i += 1;
3639-
};
3640-
}
3641-
36423612
#[test]
36433613
#[ignore(windows)]
36443614
#[should_fail]
@@ -3657,7 +3627,7 @@ mod tests {
36573627
#[ignore(windows)]
36583628
#[should_fail]
36593629
fn test_map_fail() {
3660-
let v = [mut (~0, @0), (~0, @0), (~0, @0), (~0, @0)];
3630+
let mut v = [(~0, @0), (~0, @0), (~0, @0), (~0, @0)];
36613631
let mut i = 0;
36623632
do map(v) |_elt| {
36633633
if i == 2 {
@@ -3983,7 +3953,7 @@ mod tests {
39833953
#[ignore(cfg(windows))]
39843954
#[should_fail]
39853955
fn test_as_mut_buf_fail() {
3986-
let v = [mut (~0, @0), (~0, @0), (~0, @0), (~0, @0)];
3956+
let mut v = [(~0, @0), (~0, @0), (~0, @0), (~0, @0)];
39873957
do as_mut_buf(v) |_buf, _i| {
39883958
die!()
39893959
}
@@ -3994,7 +3964,7 @@ mod tests {
39943964
#[ignore(cfg(windows))]
39953965
fn test_copy_memory_oob() {
39963966
unsafe {
3997-
let a = [mut 1, 2, 3, 4];
3967+
let mut a = [1, 2, 3, 4];
39983968
let b = [1, 2, 3, 4, 5];
39993969
raw::copy_memory(a, b, 5);
40003970
}

‎src/librustc/middle/trans/_match.rs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1002,7 +1002,7 @@ pub fn pick_col(m: &[@Match]) -> uint {
10021002
_ => 0u
10031003
}
10041004
}
1005-
let scores = vec::cast_to_mut(vec::from_elem(m[0].pats.len(), 0u));
1005+
let mut scores = vec::from_elem(m[0].pats.len(), 0u);
10061006
for vec::each(m) |br| {
10071007
let mut i = 0u;
10081008
for vec::each(br.pats) |p| { scores[i] += score(*p); i += 1u; }

‎src/librustc/middle/trans/cabi_x86_64.rs

Lines changed: 4 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -270,14 +270,15 @@ fn classify_ty(ty: TypeRef) -> ~[x86_64_reg_class] {
270270
}
271271
272272
let words = (ty_size(ty) + 7) / 8;
273-
let cls = vec::cast_to_mut(vec::from_elem(words, no_class));
273+
let mut cls = vec::from_elem(words, no_class);
274274
if words > 4 {
275275
all_mem(cls);
276-
return vec::cast_from_mut(move cls);
276+
let cls = cls;
277+
return move cls;
277278
}
278279
classify(ty, cls, 0, 0);
279280
fixup(ty, cls);
280-
return vec::cast_from_mut(move cls);
281+
return move cls;
281282
}
282283
283284
fn llreg_ty(cls: &[x86_64_reg_class]) -> TypeRef {

‎src/librustc/middle/typeck/check/mod.rs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3131,7 +3131,7 @@ pub fn check_bounds_are_used(ccx: @mut CrateCtxt,
31313131

31323132
// make a vector of booleans initially false, set to true when used
31333133
if tps.len() == 0u { return; }
3134-
let tps_used = vec::cast_to_mut(vec::from_elem(tps.len(), false));
3134+
let mut tps_used = vec::from_elem(tps.len(), false);
31353135

31363136
ty::walk_regions_and_ty(
31373137
ccx.tcx, ty,

‎src/libstd/getopts.rs

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -224,7 +224,7 @@ pub fn getopts(args: &[~str], opts: &[Opt]) -> Result {
224224
unsafe {
225225
let n_opts = opts.len();
226226
fn f(_x: uint) -> ~[Optval] { return ~[]; }
227-
let vals = vec::cast_to_mut(vec::from_fn(n_opts, f));
227+
let mut vals = vec::from_fn(n_opts, f);
228228
let mut free: ~[~str] = ~[];
229229
let l = args.len();
230230
let mut i = 0;
@@ -339,7 +339,7 @@ pub fn getopts(args: &[~str], opts: &[Opt]) -> Result {
339339
i += 1;
340340
}
341341
return Ok(Matches {opts: vec::from_slice(opts),
342-
vals: vec::cast_from_mut(move vals),
342+
vals: move vals,
343343
free: free});
344344
}
345345
}

‎src/libstd/md4.rs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -52,7 +52,7 @@ pub pure fn md4(msg: &[u8]) -> Quad {
5252

5353
let mut i = 0u;
5454
let e = vec::len(msg);
55-
let x = vec::cast_to_mut(vec::from_elem(16u, 0u32));
55+
let mut x = vec::from_elem(16u, 0u32);
5656
while i < e {
5757
let aa = a, bb = b, cc = c, dd = d;
5858

‎src/libstd/rope.rs

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -174,7 +174,7 @@ pub fn concat(v: ~[Rope]) -> Rope {
174174
//Copy `v` into a mut vector
175175
let mut len = vec::len(v);
176176
if len == 0u { return node::Empty; }
177-
let ropes = vec::cast_to_mut(vec::from_elem(len, v[0]));
177+
let mut ropes = vec::from_elem(len, v[0]);
178178
for uint::range(1u, len) |i| {
179179
ropes[i] = v[i];
180180
}
@@ -719,7 +719,7 @@ pub mod node {
719719
//Firstly, split `str` in slices of hint_max_leaf_char_len
720720
let mut leaves = uint::div_ceil(char_len, hint_max_leaf_char_len);
721721
//Number of leaves
722-
let nodes = vec::cast_to_mut(vec::from_elem(leaves, candidate));
722+
let mut nodes = vec::from_elem(leaves, candidate);
723723

724724
let mut i = 0u;
725725
let mut offset = byte_start;
@@ -832,7 +832,7 @@ pub mod node {
832832

833833
pub fn serialize_node(node: @Node) -> ~str {
834834
unsafe {
835-
let mut buf = vec::cast_to_mut(vec::from_elem(byte_len(node), 0));
835+
let mut buf = vec::from_elem(byte_len(node), 0);
836836
let mut offset = 0u;//Current position in the buffer
837837
let it = leaf_iterator::start(node);
838838
loop {

0 commit comments

Comments
 (0)