Skip to content

Commit 9a259f4

Browse files
alexcrichtonalexcrichton
committed
Fix fallout of requiring uint indices
1 parent 46abacf commit 9a259f4

29 files changed

+118
-118
lines changed

‎src/libcollections/hashmap.rs

+9-9
Original file line numberDiff line numberDiff line change
@@ -1600,12 +1600,12 @@ mod test_map {
16001600

16011601
#[deriving(Hash, Eq, TotalEq)]
16021602
struct Dropable {
1603-
k: int
1603+
k: uint
16041604
}
16051605

16061606

16071607
impl Dropable {
1608-
fn new(k: int) -> Dropable {
1608+
fn new(k: uint) -> Dropable {
16091609
local_data::get_mut(drop_vector,
16101610
|v| { v.unwrap().as_mut_slice()[k] += 1; });
16111611

@@ -1628,24 +1628,24 @@ mod test_map {
16281628
let mut m = HashMap::new();
16291629

16301630
local_data::get(drop_vector, |v| {
1631-
for i in range(0, 200) {
1631+
for i in range(0u, 200) {
16321632
assert_eq!(v.unwrap().as_slice()[i], 0);
16331633
}
16341634
});
16351635

1636-
for i in range(0, 100) {
1636+
for i in range(0u, 100) {
16371637
let d1 = Dropable::new(i);
16381638
let d2 = Dropable::new(i+100);
16391639
m.insert(d1, d2);
16401640
}
16411641

16421642
local_data::get(drop_vector, |v| {
1643-
for i in range(0, 200) {
1643+
for i in range(0u, 200) {
16441644
assert_eq!(v.unwrap().as_slice()[i], 1);
16451645
}
16461646
});
16471647

1648-
for i in range(0, 50) {
1648+
for i in range(0u, 50) {
16491649
let k = Dropable::new(i);
16501650
let v = m.pop(&k);
16511651

@@ -1658,20 +1658,20 @@ mod test_map {
16581658
}
16591659

16601660
local_data::get(drop_vector, |v| {
1661-
for i in range(0, 50) {
1661+
for i in range(0u, 50) {
16621662
assert_eq!(v.unwrap().as_slice()[i], 0);
16631663
assert_eq!(v.unwrap().as_slice()[i+100], 0);
16641664
}
16651665

1666-
for i in range(50, 100) {
1666+
for i in range(50u, 100) {
16671667
assert_eq!(v.unwrap().as_slice()[i], 1);
16681668
assert_eq!(v.unwrap().as_slice()[i+100], 1);
16691669
}
16701670
});
16711671
}
16721672

16731673
local_data::get(drop_vector, |v| {
1674-
for i in range(0, 200) {
1674+
for i in range(0u, 200) {
16751675
assert_eq!(v.unwrap().as_slice()[i], 0);
16761676
}
16771677
});

‎src/libnative/io/timer_other.rs

+2-2
Original file line numberDiff line numberDiff line change
@@ -296,7 +296,7 @@ mod imp {
296296
}
297297

298298
pub fn fd_set(set: &mut fd_set, fd: i32) {
299-
set.fds_bits[fd / 32] |= 1 << (fd % 32);
299+
set.fds_bits[(fd / 32) as uint] |= 1 << (fd % 32);
300300
}
301301

302302
extern {
@@ -323,7 +323,7 @@ mod imp {
323323
}
324324

325325
pub fn fd_set(set: &mut fd_set, fd: i32) {
326-
set.fds_bits[fd / 64] |= (1 << (fd % 64)) as u64;
326+
set.fds_bits[(fd / 64) as uint] |= (1 << (fd % 64)) as u64;
327327
}
328328

329329
extern {

‎src/libnative/io/timer_win32.rs

+1-1
Original file line numberDiff line numberDiff line change
@@ -78,7 +78,7 @@ fn helper(input: libc::HANDLE, messages: Receiver<Req>) {
7878
}
7979
} else {
8080
let remove = {
81-
match &chans[idx - 1] {
81+
match &chans[idx as uint - 1] {
8282
&(ref c, oneshot) => !c.try_send(()) || oneshot
8383
}
8484
};

‎src/librand/isaac.rs

+4-4
Original file line numberDiff line numberDiff line change
@@ -103,7 +103,7 @@ impl IsaacRng {
103103
if use_rsl {
104104
macro_rules! memloop (
105105
($arr:expr) => {{
106-
for i in range_step(0u32, RAND_SIZE, 8) {
106+
for i in range_step(0, RAND_SIZE as uint, 8) {
107107
a+=$arr[i ]; b+=$arr[i+1];
108108
c+=$arr[i+2]; d+=$arr[i+3];
109109
e+=$arr[i+4]; f+=$arr[i+5];
@@ -120,7 +120,7 @@ impl IsaacRng {
120120
memloop!(self.rsl);
121121
memloop!(self.mem);
122122
} else {
123-
for i in range_step(0u32, RAND_SIZE, 8) {
123+
for i in range_step(0, RAND_SIZE as uint, 8) {
124124
mix!();
125125
self.mem[i ]=a; self.mem[i+1]=b;
126126
self.mem[i+2]=c; self.mem[i+3]=d;
@@ -143,7 +143,7 @@ impl IsaacRng {
143143
static MIDPOINT: uint = RAND_SIZE as uint / 2;
144144

145145
macro_rules! ind (($x:expr) => {
146-
self.mem[($x >> 2) & (RAND_SIZE - 1)]
146+
self.mem[(($x >> 2) & (RAND_SIZE - 1)) as uint]
147147
});
148148
macro_rules! rngstep(
149149
($j:expr, $shift:expr) => {{
@@ -188,7 +188,7 @@ impl Rng for IsaacRng {
188188
self.isaac();
189189
}
190190
self.cnt -= 1;
191-
self.rsl[self.cnt]
191+
self.rsl[self.cnt as uint]
192192
}
193193
}
194194

‎src/librustc/middle/ty.rs

+1-1
Original file line numberDiff line numberDiff line change
@@ -4365,7 +4365,7 @@ pub fn is_binopable(cx: &ctxt, ty: t, op: ast::BinOp) -> bool {
43654365
/*bot*/ [t, t, t, t, t, t, t, t],
43664366
/*raw ptr*/ [f, f, f, f, t, t, f, f]];
43674367

4368-
return tbl[tycat(cx, ty)][opcat(op)];
4368+
return tbl[tycat(cx, ty) as uint ][opcat(op) as uint];
43694369
}
43704370

43714371
pub fn ty_params_to_tys(tcx: &ctxt, generics: &ast::Generics) -> Vec<t> {

‎src/librustuv/net.rs

+4-4
Original file line numberDiff line numberDiff line change
@@ -791,7 +791,7 @@ mod test {
791791
Ok(10) => {} e => fail!("{:?}", e),
792792
}
793793
for i in range(0, 10u8) {
794-
assert_eq!(buf[i], i + 1);
794+
assert_eq!(buf[i as uint], i + 1);
795795
}
796796
}
797797
Err(e) => fail!("{:?}", e)
@@ -827,7 +827,7 @@ mod test {
827827
Ok(10) => {} e => fail!("{:?}", e),
828828
}
829829
for i in range(0, 10u8) {
830-
assert_eq!(buf[i], i + 1);
830+
assert_eq!(buf[i as uint], i + 1);
831831
}
832832
}
833833
Err(e) => fail!("{:?}", e)
@@ -859,7 +859,7 @@ mod test {
859859
e => fail!("{:?}", e),
860860
}
861861
for i in range(0, 10u8) {
862-
assert_eq!(buf[i], i + 1);
862+
assert_eq!(buf[i as uint], i + 1);
863863
}
864864
}
865865
Err(e) => fail!("{:?}", e)
@@ -891,7 +891,7 @@ mod test {
891891
e => fail!("{:?}", e),
892892
}
893893
for i in range(0, 10u8) {
894-
assert_eq!(buf[i], i + 1);
894+
assert_eq!(buf[i as uint], i + 1);
895895
}
896896
}
897897
Err(e) => fail!("{:?}", e)

‎src/libserialize/base64.rs

+9-9
Original file line numberDiff line numberDiff line change
@@ -99,10 +99,10 @@ impl<'a> ToBase64 for &'a [u8] {
9999
(self[i + 2] as u32);
100100

101101
// This 24-bit number gets separated into four 6-bit numbers.
102-
v.push(bytes[(n >> 18) & 63]);
103-
v.push(bytes[(n >> 12) & 63]);
104-
v.push(bytes[(n >> 6 ) & 63]);
105-
v.push(bytes[n & 63]);
102+
v.push(bytes[((n >> 18) & 63) as uint]);
103+
v.push(bytes[((n >> 12) & 63) as uint]);
104+
v.push(bytes[((n >> 6 ) & 63) as uint]);
105+
v.push(bytes[(n & 63) as uint]);
106106

107107
cur_length += 4;
108108
i += 3;
@@ -125,8 +125,8 @@ impl<'a> ToBase64 for &'a [u8] {
125125
0 => (),
126126
1 => {
127127
let n = (self[i] as u32) << 16;
128-
v.push(bytes[(n >> 18) & 63]);
129-
v.push(bytes[(n >> 12) & 63]);
128+
v.push(bytes[((n >> 18) & 63) as uint]);
129+
v.push(bytes[((n >> 12) & 63) as uint]);
130130
if config.pad {
131131
v.push('=' as u8);
132132
v.push('=' as u8);
@@ -135,9 +135,9 @@ impl<'a> ToBase64 for &'a [u8] {
135135
2 => {
136136
let n = (self[i] as u32) << 16 |
137137
(self[i + 1u] as u32) << 8;
138-
v.push(bytes[(n >> 18) & 63]);
139-
v.push(bytes[(n >> 12) & 63]);
140-
v.push(bytes[(n >> 6 ) & 63]);
138+
v.push(bytes[((n >> 18) & 63) as uint]);
139+
v.push(bytes[((n >> 12) & 63) as uint]);
140+
v.push(bytes[((n >> 6 ) & 63) as uint]);
141141
if config.pad {
142142
v.push('=' as u8);
143143
}

‎src/libserialize/hex.rs

+2-2
Original file line numberDiff line numberDiff line change
@@ -41,8 +41,8 @@ impl<'a> ToHex for &'a [u8] {
4141
fn to_hex(&self) -> ~str {
4242
let mut v = slice::with_capacity(self.len() * 2);
4343
for &byte in self.iter() {
44-
v.push(CHARS[byte >> 4]);
45-
v.push(CHARS[byte & 0xf]);
44+
v.push(CHARS[(byte >> 4) as uint]);
45+
v.push(CHARS[(byte & 0xf) as uint]);
4646
}
4747

4848
unsafe {

‎src/libstd/ascii.rs

+11-7
Original file line numberDiff line numberDiff line change
@@ -43,19 +43,19 @@ impl Ascii {
4343
/// Convert to lowercase.
4444
#[inline]
4545
pub fn to_lower(self) -> Ascii {
46-
Ascii{chr: ASCII_LOWER_MAP[self.chr]}
46+
Ascii{chr: ASCII_LOWER_MAP[self.chr as uint]}
4747
}
4848

4949
/// Convert to uppercase.
5050
#[inline]
5151
pub fn to_upper(self) -> Ascii {
52-
Ascii{chr: ASCII_UPPER_MAP[self.chr]}
52+
Ascii{chr: ASCII_UPPER_MAP[self.chr as uint]}
5353
}
5454

5555
/// Compares two ascii characters of equality, ignoring case.
5656
#[inline]
5757
pub fn eq_ignore_case(self, other: Ascii) -> bool {
58-
ASCII_LOWER_MAP[self.chr] == ASCII_LOWER_MAP[other.chr]
58+
ASCII_LOWER_MAP[self.chr as uint] == ASCII_LOWER_MAP[other.chr as uint]
5959
}
6060

6161
// the following methods are like ctype, and the implementation is inspired by musl
@@ -370,8 +370,12 @@ impl<'a> StrAsciiExt for &'a str {
370370

371371
#[inline]
372372
fn eq_ignore_ascii_case(&self, other: &str) -> bool {
373-
self.len() == other.len() && self.as_bytes().iter().zip(other.as_bytes().iter()).all(
374-
|(byte_self, byte_other)| ASCII_LOWER_MAP[*byte_self] == ASCII_LOWER_MAP[*byte_other])
373+
self.len() == other.len() &&
374+
self.as_bytes().iter().zip(other.as_bytes().iter()).all(
375+
|(byte_self, byte_other)| {
376+
ASCII_LOWER_MAP[*byte_self as uint] ==
377+
ASCII_LOWER_MAP[*byte_other as uint]
378+
})
375379
}
376380
}
377381

@@ -392,15 +396,15 @@ unsafe fn str_map_bytes(string: ~str, map: &'static [u8]) -> ~str {
392396
let mut bytes = string.into_bytes();
393397

394398
for b in bytes.mut_iter() {
395-
*b = map[*b];
399+
*b = map[*b as uint];
396400
}
397401

398402
str::raw::from_utf8_owned(bytes)
399403
}
400404

401405
#[inline]
402406
unsafe fn str_copy_map_bytes(string: &str, map: &'static [u8]) -> ~str {
403-
let bytes = string.bytes().map(|b| map[b]).collect::<~[_]>();
407+
let bytes = string.bytes().map(|b| map[b as uint]).collect::<~[_]>();
404408

405409
str::raw::from_utf8_owned(bytes)
406410
}

‎src/libstd/comm/mod.rs

+1-1
Original file line numberDiff line numberDiff line change
@@ -254,7 +254,7 @@ pub use comm::select::{Select, Handle};
254254
macro_rules! test (
255255
{ fn $name:ident() $b:block $(#[$a:meta])*} => (
256256
mod $name {
257-
#[allow(unused_imports)];
257+
#![allow(unused_imports)]
258258

259259
use native;
260260
use comm::*;

‎src/libstd/hash/sip.rs

+1-1
Original file line numberDiff line numberDiff line change
@@ -432,7 +432,7 @@ mod tests {
432432
assert!(f == i && f == v);
433433

434434
buf.push(t as u8);
435-
state_inc.write_u8(t);
435+
state_inc.write_u8(t as u8);
436436

437437
t += 1;
438438
}

‎src/libstd/io/test.rs

+1-1
Original file line numberDiff line numberDiff line change
@@ -21,7 +21,7 @@ use sync::atomics::{AtomicUint, INIT_ATOMIC_UINT, Relaxed};
2121
macro_rules! iotest (
2222
{ fn $name:ident() $b:block $(#[$a:meta])* } => (
2323
mod $name {
24-
#[allow(unused_imports)];
24+
#![allow(unused_imports)]
2525

2626
use super::super::*;
2727
use super::*;

‎src/libstd/num/mod.rs

+2-2
Original file line numberDiff line numberDiff line change
@@ -1655,7 +1655,7 @@ mod tests {
16551655
macro_rules! test_next_power_of_two(
16561656
($test_name:ident, $T:ident) => (
16571657
fn $test_name() {
1658-
#[test];
1658+
#![test]
16591659
assert_eq!(next_power_of_two::<$T>(0), 0);
16601660
let mut next_power = 1;
16611661
for i in range::<$T>(1, 40) {
@@ -1675,7 +1675,7 @@ mod tests {
16751675
macro_rules! test_checked_next_power_of_two(
16761676
($test_name:ident, $T:ident) => (
16771677
fn $test_name() {
1678-
#[test];
1678+
#![test]
16791679
assert_eq!(checked_next_power_of_two::<$T>(0), None);
16801680
let mut next_power = 1;
16811681
for i in range::<$T>(1, 40) {

‎src/libstd/num/strconv.rs

+6-6
Original file line numberDiff line numberDiff line change
@@ -411,23 +411,23 @@ pub fn float_to_str_bytes_common<T:NumCast+Zero+One+Eq+Ord+Float+Round+
411411
// If reached left end of number, have to
412412
// insert additional digit:
413413
if i < 0
414-
|| buf[i] == '-' as u8
415-
|| buf[i] == '+' as u8 {
414+
|| buf[i as uint] == '-' as u8
415+
|| buf[i as uint] == '+' as u8 {
416416
buf.insert((i + 1) as uint, value2ascii(1));
417417
break;
418418
}
419419

420420
// Skip the '.'
421-
if buf[i] == '.' as u8 { i -= 1; continue; }
421+
if buf[i as uint] == '.' as u8 { i -= 1; continue; }
422422

423423
// Either increment the digit,
424424
// or set to 0 if max and carry the 1.
425-
let current_digit = ascii2value(buf[i]);
425+
let current_digit = ascii2value(buf[i as uint]);
426426
if current_digit < (radix - 1) {
427-
buf[i] = value2ascii(current_digit+1);
427+
buf[i as uint] = value2ascii(current_digit+1);
428428
break;
429429
} else {
430-
buf[i] = value2ascii(0);
430+
buf[i as uint] = value2ascii(0);
431431
i -= 1;
432432
}
433433
}

‎src/libstd/slice.rs

+1-3
Original file line numberDiff line numberDiff line change
@@ -2922,8 +2922,6 @@ mod tests {
29222922

29232923
fn square(n: uint) -> uint { n * n }
29242924

2925-
fn square_ref(n: &uint) -> uint { square(*n) }
2926-
29272925
fn is_odd(n: &uint) -> bool { *n % 2u == 1u }
29282926

29292927
#[test]
@@ -4441,7 +4439,7 @@ mod bench {
44414439
unsafe {
44424440
v.set_len(1024);
44434441
}
4444-
for i in range(0, 1024) {
4442+
for i in range(0u, 1024) {
44454443
v[i] = 0;
44464444
}
44474445
});

0 commit comments

Comments
 (0)