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.
11 //! Utilities for slice manipulation
13 //! The `slice` module contains useful code to help work with slice values.
14 //! Slices are a view into a block of memory represented as a pointer and a length.
18 //! let vec = vec!(1i, 2, 3);
19 //! let int_slice = vec.as_slice();
20 //! // coercing an array to a slice
21 //! let str_slice: &[&str] = ["one", "two", "three"];
24 //! Slices are either mutable or shared. The shared slice type is `&[T]`,
25 //! while the mutable slice type is `&mut[T]`. For example, you can mutate the
26 //! block of memory that a mutable slice points to:
29 //! let x: &mut[int] = [1i, 2, 3];
31 //! assert_eq!(x[0], 1);
32 //! assert_eq!(x[1], 7);
33 //! assert_eq!(x[2], 3);
36 //! Here are some of the things this module contains:
40 //! There are several structs that are useful for slices, such as `Items`, which
41 //! represents iteration over a slice.
45 //! A number of traits add methods that allow you to accomplish tasks with slices.
46 //! These traits include `ImmutableSlice`, which is defined for `&[T]` types,
47 //! and `MutableSlice`, defined for `&mut [T]` types.
49 //! An example is the method `.slice(a, b)` that returns an immutable "view" into
50 //! a `Vec` or another slice from the index interval `[a, b)`:
53 //! let numbers = [0i, 1i, 2i];
54 //! let last_numbers = numbers.slice(1, 3);
55 //! // last_numbers is now &[1i, 2i]
58 //! ## Implementations of other traits
60 //! There are several implementations of common traits for slices. Some examples
64 //! * `Eq`, `Ord` - for immutable slices whose element type are `Eq` or `Ord`.
65 //! * `Hash` - for slices whose element type is `Hash`
69 //! The method `iter()` returns an iteration value for a slice. The iterator
70 //! yields references to the slice's elements, so if the element
71 //! type of the slice is `int`, the element type of the iterator is `&int`.
74 //! let numbers = [0i, 1i, 2i];
75 //! for &x in numbers.iter() {
76 //! println!("{} is a number!", x);
80 //! * `.mut_iter()` returns an iterator that allows modifying each value.
81 //! * Further iterators exist that split, chunk or permute the slice.
83 #![doc(primitive = "slice")]
86 use core::mem::size_of;
88 use core::prelude::{Clone, Collection, Greater, Iterator, Less, None, Option};
89 use core::prelude::{Ord, Ordering, RawPtr, Some, range};
91 use core::iter::{range_step, MultiplicativeIterator};
98 pub use core::slice::{Chunks, Slice, ImmutableSlice, ImmutablePartialEqSlice};
99 pub use core::slice::{ImmutableOrdSlice, MutableSlice, Items, MutItems};
100 pub use core::slice::{MutSplits, MutChunks, Splits};
101 pub use core::slice::{bytes, ref_slice, MutableCloneableSlice};
102 pub use core::slice::{Found, NotFound};
104 // Functional utilities
106 #[allow(missing_doc)]
107 pub trait VectorVector<T> {
108 // FIXME #5898: calling these .concat and .connect conflicts with
109 // StrVector::con{cat,nect}, since they have generic contents.
110 /// Flattens a vector of vectors of `T` into a single `Vec<T>`.
111 fn concat_vec(&self) -> Vec<T>;
113 /// Concatenate a vector of vectors, placing a given separator between each.
114 fn connect_vec(&self, sep: &T) -> Vec<T>;
117 impl<'a, T: Clone, V: Slice<T>> VectorVector<T> for &'a [V] {
118 fn concat_vec(&self) -> Vec<T> {
119 let size = self.iter().fold(0u, |acc, v| acc + v.as_slice().len());
120 let mut result = Vec::with_capacity(size);
121 for v in self.iter() {
122 result.push_all(v.as_slice())
127 fn connect_vec(&self, sep: &T) -> Vec<T> {
128 let size = self.iter().fold(0u, |acc, v| acc + v.as_slice().len());
129 let mut result = Vec::with_capacity(size + self.len());
130 let mut first = true;
131 for v in self.iter() {
132 if first { first = false } else { result.push(sep.clone()) }
133 result.push_all(v.as_slice())
139 /// An iterator that yields the element swaps needed to produce
140 /// a sequence of all possible permutations for an indexed sequence of
141 /// elements. Each permutation is only a single swap apart.
143 /// The Steinhaus-Johnson-Trotter algorithm is used.
145 /// Generates even and odd permutations alternately.
147 /// The last generated swap is always (0, 1), and it returns the
148 /// sequence to its initial order.
149 pub struct ElementSwaps {
150 sdir: Vec<SizeDirection>,
151 /// If `true`, emit the last swap that returns the sequence to initial
158 /// Creates an `ElementSwaps` iterator for a sequence of `length` elements.
159 pub fn new(length: uint) -> ElementSwaps {
160 // Initialize `sdir` with a direction that position should move in
161 // (all negative at the beginning) and the `size` of the
162 // element (equal to the original index).
165 sdir: range(0, length).map(|i| SizeDirection{ size: i, dir: Neg }).collect(),
171 enum Direction { Pos, Neg }
173 /// An `Index` and `Direction` together.
174 struct SizeDirection {
179 impl Iterator<(uint, uint)> for ElementSwaps {
181 fn next(&mut self) -> Option<(uint, uint)> {
182 fn new_pos(i: uint, s: Direction) -> uint {
183 i + match s { Pos => 1, Neg => -1 }
186 // Find the index of the largest mobile element:
187 // The direction should point into the vector, and the
188 // swap should be with a smaller `size` element.
189 let max = self.sdir.iter().map(|&x| x).enumerate()
191 new_pos(i, sd.dir) < self.sdir.len() &&
192 self.sdir[new_pos(i, sd.dir)].size < sd.size)
193 .max_by(|&(_, sd)| sd.size);
196 let j = new_pos(i, sd.dir);
197 self.sdir.as_mut_slice().swap(i, j);
199 // Swap the direction of each larger SizeDirection
200 for x in self.sdir.mut_iter() {
201 if x.size > sd.size {
202 x.dir = match x.dir { Pos => Neg, Neg => Pos };
205 self.swaps_made += 1;
208 None => if self.emit_reset {
209 self.emit_reset = false;
210 if self.sdir.len() > 1 {
212 self.swaps_made += 1;
215 // Vector is of the form [] or [x], and the only permutation is itself
216 self.swaps_made += 1;
224 fn size_hint(&self) -> (uint, Option<uint>) {
225 // For a vector of size n, there are exactly n! permutations.
226 let n = range(2, self.sdir.len() + 1).product();
227 (n - self.swaps_made, Some(n - self.swaps_made))
231 /// An iterator that uses `ElementSwaps` to iterate through
232 /// all possible permutations of a vector.
234 /// The first iteration yields a clone of the vector as it is,
235 /// then each successive element is the vector with one
238 /// Generates even and odd permutations alternately.
239 pub struct Permutations<T> {
244 impl<T: Clone> Iterator<Vec<T>> for Permutations<T> {
246 fn next(&mut self) -> Option<Vec<T>> {
247 match self.swaps.next() {
249 Some((0,0)) => Some(self.v.clone()),
251 let elt = self.v.clone();
252 self.v.as_mut_slice().swap(a, b);
259 fn size_hint(&self) -> (uint, Option<uint>) {
260 self.swaps.size_hint()
264 /// Extension methods for vector slices with cloneable elements
265 pub trait CloneableVector<T> {
266 /// Copies `self` into a new `Vec`.
267 fn to_vec(&self) -> Vec<T>;
269 /// Deprecated. Use `to_vec`.
270 #[deprecated = "Replaced by `to_vec`"]
271 fn to_owned(&self) -> Vec<T> {
275 /// Converts `self` into an owned vector, not making a copy if possible.
276 fn into_vec(self) -> Vec<T>;
278 /// Deprecated. Use `into_vec`
279 #[deprecated = "Replaced by `into_vec`"]
280 fn into_owned(self) -> Vec<T> {
285 impl<'a, T: Clone> CloneableVector<T> for &'a [T] {
286 /// Returns a copy of `v`.
288 fn to_owned(&self) -> ~[T] {
292 let len = self.len();
296 let slice: Slice<T> = Slice{data: 0 as *T, len: 0};
297 mem::transmute(slice)
300 let unit_size = mem::size_of::<T>();
301 let data_size = if unit_size == 0 {
304 let data_size = len.checked_mul(&unit_size);
305 data_size.expect("overflow in from_iter()")
309 // this should pass the real required alignment
310 let ret = allocate(data_size, 8) as *mut T;
313 // Be careful with the following loop. We want it to be optimized
314 // to a memcpy (or something similarly fast) when T is Copy. LLVM
315 // is easily confused, so any extra operations during the loop can
316 // prevent this optimization.
318 let p = &mut (*ret) as *mut _ as *mut T;
321 |i, ()| while *i < len {
323 &mut(*p.offset(*i as int)),
324 self.unsafe_ref(*i).clone());
328 // we must be failing, clean up after ourselves
329 for j in range(0, *i as int) {
330 ptr::read(&*p.offset(j));
332 // FIXME: #13994 (should pass align and size here)
333 deallocate(ret as *mut u8, 0, 8);
336 let slice: Slice<T> = Slice{data: ret as *T, len: len};
337 mem::transmute(slice)
342 /// Returns a copy of `v`.
343 // NOTE: remove after snapshot
346 fn to_vec(&self) -> Vec<T> { Vec::from_slice(*self) }
349 fn into_vec(self) -> Vec<T> { self.to_vec() }
352 /// Extension methods for vectors containing `Clone` elements.
353 pub trait ImmutableCloneableVector<T> {
354 /// Partitions the vector into two vectors `(a, b)`, where all
355 /// elements of `a` satisfy `f` and all elements of `b` do not.
356 fn partitioned(&self, f: |&T| -> bool) -> (Vec<T>, Vec<T>);
358 /// Creates an iterator that yields every possible permutation of the
359 /// vector in succession.
364 /// let v = [1i, 2, 3];
365 /// let mut perms = v.permutations();
368 /// println!("{}", p);
372 /// # Example 2: iterating through permutations one by one.
375 /// let v = [1i, 2, 3];
376 /// let mut perms = v.permutations();
378 /// assert_eq!(Some(vec![1i, 2, 3]), perms.next());
379 /// assert_eq!(Some(vec![1i, 3, 2]), perms.next());
380 /// assert_eq!(Some(vec![3i, 1, 2]), perms.next());
382 fn permutations(self) -> Permutations<T>;
385 impl<'a,T:Clone> ImmutableCloneableVector<T> for &'a [T] {
387 fn partitioned(&self, f: |&T| -> bool) -> (Vec<T>, Vec<T>) {
388 let mut lefts = Vec::new();
389 let mut rights = Vec::new();
391 for elt in self.iter() {
393 lefts.push((*elt).clone());
395 rights.push((*elt).clone());
402 /// Returns an iterator over all permutations of a vector.
403 fn permutations(self) -> Permutations<T> {
405 swaps: ElementSwaps::new(self.len()),
412 fn insertion_sort<T>(v: &mut [T], compare: |&T, &T| -> Ordering) {
413 let len = v.len() as int;
414 let buf_v = v.as_mut_ptr();
417 for i in range(1, len) {
418 // j satisfies: 0 <= j <= i;
422 let read_ptr = buf_v.offset(i) as *const T;
424 // find where to insert, we need to do strict <,
425 // rather than <=, to maintain stability.
427 // 0 <= j - 1 < len, so .offset(j - 1) is in bounds.
429 compare(&*read_ptr, &*buf_v.offset(j - 1)) == Less {
433 // shift everything to the right, to make space to
434 // insert this value.
436 // j + 1 could be `len` (for the last `i`), but in
437 // that case, `i == j` so we don't copy. The
438 // `.offset(j)` is always in bounds.
441 let tmp = ptr::read(read_ptr);
442 ptr::copy_memory(buf_v.offset(j + 1),
445 ptr::copy_nonoverlapping_memory(buf_v.offset(j),
454 fn merge_sort<T>(v: &mut [T], compare: |&T, &T| -> Ordering) {
455 // warning: this wildly uses unsafe.
456 static BASE_INSERTION: uint = 32;
457 static LARGE_INSERTION: uint = 16;
459 // FIXME #12092: smaller insertion runs seems to make sorting
460 // vectors of large elements a little faster on some platforms,
461 // but hasn't been tested/tuned extensively
462 let insertion = if size_of::<T>() <= 16 {
470 // short vectors get sorted in-place via insertion sort to avoid allocations
471 if len <= insertion {
472 insertion_sort(v, compare);
476 // allocate some memory to use as scratch memory, we keep the
477 // length 0 so we can keep shallow copies of the contents of `v`
478 // without risking the dtors running on an object twice if
480 let mut working_space = Vec::with_capacity(2 * len);
481 // these both are buffers of length `len`.
482 let mut buf_dat = working_space.as_mut_ptr();
483 let mut buf_tmp = unsafe {buf_dat.offset(len as int)};
486 let buf_v = v.as_ptr();
488 // step 1. sort short runs with insertion sort. This takes the
489 // values from `v` and sorts them into `buf_dat`, leaving that
490 // with sorted runs of length INSERTION.
492 // We could hardcode the sorting comparisons here, and we could
493 // manipulate/step the pointers themselves, rather than repeatedly
495 for start in range_step(0, len, insertion) {
497 for i in range(start, cmp::min(start + insertion, len)) {
498 // j satisfies: start <= j <= i;
499 let mut j = i as int;
502 let read_ptr = buf_v.offset(i as int);
504 // find where to insert, we need to do strict <,
505 // rather than <=, to maintain stability.
507 // start <= j - 1 < len, so .offset(j - 1) is in
509 while j > start as int &&
510 compare(&*read_ptr, &*buf_dat.offset(j - 1)) == Less {
514 // shift everything to the right, to make space to
515 // insert this value.
517 // j + 1 could be `len` (for the last `i`), but in
518 // that case, `i == j` so we don't copy. The
519 // `.offset(j)` is always in bounds.
520 ptr::copy_memory(buf_dat.offset(j + 1),
523 ptr::copy_nonoverlapping_memory(buf_dat.offset(j), read_ptr, 1);
528 // step 2. merge the sorted runs.
529 let mut width = insertion;
531 // merge the sorted runs of length `width` in `buf_dat` two at
532 // a time, placing the result in `buf_tmp`.
534 // 0 <= start <= len.
535 for start in range_step(0, len, 2 * width) {
536 // manipulate pointers directly for speed (rather than
537 // using a `for` loop with `range` and `.offset` inside
540 // the end of the first run & start of the
541 // second. Offset of `len` is defined, since this is
542 // precisely one byte past the end of the object.
543 let right_start = buf_dat.offset(cmp::min(start + width, len) as int);
544 // end of the second. Similar reasoning to the above re safety.
545 let right_end_idx = cmp::min(start + 2 * width, len);
546 let right_end = buf_dat.offset(right_end_idx as int);
548 // the pointers to the elements under consideration
549 // from the two runs.
551 // both of these are in bounds.
552 let mut left = buf_dat.offset(start as int);
553 let mut right = right_start;
555 // where we're putting the results, it is a run of
556 // length `2*width`, so we step it once for each step
557 // of either `left` or `right`. `buf_tmp` has length
558 // `len`, so these are in bounds.
559 let mut out = buf_tmp.offset(start as int);
560 let out_end = buf_tmp.offset(right_end_idx as int);
562 while out < out_end {
563 // Either the left or the right run are exhausted,
564 // so just copy the remainder from the other run
565 // and move on; this gives a huge speed-up (order
566 // of 25%) for mostly sorted vectors (the best
568 if left == right_start {
569 // the number remaining in this run.
570 let elems = (right_end as uint - right as uint) / mem::size_of::<T>();
571 ptr::copy_nonoverlapping_memory(out, &*right, elems);
573 } else if right == right_end {
574 let elems = (right_start as uint - left as uint) / mem::size_of::<T>();
575 ptr::copy_nonoverlapping_memory(out, &*left, elems);
579 // check which side is smaller, and that's the
580 // next element for the new run.
582 // `left < right_start` and `right < right_end`,
583 // so these are valid.
584 let to_copy = if compare(&*left, &*right) == Greater {
589 ptr::copy_nonoverlapping_memory(out, &*to_copy, 1);
595 mem::swap(&mut buf_dat, &mut buf_tmp);
600 // write the result to `v` in one go, so that there are never two copies
601 // of the same object in `v`.
603 ptr::copy_nonoverlapping_memory(v.as_mut_ptr(), &*buf_dat, len);
606 // increment the pointer, returning the old pointer.
608 unsafe fn step<T>(ptr: &mut *mut T) -> *mut T {
610 *ptr = ptr.offset(1);
615 /// Extension methods for vectors such that their elements are
617 pub trait MutableSliceAllocating<'a, T> {
618 /// Sorts the slice, in place, using `compare` to compare
621 /// This sort is `O(n log n)` worst-case and stable, but allocates
622 /// approximately `2 * n`, where `n` is the length of `self`.
627 /// let mut v = [5i, 4, 1, 3, 2];
628 /// v.sort_by(|a, b| a.cmp(b));
629 /// assert!(v == [1, 2, 3, 4, 5]);
631 /// // reverse sorting
632 /// v.sort_by(|a, b| b.cmp(a));
633 /// assert!(v == [5, 4, 3, 2, 1]);
635 fn sort_by(self, compare: |&T, &T| -> Ordering);
637 /// Consumes `src` and moves as many elements as it can into `self`
638 /// from the range [start,end).
640 /// Returns the number of elements copied (the shorter of `self.len()`
641 /// and `end - start`).
645 /// * src - A mutable vector of `T`
646 /// * start - The index into `src` to start copying from
647 /// * end - The index into `src` to stop copying from
652 /// let mut a = [1i, 2, 3, 4, 5];
653 /// let b = vec![6i, 7, 8];
654 /// let num_moved = a.move_from(b, 0, 3);
655 /// assert_eq!(num_moved, 3);
656 /// assert!(a == [6i, 7, 8, 4, 5]);
658 fn move_from(self, src: Vec<T>, start: uint, end: uint) -> uint;
661 impl<'a,T> MutableSliceAllocating<'a, T> for &'a mut [T] {
663 fn sort_by(self, compare: |&T, &T| -> Ordering) {
664 merge_sort(self, compare)
668 fn move_from(self, mut src: Vec<T>, start: uint, end: uint) -> uint {
669 for (a, b) in self.mut_iter().zip(src.mut_slice(start, end).mut_iter()) {
672 cmp::min(self.len(), end-start)
676 /// Methods for mutable vectors with orderable elements, such as
677 /// in-place sorting.
678 pub trait MutableOrdSlice<T> {
679 /// Sorts the slice, in place.
681 /// This is equivalent to `self.sort_by(|a, b| a.cmp(b))`.
686 /// let mut v = [-5i, 4, 1, -3, 2];
689 /// assert!(v == [-5i, -3, 1, 2, 4]);
693 /// Mutates the slice to the next lexicographic permutation.
695 /// Returns `true` if successful and `false` if the slice is at the
696 /// last-ordered permutation.
701 /// let v = &mut [0i, 1, 2];
702 /// v.next_permutation();
703 /// assert_eq!(v, &mut [0i, 2, 1]);
704 /// v.next_permutation();
705 /// assert_eq!(v, &mut [1i, 0, 2]);
707 fn next_permutation(self) -> bool;
709 /// Mutates the slice to the previous lexicographic permutation.
711 /// Returns `true` if successful and `false` if the slice is at the
712 /// first-ordered permutation.
717 /// let v = &mut [1i, 0, 2];
718 /// v.prev_permutation();
719 /// assert_eq!(v, &mut [0i, 2, 1]);
720 /// v.prev_permutation();
721 /// assert_eq!(v, &mut [0i, 1, 2]);
723 fn prev_permutation(self) -> bool;
726 impl<'a, T: Ord> MutableOrdSlice<T> for &'a mut [T] {
729 self.sort_by(|a,b| a.cmp(b))
732 fn next_permutation(self) -> bool {
733 // These cases only have 1 permutation each, so we can't do anything.
734 if self.len() < 2 { return false; }
736 // Step 1: Identify the longest, rightmost weakly decreasing part of the vector
737 let mut i = self.len() - 1;
738 while i > 0 && self[i-1] >= self[i] {
742 // If that is the entire vector, this is the last-ordered permutation.
747 // Step 2: Find the rightmost element larger than the pivot (i-1)
748 let mut j = self.len() - 1;
749 while j >= i && self[j] <= self[i-1] {
753 // Step 3: Swap that element with the pivot
756 // Step 4: Reverse the (previously) weakly decreasing part
757 self.mut_slice_from(i).reverse();
762 fn prev_permutation(self) -> bool {
763 // These cases only have 1 permutation each, so we can't do anything.
764 if self.len() < 2 { return false; }
766 // Step 1: Identify the longest, rightmost weakly increasing part of the vector
767 let mut i = self.len() - 1;
768 while i > 0 && self[i-1] <= self[i] {
772 // If that is the entire vector, this is the first-ordered permutation.
777 // Step 2: Reverse the weakly increasing part
778 self.mut_slice_from(i).reverse();
780 // Step 3: Find the rightmost element equal to or bigger than the pivot (i-1)
781 let mut j = self.len() - 1;
782 while j >= i && self[j-1] < self[i-1] {
786 // Step 4: Swap that element with the pivot
793 /// Unsafe operations
795 pub use core::slice::raw::{buf_as_slice, mut_buf_as_slice};
796 pub use core::slice::raw::{shift_ptr, pop_ptr};
802 use std::default::Default;
805 use std::rand::{Rng, task_rng};
810 use {Mutable, MutableSeq};
813 fn square(n: uint) -> uint { n * n }
815 fn is_odd(n: &uint) -> bool { *n % 2u == 1u }
819 // Test on-stack from_fn.
820 let mut v = Vec::from_fn(3u, square);
822 let v = v.as_slice();
823 assert_eq!(v.len(), 3u);
824 assert_eq!(v[0], 0u);
825 assert_eq!(v[1], 1u);
826 assert_eq!(v[2], 4u);
829 // Test on-heap from_fn.
830 v = Vec::from_fn(5u, square);
832 let v = v.as_slice();
833 assert_eq!(v.len(), 5u);
834 assert_eq!(v[0], 0u);
835 assert_eq!(v[1], 1u);
836 assert_eq!(v[2], 4u);
837 assert_eq!(v[3], 9u);
838 assert_eq!(v[4], 16u);
843 fn test_from_elem() {
844 // Test on-stack from_elem.
845 let mut v = Vec::from_elem(2u, 10u);
847 let v = v.as_slice();
848 assert_eq!(v.len(), 2u);
849 assert_eq!(v[0], 10u);
850 assert_eq!(v[1], 10u);
853 // Test on-heap from_elem.
854 v = Vec::from_elem(6u, 20u);
856 let v = v.as_slice();
857 assert_eq!(v[0], 20u);
858 assert_eq!(v[1], 20u);
859 assert_eq!(v[2], 20u);
860 assert_eq!(v[3], 20u);
861 assert_eq!(v[4], 20u);
862 assert_eq!(v[5], 20u);
868 let xs: [int, ..0] = [];
869 assert!(xs.is_empty());
870 assert!(![0i].is_empty());
874 fn test_len_divzero() {
877 let v1 : &[Z] = &[[]];
878 let v2 : &[Z] = &[[], []];
879 assert_eq!(mem::size_of::<Z>(), 0);
880 assert_eq!(v0.len(), 0);
881 assert_eq!(v1.len(), 1);
882 assert_eq!(v2.len(), 2);
887 let mut a = vec![11i];
888 assert_eq!(a.as_slice().get(1), None);
890 assert_eq!(a.as_slice().get(1).unwrap(), &12);
891 a = vec![11i, 12, 13];
892 assert_eq!(a.as_slice().get(1).unwrap(), &12);
898 assert_eq!(a.as_slice().head(), None);
900 assert_eq!(a.as_slice().head().unwrap(), &11);
902 assert_eq!(a.as_slice().head().unwrap(), &11);
907 let mut a = vec![11i];
908 assert_eq!(a.tail(), &[]);
910 assert_eq!(a.tail(), &[12]);
915 fn test_tail_empty() {
916 let a: Vec<int> = vec![];
922 let mut a = vec![11i, 12, 13];
923 assert_eq!(a.tailn(0), &[11, 12, 13]);
924 a = vec![11i, 12, 13];
925 assert_eq!(a.tailn(2), &[13]);
930 fn test_tailn_empty() {
931 let a: Vec<int> = vec![];
937 let mut a = vec![11i];
938 assert_eq!(a.init(), &[]);
940 assert_eq!(a.init(), &[11]);
945 fn test_init_empty() {
946 let a: Vec<int> = vec![];
952 let mut a = vec![11i, 12, 13];
953 assert_eq!(a.as_slice().initn(0), &[11, 12, 13]);
954 a = vec![11i, 12, 13];
955 assert_eq!(a.as_slice().initn(2), &[11]);
960 fn test_initn_empty() {
961 let a: Vec<int> = vec![];
962 a.as_slice().initn(2);
968 assert_eq!(a.as_slice().last(), None);
970 assert_eq!(a.as_slice().last().unwrap(), &11);
972 assert_eq!(a.as_slice().last().unwrap(), &12);
977 // Test fixed length vector.
978 let vec_fixed = [1i, 2, 3, 4];
979 let v_a = vec_fixed.slice(1u, vec_fixed.len()).to_vec();
980 assert_eq!(v_a.len(), 3u);
981 let v_a = v_a.as_slice();
982 assert_eq!(v_a[0], 2);
983 assert_eq!(v_a[1], 3);
984 assert_eq!(v_a[2], 4);
987 let vec_stack = &[1i, 2, 3];
988 let v_b = vec_stack.slice(1u, 3u).to_vec();
989 assert_eq!(v_b.len(), 2u);
990 let v_b = v_b.as_slice();
991 assert_eq!(v_b[0], 2);
992 assert_eq!(v_b[1], 3);
995 let vec_unique = vec![1i, 2, 3, 4, 5, 6];
996 let v_d = vec_unique.slice(1u, 6u).to_vec();
997 assert_eq!(v_d.len(), 5u);
998 let v_d = v_d.as_slice();
999 assert_eq!(v_d[0], 2);
1000 assert_eq!(v_d[1], 3);
1001 assert_eq!(v_d[2], 4);
1002 assert_eq!(v_d[3], 5);
1003 assert_eq!(v_d[4], 6);
1007 fn test_slice_from() {
1008 let vec = &[1i, 2, 3, 4];
1009 assert_eq!(vec.slice_from(0), vec);
1010 assert_eq!(vec.slice_from(2), &[3, 4]);
1011 assert_eq!(vec.slice_from(4), &[]);
1015 fn test_slice_to() {
1016 let vec = &[1i, 2, 3, 4];
1017 assert_eq!(vec.slice_to(4), vec);
1018 assert_eq!(vec.slice_to(2), &[1, 2]);
1019 assert_eq!(vec.slice_to(0), &[]);
1025 let mut v = vec![5i];
1027 assert_eq!(v.len(), 0);
1028 assert_eq!(e, Some(5));
1030 assert_eq!(f, None);
1032 assert_eq!(g, None);
1036 fn test_swap_remove() {
1037 let mut v = vec![1i, 2, 3, 4, 5];
1038 let mut e = v.swap_remove(0);
1039 assert_eq!(e, Some(1));
1040 assert_eq!(v, vec![5i, 2, 3, 4]);
1041 e = v.swap_remove(3);
1042 assert_eq!(e, Some(4));
1043 assert_eq!(v, vec![5i, 2, 3]);
1045 e = v.swap_remove(3);
1046 assert_eq!(e, None);
1047 assert_eq!(v, vec![5i, 2, 3]);
1051 fn test_swap_remove_noncopyable() {
1052 // Tests that we don't accidentally run destructors twice.
1053 let mut v = vec![rt::exclusive::Exclusive::new(()),
1054 rt::exclusive::Exclusive::new(()),
1055 rt::exclusive::Exclusive::new(())];
1056 let mut _e = v.swap_remove(0);
1057 assert_eq!(v.len(), 2);
1058 _e = v.swap_remove(1);
1059 assert_eq!(v.len(), 1);
1060 _e = v.swap_remove(0);
1061 assert_eq!(v.len(), 0);
1066 // Test on-stack push().
1069 assert_eq!(v.len(), 1u);
1070 assert_eq!(v.as_slice()[0], 1);
1072 // Test on-heap push().
1074 assert_eq!(v.len(), 2u);
1075 assert_eq!(v.as_slice()[0], 1);
1076 assert_eq!(v.as_slice()[1], 2);
1081 // Test on-stack grow().
1085 let v = v.as_slice();
1086 assert_eq!(v.len(), 2u);
1087 assert_eq!(v[0], 1);
1088 assert_eq!(v[1], 1);
1091 // Test on-heap grow().
1094 let v = v.as_slice();
1095 assert_eq!(v.len(), 5u);
1096 assert_eq!(v[0], 1);
1097 assert_eq!(v[1], 1);
1098 assert_eq!(v[2], 2);
1099 assert_eq!(v[3], 2);
1100 assert_eq!(v[4], 2);
1107 v.grow_fn(3u, square);
1108 let v = v.as_slice();
1109 assert_eq!(v.len(), 3u);
1110 assert_eq!(v[0], 0u);
1111 assert_eq!(v[1], 1u);
1112 assert_eq!(v[2], 4u);
1116 fn test_grow_set() {
1117 let mut v = vec![1i, 2, 3];
1118 v.grow_set(4u, &4, 5);
1119 let v = v.as_slice();
1120 assert_eq!(v.len(), 5u);
1121 assert_eq!(v[0], 1);
1122 assert_eq!(v[1], 2);
1123 assert_eq!(v[2], 3);
1124 assert_eq!(v[3], 4);
1125 assert_eq!(v[4], 5);
1129 fn test_truncate() {
1130 let mut v = vec![box 6i,box 5,box 4];
1132 let v = v.as_slice();
1133 assert_eq!(v.len(), 1);
1134 assert_eq!(*(v[0]), 6);
1135 // If the unsafe block didn't drop things properly, we blow up here.
1140 let mut v = vec![box 6i,box 5,box 4];
1142 assert_eq!(v.len(), 0);
1143 // If the unsafe block didn't drop things properly, we blow up here.
1148 fn case(a: Vec<uint>, b: Vec<uint>) {
1153 case(vec![], vec![]);
1154 case(vec![1u], vec![1]);
1155 case(vec![1u,1], vec![1]);
1156 case(vec![1u,2,3], vec![1,2,3]);
1157 case(vec![1u,1,2,3], vec![1,2,3]);
1158 case(vec![1u,2,2,3], vec![1,2,3]);
1159 case(vec![1u,2,3,3], vec![1,2,3]);
1160 case(vec![1u,1,2,2,2,3,3], vec![1,2,3]);
1164 fn test_dedup_unique() {
1165 let mut v0 = vec![box 1i, box 1, box 2, box 3];
1167 let mut v1 = vec![box 1i, box 2, box 2, box 3];
1169 let mut v2 = vec![box 1i, box 2, box 3, box 3];
1172 * If the boxed pointers were leaked or otherwise misused, valgrind
1173 * and/or rustrt should raise errors.
1178 fn test_dedup_shared() {
1179 let mut v0 = vec![box 1i, box 1, box 2, box 3];
1181 let mut v1 = vec![box 1i, box 2, box 2, box 3];
1183 let mut v2 = vec![box 1i, box 2, box 3, box 3];
1186 * If the pointers were leaked or otherwise misused, valgrind and/or
1187 * rustrt should raise errors.
1193 let mut v = vec![1u, 2, 3, 4, 5];
1195 assert_eq!(v, vec![1u, 3, 5]);
1199 fn test_element_swaps() {
1200 let mut v = [1i, 2, 3];
1201 for (i, (a, b)) in ElementSwaps::new(v.len()).enumerate() {
1204 0 => assert!(v == [1, 3, 2]),
1205 1 => assert!(v == [3, 1, 2]),
1206 2 => assert!(v == [3, 2, 1]),
1207 3 => assert!(v == [2, 3, 1]),
1208 4 => assert!(v == [2, 1, 3]),
1209 5 => assert!(v == [1, 2, 3]),
1216 fn test_permutations() {
1218 let v: [int, ..0] = [];
1219 let mut it = v.permutations();
1220 let (min_size, max_opt) = it.size_hint();
1221 assert_eq!(min_size, 1);
1222 assert_eq!(max_opt.unwrap(), 1);
1223 assert_eq!(it.next(), Some(v.as_slice().to_vec()));
1224 assert_eq!(it.next(), None);
1227 let v = ["Hello".to_string()];
1228 let mut it = v.permutations();
1229 let (min_size, max_opt) = it.size_hint();
1230 assert_eq!(min_size, 1);
1231 assert_eq!(max_opt.unwrap(), 1);
1232 assert_eq!(it.next(), Some(v.as_slice().to_vec()));
1233 assert_eq!(it.next(), None);
1237 let mut it = v.permutations();
1238 let (min_size, max_opt) = it.size_hint();
1239 assert_eq!(min_size, 3*2);
1240 assert_eq!(max_opt.unwrap(), 3*2);
1241 assert_eq!(it.next(), Some(vec![1,2,3]));
1242 assert_eq!(it.next(), Some(vec![1,3,2]));
1243 assert_eq!(it.next(), Some(vec![3,1,2]));
1244 let (min_size, max_opt) = it.size_hint();
1245 assert_eq!(min_size, 3);
1246 assert_eq!(max_opt.unwrap(), 3);
1247 assert_eq!(it.next(), Some(vec![3,2,1]));
1248 assert_eq!(it.next(), Some(vec![2,3,1]));
1249 assert_eq!(it.next(), Some(vec![2,1,3]));
1250 assert_eq!(it.next(), None);
1253 // check that we have N! permutations
1254 let v = ['A', 'B', 'C', 'D', 'E', 'F'];
1256 let mut it = v.permutations();
1257 let (min_size, max_opt) = it.size_hint();
1261 assert_eq!(amt, it.swaps.swaps_made);
1262 assert_eq!(amt, min_size);
1263 assert_eq!(amt, 2 * 3 * 4 * 5 * 6);
1264 assert_eq!(amt, max_opt.unwrap());
1269 fn test_lexicographic_permutations() {
1270 let v : &mut[int] = &mut[1i, 2, 3, 4, 5];
1271 assert!(v.prev_permutation() == false);
1272 assert!(v.next_permutation());
1273 assert_eq!(v, &mut[1, 2, 3, 5, 4]);
1274 assert!(v.prev_permutation());
1275 assert_eq!(v, &mut[1, 2, 3, 4, 5]);
1276 assert!(v.next_permutation());
1277 assert!(v.next_permutation());
1278 assert_eq!(v, &mut[1, 2, 4, 3, 5]);
1279 assert!(v.next_permutation());
1280 assert_eq!(v, &mut[1, 2, 4, 5, 3]);
1282 let v : &mut[int] = &mut[1i, 0, 0, 0];
1283 assert!(v.next_permutation() == false);
1284 assert!(v.prev_permutation());
1285 assert_eq!(v, &mut[0, 1, 0, 0]);
1286 assert!(v.prev_permutation());
1287 assert_eq!(v, &mut[0, 0, 1, 0]);
1288 assert!(v.prev_permutation());
1289 assert_eq!(v, &mut[0, 0, 0, 1]);
1290 assert!(v.prev_permutation() == false);
1294 fn test_lexicographic_permutations_empty_and_short() {
1295 let empty : &mut[int] = &mut[];
1296 assert!(empty.next_permutation() == false);
1297 assert_eq!(empty, &mut[]);
1298 assert!(empty.prev_permutation() == false);
1299 assert_eq!(empty, &mut[]);
1301 let one_elem : &mut[int] = &mut[4i];
1302 assert!(one_elem.prev_permutation() == false);
1303 assert_eq!(one_elem, &mut[4]);
1304 assert!(one_elem.next_permutation() == false);
1305 assert_eq!(one_elem, &mut[4]);
1307 let two_elem : &mut[int] = &mut[1i, 2];
1308 assert!(two_elem.prev_permutation() == false);
1309 assert_eq!(two_elem, &mut[1, 2]);
1310 assert!(two_elem.next_permutation());
1311 assert_eq!(two_elem, &mut[2, 1]);
1312 assert!(two_elem.next_permutation() == false);
1313 assert_eq!(two_elem, &mut[2, 1]);
1314 assert!(two_elem.prev_permutation());
1315 assert_eq!(two_elem, &mut[1, 2]);
1316 assert!(two_elem.prev_permutation() == false);
1317 assert_eq!(two_elem, &mut[1, 2]);
1321 fn test_position_elem() {
1322 assert!([].position_elem(&1i).is_none());
1324 let v1 = vec![1i, 2, 3, 3, 2, 5];
1325 assert_eq!(v1.as_slice().position_elem(&1), Some(0u));
1326 assert_eq!(v1.as_slice().position_elem(&2), Some(1u));
1327 assert_eq!(v1.as_slice().position_elem(&5), Some(5u));
1328 assert!(v1.as_slice().position_elem(&4).is_none());
1332 fn test_bsearch_elem() {
1333 assert_eq!([1i,2,3,4,5].bsearch_elem(&5), Some(4));
1334 assert_eq!([1i,2,3,4,5].bsearch_elem(&4), Some(3));
1335 assert_eq!([1i,2,3,4,5].bsearch_elem(&3), Some(2));
1336 assert_eq!([1i,2,3,4,5].bsearch_elem(&2), Some(1));
1337 assert_eq!([1i,2,3,4,5].bsearch_elem(&1), Some(0));
1339 assert_eq!([2i,4,6,8,10].bsearch_elem(&1), None);
1340 assert_eq!([2i,4,6,8,10].bsearch_elem(&5), None);
1341 assert_eq!([2i,4,6,8,10].bsearch_elem(&4), Some(1));
1342 assert_eq!([2i,4,6,8,10].bsearch_elem(&10), Some(4));
1344 assert_eq!([2i,4,6,8].bsearch_elem(&1), None);
1345 assert_eq!([2i,4,6,8].bsearch_elem(&5), None);
1346 assert_eq!([2i,4,6,8].bsearch_elem(&4), Some(1));
1347 assert_eq!([2i,4,6,8].bsearch_elem(&8), Some(3));
1349 assert_eq!([2i,4,6].bsearch_elem(&1), None);
1350 assert_eq!([2i,4,6].bsearch_elem(&5), None);
1351 assert_eq!([2i,4,6].bsearch_elem(&4), Some(1));
1352 assert_eq!([2i,4,6].bsearch_elem(&6), Some(2));
1354 assert_eq!([2i,4].bsearch_elem(&1), None);
1355 assert_eq!([2i,4].bsearch_elem(&5), None);
1356 assert_eq!([2i,4].bsearch_elem(&2), Some(0));
1357 assert_eq!([2i,4].bsearch_elem(&4), Some(1));
1359 assert_eq!([2i].bsearch_elem(&1), None);
1360 assert_eq!([2i].bsearch_elem(&5), None);
1361 assert_eq!([2i].bsearch_elem(&2), Some(0));
1363 assert_eq!([].bsearch_elem(&1i), None);
1364 assert_eq!([].bsearch_elem(&5i), None);
1366 assert!([1i,1,1,1,1].bsearch_elem(&1) != None);
1367 assert!([1i,1,1,1,2].bsearch_elem(&1) != None);
1368 assert!([1i,1,1,2,2].bsearch_elem(&1) != None);
1369 assert!([1i,1,2,2,2].bsearch_elem(&1) != None);
1370 assert_eq!([1i,2,2,2,2].bsearch_elem(&1), Some(0));
1372 assert_eq!([1i,2,3,4,5].bsearch_elem(&6), None);
1373 assert_eq!([1i,2,3,4,5].bsearch_elem(&0), None);
1378 let mut v: Vec<int> = vec![10i, 20];
1379 assert_eq!(*v.get(0), 10);
1380 assert_eq!(*v.get(1), 20);
1382 assert_eq!(*v.get(0), 20);
1383 assert_eq!(*v.get(1), 10);
1385 let mut v3: Vec<int> = vec![];
1387 assert!(v3.is_empty());
1392 for len in range(4u, 25) {
1393 for _ in range(0i, 100) {
1394 let mut v = task_rng().gen_iter::<uint>().take(len)
1395 .collect::<Vec<uint>>();
1396 let mut v1 = v.clone();
1398 v.as_mut_slice().sort();
1399 assert!(v.as_slice().windows(2).all(|w| w[0] <= w[1]));
1401 v1.as_mut_slice().sort_by(|a, b| a.cmp(b));
1402 assert!(v1.as_slice().windows(2).all(|w| w[0] <= w[1]));
1404 v1.as_mut_slice().sort_by(|a, b| b.cmp(a));
1405 assert!(v1.as_slice().windows(2).all(|w| w[0] >= w[1]));
1409 // shouldn't fail/crash
1410 let mut v: [uint, .. 0] = [];
1413 let mut v = [0xDEADBEEFu];
1415 assert!(v == [0xDEADBEEF]);
1419 fn test_sort_stability() {
1420 for len in range(4i, 25) {
1421 for _ in range(0u, 10) {
1422 let mut counts = [0i, .. 10];
1424 // create a vector like [(6, 1), (5, 1), (6, 2), ...],
1425 // where the first item of each tuple is random, but
1426 // the second item represents which occurrence of that
1427 // number this element is, i.e. the second elements
1428 // will occur in sorted order.
1429 let mut v = range(0, len).map(|_| {
1430 let n = task_rng().gen::<uint>() % 10;
1433 }).collect::<Vec<(uint, int)>>();
1435 // only sort on the first element, so an unstable sort
1436 // may mix up the counts.
1437 v.sort_by(|&(a,_), &(b,_)| a.cmp(&b));
1439 // this comparison includes the count (the second item
1440 // of the tuple), so elements with equal first items
1441 // will need to be ordered with increasing
1442 // counts... i.e. exactly asserting that this sort is
1444 assert!(v.as_slice().windows(2).all(|w| w[0] <= w[1]));
1450 fn test_partition() {
1451 assert_eq!((vec![]).partition(|x: &int| *x < 3), (vec![], vec![]));
1452 assert_eq!((vec![1i, 2, 3]).partition(|x: &int| *x < 4), (vec![1, 2, 3], vec![]));
1453 assert_eq!((vec![1i, 2, 3]).partition(|x: &int| *x < 2), (vec![1], vec![2, 3]));
1454 assert_eq!((vec![1i, 2, 3]).partition(|x: &int| *x < 0), (vec![], vec![1, 2, 3]));
1458 fn test_partitioned() {
1459 assert_eq!(([]).partitioned(|x: &int| *x < 3), (vec![], vec![]));
1460 assert_eq!(([1i, 2, 3]).partitioned(|x: &int| *x < 4), (vec![1, 2, 3], vec![]));
1461 assert_eq!(([1i, 2, 3]).partitioned(|x: &int| *x < 2), (vec![1], vec![2, 3]));
1462 assert_eq!(([1i, 2, 3]).partitioned(|x: &int| *x < 0), (vec![], vec![1, 2, 3]));
1467 let v: [Vec<int>, ..0] = [];
1468 assert_eq!(v.concat_vec(), vec![]);
1469 assert_eq!([vec![1i], vec![2i,3i]].concat_vec(), vec![1, 2, 3]);
1471 assert_eq!([&[1i], &[2i,3i]].concat_vec(), vec![1, 2, 3]);
1476 let v: [Vec<int>, ..0] = [];
1477 assert_eq!(v.connect_vec(&0), vec![]);
1478 assert_eq!([vec![1i], vec![2i, 3]].connect_vec(&0), vec![1, 0, 2, 3]);
1479 assert_eq!([vec![1i], vec![2i], vec![3i]].connect_vec(&0), vec![1, 0, 2, 0, 3]);
1481 assert_eq!([&[1i], &[2i, 3]].connect_vec(&0), vec![1, 0, 2, 3]);
1482 assert_eq!([&[1i], &[2i], &[3]].connect_vec(&0), vec![1, 0, 2, 0, 3]);
1487 let mut x = vec![1i, 2, 3];
1488 assert_eq!(x.shift(), Some(1));
1489 assert_eq!(&x, &vec![2i, 3]);
1490 assert_eq!(x.shift(), Some(2));
1491 assert_eq!(x.shift(), Some(3));
1492 assert_eq!(x.shift(), None);
1493 assert_eq!(x.len(), 0);
1498 let mut x = vec![1i, 2, 3];
1500 assert_eq!(x, vec![0, 1, 2, 3]);
1505 let mut a = vec![1i, 2, 4];
1507 assert_eq!(a, vec![1, 2, 3, 4]);
1509 let mut a = vec![1i, 2, 3];
1511 assert_eq!(a, vec![0, 1, 2, 3]);
1513 let mut a = vec![1i, 2, 3];
1515 assert_eq!(a, vec![1, 2, 3, 4]);
1519 assert_eq!(a, vec![1]);
1524 fn test_insert_oob() {
1525 let mut a = vec![1i, 2, 3];
1531 let mut a = vec![1i,2,3,4];
1533 assert_eq!(a.remove(2), Some(3));
1534 assert_eq!(a, vec![1i,2,4]);
1536 assert_eq!(a.remove(2), Some(4));
1537 assert_eq!(a, vec![1i,2]);
1539 assert_eq!(a.remove(2), None);
1540 assert_eq!(a, vec![1i,2]);
1542 assert_eq!(a.remove(0), Some(1));
1543 assert_eq!(a, vec![2i]);
1545 assert_eq!(a.remove(0), Some(2));
1546 assert_eq!(a, vec![]);
1548 assert_eq!(a.remove(0), None);
1549 assert_eq!(a.remove(10), None);
1553 fn test_capacity() {
1554 let mut v = vec![0u64];
1555 v.reserve_exact(10u);
1556 assert_eq!(v.capacity(), 10u);
1557 let mut v = vec![0u32];
1558 v.reserve_exact(10u);
1559 assert_eq!(v.capacity(), 10u);
1564 let v = vec![1i, 2, 3, 4, 5];
1565 let v = v.slice(1u, 3u);
1566 assert_eq!(v.len(), 2u);
1567 assert_eq!(v[0], 2);
1568 assert_eq!(v[1], 3);
1574 fn test_from_fn_fail() {
1575 Vec::from_fn(100, |v| {
1576 if v == 50 { fail!() }
1583 fn test_from_elem_fail() {
1587 boxes: (Box<int>, Rc<int>)
1591 fn clone(&self) -> S {
1592 self.f.set(self.f.get() + 1);
1593 if self.f.get() == 10 { fail!() }
1594 S { f: self.f, boxes: self.boxes.clone() }
1598 let s = S { f: Cell::new(0), boxes: (box 0, Rc::new(0)) };
1599 let _ = Vec::from_elem(100, s);
1604 fn test_grow_fn_fail() {
1606 v.grow_fn(100, |i| {
1610 (box 0i, Rc::new(0i))
1616 fn test_permute_fail() {
1617 let v = [(box 0i, Rc::new(0i)), (box 0i, Rc::new(0i)),
1618 (box 0i, Rc::new(0i)), (box 0i, Rc::new(0i))];
1620 for _ in v.permutations() {
1630 fn test_copy_memory_oob() {
1632 let mut a = [1i, 2, 3, 4];
1633 let b = [1i, 2, 3, 4, 5];
1639 fn test_total_ord() {
1640 [1i, 2, 3, 4].cmp(& &[1, 2, 3]) == Greater;
1641 [1i, 2, 3].cmp(& &[1, 2, 3, 4]) == Less;
1642 [1i, 2, 3, 4].cmp(& &[1, 2, 3, 4]) == Equal;
1643 [1i, 2, 3, 4, 5, 5, 5, 5].cmp(& &[1, 2, 3, 4, 5, 6]) == Less;
1644 [2i, 2].cmp(& &[1, 2, 3, 4]) == Greater;
1648 fn test_iterator() {
1649 let xs = [1i, 2, 5, 10, 11];
1650 let mut it = xs.iter();
1651 assert_eq!(it.size_hint(), (5, Some(5)));
1652 assert_eq!(it.next().unwrap(), &1);
1653 assert_eq!(it.size_hint(), (4, Some(4)));
1654 assert_eq!(it.next().unwrap(), &2);
1655 assert_eq!(it.size_hint(), (3, Some(3)));
1656 assert_eq!(it.next().unwrap(), &5);
1657 assert_eq!(it.size_hint(), (2, Some(2)));
1658 assert_eq!(it.next().unwrap(), &10);
1659 assert_eq!(it.size_hint(), (1, Some(1)));
1660 assert_eq!(it.next().unwrap(), &11);
1661 assert_eq!(it.size_hint(), (0, Some(0)));
1662 assert!(it.next().is_none());
1666 fn test_random_access_iterator() {
1667 let xs = [1i, 2, 5, 10, 11];
1668 let mut it = xs.iter();
1670 assert_eq!(it.indexable(), 5);
1671 assert_eq!(it.idx(0).unwrap(), &1);
1672 assert_eq!(it.idx(2).unwrap(), &5);
1673 assert_eq!(it.idx(4).unwrap(), &11);
1674 assert!(it.idx(5).is_none());
1676 assert_eq!(it.next().unwrap(), &1);
1677 assert_eq!(it.indexable(), 4);
1678 assert_eq!(it.idx(0).unwrap(), &2);
1679 assert_eq!(it.idx(3).unwrap(), &11);
1680 assert!(it.idx(4).is_none());
1682 assert_eq!(it.next().unwrap(), &2);
1683 assert_eq!(it.indexable(), 3);
1684 assert_eq!(it.idx(1).unwrap(), &10);
1685 assert!(it.idx(3).is_none());
1687 assert_eq!(it.next().unwrap(), &5);
1688 assert_eq!(it.indexable(), 2);
1689 assert_eq!(it.idx(1).unwrap(), &11);
1691 assert_eq!(it.next().unwrap(), &10);
1692 assert_eq!(it.indexable(), 1);
1693 assert_eq!(it.idx(0).unwrap(), &11);
1694 assert!(it.idx(1).is_none());
1696 assert_eq!(it.next().unwrap(), &11);
1697 assert_eq!(it.indexable(), 0);
1698 assert!(it.idx(0).is_none());
1700 assert!(it.next().is_none());
1704 fn test_iter_size_hints() {
1705 let mut xs = [1i, 2, 5, 10, 11];
1706 assert_eq!(xs.iter().size_hint(), (5, Some(5)));
1707 assert_eq!(xs.mut_iter().size_hint(), (5, Some(5)));
1711 fn test_iter_clone() {
1712 let xs = [1i, 2, 5];
1713 let mut it = xs.iter();
1715 let mut jt = it.clone();
1716 assert_eq!(it.next(), jt.next());
1717 assert_eq!(it.next(), jt.next());
1718 assert_eq!(it.next(), jt.next());
1722 fn test_mut_iterator() {
1723 let mut xs = [1i, 2, 3, 4, 5];
1724 for x in xs.mut_iter() {
1727 assert!(xs == [2, 3, 4, 5, 6])
1731 fn test_rev_iterator() {
1733 let xs = [1i, 2, 5, 10, 11];
1734 let ys = [11, 10, 5, 2, 1];
1736 for &x in xs.iter().rev() {
1737 assert_eq!(x, ys[i]);
1744 fn test_mut_rev_iterator() {
1745 let mut xs = [1u, 2, 3, 4, 5];
1746 for (i,x) in xs.mut_iter().rev().enumerate() {
1749 assert!(xs == [5, 5, 5, 5, 5])
1753 fn test_move_iterator() {
1754 let xs = vec![1u,2,3,4,5];
1755 assert_eq!(xs.move_iter().fold(0, |a: uint, b: uint| 10*a + b), 12345);
1759 fn test_move_rev_iterator() {
1760 let xs = vec![1u,2,3,4,5];
1761 assert_eq!(xs.move_iter().rev().fold(0, |a: uint, b: uint| 10*a + b), 54321);
1765 fn test_splitator() {
1766 let xs = &[1i,2,3,4,5];
1768 assert_eq!(xs.split(|x| *x % 2 == 0).collect::<Vec<&[int]>>().as_slice(),
1769 &[&[1], &[3], &[5]]);
1770 assert_eq!(xs.split(|x| *x == 1).collect::<Vec<&[int]>>().as_slice(),
1771 &[&[], &[2,3,4,5]]);
1772 assert_eq!(xs.split(|x| *x == 5).collect::<Vec<&[int]>>().as_slice(),
1773 &[&[1,2,3,4], &[]]);
1774 assert_eq!(xs.split(|x| *x == 10).collect::<Vec<&[int]>>().as_slice(),
1776 assert_eq!(xs.split(|_| true).collect::<Vec<&[int]>>().as_slice(),
1777 &[&[], &[], &[], &[], &[], &[]]);
1779 let xs: &[int] = &[];
1780 assert_eq!(xs.split(|x| *x == 5).collect::<Vec<&[int]>>().as_slice(), &[&[]]);
1784 fn test_splitnator() {
1785 let xs = &[1i,2,3,4,5];
1787 assert_eq!(xs.splitn(0, |x| *x % 2 == 0).collect::<Vec<&[int]>>().as_slice(),
1789 assert_eq!(xs.splitn(1, |x| *x % 2 == 0).collect::<Vec<&[int]>>().as_slice(),
1791 assert_eq!(xs.splitn(3, |_| true).collect::<Vec<&[int]>>().as_slice(),
1792 &[&[], &[], &[], &[4,5]]);
1794 let xs: &[int] = &[];
1795 assert_eq!(xs.splitn(1, |x| *x == 5).collect::<Vec<&[int]>>().as_slice(), &[&[]]);
1799 fn test_rsplitator() {
1800 let xs = &[1i,2,3,4,5];
1802 assert_eq!(xs.split(|x| *x % 2 == 0).rev().collect::<Vec<&[int]>>().as_slice(),
1803 &[&[5], &[3], &[1]]);
1804 assert_eq!(xs.split(|x| *x == 1).rev().collect::<Vec<&[int]>>().as_slice(),
1805 &[&[2,3,4,5], &[]]);
1806 assert_eq!(xs.split(|x| *x == 5).rev().collect::<Vec<&[int]>>().as_slice(),
1807 &[&[], &[1,2,3,4]]);
1808 assert_eq!(xs.split(|x| *x == 10).rev().collect::<Vec<&[int]>>().as_slice(),
1811 let xs: &[int] = &[];
1812 assert_eq!(xs.split(|x| *x == 5).rev().collect::<Vec<&[int]>>().as_slice(), &[&[]]);
1816 fn test_rsplitnator() {
1817 let xs = &[1,2,3,4,5];
1819 assert_eq!(xs.rsplitn(0, |x| *x % 2 == 0).collect::<Vec<&[int]>>().as_slice(),
1821 assert_eq!(xs.rsplitn(1, |x| *x % 2 == 0).collect::<Vec<&[int]>>().as_slice(),
1823 assert_eq!(xs.rsplitn(3, |_| true).collect::<Vec<&[int]>>().as_slice(),
1824 &[&[], &[], &[], &[1,2]]);
1826 let xs: &[int] = &[];
1827 assert_eq!(xs.rsplitn(1, |x| *x == 5).collect::<Vec<&[int]>>().as_slice(), &[&[]]);
1831 fn test_windowsator() {
1832 let v = &[1i,2,3,4];
1834 assert_eq!(v.windows(2).collect::<Vec<&[int]>>().as_slice(), &[&[1,2], &[2,3], &[3,4]]);
1835 assert_eq!(v.windows(3).collect::<Vec<&[int]>>().as_slice(), &[&[1i,2,3], &[2,3,4]]);
1836 assert!(v.windows(6).next().is_none());
1841 fn test_windowsator_0() {
1842 let v = &[1i,2,3,4];
1843 let _it = v.windows(0);
1847 fn test_chunksator() {
1848 let v = &[1i,2,3,4,5];
1850 assert_eq!(v.chunks(2).collect::<Vec<&[int]>>().as_slice(), &[&[1i,2], &[3,4], &[5]]);
1851 assert_eq!(v.chunks(3).collect::<Vec<&[int]>>().as_slice(), &[&[1i,2,3], &[4,5]]);
1852 assert_eq!(v.chunks(6).collect::<Vec<&[int]>>().as_slice(), &[&[1i,2,3,4,5]]);
1854 assert_eq!(v.chunks(2).rev().collect::<Vec<&[int]>>().as_slice(), &[&[5i], &[3,4], &[1,2]]);
1855 let mut it = v.chunks(2);
1856 assert_eq!(it.indexable(), 3);
1857 assert_eq!(it.idx(0).unwrap(), &[1,2]);
1858 assert_eq!(it.idx(1).unwrap(), &[3,4]);
1859 assert_eq!(it.idx(2).unwrap(), &[5]);
1860 assert_eq!(it.idx(3), None);
1865 fn test_chunksator_0() {
1866 let v = &[1i,2,3,4];
1867 let _it = v.chunks(0);
1871 fn test_move_from() {
1872 let mut a = [1i,2,3,4,5];
1873 let b = vec![6i,7,8];
1874 assert_eq!(a.move_from(b, 0, 3), 3);
1875 assert!(a == [6i,7,8,4,5]);
1876 let mut a = [7i,2,8,1];
1877 let b = vec![3i,1,4,1,5,9];
1878 assert_eq!(a.move_from(b, 0, 6), 4);
1879 assert!(a == [3i,1,4,1]);
1880 let mut a = [1i,2,3,4];
1881 let b = vec![5i,6,7,8,9,0];
1882 assert_eq!(a.move_from(b, 2, 3), 1);
1883 assert!(a == [7i,2,3,4]);
1884 let mut a = [1i,2,3,4,5];
1885 let b = vec![5i,6,7,8,9,0];
1886 assert_eq!(a.mut_slice(2,4).move_from(b,1,6), 2);
1887 assert!(a == [1i,2,6,7,5]);
1891 fn test_copy_from() {
1892 let mut a = [1i,2,3,4,5];
1894 assert_eq!(a.copy_from(b), 3);
1895 assert!(a == [6i,7,8,4,5]);
1896 let mut c = [7i,2,8,1];
1897 let d = [3i,1,4,1,5,9];
1898 assert_eq!(c.copy_from(d), 4);
1899 assert!(c == [3i,1,4,1]);
1903 fn test_reverse_part() {
1904 let mut values = [1i,2,3,4,5];
1905 values.mut_slice(1, 4).reverse();
1906 assert!(values == [1,4,3,2,5]);
1911 macro_rules! test_show_vec(
1912 ($x:expr, $x_str:expr) => ({
1913 let (x, x_str) = ($x, $x_str);
1914 assert_eq!(format!("{}", x), x_str);
1915 assert_eq!(format!("{}", x.as_slice()), x_str);
1918 let empty: Vec<int> = vec![];
1919 test_show_vec!(empty, "[]".to_string());
1920 test_show_vec!(vec![1i], "[1]".to_string());
1921 test_show_vec!(vec![1i, 2, 3], "[1, 2, 3]".to_string());
1922 test_show_vec!(vec![vec![], vec![1u], vec![1u, 1u]],
1923 "[[], [1], [1, 1]]".to_string());
1925 let empty_mut: &mut [int] = &mut[];
1926 test_show_vec!(empty_mut, "[]".to_string());
1927 test_show_vec!(&mut[1i], "[1]".to_string());
1928 test_show_vec!(&mut[1i, 2, 3], "[1, 2, 3]".to_string());
1929 test_show_vec!(&mut[&mut[], &mut[1u], &mut[1u, 1u]],
1930 "[[], [1], [1, 1]]".to_string());
1934 fn test_vec_default() {
1937 let v: $ty = Default::default();
1938 assert!(v.is_empty());
1947 fn test_bytes_set_memory() {
1948 use slice::bytes::MutableByteVector;
1949 let mut values = [1u8,2,3,4,5];
1950 values.mut_slice(0,5).set_memory(0xAB);
1951 assert!(values == [0xAB, 0xAB, 0xAB, 0xAB, 0xAB]);
1952 values.mut_slice(2,4).set_memory(0xFF);
1953 assert!(values == [0xAB, 0xAB, 0xFF, 0xFF, 0xAB]);
1958 fn test_overflow_does_not_cause_segfault() {
1960 v.reserve_exact(-1);
1967 fn test_overflow_does_not_cause_segfault_managed() {
1968 let mut v = vec![Rc::new(1i)];
1969 v.reserve_exact(-1);
1970 v.push(Rc::new(2i));
1974 fn test_mut_split_at() {
1975 let mut values = [1u8,2,3,4,5];
1977 let (left, right) = values.mut_split_at(2);
1978 assert!(left.slice(0, left.len()) == [1, 2]);
1979 for p in left.mut_iter() {
1983 assert!(right.slice(0, right.len()) == [3, 4, 5]);
1984 for p in right.mut_iter() {
1989 assert!(values == [2, 3, 5, 6, 7]);
1992 #[deriving(Clone, PartialEq)]
1996 fn test_iter_zero_sized() {
1997 let mut v = vec![Foo, Foo, Foo];
1998 assert_eq!(v.len(), 3);
2007 for f in v.slice(1, 3).iter() {
2013 for f in v.mut_iter() {
2019 for f in v.move_iter() {
2023 assert_eq!(cnt, 11);
2025 let xs: [Foo, ..3] = [Foo, Foo, Foo];
2027 for f in xs.iter() {
2035 fn test_shrink_to_fit() {
2036 let mut xs = vec![0, 1, 2, 3];
2037 for i in range(4i, 100) {
2040 assert_eq!(xs.capacity(), 128);
2042 assert_eq!(xs.capacity(), 100);
2043 assert_eq!(xs, range(0i, 100i).collect::<Vec<_>>());
2047 fn test_starts_with() {
2048 assert!(b"foobar".starts_with(b"foo"));
2049 assert!(!b"foobar".starts_with(b"oob"));
2050 assert!(!b"foobar".starts_with(b"bar"));
2051 assert!(!b"foo".starts_with(b"foobar"));
2052 assert!(!b"bar".starts_with(b"foobar"));
2053 assert!(b"foobar".starts_with(b"foobar"));
2054 let empty: &[u8] = [];
2055 assert!(empty.starts_with(empty));
2056 assert!(!empty.starts_with(b"foo"));
2057 assert!(b"foobar".starts_with(empty));
2061 fn test_ends_with() {
2062 assert!(b"foobar".ends_with(b"bar"));
2063 assert!(!b"foobar".ends_with(b"oba"));
2064 assert!(!b"foobar".ends_with(b"foo"));
2065 assert!(!b"foo".ends_with(b"foobar"));
2066 assert!(!b"bar".ends_with(b"foobar"));
2067 assert!(b"foobar".ends_with(b"foobar"));
2068 let empty: &[u8] = [];
2069 assert!(empty.ends_with(empty));
2070 assert!(!empty.ends_with(b"foo"));
2071 assert!(b"foobar".ends_with(empty));
2075 fn test_shift_ref() {
2076 let mut x: &[int] = [1, 2, 3, 4, 5];
2077 let h = x.shift_ref();
2078 assert_eq!(*h.unwrap(), 1);
2079 assert_eq!(x.len(), 4);
2080 assert_eq!(x[0], 2);
2081 assert_eq!(x[3], 5);
2083 let mut y: &[int] = [];
2084 assert_eq!(y.shift_ref(), None);
2089 let mut x: &[int] = [1, 2, 3, 4, 5];
2090 let h = x.pop_ref();
2091 assert_eq!(*h.unwrap(), 5);
2092 assert_eq!(x.len(), 4);
2093 assert_eq!(x[0], 1);
2094 assert_eq!(x[3], 4);
2096 let mut y: &[int] = [];
2097 assert!(y.pop_ref().is_none());
2101 fn test_mut_splitator() {
2102 let mut xs = [0i,1,0,2,3,0,0,4,5,0];
2103 assert_eq!(xs.mut_split(|x| *x == 0).count(), 6);
2104 for slice in xs.mut_split(|x| *x == 0) {
2107 assert!(xs == [0,1,0,3,2,0,0,5,4,0]);
2109 let mut xs = [0i,1,0,2,3,0,0,4,5,0,6,7];
2110 for slice in xs.mut_split(|x| *x == 0).take(5) {
2113 assert!(xs == [0,1,0,3,2,0,0,5,4,0,6,7]);
2117 fn test_mut_splitator_rev() {
2118 let mut xs = [1i,2,0,3,4,0,0,5,6,0];
2119 for slice in xs.mut_split(|x| *x == 0).rev().take(4) {
2122 assert!(xs == [1,2,0,4,3,0,0,6,5,0]);
2127 let mut v = [0i,1,2];
2128 assert_eq!(v.get_mut(3), None);
2129 v.get_mut(1).map(|e| *e = 7);
2130 assert_eq!(v[1], 7);
2132 assert_eq!(v.get_mut(2), Some(&mut x));
2136 fn test_mut_chunks() {
2137 let mut v = [0u8, 1, 2, 3, 4, 5, 6];
2138 for (i, chunk) in v.mut_chunks(3).enumerate() {
2139 for x in chunk.mut_iter() {
2143 let result = [0u8, 0, 0, 1, 1, 1, 2];
2144 assert!(v == result);
2148 fn test_mut_chunks_rev() {
2149 let mut v = [0u8, 1, 2, 3, 4, 5, 6];
2150 for (i, chunk) in v.mut_chunks(3).rev().enumerate() {
2151 for x in chunk.mut_iter() {
2155 let result = [2u8, 2, 2, 1, 1, 1, 0];
2156 assert!(v == result);
2161 fn test_mut_chunks_0() {
2162 let mut v = [1i, 2, 3, 4];
2163 let _it = v.mut_chunks(0);
2167 fn test_mut_shift_ref() {
2168 let mut x: &mut [int] = [1, 2, 3, 4, 5];
2169 let h = x.mut_shift_ref();
2170 assert_eq!(*h.unwrap(), 1);
2171 assert_eq!(x.len(), 4);
2172 assert_eq!(x[0], 2);
2173 assert_eq!(x[3], 5);
2175 let mut y: &mut [int] = [];
2176 assert!(y.mut_shift_ref().is_none());
2180 fn test_mut_pop_ref() {
2181 let mut x: &mut [int] = [1, 2, 3, 4, 5];
2182 let h = x.mut_pop_ref();
2183 assert_eq!(*h.unwrap(), 5);
2184 assert_eq!(x.len(), 4);
2185 assert_eq!(x[0], 1);
2186 assert_eq!(x[3], 4);
2188 let mut y: &mut [int] = [];
2189 assert!(y.mut_pop_ref().is_none());
2193 fn test_mut_last() {
2194 let mut x = [1i, 2, 3, 4, 5];
2195 let h = x.mut_last();
2196 assert_eq!(*h.unwrap(), 5);
2198 let y: &mut [int] = [];
2199 assert!(y.mut_last().is_none());
2205 use std::prelude::*;
2206 use std::rand::{weak_rng, Rng};
2215 fn iterator(b: &mut Bencher) {
2216 // peculiar numbers to stop LLVM from optimising the summation
2218 let v = Vec::from_fn(100, |i| i ^ (i << 1) ^ (i >> 1));
2225 // sum == 11806, to stop dead code elimination.
2226 if sum == 0 {fail!()}
2231 fn mut_iterator(b: &mut Bencher) {
2232 let mut v = Vec::from_elem(100, 0i);
2236 for x in v.mut_iter() {
2244 fn concat(b: &mut Bencher) {
2245 let xss: Vec<Vec<uint>> =
2246 Vec::from_fn(100, |i| range(0u, i).collect());
2248 xss.as_slice().concat_vec()
2253 fn connect(b: &mut Bencher) {
2254 let xss: Vec<Vec<uint>> =
2255 Vec::from_fn(100, |i| range(0u, i).collect());
2257 xss.as_slice().connect_vec(&0)
2262 fn push(b: &mut Bencher) {
2263 let mut vec: Vec<uint> = vec![];
2271 fn starts_with_same_vector(b: &mut Bencher) {
2272 let vec: Vec<uint> = Vec::from_fn(100, |i| i);
2274 vec.as_slice().starts_with(vec.as_slice())
2279 fn starts_with_single_element(b: &mut Bencher) {
2280 let vec: Vec<uint> = vec![0];
2282 vec.as_slice().starts_with(vec.as_slice())
2287 fn starts_with_diff_one_element_at_end(b: &mut Bencher) {
2288 let vec: Vec<uint> = Vec::from_fn(100, |i| i);
2289 let mut match_vec: Vec<uint> = Vec::from_fn(99, |i| i);
2292 vec.as_slice().starts_with(match_vec.as_slice())
2297 fn ends_with_same_vector(b: &mut Bencher) {
2298 let vec: Vec<uint> = Vec::from_fn(100, |i| i);
2300 vec.as_slice().ends_with(vec.as_slice())
2305 fn ends_with_single_element(b: &mut Bencher) {
2306 let vec: Vec<uint> = vec![0];
2308 vec.as_slice().ends_with(vec.as_slice())
2313 fn ends_with_diff_one_element_at_beginning(b: &mut Bencher) {
2314 let vec: Vec<uint> = Vec::from_fn(100, |i| i);
2315 let mut match_vec: Vec<uint> = Vec::from_fn(100, |i| i);
2316 match_vec.as_mut_slice()[0] = 200;
2318 vec.as_slice().starts_with(match_vec.as_slice())
2323 fn contains_last_element(b: &mut Bencher) {
2324 let vec: Vec<uint> = Vec::from_fn(100, |i| i);
2331 fn zero_1kb_from_elem(b: &mut Bencher) {
2333 Vec::from_elem(1024, 0u8)
2338 fn zero_1kb_set_memory(b: &mut Bencher) {
2340 let mut v: Vec<uint> = Vec::with_capacity(1024);
2342 let vp = v.as_mut_ptr();
2343 ptr::set_memory(vp, 0, 1024);
2351 fn zero_1kb_loop_set(b: &mut Bencher) {
2353 let mut v: Vec<uint> = Vec::with_capacity(1024);
2357 for i in range(0u, 1024) {
2364 fn zero_1kb_mut_iter(b: &mut Bencher) {
2366 let mut v = Vec::with_capacity(1024);
2370 for x in v.mut_iter() {
2378 fn random_inserts(b: &mut Bencher) {
2379 let mut rng = weak_rng();
2381 let mut v = Vec::from_elem(30, (0u, 0u));
2382 for _ in range(0u, 100) {
2384 v.insert(rng.gen::<uint>() % (l + 1),
2390 fn random_removes(b: &mut Bencher) {
2391 let mut rng = weak_rng();
2393 let mut v = Vec::from_elem(130, (0u, 0u));
2394 for _ in range(0u, 100) {
2396 v.remove(rng.gen::<uint>() % l);
2402 fn sort_random_small(b: &mut Bencher) {
2403 let mut rng = weak_rng();
2405 let mut v = rng.gen_iter::<u64>().take(5).collect::<Vec<u64>>();
2406 v.as_mut_slice().sort();
2408 b.bytes = 5 * mem::size_of::<u64>() as u64;
2412 fn sort_random_medium(b: &mut Bencher) {
2413 let mut rng = weak_rng();
2415 let mut v = rng.gen_iter::<u64>().take(100).collect::<Vec<u64>>();
2416 v.as_mut_slice().sort();
2418 b.bytes = 100 * mem::size_of::<u64>() as u64;
2422 fn sort_random_large(b: &mut Bencher) {
2423 let mut rng = weak_rng();
2425 let mut v = rng.gen_iter::<u64>().take(10000).collect::<Vec<u64>>();
2426 v.as_mut_slice().sort();
2428 b.bytes = 10000 * mem::size_of::<u64>() as u64;
2432 fn sort_sorted(b: &mut Bencher) {
2433 let mut v = Vec::from_fn(10000, |i| i);
2437 b.bytes = (v.len() * mem::size_of_val(v.get(0))) as u64;
2440 type BigSortable = (u64,u64,u64,u64);
2443 fn sort_big_random_small(b: &mut Bencher) {
2444 let mut rng = weak_rng();
2446 let mut v = rng.gen_iter::<BigSortable>().take(5)
2447 .collect::<Vec<BigSortable>>();
2450 b.bytes = 5 * mem::size_of::<BigSortable>() as u64;
2454 fn sort_big_random_medium(b: &mut Bencher) {
2455 let mut rng = weak_rng();
2457 let mut v = rng.gen_iter::<BigSortable>().take(100)
2458 .collect::<Vec<BigSortable>>();
2461 b.bytes = 100 * mem::size_of::<BigSortable>() as u64;
2465 fn sort_big_random_large(b: &mut Bencher) {
2466 let mut rng = weak_rng();
2468 let mut v = rng.gen_iter::<BigSortable>().take(10000)
2469 .collect::<Vec<BigSortable>>();
2472 b.bytes = 10000 * mem::size_of::<BigSortable>() as u64;
2476 fn sort_big_sorted(b: &mut Bencher) {
2477 let mut v = Vec::from_fn(10000u, |i| (i, i, i, i));
2481 b.bytes = (v.len() * mem::size_of_val(v.get(0))) as u64;