liballoc: apply uniform_paths.

3 files changed, 8 insertions, 7 deletions

diff --git a/src/liballoc/collections/btree/map.rs b/src/liballoc/collections/btree/map.rs
index b1a5fcbe6b6..d0e35c557a4 100644
--- a/src/liballoc/collections/btree/map.rs
+++ b/src/liballoc/collections/btree/map.rs
@@ -17,7 +17,8 @@ use super::{
     search::{self, SearchResult::*},
 };
 
-use self::{UnderflowResult::*, Entry::*};
+use UnderflowResult::*;
+use Entry::*;
 
 /// A map based on a B-Tree.
 ///
diff --git a/src/liballoc/collections/btree/search.rs b/src/liballoc/collections/btree/search.rs
index 23c41b4dd4c..1645e48cb52 100644
--- a/src/liballoc/collections/btree/search.rs
+++ b/src/liballoc/collections/btree/search.rs
@@ -5,7 +5,7 @@ use core::{
 
 use super::node::{Handle, NodeRef, marker, ForceResult::*};
 
-use self::SearchResult::*;
+use SearchResult::*;
 
 pub enum SearchResult<BorrowType, K, V, FoundType, GoDownType> {
     Found(Handle<NodeRef<BorrowType, K, V, FoundType>, marker::KV>),
diff --git a/src/liballoc/collections/mod.rs b/src/liballoc/collections/mod.rs
index 5f3f8493730..5a33ddc14f0 100644
--- a/src/liballoc/collections/mod.rs
+++ b/src/liballoc/collections/mod.rs
@@ -23,23 +23,23 @@ pub mod btree_set {
 
 #[stable(feature = "rust1", since = "1.0.0")]
 #[doc(no_inline)]
-pub use self::binary_heap::BinaryHeap;
+pub use binary_heap::BinaryHeap;
 
 #[stable(feature = "rust1", since = "1.0.0")]
 #[doc(no_inline)]
-pub use self::btree_map::BTreeMap;
+pub use btree_map::BTreeMap;
 
 #[stable(feature = "rust1", since = "1.0.0")]
 #[doc(no_inline)]
-pub use self::btree_set::BTreeSet;
+pub use btree_set::BTreeSet;
 
 #[stable(feature = "rust1", since = "1.0.0")]
 #[doc(no_inline)]
-pub use self::linked_list::LinkedList;
+pub use linked_list::LinkedList;
 
 #[stable(feature = "rust1", since = "1.0.0")]
 #[doc(no_inline)]
-pub use self::vec_deque::VecDeque;
+pub use vec_deque::VecDeque;
 
 use crate::alloc::{AllocErr, LayoutErr};