Lines Matching defs:min
30803 /// The simplest way is to use the range syntax `min..max`, thus `range(min..max)` will
30804 /// yield elements from min (inclusive) to max (exclusive).
30846 /// The simplest way is to use the range syntax `min..max`, thus `range(min..max)` will
30847 /// yield elements from min (inclusive) to max (exclusive).
31108 fn min(mut self) -> Option<(&'a K, &'a V)> {
31177 fn min(mut self) -> Option<(&'a K, &'a mut V)> {
31329 fn min(mut self) -> Option<&'a K> {
31522 fn min(mut self) -> Option<(&'a K, &'a V)> {
31587 fn min(mut self) -> Option<K> {
31682 fn min(mut self) -> Option<(&'a K, &'a mut V)> {
32172 use core::cmp::{max, min};
32415 /// The simplest way is to use the range syntax `min..max`, thus `range(min..max)` will
32416 /// yield elements from min (inclusive) to max (exclusive).
33466 fn min(mut self) -> Option<&'a T> {
33537 fn min(mut self) -> Option<&'a T> {
33615 fn min(mut self) -> Option<&'a T> {
33650 fn min(mut self) -> Option<&'a T> {
33703 IntersectionInner::Stitch { a, b } => (0, Some(min(a.len(), b.len()))),
33710 fn min(mut self) -> Option<&'a T> {
33739 fn min(mut self) -> Option<&'a T> {
34315 assert_eq!(a.iter().min(), None);
34317 assert_eq!(a.range(..).min(), None);
34319 assert_eq!(a.difference(&BTreeSet::new()).min(), None);
34321 assert_eq!(a.intersection(&a).min(), None);
34323 assert_eq!(a.symmetric_difference(&BTreeSet::new()).min(), None);
34325 assert_eq!(a.union(&a).min(), None);
34329 assert_eq!(a.iter().min(), Some(&1));
34331 assert_eq!(a.range(..).min(), Some(&1));
34333 assert_eq!(a.difference(&BTreeSet::new()).min(), Some(&1));
34335 assert_eq!(a.intersection(&a).min(), Some(&1));
34337 assert_eq!(a.symmetric_difference(&BTreeSet::new()).min(), Some(&1));
34339 assert_eq!(a.union(&a).min(), Some(&1));
35006 let right = set.split_off(data.iter().min().unwrap());
36095 assert_eq!(a.iter().min(), None);
36097 assert_eq!(a.iter_mut().min(), None);
36099 assert_eq!(a.range(..).min(), None);
36101 assert_eq!(a.range_mut(..).min(), None);
36103 assert_eq!(a.keys().min(), None);
36105 assert_eq!(a.values().min(), None);
36107 assert_eq!(a.values_mut().min(), None);
36111 assert_eq!(a.iter().min(), Some((&1, &42)));
36113 assert_eq!(a.iter_mut().min(), Some((&1, &mut 42)));
36115 assert_eq!(a.range(..).min(), Some((&1, &42)));
36117 assert_eq!(a.range_mut(..).min(), Some((&1, &mut 42)));
36119 assert_eq!(a.keys().min(), Some(&1));
36121 assert_eq!(a.values().min(), Some(&24));
36123 assert_eq!(a.values_mut().min(), Some(&mut 24));
36393 fn test(map: &BTreeMap<u32, u32>, size: u32, min: Bound<&u32>, max: Bound<&u32>) {
36394 let mut kvs = map.range((min, max)).map(|(&k, &v)| (k, v));
37562 let right = map.split_off(&data.iter().min().unwrap().0);
40339 let part = cmp::min(self.a0.len(), self.b0.len());
40635 cmp::min(diff(dst, src), self.cap() - diff(dst, src)) + len <= self.cap(),
41139 let min_capacity = cmp::min(min_capacity, self.capacity());
41931 // At most len/2 - 1 elements will be moved. O(min(n, n-i))
42657 /// Takes `*O*(min(mid, len() - mid))` time and no extra space.
42700 /// Takes `*O*(min(k, len() - k))` time and no extra space.
42732 // `wrap_copy` requires that `min(x, cap() - x) + copy_len <= cap()`,
42733 // but than `min` is never more than half the capacity, regardless of x,
44297 //! // Explicitly implement the trait so the queue becomes a min-heap
44338 //! // Examine the frontier with lower cost nodes first (min-heap)
44482 /// make `BinaryHeap` a min-heap. This makes `heap.pop()` return the smallest