use std::io::timer;
use std::io;
use std::os;
+use std::iter::repeat;
use std::str;
use std::string::String;
use std::thread::Thread;
proc_res: &ProcRes) {
// true if we found the error in question
- let mut found_flags = Vec::from_elem(
- expected_errors.len(), false);
+ let mut found_flags: Vec<_> = repeat(false).take(expected_errors.len()).collect();
if proc_res.status.success() {
fatal("process did not return an error status");
// Add the arguments in the run_flags directive
args.extend(split_maybe_args(&props.run_flags).into_iter());
- let prog = args.remove(0).unwrap();
+ let prog = args.remove(0);
return ProcArgs {
prog: prog,
args: args,
/// use std::thread::Thread;
///
/// fn main() {
-/// let numbers = Vec::from_fn(100, |i| i as f32);
+/// let numbers: Vec<_> = range(0, 100u32).map(|i| i as f32).collect();
/// let shared_numbers = Arc::new(numbers);
///
/// for _ in range(0u, 10) {
//! // for a simpler implementation.
//! fn shortest_path(adj_list: &Vec<Vec<Edge>>, start: uint, goal: uint) -> uint {
//! // dist[node] = current shortest distance from `start` to `node`
-//! let mut dist = Vec::from_elem(adj_list.len(), uint::MAX);
+//! let mut dist: Vec<_> = range(0, adj_list.len()).map(|_| uint::MAX).collect();
//!
//! let mut heap = BinaryHeap::new();
//!
use core::cmp;
use core::default::Default;
use core::fmt;
-use core::iter::{Cloned, Chain, Enumerate, Repeat, Skip, Take};
+use core::iter::{Cloned, Chain, Enumerate, Repeat, Skip, Take, repeat};
use core::iter;
use core::num::Int;
use core::slice::{Iter, IterMut};
pub fn from_elem(nbits: uint, bit: bool) -> Bitv {
let nblocks = blocks_for_bits(nbits);
let mut bitv = Bitv {
- storage: Vec::from_elem(nblocks, if bit { !0u32 } else { 0u32 }),
+ storage: repeat(if bit { !0u32 } else { 0u32 }).take(nblocks).collect(),
nbits: nbits
};
bitv.fix_last_block();
let len = self.nbits/8 +
if self.nbits % 8 == 0 { 0 } else { 1 };
- Vec::from_fn(len, |i|
+ range(0, len).map(|i|
bit(self, i, 0) |
bit(self, i, 1) |
bit(self, i, 2) |
bit(self, i, 5) |
bit(self, i, 6) |
bit(self, i, 7)
- )
+ ).collect()
}
/// Deprecated: Use `iter().collect()`.
// Allocate new words, if needed
if new_nblocks > self.storage.len() {
let to_add = new_nblocks - self.storage.len();
- self.storage.grow(to_add, full_value);
+ self.storage.extend(repeat(full_value).take(to_add));
}
// Adjust internal bit count
let node = mem::replace(left_and_out, unsafe { Node::new_internal(capacity_from_b(b)) });
left_and_out._len = 1;
unsafe {
- ptr::write(left_and_out.keys_mut().unsafe_mut(0), key);
- ptr::write(left_and_out.vals_mut().unsafe_mut(0), value);
- ptr::write(left_and_out.edges_mut().unsafe_mut(0), node);
- ptr::write(left_and_out.edges_mut().unsafe_mut(1), right);
+ ptr::write(left_and_out.keys_mut().get_unchecked_mut(0), key);
+ ptr::write(left_and_out.vals_mut().get_unchecked_mut(0), value);
+ ptr::write(left_and_out.edges_mut().get_unchecked_mut(0), node);
+ ptr::write(left_and_out.edges_mut().get_unchecked_mut(1), right);
}
}
/// making it more suitable for moving down a chain of nodes.
pub fn into_edge(self) -> &'a Node<K, V> {
unsafe {
- self.node.edges().unsafe_get(self.index)
+ self.node.edges().get_unchecked(self.index)
}
}
}
/// `edge_mut`, making it more suitable for moving down a chain of nodes.
pub fn into_edge_mut(self) -> &'a mut Node<K, V> {
unsafe {
- self.node.edges_mut().unsafe_mut(self.index)
+ self.node.edges_mut().get_unchecked_mut(self.index)
}
}
}
/// confused with `node`, which references the parent node of what is returned here.
pub fn edge_mut(&mut self) -> &mut Node<K, V> {
unsafe {
- self.node.edges_mut().unsafe_mut(self.index)
+ self.node.edges_mut().get_unchecked_mut(self.index)
}
}
let (keys, vals) = self.node.as_slices();
unsafe {
(
- keys.unsafe_get(self.index),
- vals.unsafe_get(self.index)
+ keys.get_unchecked(self.index),
+ vals.get_unchecked(self.index)
)
}
}
let (keys, vals) = self.node.as_slices_mut();
unsafe {
(
- keys.unsafe_mut(self.index),
- vals.unsafe_mut(self.index)
+ keys.get_unchecked_mut(self.index),
+ vals.get_unchecked_mut(self.index)
)
}
}
// /// reference with a lifetime as large as `into_kv_mut`, but it also does not consume the
// /// handle.
// pub fn key(&'a self) -> &'a K {
- // unsafe { self.node.keys().unsafe_get(self.index) }
+ // unsafe { self.node.keys().get_unchecked(self.index) }
// }
//
// /// Returns a reference to the value pointed-to by this handle. This doesn't return a
// /// reference with a lifetime as large as `into_kv_mut`, but it also does not consume the
// /// handle.
// pub fn val(&'a self) -> &'a V {
- // unsafe { self.node.vals().unsafe_get(self.index) }
+ // unsafe { self.node.vals().get_unchecked(self.index) }
// }
}
/// reference with a lifetime as large as `into_kv_mut`, but it also does not consume the
/// handle.
pub fn key_mut(&'a mut self) -> &'a mut K {
- unsafe { self.node.keys_mut().unsafe_mut(self.index) }
+ unsafe { self.node.keys_mut().get_unchecked_mut(self.index) }
}
/// Returns a mutable reference to the value pointed-to by this handle. This doesn't return a
/// reference with a lifetime as large as `into_kv_mut`, but it also does not consume the
/// handle.
pub fn val_mut(&'a mut self) -> &'a mut V {
- unsafe { self.node.vals_mut().unsafe_mut(self.index) }
+ unsafe { self.node.vals_mut().get_unchecked_mut(self.index) }
}
}
debug_assert!(!self.is_leaf());
unsafe {
- let ret = ptr::read(self.edges().unsafe_get(0));
+ let ret = ptr::read(self.edges().get_unchecked(0));
self.destroy();
ptr::write(self, ret);
}
unsafe fn push_kv(&mut self, key: K, val: V) {
let len = self.len();
- ptr::write(self.keys_mut().unsafe_mut(len), key);
- ptr::write(self.vals_mut().unsafe_mut(len), val);
+ ptr::write(self.keys_mut().get_unchecked_mut(len), key);
+ ptr::write(self.vals_mut().get_unchecked_mut(len), val);
self._len += 1;
}
unsafe fn push_edge(&mut self, edge: Node<K, V>) {
let len = self.len();
- ptr::write(self.edges_mut().unsafe_mut(len), edge);
+ ptr::write(self.edges_mut().get_unchecked_mut(len), edge);
}
// This must be followed by insert_edge on an internal node.
self.len() - index
);
- ptr::write(self.keys_mut().unsafe_mut(index), key);
- ptr::write(self.vals_mut().unsafe_mut(index), val);
+ ptr::write(self.keys_mut().get_unchecked_mut(index), key);
+ ptr::write(self.vals_mut().get_unchecked_mut(index), val);
self._len += 1;
- self.vals_mut().unsafe_mut(index)
+ self.vals_mut().get_unchecked_mut(index)
}
// This can only be called immediately after a call to insert_kv.
self.edges().as_ptr().offset(index as int),
self.len() - index
);
- ptr::write(self.edges_mut().unsafe_mut(index), edge);
+ ptr::write(self.edges_mut().get_unchecked_mut(index), edge);
}
// This must be followed by pop_edge on an internal node.
#[inline]
unsafe fn pop_kv(&mut self) -> (K, V) {
- let key = ptr::read(self.keys().unsafe_get(self.len() - 1));
- let val = ptr::read(self.vals().unsafe_get(self.len() - 1));
+ let key = ptr::read(self.keys().get_unchecked(self.len() - 1));
+ let val = ptr::read(self.vals().get_unchecked(self.len() - 1));
self._len -= 1;
// This can only be called immediately after a call to pop_kv.
#[inline]
unsafe fn pop_edge(&mut self) -> Node<K, V> {
- let edge = ptr::read(self.edges().unsafe_get(self.len() + 1));
+ let edge = ptr::read(self.edges().get_unchecked(self.len() + 1));
edge
}
// This must be followed by remove_edge on an internal node.
#[inline]
unsafe fn remove_kv(&mut self, index: uint) -> (K, V) {
- let key = ptr::read(self.keys().unsafe_get(index));
- let val = ptr::read(self.vals().unsafe_get(index));
+ let key = ptr::read(self.keys().get_unchecked(index));
+ let val = ptr::read(self.vals().get_unchecked(index));
ptr::copy_memory(
self.keys_mut().as_mut_ptr().offset(index as int),
// This can only be called immediately after a call to remove_kv.
#[inline]
unsafe fn remove_edge(&mut self, index: uint) -> Node<K, V> {
- let edge = ptr::read(self.edges().unsafe_get(index));
+ let edge = ptr::read(self.edges().get_unchecked(index));
ptr::copy_memory(
self.edges_mut().as_mut_ptr().offset(index as int),
);
}
- let key = ptr::read(self.keys().unsafe_get(right_offset - 1));
- let val = ptr::read(self.vals().unsafe_get(right_offset - 1));
+ let key = ptr::read(self.keys().get_unchecked(right_offset - 1));
+ let val = ptr::read(self.vals().get_unchecked(right_offset - 1));
self._len = right_offset - 1;
let old_len = self.len();
self._len += right.len() + 1;
- ptr::write(self.keys_mut().unsafe_mut(old_len), key);
- ptr::write(self.vals_mut().unsafe_mut(old_len), val);
+ ptr::write(self.keys_mut().get_unchecked_mut(old_len), key);
+ ptr::write(self.vals_mut().get_unchecked_mut(old_len), val);
ptr::copy_nonoverlapping_memory(
self.keys_mut().as_mut_ptr().offset(old_len as int + 1),
v.pop();
}
1 => {
- m.pop_front();
- v.remove(0);
+ if !v.is_empty() {
+ m.pop_front();
+ v.remove(0);
+ }
}
2 | 4 => {
m.push_front(-i);
pub use unicode::char::UnicodeChar;
// from collections.
- pub use slice::{CloneSliceExt, VectorVector};
- pub use str::{IntoMaybeOwned, StrVector};
+ pub use slice::{CloneSliceExt, SliceConcatExt};
+ pub use str::IntoMaybeOwned;
pub use string::{String, ToString};
pub use vec::Vec;
}
}
let tail = self.tail;
self.tail = wrap_index(self.tail + 1, self.ring.len());
- unsafe { Some(self.ring.unsafe_get(tail)) }
+ unsafe { Some(self.ring.get_unchecked(tail)) }
}
#[inline]
return None;
}
self.head = wrap_index(self.head - 1, self.ring.len());
- unsafe { Some(self.ring.unsafe_get(self.head)) }
+ unsafe { Some(self.ring.get_unchecked(self.head)) }
}
}
None
} else {
let idx = wrap_index(self.tail + j, self.ring.len());
- unsafe { Some(self.ring.unsafe_get(idx)) }
+ unsafe { Some(self.ring.get_unchecked(idx)) }
}
}
}
use core::mem;
use core::ops::{FnMut,SliceMut};
use core::prelude::{Clone, Greater, Iterator, IteratorExt, Less, None, Option};
-use core::prelude::{Ord, Ordering, RawPtr, Some, range, IteratorCloneExt, Result};
+use core::prelude::{Ord, Ordering, PtrExt, Some, range, IteratorCloneExt, Result};
use core::ptr;
use core::slice as core_slice;
use self::Direction::*;
use vec::Vec;
-pub use core::slice::{Chunks, AsSlice, SplitN, Windows};
+pub use core::slice::{Chunks, AsSlice, Windows};
pub use core::slice::{Iter, IterMut, PartialEqSliceExt};
pub use core::slice::{IntSliceExt, SplitMut, ChunksMut, Split};
pub use core::slice::{SplitN, RSplitN, SplitNMut, RSplitNMut};
pub use core::slice::{bytes, mut_ref_slice, ref_slice};
pub use core::slice::{from_raw_buf, from_raw_mut_buf};
+#[deprecated = "use Iter instead"]
+pub type Items<'a, T:'a> = Iter<'a, T>;
+
+#[deprecated = "use IterMut instead"]
+pub type MutItems<'a, T:'a> = IterMut<'a, T>;
+
////////////////////////////////////////////////////////////////////////////////
// Basic slice extension methods
////////////////////////////////////////////////////////////////////////////////
use prelude::{Some, None, range, Vec, ToString, Clone, Greater, Less, Equal};
use prelude::{SliceExt, Iterator, IteratorExt, DoubleEndedIteratorExt};
use prelude::{OrdSliceExt, CloneSliceExt, PartialEqSliceExt, AsSlice};
- use prelude::{RandomAccessIterator, Ord, VectorVector};
+ use prelude::{RandomAccessIterator, Ord, SliceConcatExt};
use core::cell::Cell;
use core::default::Default;
use core::mem;
fn test_swap_remove() {
let mut v = vec![1i, 2, 3, 4, 5];
let mut e = v.swap_remove(0);
- assert_eq!(e, Some(1));
+ assert_eq!(e, 1);
assert_eq!(v, vec![5i, 2, 3, 4]);
e = v.swap_remove(3);
- assert_eq!(e, Some(4));
+ assert_eq!(e, 4);
assert_eq!(v, vec![5i, 2, 3]);
+ }
- e = v.swap_remove(3);
- assert_eq!(e, None);
- assert_eq!(v, vec![5i, 2, 3]);
+ #[test]
+ #[should_fail]
+ fn test_swap_remove_fail() {
+ let mut v = vec![1i];
+ let _ = v.swap_remove(0);
+ let _ = v.swap_remove(0);
}
#[test]
}
#[test]
- fn test_binary_search_elem() {
- assert_eq!([1i,2,3,4,5].binary_search_elem(&5).found(), Some(4));
- assert_eq!([1i,2,3,4,5].binary_search_elem(&4).found(), Some(3));
- assert_eq!([1i,2,3,4,5].binary_search_elem(&3).found(), Some(2));
- assert_eq!([1i,2,3,4,5].binary_search_elem(&2).found(), Some(1));
- assert_eq!([1i,2,3,4,5].binary_search_elem(&1).found(), Some(0));
+ fn test_binary_search() {
+ assert_eq!([1i,2,3,4,5].binary_search(&5).ok(), Some(4));
+ assert_eq!([1i,2,3,4,5].binary_search(&4).ok(), Some(3));
+ assert_eq!([1i,2,3,4,5].binary_search(&3).ok(), Some(2));
+ assert_eq!([1i,2,3,4,5].binary_search(&2).ok(), Some(1));
+ assert_eq!([1i,2,3,4,5].binary_search(&1).ok(), Some(0));
- assert_eq!([2i,4,6,8,10].binary_search_elem(&1).found(), None);
- assert_eq!([2i,4,6,8,10].binary_search_elem(&5).found(), None);
- assert_eq!([2i,4,6,8,10].binary_search_elem(&4).found(), Some(1));
- assert_eq!([2i,4,6,8,10].binary_search_elem(&10).found(), Some(4));
+ assert_eq!([2i,4,6,8,10].binary_search(&1).ok(), None);
+ assert_eq!([2i,4,6,8,10].binary_search(&5).ok(), None);
+ assert_eq!([2i,4,6,8,10].binary_search(&4).ok(), Some(1));
+ assert_eq!([2i,4,6,8,10].binary_search(&10).ok(), Some(4));
- assert_eq!([2i,4,6,8].binary_search_elem(&1).found(), None);
- assert_eq!([2i,4,6,8].binary_search_elem(&5).found(), None);
- assert_eq!([2i,4,6,8].binary_search_elem(&4).found(), Some(1));
- assert_eq!([2i,4,6,8].binary_search_elem(&8).found(), Some(3));
+ assert_eq!([2i,4,6,8].binary_search(&1).ok(), None);
+ assert_eq!([2i,4,6,8].binary_search(&5).ok(), None);
+ assert_eq!([2i,4,6,8].binary_search(&4).ok(), Some(1));
+ assert_eq!([2i,4,6,8].binary_search(&8).ok(), Some(3));
- assert_eq!([2i,4,6].binary_search_elem(&1).found(), None);
- assert_eq!([2i,4,6].binary_search_elem(&5).found(), None);
- assert_eq!([2i,4,6].binary_search_elem(&4).found(), Some(1));
- assert_eq!([2i,4,6].binary_search_elem(&6).found(), Some(2));
+ assert_eq!([2i,4,6].binary_search(&1).ok(), None);
+ assert_eq!([2i,4,6].binary_search(&5).ok(), None);
+ assert_eq!([2i,4,6].binary_search(&4).ok(), Some(1));
+ assert_eq!([2i,4,6].binary_search(&6).ok(), Some(2));
- assert_eq!([2i,4].binary_search_elem(&1).found(), None);
- assert_eq!([2i,4].binary_search_elem(&5).found(), None);
- assert_eq!([2i,4].binary_search_elem(&2).found(), Some(0));
- assert_eq!([2i,4].binary_search_elem(&4).found(), Some(1));
+ assert_eq!([2i,4].binary_search(&1).ok(), None);
+ assert_eq!([2i,4].binary_search(&5).ok(), None);
+ assert_eq!([2i,4].binary_search(&2).ok(), Some(0));
+ assert_eq!([2i,4].binary_search(&4).ok(), Some(1));
- assert_eq!([2i].binary_search_elem(&1).found(), None);
- assert_eq!([2i].binary_search_elem(&5).found(), None);
- assert_eq!([2i].binary_search_elem(&2).found(), Some(0));
+ assert_eq!([2i].binary_search(&1).ok(), None);
+ assert_eq!([2i].binary_search(&5).ok(), None);
+ assert_eq!([2i].binary_search(&2).ok(), Some(0));
- assert_eq!([].binary_search_elem(&1i).found(), None);
- assert_eq!([].binary_search_elem(&5i).found(), None);
+ assert_eq!([].binary_search(&1i).ok(), None);
+ assert_eq!([].binary_search(&5i).ok(), None);
- assert!([1i,1,1,1,1].binary_search_elem(&1).found() != None);
- assert!([1i,1,1,1,2].binary_search_elem(&1).found() != None);
- assert!([1i,1,1,2,2].binary_search_elem(&1).found() != None);
- assert!([1i,1,2,2,2].binary_search_elem(&1).found() != None);
- assert_eq!([1i,2,2,2,2].binary_search_elem(&1).found(), Some(0));
+ assert!([1i,1,1,1,1].binary_search(&1).ok() != None);
+ assert!([1i,1,1,1,2].binary_search(&1).ok() != None);
+ assert!([1i,1,1,2,2].binary_search(&1).ok() != None);
+ assert!([1i,1,2,2,2].binary_search(&1).ok() != None);
+ assert_eq!([1i,2,2,2,2].binary_search(&1).ok(), Some(0));
- assert_eq!([1i,2,3,4,5].binary_search_elem(&6).found(), None);
- assert_eq!([1i,2,3,4,5].binary_search_elem(&0).found(), None);
+ assert_eq!([1i,2,3,4,5].binary_search(&6).ok(), None);
+ assert_eq!([1i,2,3,4,5].binary_search(&0).ok(), None);
}
#[test]
#[test]
fn test_concat() {
let v: [Vec<int>, ..0] = [];
- assert_eq!(v.concat_vec(), vec![]);
- assert_eq!([vec![1i], vec![2i,3i]].concat_vec(), vec![1, 2, 3]);
+ let c: Vec<int> = v.concat();
+ assert_eq!(c, []);
+ let d: Vec<int> = [vec![1i], vec![2i,3i]].concat();
+ assert_eq!(d, vec![1i, 2, 3]);
let v: [&[int], ..2] = [&[1], &[2, 3]];
- assert_eq!(v.connect_vec(&0), vec![1, 0, 2, 3]);
- let v: [&[int], ..3] = [&[1], &[2], &[3]];
- assert_eq!(v.connect_vec(&0), vec![1, 0, 2, 0, 3]);
+ assert_eq!(v.connect(&0), vec![1i, 0, 2, 3]);
+ let v: [&[int], ..3] = [&[1i], &[2], &[3]];
+ assert_eq!(v.connect(&0), vec![1i, 0, 2, 0, 3]);
}
#[test]
fn test_remove() {
let mut a = vec![1i,2,3,4];
- assert_eq!(a.remove(2), Some(3));
+ assert_eq!(a.remove(2), 3);
assert_eq!(a, vec![1i,2,4]);
- assert_eq!(a.remove(2), Some(4));
- assert_eq!(a, vec![1i,2]);
-
- assert_eq!(a.remove(2), None);
+ assert_eq!(a.remove(2), 4);
assert_eq!(a, vec![1i,2]);
- assert_eq!(a.remove(0), Some(1));
+ assert_eq!(a.remove(0), 1);
assert_eq!(a, vec![2i]);
- assert_eq!(a.remove(0), Some(2));
+ assert_eq!(a.remove(0), 2);
assert_eq!(a, vec![]);
+ }
- assert_eq!(a.remove(0), None);
- assert_eq!(a.remove(10), None);
+ #[test]
+ #[should_fail]
+ fn test_remove_fail() {
+ let mut a = vec![1i];
+ let _ = a.remove(0);
+ let _ = a.remove(0);
}
#[test]
let xss: Vec<Vec<uint>> =
Vec::from_fn(100, |i| range(0u, i).collect());
b.iter(|| {
- xss.as_slice().concat_vec()
+ xss.as_slice().concat();
});
}
impl<S: Str> SliceConcatExt<str, String> for [S] {
fn concat(&self) -> String {
- if self.is_empty() {
+ let s = self.as_slice();
+
+ if s.is_empty() {
return String::new();
}
// `len` calculation may overflow but push_str will check boundaries
- let len = self.iter().map(|s| s.as_slice().len()).sum();
-
+ let len = s.iter().map(|s| s.as_slice().len()).sum();
let mut result = String::with_capacity(len);
- for s in self.iter() {
- result.push_str(s.as_slice());
+ for s in s.iter() {
+ result.push_str(s.as_slice())
}
result
}
fn connect(&self, sep: &str) -> String {
- if self.is_empty() {
+ let s = self.as_slice();
+
+ if s.is_empty() {
return String::new();
}
// concat is faster
if sep.is_empty() {
- return self.concat();
+ return s.concat();
}
// this is wrong without the guarantee that `self` is non-empty
// `len` calculation may overflow but push_str but will check boundaries
- let len = sep.len() * (self.len() - 1)
- + self.iter().map(|s| s.as_slice().len()).sum();
+ let len = sep.len() * (s.len() - 1)
+ + s.iter().map(|s| s.as_slice().len()).sum();
let mut result = String::with_capacity(len);
let mut first = true;
- for s in self.iter() {
+ for s in s.iter() {
if first {
first = false;
} else {
}
}
-impl<S: Str> SliceConcatExt<str, String> for Vec<S> {
- fn concat(&self) -> String { self[].concat() }
- fn connect(&self, sep: &str) -> String { self[].connect(sep) }
-}
-
/*
Section: Iterators
*/
impl<'a> Iterator<char> for Decompositions<'a> {
#[inline]
fn next(&mut self) -> Option<char> {
- match self.buffer.head() {
+ match self.buffer.first() {
Some(&(c, 0)) => {
self.sorted = false;
self.buffer.remove(0);
self.sorted = true;
}
- match self.buffer.remove(0) {
- Some((c, 0)) => {
- self.sorted = false;
- Some(c)
+ if self.buffer.is_empty() {
+ None
+ } else {
+ match self.buffer.remove(0) {
+ (c, 0) => {
+ self.sorted = false;
+ Some(c)
+ }
+ (c, _) => Some(c),
}
- Some((c, _)) => Some(c),
- None => None
}
}
if me.is_empty() { return t.chars().count(); }
if t.is_empty() { return me.chars().count(); }
- let mut dcol = Vec::from_fn(t.len() + 1, |x| x);
+ let mut dcol: Vec<_> = range(0, t.len() + 1).collect();
let mut t_last = 0;
for (i, sc) in me.chars().enumerate() {
assert_eq!("ะเทศไท", "ประเทศไทย中华Việt Nam".slice_chars(2, 8));
}
- struct S {
- x: [String, .. 2]
- }
-
- impl AsSlice<String> for S {
- fn as_slice<'a> (&'a self) -> &'a [String] {
- &self.x
- }
- }
-
fn s(x: &str) -> String { x.into_string() }
macro_rules! test_concat {
($expected: expr, $string: expr) => {
{
- let s = $string.concat();
+ let s: String = $string.concat();
assert_eq!($expected, s);
}
}
#[test]
fn test_concat_for_different_types() {
- test_concat!("ab", ["a", "b"]);
- test_concat!("ab", [s("a"), s("b")]);
+ test_concat!("ab", vec![s("a"), s("b")]);
test_concat!("ab", vec!["a", "b"]);
test_concat!("ab", vec!["a", "b"].as_slice());
test_concat!("ab", vec![s("a"), s("b")]);
-
- let mut v0 = ["a", "b"];
- let mut v1 = [s("a"), s("b")];
- unsafe {
- use std::c_vec::CVec;
-
- test_concat!("ab", CVec::new(v0.as_mut_ptr(), v0.len()));
- test_concat!("ab", CVec::new(v1.as_mut_ptr(), v1.len()));
- }
-
- test_concat!("ab", S { x: [s("a"), s("b")] });
}
#[test]
test_connect!("a-b", vec!["a", "b"], hyphen.as_slice());
test_connect!("a-b", vec!["a", "b"].as_slice(), "-");
test_connect!("a-b", vec![s("a"), s("b")], "-");
-
- let mut v0 = ["a", "b"];
- let mut v1 = [s("a"), s("b")];
- unsafe {
- use std::c_vec::CVec;
-
- test_connect!("a-b", CVec::new(v0.as_mut_ptr(), v0.len()), "-");
- test_connect!("a-b", CVec::new(v1.as_mut_ptr(), v1.len()), hyphen.as_slice());
- }
-
- test_connect!("a-b", S { x: [s("a"), s("b")] }, "-");
}
#[test]
#[cfg(test)]
mod bench {
use super::*;
- use prelude::{SliceExt, IteratorExt, DoubleEndedIteratorExt};
+ use prelude::{SliceExt, IteratorExt, DoubleEndedIteratorExt, SliceConcatExt};
use test::Bencher;
use test::black_box;
fn bench_connect(b: &mut Bencher) {
let s = "ศไทย中华Việt Nam; Mary had a little lamb, Little lamb";
let sep = "→";
- let v = [s, s, s, s, s, s, s, s, s, s];
+ let v = vec![s, s, s, s, s, s, s, s, s, s];
b.iter(|| {
assert_eq!(v.connect(sep).len(), s.len() * 10 + sep.len() * 9);
})
let mut i = 0;
let total = v.len();
fn unsafe_get(xs: &[u8], i: uint) -> u8 {
- unsafe { *xs.unsafe_get(i) }
+ unsafe { *xs.get_unchecked(i) }
}
fn safe_get(xs: &[u8], i: uint, total: uint) -> u8 {
if i >= total {
///
/// It is important to note that this function does not specify the *length* of the returned
/// vector, but only the *capacity*. (For an explanation of the difference between length and
- /// capacity, see the main `Vec<T>` docs above, 'Capacity and reallocation'.) To create a
- /// vector of a given length, use `Vec::from_elem` or `Vec::from_fn`.
+ /// capacity, see the main `Vec<T>` docs above, 'Capacity and reallocation'.)
///
/// # Examples
///
/// Deprecated: use `into_iter().partition(f)` instead.
#[inline]
#[deprecated = "use into_iter().partition(f) instead"]
- pub fn partition<F>(self, mut f: F) -> (Vec<T>, Vec<T>) where F: FnMut(&T) -> bool {
+ pub fn partition<F>(self, f: F) -> (Vec<T>, Vec<T>) where F: FnMut(&T) -> bool {
self.into_iter().partition(f)
}
}
/// Reserves capacity for at least `additional` more elements to be inserted in the given
- /// `Vec`. The collection may reserve more space to avoid frequent reallocations.
+ /// `Vec<T>`. The collection may reserve more space to avoid frequent reallocations.
///
/// # Panics
///
}
/// Reserves the minimum capacity for exactly `additional` more elements to
- /// be inserted in the given `Vec`. Does nothing if the capacity is already
+ /// be inserted in the given `Vec<T>`. Does nothing if the capacity is already
/// sufficient.
///
/// Note that the allocator may give the collection more space than it
}
}
- /// Shrinks the capacity of the vector as much as possible. It will drop
- /// down as close as possible to the length but the allocator may still
- /// inform the vector that there is space for a few more elements.
+ /// Shrinks the capacity of the vector as much as possible.
+ ///
+ /// It will drop down as close as possible to the length but the allocator
+ /// may still inform the vector that there is space for a few more elements.
///
/// # Examples
///
if self.len == 0 {
if self.cap != 0 {
unsafe {
- dealloc(self.ptr, self.cap)
+ dealloc(*self.ptr, self.cap)
}
self.cap = 0;
}
unsafe {
// Overflow check is unnecessary as the vector is already at
// least this large.
- self.ptr = reallocate(self.ptr as *mut u8,
- self.cap * mem::size_of::<T>(),
- self.len * mem::size_of::<T>(),
- mem::min_align_of::<T>()) as *mut T;
- if self.ptr.is_null() { ::alloc::oom() }
+ let ptr = reallocate(*self.ptr as *mut u8,
+ self.cap * mem::size_of::<T>(),
+ self.len * mem::size_of::<T>(),
+ mem::min_align_of::<T>()) as *mut T;
+ if ptr.is_null() { ::alloc::oom() }
+ self.ptr = NonZero::new(ptr);
}
self.cap = self.len;
}
pub fn as_mut_slice<'a>(&'a mut self) -> &'a mut [T] {
unsafe {
mem::transmute(RawSlice {
- data: self.ptr as *const T,
+ data: *self.ptr as *const T,
len: self.len,
})
}
}
- /// Creates a consuming iterator, that is, one that moves each
- /// value out of the vector (from start to end). The vector cannot
- /// be used after calling this.
+ /// Creates a consuming iterator, that is, one that moves each value out of
+ /// the vector (from start to end). The vector cannot be used after calling
+ /// this.
///
/// # Examples
///
#[stable]
pub fn into_iter(self) -> IntoIter<T> {
unsafe {
- let ptr = self.ptr;
+ let ptr = *self.ptr;
let cap = self.cap;
- let begin = self.ptr as *const T;
+ let begin = ptr as *const T;
let end = if mem::size_of::<T>() == 0 {
(ptr as uint + self.len()) as *const T
} else {
/// ```
/// let mut v = vec!["foo", "bar", "baz", "qux"];
///
- /// assert_eq!(v.swap_remove(1), Some("bar"));
+ /// assert_eq!(v.swap_remove(1), "bar");
/// assert_eq!(v, vec!["foo", "qux", "baz"]);
///
- /// assert_eq!(v.swap_remove(0), Some("foo"));
+ /// assert_eq!(v.swap_remove(0), "foo");
/// assert_eq!(v, vec!["baz", "qux"]);
- ///
- /// assert_eq!(v.swap_remove(2), None);
/// ```
#[inline]
#[stable]
///
/// ```
/// let mut v = vec![1i, 2, 3];
- /// assert_eq!(v.remove(1), Some(2));
- /// assert_eq!(v, vec![1, 3]);
- ///
- /// assert_eq!(v.remove(4), None);
- /// // v is unchanged:
+ /// assert_eq!(v.remove(1), 2);
/// assert_eq!(v, vec![1, 3]);
/// ```
#[stable]
let size = capacity.checked_mul(mem::size_of::<T>())
.expect("capacity overflow");
unsafe {
- self.ptr = alloc_or_realloc(self.ptr, self.cap * mem::size_of::<T>(), size);
- if self.ptr.is_null() { ::alloc::oom() }
+ let ptr = alloc_or_realloc(*self.ptr, self.cap * mem::size_of::<T>(), size);
+ if ptr.is_null() { ::alloc::oom() }
+ self.ptr = NonZero::new(ptr);
}
self.cap = capacity;
}
}
#[test]
+ #[should_fail]
fn test_swap_remove_empty() {
let mut vec: Vec<uint> = vec!();
- assert_eq!(vec.swap_remove(0), None);
+ vec.swap_remove(0);
}
#[test]
pub fn insert(&mut self, key: uint, value: V) -> Option<V> {
let len = self.v.len();
if len <= key {
- self.v.grow_fn(key - len + 1, |_| None);
+ self.v.extend(range(0, key - len + 1).map(|_| None));
}
replace(&mut self.v[key], Some(value))
}
///
/// ```
/// let vec = vec![1i, 2i, 3i, 4i];
- /// let (even, odd): (Vec<int>, Vec<Int>) = vec.into_iter().partition(|&n| n % 2 == 0);
+ /// let (even, odd): (Vec<int>, Vec<int>) = vec.into_iter().partition(|&n| n % 2 == 0);
/// assert_eq!(even, vec![2, 4]);
/// assert_eq!(odd, vec![1, 3]);
/// ```
use ops::{FnMut, mod};
use option::Option;
use option::Option::{None, Some};
+use result::Result;
+use result::Result::{Ok, Err};
use ptr;
use ptr::PtrExt;
use mem;
}
#[unstable]
- fn binary_search_by<F>(&self, mut f: F) -> Result where
+ fn binary_search_by<F>(&self, mut f: F) -> Result<uint, uint> where
F: FnMut(&T) -> Ordering
{
let mut base : uint = 0;
}
lim >>= 1;
}
- Err(base);
+ Err(base)
}
#[inline]
// option. This file may not be copied, modified, or distributed
// except according to those terms.
-use std::slice::BinarySearchResult::{Found, NotFound};
+use core::result::Result::{Ok, Err};
#[test]
fn binary_search_not_found() {
let b = [1i, 2, 4, 6, 8, 9];
- assert!(b.binary_search(|v| v.cmp(&6)) == Found(3));
+ assert!(b.binary_search_by(|v| v.cmp(&6)) == Ok(3));
let b = [1i, 2, 4, 6, 8, 9];
- assert!(b.binary_search(|v| v.cmp(&5)) == NotFound(3));
+ assert!(b.binary_search_by(|v| v.cmp(&5)) == Err(3));
let b = [1i, 2, 4, 6, 7, 8, 9];
- assert!(b.binary_search(|v| v.cmp(&6)) == Found(3));
+ assert!(b.binary_search_by(|v| v.cmp(&6)) == Ok(3));
let b = [1i, 2, 4, 6, 7, 8, 9];
- assert!(b.binary_search(|v| v.cmp(&5)) == NotFound(3));
+ assert!(b.binary_search_by(|v| v.cmp(&5)) == Err(3));
let b = [1i, 2, 4, 6, 8, 9];
- assert!(b.binary_search(|v| v.cmp(&8)) == Found(4));
+ assert!(b.binary_search_by(|v| v.cmp(&8)) == Ok(4));
let b = [1i, 2, 4, 6, 8, 9];
- assert!(b.binary_search(|v| v.cmp(&7)) == NotFound(4));
+ assert!(b.binary_search_by(|v| v.cmp(&7)) == Err(4));
let b = [1i, 2, 4, 6, 7, 8, 9];
- assert!(b.binary_search(|v| v.cmp(&8)) == Found(5));
+ assert!(b.binary_search_by(|v| v.cmp(&8)) == Ok(5));
let b = [1i, 2, 4, 5, 6, 8, 9];
- assert!(b.binary_search(|v| v.cmp(&7)) == NotFound(5));
+ assert!(b.binary_search_by(|v| v.cmp(&7)) == Err(5));
let b = [1i, 2, 4, 5, 6, 8, 9];
- assert!(b.binary_search(|v| v.cmp(&0)) == NotFound(0));
+ assert!(b.binary_search_by(|v| v.cmp(&0)) == Err(0));
let b = [1i, 2, 4, 5, 6, 8];
- assert!(b.binary_search(|v| v.cmp(&9)) == NotFound(6));
+ assert!(b.binary_search_by(|v| v.cmp(&9)) == Err(6));
}
#[test]
fn f(_x: uint) -> Vec<Optval> { return Vec::new(); }
- let mut vals = Vec::from_fn(n_opts, f);
+ let mut vals: Vec<_> = range(0, n_opts).map(f).collect();
let mut free: Vec<String> = Vec::new();
let l = args.len();
let mut i = 0;
const MP_VEC: [(uint, uint), .. 2] = [(0,MIDPOINT), (MIDPOINT, 0)];
macro_rules! ind (
($x:expr) => {
- *self.mem.unsafe_get(($x as uint >> 3) & (RAND_SIZE_64 - 1))
+ *self.mem.get_unchecked(($x as uint >> 3) & (RAND_SIZE_64 - 1))
}
);
let mix = if $j == 0 {!mix} else {mix};
unsafe {
- let x = *self.mem.unsafe_get(base + mr_offset);
- a = mix + *self.mem.unsafe_get(base + m2_offset);
+ let x = *self.mem.get_unchecked(base + mr_offset);
+ a = mix + *self.mem.get_unchecked(base + m2_offset);
let y = ind!(x) + a + b;
- *self.mem.unsafe_mut(base + mr_offset) = y;
+ *self.mem.get_unchecked_mut(base + mr_offset) = y;
b = ind!(y >> RAND_SIZE_64_LEN) + x;
- *self.rsl.unsafe_mut(base + mr_offset) = b;
+ *self.rsl.get_unchecked_mut(base + mr_offset) = b;
}
}}
);
let mix = if $j == 0 {!mix} else {mix};
unsafe {
- let x = *self.mem.unsafe_get(base + mr_offset);
- a = mix + *self.mem.unsafe_get(base + m2_offset);
+ let x = *self.mem.get_unchecked(base + mr_offset);
+ a = mix + *self.mem.get_unchecked(base + m2_offset);
let y = ind!(x) + a + b;
- *self.mem.unsafe_mut(base + mr_offset) = y;
+ *self.mem.get_unchecked_mut(base + mr_offset) = y;
b = ind!(y >> RAND_SIZE_64_LEN) + x;
- *self.rsl.unsafe_mut(base + mr_offset) = b;
+ *self.rsl.get_unchecked_mut(base + mr_offset) = b;
}
}}
);
use std::io::{IoError, IoResult, SeekStyle};
use std::io;
use std::slice;
+use std::iter::repeat;
static BUF_CAPACITY: uint = 128;
// currently are
let difference = self.pos as i64 - self.buf.len() as i64;
if difference > 0 {
- self.buf.grow(difference as uint, 0);
+ self.buf.extend(repeat(0).take(difference as uint));
}
// Figure out what bytes will be used to overwrite what's currently
pub use self::Inst::*;
use std::cmp;
+use std::iter::repeat;
use parse;
use parse::{
Flags, FLAG_EMPTY,
Capture(cap, name, x) => {
let len = self.names.len();
if cap >= len {
- self.names.grow(10 + cap - len, None)
+ self.names.extend(repeat(None).take(10 + cap - len))
}
self.names[cap] = name;
use std::fmt;
use std::iter;
use std::num;
-use std::slice::BinarySearchResult;
/// Static data containing Unicode ranges for general categories and scripts.
use unicode::regex::{UNICODE_CLASSES, PERLD, PERLS, PERLW};
}
fn find_class(classes: NamedClasses, name: &str) -> Option<Vec<(char, char)>> {
- match classes.binary_search(|&(s, _)| s.cmp(name)) {
- BinarySearchResult::Found(i) => Some(classes[i].1.to_vec()),
- BinarySearchResult::NotFound(_) => None,
+ match classes.binary_search_by(|&(s, _)| s.cmp(name)) {
+ Ok(i) => Some(classes[i].1.to_vec()),
+ Err(_) => None,
}
}
use std::cmp;
use std::mem;
+use std::iter::repeat;
use std::slice::SliceExt;
use compile::{
Program,
let mut clist = &mut Threads::new(self.which, ninsts, ncaps);
let mut nlist = &mut Threads::new(self.which, ninsts, ncaps);
- let mut groups = Vec::from_elem(ncaps * 2, None);
+ let mut groups: Vec<_> = repeat(None).take(ncaps * 2).collect();
// Determine if the expression starts with a '^' so we can avoid
// simulating .*?
let negate = flags & FLAG_NEGATED > 0;
let casei = flags & FLAG_NOCASE > 0;
let found = ranges.as_slice();
- let found = found.binary_search(|&rc| class_cmp(casei, c, rc))
- .found().is_some();
+ let found = found.binary_search_by(|&rc| class_cmp(casei, c, rc)).is_ok();
if found ^ negate {
self.add(nlist, pc+1, caps);
}
fn new(which: MatchKind, num_insts: uint, ncaps: uint) -> Threads {
Threads {
which: which,
- queue: Vec::from_fn(num_insts, |_| {
- Thread { pc: 0, groups: Vec::from_elem(ncaps * 2, None) }
- }),
- sparse: Vec::from_elem(num_insts, 0u),
+ queue: range(0, num_insts).map(|_| {
+ Thread { pc: 0, groups: repeat(None).take(ncaps * 2).collect() }
+ }).collect(),
+ sparse: repeat(0u).take(num_insts).collect(),
size: 0,
}
}
// Try the common ASCII case before invoking binary search.
match c {
'_' | '0' ... '9' | 'a' ... 'z' | 'A' ... 'Z' => true,
- _ => PERLW.binary_search(|&(start, end)| {
+ _ => PERLW.binary_search_by(|&(start, end)| {
if c >= start && c <= end {
Equal
} else if start > c {
} else {
Less
}
- }).found().is_some()
+ }).is_ok()
}
}
F: FnMut(&mut SeekableMemWriter, &T),
T: Hash,
{
- let mut buckets: Vec<Vec<entry<T>>> = Vec::from_fn(256, |_| Vec::new());
+ let mut buckets: Vec<Vec<entry<T>>> = range(0, 256u16).map(|_| Vec::new()).collect();
for elt in index.into_iter() {
let h = hash::hash(&elt.val) as uint;
buckets[h % 256].push(elt);
let arity = constructor_arity(cx, &c, left_ty);
let mut result = {
let pat_slice = pats[];
- let subpats = Vec::from_fn(arity, |i| {
+ let subpats: Vec<_> = range(0, arity).map(|i| {
pat_slice.get(i).map_or(DUMMY_WILD_PAT, |p| &**p)
- });
+ }).collect();
vec![construct_witness(cx, &c, subpats, left_ty)]
};
result.extend(pats.into_iter().skip(arity));
match is_useful(cx, &matrix, v.tail(), witness) {
UsefulWithWitness(pats) => {
let arity = constructor_arity(cx, &constructor, left_ty);
- let wild_pats = Vec::from_elem(arity, DUMMY_WILD_PAT);
+ let wild_pats: Vec<_> = repeat(DUMMY_WILD_PAT).take(arity).collect();
let enum_pat = construct_witness(cx, &constructor, wild_pats, left_ty);
let mut new_pats = vec![enum_pat];
new_pats.extend(pats.into_iter());
} = raw_pat(r[col]);
let head: Option<Vec<&Pat>> = match *node {
ast::PatWild(_) =>
- Some(Vec::from_elem(arity, DUMMY_WILD_PAT)),
+ Some(repeat(DUMMY_WILD_PAT).take(arity).collect()),
ast::PatIdent(_, _, _) => {
let opt_def = cx.tcx.def_map.borrow().get(&pat_id).cloned();
} else {
None
},
- _ => Some(Vec::from_elem(arity, DUMMY_WILD_PAT))
+ _ => Some(repeat(DUMMY_WILD_PAT).take(arity).collect())
}
}
DefVariant(..) | DefStruct(..) => {
Some(match args {
&Some(ref args) => args.iter().map(|p| &**p).collect(),
- &None => Vec::from_elem(arity, DUMMY_WILD_PAT)
+ &None => repeat(DUMMY_WILD_PAT).take(arity).collect(),
})
}
_ => None
// Fixed-length vectors.
Single => {
let mut pats: Vec<&Pat> = before.iter().map(|p| &**p).collect();
- pats.grow_fn(arity - before.len() - after.len(), |_| DUMMY_WILD_PAT);
+ pats.extend(repeat(DUMMY_WILD_PAT).take(arity - before.len() - after.len()));
pats.extend(after.iter().map(|p| &**p));
Some(pats)
},
Slice(length) if before.len() + after.len() <= length && slice.is_some() => {
let mut pats: Vec<&Pat> = before.iter().map(|p| &**p).collect();
- pats.grow_fn(arity - before.len() - after.len(), |_| DUMMY_WILD_PAT);
+ pats.extend(repeat(DUMMY_WILD_PAT).take(arity - before.len() - after.len()));
pats.extend(after.iter().map(|p| &**p));
Some(pats)
},
use middle::ty;
use std::io;
use std::uint;
+use std::iter::repeat;
use syntax::ast;
use syntax::ast_util::IdRange;
use syntax::visit;
let entry = if oper.initial_value() { uint::MAX } else {0};
- let gens = Vec::from_elem(num_nodes * words_per_id, 0);
- let kills = Vec::from_elem(num_nodes * words_per_id, 0);
- let on_entry = Vec::from_elem(num_nodes * words_per_id, entry);
+ let gens: Vec<_> = repeat(0).take(num_nodes * words_per_id).collect();
+ let kills: Vec<_> = repeat(0).take(num_nodes * words_per_id).collect();
+ let on_entry: Vec<_> = repeat(entry).take(num_nodes * words_per_id).collect();
let nodeid_to_index = build_nodeid_to_index(decl, cfg);
changed: true
};
- let mut temp = Vec::from_elem(words_per_id, 0u);
+ let mut temp: Vec<_> = repeat(0u).take(words_per_id).collect();
while propcx.changed {
propcx.changed = false;
propcx.reset(temp.as_mut_slice());
let mut new_ty = P(ty.clone());
let mut ty_queue = vec!(ty);
while !ty_queue.is_empty() {
- let cur_ty = ty_queue.remove(0).unwrap();
+ let cur_ty = ty_queue.remove(0);
match cur_ty.node {
ast::TyRptr(lt_opt, ref mut_ty) => {
let rebuild = match lt_opt {
}
pub fn next_ty_vars(&self, n: uint) -> Vec<Ty<'tcx>> {
- Vec::from_fn(n, |_i| self.next_ty_var())
+ range(0, n).map(|_i| self.next_ty_var()).collect()
}
pub fn next_int_var_id(&self) -> IntVid {
use std::cell::{Cell, RefCell};
use std::u32;
+use std::iter::repeat;
use syntax::ast;
mod doc;
}
fn construct_var_data(&self) -> Vec<VarData> {
- Vec::from_fn(self.num_vars() as uint, |_| {
+ range(0, self.num_vars() as uint).map(|_| {
VarData {
// All nodes are initially classified as contracting; during
// the expansion phase, we will shift the classification for
classification: Contracting,
value: NoValue,
}
- })
+ }).collect()
}
fn dump_constraints(&self) {
// idea is to report errors that derive from independent
// regions of the graph, but not those that derive from
// overlapping locations.
- let mut dup_vec = Vec::from_elem(self.num_vars() as uint, u32::MAX);
+ let mut dup_vec: Vec<_> = repeat(u32::MAX).take(self.num_vars() as uint).collect();
let mut opt_graph = None;
}
}
- Vec::from_fn(self.num_vars() as uint, |idx| var_data[idx].value)
+ range(0, self.num_vars() as uint).map(|idx| var_data[idx].value).collect()
}
fn construct_graph(&self) -> RegionGraph {
use std::{fmt, io, uint};
use std::rc::Rc;
+use std::iter::repeat;
use syntax::ast::{mod, NodeId, Expr};
use syntax::codemap::{BytePos, original_sp, Span};
use syntax::parse::token::{mod, special_idents};
Liveness {
ir: ir,
s: specials,
- successors: Vec::from_elem(num_live_nodes, invalid_node()),
- users: Vec::from_elem(num_live_nodes * num_vars, invalid_users()),
+ successors: repeat(invalid_node()).take(num_live_nodes).collect(),
+ users: repeat(invalid_users()).take(num_live_nodes * num_vars).collect(),
loop_scope: Vec::new(),
break_ln: NodeMap::new(),
cont_ln: NodeMap::new(),
// the same bindings, and we also consider the first pattern to be
// the "authoritative" set of ids
let arm_succ =
- self.define_bindings_in_arm_pats(arm.pats.head().map(|p| &**p),
+ self.define_bindings_in_arm_pats(arm.pats.first().map(|p| &**p),
guard_succ);
self.merge_from_succ(ln, arm_succ, first_merge);
first_merge = false;
// only consider the first pattern; any later patterns must have
// the same bindings, and we also consider the first pattern to be
// the "authoritative" set of ids
- this.arm_pats_bindings(arm.pats.head().map(|p| &**p), |this, ln, var, sp, id| {
+ this.arm_pats_bindings(arm.pats.first().map(|p| &**p), |this, ln, var, sp, id| {
this.warn_about_unused(sp, id, ln, var);
});
visit::walk_arm(this, arm);
} else {
let ends_with_stmt = match body.expr {
None if body.stmts.len() > 0 =>
- match body.stmts.last().unwrap().node {
+ match body.stmts.first().unwrap().node {
ast::StmtSemi(ref e, _) => {
ty::expr_ty(self.ir.tcx, &**e) == t_ret
},
self.ir.tcx.sess.span_err(
sp, "not all control paths return a value");
if ends_with_stmt {
- let last_stmt = body.stmts.last().unwrap();
+ let last_stmt = body.stmts.first().unwrap();
let original_span = original_sp(self.ir.tcx.sess.codemap(),
last_stmt.span, sp);
let span_semicolon = Span {
let orig_def = self.tcx.def_map.borrow()[path_id].clone();
let ck = |tyname: &str| {
let ck_public = |def: ast::DefId| {
- let name = token::get_ident(path.segments
- .last()
- .unwrap()
- .identifier);
+ let name = token::get_ident(path.segments.last().unwrap().identifier);
let origdid = orig_def.def_id();
self.ensure_public(span,
def,
debug!("visit_early_late: referenced_idents={}",
referenced_idents);
- let (early, late) = generics.lifetimes.clone().partition(
+ let (early, late): (Vec<_>, _) = generics.lifetimes.iter().cloned().partition(
|l| referenced_idents.iter().any(|&i| i == l.lifetime.name));
self.with(EarlyScope(early_space, &early, self.scope), move |old_scope, this| {
SelfSpace => { self.self_limit -= 1; }
FnSpace => {}
}
- self.content.remove(limit - 1)
+ if self.content.is_empty() {
+ None
+ } else {
+ Some(self.content.remove(limit - 1))
+ }
}
}
if me.is_empty() { return t.chars().count(); }
if t.is_empty() { return me.chars().count(); }
- let mut dcol = Vec::from_fn(t.len() + 1, |x| x);
+ let mut dcol: Vec<_> = range(0, t.len() + 1).collect();
let mut t_last = 0;
for (i, sc) in me.chars().enumerate() {
#![allow(deprecated)] // to_be32
-use std::iter::range_step;
+use std::iter::{range_step, repeat};
use std::num::Int;
use std::slice::bytes::{MutableByteVector, copy_memory};
use serialize::hex::ToHex;
/// Convenience function that retrieves the result of a digest as a
/// newly allocated vec of bytes.
fn result_bytes(&mut self) -> Vec<u8> {
- let mut buf = Vec::from_elem((self.output_bits()+7)/8, 0u8);
+ let mut buf: Vec<u8> = repeat(0u8).take((self.output_bits()+7)/8).collect();
self.result(buf.as_mut_slice());
buf
}
/// correct.
fn test_digest_1million_random<D: Digest>(digest: &mut D, blocksize: uint, expected: &str) {
let total_size = 1000000;
- let buffer = Vec::from_elem(blocksize * 2, 'a' as u8);
+ let buffer: Vec<u8> = repeat('a' as u8).take(blocksize * 2).collect();
let mut rng = IsaacRng::new_unseeded();
let mut count = 0;
use rustc::util::ppaux::{Repr, UserString};
use std::mem;
use std::rc::Rc;
-use std::slice;
use syntax::ast;
use syntax::ast_map;
use syntax::attr::AttrMetaMethods;
return;
fn non_member(elem: MovePathIndex, set: &[MovePathIndex]) -> bool {
- match set.binary_search_elem(&elem) {
- slice::BinarySearchResult::Found(_) => false,
- slice::BinarySearchResult::NotFound(_) => true,
+ match set.binary_search(&elem) {
+ Ok(_) => false,
+ Err(_) => true,
}
}
}
mod borrowck;
pub mod graphviz;
-
lints
}
- let (plugin, builtin) = lint_store.get_lints().partitioned(|&(_, p)| p);
+ let (plugin, builtin): (Vec<_>, _) = lint_store.get_lints()
+ .iter().cloned().partition(|&(_, p)| p);
let plugin = sort_lints(plugin);
let builtin = sort_lints(builtin);
- let (plugin_groups, builtin_groups) = lint_store.get_lint_groups().partitioned(|&(_, _, p)| p);
+ let (plugin_groups, builtin_groups): (Vec<_>, _) = lint_store.get_lint_groups()
+ .iter().cloned().partition(|&(_, _, p)| p);
let plugin_groups = sort_lint_groups(plugin_groups);
let builtin_groups = sort_lint_groups(builtin_groups);
/// returns None.
pub fn handle_options(mut args: Vec<String>) -> Option<getopts::Matches> {
// Throw away the first argument, the name of the binary
- let _binary = args.remove(0).unwrap();
+ let _binary = args.remove(0);
if args.is_empty() {
// user did not write `-v` nor `-Z unstable-options`, so do not
Some(def) => {
debug!("(resolving type) resolved `{}` to \
type {}",
- token::get_ident(path.segments
- .last().unwrap()
- .identifier),
+ token::get_ident(path.segments.last().unwrap() .identifier),
def);
result_def = Some(def);
}
self.resolve_error(path.span,
format!("`{}` is not an enum variant, struct or const",
token::get_ident(
- path.segments
- .last()
- .unwrap()
- .identifier))[]);
+ path.segments.last().unwrap().identifier))[]);
}
None => {
self.resolve_error(path.span,
format!("unresolved enum variant, struct or const `{}`",
token::get_ident(
- path.segments
- .last()
- .unwrap()
- .identifier))[]);
+ path.segments.last().unwrap().identifier))[]);
}
}
// Try to find a path to an item in a module.
let unqualified_def =
- self.resolve_identifier(path.segments
- .last().unwrap()
- .identifier,
+ self.resolve_identifier(path.segments.last().unwrap().identifier,
namespace,
check_ribs,
path.span);
val: ValueRef)
-> ExtractedBlock<'blk, 'tcx> {
let _icx = push_ctxt("match::extract_variant_args");
- let args = Vec::from_fn(adt::num_args(repr, disr_val), |i| {
+ let args = range(0, adt::num_args(repr, disr_val)).map(|i| {
adt::trans_field_ptr(bcx, repr, val, disr_val, i)
- });
+ }).collect();
ExtractedBlock { vals: args, bcx: bcx }
}
use trans::type_::Type;
use std::cmp;
+use std::iter::repeat;
#[deriving(Clone, Copy, PartialEq)]
enum RegClass {
}
let words = (ty_size(ty) + 7) / 8;
- let mut cls = Vec::from_elem(words, NoClass);
+ let mut cls: Vec<_> = repeat(NoClass).take(words).collect();
if words > 4 {
all_mem(cls.as_mut_slice());
return cls;
use util::ppaux::{Repr, ty_to_string};
use std::c_str::ToCStr;
+use std::iter::repeat;
use libc::c_uint;
use syntax::{ast, ast_util};
use syntax::ptr::P;
const_eval::const_uint(i) => i as uint,
_ => cx.sess().span_bug(count.span, "count must be integral const expression.")
};
- let vs = Vec::from_elem(n, const_expr(cx, &**elem).0);
+ let vs: Vec<_> = repeat(const_expr(cx, &**elem).0).take(n).collect();
if vs.iter().any(|vi| val_ty(*vi) != llunitty) {
C_struct(cx, vs[], false)
} else {
if need_new_scope {
// Create a new lexical scope and push it onto the stack
let loc = cx.sess().codemap().lookup_char_pos(pat.span.lo);
- let file_metadata = file_metadata(cx,
- loc.file
- .name
- []);
+ let file_metadata = file_metadata(cx, loc.file.name[]);
let parent_scope = scope_stack.last().unwrap().scope_metadata;
let scope_metadata = unsafe {
use syntax::ptr::P;
use syntax::parse::token;
use std::rc::Rc;
+use std::iter::repeat;
// Destinations
let tcx = bcx.tcx();
with_field_tys(tcx, ty, Some(expr_id), |discr, field_tys| {
- let mut need_base = Vec::from_elem(field_tys.len(), true);
+ let mut need_base: Vec<_> = repeat(true).take(field_tys.len()).collect();
let numbered_fields = fields.iter().map(|field| {
let opt_pos =
use std::c_str::ToCStr;
use std::mem;
use std::cell::RefCell;
+use std::iter::repeat;
use libc::c_uint;
if n_elts == 0 {
return Vec::new();
}
- let mut elts = Vec::from_elem(n_elts, Type { rf: 0 as TypeRef });
+ let mut elts: Vec<_> = repeat(Type { rf: 0 as TypeRef }).take(n_elts).collect();
llvm::LLVMGetStructElementTypes(self.to_ref(),
elts.as_mut_ptr() as *mut TypeRef);
elts
pub fn func_params(&self) -> Vec<Type> {
unsafe {
let n_args = llvm::LLVMCountParamTypes(self.to_ref()) as uint;
- let mut args = Vec::from_elem(n_args, Type { rf: 0 as TypeRef });
+ let mut args: Vec<_> = repeat(Type { rf: 0 as TypeRef }).take(n_args).collect();
llvm::LLVMGetParamTypes(self.to_ref(),
args.as_mut_ptr() as *mut TypeRef);
args
use util::ppaux::{mod, Repr, UserString};
use std::rc::Rc;
-use std::iter::AdditiveIterator;
+use std::iter::{repeat, AdditiveIterator};
use syntax::{abi, ast, ast_util};
use syntax::codemap::Span;
use syntax::parse::token;
match anon_regions {
Ok(v) => v.into_iter().collect(),
- Err(_) => Vec::from_fn(expected_num_region_params,
- |_| ty::ReStatic) // hokey
+ Err(_) => range(0, expected_num_region_params)
+ .map(|_| ty::ReStatic).collect() // hokey
}
};
.map(|a_t| ast_ty_to_ty(this, &binding_rscope, &**a_t))
.collect::<Vec<Ty<'tcx>>>();
- let input_params = Vec::from_elem(inputs.len(), String::new());
+ let input_params: Vec<_> = repeat(String::new()).take(inputs.len()).collect();
let (implied_output_region,
params_lifetimes) = find_implied_output_region(&*inputs, input_params);
path.segments.iter().all(|s| s.parameters.is_empty());
let substs = if needs_defaults {
- let type_params = Vec::from_fn(generics.types.len(TypeSpace),
- |_| this.ty_infer(path.span));
+ let type_params: Vec<_> = range(0, generics.types.len(TypeSpace))
+ .map(|_| this.ty_infer(path.span)).collect();
let region_params =
rscope.anon_regions(path.span, generics.regions.len(TypeSpace))
.unwrap();
let mut partitioned_bounds = partition_bounds(this.tcx(), span, ast_bounds[]);
let mut projection_bounds = Vec::new();
- let main_trait_bound = match partitioned_bounds.trait_bounds.remove(0) {
- Some(trait_bound) => {
- let ptr = instantiate_poly_trait_ref(this,
- rscope,
- trait_bound,
- None,
- &mut projection_bounds);
- Some(ptr)
- }
- None => {
- this.tcx().sess.span_err(
- span,
- "at least one non-builtin trait is required for an object type");
- None
- }
+ let main_trait_bound = if !partitioned_bounds.trait_bounds.is_empty() {
+ let trait_bound = partitioned_bounds.trait_bounds.remove(0);
+ Some(instantiate_poly_trait_ref(this,
+ rscope,
+ trait_bound,
+ None,
+ &mut projection_bounds))
+ } else {
+ this.tcx().sess.span_err(
+ span,
+ "at least one non-builtin trait is required for an object type");
+ None
};
let bounds =
check_pat_struct(pcx, pat, path, fields.as_slice(), etc, expected);
}
ast::PatTup(ref elements) => {
- let element_tys = Vec::from_fn(elements.len(), |_| fcx.infcx().next_ty_var());
+ let element_tys: Vec<_> = range(0, elements.len()).map(|_| fcx.infcx()
+ .next_ty_var()).collect();
let pat_ty = ty::mk_tup(tcx, element_tys.clone());
fcx.write_ty(pat.id, pat_ty);
demand::eqtype(fcx, pat.span, expected, pat_ty);
use syntax::codemap::Span;
use std::rc::Rc;
use std::mem;
+use std::iter::repeat;
use util::ppaux::Repr;
struct ConfirmContext<'a, 'tcx:'a> {
} else if num_supplied_types != num_method_types {
span_err!(self.tcx().sess, self.span, E0036,
"incorrect number of type parameters given for this method");
- Vec::from_elem(num_method_types, self.tcx().types.err)
+ repeat(self.tcx().types.err).take(num_method_types).collect()
} else {
supplied_method_types
}
use std::cell::{Cell, Ref, RefCell};
use std::mem::replace;
use std::rc::Rc;
+use std::iter::repeat;
use syntax::{mod, abi, attr};
use syntax::ast::{mod, ProvidedMethod, RequiredMethod, TypeTraitItem, DefId};
use syntax::ast_util::{mod, local_def, PostExpansionMethod};
fn anon_regions(&self, span: Span, count: uint)
-> Result<Vec<ty::Region>, Option<Vec<(String, uint)>>> {
- Ok(Vec::from_fn(count, |_| {
+ Ok(range(0, count).map(|_| {
self.infcx().next_region_var(infer::MiscVariable(span))
- }))
+ }).collect())
}
}
// FIXME(#17596) Ty<'tcx> is incorrectly invariant w.r.t 'tcx.
fn err_args<'tcx>(tcx: &ty::ctxt<'tcx>, len: uint) -> Vec<Ty<'tcx>> {
- Vec::from_fn(len, |_| tcx.types.err)
+ range(0, len).map(|_| tcx.types.err).collect()
}
fn write_call<'a, 'tcx>(fcx: &FnCtxt<'a, 'tcx>,
// The first step then is to categorize the segments appropriately.
assert!(path.segments.len() >= 1);
- let mut segment_spaces;
+ let mut segment_spaces: Vec<_>;
match def {
// Case 1 and 1b. Reference to a *type* or *enum variant*.
def::DefSelfTy(..) |
def::DefTyParam(..) => {
// Everything but the final segment should have no
// parameters at all.
- segment_spaces = Vec::from_elem(path.segments.len() - 1, None);
+ segment_spaces = repeat(None).take(path.segments.len() - 1).collect();
segment_spaces.push(Some(subst::TypeSpace));
}
def::DefFn(..) |
def::DefConst(..) |
def::DefStatic(..) => {
- segment_spaces = Vec::from_elem(path.segments.len() - 1, None);
+ segment_spaces = repeat(None).take(path.segments.len() - 1).collect();
segment_spaces.push(Some(subst::FnSpace));
}
def::FromImpl(_) => {}
}
- segment_spaces = Vec::from_elem(path.segments.len() - 2, None);
+ segment_spaces = repeat(None).take(path.segments.len() - 2).collect();
segment_spaces.push(Some(subst::TypeSpace));
segment_spaces.push(Some(subst::FnSpace));
}
def::DefRegion(..) |
def::DefLabel(..) |
def::DefUpvar(..) => {
- segment_spaces = Vec::from_elem(path.segments.len(), None);
+ segment_spaces = repeat(None).take(path.segments.len()).collect();
}
}
assert_eq!(segment_spaces.len(), path.segments.len());
"too few type parameters provided: expected {}{} parameter(s) \
, found {} parameter(s)",
qualifier, required_len, provided_len);
- substs.types.replace(space,
- Vec::from_elem(desired.len(), fcx.tcx().types.err));
+ substs.types.replace(space, repeat(fcx.tcx().types.err).take(desired.len()).collect());
return;
}
// make a vector of booleans initially false, set to true when used
if tps.len() == 0u { return; }
- let mut tps_used = Vec::from_elem(tps.len(), false);
+ let mut tps_used: Vec<_> = repeat(false).take(tps.len()).collect();
ty::walk_ty(ty, |t| {
match t.sty {
use middle::ty_fold;
use std::cell::Cell;
+use std::iter::repeat;
use syntax::codemap::Span;
/// Defines strategies for handling regions that are omitted. For
count: uint)
-> Result<Vec<ty::Region>, Option<Vec<(String, uint)>>>
{
- Ok(Vec::from_elem(count, self.default))
+ Ok(repeat(self.default).take(count).collect())
}
}
count: uint)
-> Result<Vec<ty::Region>, Option<Vec<(String, uint)>>>
{
- Ok(Vec::from_fn(count, |_| self.next_region()))
+ Ok(range(0, count).map(|_| self.next_region()).collect())
}
}
use middle::ty::{mod, Ty};
use std::fmt;
use std::rc::Rc;
+use std::iter::repeat;
use syntax::ast;
use syntax::ast_map;
use syntax::ast_util;
fn solve_constraints(constraints_cx: ConstraintContext) {
let ConstraintContext { terms_cx, constraints, .. } = constraints_cx;
- let solutions = Vec::from_elem(terms_cx.num_inferred(), ty::Bivariant);
+ let solutions: Vec<_> = repeat(ty::Bivariant).take(terms_cx.num_inferred()).collect();
let mut solutions_cx = SolveContext {
terms_cx: terms_cx,
constraints: constraints,
Some(root) => {
try!(write!(f, "<a href='{}{}/primitive.{}.html'>",
root,
- path.0.head().unwrap(),
+ path.0.first().unwrap(),
prim.to_url_str()));
needs_termination = true;
}
try!(write!(w, r#"<script type="text/javascript" async
src="{root_path}/implementors/{path}/{ty}.{name}.js">
</script>"#,
- root_path = Vec::from_elem(cx.current.len(), "..").connect("/"),
+ root_path = repeat("..").take(cx.current.len()).collect::<Vec<_>>().connect("/"),
path = if ast_util::is_local(it.def_id) {
cx.current.connect("/")
} else {
fn render_methods(w: &mut fmt::Formatter, it: &clean::Item) -> fmt::Result {
match cache().impls.get(&it.def_id) {
Some(v) => {
- let (non_trait, traits) = v.partitioned(|i| i.impl_.trait_.is_none());
+ let (non_trait, traits): (Vec<_>, _) = v.iter().cloned()
+ .partition(|i| i.impl_.trait_.is_none());
if non_trait.len() > 0 {
try!(write!(w, "<h2 id='methods'>Methods</h2>"));
for i in non_trait.iter() {
if traits.len() > 0 {
try!(write!(w, "<h2 id='implementations'>Trait \
Implementations</h2>"));
- let (derived, manual) = traits.partition(|i| i.impl_.derived);
+ let (derived, manual): (Vec<_>, _) = traits.into_iter()
+ .partition(|i| i.impl_.derived);
for i in manual.iter() {
try!(render_impl(w, i));
}
use hash;
use mem;
use ptr;
-use slice::{mod, ImmutableIntSlice};
+use slice::{mod, IntSliceExt};
use str;
use string::String;
use core::kinds::marker;
tail: 0 as *mut Node,
},
buf: Buffer {
- buf: Vec::from_fn(cap + if cap == 0 {1} else {0}, |_| None),
+ buf: range(0, cap + if cap == 0 {1} else {0}).map(|_| None).collect(),
start: 0,
size: 0,
},
impl Reader for ShortReader {
fn read(&mut self, _: &mut [u8]) -> io::IoResult<uint> {
- match self.lengths.remove(0) {
- Some(i) => Ok(i),
- None => Err(io::standard_error(io::EndOfFile))
+ if self.lengths.is_empty() {
+ Err(io::standard_error(io::EndOfFile))
+ } else {
+ Ok(self.lengths.remove(0))
}
}
}
unsafe fn load_argc_and_argv(argc: int,
argv: *const *const c_char) -> Vec<Vec<u8>> {
use c_str::CString;
+ use iter::range;
- Vec::from_fn(argc as uint, |i| {
+ range(0, argc as uint).map(|i| {
CString::new(*argv.offset(i as int), false).as_bytes_no_nul().to_vec()
- })
+ }).collect()
}
/// Returns the command line arguments
let lpCmdLine = unsafe { GetCommandLineW() };
let szArgList = unsafe { CommandLineToArgvW(lpCmdLine, lpArgCount) };
- let args = Vec::from_fn(nArgs as uint, |i| unsafe {
+ let args: Vec<_> = range(0, nArgs as uint).map(|i| unsafe {
// Determine the length of this argument.
let ptr = *szArgList.offset(i as int);
let mut len = 0;
let buf = slice::from_raw_buf(&ptr, len);
let opt_s = String::from_utf16(sys::os::truncate_utf16_at_nul(buf));
opt_s.ok().expect("CommandLineToArgvW returned invalid UTF-16")
- });
+ }).collect();
unsafe {
LocalFree(szArgList as *mut c_void);
use super::{BytesContainer, GenericPath, GenericPathUnsafe};
/// Iterator that yields successive components of a Path as &[u8]
-pub type Components<'a> = Splits<'a, u8, fn(&u8) -> bool>;
+pub type Components<'a> = Split<'a, u8, fn(&u8) -> bool>;
/// Iterator that yields successive components of a Path as Option<&str>
pub type StrComponents<'a> =
use mem;
use option::Option;
use option::Option::{Some, None};
-use slice::{AsSlice, SliceExt, SliceConcatExt};
-use str::{CharSplits, FromStr, Str, StrAllocating, StrPrelude};
+use slice::{SliceExt, SliceConcatExt};
+use str::{SplitTerminator, FromStr, StrExt};
use string::{String, ToString};
use unicode::char::UnicodeChar;
use vec::Vec;
}
unsafe fn load_argc_and_argv(argc: int, argv: *const *const u8) -> Vec<Vec<u8>> {
- Vec::from_fn(argc as uint, |i| {
+ range(0, argc as uint).map(|i| {
let arg = *argv.offset(i as int);
let mut len = 0u;
while *arg.offset(len as int) != 0 {
len += 1u;
}
slice::from_raw_buf(&arg, len).to_vec()
- })
+ }).collect()
}
#[cfg(test)]
// signals the first requests in the queue, possible re-enqueueing it.
fn signal(active: &mut Vec<Box<Inner>>,
dead: &mut Vec<(uint, Box<Inner>)>) {
- let mut timer = match active.remove(0) {
- Some(timer) => timer, None => return
- };
+ if active.is_empty() { return }
+
+ let mut timer = active.remove(0);
let mut cb = timer.cb.take().unwrap();
cb.call();
if timer.repeat {
Ok(RemoveTimer(id, ack)) => {
match dead.iter().position(|&(i, _)| id == i) {
Some(i) => {
- let (_, i) = dead.remove(i).unwrap();
+ let (_, i) = dead.remove(i);
ack.send(i);
continue
}
}
let i = active.iter().position(|i| i.id == id);
let i = i.expect("no timer found");
- let t = active.remove(i).unwrap();
+ let t = active.remove(i);
ack.send(t);
}
Err(..) => break
use fmt;
use io::{IoResult, IoError};
+use iter::repeat;
use libc::{c_int, c_char, c_void};
use libc;
use os;
let mut res = None;
let mut done = false;
while !done {
- let mut buf = Vec::from_elem(n as uint, 0u16);
+ let mut buf: Vec<u16> = repeat(0u16).take(n).collect();
let k = f(buf.as_mut_ptr(), n);
if k == (0 as DWORD) {
done = true;
use libc::{get_osfhandle, CloseHandle};
use libc::types::os::arch::extra::LPCVOID;
use io::{mod, IoError, IoResult, MemReader};
+use iter::repeat;
use prelude::*;
use ptr;
use str::from_utf8;
pub fn read(&mut self, buf: &mut [u8]) -> IoResult<uint> {
// Read more if the buffer is empty
if self.utf8.eof() {
- let mut utf16 = Vec::from_elem(0x1000, 0u16);
+ let mut utf16: Vec<u16> = repeat(0u16).take(0x1000).collect();
let mut num: DWORD = 0;
match unsafe { ReadConsoleW(self.handle,
utf16.as_mut_ptr() as LPVOID,
use std::cell::RefCell;
use std::fmt;
use std::io::IoResult;
-use std::iter;
+use std::iter::{mod, repeat};
use std::mem;
use std::slice;
debug!("ast_map: {} => {}", id, entry);
let len = self.map.len();
if id as uint >= len {
- self.map.grow(id as uint - len + 1, NotPresent);
+ self.map.extend(repeat(NotPresent).take(id as uint - len + 1));
}
self.map[id as uint] = entry;
}
fn expand_item_modifiers(mut it: P<ast::Item>, fld: &mut MacroExpander)
-> P<ast::Item> {
// partition the attributes into ItemModifiers and others
- let (modifiers, other_attrs) = it.attrs.partitioned(|attr| {
+ let (modifiers, other_attrs): (Vec<_>, _) = it.attrs.iter().cloned().partition(|attr| {
match fld.cx.syntax_env.find(&intern(attr.name().get())) {
Some(rc) => match *rc { Modifier(_) => true, _ => false },
_ => false
use ptr::P;
use std::collections::HashMap;
+use std::iter::repeat;
#[deriving(PartialEq)]
enum ArgumentType {
/// to
fn into_expr(mut self) -> P<ast::Expr> {
let mut locals = Vec::new();
- let mut names = Vec::from_fn(self.name_positions.len(), |_| None);
+ let mut names: Vec<_> = repeat(None).take(self.name_positions.len()).collect();
let mut pats = Vec::new();
let mut heads = Vec::new();
name_ordering: Vec<String>,
names: HashMap<String, P<ast::Expr>>)
-> P<ast::Expr> {
- let arg_types = Vec::from_fn(args.len(), |_| None);
+ let arg_types: Vec<_> = range(0, args.len()).map(|_| None).collect();
let mut cx = Context {
ecx: ecx,
args: args,
None => break
}
}
- match parser.errors.remove(0) {
- Some(error) => {
- cx.ecx.span_err(cx.fmtsp,
- format!("invalid format string: {}", error)[]);
- return DummyResult::raw_expr(sp);
- }
- None => {}
+ if !parser.errors.is_empty() {
+ cx.ecx.span_err(cx.fmtsp, format!("invalid format string: {}",
+ parser.errors.remove(0))[]);
+ return DummyResult::raw_expr(sp);
}
if !cx.literal.is_empty() {
let s = cx.trans_literal_string();
pub fn initial_matcher_pos(ms: Rc<Vec<TokenTree>>, sep: Option<Token>, lo: BytePos)
-> Box<MatcherPos> {
let match_idx_hi = count_names(ms[]);
- let matches = Vec::from_fn(match_idx_hi, |_i| Vec::new());
+ let matches: Vec<_> = range(0, match_idx_hi).map(|_| Vec::new()).collect();
box MatcherPos {
stack: vec![],
top_elts: TtSeq(ms),
cur_eis.push(new_ei);
}
- let matches = Vec::from_elem(ei.matches.len(), Vec::new());
+ let matches: Vec<_> = range(0, ei.matches.len())
+ .map(|_| Vec::new()).collect();
let ei_t = ei;
cur_eis.push(box MatcherPos {
stack: vec![],
use std::io;
use std::string;
+use std::iter::repeat;
#[deriving(Clone, Copy, PartialEq)]
pub enum Breaks {
// fall behind.
let n: uint = 3 * linewidth;
debug!("mk_printer {}", linewidth);
- let token: Vec<Token> = Vec::from_elem(n, Eof);
- let size: Vec<int> = Vec::from_elem(n, 0i);
- let scan_stack: Vec<uint> = Vec::from_elem(n, 0u);
+ let token: Vec<Token> = repeat(Eof).take(n).collect();
+ let size: Vec<int> = repeat(0i).take(n).collect();
+ let scan_stack: Vec<uint> = repeat(0u).take(n).collect();
Printer {
out: out,
buf_len: n,
}),
};
- let (crates, uses) = view_items.partitioned(|x| {
+ let (crates, uses): (Vec<_>, _) = view_items.iter().cloned().partition(|x| {
match x.node {
ast::ViewItemExternCrate(..) => true,
_ => false,
use self::FormatOp::*;
use std::ascii::OwnedAsciiExt;
use std::mem::replace;
+use std::iter::repeat;
#[deriving(Copy, PartialEq)]
enum States {
if flags.precision > s.len() {
let mut s_ = Vec::with_capacity(flags.precision);
let n = flags.precision - s.len();
- s_.grow(n, b'0');
+ s_.extend(repeat(b'0').take(n));
s_.extend(s.into_iter());
s = s_;
}
if flags.width > s.len() {
let n = flags.width - s.len();
if flags.left {
- s.grow(n, b' ');
+ s.extend(repeat(b' ').take(n));
} else {
let mut s_ = Vec::with_capacity(flags.width);
- s_.grow(n, b' ');
+ s_.extend(repeat(b' ').take(n));
s_.extend(s.into_iter());
s = s_;
}
try!(callback(TeFiltered(filtered_descs)));
- let (filtered_tests, filtered_benchs_and_metrics) =
- filtered_tests.partition(|e| {
+ let (filtered_tests, filtered_benchs_and_metrics): (Vec<_>, _) =
+ filtered_tests.into_iter().partition(|e| {
match e.testfn {
StaticTestFn(_) | DynTestFn(_) => true,
_ => false
use core::cmp::Ordering::{Equal, Less, Greater};
use core::option::Option;
use core::option::Option::{Some, None};
-use core::slice;
use core::slice::SliceExt;
+use core::result::Result::{Ok, Err};
use tables::normalization::{canonical_table, compatibility_table, composition_table};
fn bsearch_table<T>(c: char, r: &'static [(char, &'static [T])]) -> Option<&'static [T]> {
- match r.binary_search(|&(val, _)| {
+ match r.binary_search_by(|&(val, _)| {
if c == val { Equal }
else if val < c { Less }
else { Greater }
}) {
- slice::BinarySearchResult::Found(idx) => {
+ Ok(idx) => {
let (_, result) = r[idx];
Some(result)
}
- slice::BinarySearchResult::NotFound(_) => None
+ Err(_) => None
}
}
match bsearch_table(a, composition_table) {
None => None,
Some(candidates) => {
- match candidates.binary_search(|&(val, _)| {
+ match candidates.binary_search_by(|&(val, _)| {
if b == val { Equal }
else if val < b { Less }
else { Greater }
}) {
- slice::BinarySearchResult::Found(idx) => {
+ Ok(idx) => {
let (_, result) = candidates[idx];
Some(result)
}
- slice::BinarySearchResult::NotFound(_) => None
+ Err(_) => None
}
}
}
fn bsearch_range_table(c: char, r: &'static [(char,char)]) -> bool {
use core::cmp::Ordering::{Equal, Less, Greater};
use core::slice::SliceExt;
- r.binary_search(|&(lo,hi)| {
+ r.binary_search_by(|&(lo,hi)| {
if lo <= c && c <= hi { Equal }
else if hi < c { Less }
else { Greater }
- }).found().is_some()
+ }).is_ok()
}
pub mod general_category {
fn bsearch_range_value_table(c: char, r: &'static [(char, char, u8)]) -> u8 {
use core::cmp::Ordering::{Equal, Less, Greater};
use core::slice::SliceExt;
- use core::slice;
- match r.binary_search(|&(lo, hi, _)| {
+ use core::result::Result::{Ok, Err};
+ match r.binary_search_by(|&(lo, hi, _)| {
if lo <= c && c <= hi { Equal }
else if hi < c { Less }
else { Greater }
}) {
- slice::BinarySearchResult::Found(idx) => {
+ Ok(idx) => {
let (_, _, result) = r[idx];
result
}
- slice::BinarySearchResult::NotFound(_) => 0
+ Err(_) => 0
}
}
use core::slice::SliceExt;
use core::option::Option;
use core::option::Option::{Some, None};
- use core::slice;
+ use core::result::Result::{Ok, Err};
pub fn to_lower(c: char) -> char {
match bsearch_case_table(c, LuLl_table) {
}
fn bsearch_case_table(c: char, table: &'static [(char, char)]) -> Option<uint> {
- match table.binary_search(|&(key, _)| {
+ match table.binary_search_by(|&(key, _)| {
if c == key { Equal }
else if key < c { Less }
else { Greater }
}) {
- slice::BinarySearchResult::Found(i) => Some(i),
- slice::BinarySearchResult::NotFound(_) => None,
+ Ok(i) => Some(i),
+ Err(_) => None,
}
}
use core::option::Option;
use core::option::Option::{Some, None};
use core::slice::SliceExt;
- use core::slice;
+ use core::result::Result::{Ok, Err};
fn bsearch_range_value_table(c: char, is_cjk: bool, r: &'static [(char, char, u8, u8)]) -> u8 {
use core::cmp::Ordering::{Equal, Less, Greater};
- match r.binary_search(|&(lo, hi, _, _)| {
+ match r.binary_search_by(|&(lo, hi, _, _)| {
if lo <= c && c <= hi { Equal }
else if hi < c { Less }
else { Greater }
}) {
- slice::BinarySearchResult::Found(idx) => {
+ Ok(idx) => {
let (_, _, r_ncjk, r_cjk) = r[idx];
if is_cjk { r_cjk } else { r_ncjk }
}
- slice::BinarySearchResult::NotFound(_) => 1
+ Err(_) => 1
}
}
use core::kinds::Copy;
use core::slice::SliceExt;
pub use self::GraphemeCat::*;
- use core::slice;
+ use core::result::Result::{Ok, Err};
#[allow(non_camel_case_types)]
#[deriving(Clone)]
fn bsearch_range_value_table(c: char, r: &'static [(char, char, GraphemeCat)]) -> GraphemeCat {
use core::cmp::Ordering::{Equal, Less, Greater};
- match r.binary_search(|&(lo, hi, _)| {
+ match r.binary_search_by(|&(lo, hi, _)| {
if lo <= c && c <= hi { Equal }
else if hi < c { Less }
else { Greater }
}) {
- slice::BinarySearchResult::Found(idx) => {
+ Ok(idx) => {
let (_, _, cat) = r[idx];
cat
}
- slice::BinarySearchResult::NotFound(_) => GC_Any
+ Err(_) => GC_Any
}
}
-Subproject commit aed73472416064642911af790b25d57c9390b6c7
+Subproject commit 3a37981744a5af2433fed551f742465c78c9af7f
let mut v2 = Vec::new();
while v1.len() > 0 {
- v2.push(v1.remove(0).unwrap());
+ v2.push(v1.remove(0));
}
}
unsafe {
copy_memory(seq.as_mut_ptr().offset((i - off + 1) as int),
seq.as_ptr().offset((i - off) as int), off);
- *seq.unsafe_mut(i - off) = b'\n';
+ *seq.get_unchecked_mut(i - off) = b'\n';
}
i += LINE_LEN + 1;
}
// except according to those terms.
use std::slice::Chunks;
-use std::slice::MutChunks;
+use std::slice::ChunksMut;
-fn dft_iter<'a, T>(arg1: Chunks<'a,T>, arg2: MutChunks<'a,T>)
+fn dft_iter<'a, T>(arg1: Chunks<'a,T>, arg2: ChunksMut<'a,T>)
{
for
&something
projects / rust.git / commitdiff