extern crate indexing;
#[macro_use]
extern crate quickcheck;
use indexing::scope;
use indexing::algorithms::*;
use std::cmp::Ordering;
use std::fmt::Debug;
#[test]
fn test_range_order() {
let data = [1, 2, 3, 4, 5];
scope(&data[..], move |v| {
let r = v.range();
let rne = r.nonempty().unwrap();
assert_eq!(r, rne);
assert_eq!(r.partial_cmp(&rne), Some(Ordering::Equal));
assert_eq!(r.cmp(&rne.no_proof()), Ordering::Equal);
let tail = rne.tail();
assert!(r < tail);
assert!(tail >= r);
assert!(tail != r);
assert_eq!(r.cmp(&tail), Ordering::Less);
let (a, b) = r.split_in_half();
assert!(a < b);
assert!(a < r);
});
}
#[test]
fn join_add_proof() {
let data = [1, 2, 3];
scope(&data[..], move |v| {
let r = v.range();
if let Ok(r) = r.nonempty() {
let (front, back) = r.frontiers();
r.first();
front.join(r).unwrap().first();
r.join(back).unwrap().first();
front.join_cover(r).first();
r.join_cover(back).first();
r.join_cover(r).first();
assert_eq!(front.join(r).unwrap(), r);
assert_eq!(front.join_cover(back), r);
assert_eq!(back.join_cover(front), back);
let (a, b) = r.split_in_half();
assert_eq!(a.join(b), Ok(r));
assert_eq!(a.join_cover(back), r);
assert_eq!(front.join_cover(a), a);
assert_eq!(front.join_cover(b), r);
}
});
}
#[test]
fn range_split_nonempty() {
let data = [1, 2, 3, 4, 5];
scope(&data[..], move |v| {
for i in 0..v.len() {
let r = v.vet_range(0..i).unwrap();
if let Ok(r) = r.nonempty() {
let (a, b) = r.split_in_half();
assert!(b.len() > 0);
assert_eq!(a.len() + b.len(), r.len());
assert!(b.first().integer() < r.len());
} else {
let (a, b) = r.split_in_half();
assert_eq!(a.len(), 0);
assert_eq!(b.len(), 0);
assert_eq!(a.start(), b.start());
}
}
});
}
fn is_sorted<T: Clone + Ord>(v: &[T]) -> bool {
let mut vec = v.to_vec();
vec.sort();
vec == v
}
fn sorted<T: Clone + Ord>(v: &[T]) -> Vec<T> {
let mut v = v.to_vec();
v.sort();
v
}
#[test]
fn qc_quicksort() {
fn prop(mut v: Vec<i32>) -> bool {
quicksort_range(&mut v);
is_sorted(&v)
}
quickcheck::quickcheck(prop as fn(_) -> bool);
}
#[test]
fn qc_quicksort_bounds() {
fn prop(mut v: Vec<i32>) -> bool {
indexing::algorithms::quicksort_bounds(&mut v);
is_sorted(&v)
}
quickcheck::quickcheck(prop as fn(_) -> bool);
}
quickcheck! {
#[cfg(feature="experimental_pointer_ranges")]
fn test_quicksort_prange(v: Vec<i32>) -> bool {
let ans = sorted(&v);
let mut v = v;
quicksort_prange(&mut v);
assert_eq!(&v, &ans);
true
}
}
fn is_minheap<T: Ord>(v: &[T]) -> bool {
for (index, parent) in v.iter().enumerate() {
let child = 2 * index + 1;
if child < v.len() && &v[child] < parent {
return false;
}
if child + 1 < v.len() && &v[child + 1] < parent {
return false;
}
}
true
}
#[test]
fn qc_heapify() {
fn prop(mut v: Vec<i32>) -> bool {
indexing::algorithms::heapify(&mut v);
is_minheap(&v)
}
quickcheck::quickcheck(prop as fn(_) -> bool);
}
#[cfg(test)]
fn bench_data(data: &mut [i32]) {
let len = data.len();
for (index, elt) in data.iter_mut().enumerate() {
*elt = ((index * 123) % len) as i32;
}
}
#[test]
fn test_insertion_sort() {
let mut data = [2, 1];
insertion_sort_indexes(&mut data, |a, b| a < b);
assert_eq!(data, [1, 2]);
let mut data = [2, 1, 3];
insertion_sort_indexes(&mut data, |a, b| a < b);
assert_eq!(data, [1, 2, 3]);
let mut data = [2, 0, 2, 3, 4, 1, 0];
insertion_sort_indexes(&mut data, |a, b| a < b);
assert_eq!(data, [0, 0, 1, 2, 2, 3, 4]);
let mut data = [0; 100];
bench_data(&mut data);
let mut data2 = data;
insertion_sort_indexes(&mut data, |a, b| a < b);
insertion_sort_rust(&mut data2, |a, b| a < b);
assert_eq!(&data[..], &data2[..]);
}
fn sorted_vec<T: Ord>(mut v: Vec<T>) -> Vec<T> { v.sort(); v }
quickcheck! {
fn test_lower_bound_1(data: Vec<u8>, find: u8) -> bool {
lower_bound(&data, &find) == lower_bound_raw_ptr(&data, &find)
}
fn test_lower_bound_2(data: Vec<u8>, find: u8) -> bool {
let data = sorted_vec(data);
lower_bound(&data, &find) ==
data.binary_search_by(|x|
if *x >= find {
Ordering::Greater
} else {
Ordering::Less
}).unwrap_err()
}
#[cfg(feature="experimental_pointer_ranges")]
fn test_lower_bound_3(data: Vec<u8>, find: u8) -> bool {
let data = sorted_vec(data);
lower_bound(&data, &find) == lower_bound_prange(&data, &find)
}
#[cfg(feature="experimental_pointer_ranges")]
fn test_lower_bound_4(data: Vec<u8>, find: u8) -> bool {
let data = sorted_vec(data);
lower_bound_pslice(&data, |x| *x < find) == lower_bound_raw_ptr(&data, &find)
}
#[cfg(feature="experimental_pointer_ranges")]
fn test_insertion_sort_prange(data: Vec<u8>) -> () {
let mut data = data;
let ans = sorted_vec(data.clone());
insertion_sort_pointerindex(&mut data, |a, b| a < b);
assert_eq!(ans, data);
}
#[cfg(feature="experimental_pointer_ranges")]
fn test_insertion_sort_prange_lower(data: Vec<u8>) -> () {
let mut data = data;
let ans = sorted_vec(data.clone());
insertion_sort_prange_lower(&mut data, |a, b| a < b);
assert_eq!(ans, data);
}
#[cfg(feature="experimental_pointer_ranges")]
fn test_binary_search_prange(data: Vec<u8>, find: u8) -> () {
let data = sorted_vec(data);
assert_binary_search_ok(&data, data.binary_search(&find),
binary_search_by_prange(&data, |x| x.cmp(&find)))
}
#[cfg(feature="experimental_pointer_ranges")]
fn test_binary_search_pslice(data: Vec<u8>, find: u8) -> () {
let data = sorted_vec(data);
assert_binary_search_ok(&data, data.binary_search(&find),
binary_search_by_pslice(&data, |x| x.cmp(&find)))
}
}
type R = Result<usize, usize>;
fn assert_binary_search_ok<T>(data: &[T], expected: R, result: R)
where T: Debug + Ord
{
if let (Ok(i), Ok(j)) = (expected, result) {
assert!(i == j || data[i] == data[j]);
} else if expected != result {
panic!("expected: {:?}, got: {:?}", expected, result);
}
}