squiid/rust
1
0
Fork 0
Code Issues Pull requests Projects Activity

remove int_uint feature from libcollections

Browse source
This commit is contained in:
Alexis 2015-02-05 15:08:33 -05:00 committed by Manish Goregaokar
parent c4e12c1536
commit 73b9aeb429
4 changed files with 12 additions and 12 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

6
src/libcollections/btree/set.rs
View file

@ -890,7 +890,7 @@ mod test {
fn test_from_iter() { fn test_from_iter() {
let xs = [1, 2, 3, 4, 5, 6, 7, 8, 9]; let xs = [1, 2, 3, 4, 5, 6, 7, 8, 9];
let set: BTreeSet<int> = xs.iter().map(|&x| x).collect(); let set: BTreeSet<_> = xs.iter().cloned().collect();
for x in &xs { for x in &xs {
assert!(set.contains(x)); assert!(set.contains(x));
@ -899,8 +899,8 @@ mod test {
#[test] #[test]
fn test_show() { fn test_show() {
let mut set: BTreeSet<int> = BTreeSet::new(); let mut set = BTreeSet::new();
let empty: BTreeSet<int> = BTreeSet::new(); let empty = BTreeSet::<i32>::new();
set.insert(1); set.insert(1);
set.insert(2); set.insert(2);

4
src/libcollections/slice.rs
View file

@ -1575,7 +1575,7 @@ mod tests {
#[test] #[test]
fn test_is_empty() { fn test_is_empty() {
let xs: [int; 0] = []; let xs: [i32; 0] = [];
assert!(xs.is_empty()); assert!(xs.is_empty());
assert!(![0].is_empty()); assert!(![0].is_empty());
} }
@ -1913,7 +1913,7 @@ mod tests {
#[test] #[test]
fn test_permutations() { fn test_permutations() {
{ {
let v: [int; 0] = []; let v: [i32; 0] = [];
let mut it = v.permutations(); let mut it = v.permutations();
let (min_size, max_opt) = it.size_hint(); let (min_size, max_opt) = it.size_hint();
assert_eq!(min_size, 1); assert_eq!(min_size, 1);

10
src/libcollections/vec.rs
View file

@ -2146,10 +2146,10 @@ mod tests {
#[test] #[test]
fn test_partition() { fn test_partition() {
assert_eq!(vec![].into_iter().partition(|x: &int| *x < 3), (vec![], vec![])); assert_eq!(vec![].into_iter().partition(|x: &i32| *x < 3), (vec![], vec![]));
assert_eq!(vec![1, 2, 3].into_iter().partition(|x: &int| *x < 4), (vec![1, 2, 3], vec![])); assert_eq!(vec![1, 2, 3].into_iter().partition(|x| *x < 4), (vec![1, 2, 3], vec![]));
assert_eq!(vec![1, 2, 3].into_iter().partition(|x: &int| *x < 2), (vec![1], vec![2, 3])); assert_eq!(vec![1, 2, 3].into_iter().partition(|x| *x < 2), (vec![1], vec![2, 3]));
assert_eq!(vec![1, 2, 3].into_iter().partition(|x: &int| *x < 0), (vec![], vec![1, 2, 3])); assert_eq!(vec![1, 2, 3].into_iter().partition(|x| *x < 0), (vec![], vec![1, 2, 3]));
} }
#[test] #[test]
@ -2183,7 +2183,7 @@ mod tests {
#[test] #[test]
fn test_vec_truncate_drop() { fn test_vec_truncate_drop() {
static mut drops: u32 = 0; static mut drops: u32 = 0;
struct Elem(int); struct Elem(i32);
impl Drop for Elem { impl Drop for Elem {
fn drop(&mut self) { fn drop(&mut self) {
unsafe { drops += 1; } unsafe { drops += 1; }

4
src/libcollections/vec_map.rs
View file

@ -1053,7 +1053,7 @@ mod test_map {
assert!(m.insert(10, 11).is_none()); assert!(m.insert(10, 11).is_none());
for (k, v) in &mut m { for (k, v) in &mut m {
*v += k as int; *v += k as isize;
} }
let mut it = m.iter(); let mut it = m.iter();
@ -1095,7 +1095,7 @@ mod test_map {
assert!(m.insert(10, 11).is_none()); assert!(m.insert(10, 11).is_none());
for (k, v) in m.iter_mut().rev() { for (k, v) in m.iter_mut().rev() {
*v += k as int; *v += k as isize;
} }
let mut it = m.iter(); let mut it = m.iter();