b53764c73b
Removes all unstable and deprecated APIs prior to the 1.8 release. All APIs that are deprecated in the 1.8 release are sticking around for the rest of this cycle. Some notable changes are: * The `dynamic_lib` module was moved into `rustc_back` as the compiler still relies on a few bits and pieces. * The `DebugTuple` formatter now special-cases an empty struct name with only one field to append a trailing comma.
73 lines
2.1 KiB
Rust
73 lines
2.1 KiB
Rust
// Copyright 2015 The Rust Project Developers. See the COPYRIGHT
|
|
// file at the top-level directory of this distribution and at
|
|
// http://rust-lang.org/COPYRIGHT.
|
|
//
|
|
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
|
|
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
|
|
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
|
|
// option. This file may not be copied, modified, or distributed
|
|
// except according to those terms.
|
|
|
|
use std::fmt::Debug;
|
|
use std::cmp::{self, PartialOrd, Ordering};
|
|
|
|
#[derive(Debug, Copy, Clone, PartialEq, Eq)]
|
|
struct Foo {
|
|
n: u8,
|
|
name: &'static str
|
|
}
|
|
|
|
impl PartialOrd for Foo {
|
|
fn partial_cmp(&self, other: &Foo) -> Option<Ordering> {
|
|
Some(self.cmp(other))
|
|
}
|
|
}
|
|
|
|
impl Ord for Foo {
|
|
fn cmp(&self, other: &Foo) -> Ordering {
|
|
self.n.cmp(&other.n)
|
|
}
|
|
}
|
|
|
|
fn main() {
|
|
let a = Foo { n: 4, name: "a" };
|
|
let b = Foo { n: 4, name: "b" };
|
|
let c = Foo { n: 8, name: "c" };
|
|
let d = Foo { n: 8, name: "d" };
|
|
let e = Foo { n: 22, name: "e" };
|
|
let f = Foo { n: 22, name: "f" };
|
|
|
|
let data = [a, b, c, d, e, f];
|
|
|
|
// `min` should return the left when the values are equal
|
|
assert_eq!(data.iter().min(), Some(&a));
|
|
assert_eq!(data.iter().min_by_key(|a| a.n), Some(&a));
|
|
assert_eq!(cmp::min(a, b), a);
|
|
assert_eq!(cmp::min(b, a), b);
|
|
|
|
// `max` should return the right when the values are equal
|
|
assert_eq!(data.iter().max(), Some(&f));
|
|
assert_eq!(data.iter().max_by_key(|a| a.n), Some(&f));
|
|
assert_eq!(cmp::max(e, f), f);
|
|
assert_eq!(cmp::max(f, e), e);
|
|
|
|
let mut presorted = data.to_vec();
|
|
presorted.sort();
|
|
assert_stable(&presorted);
|
|
|
|
let mut presorted = data.to_vec();
|
|
presorted.sort_by(|a, b| a.cmp(b));
|
|
assert_stable(&presorted);
|
|
|
|
// Assert that sorted and min/max are the same
|
|
fn assert_stable<T: Ord + Debug>(presorted: &[T]) {
|
|
for slice in presorted.windows(2) {
|
|
let a = &slice[0];
|
|
let b = &slice[1];
|
|
|
|
assert_eq!(a, cmp::min(a, b));
|
|
assert_eq!(b, cmp::max(a, b));
|
|
}
|
|
}
|
|
}
|