Enum switchboard_solana::prelude::borsh::maybestd::collections::Bound
1.17.0 · source · pub enum Bound<T> {
Included(T),
Excluded(T),
Unbounded,
}
Expand description
An endpoint of a range of keys.
§Examples
Bound
s are range endpoints:
use std::ops::Bound::*;
use std::ops::RangeBounds;
assert_eq!((..100).start_bound(), Unbounded);
assert_eq!((1..12).start_bound(), Included(&1));
assert_eq!((1..12).end_bound(), Excluded(&12));
Using a tuple of Bound
s as an argument to BTreeMap::range
.
Note that in most cases, it’s better to use range syntax (1..5
) instead.
use std::collections::BTreeMap;
use std::ops::Bound::{Excluded, Included, Unbounded};
let mut map = BTreeMap::new();
map.insert(3, "a");
map.insert(5, "b");
map.insert(8, "c");
for (key, value) in map.range((Excluded(3), Included(8))) {
println!("{key}: {value}");
}
assert_eq!(Some((&3, &"a")), map.range((Unbounded, Included(5))).next());
Variants§
Included(T)
An inclusive bound.
Excluded(T)
An exclusive bound.
Unbounded
An infinite endpoint. Indicates that there is no bound in this direction.
Implementations§
source§impl<T> Bound<T>
impl<T> Bound<T>
sourcepub fn as_mut(&mut self) -> Bound<&mut T>
🔬This is a nightly-only experimental API. (bound_as_ref
)
pub fn as_mut(&mut self) -> Bound<&mut T>
bound_as_ref
)Converts from &mut Bound<T>
to Bound<&mut T>
.
1.77.0 · sourcepub fn map<U, F>(self, f: F) -> Bound<U>where
F: FnOnce(T) -> U,
pub fn map<U, F>(self, f: F) -> Bound<U>where
F: FnOnce(T) -> U,
Maps a Bound<T>
to a Bound<U>
by applying a function to the contained value (including
both Included
and Excluded
), returning a Bound
of the same kind.
§Examples
use std::ops::Bound::*;
let bound_string = Included("Hello, World!");
assert_eq!(bound_string.map(|s| s.len()), Included(13));
use std::ops::Bound;
use Bound::*;
let unbounded_string: Bound<String> = Unbounded;
assert_eq!(unbounded_string.map(|s| s.len()), Unbounded);
Trait Implementations§
source§impl<'de, T> Deserialize<'de> for Bound<T>where
T: Deserialize<'de>,
impl<'de, T> Deserialize<'de> for Bound<T>where
T: Deserialize<'de>,
source§fn deserialize<D>(
deserializer: D
) -> Result<Bound<T>, <D as Deserializer<'de>>::Error>where
D: Deserializer<'de>,
fn deserialize<D>(
deserializer: D
) -> Result<Bound<T>, <D as Deserializer<'de>>::Error>where
D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
source§impl<T> PartialEq for Bound<T>where
T: PartialEq,
impl<T> PartialEq for Bound<T>where
T: PartialEq,
source§impl<T> Serialize for Bound<T>where
T: Serialize,
impl<T> Serialize for Bound<T>where
T: Serialize,
source§fn serialize<S>(
&self,
serializer: S
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>where
S: Serializer,
fn serialize<S>(
&self,
serializer: S
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>where
S: Serializer,
Serialize this value into the given Serde serializer. Read more
impl<T> Copy for Bound<T>where
T: Copy,
impl<T> Eq for Bound<T>where
T: Eq,
impl<T> StructuralPartialEq for Bound<T>
Auto Trait Implementations§
impl<T> RefUnwindSafe for Bound<T>where
T: RefUnwindSafe,
impl<T> Send for Bound<T>where
T: Send,
impl<T> Sync for Bound<T>where
T: Sync,
impl<T> Unpin for Bound<T>where
T: Unpin,
impl<T> UnwindSafe for Bound<T>where
T: UnwindSafe,
Blanket Implementations§
§impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
§impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.