}
impl<A> FromIterator<A> for DList<A> {
- fn from_iterator<T: Iterator<A>>(iterator: &mut T) -> DList<A> {
+ fn from_iterator<T: Iterator<A>>(iterator: T) -> DList<A> {
let mut ret = DList::new();
ret.extend(iterator);
ret
}
impl<A> Extendable<A> for DList<A> {
- fn extend<T: Iterator<A>>(&mut self, iterator: &mut T) {
- for elt in *iterator { self.push_back(elt); }
+ fn extend<T: Iterator<A>>(&mut self, mut iterator: T) {
+ for elt in iterator { self.push_back(elt); }
}
}
iter::Map<'static, (&'a K, &'a V), &'a V, Entries<'a, K, V>>;
impl<K: TotalEq + Hash<S>, V, S, H: Hasher<S> + Default> FromIterator<(K, V)> for HashMap<K, V, H> {
- fn from_iterator<T: Iterator<(K, V)>>(iter: &mut T) -> HashMap<K, V, H> {
+ fn from_iterator<T: Iterator<(K, V)>>(iter: T) -> HashMap<K, V, H> {
let (lower, _) = iter.size_hint();
let mut map = HashMap::with_capacity_and_hasher(lower, Default::default());
map.extend(iter);
}
impl<K: TotalEq + Hash<S>, V, S, H: Hasher<S> + Default> Extendable<(K, V)> for HashMap<K, V, H> {
- fn extend<T: Iterator<(K, V)>>(&mut self, iter: &mut T) {
- for (k, v) in *iter {
+ fn extend<T: Iterator<(K, V)>>(&mut self, mut iter: T) {
+ for (k, v) in iter {
self.insert(k, v);
}
}
}
impl<T: TotalEq + Hash<S>, S, H: Hasher<S> + Default> FromIterator<T> for HashSet<T, H> {
- fn from_iterator<I: Iterator<T>>(iter: &mut I) -> HashSet<T, H> {
+ fn from_iterator<I: Iterator<T>>(iter: I) -> HashSet<T, H> {
let (lower, _) = iter.size_hint();
let mut set = HashSet::with_capacity_and_hasher(lower, Default::default());
set.extend(iter);
}
impl<T: TotalEq + Hash<S>, S, H: Hasher<S> + Default> Extendable<T> for HashSet<T, H> {
- fn extend<I: Iterator<T>>(&mut self, iter: &mut I) {
- for k in *iter {
+ fn extend<I: Iterator<T>>(&mut self, mut iter: I) {
+ for k in iter {
self.insert(k);
}
}
}
impl<T: Ord> FromIterator<T> for PriorityQueue<T> {
- fn from_iterator<Iter: Iterator<T>>(iter: &mut Iter) -> PriorityQueue<T> {
+ fn from_iterator<Iter: Iterator<T>>(iter: Iter) -> PriorityQueue<T> {
let mut q = PriorityQueue::new();
q.extend(iter);
-
q
}
}
impl<T: Ord> Extendable<T> for PriorityQueue<T> {
- fn extend<Iter: Iterator<T>>(&mut self, iter: &mut Iter) {
+ fn extend<Iter: Iterator<T>>(&mut self, mut iter: Iter) {
let (lower, _) = iter.size_hint();
let len = self.capacity();
self.reserve(len + lower);
- for elem in *iter {
+ for elem in iter {
self.push(elem);
}
}
}
impl<A> FromIterator<A> for RingBuf<A> {
- fn from_iterator<T: Iterator<A>>(iterator: &mut T) -> RingBuf<A> {
+ fn from_iterator<T: Iterator<A>>(iterator: T) -> RingBuf<A> {
let (lower, _) = iterator.size_hint();
let mut deq = RingBuf::with_capacity(lower);
deq.extend(iterator);
}
impl<A> Extendable<A> for RingBuf<A> {
- fn extend<T: Iterator<A>>(&mut self, iterator: &mut T) {
- for elt in *iterator {
+ fn extend<T: Iterator<A>>(&mut self, mut iterator: T) {
+ for elt in iterator {
self.push_back(elt);
}
}
}
impl<K: TotalOrd, V> FromIterator<(K, V)> for TreeMap<K, V> {
- fn from_iterator<T: Iterator<(K, V)>>(iter: &mut T) -> TreeMap<K, V> {
+ fn from_iterator<T: Iterator<(K, V)>>(iter: T) -> TreeMap<K, V> {
let mut map = TreeMap::new();
map.extend(iter);
map
impl<K: TotalOrd, V> Extendable<(K, V)> for TreeMap<K, V> {
#[inline]
- fn extend<T: Iterator<(K, V)>>(&mut self, iter: &mut T) {
- for (k, v) in *iter {
+ fn extend<T: Iterator<(K, V)>>(&mut self, mut iter: T) {
+ for (k, v) in iter {
self.insert(k, v);
}
}
}
impl<T: TotalOrd> FromIterator<T> for TreeSet<T> {
- fn from_iterator<Iter: Iterator<T>>(iter: &mut Iter) -> TreeSet<T> {
+ fn from_iterator<Iter: Iterator<T>>(iter: Iter) -> TreeSet<T> {
let mut set = TreeSet::new();
set.extend(iter);
set
impl<T: TotalOrd> Extendable<T> for TreeSet<T> {
#[inline]
- fn extend<Iter: Iterator<T>>(&mut self, iter: &mut Iter) {
- for elem in *iter {
+ fn extend<Iter: Iterator<T>>(&mut self, mut iter: Iter) {
+ for elem in iter {
self.insert(elem);
}
}
}
impl<T> FromIterator<(uint, T)> for TrieMap<T> {
- fn from_iterator<Iter: Iterator<(uint, T)>>(iter: &mut Iter) -> TrieMap<T> {
+ fn from_iterator<Iter: Iterator<(uint, T)>>(iter: Iter) -> TrieMap<T> {
let mut map = TrieMap::new();
map.extend(iter);
map
}
impl<T> Extendable<(uint, T)> for TrieMap<T> {
- fn extend<Iter: Iterator<(uint, T)>>(&mut self, iter: &mut Iter) {
- for (k, v) in *iter {
+ fn extend<Iter: Iterator<(uint, T)>>(&mut self, mut iter: Iter) {
+ for (k, v) in iter {
self.insert(k, v);
}
}
}
impl FromIterator<uint> for TrieSet {
- fn from_iterator<Iter: Iterator<uint>>(iter: &mut Iter) -> TrieSet {
+ fn from_iterator<Iter: Iterator<uint>>(iter: Iter) -> TrieSet {
let mut set = TrieSet::new();
set.extend(iter);
set
}
impl Extendable<uint> for TrieSet {
- fn extend<Iter: Iterator<uint>>(&mut self, iter: &mut Iter) {
- for elem in *iter {
+ fn extend<Iter: Iterator<uint>>(&mut self, mut iter: Iter) {
+ for elem in iter {
self.insert(elem);
}
}
// so we don't need to check the children
return Some(path);
} else {
- self.todo.extend(&mut list_dir_sorted(&path).move_iter().map(|x|(x,idx+1)));
+ self.todo.extend(list_dir_sorted(&path).move_iter().map(|x|(x,idx+1)));
}
}
}
nums.push(BigInt::from_slice(Minus, *s));
}
nums.push(Zero::zero());
- nums.extend(&mut vs.iter().map(|s| BigInt::from_slice(Plus, *s)));
+ nums.extend(vs.iter().map(|s| BigInt::from_slice(Plus, *s)));
for (i, ni) in nums.iter().enumerate() {
for (j0, nj) in nums.slice(i, nums.len()).iter().enumerate() {
let ar = get_ar_prog(sess);
let mut args = vec!(args.to_owned());
- let mut paths = paths.iter().map(|p| p.as_str().unwrap().to_owned());
- args.extend(&mut paths);
+ let paths = paths.iter().map(|p| p.as_str().unwrap().to_owned());
+ args.extend(paths);
debug!("{} {}", ar, args.connect(" "));
match cwd {
Some(p) => { debug!("inside {}", p.display()); }
// Finally, add all the renamed files to this archive
let mut args = vec!(&self.dst);
- args.extend(&mut inputs.iter());
+ args.extend(inputs.iter());
run_ar(self.sess, "r", None, args.as_slice());
Ok(())
}
return vec!(CrateTypeExecutable)
}
let mut base = session.opts.crate_types.clone();
- let mut iter = attrs.iter().filter_map(|a| {
+ let iter = attrs.iter().filter_map(|a| {
if a.name().equiv(&("crate_type")) {
match a.value_str() {
Some(ref n) if n.equiv(&("rlib")) => Some(CrateTypeRlib),
None
}
});
- base.extend(&mut iter);
+ base.extend(iter);
if base.len() == 0 {
base.push(CrateTypeExecutable);
}
}
None => {}
}
- llargs.extend(&mut args.iter().map(|arg| arg.val));
+ llargs.extend(args.iter().map(|arg| arg.val));
let retval = Call(bcx, fn_ptr, llargs.as_slice(), []);
if type_is_zero_size(ccx, f.sig.output) || fcx.llretptr.get().is_some() {
}
// ... then explicit args.
- let mut input_tys = inputs.iter().map(|&arg_ty| type_of_explicit_arg(cx, arg_ty));
- atys.extend(&mut input_tys);
+ let input_tys = inputs.iter().map(|&arg_ty| type_of_explicit_arg(cx, arg_ty));
+ atys.extend(input_tys);
// Use the output as the actual return value if it's immediate.
if use_out_pointer || return_type_is_void(cx, output) {
StructItem(mut i) => {
let mut foo = Vec::new(); swap(&mut foo, &mut i.fields);
let num_fields = foo.len();
- i.fields.extend(&mut foo.move_iter().filter_map(|x| self.fold_item(x)));
+ i.fields.extend(foo.move_iter().filter_map(|x| self.fold_item(x)));
i.fields_stripped |= num_fields != i.fields.len();
StructItem(i)
},
EnumItem(mut i) => {
let mut foo = Vec::new(); swap(&mut foo, &mut i.variants);
let num_variants = foo.len();
- i.variants.extend(&mut foo.move_iter().filter_map(|x| self.fold_item(x)));
+ i.variants.extend(foo.move_iter().filter_map(|x| self.fold_item(x)));
i.variants_stripped |= num_variants != i.variants.len();
EnumItem(i)
},
}
}
let mut foo = Vec::new(); swap(&mut foo, &mut i.methods);
- i.methods.extend(&mut foo.move_iter().filter_map(|x| vtrm(self, x)));
+ i.methods.extend(foo.move_iter().filter_map(|x| vtrm(self, x)));
TraitItem(i)
},
ImplItem(mut i) => {
let mut foo = Vec::new(); swap(&mut foo, &mut i.methods);
- i.methods.extend(&mut foo.move_iter().filter_map(|x| self.fold_item(x)));
+ i.methods.extend(foo.move_iter().filter_map(|x| self.fold_item(x)));
ImplItem(i)
},
VariantItem(i) => {
let mut foo = Vec::new(); swap(&mut foo, &mut j.fields);
let num_fields = foo.len();
let c = |x| self.fold_item(x);
- j.fields.extend(&mut foo.move_iter().filter_map(c));
+ j.fields.extend(foo.move_iter().filter_map(c));
j.fields_stripped |= num_fields != j.fields.len();
VariantItem(Variant {kind: StructVariant(j), ..i2})
},
/// Conversion from an `Iterator`
pub trait FromIterator<A> {
/// Build a container with elements from an external iterator.
- fn from_iterator<T: Iterator<A>>(iterator: &mut T) -> Self;
+ fn from_iterator<T: Iterator<A>>(iterator: T) -> Self;
}
/// A type growable from an `Iterator` implementation
pub trait Extendable<A>: FromIterator<A> {
/// Extend a container with the elements yielded by an iterator
- fn extend<T: Iterator<A>>(&mut self, iterator: &mut T);
+ fn extend<T: Iterator<A>>(&mut self, iterator: T);
}
/// An interface for dealing with "external iterators". These types of iterators
/// ```
#[inline]
fn collect<B: FromIterator<A>>(&mut self) -> B {
- FromIterator::from_iterator(self)
+ FromIterator::from_iterator(self.by_ref())
}
/// Loops through `n` iterations, returning the `n`th element of the
#[test]
fn test_counter_from_iter() {
let mut it = count(0, 5).take(10);
- let xs: ~[int] = FromIterator::from_iterator(&mut it);
+ let xs: ~[int] = FromIterator::from_iterator(it);
assert_eq!(xs, ~[0, 5, 10, 15, 20, 25, 30, 35, 40, 45]);
}
}
});
- let v: V = FromIterator::from_iterator(&mut iter);
+ let v: V = FromIterator::from_iterator(iter.by_ref());
if iter.state {
None
(None, None) => break,
(Some(a), None) => {
comps.push(a);
- comps.extend(&mut ita);
+ comps.extend(ita.by_ref());
break;
}
(None, _) => comps.push(dot_dot_static),
comps.push(dot_dot_static);
}
comps.push(a);
- comps.extend(&mut ita);
+ comps.extend(ita.by_ref());
break;
}
}
(Some(a), None) => {
comps.push(a);
if !a_verb {
- comps.extend(&mut ita);
+ comps.extend(ita.by_ref());
break;
}
}
}
comps.push(a);
if !a_verb {
- comps.extend(&mut ita);
+ comps.extend(ita.by_ref());
break;
}
}
}
});
- let v: V = FromIterator::from_iterator(&mut iter);
+ let v: V = FromIterator::from_iterator(iter.by_ref());
match iter.state {
Some(err) => Err(err),
pub type RevMoveItems<T> = Rev<MoveItems<T>>;
impl<A> FromIterator<A> for ~[A] {
- fn from_iterator<T: Iterator<A>>(iterator: &mut T) -> ~[A] {
+ fn from_iterator<T: Iterator<A>>(mut iterator: T) -> ~[A] {
let (lower, _) = iterator.size_hint();
let mut xs = with_capacity(lower);
- for x in *iterator {
+ for x in iterator {
xs.push(x);
}
xs
}
impl<A> Extendable<A> for ~[A] {
- fn extend<T: Iterator<A>>(&mut self, iterator: &mut T) {
+ fn extend<T: Iterator<A>>(&mut self, mut iterator: T) {
let (lower, _) = iterator.size_hint();
let len = self.len();
self.reserve_exact(len + lower);
- for x in *iterator {
+ for x in iterator {
self.push(x);
}
}
impl FromIterator<char> for ~str {
#[inline]
- fn from_iterator<T: Iterator<char>>(iterator: &mut T) -> ~str {
+ fn from_iterator<T: Iterator<char>>(iterator: T) -> ~str {
let (lower, _) = iterator.size_hint();
let mut buf = with_capacity(lower);
buf.extend(iterator);
impl Extendable<char> for ~str {
#[inline]
- fn extend<T: Iterator<char>>(&mut self, iterator: &mut T) {
+ fn extend<T: Iterator<char>>(&mut self, mut iterator: T) {
let (lower, _) = iterator.size_hint();
let reserve = lower + self.len();
self.reserve(reserve);
- for ch in *iterator {
+ for ch in iterator {
self.push_char(ch)
}
}
let mut cpy = data.clone();
let other = "abc";
let mut it = other.chars();
- cpy.extend(&mut it);
+ cpy.extend(it);
assert_eq!(cpy, data + other);
}
}
impl<T> FromIterator<T> for Vec<T> {
- fn from_iterator<I:Iterator<T>>(iterator: &mut I) -> Vec<T> {
+ fn from_iterator<I:Iterator<T>>(mut iterator: I) -> Vec<T> {
let (lower, _) = iterator.size_hint();
let mut vector = Vec::with_capacity(lower);
- for element in *iterator {
+ for element in iterator {
vector.push(element)
}
vector
}
impl<T> Extendable<T> for Vec<T> {
- fn extend<I: Iterator<T>>(&mut self, iterator: &mut I) {
+ fn extend<I: Iterator<T>>(&mut self, mut iterator: I) {
let (lower, _) = iterator.size_hint();
self.reserve_additional(lower);
- for element in *iterator {
+ for element in iterator {
self.push(element)
}
}
let mut v = Vec::new();
let mut w = Vec::new();
- v.extend(&mut range(0, 3));
+ v.extend(range(0, 3));
for i in range(0, 3) { w.push(i) }
assert_eq!(v, w);
- v.extend(&mut range(3, 10));
+ v.extend(range(3, 10));
for i in range(3, 10) { w.push(i) }
assert_eq!(v, w);
pub fn mod_path(&self) -> Vec<ast::Ident> {
let mut v = Vec::new();
v.push(token::str_to_ident(self.ecfg.crate_id.name));
- v.extend(&mut self.mod_path.iter().map(|a| *a));
+ v.extend(self.mod_path.iter().map(|a| *a));
return v;
}
pub fn bt_push(&mut self, ei: codemap::ExpnInfo) {
let mut ty_params = ty_params.into_vec();
// Copy the lifetimes
- lifetimes.extend(&mut generics.lifetimes.iter().map(|l| *l));
+ lifetimes.extend(generics.lifetimes.iter().map(|l| *l));
// Create the type parameters.
- ty_params.extend(&mut generics.ty_params.iter().map(|ty_param| {
+ ty_params.extend(generics.ty_params.iter().map(|ty_param| {
// I don't think this can be moved out of the loop, since
// a TyParamBound requires an ast id
let mut bounds =
let mut items: SmallVector<@ast::Item> = SmallVector::zero();
dec_fn(fld.cx, attr.span, attr.node.value, it,
|item| items.push(item));
- decorator_items.extend(&mut items.move_iter()
+ decorator_items.extend(items.move_iter()
.flat_map(|item| expand_item(item, fld).move_iter()));
fld.cx.bt_pop();
}
impl<T> FromIterator<T> for OwnedSlice<T> {
- fn from_iterator<I: Iterator<T>>(iter: &mut I) -> OwnedSlice<T> {
+ fn from_iterator<I: Iterator<T>>(mut iter: I) -> OwnedSlice<T> {
OwnedSlice::from_vec(iter.collect())
}
}
}
impl<T> FromIterator<T> for SmallVector<T> {
- fn from_iterator<I: Iterator<T>>(iter: &mut I) -> SmallVector<T> {
+ fn from_iterator<I: Iterator<T>>(iter: I) -> SmallVector<T> {
let mut v = Zero;
- for val in *iter {
- v.push(val);
- }
+ v.extend(iter);
v
}
}
impl<T> Extendable<T> for SmallVector<T> {
- fn extend<I: Iterator<T>>(&mut self, iter: &mut I) {
- for val in *iter {
+ fn extend<I: Iterator<T>>(&mut self, mut iter: I) {
+ for val in iter {
self.push(val);
}
}