Home
last modified time | relevance | path

Searched refs:BinaryHeap (Results 1 – 17 of 17) sorted by relevance

/external/rust/crates/itertools/src/
Dk_smallest.rs1 use alloc::collections::BinaryHeap;
4 pub(crate) fn k_smallest<T: Ord, I: Iterator<Item = T>>(mut iter: I, k: usize) -> BinaryHeap<T> { in k_smallest()
5 if k == 0 { return BinaryHeap::new(); } in k_smallest()
7 let mut heap = iter.by_ref().take(k).collect::<BinaryHeap<_>>(); in k_smallest()
/external/rust/crates/rayon/src/collections/
Dbinary_heap.rs5 use std::collections::BinaryHeap;
18 impl<T: Ord + Send> IntoParallelIterator for BinaryHeap<T> { implementation
49 &'a BinaryHeap<T> => Iter<'a, T>,
64 heap: &'a mut BinaryHeap<T>,
67 impl<'a, T: Ord + Send> ParallelDrainFull for &'a mut BinaryHeap<T> { implementation
/external/rust/crates/thread_local/src/
Dthread_id.rs11 use std::collections::BinaryHeap;
20 free_list: BinaryHeap<Reverse<usize>>,
26 free_list: BinaryHeap::new(), in new()
/external/rust/crates/futures-util/src/stream/
Dfutures_ordered.rs2 use alloc::collections::binary_heap::{BinaryHeap, PeekMut};
100 queued_outputs: BinaryHeap<OrderWrapper<T::Output>>,
115 queued_outputs: BinaryHeap::new(), in new()
/external/rust/crates/rayon/src/iter/
Dextend.rs7 use std::collections::{BinaryHeap, VecDeque};
59 fn heap_reserve<T: Ord, U>(heap: &mut BinaryHeap<T>, list: &LinkedList<Vec<U>>) { in heap_reserve()
64 impl<T> ParallelExtend<T> for BinaryHeap<T> implementation
77 impl<'a, T> ParallelExtend<&'a T> for BinaryHeap<T> implementation
Dfrom_par_iter.rs7 use std::collections::{BinaryHeap, VecDeque};
49 impl<T> FromParallelIterator<T> for BinaryHeap<T> implementation
Dtest.rs12 use std::collections::{BinaryHeap, VecDeque};
1098 use std::collections::BinaryHeap; in check_binary_heap()
1100 let a: BinaryHeap<i32> = (0..10).collect(); in check_binary_heap()
1454 let mut b: BinaryHeap<i32> = a.par_iter().cloned().collect(); in par_iter_collect_binaryheap()
1761 let mut serial: BinaryHeap<_> = Default::default(); in check_extend_heap()
1762 let mut parallel: BinaryHeap<_> = Default::default(); in check_extend_heap()
/external/rust/crates/serde/src/
Dlib.rs207 pub use alloc::collections::{BTreeMap, BTreeSet, BinaryHeap, LinkedList, VecDeque};
209 pub use std::collections::{BTreeMap, BTreeSet, BinaryHeap, LinkedList, VecDeque};
/external/rust/crates/rayon/tests/
Dclones.rs15 use std::collections::BinaryHeap; in clone_binary_heap()
16 let heap: BinaryHeap<_> = (0..1000).collect(); in clone_binary_heap()
Ddebug.rs13 use std::collections::BinaryHeap; in debug_binary_heap()
14 let mut heap: BinaryHeap<_> = (0..10).collect(); in debug_binary_heap()
/external/rust/crates/rand/src/seq/
Dindex.rs383 use std::collections::BinaryHeap; in sample_efraimidis_spirakis()
387 let mut candidates = BinaryHeap::with_capacity(length.as_usize()); in sample_efraimidis_spirakis()
/external/rust/crates/quiche/src/
Dstream.rs31 use std::collections::BinaryHeap;
93 flushable: BTreeMap<u8, (BinaryHeap<std::cmp::Reverse<u64>>, VecDeque<u64>)>,
262 .or_insert_with(|| (BinaryHeap::new(), VecDeque::new())); in push_flushable()
601 data: BinaryHeap<RangeBuf>,
884 data: BinaryHeap<RangeBuf>,
/external/crosvm/hypervisor/src/kvm/
Dmod.rs17 use std::collections::{BTreeMap, BinaryHeap};
161 mem_slot_gaps: Arc<Mutex<BinaryHeap<Reverse<MemSlot>>>>,
195 mem_slot_gaps: Arc::new(Mutex::new(BinaryHeap::new())), in new()
/external/rust/crates/serde/src/de/
Dimpls.rs850 BinaryHeap<T: Ord>,
852 BinaryHeap::clear,
853 BinaryHeap::with_capacity(size_hint::cautious(seq.size_hint())),
854 BinaryHeap::reserve,
855 BinaryHeap::push
/external/rust/crates/arbitrary/src/
Dlib.rs44 use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, LinkedList, VecDeque};
690 impl<'a, A: Arbitrary<'a> + Ord> Arbitrary<'a> for BinaryHeap<A> { implementation
/external/crosvm/kvm/src/
Dlib.rs11 use std::collections::{BTreeMap, BinaryHeap};
269 mem_slot_gaps: Arc<Mutex<BinaryHeap<MemSlot>>>,
300 mem_slot_gaps: Arc::new(Mutex::new(BinaryHeap::new())), in new()
/external/rust/crates/serde/src/ser/
Dimpls.rs205 seq_impl!(BinaryHeap<T: Ord>);