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 slice manipulation
15 The `slice` module contains useful code to help work with slice values.
16 Slices are a view into a block of memory represented as a pointer and a length.
20 let vec = vec!(1i, 2, 3);
21 let int_slice = vec.as_slice();
22 // coercing an array to a slice
23 let str_slice: &[&str] = ["one", "two", "three"];
26 Slices are either mutable or shared. The shared slice type is `&[T]`,
27 while the mutable slice type is `&mut[T]`. For example, you can mutate the
28 block of memory that a mutable slice points to:
31 let x: &mut[int] = [1i, 2, 3];
38 Here are some of the things this module contains:
42 There are several structs that are useful for slices, such as `Items`, which
43 represents iteration over a slice.
47 A number of traits add methods that allow you to accomplish tasks with slices.
48 These traits include `ImmutableSlice`, which is defined for `&[T]` types,
49 and `MutableSlice`, defined for `&mut [T]` types.
51 An example is the method `.slice(a, b)` that returns an immutable "view" into
52 a `Vec` or another slice from the index interval `[a, b)`:
55 let numbers = [0i, 1i, 2i];
56 let last_numbers = numbers.slice(1, 3);
57 // last_numbers is now &[1i, 2i]
60 ## Implementations of other traits
62 There are several implementations of common traits for slices. Some examples
66 * `Eq`, `Ord` - for immutable slices whose element type are `Eq` or `Ord`.
67 * `Hash` - for slices whose element type is `Hash`
71 The method `iter()` returns an iteration value for a slice. The iterator
72 yields references to the slice's elements, so if the element
73 type of the slice is `int`, the element type of the iterator is `&int`.
76 let numbers = [0i, 1i, 2i];
77 for &x in numbers.iter() {
78 println!("{} is a number!", x);
82 * `.mut_iter()` returns an iterator that allows modifying each value.
83 * Further iterators exist that split, chunk or permute the slice.
87 #![doc(primitive = "slice")]
92 use core::mem::size_of;
95 use core::iter::{range_step, MultiplicativeIterator};
97 use {Collection, MutableSeq};
100 pub use core::slice::{ref_slice, mut_ref_slice, Splits, Windows};
101 pub use core::slice::{Chunks, Vector, ImmutableSlice, ImmutableEqSlice};
102 pub use core::slice::{ImmutableOrdSlice, MutableSlice, Items, MutItems};
103 pub use core::slice::{MutSplits, MutChunks};
104 pub use core::slice::{bytes, MutableCloneableSlice};
106 // Functional utilities
108 #[allow(missing_doc)]
109 pub trait VectorVector<T> {
110 // FIXME #5898: calling these .concat and .connect conflicts with
111 // StrVector::con{cat,nect}, since they have generic contents.
112 /// Flattens a vector of vectors of T into a single vector of T.
113 fn concat_vec(&self) -> Vec<T>;
115 /// Concatenate a vector of vectors, placing a given separator between each.
116 fn connect_vec(&self, sep: &T) -> Vec<T>;
119 impl<'a, T: Clone, V: Vector<T>> VectorVector<T> for &'a [V] {
120 fn concat_vec(&self) -> Vec<T> {
121 let size = self.iter().fold(0u, |acc, v| acc + v.as_slice().len());
122 let mut result = Vec::with_capacity(size);
123 for v in self.iter() {
124 result.push_all(v.as_slice())
129 fn connect_vec(&self, sep: &T) -> Vec<T> {
130 let size = self.iter().fold(0u, |acc, v| acc + v.as_slice().len());
131 let mut result = Vec::with_capacity(size + self.len());
132 let mut first = true;
133 for v in self.iter() {
134 if first { first = false } else { result.push(sep.clone()) }
135 result.push_all(v.as_slice())
141 /// An Iterator that yields the element swaps needed to produce
142 /// a sequence of all possible permutations for an indexed sequence of
143 /// elements. Each permutation is only a single swap apart.
145 /// The Steinhaus-Johnson-Trotter algorithm is used.
147 /// Generates even and odd permutations alternately.
149 /// The last generated swap is always (0, 1), and it returns the
150 /// sequence to its initial order.
151 pub struct ElementSwaps {
152 sdir: Vec<SizeDirection>,
153 /// If true, emit the last swap that returns the sequence to initial state
159 /// Create an `ElementSwaps` iterator for a sequence of `length` elements
160 pub fn new(length: uint) -> ElementSwaps {
161 // Initialize `sdir` with a direction that position should move in
162 // (all negative at the beginning) and the `size` of the
163 // element (equal to the original index).
166 sdir: range(0, length).map(|i| SizeDirection{ size: i, dir: Neg }).collect(),
172 enum Direction { Pos, Neg }
174 /// An Index and Direction together
175 struct SizeDirection {
180 impl Iterator<(uint, uint)> for ElementSwaps {
182 fn next(&mut self) -> Option<(uint, uint)> {
183 fn new_pos(i: uint, s: Direction) -> uint {
184 i + match s { Pos => 1, Neg => -1 }
187 // Find the index of the largest mobile element:
188 // The direction should point into the vector, and the
189 // swap should be with a smaller `size` element.
190 let max = self.sdir.iter().map(|&x| x).enumerate()
192 new_pos(i, sd.dir) < self.sdir.len() &&
193 self.sdir[new_pos(i, sd.dir)].size < sd.size)
194 .max_by(|&(_, sd)| sd.size);
197 let j = new_pos(i, sd.dir);
198 self.sdir.as_mut_slice().swap(i, j);
200 // Swap the direction of each larger SizeDirection
201 for x in self.sdir.mut_iter() {
202 if x.size > sd.size {
203 x.dir = match x.dir { Pos => Neg, Neg => Pos };
206 self.swaps_made += 1;
209 None => if self.emit_reset {
210 self.emit_reset = false;
211 if self.sdir.len() > 1 {
213 self.swaps_made += 1;
216 // Vector is of the form [] or [x], and the only permutation is itself
217 self.swaps_made += 1;
225 fn size_hint(&self) -> (uint, Option<uint>) {
226 // For a vector of size n, there are exactly n! permutations.
227 let n = range(2, self.sdir.len() + 1).product();
228 (n - self.swaps_made, Some(n - self.swaps_made))
232 /// An Iterator that uses `ElementSwaps` to iterate through
233 /// all possible permutations of a vector.
235 /// The first iteration yields a clone of the vector as it is,
236 /// then each successive element is the vector with one
239 /// Generates even and odd permutations alternately.
240 pub struct Permutations<T> {
245 impl<T: Clone> Iterator<Vec<T>> for Permutations<T> {
247 fn next(&mut self) -> Option<Vec<T>> {
248 match self.swaps.next() {
250 Some((0,0)) => Some(self.v.clone()),
252 let elt = self.v.clone();
253 self.v.as_mut_slice().swap(a, b);
260 fn size_hint(&self) -> (uint, Option<uint>) {
261 self.swaps.size_hint()
265 /// Extension methods for vector slices with cloneable elements
266 pub trait CloneableVector<T> {
267 /// Copy `self` into a new vector
268 fn to_vec(&self) -> Vec<T>;
270 /// Deprecated. Use `to_vec`
271 #[deprecated = "Replaced by `to_vec`"]
272 fn to_owned(&self) -> Vec<T> {
276 /// Convert `self` into an owned vector, not making a copy if possible.
277 fn into_vec(self) -> Vec<T>;
279 /// Deprecated. Use `into_vec`
280 #[deprecated = "Replaced by `into_vec`"]
281 fn into_owned(self) -> Vec<T> {
286 /// Extension methods for vector slices
287 impl<'a, T: Clone> CloneableVector<T> for &'a [T] {
288 /// Returns a copy of `v`.
290 fn to_vec(&self) -> Vec<T> { Vec::from_slice(*self) }
293 fn into_vec(self) -> Vec<T> { self.to_vec() }
296 /// Extension methods for vectors containing `Clone` elements.
297 pub trait ImmutableCloneableVector<T> {
298 /// Partitions the vector into two vectors `(A,B)`, where all
299 /// elements of `A` satisfy `f` and all elements of `B` do not.
300 fn partitioned(&self, f: |&T| -> bool) -> (Vec<T>, Vec<T>);
302 /// Create an iterator that yields every possible permutation of the
303 /// vector in succession.
308 /// let v = [1i, 2, 3];
309 /// let mut perms = v.permutations();
312 /// println!("{}", p);
316 /// # Example 2: iterating through permutations one by one.
319 /// let v = [1i, 2, 3];
320 /// let mut perms = v.permutations();
322 /// assert_eq!(Some(vec![1i, 2, 3]), perms.next());
323 /// assert_eq!(Some(vec![1i, 3, 2]), perms.next());
324 /// assert_eq!(Some(vec![3i, 1, 2]), perms.next());
326 fn permutations(self) -> Permutations<T>;
329 impl<'a,T:Clone> ImmutableCloneableVector<T> for &'a [T] {
331 fn partitioned(&self, f: |&T| -> bool) -> (Vec<T>, Vec<T>) {
332 let mut lefts = Vec::new();
333 let mut rights = Vec::new();
335 for elt in self.iter() {
337 lefts.push((*elt).clone());
339 rights.push((*elt).clone());
346 /// Returns an iterator over all permutations of a vector.
347 fn permutations(self) -> Permutations<T> {
349 swaps: ElementSwaps::new(self.len()),
356 fn insertion_sort<T>(v: &mut [T], compare: |&T, &T| -> Ordering) {
357 let len = v.len() as int;
358 let buf_v = v.as_mut_ptr();
361 for i in range(1, len) {
362 // j satisfies: 0 <= j <= i;
366 let read_ptr = buf_v.offset(i) as *const T;
368 // find where to insert, we need to do strict <,
369 // rather than <=, to maintain stability.
371 // 0 <= j - 1 < len, so .offset(j - 1) is in bounds.
373 compare(&*read_ptr, &*buf_v.offset(j - 1)) == Less {
377 // shift everything to the right, to make space to
378 // insert this value.
380 // j + 1 could be `len` (for the last `i`), but in
381 // that case, `i == j` so we don't copy. The
382 // `.offset(j)` is always in bounds.
385 let tmp = ptr::read(read_ptr);
386 ptr::copy_memory(buf_v.offset(j + 1),
389 ptr::copy_nonoverlapping_memory(buf_v.offset(j),
398 fn merge_sort<T>(v: &mut [T], compare: |&T, &T| -> Ordering) {
399 // warning: this wildly uses unsafe.
400 static BASE_INSERTION: uint = 32;
401 static LARGE_INSERTION: uint = 16;
403 // FIXME #12092: smaller insertion runs seems to make sorting
404 // vectors of large elements a little faster on some platforms,
405 // but hasn't been tested/tuned extensively
406 let insertion = if size_of::<T>() <= 16 {
414 // short vectors get sorted in-place via insertion sort to avoid allocations
415 if len <= insertion {
416 insertion_sort(v, compare);
420 // allocate some memory to use as scratch memory, we keep the
421 // length 0 so we can keep shallow copies of the contents of `v`
422 // without risking the dtors running on an object twice if
424 let mut working_space = Vec::with_capacity(2 * len);
425 // these both are buffers of length `len`.
426 let mut buf_dat = working_space.as_mut_ptr();
427 let mut buf_tmp = unsafe {buf_dat.offset(len as int)};
430 let buf_v = v.as_ptr();
432 // step 1. sort short runs with insertion sort. This takes the
433 // values from `v` and sorts them into `buf_dat`, leaving that
434 // with sorted runs of length INSERTION.
436 // We could hardcode the sorting comparisons here, and we could
437 // manipulate/step the pointers themselves, rather than repeatedly
439 for start in range_step(0, len, insertion) {
441 for i in range(start, cmp::min(start + insertion, len)) {
442 // j satisfies: start <= j <= i;
443 let mut j = i as int;
446 let read_ptr = buf_v.offset(i as int);
448 // find where to insert, we need to do strict <,
449 // rather than <=, to maintain stability.
451 // start <= j - 1 < len, so .offset(j - 1) is in
453 while j > start as int &&
454 compare(&*read_ptr, &*buf_dat.offset(j - 1)) == Less {
458 // shift everything to the right, to make space to
459 // insert this value.
461 // j + 1 could be `len` (for the last `i`), but in
462 // that case, `i == j` so we don't copy. The
463 // `.offset(j)` is always in bounds.
464 ptr::copy_memory(buf_dat.offset(j + 1),
467 ptr::copy_nonoverlapping_memory(buf_dat.offset(j), read_ptr, 1);
472 // step 2. merge the sorted runs.
473 let mut width = insertion;
475 // merge the sorted runs of length `width` in `buf_dat` two at
476 // a time, placing the result in `buf_tmp`.
478 // 0 <= start <= len.
479 for start in range_step(0, len, 2 * width) {
480 // manipulate pointers directly for speed (rather than
481 // using a `for` loop with `range` and `.offset` inside
484 // the end of the first run & start of the
485 // second. Offset of `len` is defined, since this is
486 // precisely one byte past the end of the object.
487 let right_start = buf_dat.offset(cmp::min(start + width, len) as int);
488 // end of the second. Similar reasoning to the above re safety.
489 let right_end_idx = cmp::min(start + 2 * width, len);
490 let right_end = buf_dat.offset(right_end_idx as int);
492 // the pointers to the elements under consideration
493 // from the two runs.
495 // both of these are in bounds.
496 let mut left = buf_dat.offset(start as int);
497 let mut right = right_start;
499 // where we're putting the results, it is a run of
500 // length `2*width`, so we step it once for each step
501 // of either `left` or `right`. `buf_tmp` has length
502 // `len`, so these are in bounds.
503 let mut out = buf_tmp.offset(start as int);
504 let out_end = buf_tmp.offset(right_end_idx as int);
506 while out < out_end {
507 // Either the left or the right run are exhausted,
508 // so just copy the remainder from the other run
509 // and move on; this gives a huge speed-up (order
510 // of 25%) for mostly sorted vectors (the best
512 if left == right_start {
513 // the number remaining in this run.
514 let elems = (right_end as uint - right as uint) / mem::size_of::<T>();
515 ptr::copy_nonoverlapping_memory(out, &*right, elems);
517 } else if right == right_end {
518 let elems = (right_start as uint - left as uint) / mem::size_of::<T>();
519 ptr::copy_nonoverlapping_memory(out, &*left, elems);
523 // check which side is smaller, and that's the
524 // next element for the new run.
526 // `left < right_start` and `right < right_end`,
527 // so these are valid.
528 let to_copy = if compare(&*left, &*right) == Greater {
533 ptr::copy_nonoverlapping_memory(out, &*to_copy, 1);
539 mem::swap(&mut buf_dat, &mut buf_tmp);
544 // write the result to `v` in one go, so that there are never two copies
545 // of the same object in `v`.
547 ptr::copy_nonoverlapping_memory(v.as_mut_ptr(), &*buf_dat, len);
550 // increment the pointer, returning the old pointer.
552 unsafe fn step<T>(ptr: &mut *mut T) -> *mut T {
554 *ptr = ptr.offset(1);
559 /// Extension methods for vectors such that their elements are
561 pub trait MutableSliceAllocating<'a, T> {
562 /// Sort the vector, in place, using `compare` to compare
565 /// This sort is `O(n log n)` worst-case and stable, but allocates
566 /// approximately `2 * n`, where `n` is the length of `self`.
571 /// let mut v = [5i, 4, 1, 3, 2];
572 /// v.sort_by(|a, b| a.cmp(b));
573 /// assert!(v == [1, 2, 3, 4, 5]);
575 /// // reverse sorting
576 /// v.sort_by(|a, b| b.cmp(a));
577 /// assert!(v == [5, 4, 3, 2, 1]);
579 fn sort_by(self, compare: |&T, &T| -> Ordering);
582 * Consumes `src` and moves as many elements as it can into `self`
583 * from the range [start,end).
585 * Returns the number of elements copied (the shorter of self.len()
590 * * src - A mutable vector of `T`
591 * * start - The index into `src` to start copying from
592 * * end - The index into `src` to stop copying from
597 * let mut a = [1i, 2, 3, 4, 5];
598 * let b = vec![6i, 7, 8];
599 * let num_moved = a.move_from(b, 0, 3);
600 * assert_eq!(num_moved, 3);
601 * assert!(a == [6i, 7, 8, 4, 5]);
604 fn move_from(self, src: Vec<T>, start: uint, end: uint) -> uint;
607 impl<'a,T> MutableSliceAllocating<'a, T> for &'a mut [T] {
609 fn sort_by(self, compare: |&T, &T| -> Ordering) {
610 merge_sort(self, compare)
614 fn move_from(self, mut src: Vec<T>, start: uint, end: uint) -> uint {
615 for (a, b) in self.mut_iter().zip(src.mut_slice(start, end).mut_iter()) {
618 cmp::min(self.len(), end-start)
622 /// Methods for mutable vectors with orderable elements, such as
623 /// in-place sorting.
624 pub trait MutableOrdSlice<T> {
625 /// Sort the vector, in place.
627 /// This is equivalent to `self.sort_by(|a, b| a.cmp(b))`.
632 /// let mut v = [-5i, 4, 1, -3, 2];
635 /// assert!(v == [-5i, -3, 1, 2, 4]);
639 /// Mutates the slice to the next lexicographic permutation.
641 /// Returns `true` if successful, `false` if the slice is at the last-ordered permutation.
646 /// let v = &mut [0i, 1, 2];
647 /// v.next_permutation();
648 /// assert_eq!(v, &mut [0i, 2, 1]);
649 /// v.next_permutation();
650 /// assert_eq!(v, &mut [1i, 0, 2]);
652 fn next_permutation(self) -> bool;
654 /// Mutates the slice to the previous lexicographic permutation.
656 /// Returns `true` if successful, `false` if the slice is at the first-ordered permutation.
661 /// let v = &mut [1i, 0, 2];
662 /// v.prev_permutation();
663 /// assert_eq!(v, &mut [0i, 2, 1]);
664 /// v.prev_permutation();
665 /// assert_eq!(v, &mut [0i, 1, 2]);
667 fn prev_permutation(self) -> bool;
670 impl<'a, T: Ord> MutableOrdSlice<T> for &'a mut [T] {
673 self.sort_by(|a,b| a.cmp(b))
676 fn next_permutation(self) -> bool {
677 // These cases only have 1 permutation each, so we can't do anything.
678 if self.len() < 2 { return false; }
680 // Step 1: Identify the longest, rightmost weakly decreasing part of the vector
681 let mut i = self.len() - 1;
682 while i > 0 && self[i-1] >= self[i] {
686 // If that is the entire vector, this is the last-ordered permutation.
691 // Step 2: Find the rightmost element larger than the pivot (i-1)
692 let mut j = self.len() - 1;
693 while j >= i && self[j] <= self[i-1] {
697 // Step 3: Swap that element with the pivot
700 // Step 4: Reverse the (previously) weakly decreasing part
701 self.mut_slice_from(i).reverse();
706 fn prev_permutation(self) -> bool {
707 // These cases only have 1 permutation each, so we can't do anything.
708 if self.len() < 2 { return false; }
710 // Step 1: Identify the longest, rightmost weakly increasing part of the vector
711 let mut i = self.len() - 1;
712 while i > 0 && self[i-1] <= self[i] {
716 // If that is the entire vector, this is the first-ordered permutation.
721 // Step 2: Reverse the weakly increasing part
722 self.mut_slice_from(i).reverse();
724 // Step 3: Find the rightmost element equal to or bigger than the pivot (i-1)
725 let mut j = self.len() - 1;
726 while j >= i && self[j-1] < self[i-1] {
730 // Step 4: Swap that element with the pivot
737 /// Unsafe operations
739 pub use core::slice::raw::{buf_as_slice, mut_buf_as_slice};
740 pub use core::slice::raw::{shift_ptr, pop_ptr};
746 use std::default::Default;
749 use std::rand::{Rng, task_rng};
754 use {Mutable, MutableSeq};
757 fn square(n: uint) -> uint { n * n }
759 fn is_odd(n: &uint) -> bool { *n % 2u == 1u }
763 // Test on-stack from_fn.
764 let mut v = Vec::from_fn(3u, square);
766 let v = v.as_slice();
767 assert_eq!(v.len(), 3u);
768 assert_eq!(v[0], 0u);
769 assert_eq!(v[1], 1u);
770 assert_eq!(v[2], 4u);
773 // Test on-heap from_fn.
774 v = Vec::from_fn(5u, square);
776 let v = v.as_slice();
777 assert_eq!(v.len(), 5u);
778 assert_eq!(v[0], 0u);
779 assert_eq!(v[1], 1u);
780 assert_eq!(v[2], 4u);
781 assert_eq!(v[3], 9u);
782 assert_eq!(v[4], 16u);
787 fn test_from_elem() {
788 // Test on-stack from_elem.
789 let mut v = Vec::from_elem(2u, 10u);
791 let v = v.as_slice();
792 assert_eq!(v.len(), 2u);
793 assert_eq!(v[0], 10u);
794 assert_eq!(v[1], 10u);
797 // Test on-heap from_elem.
798 v = Vec::from_elem(6u, 20u);
800 let v = v.as_slice();
801 assert_eq!(v[0], 20u);
802 assert_eq!(v[1], 20u);
803 assert_eq!(v[2], 20u);
804 assert_eq!(v[3], 20u);
805 assert_eq!(v[4], 20u);
806 assert_eq!(v[5], 20u);
812 let xs: [int, ..0] = [];
813 assert!(xs.is_empty());
814 assert!(![0i].is_empty());
818 fn test_len_divzero() {
821 let v1 : &[Z] = &[[]];
822 let v2 : &[Z] = &[[], []];
823 assert_eq!(mem::size_of::<Z>(), 0);
824 assert_eq!(v0.len(), 0);
825 assert_eq!(v1.len(), 1);
826 assert_eq!(v2.len(), 2);
831 let mut a = vec![11i];
832 assert_eq!(a.as_slice().get(1), None);
834 assert_eq!(a.as_slice().get(1).unwrap(), &12);
835 a = vec![11i, 12, 13];
836 assert_eq!(a.as_slice().get(1).unwrap(), &12);
842 assert_eq!(a.as_slice().head(), None);
844 assert_eq!(a.as_slice().head().unwrap(), &11);
846 assert_eq!(a.as_slice().head().unwrap(), &11);
851 let mut a = vec![11i];
852 assert_eq!(a.tail(), &[]);
854 assert_eq!(a.tail(), &[12]);
859 fn test_tail_empty() {
860 let a: Vec<int> = vec![];
866 let mut a = vec![11i, 12, 13];
867 assert_eq!(a.tailn(0), &[11, 12, 13]);
868 a = vec![11i, 12, 13];
869 assert_eq!(a.tailn(2), &[13]);
874 fn test_tailn_empty() {
875 let a: Vec<int> = vec![];
881 let mut a = vec![11i];
882 assert_eq!(a.init(), &[]);
884 assert_eq!(a.init(), &[11]);
889 fn test_init_empty() {
890 let a: Vec<int> = vec![];
896 let mut a = vec![11i, 12, 13];
897 assert_eq!(a.as_slice().initn(0), &[11, 12, 13]);
898 a = vec![11i, 12, 13];
899 assert_eq!(a.as_slice().initn(2), &[11]);
904 fn test_initn_empty() {
905 let a: Vec<int> = vec![];
906 a.as_slice().initn(2);
912 assert_eq!(a.as_slice().last(), None);
914 assert_eq!(a.as_slice().last().unwrap(), &11);
916 assert_eq!(a.as_slice().last().unwrap(), &12);
921 // Test fixed length vector.
922 let vec_fixed = [1i, 2, 3, 4];
923 let v_a = vec_fixed.slice(1u, vec_fixed.len()).to_vec();
924 assert_eq!(v_a.len(), 3u);
925 let v_a = v_a.as_slice();
926 assert_eq!(v_a[0], 2);
927 assert_eq!(v_a[1], 3);
928 assert_eq!(v_a[2], 4);
931 let vec_stack = &[1i, 2, 3];
932 let v_b = vec_stack.slice(1u, 3u).to_vec();
933 assert_eq!(v_b.len(), 2u);
934 let v_b = v_b.as_slice();
935 assert_eq!(v_b[0], 2);
936 assert_eq!(v_b[1], 3);
939 let vec_unique = vec![1i, 2, 3, 4, 5, 6];
940 let v_d = vec_unique.slice(1u, 6u).to_vec();
941 assert_eq!(v_d.len(), 5u);
942 let v_d = v_d.as_slice();
943 assert_eq!(v_d[0], 2);
944 assert_eq!(v_d[1], 3);
945 assert_eq!(v_d[2], 4);
946 assert_eq!(v_d[3], 5);
947 assert_eq!(v_d[4], 6);
951 fn test_slice_from() {
952 let vec = &[1i, 2, 3, 4];
953 assert_eq!(vec.slice_from(0), vec);
954 assert_eq!(vec.slice_from(2), &[3, 4]);
955 assert_eq!(vec.slice_from(4), &[]);
960 let vec = &[1i, 2, 3, 4];
961 assert_eq!(vec.slice_to(4), vec);
962 assert_eq!(vec.slice_to(2), &[1, 2]);
963 assert_eq!(vec.slice_to(0), &[]);
969 let mut v = vec![5i];
971 assert_eq!(v.len(), 0);
972 assert_eq!(e, Some(5));
980 fn test_swap_remove() {
981 let mut v = vec![1i, 2, 3, 4, 5];
982 let mut e = v.swap_remove(0);
983 assert_eq!(e, Some(1));
984 assert_eq!(v, vec![5i, 2, 3, 4]);
985 e = v.swap_remove(3);
986 assert_eq!(e, Some(4));
987 assert_eq!(v, vec![5i, 2, 3]);
989 e = v.swap_remove(3);
991 assert_eq!(v, vec![5i, 2, 3]);
995 fn test_swap_remove_noncopyable() {
996 // Tests that we don't accidentally run destructors twice.
997 let mut v = vec![rt::exclusive::Exclusive::new(()),
998 rt::exclusive::Exclusive::new(()),
999 rt::exclusive::Exclusive::new(())];
1000 let mut _e = v.swap_remove(0);
1001 assert_eq!(v.len(), 2);
1002 _e = v.swap_remove(1);
1003 assert_eq!(v.len(), 1);
1004 _e = v.swap_remove(0);
1005 assert_eq!(v.len(), 0);
1010 // Test on-stack push().
1013 assert_eq!(v.len(), 1u);
1014 assert_eq!(v.as_slice()[0], 1);
1016 // Test on-heap push().
1018 assert_eq!(v.len(), 2u);
1019 assert_eq!(v.as_slice()[0], 1);
1020 assert_eq!(v.as_slice()[1], 2);
1025 // Test on-stack grow().
1029 let v = v.as_slice();
1030 assert_eq!(v.len(), 2u);
1031 assert_eq!(v[0], 1);
1032 assert_eq!(v[1], 1);
1035 // Test on-heap grow().
1038 let v = v.as_slice();
1039 assert_eq!(v.len(), 5u);
1040 assert_eq!(v[0], 1);
1041 assert_eq!(v[1], 1);
1042 assert_eq!(v[2], 2);
1043 assert_eq!(v[3], 2);
1044 assert_eq!(v[4], 2);
1051 v.grow_fn(3u, square);
1052 let v = v.as_slice();
1053 assert_eq!(v.len(), 3u);
1054 assert_eq!(v[0], 0u);
1055 assert_eq!(v[1], 1u);
1056 assert_eq!(v[2], 4u);
1060 fn test_grow_set() {
1061 let mut v = vec![1i, 2, 3];
1062 v.grow_set(4u, &4, 5);
1063 let v = v.as_slice();
1064 assert_eq!(v.len(), 5u);
1065 assert_eq!(v[0], 1);
1066 assert_eq!(v[1], 2);
1067 assert_eq!(v[2], 3);
1068 assert_eq!(v[3], 4);
1069 assert_eq!(v[4], 5);
1073 fn test_truncate() {
1074 let mut v = vec![box 6i,box 5,box 4];
1076 let v = v.as_slice();
1077 assert_eq!(v.len(), 1);
1078 assert_eq!(*(v[0]), 6);
1079 // If the unsafe block didn't drop things properly, we blow up here.
1084 let mut v = vec![box 6i,box 5,box 4];
1086 assert_eq!(v.len(), 0);
1087 // If the unsafe block didn't drop things properly, we blow up here.
1092 fn case(a: Vec<uint>, b: Vec<uint>) {
1097 case(vec![], vec![]);
1098 case(vec![1u], vec![1]);
1099 case(vec![1u,1], vec![1]);
1100 case(vec![1u,2,3], vec![1,2,3]);
1101 case(vec![1u,1,2,3], vec![1,2,3]);
1102 case(vec![1u,2,2,3], vec![1,2,3]);
1103 case(vec![1u,2,3,3], vec![1,2,3]);
1104 case(vec![1u,1,2,2,2,3,3], vec![1,2,3]);
1108 fn test_dedup_unique() {
1109 let mut v0 = vec![box 1i, box 1, box 2, box 3];
1111 let mut v1 = vec![box 1i, box 2, box 2, box 3];
1113 let mut v2 = vec![box 1i, box 2, box 3, box 3];
1116 * If the boxed pointers were leaked or otherwise misused, valgrind
1117 * and/or rustrt should raise errors.
1122 fn test_dedup_shared() {
1123 let mut v0 = vec![box 1i, box 1, box 2, box 3];
1125 let mut v1 = vec![box 1i, box 2, box 2, box 3];
1127 let mut v2 = vec![box 1i, box 2, box 3, box 3];
1130 * If the pointers were leaked or otherwise misused, valgrind and/or
1131 * rustrt should raise errors.
1137 let mut v = vec![1u, 2, 3, 4, 5];
1139 assert_eq!(v, vec![1u, 3, 5]);
1143 fn test_element_swaps() {
1144 let mut v = [1i, 2, 3];
1145 for (i, (a, b)) in ElementSwaps::new(v.len()).enumerate() {
1148 0 => assert!(v == [1, 3, 2]),
1149 1 => assert!(v == [3, 1, 2]),
1150 2 => assert!(v == [3, 2, 1]),
1151 3 => assert!(v == [2, 3, 1]),
1152 4 => assert!(v == [2, 1, 3]),
1153 5 => assert!(v == [1, 2, 3]),
1160 fn test_permutations() {
1162 let v: [int, ..0] = [];
1163 let mut it = v.permutations();
1164 let (min_size, max_opt) = it.size_hint();
1165 assert_eq!(min_size, 1);
1166 assert_eq!(max_opt.unwrap(), 1);
1167 assert_eq!(it.next(), Some(v.as_slice().to_vec()));
1168 assert_eq!(it.next(), None);
1171 let v = ["Hello".to_string()];
1172 let mut it = v.permutations();
1173 let (min_size, max_opt) = it.size_hint();
1174 assert_eq!(min_size, 1);
1175 assert_eq!(max_opt.unwrap(), 1);
1176 assert_eq!(it.next(), Some(v.as_slice().to_vec()));
1177 assert_eq!(it.next(), None);
1181 let mut it = v.permutations();
1182 let (min_size, max_opt) = it.size_hint();
1183 assert_eq!(min_size, 3*2);
1184 assert_eq!(max_opt.unwrap(), 3*2);
1185 assert_eq!(it.next(), Some(vec![1,2,3]));
1186 assert_eq!(it.next(), Some(vec![1,3,2]));
1187 assert_eq!(it.next(), Some(vec![3,1,2]));
1188 let (min_size, max_opt) = it.size_hint();
1189 assert_eq!(min_size, 3);
1190 assert_eq!(max_opt.unwrap(), 3);
1191 assert_eq!(it.next(), Some(vec![3,2,1]));
1192 assert_eq!(it.next(), Some(vec![2,3,1]));
1193 assert_eq!(it.next(), Some(vec![2,1,3]));
1194 assert_eq!(it.next(), None);
1197 // check that we have N! permutations
1198 let v = ['A', 'B', 'C', 'D', 'E', 'F'];
1200 let mut it = v.permutations();
1201 let (min_size, max_opt) = it.size_hint();
1205 assert_eq!(amt, it.swaps.swaps_made);
1206 assert_eq!(amt, min_size);
1207 assert_eq!(amt, 2 * 3 * 4 * 5 * 6);
1208 assert_eq!(amt, max_opt.unwrap());
1213 fn test_lexicographic_permutations() {
1214 let v : &mut[int] = &mut[1i, 2, 3, 4, 5];
1215 assert!(v.prev_permutation() == false);
1216 assert!(v.next_permutation());
1217 assert_eq!(v, &mut[1, 2, 3, 5, 4]);
1218 assert!(v.prev_permutation());
1219 assert_eq!(v, &mut[1, 2, 3, 4, 5]);
1220 assert!(v.next_permutation());
1221 assert!(v.next_permutation());
1222 assert_eq!(v, &mut[1, 2, 4, 3, 5]);
1223 assert!(v.next_permutation());
1224 assert_eq!(v, &mut[1, 2, 4, 5, 3]);
1226 let v : &mut[int] = &mut[1i, 0, 0, 0];
1227 assert!(v.next_permutation() == false);
1228 assert!(v.prev_permutation());
1229 assert_eq!(v, &mut[0, 1, 0, 0]);
1230 assert!(v.prev_permutation());
1231 assert_eq!(v, &mut[0, 0, 1, 0]);
1232 assert!(v.prev_permutation());
1233 assert_eq!(v, &mut[0, 0, 0, 1]);
1234 assert!(v.prev_permutation() == false);
1238 fn test_lexicographic_permutations_empty_and_short() {
1239 let empty : &mut[int] = &mut[];
1240 assert!(empty.next_permutation() == false);
1241 assert_eq!(empty, &mut[]);
1242 assert!(empty.prev_permutation() == false);
1243 assert_eq!(empty, &mut[]);
1245 let one_elem : &mut[int] = &mut[4i];
1246 assert!(one_elem.prev_permutation() == false);
1247 assert_eq!(one_elem, &mut[4]);
1248 assert!(one_elem.next_permutation() == false);
1249 assert_eq!(one_elem, &mut[4]);
1251 let two_elem : &mut[int] = &mut[1i, 2];
1252 assert!(two_elem.prev_permutation() == false);
1253 assert_eq!(two_elem, &mut[1, 2]);
1254 assert!(two_elem.next_permutation());
1255 assert_eq!(two_elem, &mut[2, 1]);
1256 assert!(two_elem.next_permutation() == false);
1257 assert_eq!(two_elem, &mut[2, 1]);
1258 assert!(two_elem.prev_permutation());
1259 assert_eq!(two_elem, &mut[1, 2]);
1260 assert!(two_elem.prev_permutation() == false);
1261 assert_eq!(two_elem, &mut[1, 2]);
1265 fn test_position_elem() {
1266 assert!([].position_elem(&1i).is_none());
1268 let v1 = vec![1i, 2, 3, 3, 2, 5];
1269 assert_eq!(v1.as_slice().position_elem(&1), Some(0u));
1270 assert_eq!(v1.as_slice().position_elem(&2), Some(1u));
1271 assert_eq!(v1.as_slice().position_elem(&5), Some(5u));
1272 assert!(v1.as_slice().position_elem(&4).is_none());
1276 fn test_bsearch_elem() {
1277 assert_eq!([1i,2,3,4,5].bsearch_elem(&5), Some(4));
1278 assert_eq!([1i,2,3,4,5].bsearch_elem(&4), Some(3));
1279 assert_eq!([1i,2,3,4,5].bsearch_elem(&3), Some(2));
1280 assert_eq!([1i,2,3,4,5].bsearch_elem(&2), Some(1));
1281 assert_eq!([1i,2,3,4,5].bsearch_elem(&1), Some(0));
1283 assert_eq!([2i,4,6,8,10].bsearch_elem(&1), None);
1284 assert_eq!([2i,4,6,8,10].bsearch_elem(&5), None);
1285 assert_eq!([2i,4,6,8,10].bsearch_elem(&4), Some(1));
1286 assert_eq!([2i,4,6,8,10].bsearch_elem(&10), Some(4));
1288 assert_eq!([2i,4,6,8].bsearch_elem(&1), None);
1289 assert_eq!([2i,4,6,8].bsearch_elem(&5), None);
1290 assert_eq!([2i,4,6,8].bsearch_elem(&4), Some(1));
1291 assert_eq!([2i,4,6,8].bsearch_elem(&8), Some(3));
1293 assert_eq!([2i,4,6].bsearch_elem(&1), None);
1294 assert_eq!([2i,4,6].bsearch_elem(&5), None);
1295 assert_eq!([2i,4,6].bsearch_elem(&4), Some(1));
1296 assert_eq!([2i,4,6].bsearch_elem(&6), Some(2));
1298 assert_eq!([2i,4].bsearch_elem(&1), None);
1299 assert_eq!([2i,4].bsearch_elem(&5), None);
1300 assert_eq!([2i,4].bsearch_elem(&2), Some(0));
1301 assert_eq!([2i,4].bsearch_elem(&4), Some(1));
1303 assert_eq!([2i].bsearch_elem(&1), None);
1304 assert_eq!([2i].bsearch_elem(&5), None);
1305 assert_eq!([2i].bsearch_elem(&2), Some(0));
1307 assert_eq!([].bsearch_elem(&1i), None);
1308 assert_eq!([].bsearch_elem(&5i), None);
1310 assert!([1i,1,1,1,1].bsearch_elem(&1) != None);
1311 assert!([1i,1,1,1,2].bsearch_elem(&1) != None);
1312 assert!([1i,1,1,2,2].bsearch_elem(&1) != None);
1313 assert!([1i,1,2,2,2].bsearch_elem(&1) != None);
1314 assert_eq!([1i,2,2,2,2].bsearch_elem(&1), Some(0));
1316 assert_eq!([1i,2,3,4,5].bsearch_elem(&6), None);
1317 assert_eq!([1i,2,3,4,5].bsearch_elem(&0), None);
1322 let mut v: Vec<int> = vec![10i, 20];
1323 assert_eq!(*v.get(0), 10);
1324 assert_eq!(*v.get(1), 20);
1326 assert_eq!(*v.get(0), 20);
1327 assert_eq!(*v.get(1), 10);
1329 let mut v3: Vec<int> = vec![];
1331 assert!(v3.is_empty());
1336 for len in range(4u, 25) {
1337 for _ in range(0i, 100) {
1338 let mut v = task_rng().gen_iter::<uint>().take(len)
1339 .collect::<Vec<uint>>();
1340 let mut v1 = v.clone();
1342 v.as_mut_slice().sort();
1343 assert!(v.as_slice().windows(2).all(|w| w[0] <= w[1]));
1345 v1.as_mut_slice().sort_by(|a, b| a.cmp(b));
1346 assert!(v1.as_slice().windows(2).all(|w| w[0] <= w[1]));
1348 v1.as_mut_slice().sort_by(|a, b| b.cmp(a));
1349 assert!(v1.as_slice().windows(2).all(|w| w[0] >= w[1]));
1353 // shouldn't fail/crash
1354 let mut v: [uint, .. 0] = [];
1357 let mut v = [0xDEADBEEFu];
1359 assert!(v == [0xDEADBEEF]);
1363 fn test_sort_stability() {
1364 for len in range(4i, 25) {
1365 for _ in range(0u, 10) {
1366 let mut counts = [0i, .. 10];
1368 // create a vector like [(6, 1), (5, 1), (6, 2), ...],
1369 // where the first item of each tuple is random, but
1370 // the second item represents which occurrence of that
1371 // number this element is, i.e. the second elements
1372 // will occur in sorted order.
1373 let mut v = range(0, len).map(|_| {
1374 let n = task_rng().gen::<uint>() % 10;
1377 }).collect::<Vec<(uint, int)>>();
1379 // only sort on the first element, so an unstable sort
1380 // may mix up the counts.
1381 v.sort_by(|&(a,_), &(b,_)| a.cmp(&b));
1383 // this comparison includes the count (the second item
1384 // of the tuple), so elements with equal first items
1385 // will need to be ordered with increasing
1386 // counts... i.e. exactly asserting that this sort is
1388 assert!(v.as_slice().windows(2).all(|w| w[0] <= w[1]));
1394 fn test_partition() {
1395 assert_eq!((vec![]).partition(|x: &int| *x < 3), (vec![], vec![]));
1396 assert_eq!((vec![1i, 2, 3]).partition(|x: &int| *x < 4), (vec![1, 2, 3], vec![]));
1397 assert_eq!((vec![1i, 2, 3]).partition(|x: &int| *x < 2), (vec![1], vec![2, 3]));
1398 assert_eq!((vec![1i, 2, 3]).partition(|x: &int| *x < 0), (vec![], vec![1, 2, 3]));
1402 fn test_partitioned() {
1403 assert_eq!(([]).partitioned(|x: &int| *x < 3), (vec![], vec![]));
1404 assert_eq!(([1i, 2, 3]).partitioned(|x: &int| *x < 4), (vec![1, 2, 3], vec![]));
1405 assert_eq!(([1i, 2, 3]).partitioned(|x: &int| *x < 2), (vec![1], vec![2, 3]));
1406 assert_eq!(([1i, 2, 3]).partitioned(|x: &int| *x < 0), (vec![], vec![1, 2, 3]));
1411 let v: [Vec<int>, ..0] = [];
1412 assert_eq!(v.concat_vec(), vec![]);
1413 assert_eq!([vec![1i], vec![2i,3i]].concat_vec(), vec![1, 2, 3]);
1415 assert_eq!([&[1i], &[2i,3i]].concat_vec(), vec![1, 2, 3]);
1420 let v: [Vec<int>, ..0] = [];
1421 assert_eq!(v.connect_vec(&0), vec![]);
1422 assert_eq!([vec![1i], vec![2i, 3]].connect_vec(&0), vec![1, 0, 2, 3]);
1423 assert_eq!([vec![1i], vec![2i], vec![3i]].connect_vec(&0), vec![1, 0, 2, 0, 3]);
1425 assert_eq!([&[1i], &[2i, 3]].connect_vec(&0), vec![1, 0, 2, 3]);
1426 assert_eq!([&[1i], &[2i], &[3]].connect_vec(&0), vec![1, 0, 2, 0, 3]);
1431 let mut x = vec![1i, 2, 3];
1432 assert_eq!(x.shift(), Some(1));
1433 assert_eq!(&x, &vec![2i, 3]);
1434 assert_eq!(x.shift(), Some(2));
1435 assert_eq!(x.shift(), Some(3));
1436 assert_eq!(x.shift(), None);
1437 assert_eq!(x.len(), 0);
1442 let mut x = vec![1i, 2, 3];
1444 assert_eq!(x, vec![0, 1, 2, 3]);
1449 let mut a = vec![1i, 2, 4];
1451 assert_eq!(a, vec![1, 2, 3, 4]);
1453 let mut a = vec![1i, 2, 3];
1455 assert_eq!(a, vec![0, 1, 2, 3]);
1457 let mut a = vec![1i, 2, 3];
1459 assert_eq!(a, vec![1, 2, 3, 4]);
1463 assert_eq!(a, vec![1]);
1468 fn test_insert_oob() {
1469 let mut a = vec![1i, 2, 3];
1475 let mut a = vec![1i,2,3,4];
1477 assert_eq!(a.remove(2), Some(3));
1478 assert_eq!(a, vec![1i,2,4]);
1480 assert_eq!(a.remove(2), Some(4));
1481 assert_eq!(a, vec![1i,2]);
1483 assert_eq!(a.remove(2), None);
1484 assert_eq!(a, vec![1i,2]);
1486 assert_eq!(a.remove(0), Some(1));
1487 assert_eq!(a, vec![2i]);
1489 assert_eq!(a.remove(0), Some(2));
1490 assert_eq!(a, vec![]);
1492 assert_eq!(a.remove(0), None);
1493 assert_eq!(a.remove(10), None);
1497 fn test_capacity() {
1498 let mut v = vec![0u64];
1499 v.reserve_exact(10u);
1500 assert_eq!(v.capacity(), 10u);
1501 let mut v = vec![0u32];
1502 v.reserve_exact(10u);
1503 assert_eq!(v.capacity(), 10u);
1508 let v = vec![1i, 2, 3, 4, 5];
1509 let v = v.slice(1u, 3u);
1510 assert_eq!(v.len(), 2u);
1511 assert_eq!(v[0], 2);
1512 assert_eq!(v[1], 3);
1518 fn test_from_fn_fail() {
1519 Vec::from_fn(100, |v| {
1520 if v == 50 { fail!() }
1527 fn test_from_elem_fail() {
1531 boxes: (Box<int>, Rc<int>)
1535 fn clone(&self) -> S {
1536 self.f.set(self.f.get() + 1);
1537 if self.f.get() == 10 { fail!() }
1538 S { f: self.f, boxes: self.boxes.clone() }
1542 let s = S { f: Cell::new(0), boxes: (box 0, Rc::new(0)) };
1543 let _ = Vec::from_elem(100, s);
1548 fn test_grow_fn_fail() {
1550 v.grow_fn(100, |i| {
1554 (box 0i, Rc::new(0i))
1560 fn test_permute_fail() {
1561 let v = [(box 0i, Rc::new(0i)), (box 0i, Rc::new(0i)),
1562 (box 0i, Rc::new(0i)), (box 0i, Rc::new(0i))];
1564 for _ in v.permutations() {
1574 fn test_copy_memory_oob() {
1576 let mut a = [1i, 2, 3, 4];
1577 let b = [1i, 2, 3, 4, 5];
1583 fn test_total_ord() {
1584 [1i, 2, 3, 4].cmp(& &[1, 2, 3]) == Greater;
1585 [1i, 2, 3].cmp(& &[1, 2, 3, 4]) == Less;
1586 [1i, 2, 3, 4].cmp(& &[1, 2, 3, 4]) == Equal;
1587 [1i, 2, 3, 4, 5, 5, 5, 5].cmp(& &[1, 2, 3, 4, 5, 6]) == Less;
1588 [2i, 2].cmp(& &[1, 2, 3, 4]) == Greater;
1592 fn test_iterator() {
1593 let xs = [1i, 2, 5, 10, 11];
1594 let mut it = xs.iter();
1595 assert_eq!(it.size_hint(), (5, Some(5)));
1596 assert_eq!(it.next().unwrap(), &1);
1597 assert_eq!(it.size_hint(), (4, Some(4)));
1598 assert_eq!(it.next().unwrap(), &2);
1599 assert_eq!(it.size_hint(), (3, Some(3)));
1600 assert_eq!(it.next().unwrap(), &5);
1601 assert_eq!(it.size_hint(), (2, Some(2)));
1602 assert_eq!(it.next().unwrap(), &10);
1603 assert_eq!(it.size_hint(), (1, Some(1)));
1604 assert_eq!(it.next().unwrap(), &11);
1605 assert_eq!(it.size_hint(), (0, Some(0)));
1606 assert!(it.next().is_none());
1610 fn test_random_access_iterator() {
1611 let xs = [1i, 2, 5, 10, 11];
1612 let mut it = xs.iter();
1614 assert_eq!(it.indexable(), 5);
1615 assert_eq!(it.idx(0).unwrap(), &1);
1616 assert_eq!(it.idx(2).unwrap(), &5);
1617 assert_eq!(it.idx(4).unwrap(), &11);
1618 assert!(it.idx(5).is_none());
1620 assert_eq!(it.next().unwrap(), &1);
1621 assert_eq!(it.indexable(), 4);
1622 assert_eq!(it.idx(0).unwrap(), &2);
1623 assert_eq!(it.idx(3).unwrap(), &11);
1624 assert!(it.idx(4).is_none());
1626 assert_eq!(it.next().unwrap(), &2);
1627 assert_eq!(it.indexable(), 3);
1628 assert_eq!(it.idx(1).unwrap(), &10);
1629 assert!(it.idx(3).is_none());
1631 assert_eq!(it.next().unwrap(), &5);
1632 assert_eq!(it.indexable(), 2);
1633 assert_eq!(it.idx(1).unwrap(), &11);
1635 assert_eq!(it.next().unwrap(), &10);
1636 assert_eq!(it.indexable(), 1);
1637 assert_eq!(it.idx(0).unwrap(), &11);
1638 assert!(it.idx(1).is_none());
1640 assert_eq!(it.next().unwrap(), &11);
1641 assert_eq!(it.indexable(), 0);
1642 assert!(it.idx(0).is_none());
1644 assert!(it.next().is_none());
1648 fn test_iter_size_hints() {
1649 let mut xs = [1i, 2, 5, 10, 11];
1650 assert_eq!(xs.iter().size_hint(), (5, Some(5)));
1651 assert_eq!(xs.mut_iter().size_hint(), (5, Some(5)));
1655 fn test_iter_clone() {
1656 let xs = [1i, 2, 5];
1657 let mut it = xs.iter();
1659 let mut jt = it.clone();
1660 assert_eq!(it.next(), jt.next());
1661 assert_eq!(it.next(), jt.next());
1662 assert_eq!(it.next(), jt.next());
1666 fn test_mut_iterator() {
1667 let mut xs = [1i, 2, 3, 4, 5];
1668 for x in xs.mut_iter() {
1671 assert!(xs == [2, 3, 4, 5, 6])
1675 fn test_rev_iterator() {
1677 let xs = [1i, 2, 5, 10, 11];
1678 let ys = [11, 10, 5, 2, 1];
1680 for &x in xs.iter().rev() {
1681 assert_eq!(x, ys[i]);
1688 fn test_mut_rev_iterator() {
1689 let mut xs = [1u, 2, 3, 4, 5];
1690 for (i,x) in xs.mut_iter().rev().enumerate() {
1693 assert!(xs == [5, 5, 5, 5, 5])
1697 fn test_move_iterator() {
1698 let xs = vec![1u,2,3,4,5];
1699 assert_eq!(xs.move_iter().fold(0, |a: uint, b: uint| 10*a + b), 12345);
1703 fn test_move_rev_iterator() {
1704 let xs = vec![1u,2,3,4,5];
1705 assert_eq!(xs.move_iter().rev().fold(0, |a: uint, b: uint| 10*a + b), 54321);
1709 fn test_splitator() {
1710 let xs = &[1i,2,3,4,5];
1712 assert_eq!(xs.split(|x| *x % 2 == 0).collect::<Vec<&[int]>>().as_slice(),
1713 &[&[1], &[3], &[5]]);
1714 assert_eq!(xs.split(|x| *x == 1).collect::<Vec<&[int]>>().as_slice(),
1715 &[&[], &[2,3,4,5]]);
1716 assert_eq!(xs.split(|x| *x == 5).collect::<Vec<&[int]>>().as_slice(),
1717 &[&[1,2,3,4], &[]]);
1718 assert_eq!(xs.split(|x| *x == 10).collect::<Vec<&[int]>>().as_slice(),
1720 assert_eq!(xs.split(|_| true).collect::<Vec<&[int]>>().as_slice(),
1721 &[&[], &[], &[], &[], &[], &[]]);
1723 let xs: &[int] = &[];
1724 assert_eq!(xs.split(|x| *x == 5).collect::<Vec<&[int]>>().as_slice(), &[&[]]);
1728 fn test_splitnator() {
1729 let xs = &[1i,2,3,4,5];
1731 assert_eq!(xs.splitn(0, |x| *x % 2 == 0).collect::<Vec<&[int]>>().as_slice(),
1733 assert_eq!(xs.splitn(1, |x| *x % 2 == 0).collect::<Vec<&[int]>>().as_slice(),
1735 assert_eq!(xs.splitn(3, |_| true).collect::<Vec<&[int]>>().as_slice(),
1736 &[&[], &[], &[], &[4,5]]);
1738 let xs: &[int] = &[];
1739 assert_eq!(xs.splitn(1, |x| *x == 5).collect::<Vec<&[int]>>().as_slice(), &[&[]]);
1743 fn test_rsplitator() {
1744 let xs = &[1i,2,3,4,5];
1746 assert_eq!(xs.split(|x| *x % 2 == 0).rev().collect::<Vec<&[int]>>().as_slice(),
1747 &[&[5], &[3], &[1]]);
1748 assert_eq!(xs.split(|x| *x == 1).rev().collect::<Vec<&[int]>>().as_slice(),
1749 &[&[2,3,4,5], &[]]);
1750 assert_eq!(xs.split(|x| *x == 5).rev().collect::<Vec<&[int]>>().as_slice(),
1751 &[&[], &[1,2,3,4]]);
1752 assert_eq!(xs.split(|x| *x == 10).rev().collect::<Vec<&[int]>>().as_slice(),
1755 let xs: &[int] = &[];
1756 assert_eq!(xs.split(|x| *x == 5).rev().collect::<Vec<&[int]>>().as_slice(), &[&[]]);
1760 fn test_rsplitnator() {
1761 let xs = &[1,2,3,4,5];
1763 assert_eq!(xs.rsplitn(0, |x| *x % 2 == 0).collect::<Vec<&[int]>>().as_slice(),
1765 assert_eq!(xs.rsplitn(1, |x| *x % 2 == 0).collect::<Vec<&[int]>>().as_slice(),
1767 assert_eq!(xs.rsplitn(3, |_| true).collect::<Vec<&[int]>>().as_slice(),
1768 &[&[], &[], &[], &[1,2]]);
1770 let xs: &[int] = &[];
1771 assert_eq!(xs.rsplitn(1, |x| *x == 5).collect::<Vec<&[int]>>().as_slice(), &[&[]]);
1775 fn test_windowsator() {
1776 let v = &[1i,2,3,4];
1778 assert_eq!(v.windows(2).collect::<Vec<&[int]>>().as_slice(), &[&[1,2], &[2,3], &[3,4]]);
1779 assert_eq!(v.windows(3).collect::<Vec<&[int]>>().as_slice(), &[&[1i,2,3], &[2,3,4]]);
1780 assert!(v.windows(6).next().is_none());
1785 fn test_windowsator_0() {
1786 let v = &[1i,2,3,4];
1787 let _it = v.windows(0);
1791 fn test_chunksator() {
1792 let v = &[1i,2,3,4,5];
1794 assert_eq!(v.chunks(2).collect::<Vec<&[int]>>().as_slice(), &[&[1i,2], &[3,4], &[5]]);
1795 assert_eq!(v.chunks(3).collect::<Vec<&[int]>>().as_slice(), &[&[1i,2,3], &[4,5]]);
1796 assert_eq!(v.chunks(6).collect::<Vec<&[int]>>().as_slice(), &[&[1i,2,3,4,5]]);
1798 assert_eq!(v.chunks(2).rev().collect::<Vec<&[int]>>().as_slice(), &[&[5i], &[3,4], &[1,2]]);
1799 let mut it = v.chunks(2);
1800 assert_eq!(it.indexable(), 3);
1801 assert_eq!(it.idx(0).unwrap(), &[1,2]);
1802 assert_eq!(it.idx(1).unwrap(), &[3,4]);
1803 assert_eq!(it.idx(2).unwrap(), &[5]);
1804 assert_eq!(it.idx(3), None);
1809 fn test_chunksator_0() {
1810 let v = &[1i,2,3,4];
1811 let _it = v.chunks(0);
1815 fn test_move_from() {
1816 let mut a = [1i,2,3,4,5];
1817 let b = vec![6i,7,8];
1818 assert_eq!(a.move_from(b, 0, 3), 3);
1819 assert!(a == [6i,7,8,4,5]);
1820 let mut a = [7i,2,8,1];
1821 let b = vec![3i,1,4,1,5,9];
1822 assert_eq!(a.move_from(b, 0, 6), 4);
1823 assert!(a == [3i,1,4,1]);
1824 let mut a = [1i,2,3,4];
1825 let b = vec![5i,6,7,8,9,0];
1826 assert_eq!(a.move_from(b, 2, 3), 1);
1827 assert!(a == [7i,2,3,4]);
1828 let mut a = [1i,2,3,4,5];
1829 let b = vec![5i,6,7,8,9,0];
1830 assert_eq!(a.mut_slice(2,4).move_from(b,1,6), 2);
1831 assert!(a == [1i,2,6,7,5]);
1835 fn test_copy_from() {
1836 let mut a = [1i,2,3,4,5];
1838 assert_eq!(a.copy_from(b), 3);
1839 assert!(a == [6i,7,8,4,5]);
1840 let mut c = [7i,2,8,1];
1841 let d = [3i,1,4,1,5,9];
1842 assert_eq!(c.copy_from(d), 4);
1843 assert!(c == [3i,1,4,1]);
1847 fn test_reverse_part() {
1848 let mut values = [1i,2,3,4,5];
1849 values.mut_slice(1, 4).reverse();
1850 assert!(values == [1,4,3,2,5]);
1855 macro_rules! test_show_vec(
1856 ($x:expr, $x_str:expr) => ({
1857 let (x, x_str) = ($x, $x_str);
1858 assert_eq!(format!("{}", x), x_str);
1859 assert_eq!(format!("{}", x.as_slice()), x_str);
1862 let empty: Vec<int> = vec![];
1863 test_show_vec!(empty, "[]".to_string());
1864 test_show_vec!(vec![1i], "[1]".to_string());
1865 test_show_vec!(vec![1i, 2, 3], "[1, 2, 3]".to_string());
1866 test_show_vec!(vec![vec![], vec![1u], vec![1u, 1u]],
1867 "[[], [1], [1, 1]]".to_string());
1869 let empty_mut: &mut [int] = &mut[];
1870 test_show_vec!(empty_mut, "[]".to_string());
1871 test_show_vec!(&mut[1i], "[1]".to_string());
1872 test_show_vec!(&mut[1i, 2, 3], "[1, 2, 3]".to_string());
1873 test_show_vec!(&mut[&mut[], &mut[1u], &mut[1u, 1u]],
1874 "[[], [1], [1, 1]]".to_string());
1878 fn test_vec_default() {
1881 let v: $ty = Default::default();
1882 assert!(v.is_empty());
1891 fn test_bytes_set_memory() {
1892 use slice::bytes::MutableByteVector;
1893 let mut values = [1u8,2,3,4,5];
1894 values.mut_slice(0,5).set_memory(0xAB);
1895 assert!(values == [0xAB, 0xAB, 0xAB, 0xAB, 0xAB]);
1896 values.mut_slice(2,4).set_memory(0xFF);
1897 assert!(values == [0xAB, 0xAB, 0xFF, 0xFF, 0xAB]);
1902 fn test_overflow_does_not_cause_segfault() {
1904 v.reserve_exact(-1);
1911 fn test_overflow_does_not_cause_segfault_managed() {
1912 let mut v = vec![Rc::new(1i)];
1913 v.reserve_exact(-1);
1914 v.push(Rc::new(2i));
1918 fn test_mut_split_at() {
1919 let mut values = [1u8,2,3,4,5];
1921 let (left, right) = values.mut_split_at(2);
1922 assert!(left.slice(0, left.len()) == [1, 2]);
1923 for p in left.mut_iter() {
1927 assert!(right.slice(0, right.len()) == [3, 4, 5]);
1928 for p in right.mut_iter() {
1933 assert!(values == [2, 3, 5, 6, 7]);
1936 #[deriving(Clone, PartialEq)]
1940 fn test_iter_zero_sized() {
1941 let mut v = vec![Foo, Foo, Foo];
1942 assert_eq!(v.len(), 3);
1951 for f in v.slice(1, 3).iter() {
1957 for f in v.mut_iter() {
1963 for f in v.move_iter() {
1967 assert_eq!(cnt, 11);
1969 let xs: [Foo, ..3] = [Foo, Foo, Foo];
1971 for f in xs.iter() {
1979 fn test_shrink_to_fit() {
1980 let mut xs = vec![0, 1, 2, 3];
1981 for i in range(4i, 100) {
1984 assert_eq!(xs.capacity(), 128);
1986 assert_eq!(xs.capacity(), 100);
1987 assert_eq!(xs, range(0i, 100i).collect::<Vec<_>>());
1991 fn test_starts_with() {
1992 assert!(b"foobar".starts_with(b"foo"));
1993 assert!(!b"foobar".starts_with(b"oob"));
1994 assert!(!b"foobar".starts_with(b"bar"));
1995 assert!(!b"foo".starts_with(b"foobar"));
1996 assert!(!b"bar".starts_with(b"foobar"));
1997 assert!(b"foobar".starts_with(b"foobar"));
1998 let empty: &[u8] = [];
1999 assert!(empty.starts_with(empty));
2000 assert!(!empty.starts_with(b"foo"));
2001 assert!(b"foobar".starts_with(empty));
2005 fn test_ends_with() {
2006 assert!(b"foobar".ends_with(b"bar"));
2007 assert!(!b"foobar".ends_with(b"oba"));
2008 assert!(!b"foobar".ends_with(b"foo"));
2009 assert!(!b"foo".ends_with(b"foobar"));
2010 assert!(!b"bar".ends_with(b"foobar"));
2011 assert!(b"foobar".ends_with(b"foobar"));
2012 let empty: &[u8] = [];
2013 assert!(empty.ends_with(empty));
2014 assert!(!empty.ends_with(b"foo"));
2015 assert!(b"foobar".ends_with(empty));
2019 fn test_shift_ref() {
2020 let mut x: &[int] = [1, 2, 3, 4, 5];
2021 let h = x.shift_ref();
2022 assert_eq!(*h.unwrap(), 1);
2023 assert_eq!(x.len(), 4);
2024 assert_eq!(x[0], 2);
2025 assert_eq!(x[3], 5);
2027 let mut y: &[int] = [];
2028 assert_eq!(y.shift_ref(), None);
2033 let mut x: &[int] = [1, 2, 3, 4, 5];
2034 let h = x.pop_ref();
2035 assert_eq!(*h.unwrap(), 5);
2036 assert_eq!(x.len(), 4);
2037 assert_eq!(x[0], 1);
2038 assert_eq!(x[3], 4);
2040 let mut y: &[int] = [];
2041 assert!(y.pop_ref().is_none());
2045 fn test_mut_splitator() {
2046 let mut xs = [0i,1,0,2,3,0,0,4,5,0];
2047 assert_eq!(xs.mut_split(|x| *x == 0).count(), 6);
2048 for slice in xs.mut_split(|x| *x == 0) {
2051 assert!(xs == [0,1,0,3,2,0,0,5,4,0]);
2053 let mut xs = [0i,1,0,2,3,0,0,4,5,0,6,7];
2054 for slice in xs.mut_split(|x| *x == 0).take(5) {
2057 assert!(xs == [0,1,0,3,2,0,0,5,4,0,6,7]);
2061 fn test_mut_splitator_rev() {
2062 let mut xs = [1i,2,0,3,4,0,0,5,6,0];
2063 for slice in xs.mut_split(|x| *x == 0).rev().take(4) {
2066 assert!(xs == [1,2,0,4,3,0,0,6,5,0]);
2071 let mut v = [0i,1,2];
2072 assert_eq!(v.get_mut(3), None);
2073 v.get_mut(1).map(|e| *e = 7);
2074 assert_eq!(v[1], 7);
2076 assert_eq!(v.get_mut(2), Some(&mut x));
2080 fn test_mut_chunks() {
2081 let mut v = [0u8, 1, 2, 3, 4, 5, 6];
2082 for (i, chunk) in v.mut_chunks(3).enumerate() {
2083 for x in chunk.mut_iter() {
2087 let result = [0u8, 0, 0, 1, 1, 1, 2];
2088 assert!(v == result);
2092 fn test_mut_chunks_rev() {
2093 let mut v = [0u8, 1, 2, 3, 4, 5, 6];
2094 for (i, chunk) in v.mut_chunks(3).rev().enumerate() {
2095 for x in chunk.mut_iter() {
2099 let result = [2u8, 2, 2, 1, 1, 1, 0];
2100 assert!(v == result);
2105 fn test_mut_chunks_0() {
2106 let mut v = [1i, 2, 3, 4];
2107 let _it = v.mut_chunks(0);
2111 fn test_mut_shift_ref() {
2112 let mut x: &mut [int] = [1, 2, 3, 4, 5];
2113 let h = x.mut_shift_ref();
2114 assert_eq!(*h.unwrap(), 1);
2115 assert_eq!(x.len(), 4);
2116 assert_eq!(x[0], 2);
2117 assert_eq!(x[3], 5);
2119 let mut y: &mut [int] = [];
2120 assert!(y.mut_shift_ref().is_none());
2124 fn test_mut_pop_ref() {
2125 let mut x: &mut [int] = [1, 2, 3, 4, 5];
2126 let h = x.mut_pop_ref();
2127 assert_eq!(*h.unwrap(), 5);
2128 assert_eq!(x.len(), 4);
2129 assert_eq!(x[0], 1);
2130 assert_eq!(x[3], 4);
2132 let mut y: &mut [int] = [];
2133 assert!(y.mut_pop_ref().is_none());
2137 fn test_mut_last() {
2138 let mut x = [1i, 2, 3, 4, 5];
2139 let h = x.mut_last();
2140 assert_eq!(*h.unwrap(), 5);
2142 let y: &mut [int] = [];
2143 assert!(y.mut_last().is_none());
2149 use std::prelude::*;
2150 use std::rand::{weak_rng, Rng};
2159 fn iterator(b: &mut Bencher) {
2160 // peculiar numbers to stop LLVM from optimising the summation
2162 let v = Vec::from_fn(100, |i| i ^ (i << 1) ^ (i >> 1));
2169 // sum == 11806, to stop dead code elimination.
2170 if sum == 0 {fail!()}
2175 fn mut_iterator(b: &mut Bencher) {
2176 let mut v = Vec::from_elem(100, 0i);
2180 for x in v.mut_iter() {
2188 fn concat(b: &mut Bencher) {
2189 let xss: Vec<Vec<uint>> =
2190 Vec::from_fn(100, |i| range(0u, i).collect());
2192 xss.as_slice().concat_vec()
2197 fn connect(b: &mut Bencher) {
2198 let xss: Vec<Vec<uint>> =
2199 Vec::from_fn(100, |i| range(0u, i).collect());
2201 xss.as_slice().connect_vec(&0)
2206 fn push(b: &mut Bencher) {
2207 let mut vec: Vec<uint> = vec![];
2215 fn starts_with_same_vector(b: &mut Bencher) {
2216 let vec: Vec<uint> = Vec::from_fn(100, |i| i);
2218 vec.as_slice().starts_with(vec.as_slice())
2223 fn starts_with_single_element(b: &mut Bencher) {
2224 let vec: Vec<uint> = vec![0];
2226 vec.as_slice().starts_with(vec.as_slice())
2231 fn starts_with_diff_one_element_at_end(b: &mut Bencher) {
2232 let vec: Vec<uint> = Vec::from_fn(100, |i| i);
2233 let mut match_vec: Vec<uint> = Vec::from_fn(99, |i| i);
2236 vec.as_slice().starts_with(match_vec.as_slice())
2241 fn ends_with_same_vector(b: &mut Bencher) {
2242 let vec: Vec<uint> = Vec::from_fn(100, |i| i);
2244 vec.as_slice().ends_with(vec.as_slice())
2249 fn ends_with_single_element(b: &mut Bencher) {
2250 let vec: Vec<uint> = vec![0];
2252 vec.as_slice().ends_with(vec.as_slice())
2257 fn ends_with_diff_one_element_at_beginning(b: &mut Bencher) {
2258 let vec: Vec<uint> = Vec::from_fn(100, |i| i);
2259 let mut match_vec: Vec<uint> = Vec::from_fn(100, |i| i);
2260 match_vec.as_mut_slice()[0] = 200;
2262 vec.as_slice().starts_with(match_vec.as_slice())
2267 fn contains_last_element(b: &mut Bencher) {
2268 let vec: Vec<uint> = Vec::from_fn(100, |i| i);
2275 fn zero_1kb_from_elem(b: &mut Bencher) {
2277 Vec::from_elem(1024, 0u8)
2282 fn zero_1kb_set_memory(b: &mut Bencher) {
2284 let mut v: Vec<uint> = Vec::with_capacity(1024);
2286 let vp = v.as_mut_ptr();
2287 ptr::set_memory(vp, 0, 1024);
2295 fn zero_1kb_loop_set(b: &mut Bencher) {
2297 let mut v: Vec<uint> = Vec::with_capacity(1024);
2301 for i in range(0u, 1024) {
2308 fn zero_1kb_mut_iter(b: &mut Bencher) {
2310 let mut v = Vec::with_capacity(1024);
2314 for x in v.mut_iter() {
2322 fn random_inserts(b: &mut Bencher) {
2323 let mut rng = weak_rng();
2325 let mut v = Vec::from_elem(30, (0u, 0u));
2326 for _ in range(0u, 100) {
2328 v.insert(rng.gen::<uint>() % (l + 1),
2334 fn random_removes(b: &mut Bencher) {
2335 let mut rng = weak_rng();
2337 let mut v = Vec::from_elem(130, (0u, 0u));
2338 for _ in range(0u, 100) {
2340 v.remove(rng.gen::<uint>() % l);
2346 fn sort_random_small(b: &mut Bencher) {
2347 let mut rng = weak_rng();
2349 let mut v = rng.gen_iter::<u64>().take(5).collect::<Vec<u64>>();
2350 v.as_mut_slice().sort();
2352 b.bytes = 5 * mem::size_of::<u64>() as u64;
2356 fn sort_random_medium(b: &mut Bencher) {
2357 let mut rng = weak_rng();
2359 let mut v = rng.gen_iter::<u64>().take(100).collect::<Vec<u64>>();
2360 v.as_mut_slice().sort();
2362 b.bytes = 100 * mem::size_of::<u64>() as u64;
2366 fn sort_random_large(b: &mut Bencher) {
2367 let mut rng = weak_rng();
2369 let mut v = rng.gen_iter::<u64>().take(10000).collect::<Vec<u64>>();
2370 v.as_mut_slice().sort();
2372 b.bytes = 10000 * mem::size_of::<u64>() as u64;
2376 fn sort_sorted(b: &mut Bencher) {
2377 let mut v = Vec::from_fn(10000, |i| i);
2381 b.bytes = (v.len() * mem::size_of_val(v.get(0))) as u64;
2384 type BigSortable = (u64,u64,u64,u64);
2387 fn sort_big_random_small(b: &mut Bencher) {
2388 let mut rng = weak_rng();
2390 let mut v = rng.gen_iter::<BigSortable>().take(5)
2391 .collect::<Vec<BigSortable>>();
2394 b.bytes = 5 * mem::size_of::<BigSortable>() as u64;
2398 fn sort_big_random_medium(b: &mut Bencher) {
2399 let mut rng = weak_rng();
2401 let mut v = rng.gen_iter::<BigSortable>().take(100)
2402 .collect::<Vec<BigSortable>>();
2405 b.bytes = 100 * mem::size_of::<BigSortable>() as u64;
2409 fn sort_big_random_large(b: &mut Bencher) {
2410 let mut rng = weak_rng();
2412 let mut v = rng.gen_iter::<BigSortable>().take(10000)
2413 .collect::<Vec<BigSortable>>();
2416 b.bytes = 10000 * mem::size_of::<BigSortable>() as u64;
2420 fn sort_big_sorted(b: &mut Bencher) {
2421 let mut v = Vec::from_fn(10000u, |i| (i, i, i, i));
2425 b.bytes = (v.len() * mem::size_of_val(v.get(0))) as u64;