nordic-dev.net/rust
nordic-dev.net/rust
2
0
Fork 0
mirror of https://github.com/rust-lang/rust.git synced 2025-02-19 18:34:08 +00:00
Code Issues Packages Projects Releases Wiki Activity

std: remove unused 'mut' variables

Browse Source
This commit is contained in:
Alex Crichton 2013-04-12 01:10:12 -04:00
parent 13537d2e0c
commit 7d317fe7e5
9 changed files with 20 additions and 22 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
src/libstd/bitv.rs
View File

@ -891,7 +891,7 @@ mod tests {
#[test]
fn test_0_elements() {
let mut act;
let mut exp;
let exp;
act = Bitv::new(0u, false);
exp = vec::from_elem::<uint>(0u, 0u);
assert!(act.eq_vec(exp));

8
src/libstd/deque.rs
View File

@ -113,7 +113,7 @@ pub impl<T> Deque<T> {
///
/// Fails if the deque is empty
fn pop_front(&mut self) -> T {
let mut result = self.elts[self.lo].swap_unwrap();
let result = self.elts[self.lo].swap_unwrap();
self.lo = (self.lo + 1u) % self.elts.len();
self.nelts -= 1u;
result
@ -126,7 +126,7 @@ pub impl<T> Deque<T> {
if self.hi == 0u {
self.hi = self.elts.len() - 1u;
} else { self.hi -= 1u; }
let mut result = self.elts[self.hi].swap_unwrap();
let result = self.elts[self.hi].swap_unwrap();
self.elts[self.hi] = None;
self.nelts -= 1u;
result
@ -204,7 +204,7 @@ pub impl<T> Deque<T> {
///
/// Fails if the deque is empty
fn pop_front(&mut self) -> T {
let mut result = self.elts[self.lo].swap_unwrap();
let result = self.elts[self.lo].swap_unwrap();
self.lo = (self.lo + 1u) % self.elts.len();
self.nelts -= 1u;
result
@ -217,7 +217,7 @@ pub impl<T> Deque<T> {
if self.hi == 0u {
self.hi = self.elts.len() - 1u;
} else { self.hi -= 1u; }
let mut result = self.elts[self.hi].swap_unwrap();
let result = self.elts[self.hi].swap_unwrap();
self.elts[self.hi] = None;
self.nelts -= 1u;
result

8
src/libstd/dlist.rs
View File

@ -220,7 +220,7 @@ pub impl<T> DList<T> {
* node. O(1).
*/
fn push_head_n(@mut self, data: T) -> @mut DListNode<T> {
let mut nobe = DList::new_link(data);
let nobe = DList::new_link(data);
self.add_head(nobe);
nobe.get()
}
@ -233,7 +233,7 @@ pub impl<T> DList<T> {
* node. O(1).
*/
fn push_n(@mut self, data: T) -> @mut DListNode<T> {
let mut nobe = DList::new_link(data);
let nobe = DList::new_link(data);
self.add_tail(nobe);
nobe.get()
}
@ -263,7 +263,7 @@ pub impl<T> DList<T> {
data: T,
neighbour: @mut DListNode<T>
) -> @mut DListNode<T> {
let mut nobe = DList::new_link(data);
let nobe = DList::new_link(data);
self.insert_left(nobe, neighbour);
nobe.get()
}
@ -293,7 +293,7 @@ pub impl<T> DList<T> {
data: T,
neighbour: @mut DListNode<T>
) -> @mut DListNode<T> {
let mut nobe = DList::new_link(data);
let nobe = DList::new_link(data);
self.insert_right(neighbour, nobe);
nobe.get()
}

4
src/libstd/num/rational.rs
View File

@ -60,7 +60,7 @@ impl<T: Copy + Div<T,T> + Modulo<T,T> + Neg<T> + Zero + One + Ord + Eq>
/// Put self into lowest terms, with denom > 0.
fn reduce(&mut self) {
let mut g : T = gcd(self.numer, self.denom);
let g : T = gcd(self.numer, self.denom);
self.numer /= g;
self.denom /= g;
@ -508,4 +508,4 @@ mod test {
test(s);
}
}
}
}

5
src/libstd/rope.rs
View File

@ -838,8 +838,7 @@ pub mod node {
option::None => break,
option::Some(x) => {
//FIXME (#2744): Replace with memcpy or something similar
let mut local_buf: ~[u8] =
cast::transmute(*x.content);
let local_buf: ~[u8] = cast::transmute(*x.content);
let mut i = x.byte_offset;
while i < x.byte_len {
buf[offset] = local_buf[i];
@ -1156,7 +1155,7 @@ pub mod node {
}
pub fn empty() -> T {
let mut stack : ~[@Node] = ~[];
let stack : ~[@Node] = ~[];
T { stack: stack, stackpos: -1 }
}

4
src/libstd/sha1.rs
View File

@ -93,7 +93,7 @@ pub fn sha1() -> @Sha1 {
assert!((vec::len(st.h) == digest_buf_len));
assert!((vec::uniq_len(st.work_buf) == work_buf_len));
let mut t: int; // Loop counter
let mut w = st.work_buf;
let w = st.work_buf;
// Initialize the first 16 words of the vector w
t = 0;
@ -260,7 +260,7 @@ pub fn sha1() -> @Sha1 {
return s;
}
}
let mut st = Sha1State {
let st = Sha1State {
h: vec::from_elem(digest_buf_len, 0u32),
len_low: 0u32,
len_high: 0u32,

4
src/libstd/sort.rs
View File

@ -239,7 +239,7 @@ fn binarysort<T:Copy + Ord>(array: &mut [T], start: uint) {
}
}
assert!(left == right);
let mut n = start-left;
let n = start-left;
copy_vec(array, left+1, array, left, n);
array[left] = pivot;
@ -416,7 +416,7 @@ impl<T:Copy + Ord> MergeState<T> {
}
fn merge_at(&mut self, n: uint, array: &mut [T]) {
let mut size = self.runs.len();
let size = self.runs.len();
assert!(size >= 2);
assert!(n == size-2 || n == size-3);

3
src/libstd/test.rs
View File

@ -427,8 +427,7 @@ fn run_tests(opts: &TestOpts,
let filtered_descs = filtered_tests.map(|t| t.desc);
callback(TeFiltered(filtered_descs));
let mut (filtered_tests,
filtered_benchs) =
let (filtered_tests, filtered_benchs) =
do vec::partition(filtered_tests) |e| {
match e.testfn {
StaticTestFn(_) | DynTestFn(_) => true,

4
src/libstd/time.rs
View File

@ -147,7 +147,7 @@ pub fn empty_tm() -> Tm {
/// Returns the specified time in UTC
pub fn at_utc(clock: Timespec) -> Tm {
unsafe {
let mut Timespec { sec, nsec } = clock;
let Timespec { sec, nsec } = clock;
let mut tm = empty_tm();
rustrt::rust_gmtime(sec, nsec, &mut tm);
tm
@ -162,7 +162,7 @@ pub fn now_utc() -> Tm {
/// Returns the specified time in the local timezone
pub fn at(clock: Timespec) -> Tm {
unsafe {
let mut Timespec { sec, nsec } = clock;
let Timespec { sec, nsec } = clock;
let mut tm = empty_tm();
rustrt::rust_localtime(sec, nsec, &mut tm);
tm