| /aosp_15_r20/prebuilts/rust/linux-musl-x86/1.81.0/lib/rustlib/src/rust/library/alloc/src/collections/btree/ |
| H A D | set.rs | 395 K: Ord, in range()
396 T: Borrow<K> + Ord, in range()
425 T: Ord, in difference()
489 T: Ord, in symmetric_difference()
517 T: Ord, in intersection()
568 T: Ord, in union()
611 T: Borrow<Q> + Ord, in contains()
612 Q: Ord, in contains()
636 T: Borrow<Q> + Ord, in get()
637 Q: Ord, in get()
[all …]
|
| H A D | map.rs | 698 K: Borrow<Q> + Ord, in get()
699 Q: Ord, in get()
726 K: Borrow<Q> + Ord, in get_key_value()
727 Q: Ord, in get_key_value()
753 K: Ord, in first_key_value()
781 K: Ord, in first_entry()
815 K: Ord, in pop_first()
836 K: Ord, in last_key_value()
864 K: Ord, in last_entry()
898 K: Ord, in pop_last()
[all …]
|
| H A D | search.rs | 51 ) -> SearchResult<BorrowType, K, V, marker::LeafOrInternal, marker::Leaf> in search_tree()
96 Q: Ord, in search_tree_for_bifurcation()
163 Q: ?Sized + Ord, in find_lower_bound_edge()
177 Q: ?Sized + Ord, in find_upper_bound_edge()
196 Q: Ord, in search_node()
213 unsafe fn find_key_index<Q: ?Sized>(&self, key: &Q, start_index: usize) -> IndexResult in find_key_index()
241 Q: ?Sized + Ord, in find_lower_bound_index()
269 Q: ?Sized + Ord, in find_upper_bound_index()
|
| /aosp_15_r20/prebuilts/rust/linux-musl-x86/1.80.1/lib/rustlib/src/rust/library/alloc/src/collections/btree/ |
| H A D | set.rs | 395 K: Ord, in range()
396 T: Borrow<K> + Ord, in range()
425 T: Ord, in difference()
489 T: Ord, in symmetric_difference()
517 T: Ord, in intersection()
568 T: Ord, in union()
611 T: Borrow<Q> + Ord, in contains()
612 Q: Ord, in contains()
636 T: Borrow<Q> + Ord, in get()
637 Q: Ord, in get()
[all …]
|
| H A D | map.rs | 698 K: Borrow<Q> + Ord, in get()
699 Q: Ord, in get()
726 K: Borrow<Q> + Ord, in get_key_value()
727 Q: Ord, in get_key_value()
753 K: Ord, in first_key_value()
781 K: Ord, in first_entry()
815 K: Ord, in pop_first()
836 K: Ord, in last_key_value()
864 K: Ord, in last_entry()
898 K: Ord, in pop_last()
[all …]
|
| H A D | search.rs | 51 ) -> SearchResult<BorrowType, K, V, marker::LeafOrInternal, marker::Leaf> in search_tree()
96 Q: Ord, in search_tree_for_bifurcation()
163 Q: ?Sized + Ord, in find_lower_bound_edge()
177 Q: ?Sized + Ord, in find_upper_bound_edge()
196 Q: Ord, in search_node()
213 unsafe fn find_key_index<Q: ?Sized>(&self, key: &Q, start_index: usize) -> IndexResult in find_key_index()
241 Q: ?Sized + Ord, in find_lower_bound_index()
269 Q: ?Sized + Ord, in find_upper_bound_index()
|
| /aosp_15_r20/prebuilts/rust/linux-x86/1.80.1/lib/rustlib/src/rust/library/alloc/src/collections/btree/ |
| H A D | set.rs | 395 K: Ord, in range()
396 T: Borrow<K> + Ord, in range()
425 T: Ord, in difference()
489 T: Ord, in symmetric_difference()
517 T: Ord, in intersection()
568 T: Ord, in union()
611 T: Borrow<Q> + Ord, in contains()
612 Q: Ord, in contains()
636 T: Borrow<Q> + Ord, in get()
637 Q: Ord, in get()
[all …]
|
| H A D | map.rs | 698 K: Borrow<Q> + Ord, in get()
699 Q: Ord, in get()
726 K: Borrow<Q> + Ord, in get_key_value()
727 Q: Ord, in get_key_value()
753 K: Ord, in first_key_value()
781 K: Ord, in first_entry()
815 K: Ord, in pop_first()
836 K: Ord, in last_key_value()
864 K: Ord, in last_entry()
898 K: Ord, in pop_last()
[all …]
|
| H A D | search.rs | 51 ) -> SearchResult<BorrowType, K, V, marker::LeafOrInternal, marker::Leaf> in search_tree()
96 Q: Ord, in search_tree_for_bifurcation()
163 Q: ?Sized + Ord, in find_lower_bound_edge()
177 Q: ?Sized + Ord, in find_upper_bound_edge()
196 Q: Ord, in search_node()
213 unsafe fn find_key_index<Q: ?Sized>(&self, key: &Q, start_index: usize) -> IndexResult in find_key_index()
241 Q: ?Sized + Ord, in find_lower_bound_index()
269 Q: ?Sized + Ord, in find_upper_bound_index()
|
| /aosp_15_r20/prebuilts/rust/linux-x86/1.81.0/lib/rustlib/src/rust/library/alloc/src/collections/btree/ |
| H A D | set.rs | 395 K: Ord, in range()
396 T: Borrow<K> + Ord, in range()
425 T: Ord, in difference()
489 T: Ord, in symmetric_difference()
517 T: Ord, in intersection()
568 T: Ord, in union()
611 T: Borrow<Q> + Ord, in contains()
612 Q: Ord, in contains()
636 T: Borrow<Q> + Ord, in get()
637 Q: Ord, in get()
[all …]
|
| H A D | map.rs | 698 K: Borrow<Q> + Ord, in get()
699 Q: Ord, in get()
726 K: Borrow<Q> + Ord, in get_key_value()
727 Q: Ord, in get_key_value()
753 K: Ord, in first_key_value()
781 K: Ord, in first_entry()
815 K: Ord, in pop_first()
836 K: Ord, in last_key_value()
864 K: Ord, in last_entry()
898 K: Ord, in pop_last()
[all …]
|
| H A D | search.rs | 51 ) -> SearchResult<BorrowType, K, V, marker::LeafOrInternal, marker::Leaf> in search_tree()
96 Q: Ord, in search_tree_for_bifurcation()
163 Q: ?Sized + Ord, in find_lower_bound_edge()
177 Q: ?Sized + Ord, in find_upper_bound_edge()
196 Q: Ord, in search_node()
213 unsafe fn find_key_index<Q: ?Sized>(&self, key: &Q, start_index: usize) -> IndexResult in find_key_index()
241 Q: ?Sized + Ord, in find_lower_bound_index()
269 Q: ?Sized + Ord, in find_upper_bound_index()
|
| /aosp_15_r20/prebuilts/rust/linux-x86/1.81.0.u1/lib/rustlib/src/rust/library/alloc/src/collections/btree/ |
| H A D | set.rs | 395 K: Ord, in range()
396 T: Borrow<K> + Ord, in range()
425 T: Ord, in difference()
489 T: Ord, in symmetric_difference()
517 T: Ord, in intersection()
568 T: Ord, in union()
611 T: Borrow<Q> + Ord, in contains()
612 Q: Ord, in contains()
636 T: Borrow<Q> + Ord, in get()
637 Q: Ord, in get()
[all …]
|
| H A D | map.rs | 698 K: Borrow<Q> + Ord, in get()
699 Q: Ord, in get()
726 K: Borrow<Q> + Ord, in get_key_value()
727 Q: Ord, in get_key_value()
753 K: Ord, in first_key_value()
781 K: Ord, in first_entry()
815 K: Ord, in pop_first()
836 K: Ord, in last_key_value()
864 K: Ord, in last_entry()
898 K: Ord, in pop_last()
[all …]
|
| H A D | search.rs | 51 ) -> SearchResult<BorrowType, K, V, marker::LeafOrInternal, marker::Leaf> in search_tree()
96 Q: Ord, in search_tree_for_bifurcation()
163 Q: ?Sized + Ord, in find_lower_bound_edge()
177 Q: ?Sized + Ord, in find_upper_bound_edge()
196 Q: Ord, in search_node()
213 unsafe fn find_key_index<Q: ?Sized>(&self, key: &Q, start_index: usize) -> IndexResult in find_key_index()
241 Q: ?Sized + Ord, in find_lower_bound_index()
269 Q: ?Sized + Ord, in find_upper_bound_index()
|
| /aosp_15_r20/prebuilts/rust/linux-musl-x86/1.81.0/lib/rustlib/src/rust/library/core/src/ |
| H A D | cmp.rs | 821 pub trait Ord: Eq + PartialOrd<Self> { trait
1405 pub fn minmax<T>(v1: T, v2: T) -> [T; 2] in minmax()
1464 K: Ord,
1573 impl Ord for $t { impl
1583 impl Ord for () { implementation
1645 impl Ord for ! { implementation
1695 impl<A: ?Sized> Ord for &A impl
1750 impl<A: ?Sized> Ord for &mut A impl
|
| /aosp_15_r20/prebuilts/rust/linux-x86/1.81.0.u1/lib/rustlib/src/rust/library/core/src/ |
| H A D | cmp.rs | 821 pub trait Ord: Eq + PartialOrd<Self> { trait
1405 pub fn minmax<T>(v1: T, v2: T) -> [T; 2] in minmax()
1464 K: Ord,
1573 impl Ord for $t { impl
1583 impl Ord for () { impl
1645 impl Ord for ! { implementation
1695 impl<A: ?Sized> Ord for &A impl
1750 impl<A: ?Sized> Ord for &mut A impl
|
| /aosp_15_r20/prebuilts/rust/linux-x86/1.81.0/lib/rustlib/src/rust/library/core/src/ |
| H A D | cmp.rs | 821 pub trait Ord: Eq + PartialOrd<Self> { trait
1405 pub fn minmax<T>(v1: T, v2: T) -> [T; 2] in minmax()
1464 K: Ord,
1573 impl Ord for $t { impl
1583 impl Ord for () { impl
1645 impl Ord for ! { implementation
1695 impl<A: ?Sized> Ord for &A impl
1750 impl<A: ?Sized> Ord for &mut A impl
|
| /aosp_15_r20/prebuilts/rust/linux-musl-x86/1.80.1/lib/rustlib/src/rust/library/core/src/ |
| H A D | cmp.rs | 822 pub trait Ord: Eq + PartialOrd<Self> { trait
1406 pub fn minmax<T>(v1: T, v2: T) -> [T; 2] in minmax()
1465 K: Ord,
1575 impl Ord for $t { impl
1585 impl Ord for () { impl
1647 impl Ord for ! { impl
1697 impl<A: ?Sized> Ord for &A impl
1752 impl<A: ?Sized> Ord for &mut A impl
|
| /aosp_15_r20/prebuilts/rust/linux-x86/1.80.1/lib/rustlib/src/rust/library/core/src/ |
| H A D | cmp.rs | 822 pub trait Ord: Eq + PartialOrd<Self> { interface
1406 pub fn minmax<T>(v1: T, v2: T) -> [T; 2] in minmax()
1465 K: Ord,
1575 impl Ord for $t { impl
1585 impl Ord for () { impl
1647 impl Ord for ! { impl
1697 impl<A: ?Sized> Ord for &A impl
1752 impl<A: ?Sized> Ord for &mut A impl
|
| /aosp_15_r20/external/cronet/third_party/rust/chromium_crates_io/vendor/itertools-0.11.0/src/ |
| H A D | grouping_map.rs | 236 where V: Ord, in max()
290 CK: Ord, in max_by_key()
314 where V: Ord, in min()
368 CK: Ord, in min_by_key()
401 where V: Ord, in minmax()
481 CK: Ord, in minmax_by_key()
|
| H A D | lib.rs | 2670 Self::Item: Ord in sorted_unstable()
2742 K: Ord, in sorted_unstable_by_key()
2772 Self::Item: Ord in sorted()
2844 K: Ord, in sorted_by_key()
2882 K: Ord, in sorted_by_cached_key()
2920 Self::Item: Ord in k_smallest()
3111 where Self: Sized, Self::Item: Ord in min_set()
3176 where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K in min_set_by_key() argument
3205 where Self: Sized, Self::Item: Ord in max_set()
3270 where Self: Sized, K: Ord, F: FnMut(&Self::Item) -> K in max_set_by_key() argument
[all …]
|
| /aosp_15_r20/external/rust/android-crates-io/crates/itertools/src/ |
| D | grouping_map.rs | 305 V: Ord, in max()
361 CK: Ord, in max_by_key()
386 V: Ord, in min()
442 CK: Ord, in min_by_key()
474 pub fn minmax(self) -> HashMap<K, MinMaxResult<V>> in minmax()
558 CK: Ord, in minmax_by_key()
|
| D | lib.rs | 2766 Self::Item: Ord, in sorted_unstable()
2840 K: Ord, in sorted_unstable_by_key()
2871 Self::Item: Ord, in sorted()
2945 K: Ord, in sorted_by_key()
2983 K: Ord, in sorted_by_cached_key()
3022 Self::Item: Ord, in k_smallest()
3113 K: Ord, in k_smallest_by_key()
3144 Self::Item: Ord, in k_largest()
3203 K: Ord, in k_largest_by_key()
3459 Self::Item: Ord, in min_set()
[all …]
|
| D | free.rs | 240 I::Item: Ord, in max()
257 I::Item: Ord, in min()
294 I::Item: Ord, in sorted()
314 I::Item: Ord, in sorted_unstable()
|