374ad1b006
proposal for BTreeMap/Set min/max, #62924 - Which pair of names: #62924 lists the existing possibilities min/max, first/last, (EDIT) front/back, peek(/peek_back?). Iterators have next/next_back or next/last. I'm slightly in favour of first/last because min/max might suggest they search over the entire map, and front/back pretends they are only about position. - Return key only instead of pair like iterator does? - If not, then keep the _key_value suffix? ~~Also provide variant with mutable value? But there is no such variant for get_key_value.~~ - Look for and upgrade more usages of `.iter().next()` and such in the libraries? I only upgraded the ones I contributed myself, all very recently.
53 lines
1.3 KiB
Rust
53 lines
1.3 KiB
Rust
#![feature(allocator_api)]
|
|
#![feature(box_syntax)]
|
|
#![feature(drain_filter)]
|
|
#![feature(exact_size_is_empty)]
|
|
#![feature(map_first_last)]
|
|
#![feature(new_uninit)]
|
|
#![feature(pattern)]
|
|
#![feature(trusted_len)]
|
|
#![feature(try_reserve)]
|
|
#![feature(unboxed_closures)]
|
|
#![feature(associated_type_bounds)]
|
|
#![feature(binary_heap_into_iter_sorted)]
|
|
#![feature(binary_heap_drain_sorted)]
|
|
|
|
use std::hash::{Hash, Hasher};
|
|
use std::collections::hash_map::DefaultHasher;
|
|
|
|
mod arc;
|
|
mod binary_heap;
|
|
mod boxed;
|
|
mod btree;
|
|
mod cow_str;
|
|
mod fmt;
|
|
mod heap;
|
|
mod linked_list;
|
|
mod rc;
|
|
mod slice;
|
|
mod str;
|
|
mod string;
|
|
mod vec_deque;
|
|
mod vec;
|
|
|
|
fn hash<T: Hash>(t: &T) -> u64 {
|
|
let mut s = DefaultHasher::new();
|
|
t.hash(&mut s);
|
|
s.finish()
|
|
}
|
|
|
|
// FIXME: Instantiated functions with i128 in the signature is not supported in Emscripten.
|
|
// See https://github.com/kripken/emscripten-fastcomp/issues/169
|
|
#[cfg(not(target_os = "emscripten"))]
|
|
#[test]
|
|
fn test_boxed_hasher() {
|
|
let ordinary_hash = hash(&5u32);
|
|
|
|
let mut hasher_1 = Box::new(DefaultHasher::new());
|
|
5u32.hash(&mut hasher_1);
|
|
assert_eq!(ordinary_hash, hasher_1.finish());
|
|
|
|
let mut hasher_2 = Box::new(DefaultHasher::new()) as Box<dyn Hasher>;
|
|
5u32.hash(&mut hasher_2);
|
|
assert_eq!(ordinary_hash, hasher_2.finish());
|
|
}
|