[−][src]Struct abin::SBin
A binary that does implement Send + Sync
. See AnyBin
for documentation; see Bin
if you don't need Send + Sync
. See BinFactory
on how to create binaries.
use abin::{NewSBin, SBin, BinFactory, AnyBin}; let bin : SBin = NewSBin::from_static("Hello, I'm a binary!".as_bytes()); assert_eq!("Hello, I'm a binary!".as_bytes(), bin.as_slice());
Trait Implementations
impl AnyBin for SBin
[src]
fn as_slice(&self) -> &[u8]
[src]
fn into_vec(self) -> Vec<u8>
[src]
fn len(&self) -> usize
[src]
fn is_empty(&self) -> bool
[src]
fn slice<TRange>(&self, range: TRange) -> Option<Self> where
TRange: RangeBounds<usize>,
[src]
TRange: RangeBounds<usize>,
fn try_to_re_integrate(&self, slice: &[u8]) -> Option<Self>
[src]
impl AsRef<[u8]> for SBin
[src]
impl BooToOwned<[u8], SBin> for NewSBin
[src]
impl Borrow<[u8]> for SBin
[src]
impl Clone for SBin
[src]
fn clone(&self) -> Self
[src]
fn clone_from(&mut self, source: &Self)
1.0.0[src]
impl Debug for SBin
[src]
impl Deref for SBin
[src]
impl Eq for SBin
[src]
impl Hash for SBin
[src]
fn hash<H: Hasher>(&self, state: &mut H)
[src]
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0[src]
H: Hasher,
impl Into<Bin> for SBin
[src]
Returns the un-synchronized view of this binary. (so it's the same as IntoUnSyncView
;
NOT IntoUnSync
).
impl Into<Vec<u8>> for SBin
[src]
impl<'a> IntoIterator for &'a SBin
[src]
type Item = &'a u8
The type of the elements being iterated over.
type IntoIter = Iter<'a, u8>
Which kind of iterator are we turning this into?
fn into_iter(self) -> Self::IntoIter
[src]
impl IntoIterator for SBin
[src]
type Item = u8
The type of the elements being iterated over.
type IntoIter = IntoIter<SBin>
Which kind of iterator are we turning this into?
fn into_iter(self) -> Self::IntoIter
[src]
impl IntoSync for SBin
[src]
This is a no-op (it's already sync).
impl IntoUnSync for SBin
[src]
type Target = Bin
fn un_sync_convert(self) -> Self::Target
[src]
impl IntoUnSyncView for SBin
[src]
Returns the un-synchronized view of this binary.
impl LowerHex for SBin
[src]
impl Ord for SBin
[src]
fn cmp(&self, other: &Self) -> Ordering
[src]
#[must_use]fn max(self, other: Self) -> Self
1.21.0[src]
#[must_use]fn min(self, other: Self) -> Self
1.21.0[src]
#[must_use]fn clamp(self, min: Self, max: Self) -> Self
[src]
impl PartialEq<SBin> for SBin
[src]
impl PartialOrd<SBin> for SBin
[src]
fn partial_cmp(&self, other: &Self) -> Option<Ordering>
[src]
#[must_use]fn lt(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]fn le(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]fn gt(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]fn ge(&self, other: &Rhs) -> bool
1.0.0[src]
impl Send for SBin
[src]
impl Sync for SBin
[src]
impl UnSyncRef for SBin
[src]
type Target = Bin
fn un_sync_ref(&self) -> &Self::Target
[src]
impl UpperHex for SBin
[src]
Auto Trait Implementations
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<I> IntoIterator for I where
I: Iterator,
[src]
I: Iterator,
type Item = <I as Iterator>::Item
The type of the elements being iterated over.
type IntoIter = I
Which kind of iterator are we turning this into?
fn into_iter(self) -> I
[src]
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
fn to_owned(&self) -> T
[src]
fn clone_into(&self, target: &mut T)
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,