diff options
| author | toidiu <apoorv@toidiu.com> | 2018-05-17 17:42:02 -0400 |
|---|---|---|
| committer | toidiu <apoorv@toidiu.com> | 2018-05-24 00:01:35 -0400 |
| commit | 9a8400c3ffddfe642608c79b2f65b01d7416db2b (patch) | |
| tree | d954afa48e781965f56f4db8f0d19c2a89448d09 /src/librustc_data_structures | |
| parent | 1977849257436cf74a3bbee94ca2860896853b81 (diff) | |
| download | rust-9a8400c3ffddfe642608c79b2f65b01d7416db2b.tar.gz rust-9a8400c3ffddfe642608c79b2f65b01d7416db2b.zip | |
implement Ord for OutlivesPredicate and other types
Diffstat (limited to 'src/librustc_data_structures')
| -rw-r--r-- | src/librustc_data_structures/sorted_map.rs | 3 |
1 files changed, 2 insertions, 1 deletions
diff --git a/src/librustc_data_structures/sorted_map.rs b/src/librustc_data_structures/sorted_map.rs index e14bd33c82c..9f1a795b350 100644 --- a/src/librustc_data_structures/sorted_map.rs +++ b/src/librustc_data_structures/sorted_map.rs @@ -22,7 +22,8 @@ use std::ops::{RangeBounds, Bound, Index, IndexMut}; /// stores data in a more compact way. It also supports accessing contiguous /// ranges of elements as a slice, and slices of already sorted elements can be /// inserted efficiently. -#[derive(Clone, PartialEq, Eq, Hash, Default, Debug, RustcEncodable, RustcDecodable)] +#[derive(Clone, PartialEq, Eq, PartialOrd, Ord, Hash, Default, Debug, RustcEncodable, + RustcDecodable)] pub struct SortedMap<K: Ord, V> { data: Vec<(K,V)> } |