1 // Copyright 2012-2014 The Rust Project Developers. See the COPYRIGHT
2 // file at the top-level directory of this distribution and at
3 // http://rust-lang.org/COPYRIGHT.
5 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
6 // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
7 // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
8 // option. This file may not be copied, modified, or distributed
9 // except according to those terms.
13 Utilities for vector manipulation
15 The `vec` module contains useful code to help work with vector values.
16 Vectors are Rust's list type. Vectors contain zero or more values of
20 let int_vector = [1,2,3];
21 let str_vector = ["one", "two", "three"];
24 This is a big module, but for a high-level overview:
28 Several structs that are useful for vectors, such as `Items`, which
29 represents iteration over a vector.
33 A number of traits add methods that allow you to accomplish tasks with vectors.
35 Traits defined for the `&[T]` type (a vector slice), have methods that can be
36 called on either owned vectors, denoted `~[T]`, or on vector slices themselves.
37 These traits include `ImmutableVector`, and `MutableVector` for the `&mut [T]`
40 An example is the method `.slice(a, b)` that returns an immutable "view" into
41 a vector or a vector slice from the index interval `[a, b)`:
44 let numbers = [0, 1, 2];
45 let last_numbers = numbers.slice(1, 3);
46 // last_numbers is now &[1, 2]
49 Traits defined for the `~[T]` type, like `OwnedVector`, can only be called
50 on such vectors. These methods deal with adding elements or otherwise changing
51 the allocation of the vector.
53 An example is the method `.push(element)` that will add an element at the end
57 let mut numbers = vec![0, 1, 2];
59 // numbers is now vec![0, 1, 2, 7];
62 ## Implementations of other traits
64 Vectors are a very useful type, and so there's several implementations of
65 traits from other modules. Some notable examples:
68 * `Eq`, `Ord`, `Eq`, `Ord` -- vectors can be compared,
69 if the element type defines the corresponding trait.
73 The method `iter()` returns an iteration value for a vector or a vector slice.
74 The iterator yields references to the vector's elements, so if the element
75 type of the vector is `int`, the element type of the iterator is `&int`.
78 let numbers = [0, 1, 2];
79 for &x in numbers.iter() {
80 println!("{} is a number!", x);
84 * `.mut_iter()` returns an iterator that allows modifying each value.
85 * `.move_iter()` converts an owned vector into an iterator that
86 moves out a value from the vector each iteration.
87 * Further iterators exist that split, chunk or permute the vector.
89 ## Function definitions
91 There are a number of free functions that create or take vectors, for example:
93 * Creating a vector, like `from_elem` and `from_fn`
94 * Creating a vector with a given size: `with_capacity`
95 * Modifying a vector and returning it, like `append`
96 * Operations on paired elements, like `unzip`.
100 #![doc(primitive = "slice")]
102 use core::prelude::*;
105 use core::mem::size_of;
108 use core::iter::{range_step, MultiplicativeIterator};
113 pub use core::slice::{ref_slice, mut_ref_slice, Splits, Windows};
114 pub use core::slice::{Chunks, Vector, ImmutableVector, ImmutableEqVector};
115 pub use core::slice::{ImmutableOrdVector, MutableVector, Items, MutItems};
116 pub use core::slice::{MutSplits, MutChunks};
117 pub use core::slice::{bytes, MutableCloneableVector};
119 // Functional utilities
121 #[allow(missing_doc)]
122 pub trait VectorVector<T> {
123 // FIXME #5898: calling these .concat and .connect conflicts with
124 // StrVector::con{cat,nect}, since they have generic contents.
125 /// Flattens a vector of vectors of T into a single vector of T.
126 fn concat_vec(&self) -> Vec<T>;
128 /// Concatenate a vector of vectors, placing a given separator between each.
129 fn connect_vec(&self, sep: &T) -> Vec<T>;
132 impl<'a, T: Clone, V: Vector<T>> VectorVector<T> for &'a [V] {
133 fn concat_vec(&self) -> Vec<T> {
134 let size = self.iter().fold(0u, |acc, v| acc + v.as_slice().len());
135 let mut result = Vec::with_capacity(size);
136 for v in self.iter() {
137 result.push_all(v.as_slice())
142 fn connect_vec(&self, sep: &T) -> Vec<T> {
143 let size = self.iter().fold(0u, |acc, v| acc + v.as_slice().len());
144 let mut result = Vec::with_capacity(size + self.len());
145 let mut first = true;
146 for v in self.iter() {
147 if first { first = false } else { result.push(sep.clone()) }
148 result.push_all(v.as_slice())
154 /// An Iterator that yields the element swaps needed to produce
155 /// a sequence of all possible permutations for an indexed sequence of
156 /// elements. Each permutation is only a single swap apart.
158 /// The Steinhaus–Johnson–Trotter algorithm is used.
160 /// Generates even and odd permutations alternately.
162 /// The last generated swap is always (0, 1), and it returns the
163 /// sequence to its initial order.
164 pub struct ElementSwaps {
165 sdir: Vec<SizeDirection>,
166 /// If true, emit the last swap that returns the sequence to initial state
172 /// Create an `ElementSwaps` iterator for a sequence of `length` elements
173 pub fn new(length: uint) -> ElementSwaps {
174 // Initialize `sdir` with a direction that position should move in
175 // (all negative at the beginning) and the `size` of the
176 // element (equal to the original index).
179 sdir: range(0, length).map(|i| SizeDirection{ size: i, dir: Neg }).collect(),
185 enum Direction { Pos, Neg }
187 /// An Index and Direction together
188 struct SizeDirection {
193 impl Iterator<(uint, uint)> for ElementSwaps {
195 fn next(&mut self) -> Option<(uint, uint)> {
196 fn new_pos(i: uint, s: Direction) -> uint {
197 i + match s { Pos => 1, Neg => -1 }
200 // Find the index of the largest mobile element:
201 // The direction should point into the vector, and the
202 // swap should be with a smaller `size` element.
203 let max = self.sdir.iter().map(|&x| x).enumerate()
205 new_pos(i, sd.dir) < self.sdir.len() &&
206 self.sdir.get(new_pos(i, sd.dir)).size < sd.size)
207 .max_by(|&(_, sd)| sd.size);
210 let j = new_pos(i, sd.dir);
211 self.sdir.as_mut_slice().swap(i, j);
213 // Swap the direction of each larger SizeDirection
214 for x in self.sdir.mut_iter() {
215 if x.size > sd.size {
216 x.dir = match x.dir { Pos => Neg, Neg => Pos };
219 self.swaps_made += 1;
222 None => if self.emit_reset {
223 self.emit_reset = false;
224 if self.sdir.len() > 1 {
226 self.swaps_made += 1;
229 // Vector is of the form [] or [x], and the only permutation is itself
230 self.swaps_made += 1;
238 fn size_hint(&self) -> (uint, Option<uint>) {
239 // For a vector of size n, there are exactly n! permutations.
240 let n = range(2, self.sdir.len() + 1).product();
241 (n - self.swaps_made, Some(n - self.swaps_made))
245 /// An Iterator that uses `ElementSwaps` to iterate through
246 /// all possible permutations of a vector.
248 /// The first iteration yields a clone of the vector as it is,
249 /// then each successive element is the vector with one
252 /// Generates even and odd permutations alternately.
253 pub struct Permutations<T> {
258 impl<T: Clone> Iterator<Vec<T>> for Permutations<T> {
260 fn next(&mut self) -> Option<Vec<T>> {
261 match self.swaps.next() {
263 Some((0,0)) => Some(self.v.clone()),
265 let elt = self.v.clone();
266 self.v.as_mut_slice().swap(a, b);
273 fn size_hint(&self) -> (uint, Option<uint>) {
274 self.swaps.size_hint()
278 /// Extension methods for vector slices with cloneable elements
279 pub trait CloneableVector<T> {
280 /// Copy `self` into a new owned vector
281 fn to_owned(&self) -> Vec<T>;
283 /// Convert `self` into an owned vector, not making a copy if possible.
284 fn into_owned(self) -> Vec<T>;
287 /// Extension methods for vector slices
288 impl<'a, T: Clone> CloneableVector<T> for &'a [T] {
289 /// Returns a copy of `v`.
291 fn to_owned(&self) -> Vec<T> { Vec::from_slice(*self) }
294 fn into_owned(self) -> Vec<T> { self.to_owned() }
297 /// Extension methods for vectors containing `Clone` elements.
298 pub trait ImmutableCloneableVector<T> {
299 /// Partitions the vector into two vectors `(A,B)`, where all
300 /// elements of `A` satisfy `f` and all elements of `B` do not.
301 fn partitioned(&self, f: |&T| -> bool) -> (Vec<T>, Vec<T>);
303 /// Create an iterator that yields every possible permutation of the
304 /// vector in succession.
305 fn permutations(self) -> Permutations<T>;
308 impl<'a,T:Clone> ImmutableCloneableVector<T> for &'a [T] {
310 fn partitioned(&self, f: |&T| -> bool) -> (Vec<T>, Vec<T>) {
311 let mut lefts = Vec::new();
312 let mut rights = Vec::new();
314 for elt in self.iter() {
316 lefts.push((*elt).clone());
318 rights.push((*elt).clone());
325 fn permutations(self) -> Permutations<T> {
327 swaps: ElementSwaps::new(self.len()),
334 fn insertion_sort<T>(v: &mut [T], compare: |&T, &T| -> Ordering) {
335 let len = v.len() as int;
336 let buf_v = v.as_mut_ptr();
339 for i in range(1, len) {
340 // j satisfies: 0 <= j <= i;
344 let read_ptr = buf_v.offset(i) as *T;
346 // find where to insert, we need to do strict <,
347 // rather than <=, to maintain stability.
349 // 0 <= j - 1 < len, so .offset(j - 1) is in bounds.
351 compare(&*read_ptr, &*buf_v.offset(j - 1)) == Less {
355 // shift everything to the right, to make space to
356 // insert this value.
358 // j + 1 could be `len` (for the last `i`), but in
359 // that case, `i == j` so we don't copy. The
360 // `.offset(j)` is always in bounds.
363 let tmp = ptr::read(read_ptr);
364 ptr::copy_memory(buf_v.offset(j + 1),
367 ptr::copy_nonoverlapping_memory(buf_v.offset(j),
376 fn merge_sort<T>(v: &mut [T], compare: |&T, &T| -> Ordering) {
377 // warning: this wildly uses unsafe.
378 static BASE_INSERTION: uint = 32;
379 static LARGE_INSERTION: uint = 16;
381 // FIXME #12092: smaller insertion runs seems to make sorting
382 // vectors of large elements a little faster on some platforms,
383 // but hasn't been tested/tuned extensively
384 let insertion = if size_of::<T>() <= 16 {
392 // short vectors get sorted in-place via insertion sort to avoid allocations
393 if len <= insertion {
394 insertion_sort(v, compare);
398 // allocate some memory to use as scratch memory, we keep the
399 // length 0 so we can keep shallow copies of the contents of `v`
400 // without risking the dtors running on an object twice if
402 let mut working_space = Vec::with_capacity(2 * len);
403 // these both are buffers of length `len`.
404 let mut buf_dat = working_space.as_mut_ptr();
405 let mut buf_tmp = unsafe {buf_dat.offset(len as int)};
408 let buf_v = v.as_ptr();
410 // step 1. sort short runs with insertion sort. This takes the
411 // values from `v` and sorts them into `buf_dat`, leaving that
412 // with sorted runs of length INSERTION.
414 // We could hardcode the sorting comparisons here, and we could
415 // manipulate/step the pointers themselves, rather than repeatedly
417 for start in range_step(0, len, insertion) {
419 for i in range(start, cmp::min(start + insertion, len)) {
420 // j satisfies: start <= j <= i;
421 let mut j = i as int;
424 let read_ptr = buf_v.offset(i as int);
426 // find where to insert, we need to do strict <,
427 // rather than <=, to maintain stability.
429 // start <= j - 1 < len, so .offset(j - 1) is in
431 while j > start as int &&
432 compare(&*read_ptr, &*buf_dat.offset(j - 1)) == Less {
436 // shift everything to the right, to make space to
437 // insert this value.
439 // j + 1 could be `len` (for the last `i`), but in
440 // that case, `i == j` so we don't copy. The
441 // `.offset(j)` is always in bounds.
442 ptr::copy_memory(buf_dat.offset(j + 1),
445 ptr::copy_nonoverlapping_memory(buf_dat.offset(j), read_ptr, 1);
450 // step 2. merge the sorted runs.
451 let mut width = insertion;
453 // merge the sorted runs of length `width` in `buf_dat` two at
454 // a time, placing the result in `buf_tmp`.
456 // 0 <= start <= len.
457 for start in range_step(0, len, 2 * width) {
458 // manipulate pointers directly for speed (rather than
459 // using a `for` loop with `range` and `.offset` inside
462 // the end of the first run & start of the
463 // second. Offset of `len` is defined, since this is
464 // precisely one byte past the end of the object.
465 let right_start = buf_dat.offset(cmp::min(start + width, len) as int);
466 // end of the second. Similar reasoning to the above re safety.
467 let right_end_idx = cmp::min(start + 2 * width, len);
468 let right_end = buf_dat.offset(right_end_idx as int);
470 // the pointers to the elements under consideration
471 // from the two runs.
473 // both of these are in bounds.
474 let mut left = buf_dat.offset(start as int);
475 let mut right = right_start;
477 // where we're putting the results, it is a run of
478 // length `2*width`, so we step it once for each step
479 // of either `left` or `right`. `buf_tmp` has length
480 // `len`, so these are in bounds.
481 let mut out = buf_tmp.offset(start as int);
482 let out_end = buf_tmp.offset(right_end_idx as int);
484 while out < out_end {
485 // Either the left or the right run are exhausted,
486 // so just copy the remainder from the other run
487 // and move on; this gives a huge speed-up (order
488 // of 25%) for mostly sorted vectors (the best
490 if left == right_start {
491 // the number remaining in this run.
492 let elems = (right_end as uint - right as uint) / mem::size_of::<T>();
493 ptr::copy_nonoverlapping_memory(out, &*right, elems);
495 } else if right == right_end {
496 let elems = (right_start as uint - left as uint) / mem::size_of::<T>();
497 ptr::copy_nonoverlapping_memory(out, &*left, elems);
501 // check which side is smaller, and that's the
502 // next element for the new run.
504 // `left < right_start` and `right < right_end`,
505 // so these are valid.
506 let to_copy = if compare(&*left, &*right) == Greater {
511 ptr::copy_nonoverlapping_memory(out, &*to_copy, 1);
517 mem::swap(&mut buf_dat, &mut buf_tmp);
522 // write the result to `v` in one go, so that there are never two copies
523 // of the same object in `v`.
525 ptr::copy_nonoverlapping_memory(v.as_mut_ptr(), &*buf_dat, len);
528 // increment the pointer, returning the old pointer.
530 unsafe fn step<T>(ptr: &mut *mut T) -> *mut T {
532 *ptr = ptr.offset(1);
537 /// Extension methods for vectors such that their elements are
539 pub trait MutableVectorAllocating<'a, T> {
540 /// Sort the vector, in place, using `compare` to compare
543 /// This sort is `O(n log n)` worst-case and stable, but allocates
544 /// approximately `2 * n`, where `n` is the length of `self`.
549 /// let mut v = [5i, 4, 1, 3, 2];
550 /// v.sort_by(|a, b| a.cmp(b));
551 /// assert!(v == [1, 2, 3, 4, 5]);
553 /// // reverse sorting
554 /// v.sort_by(|a, b| b.cmp(a));
555 /// assert!(v == [5, 4, 3, 2, 1]);
557 fn sort_by(self, compare: |&T, &T| -> Ordering);
560 * Consumes `src` and moves as many elements as it can into `self`
561 * from the range [start,end).
563 * Returns the number of elements copied (the shorter of self.len()
568 * * src - A mutable vector of `T`
569 * * start - The index into `src` to start copying from
570 * * end - The index into `str` to stop copying from
572 fn move_from(self, src: Vec<T>, start: uint, end: uint) -> uint;
575 impl<'a,T> MutableVectorAllocating<'a, T> for &'a mut [T] {
577 fn sort_by(self, compare: |&T, &T| -> Ordering) {
578 merge_sort(self, compare)
582 fn move_from(self, mut src: Vec<T>, start: uint, end: uint) -> uint {
583 for (a, b) in self.mut_iter().zip(src.mut_slice(start, end).mut_iter()) {
586 cmp::min(self.len(), end-start)
590 /// Methods for mutable vectors with orderable elements, such as
591 /// in-place sorting.
592 pub trait MutableOrdVector<T> {
593 /// Sort the vector, in place.
595 /// This is equivalent to `self.sort_by(|a, b| a.cmp(b))`.
600 /// let mut v = [-5, 4, 1, -3, 2];
603 /// assert!(v == [-5, -3, 1, 2, 4]);
607 /// Mutates the slice to the next lexicographic permutation.
609 /// Returns `true` if successful, `false` if the slice is at the last-ordered permutation.
614 /// let v = &mut [0, 1, 2];
615 /// v.next_permutation();
616 /// assert_eq!(v, &mut [0, 2, 1]);
617 /// v.next_permutation();
618 /// assert_eq!(v, &mut [1, 0, 2]);
620 fn next_permutation(self) -> bool;
622 /// Mutates the slice to the previous lexicographic permutation.
624 /// Returns `true` if successful, `false` if the slice is at the first-ordered permutation.
629 /// let v = &mut [1, 0, 2];
630 /// v.prev_permutation();
631 /// assert_eq!(v, &mut [0, 2, 1]);
632 /// v.prev_permutation();
633 /// assert_eq!(v, &mut [0, 1, 2]);
635 fn prev_permutation(self) -> bool;
638 impl<'a, T: Ord> MutableOrdVector<T> for &'a mut [T] {
641 self.sort_by(|a,b| a.cmp(b))
644 fn next_permutation(self) -> bool {
645 // These cases only have 1 permutation each, so we can't do anything.
646 if self.len() < 2 { return false; }
648 // Step 1: Identify the longest, rightmost weakly decreasing part of the vector
649 let mut i = self.len() - 1;
650 while i > 0 && self[i-1] >= self[i] {
654 // If that is the entire vector, this is the last-ordered permutation.
659 // Step 2: Find the rightmost element larger than the pivot (i-1)
660 let mut j = self.len() - 1;
661 while j >= i && self[j] <= self[i-1] {
665 // Step 3: Swap that element with the pivot
668 // Step 4: Reverse the (previously) weakly decreasing part
669 self.mut_slice_from(i).reverse();
674 fn prev_permutation(self) -> bool {
675 // These cases only have 1 permutation each, so we can't do anything.
676 if self.len() < 2 { return false; }
678 // Step 1: Identify the longest, rightmost weakly increasing part of the vector
679 let mut i = self.len() - 1;
680 while i > 0 && self[i-1] <= self[i] {
684 // If that is the entire vector, this is the first-ordered permutation.
689 // Step 2: Reverse the weakly increasing part
690 self.mut_slice_from(i).reverse();
692 // Step 3: Find the rightmost element equal to or bigger than the pivot (i-1)
693 let mut j = self.len() - 1;
694 while j >= i && self[j-1] < self[i-1] {
698 // Step 4: Swap that element with the pivot
705 /// Unsafe operations
707 pub use core::slice::raw::{buf_as_slice, mut_buf_as_slice};
708 pub use core::slice::raw::{shift_ptr, pop_ptr};
714 use std::default::Default;
717 use std::rand::{Rng, task_rng};
725 fn square(n: uint) -> uint { n * n }
727 fn is_odd(n: &uint) -> bool { *n % 2u == 1u }
731 // Test on-stack from_fn.
732 let mut v = Vec::from_fn(3u, square);
734 let v = v.as_slice();
735 assert_eq!(v.len(), 3u);
736 assert_eq!(v[0], 0u);
737 assert_eq!(v[1], 1u);
738 assert_eq!(v[2], 4u);
741 // Test on-heap from_fn.
742 v = Vec::from_fn(5u, square);
744 let v = v.as_slice();
745 assert_eq!(v.len(), 5u);
746 assert_eq!(v[0], 0u);
747 assert_eq!(v[1], 1u);
748 assert_eq!(v[2], 4u);
749 assert_eq!(v[3], 9u);
750 assert_eq!(v[4], 16u);
755 fn test_from_elem() {
756 // Test on-stack from_elem.
757 let mut v = Vec::from_elem(2u, 10u);
759 let v = v.as_slice();
760 assert_eq!(v.len(), 2u);
761 assert_eq!(v[0], 10u);
762 assert_eq!(v[1], 10u);
765 // Test on-heap from_elem.
766 v = Vec::from_elem(6u, 20u);
768 let v = v.as_slice();
769 assert_eq!(v[0], 20u);
770 assert_eq!(v[1], 20u);
771 assert_eq!(v[2], 20u);
772 assert_eq!(v[3], 20u);
773 assert_eq!(v[4], 20u);
774 assert_eq!(v[5], 20u);
780 let xs: [int, ..0] = [];
781 assert!(xs.is_empty());
782 assert!(![0].is_empty());
786 fn test_len_divzero() {
789 let v1 : &[Z] = &[[]];
790 let v2 : &[Z] = &[[], []];
791 assert_eq!(mem::size_of::<Z>(), 0);
792 assert_eq!(v0.len(), 0);
793 assert_eq!(v1.len(), 1);
794 assert_eq!(v2.len(), 2);
799 let mut a = vec![11];
800 assert_eq!(a.as_slice().get(1), None);
802 assert_eq!(a.as_slice().get(1).unwrap(), &12);
803 a = vec![11, 12, 13];
804 assert_eq!(a.as_slice().get(1).unwrap(), &12);
810 assert_eq!(a.as_slice().head(), None);
812 assert_eq!(a.as_slice().head().unwrap(), &11);
814 assert_eq!(a.as_slice().head().unwrap(), &11);
819 let mut a = vec![11];
820 assert_eq!(a.tail(), &[]);
822 assert_eq!(a.tail(), &[12]);
827 fn test_tail_empty() {
828 let a: Vec<int> = vec![];
834 let mut a = vec![11, 12, 13];
835 assert_eq!(a.tailn(0), &[11, 12, 13]);
836 a = vec![11, 12, 13];
837 assert_eq!(a.tailn(2), &[13]);
842 fn test_tailn_empty() {
843 let a: Vec<int> = vec![];
849 let mut a = vec![11];
850 assert_eq!(a.init(), &[]);
852 assert_eq!(a.init(), &[11]);
857 fn test_init_empty() {
858 let a: Vec<int> = vec![];
864 let mut a = vec![11, 12, 13];
865 assert_eq!(a.as_slice().initn(0), &[11, 12, 13]);
866 a = vec![11, 12, 13];
867 assert_eq!(a.as_slice().initn(2), &[11]);
872 fn test_initn_empty() {
873 let a: Vec<int> = vec![];
874 a.as_slice().initn(2);
880 assert_eq!(a.as_slice().last(), None);
882 assert_eq!(a.as_slice().last().unwrap(), &11);
884 assert_eq!(a.as_slice().last().unwrap(), &12);
889 // Test fixed length vector.
890 let vec_fixed = [1, 2, 3, 4];
891 let v_a = vec_fixed.slice(1u, vec_fixed.len()).to_owned();
892 assert_eq!(v_a.len(), 3u);
893 let v_a = v_a.as_slice();
894 assert_eq!(v_a[0], 2);
895 assert_eq!(v_a[1], 3);
896 assert_eq!(v_a[2], 4);
899 let vec_stack = &[1, 2, 3];
900 let v_b = vec_stack.slice(1u, 3u).to_owned();
901 assert_eq!(v_b.len(), 2u);
902 let v_b = v_b.as_slice();
903 assert_eq!(v_b[0], 2);
904 assert_eq!(v_b[1], 3);
907 let vec_unique = vec![1, 2, 3, 4, 5, 6];
908 let v_d = vec_unique.slice(1u, 6u).to_owned();
909 assert_eq!(v_d.len(), 5u);
910 let v_d = v_d.as_slice();
911 assert_eq!(v_d[0], 2);
912 assert_eq!(v_d[1], 3);
913 assert_eq!(v_d[2], 4);
914 assert_eq!(v_d[3], 5);
915 assert_eq!(v_d[4], 6);
919 fn test_slice_from() {
920 let vec = &[1, 2, 3, 4];
921 assert_eq!(vec.slice_from(0), vec);
922 assert_eq!(vec.slice_from(2), &[3, 4]);
923 assert_eq!(vec.slice_from(4), &[]);
928 let vec = &[1, 2, 3, 4];
929 assert_eq!(vec.slice_to(4), vec);
930 assert_eq!(vec.slice_to(2), &[1, 2]);
931 assert_eq!(vec.slice_to(0), &[]);
939 assert_eq!(v.len(), 0);
940 assert_eq!(e, Some(5));
948 fn test_swap_remove() {
949 let mut v = vec![1, 2, 3, 4, 5];
950 let mut e = v.swap_remove(0);
951 assert_eq!(e, Some(1));
952 assert_eq!(v, vec![5, 2, 3, 4]);
953 e = v.swap_remove(3);
954 assert_eq!(e, Some(4));
955 assert_eq!(v, vec![5, 2, 3]);
957 e = v.swap_remove(3);
959 assert_eq!(v, vec![5, 2, 3]);
963 fn test_swap_remove_noncopyable() {
964 // Tests that we don't accidentally run destructors twice.
965 let mut v = vec![rt::exclusive::Exclusive::new(()),
966 rt::exclusive::Exclusive::new(()),
967 rt::exclusive::Exclusive::new(())];
968 let mut _e = v.swap_remove(0);
969 assert_eq!(v.len(), 2);
970 _e = v.swap_remove(1);
971 assert_eq!(v.len(), 1);
972 _e = v.swap_remove(0);
973 assert_eq!(v.len(), 0);
978 // Test on-stack push().
981 assert_eq!(v.len(), 1u);
982 assert_eq!(v.as_slice()[0], 1);
984 // Test on-heap push().
986 assert_eq!(v.len(), 2u);
987 assert_eq!(v.as_slice()[0], 1);
988 assert_eq!(v.as_slice()[1], 2);
993 // Test on-stack grow().
997 let v = v.as_slice();
998 assert_eq!(v.len(), 2u);
1000 assert_eq!(v[1], 1);
1003 // Test on-heap grow().
1006 let v = v.as_slice();
1007 assert_eq!(v.len(), 5u);
1008 assert_eq!(v[0], 1);
1009 assert_eq!(v[1], 1);
1010 assert_eq!(v[2], 2);
1011 assert_eq!(v[3], 2);
1012 assert_eq!(v[4], 2);
1019 v.grow_fn(3u, square);
1020 let v = v.as_slice();
1021 assert_eq!(v.len(), 3u);
1022 assert_eq!(v[0], 0u);
1023 assert_eq!(v[1], 1u);
1024 assert_eq!(v[2], 4u);
1028 fn test_grow_set() {
1029 let mut v = vec![1, 2, 3];
1030 v.grow_set(4u, &4, 5);
1031 let v = v.as_slice();
1032 assert_eq!(v.len(), 5u);
1033 assert_eq!(v[0], 1);
1034 assert_eq!(v[1], 2);
1035 assert_eq!(v[2], 3);
1036 assert_eq!(v[3], 4);
1037 assert_eq!(v[4], 5);
1041 fn test_truncate() {
1042 let mut v = vec![box 6,box 5,box 4];
1044 let v = v.as_slice();
1045 assert_eq!(v.len(), 1);
1046 assert_eq!(*(v[0]), 6);
1047 // If the unsafe block didn't drop things properly, we blow up here.
1052 let mut v = vec![box 6,box 5,box 4];
1054 assert_eq!(v.len(), 0);
1055 // If the unsafe block didn't drop things properly, we blow up here.
1060 fn case(a: Vec<uint>, b: Vec<uint>) {
1065 case(vec![], vec![]);
1066 case(vec![1], vec![1]);
1067 case(vec![1,1], vec![1]);
1068 case(vec![1,2,3], vec![1,2,3]);
1069 case(vec![1,1,2,3], vec![1,2,3]);
1070 case(vec![1,2,2,3], vec![1,2,3]);
1071 case(vec![1,2,3,3], vec![1,2,3]);
1072 case(vec![1,1,2,2,2,3,3], vec![1,2,3]);
1076 fn test_dedup_unique() {
1077 let mut v0 = vec![box 1, box 1, box 2, box 3];
1079 let mut v1 = vec![box 1, box 2, box 2, box 3];
1081 let mut v2 = vec![box 1, box 2, box 3, box 3];
1084 * If the boxed pointers were leaked or otherwise misused, valgrind
1085 * and/or rustrt should raise errors.
1090 fn test_dedup_shared() {
1091 let mut v0 = vec![box 1, box 1, box 2, box 3];
1093 let mut v1 = vec![box 1, box 2, box 2, box 3];
1095 let mut v2 = vec![box 1, box 2, box 3, box 3];
1098 * If the pointers were leaked or otherwise misused, valgrind and/or
1099 * rustrt should raise errors.
1105 let mut v = vec![1, 2, 3, 4, 5];
1107 assert_eq!(v, vec![1, 3, 5]);
1111 fn test_element_swaps() {
1112 let mut v = [1, 2, 3];
1113 for (i, (a, b)) in ElementSwaps::new(v.len()).enumerate() {
1116 0 => assert!(v == [1, 3, 2]),
1117 1 => assert!(v == [3, 1, 2]),
1118 2 => assert!(v == [3, 2, 1]),
1119 3 => assert!(v == [2, 3, 1]),
1120 4 => assert!(v == [2, 1, 3]),
1121 5 => assert!(v == [1, 2, 3]),
1128 fn test_permutations() {
1130 let v: [int, ..0] = [];
1131 let mut it = v.permutations();
1132 let (min_size, max_opt) = it.size_hint();
1133 assert_eq!(min_size, 1);
1134 assert_eq!(max_opt.unwrap(), 1);
1135 assert_eq!(it.next(), Some(v.as_slice().to_owned()));
1136 assert_eq!(it.next(), None);
1139 let v = ["Hello".to_string()];
1140 let mut it = v.permutations();
1141 let (min_size, max_opt) = it.size_hint();
1142 assert_eq!(min_size, 1);
1143 assert_eq!(max_opt.unwrap(), 1);
1144 assert_eq!(it.next(), Some(v.as_slice().to_owned()));
1145 assert_eq!(it.next(), None);
1149 let mut it = v.permutations();
1150 let (min_size, max_opt) = it.size_hint();
1151 assert_eq!(min_size, 3*2);
1152 assert_eq!(max_opt.unwrap(), 3*2);
1153 assert_eq!(it.next(), Some(vec![1,2,3]));
1154 assert_eq!(it.next(), Some(vec![1,3,2]));
1155 assert_eq!(it.next(), Some(vec![3,1,2]));
1156 let (min_size, max_opt) = it.size_hint();
1157 assert_eq!(min_size, 3);
1158 assert_eq!(max_opt.unwrap(), 3);
1159 assert_eq!(it.next(), Some(vec![3,2,1]));
1160 assert_eq!(it.next(), Some(vec![2,3,1]));
1161 assert_eq!(it.next(), Some(vec![2,1,3]));
1162 assert_eq!(it.next(), None);
1165 // check that we have N! permutations
1166 let v = ['A', 'B', 'C', 'D', 'E', 'F'];
1168 let mut it = v.permutations();
1169 let (min_size, max_opt) = it.size_hint();
1173 assert_eq!(amt, it.swaps.swaps_made);
1174 assert_eq!(amt, min_size);
1175 assert_eq!(amt, 2 * 3 * 4 * 5 * 6);
1176 assert_eq!(amt, max_opt.unwrap());
1181 fn test_lexicographic_permutations() {
1182 let v : &mut[int] = &mut[1, 2, 3, 4, 5];
1183 assert!(v.prev_permutation() == false);
1184 assert!(v.next_permutation());
1185 assert_eq!(v, &mut[1, 2, 3, 5, 4]);
1186 assert!(v.prev_permutation());
1187 assert_eq!(v, &mut[1, 2, 3, 4, 5]);
1188 assert!(v.next_permutation());
1189 assert!(v.next_permutation());
1190 assert_eq!(v, &mut[1, 2, 4, 3, 5]);
1191 assert!(v.next_permutation());
1192 assert_eq!(v, &mut[1, 2, 4, 5, 3]);
1194 let v : &mut[int] = &mut[1, 0, 0, 0];
1195 assert!(v.next_permutation() == false);
1196 assert!(v.prev_permutation());
1197 assert_eq!(v, &mut[0, 1, 0, 0]);
1198 assert!(v.prev_permutation());
1199 assert_eq!(v, &mut[0, 0, 1, 0]);
1200 assert!(v.prev_permutation());
1201 assert_eq!(v, &mut[0, 0, 0, 1]);
1202 assert!(v.prev_permutation() == false);
1206 fn test_lexicographic_permutations_empty_and_short() {
1207 let empty : &mut[int] = &mut[];
1208 assert!(empty.next_permutation() == false);
1209 assert_eq!(empty, &mut[]);
1210 assert!(empty.prev_permutation() == false);
1211 assert_eq!(empty, &mut[]);
1213 let one_elem : &mut[int] = &mut[4];
1214 assert!(one_elem.prev_permutation() == false);
1215 assert_eq!(one_elem, &mut[4]);
1216 assert!(one_elem.next_permutation() == false);
1217 assert_eq!(one_elem, &mut[4]);
1219 let two_elem : &mut[int] = &mut[1, 2];
1220 assert!(two_elem.prev_permutation() == false);
1221 assert_eq!(two_elem, &mut[1, 2]);
1222 assert!(two_elem.next_permutation());
1223 assert_eq!(two_elem, &mut[2, 1]);
1224 assert!(two_elem.next_permutation() == false);
1225 assert_eq!(two_elem, &mut[2, 1]);
1226 assert!(two_elem.prev_permutation());
1227 assert_eq!(two_elem, &mut[1, 2]);
1228 assert!(two_elem.prev_permutation() == false);
1229 assert_eq!(two_elem, &mut[1, 2]);
1233 fn test_position_elem() {
1234 assert!([].position_elem(&1).is_none());
1236 let v1 = vec![1, 2, 3, 3, 2, 5];
1237 assert_eq!(v1.as_slice().position_elem(&1), Some(0u));
1238 assert_eq!(v1.as_slice().position_elem(&2), Some(1u));
1239 assert_eq!(v1.as_slice().position_elem(&5), Some(5u));
1240 assert!(v1.as_slice().position_elem(&4).is_none());
1244 fn test_bsearch_elem() {
1245 assert_eq!([1,2,3,4,5].bsearch_elem(&5), Some(4));
1246 assert_eq!([1,2,3,4,5].bsearch_elem(&4), Some(3));
1247 assert_eq!([1,2,3,4,5].bsearch_elem(&3), Some(2));
1248 assert_eq!([1,2,3,4,5].bsearch_elem(&2), Some(1));
1249 assert_eq!([1,2,3,4,5].bsearch_elem(&1), Some(0));
1251 assert_eq!([2,4,6,8,10].bsearch_elem(&1), None);
1252 assert_eq!([2,4,6,8,10].bsearch_elem(&5), None);
1253 assert_eq!([2,4,6,8,10].bsearch_elem(&4), Some(1));
1254 assert_eq!([2,4,6,8,10].bsearch_elem(&10), Some(4));
1256 assert_eq!([2,4,6,8].bsearch_elem(&1), None);
1257 assert_eq!([2,4,6,8].bsearch_elem(&5), None);
1258 assert_eq!([2,4,6,8].bsearch_elem(&4), Some(1));
1259 assert_eq!([2,4,6,8].bsearch_elem(&8), Some(3));
1261 assert_eq!([2,4,6].bsearch_elem(&1), None);
1262 assert_eq!([2,4,6].bsearch_elem(&5), None);
1263 assert_eq!([2,4,6].bsearch_elem(&4), Some(1));
1264 assert_eq!([2,4,6].bsearch_elem(&6), Some(2));
1266 assert_eq!([2,4].bsearch_elem(&1), None);
1267 assert_eq!([2,4].bsearch_elem(&5), None);
1268 assert_eq!([2,4].bsearch_elem(&2), Some(0));
1269 assert_eq!([2,4].bsearch_elem(&4), Some(1));
1271 assert_eq!([2].bsearch_elem(&1), None);
1272 assert_eq!([2].bsearch_elem(&5), None);
1273 assert_eq!([2].bsearch_elem(&2), Some(0));
1275 assert_eq!([].bsearch_elem(&1), None);
1276 assert_eq!([].bsearch_elem(&5), None);
1278 assert!([1,1,1,1,1].bsearch_elem(&1) != None);
1279 assert!([1,1,1,1,2].bsearch_elem(&1) != None);
1280 assert!([1,1,1,2,2].bsearch_elem(&1) != None);
1281 assert!([1,1,2,2,2].bsearch_elem(&1) != None);
1282 assert_eq!([1,2,2,2,2].bsearch_elem(&1), Some(0));
1284 assert_eq!([1,2,3,4,5].bsearch_elem(&6), None);
1285 assert_eq!([1,2,3,4,5].bsearch_elem(&0), None);
1290 let mut v: Vec<int> = vec![10, 20];
1291 assert_eq!(*v.get(0), 10);
1292 assert_eq!(*v.get(1), 20);
1294 assert_eq!(*v.get(0), 20);
1295 assert_eq!(*v.get(1), 10);
1297 let mut v3: Vec<int> = vec![];
1299 assert!(v3.is_empty());
1304 for len in range(4u, 25) {
1305 for _ in range(0, 100) {
1306 let mut v = task_rng().gen_iter::<uint>().take(len)
1307 .collect::<Vec<uint>>();
1308 let mut v1 = v.clone();
1310 v.as_mut_slice().sort();
1311 assert!(v.as_slice().windows(2).all(|w| w[0] <= w[1]));
1313 v1.as_mut_slice().sort_by(|a, b| a.cmp(b));
1314 assert!(v1.as_slice().windows(2).all(|w| w[0] <= w[1]));
1316 v1.as_mut_slice().sort_by(|a, b| b.cmp(a));
1317 assert!(v1.as_slice().windows(2).all(|w| w[0] >= w[1]));
1321 // shouldn't fail/crash
1322 let mut v: [uint, .. 0] = [];
1325 let mut v = [0xDEADBEEFu];
1327 assert!(v == [0xDEADBEEF]);
1331 fn test_sort_stability() {
1332 for len in range(4, 25) {
1333 for _ in range(0 , 10) {
1334 let mut counts = [0, .. 10];
1336 // create a vector like [(6, 1), (5, 1), (6, 2), ...],
1337 // where the first item of each tuple is random, but
1338 // the second item represents which occurrence of that
1339 // number this element is, i.e. the second elements
1340 // will occur in sorted order.
1341 let mut v = range(0, len).map(|_| {
1342 let n = task_rng().gen::<uint>() % 10;
1345 }).collect::<Vec<(uint, int)>>();
1347 // only sort on the first element, so an unstable sort
1348 // may mix up the counts.
1349 v.sort_by(|&(a,_), &(b,_)| a.cmp(&b));
1351 // this comparison includes the count (the second item
1352 // of the tuple), so elements with equal first items
1353 // will need to be ordered with increasing
1354 // counts... i.e. exactly asserting that this sort is
1356 assert!(v.as_slice().windows(2).all(|w| w[0] <= w[1]));
1362 fn test_partition() {
1363 assert_eq!((vec![]).partition(|x: &int| *x < 3), (vec![], vec![]));
1364 assert_eq!((vec![1, 2, 3]).partition(|x: &int| *x < 4), (vec![1, 2, 3], vec![]));
1365 assert_eq!((vec![1, 2, 3]).partition(|x: &int| *x < 2), (vec![1], vec![2, 3]));
1366 assert_eq!((vec![1, 2, 3]).partition(|x: &int| *x < 0), (vec![], vec![1, 2, 3]));
1370 fn test_partitioned() {
1371 assert_eq!(([]).partitioned(|x: &int| *x < 3), (vec![], vec![]));
1372 assert_eq!(([1, 2, 3]).partitioned(|x: &int| *x < 4), (vec![1, 2, 3], vec![]));
1373 assert_eq!(([1, 2, 3]).partitioned(|x: &int| *x < 2), (vec![1], vec![2, 3]));
1374 assert_eq!(([1, 2, 3]).partitioned(|x: &int| *x < 0), (vec![], vec![1, 2, 3]));
1379 let v: [Vec<int>, ..0] = [];
1380 assert_eq!(v.concat_vec(), vec![]);
1381 assert_eq!([vec![1], vec![2,3]].concat_vec(), vec![1, 2, 3]);
1383 assert_eq!([&[1], &[2,3]].concat_vec(), vec![1, 2, 3]);
1388 let v: [Vec<int>, ..0] = [];
1389 assert_eq!(v.connect_vec(&0), vec![]);
1390 assert_eq!([vec![1], vec![2, 3]].connect_vec(&0), vec![1, 0, 2, 3]);
1391 assert_eq!([vec![1], vec![2], vec![3]].connect_vec(&0), vec![1, 0, 2, 0, 3]);
1393 assert_eq!([&[1], &[2, 3]].connect_vec(&0), vec![1, 0, 2, 3]);
1394 assert_eq!([&[1], &[2], &[3]].connect_vec(&0), vec![1, 0, 2, 0, 3]);
1399 let mut x = vec![1, 2, 3];
1400 assert_eq!(x.shift(), Some(1));
1401 assert_eq!(&x, &vec![2, 3]);
1402 assert_eq!(x.shift(), Some(2));
1403 assert_eq!(x.shift(), Some(3));
1404 assert_eq!(x.shift(), None);
1405 assert_eq!(x.len(), 0);
1410 let mut x = vec![1, 2, 3];
1412 assert_eq!(x, vec![0, 1, 2, 3]);
1417 let mut a = vec![1, 2, 4];
1419 assert_eq!(a, vec![1, 2, 3, 4]);
1421 let mut a = vec![1, 2, 3];
1423 assert_eq!(a, vec![0, 1, 2, 3]);
1425 let mut a = vec![1, 2, 3];
1427 assert_eq!(a, vec![1, 2, 3, 4]);
1431 assert_eq!(a, vec![1]);
1436 fn test_insert_oob() {
1437 let mut a = vec![1, 2, 3];
1443 let mut a = vec![1,2,3,4];
1445 assert_eq!(a.remove(2), Some(3));
1446 assert_eq!(a, vec![1,2,4]);
1448 assert_eq!(a.remove(2), Some(4));
1449 assert_eq!(a, vec![1,2]);
1451 assert_eq!(a.remove(2), None);
1452 assert_eq!(a, vec![1,2]);
1454 assert_eq!(a.remove(0), Some(1));
1455 assert_eq!(a, vec![2]);
1457 assert_eq!(a.remove(0), Some(2));
1458 assert_eq!(a, vec![]);
1460 assert_eq!(a.remove(0), None);
1461 assert_eq!(a.remove(10), None);
1465 fn test_capacity() {
1466 let mut v = vec![0u64];
1467 v.reserve_exact(10u);
1468 assert_eq!(v.capacity(), 10u);
1469 let mut v = vec![0u32];
1470 v.reserve_exact(10u);
1471 assert_eq!(v.capacity(), 10u);
1476 let v = vec![1, 2, 3, 4, 5];
1477 let v = v.slice(1u, 3u);
1478 assert_eq!(v.len(), 2u);
1479 assert_eq!(v[0], 2);
1480 assert_eq!(v[1], 3);
1486 fn test_from_fn_fail() {
1487 Vec::from_fn(100, |v| {
1488 if v == 50 { fail!() }
1495 fn test_from_elem_fail() {
1499 boxes: (Box<int>, Rc<int>)
1503 fn clone(&self) -> S {
1504 self.f.set(self.f.get() + 1);
1505 if self.f.get() == 10 { fail!() }
1506 S { f: self.f, boxes: self.boxes.clone() }
1510 let s = S { f: Cell::new(0), boxes: (box 0, Rc::new(0)) };
1511 let _ = Vec::from_elem(100, s);
1516 fn test_grow_fn_fail() {
1518 v.grow_fn(100, |i| {
1528 fn test_permute_fail() {
1529 let v = [(box 0, Rc::new(0)), (box 0, Rc::new(0)),
1530 (box 0, Rc::new(0)), (box 0, Rc::new(0))];
1532 for _ in v.permutations() {
1542 fn test_copy_memory_oob() {
1544 let mut a = [1, 2, 3, 4];
1545 let b = [1, 2, 3, 4, 5];
1551 fn test_total_ord() {
1552 [1, 2, 3, 4].cmp(& &[1, 2, 3]) == Greater;
1553 [1, 2, 3].cmp(& &[1, 2, 3, 4]) == Less;
1554 [1, 2, 3, 4].cmp(& &[1, 2, 3, 4]) == Equal;
1555 [1, 2, 3, 4, 5, 5, 5, 5].cmp(& &[1, 2, 3, 4, 5, 6]) == Less;
1556 [2, 2].cmp(& &[1, 2, 3, 4]) == Greater;
1560 fn test_iterator() {
1561 let xs = [1, 2, 5, 10, 11];
1562 let mut it = xs.iter();
1563 assert_eq!(it.size_hint(), (5, Some(5)));
1564 assert_eq!(it.next().unwrap(), &1);
1565 assert_eq!(it.size_hint(), (4, Some(4)));
1566 assert_eq!(it.next().unwrap(), &2);
1567 assert_eq!(it.size_hint(), (3, Some(3)));
1568 assert_eq!(it.next().unwrap(), &5);
1569 assert_eq!(it.size_hint(), (2, Some(2)));
1570 assert_eq!(it.next().unwrap(), &10);
1571 assert_eq!(it.size_hint(), (1, Some(1)));
1572 assert_eq!(it.next().unwrap(), &11);
1573 assert_eq!(it.size_hint(), (0, Some(0)));
1574 assert!(it.next().is_none());
1578 fn test_random_access_iterator() {
1579 let xs = [1, 2, 5, 10, 11];
1580 let mut it = xs.iter();
1582 assert_eq!(it.indexable(), 5);
1583 assert_eq!(it.idx(0).unwrap(), &1);
1584 assert_eq!(it.idx(2).unwrap(), &5);
1585 assert_eq!(it.idx(4).unwrap(), &11);
1586 assert!(it.idx(5).is_none());
1588 assert_eq!(it.next().unwrap(), &1);
1589 assert_eq!(it.indexable(), 4);
1590 assert_eq!(it.idx(0).unwrap(), &2);
1591 assert_eq!(it.idx(3).unwrap(), &11);
1592 assert!(it.idx(4).is_none());
1594 assert_eq!(it.next().unwrap(), &2);
1595 assert_eq!(it.indexable(), 3);
1596 assert_eq!(it.idx(1).unwrap(), &10);
1597 assert!(it.idx(3).is_none());
1599 assert_eq!(it.next().unwrap(), &5);
1600 assert_eq!(it.indexable(), 2);
1601 assert_eq!(it.idx(1).unwrap(), &11);
1603 assert_eq!(it.next().unwrap(), &10);
1604 assert_eq!(it.indexable(), 1);
1605 assert_eq!(it.idx(0).unwrap(), &11);
1606 assert!(it.idx(1).is_none());
1608 assert_eq!(it.next().unwrap(), &11);
1609 assert_eq!(it.indexable(), 0);
1610 assert!(it.idx(0).is_none());
1612 assert!(it.next().is_none());
1616 fn test_iter_size_hints() {
1617 let mut xs = [1, 2, 5, 10, 11];
1618 assert_eq!(xs.iter().size_hint(), (5, Some(5)));
1619 assert_eq!(xs.mut_iter().size_hint(), (5, Some(5)));
1623 fn test_iter_clone() {
1625 let mut it = xs.iter();
1627 let mut jt = it.clone();
1628 assert_eq!(it.next(), jt.next());
1629 assert_eq!(it.next(), jt.next());
1630 assert_eq!(it.next(), jt.next());
1634 fn test_mut_iterator() {
1635 let mut xs = [1, 2, 3, 4, 5];
1636 for x in xs.mut_iter() {
1639 assert!(xs == [2, 3, 4, 5, 6])
1643 fn test_rev_iterator() {
1645 let xs = [1, 2, 5, 10, 11];
1646 let ys = [11, 10, 5, 2, 1];
1648 for &x in xs.iter().rev() {
1649 assert_eq!(x, ys[i]);
1656 fn test_mut_rev_iterator() {
1657 let mut xs = [1u, 2, 3, 4, 5];
1658 for (i,x) in xs.mut_iter().rev().enumerate() {
1661 assert!(xs == [5, 5, 5, 5, 5])
1665 fn test_move_iterator() {
1666 let xs = vec![1u,2,3,4,5];
1667 assert_eq!(xs.move_iter().fold(0, |a: uint, b: uint| 10*a + b), 12345);
1671 fn test_move_rev_iterator() {
1672 let xs = vec![1u,2,3,4,5];
1673 assert_eq!(xs.move_iter().rev().fold(0, |a: uint, b: uint| 10*a + b), 54321);
1677 fn test_splitator() {
1678 let xs = &[1i,2,3,4,5];
1680 assert_eq!(xs.split(|x| *x % 2 == 0).collect::<Vec<&[int]>>().as_slice(),
1681 &[&[1], &[3], &[5]]);
1682 assert_eq!(xs.split(|x| *x == 1).collect::<Vec<&[int]>>().as_slice(),
1683 &[&[], &[2,3,4,5]]);
1684 assert_eq!(xs.split(|x| *x == 5).collect::<Vec<&[int]>>().as_slice(),
1685 &[&[1,2,3,4], &[]]);
1686 assert_eq!(xs.split(|x| *x == 10).collect::<Vec<&[int]>>().as_slice(),
1688 assert_eq!(xs.split(|_| true).collect::<Vec<&[int]>>().as_slice(),
1689 &[&[], &[], &[], &[], &[], &[]]);
1691 let xs: &[int] = &[];
1692 assert_eq!(xs.split(|x| *x == 5).collect::<Vec<&[int]>>().as_slice(), &[&[]]);
1696 fn test_splitnator() {
1697 let xs = &[1i,2,3,4,5];
1699 assert_eq!(xs.splitn(0, |x| *x % 2 == 0).collect::<Vec<&[int]>>().as_slice(),
1701 assert_eq!(xs.splitn(1, |x| *x % 2 == 0).collect::<Vec<&[int]>>().as_slice(),
1703 assert_eq!(xs.splitn(3, |_| true).collect::<Vec<&[int]>>().as_slice(),
1704 &[&[], &[], &[], &[4,5]]);
1706 let xs: &[int] = &[];
1707 assert_eq!(xs.splitn(1, |x| *x == 5).collect::<Vec<&[int]>>().as_slice(), &[&[]]);
1711 fn test_rsplitator() {
1712 let xs = &[1i,2,3,4,5];
1714 assert_eq!(xs.split(|x| *x % 2 == 0).rev().collect::<Vec<&[int]>>().as_slice(),
1715 &[&[5], &[3], &[1]]);
1716 assert_eq!(xs.split(|x| *x == 1).rev().collect::<Vec<&[int]>>().as_slice(),
1717 &[&[2,3,4,5], &[]]);
1718 assert_eq!(xs.split(|x| *x == 5).rev().collect::<Vec<&[int]>>().as_slice(),
1719 &[&[], &[1,2,3,4]]);
1720 assert_eq!(xs.split(|x| *x == 10).rev().collect::<Vec<&[int]>>().as_slice(),
1723 let xs: &[int] = &[];
1724 assert_eq!(xs.split(|x| *x == 5).rev().collect::<Vec<&[int]>>().as_slice(), &[&[]]);
1728 fn test_rsplitnator() {
1729 let xs = &[1,2,3,4,5];
1731 assert_eq!(xs.rsplitn(0, |x| *x % 2 == 0).collect::<Vec<&[int]>>().as_slice(),
1733 assert_eq!(xs.rsplitn(1, |x| *x % 2 == 0).collect::<Vec<&[int]>>().as_slice(),
1735 assert_eq!(xs.rsplitn(3, |_| true).collect::<Vec<&[int]>>().as_slice(),
1736 &[&[], &[], &[], &[1,2]]);
1738 let xs: &[int] = &[];
1739 assert_eq!(xs.rsplitn(1, |x| *x == 5).collect::<Vec<&[int]>>().as_slice(), &[&[]]);
1743 fn test_windowsator() {
1744 let v = &[1i,2,3,4];
1746 assert_eq!(v.windows(2).collect::<Vec<&[int]>>().as_slice(), &[&[1,2], &[2,3], &[3,4]]);
1747 assert_eq!(v.windows(3).collect::<Vec<&[int]>>().as_slice(), &[&[1i,2,3], &[2,3,4]]);
1748 assert!(v.windows(6).next().is_none());
1753 fn test_windowsator_0() {
1754 let v = &[1i,2,3,4];
1755 let _it = v.windows(0);
1759 fn test_chunksator() {
1760 let v = &[1i,2,3,4,5];
1762 assert_eq!(v.chunks(2).collect::<Vec<&[int]>>().as_slice(), &[&[1i,2], &[3,4], &[5]]);
1763 assert_eq!(v.chunks(3).collect::<Vec<&[int]>>().as_slice(), &[&[1i,2,3], &[4,5]]);
1764 assert_eq!(v.chunks(6).collect::<Vec<&[int]>>().as_slice(), &[&[1i,2,3,4,5]]);
1766 assert_eq!(v.chunks(2).rev().collect::<Vec<&[int]>>().as_slice(), &[&[5i], &[3,4], &[1,2]]);
1767 let mut it = v.chunks(2);
1768 assert_eq!(it.indexable(), 3);
1769 assert_eq!(it.idx(0).unwrap(), &[1,2]);
1770 assert_eq!(it.idx(1).unwrap(), &[3,4]);
1771 assert_eq!(it.idx(2).unwrap(), &[5]);
1772 assert_eq!(it.idx(3), None);
1777 fn test_chunksator_0() {
1778 let v = &[1i,2,3,4];
1779 let _it = v.chunks(0);
1783 fn test_move_from() {
1784 let mut a = [1,2,3,4,5];
1785 let b = vec![6,7,8];
1786 assert_eq!(a.move_from(b, 0, 3), 3);
1787 assert!(a == [6,7,8,4,5]);
1788 let mut a = [7,2,8,1];
1789 let b = vec![3,1,4,1,5,9];
1790 assert_eq!(a.move_from(b, 0, 6), 4);
1791 assert!(a == [3,1,4,1]);
1792 let mut a = [1,2,3,4];
1793 let b = vec![5,6,7,8,9,0];
1794 assert_eq!(a.move_from(b, 2, 3), 1);
1795 assert!(a == [7,2,3,4]);
1796 let mut a = [1,2,3,4,5];
1797 let b = vec![5,6,7,8,9,0];
1798 assert_eq!(a.mut_slice(2,4).move_from(b,1,6), 2);
1799 assert!(a == [1,2,6,7,5]);
1803 fn test_copy_from() {
1804 let mut a = [1,2,3,4,5];
1806 assert_eq!(a.copy_from(b), 3);
1807 assert!(a == [6,7,8,4,5]);
1808 let mut c = [7,2,8,1];
1809 let d = [3,1,4,1,5,9];
1810 assert_eq!(c.copy_from(d), 4);
1811 assert!(c == [3,1,4,1]);
1815 fn test_reverse_part() {
1816 let mut values = [1,2,3,4,5];
1817 values.mut_slice(1, 4).reverse();
1818 assert!(values == [1,4,3,2,5]);
1823 macro_rules! test_show_vec(
1824 ($x:expr, $x_str:expr) => ({
1825 let (x, x_str) = ($x, $x_str);
1826 assert_eq!(format!("{}", x), x_str);
1827 assert_eq!(format!("{}", x.as_slice()), x_str);
1830 let empty: Vec<int> = vec![];
1831 test_show_vec!(empty, "[]".to_string());
1832 test_show_vec!(vec![1], "[1]".to_string());
1833 test_show_vec!(vec![1, 2, 3], "[1, 2, 3]".to_string());
1834 test_show_vec!(vec![vec![], vec![1u], vec![1u, 1u]],
1835 "[[], [1], [1, 1]]".to_string());
1837 let empty_mut: &mut [int] = &mut[];
1838 test_show_vec!(empty_mut, "[]".to_string());
1839 test_show_vec!(&mut[1], "[1]".to_string());
1840 test_show_vec!(&mut[1, 2, 3], "[1, 2, 3]".to_string());
1841 test_show_vec!(&mut[&mut[], &mut[1u], &mut[1u, 1u]],
1842 "[[], [1], [1, 1]]".to_string());
1846 fn test_vec_default() {
1849 let v: $ty = Default::default();
1850 assert!(v.is_empty());
1859 fn test_bytes_set_memory() {
1860 use slice::bytes::MutableByteVector;
1861 let mut values = [1u8,2,3,4,5];
1862 values.mut_slice(0,5).set_memory(0xAB);
1863 assert!(values == [0xAB, 0xAB, 0xAB, 0xAB, 0xAB]);
1864 values.mut_slice(2,4).set_memory(0xFF);
1865 assert!(values == [0xAB, 0xAB, 0xFF, 0xFF, 0xAB]);
1870 fn test_overflow_does_not_cause_segfault() {
1872 v.reserve_exact(-1);
1879 fn test_overflow_does_not_cause_segfault_managed() {
1880 let mut v = vec![Rc::new(1)];
1881 v.reserve_exact(-1);
1886 fn test_mut_split_at() {
1887 let mut values = [1u8,2,3,4,5];
1889 let (left, right) = values.mut_split_at(2);
1890 assert!(left.slice(0, left.len()) == [1, 2]);
1891 for p in left.mut_iter() {
1895 assert!(right.slice(0, right.len()) == [3, 4, 5]);
1896 for p in right.mut_iter() {
1901 assert!(values == [2, 3, 5, 6, 7]);
1904 #[deriving(Clone, PartialEq)]
1908 fn test_iter_zero_sized() {
1909 let mut v = vec![Foo, Foo, Foo];
1910 assert_eq!(v.len(), 3);
1919 for f in v.slice(1, 3).iter() {
1925 for f in v.mut_iter() {
1931 for f in v.move_iter() {
1935 assert_eq!(cnt, 11);
1937 let xs: [Foo, ..3] = [Foo, Foo, Foo];
1939 for f in xs.iter() {
1947 fn test_shrink_to_fit() {
1948 let mut xs = vec![0, 1, 2, 3];
1949 for i in range(4, 100) {
1952 assert_eq!(xs.capacity(), 128);
1954 assert_eq!(xs.capacity(), 100);
1955 assert_eq!(xs, range(0, 100).collect::<Vec<_>>());
1959 fn test_starts_with() {
1960 assert!(b"foobar".starts_with(b"foo"));
1961 assert!(!b"foobar".starts_with(b"oob"));
1962 assert!(!b"foobar".starts_with(b"bar"));
1963 assert!(!b"foo".starts_with(b"foobar"));
1964 assert!(!b"bar".starts_with(b"foobar"));
1965 assert!(b"foobar".starts_with(b"foobar"));
1966 let empty: &[u8] = [];
1967 assert!(empty.starts_with(empty));
1968 assert!(!empty.starts_with(b"foo"));
1969 assert!(b"foobar".starts_with(empty));
1973 fn test_ends_with() {
1974 assert!(b"foobar".ends_with(b"bar"));
1975 assert!(!b"foobar".ends_with(b"oba"));
1976 assert!(!b"foobar".ends_with(b"foo"));
1977 assert!(!b"foo".ends_with(b"foobar"));
1978 assert!(!b"bar".ends_with(b"foobar"));
1979 assert!(b"foobar".ends_with(b"foobar"));
1980 let empty: &[u8] = [];
1981 assert!(empty.ends_with(empty));
1982 assert!(!empty.ends_with(b"foo"));
1983 assert!(b"foobar".ends_with(empty));
1987 fn test_shift_ref() {
1988 let mut x: &[int] = [1, 2, 3, 4, 5];
1989 let h = x.shift_ref();
1990 assert_eq!(*h.unwrap(), 1);
1991 assert_eq!(x.len(), 4);
1992 assert_eq!(x[0], 2);
1993 assert_eq!(x[3], 5);
1995 let mut y: &[int] = [];
1996 assert_eq!(y.shift_ref(), None);
2001 let mut x: &[int] = [1, 2, 3, 4, 5];
2002 let h = x.pop_ref();
2003 assert_eq!(*h.unwrap(), 5);
2004 assert_eq!(x.len(), 4);
2005 assert_eq!(x[0], 1);
2006 assert_eq!(x[3], 4);
2008 let mut y: &[int] = [];
2009 assert!(y.pop_ref().is_none());
2013 fn test_mut_splitator() {
2014 let mut xs = [0,1,0,2,3,0,0,4,5,0];
2015 assert_eq!(xs.mut_split(|x| *x == 0).count(), 6);
2016 for slice in xs.mut_split(|x| *x == 0) {
2019 assert!(xs == [0,1,0,3,2,0,0,5,4,0]);
2021 let mut xs = [0,1,0,2,3,0,0,4,5,0,6,7];
2022 for slice in xs.mut_split(|x| *x == 0).take(5) {
2025 assert!(xs == [0,1,0,3,2,0,0,5,4,0,6,7]);
2029 fn test_mut_splitator_rev() {
2030 let mut xs = [1,2,0,3,4,0,0,5,6,0];
2031 for slice in xs.mut_split(|x| *x == 0).rev().take(4) {
2034 assert!(xs == [1,2,0,4,3,0,0,6,5,0]);
2039 let mut v = [0,1,2];
2040 assert_eq!(v.get_mut(3), None);
2041 v.get_mut(1).map(|e| *e = 7);
2042 assert_eq!(v[1], 7);
2044 assert_eq!(v.get_mut(2), Some(&mut x));
2048 fn test_mut_chunks() {
2049 let mut v = [0u8, 1, 2, 3, 4, 5, 6];
2050 for (i, chunk) in v.mut_chunks(3).enumerate() {
2051 for x in chunk.mut_iter() {
2055 let result = [0u8, 0, 0, 1, 1, 1, 2];
2056 assert!(v == result);
2060 fn test_mut_chunks_rev() {
2061 let mut v = [0u8, 1, 2, 3, 4, 5, 6];
2062 for (i, chunk) in v.mut_chunks(3).rev().enumerate() {
2063 for x in chunk.mut_iter() {
2067 let result = [2u8, 2, 2, 1, 1, 1, 0];
2068 assert!(v == result);
2073 fn test_mut_chunks_0() {
2074 let mut v = [1, 2, 3, 4];
2075 let _it = v.mut_chunks(0);
2079 fn test_mut_shift_ref() {
2080 let mut x: &mut [int] = [1, 2, 3, 4, 5];
2081 let h = x.mut_shift_ref();
2082 assert_eq!(*h.unwrap(), 1);
2083 assert_eq!(x.len(), 4);
2084 assert_eq!(x[0], 2);
2085 assert_eq!(x[3], 5);
2087 let mut y: &mut [int] = [];
2088 assert!(y.mut_shift_ref().is_none());
2092 fn test_mut_pop_ref() {
2093 let mut x: &mut [int] = [1, 2, 3, 4, 5];
2094 let h = x.mut_pop_ref();
2095 assert_eq!(*h.unwrap(), 5);
2096 assert_eq!(x.len(), 4);
2097 assert_eq!(x[0], 1);
2098 assert_eq!(x[3], 4);
2100 let mut y: &mut [int] = [];
2101 assert!(y.mut_pop_ref().is_none());
2105 fn test_mut_last() {
2106 let mut x = [1, 2, 3, 4, 5];
2107 let h = x.mut_last();
2108 assert_eq!(*h.unwrap(), 5);
2110 let y: &mut [int] = [];
2111 assert!(y.mut_last().is_none());
2117 use std::prelude::*;
2118 use std::rand::{weak_rng, Rng};
2126 fn iterator(b: &mut Bencher) {
2127 // peculiar numbers to stop LLVM from optimising the summation
2129 let v = Vec::from_fn(100, |i| i ^ (i << 1) ^ (i >> 1));
2136 // sum == 11806, to stop dead code elimination.
2137 if sum == 0 {fail!()}
2142 fn mut_iterator(b: &mut Bencher) {
2143 let mut v = Vec::from_elem(100, 0);
2147 for x in v.mut_iter() {
2155 fn concat(b: &mut Bencher) {
2156 let xss: Vec<Vec<uint>> = Vec::from_fn(100, |i| range(0, i).collect());
2158 xss.as_slice().concat_vec()
2163 fn connect(b: &mut Bencher) {
2164 let xss: Vec<Vec<uint>> = Vec::from_fn(100, |i| range(0, i).collect());
2166 xss.as_slice().connect_vec(&0)
2171 fn push(b: &mut Bencher) {
2172 let mut vec: Vec<uint> = vec![];
2180 fn starts_with_same_vector(b: &mut Bencher) {
2181 let vec: Vec<uint> = Vec::from_fn(100, |i| i);
2183 vec.as_slice().starts_with(vec.as_slice())
2188 fn starts_with_single_element(b: &mut Bencher) {
2189 let vec: Vec<uint> = vec![0];
2191 vec.as_slice().starts_with(vec.as_slice())
2196 fn starts_with_diff_one_element_at_end(b: &mut Bencher) {
2197 let vec: Vec<uint> = Vec::from_fn(100, |i| i);
2198 let mut match_vec: Vec<uint> = Vec::from_fn(99, |i| i);
2201 vec.as_slice().starts_with(match_vec.as_slice())
2206 fn ends_with_same_vector(b: &mut Bencher) {
2207 let vec: Vec<uint> = Vec::from_fn(100, |i| i);
2209 vec.as_slice().ends_with(vec.as_slice())
2214 fn ends_with_single_element(b: &mut Bencher) {
2215 let vec: Vec<uint> = vec![0];
2217 vec.as_slice().ends_with(vec.as_slice())
2222 fn ends_with_diff_one_element_at_beginning(b: &mut Bencher) {
2223 let vec: Vec<uint> = Vec::from_fn(100, |i| i);
2224 let mut match_vec: Vec<uint> = Vec::from_fn(100, |i| i);
2225 match_vec.as_mut_slice()[0] = 200;
2227 vec.as_slice().starts_with(match_vec.as_slice())
2232 fn contains_last_element(b: &mut Bencher) {
2233 let vec: Vec<uint> = Vec::from_fn(100, |i| i);
2240 fn zero_1kb_from_elem(b: &mut Bencher) {
2242 Vec::from_elem(1024, 0u8)
2247 fn zero_1kb_set_memory(b: &mut Bencher) {
2249 let mut v: Vec<uint> = Vec::with_capacity(1024);
2251 let vp = v.as_mut_ptr();
2252 ptr::set_memory(vp, 0, 1024);
2260 fn zero_1kb_loop_set(b: &mut Bencher) {
2262 let mut v: Vec<uint> = Vec::with_capacity(1024);
2266 for i in range(0u, 1024) {
2273 fn zero_1kb_mut_iter(b: &mut Bencher) {
2275 let mut v = Vec::with_capacity(1024);
2279 for x in v.mut_iter() {
2287 fn random_inserts(b: &mut Bencher) {
2288 let mut rng = weak_rng();
2290 let mut v = Vec::from_elem(30, (0u, 0u));
2291 for _ in range(0, 100) {
2293 v.insert(rng.gen::<uint>() % (l + 1),
2299 fn random_removes(b: &mut Bencher) {
2300 let mut rng = weak_rng();
2302 let mut v = Vec::from_elem(130, (0u, 0u));
2303 for _ in range(0, 100) {
2305 v.remove(rng.gen::<uint>() % l);
2311 fn sort_random_small(b: &mut Bencher) {
2312 let mut rng = weak_rng();
2314 let mut v = rng.gen_iter::<u64>().take(5).collect::<Vec<u64>>();
2315 v.as_mut_slice().sort();
2317 b.bytes = 5 * mem::size_of::<u64>() as u64;
2321 fn sort_random_medium(b: &mut Bencher) {
2322 let mut rng = weak_rng();
2324 let mut v = rng.gen_iter::<u64>().take(100).collect::<Vec<u64>>();
2325 v.as_mut_slice().sort();
2327 b.bytes = 100 * mem::size_of::<u64>() as u64;
2331 fn sort_random_large(b: &mut Bencher) {
2332 let mut rng = weak_rng();
2334 let mut v = rng.gen_iter::<u64>().take(10000).collect::<Vec<u64>>();
2335 v.as_mut_slice().sort();
2337 b.bytes = 10000 * mem::size_of::<u64>() as u64;
2341 fn sort_sorted(b: &mut Bencher) {
2342 let mut v = Vec::from_fn(10000, |i| i);
2346 b.bytes = (v.len() * mem::size_of_val(v.get(0))) as u64;
2349 type BigSortable = (u64,u64,u64,u64);
2352 fn sort_big_random_small(b: &mut Bencher) {
2353 let mut rng = weak_rng();
2355 let mut v = rng.gen_iter::<BigSortable>().take(5)
2356 .collect::<Vec<BigSortable>>();
2359 b.bytes = 5 * mem::size_of::<BigSortable>() as u64;
2363 fn sort_big_random_medium(b: &mut Bencher) {
2364 let mut rng = weak_rng();
2366 let mut v = rng.gen_iter::<BigSortable>().take(100)
2367 .collect::<Vec<BigSortable>>();
2370 b.bytes = 100 * mem::size_of::<BigSortable>() as u64;
2374 fn sort_big_random_large(b: &mut Bencher) {
2375 let mut rng = weak_rng();
2377 let mut v = rng.gen_iter::<BigSortable>().take(10000)
2378 .collect::<Vec<BigSortable>>();
2381 b.bytes = 10000 * mem::size_of::<BigSortable>() as u64;
2385 fn sort_big_sorted(b: &mut Bencher) {
2386 let mut v = Vec::from_fn(10000u, |i| (i, i, i, i));
2390 b.bytes = (v.len() * mem::size_of_val(v.get(0))) as u64;