diff options
| author | Simon Sapin <simon.sapin@exyr.org> | 2018-03-19 09:01:17 +0100 |
|---|---|---|
| committer | Manish Goregaokar <manishsmail@gmail.com> | 2018-03-29 13:12:49 +0200 |
| commit | c3a63970dee2422e2fcc79d8b99303b4b046f444 (patch) | |
| tree | f8cdc9df5af3d6f06bac1650ac7df2bbe549b7f3 /src/liballoc/btree | |
| parent | 409744bcb91f4efa35b8fcc9e7033523a86b90c2 (diff) | |
| download | rust-c3a63970dee2422e2fcc79d8b99303b4b046f444.tar.gz rust-c3a63970dee2422e2fcc79d8b99303b4b046f444.zip | |
Move alloc::Bound to {core,std}::ops
The stable reexport `std::collections::Bound` is now deprecated. Another deprecated reexport could be added in `alloc`, but that crate is unstable.
Diffstat (limited to 'src/liballoc/btree')
| -rw-r--r-- | src/liballoc/btree/map.rs | 4 | ||||
| -rw-r--r-- | src/liballoc/btree/set.rs | 2 |
2 files changed, 3 insertions, 3 deletions
diff --git a/src/liballoc/btree/map.rs b/src/liballoc/btree/map.rs index cada190032a..2ba56063e36 100644 --- a/src/liballoc/btree/map.rs +++ b/src/liballoc/btree/map.rs @@ -13,11 +13,11 @@ use core::fmt::Debug; use core::hash::{Hash, Hasher}; use core::iter::{FromIterator, Peekable, FusedIterator}; use core::marker::PhantomData; +use core::ops::Bound::{Excluded, Included, Unbounded}; use core::ops::Index; use core::{fmt, intrinsics, mem, ptr}; use borrow::Borrow; -use Bound::{Excluded, Included, Unbounded}; use range::RangeArgument; use super::node::{self, Handle, NodeRef, marker}; @@ -804,7 +804,7 @@ impl<K: Ord, V> BTreeMap<K, V> { /// /// ``` /// use std::collections::BTreeMap; - /// use std::collections::Bound::Included; + /// use std::ops::Bound::Included; /// /// let mut map = BTreeMap::new(); /// map.insert(3, "a"); diff --git a/src/liballoc/btree/set.rs b/src/liballoc/btree/set.rs index 2e3157147a0..d488dd6cbbd 100644 --- a/src/liballoc/btree/set.rs +++ b/src/liballoc/btree/set.rs @@ -240,7 +240,7 @@ impl<T: Ord> BTreeSet<T> { /// /// ``` /// use std::collections::BTreeSet; - /// use std::collections::Bound::Included; + /// use std::ops::Bound::Included; /// /// let mut set = BTreeSet::new(); /// set.insert(3); |
