c731157395
Add `vec::Drain{,Filter}::keep_rest`
This PR adds `keep_rest` methods to `vec::Drain` and `vec::DrainFilter` under `drain_keep_rest` feature gate:
```rust
// mod alloc::vec
impl<T, A: Allocator> Drain<'_, T, A> {
pub fn keep_rest(self);
}
impl<T, F, A: Allocator> DrainFilter<'_, T, F, A>
where
F: FnMut(&mut T) -> bool,
{
pub fn keep_rest(self);
}
```
Both these methods cancel draining of elements that were not yet yielded from the iterators. While this needs more testing & documentation, I want at least start the discussion. This may be a potential way out of the "should `DrainFilter` exhaust itself on drop?" argument.
91 lines
2.3 KiB
Rust
91 lines
2.3 KiB
Rust
#![feature(allocator_api)]
|
|
#![feature(alloc_layout_extra)]
|
|
#![feature(assert_matches)]
|
|
#![feature(box_syntax)]
|
|
#![feature(cow_is_borrowed)]
|
|
#![feature(const_box)]
|
|
#![feature(const_convert)]
|
|
#![feature(const_cow_is_borrowed)]
|
|
#![feature(const_heap)]
|
|
#![feature(const_mut_refs)]
|
|
#![feature(const_nonnull_slice_from_raw_parts)]
|
|
#![feature(const_ptr_write)]
|
|
#![feature(const_try)]
|
|
#![feature(core_intrinsics)]
|
|
#![feature(drain_filter)]
|
|
#![feature(exact_size_is_empty)]
|
|
#![feature(new_uninit)]
|
|
#![feature(pattern)]
|
|
#![feature(trusted_len)]
|
|
#![feature(try_reserve_kind)]
|
|
#![feature(unboxed_closures)]
|
|
#![feature(associated_type_bounds)]
|
|
#![feature(binary_heap_into_iter_sorted)]
|
|
#![feature(binary_heap_drain_sorted)]
|
|
#![feature(slice_ptr_get)]
|
|
#![feature(binary_heap_retain)]
|
|
#![feature(binary_heap_as_slice)]
|
|
#![feature(inplace_iteration)]
|
|
#![feature(iter_advance_by)]
|
|
#![feature(iter_next_chunk)]
|
|
#![feature(round_char_boundary)]
|
|
#![feature(slice_group_by)]
|
|
#![feature(slice_partition_dedup)]
|
|
#![feature(string_remove_matches)]
|
|
#![feature(const_btree_new)]
|
|
#![feature(const_default_impls)]
|
|
#![feature(const_trait_impl)]
|
|
#![feature(const_str_from_utf8)]
|
|
#![feature(nonnull_slice_from_raw_parts)]
|
|
#![feature(panic_update_hook)]
|
|
#![feature(pointer_is_aligned)]
|
|
#![feature(slice_flatten)]
|
|
#![feature(thin_box)]
|
|
#![feature(bench_black_box)]
|
|
#![feature(strict_provenance)]
|
|
#![feature(once_cell)]
|
|
#![feature(drain_keep_rest)]
|
|
|
|
use std::collections::hash_map::DefaultHasher;
|
|
use std::hash::{Hash, Hasher};
|
|
|
|
mod arc;
|
|
mod borrow;
|
|
mod boxed;
|
|
mod btree_set_hash;
|
|
mod c_str;
|
|
mod const_fns;
|
|
mod cow_str;
|
|
mod fmt;
|
|
mod heap;
|
|
mod linked_list;
|
|
mod rc;
|
|
mod slice;
|
|
mod str;
|
|
mod string;
|
|
mod thin_box;
|
|
mod vec;
|
|
mod vec_deque;
|
|
|
|
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());
|
|
}
|