Stabilize const for integer {to,from}_{be,le,ne}_bytes methods

[rust.git] / src / librustc_data_structures / sorted_map.rs

diff --git a/src/librustc_data_structures/sorted_map.rs b/src/librustc_data_structures/sorted_map.rs
index b29ffd7594008097edf5dc587ecfa6a38e2600a7..8c42b74b85aef4f0c35a45936ae639c785f52d7d 100644 (file)
--- a/src/librustc_data_structures/sorted_map.rs
+++ b/src/librustc_data_structures/sorted_map.rs
@@ -4,6 +4,10 @@
 use std::mem;
 use std::ops::{Bound, Index, IndexMut, RangeBounds};
 
+mod index_map;
+
+pub use index_map::SortedIndexMultiMap;
+
 /// `SortedMap` is a data structure with similar characteristics as BTreeMap but
 /// slightly different trade-offs: lookup, insertion, and removal are O(log(N))
 /// and elements can be iterated in order cheaply.
@@ -132,7 +136,7 @@ pub fn range<R>(&self, range: R) -> &[(K, V)]
         R: RangeBounds<K>,
     {
         let (start, end) = self.range_slice_indices(range);
-        (&self.data[start..end])
+        &self.data[start..end]
     }
 
     #[inline]