Struct by::ByteStr [−][src]
Borrowed reference to a byte string. It provides similar functionality as str
and [u8]
.
Implementations
impl ByteStr
[src]
pub fn empty<'a>() -> &'a Self
[src]
Creates an empty ByteStr
.
pub fn empty_mut<'a>() -> &'a mut Self
[src]
Creates an empty mutable ByteStr
.
pub fn from_slice(bytes: &[u8]) -> &Self
[src]
Creates a ByteStr
from a byte slice.
pub fn from_slice_mut(bytes: &mut [u8]) -> &mut Self
[src]
Create a mutable ByteStr
from a byte slice.
pub unsafe fn from_raw_parts<'a>(ptr: *const u8, len: usize) -> &'a Self
[src]
Forms a ByteStr
from a pointer and a length.
pub unsafe fn from_raw_parts_mut<'a>(ptr: *mut u8, len: usize) -> &'a mut Self
[src]
Forms a mutable ByteStr
from a pointer and a length.
pub fn as_slice(&self) -> &[u8]
[src]
Converts self
into a byte slice.
pub fn as_mut_slice(&mut self) -> &mut [u8]
[src]
Converts self
into a mutable byte slice.
pub fn to_vec(&self) -> Vec<u8>
[src]
Copies the self
into a Vec
.
pub fn to_byte_string(&self) -> ByteString
[src]
Copies the self
into a ByteString
.
pub fn into_boxed_slice(self: Box<Self>) -> Box<[u8]>
[src]
Converts self
into a boxed slice without clones or allocation.
pub fn into_vec(self: Box<Self>) -> Vec<u8>
[src]
Converts self
into a vector without clones or allocation.
pub fn into_byte_string(self: Box<Self>) -> ByteString
[src]
Converts self
into a ByteString
without clones or allocation.
pub fn len(&self) -> usize
[src]
Returns the length of self
.
pub fn is_empty(&self) -> bool
[src]
Returns true
if the length of self
is zero.
pub fn as_ptr(&self) -> *const u8
[src]
Converts self
into a raw pointer that points to the first byte of the string.
pub fn as_mut_ptr(&mut self) -> *mut u8
[src]
Converts self
into a mutable raw pointer that points to the first byte of the string.
pub fn get(&self, index: usize) -> Option<&u8>
[src]
Returns a reference to an element of the slice, or None
if the
index is out of bounds.
pub fn get_mut(&mut self, index: usize) -> Option<&mut u8>
[src]
Returns a mutable reference to an element of the slice, or None
if the
index is out of bounds.
pub fn first(&self) -> Option<&u8>
[src]
Returns a reference to the first byte of the string, or None
if it is empty.
pub fn first_mut(&mut self) -> Option<&mut u8>
[src]
Returns a mutable reference to the first byte of the string, or None
if it is empty.
pub fn last(&self) -> Option<&u8>
[src]
Returns a reference to the last byte of the string, or None
if it is empty.
pub fn last_mut(&mut self) -> Option<&mut u8>
[src]
Returns a mutable reference to the last byte of the string, or None
if it is empty.
pub fn split_first(&self) -> Option<(&u8, &ByteStr)>
[src]
Returns the first and all the rest of the bytes of the slice, or None
if it is empty.
pub fn split_first_mut(&mut self) -> Option<(&mut u8, &mut ByteStr)>
[src]
Returns the first and all the rest of the bytes of the slice, or None
if it is empty.
pub fn split_last(&self) -> Option<(&u8, &ByteStr)>
[src]
Returns the last and all the rest of the bytes of the slice, or None
if it is empty.
pub fn split_last_mut(&mut self) -> Option<(&mut u8, &mut ByteStr)>
[src]
Returns the last and all the rest of the bytes of the slice, or None
if it is empty.
pub fn iter<'a>(&'a self) -> Iter<'a, u8>
[src]
Returns an iterator over the string.
pub fn iter_mut<'a>(&'a mut self) -> IterMut<'a, u8>
[src]
Returns an iterator that allows modifying each value.
pub fn windows<'a>(&'a self, size: usize) -> Windows<'a>ⓘ
[src]
Returns an iterator over all contiguous windows of length size
.
The windows overlap. If the string is shorter than size
, the
iterator returns no values.
Similar to slice::windows()
.
pub fn chunks<'a>(&'a self, size: usize) -> Chunks<'a>ⓘ
[src]
Returns an iterator over size
bytes of the string at a time. The chunks do not
overlap. If size does not divide the length of the slice, then the last chunk will
not have length size
.
Similar to slice::chunks()
.
pub fn chunks_mut<'a>(&'a mut self, size: usize) -> ChunksMut<'a>ⓘ
[src]
Returns an iterator over size
elements of the slice at a time. The chunks are mutable
strings and do not overlap. If size
does not divide the length of the slice, then the
last chunk will not have length size
.
Similar to slice::chunks_mut()
.
pub fn split_at(&self, mid: usize) -> (&ByteStr, &ByteStr)
[src]
Divides one string into two at an index.
The first will contain all indices from [0, mid)
(excluding the index mid
itself) and
the second will contain all indices from [mid, len)
(excluding the index len
itself).
Similar to slice::split_at()
.
Panics
Panics if mid > len
.
pub fn split_at_mut(&mut self, mid: usize) -> (&mut ByteStr, &mut ByteStr)
[src]
Divides one &mut
string into two at an index.
The first will contain all indices from [0, mid)
(excluding the index mid
itself) and
the second will contain all indices from [mid, len)
(excluding the index len
itself).
Similar to slice::split_at_mut()
.
Panics
Panics if mid > len
.
pub fn split<'a, M: IntoMatcher>(&'a self, m: M) -> Split<'a, M::Matcher>ⓘ where
<M as IntoMatcher>::Matcher: ForwardSearcher,
[src]
<M as IntoMatcher>::Matcher: ForwardSearcher,
Returns an iterator over substrings of this string, separated by a matcher.
pub fn split_mut<'a, M: IntoMatcher>(
&'a mut self,
m: M
) -> SplitMut<'a, M::Matcher>ⓘ where
<M as IntoMatcher>::Matcher: ForwardSearcher,
[src]
&'a mut self,
m: M
) -> SplitMut<'a, M::Matcher>ⓘ where
<M as IntoMatcher>::Matcher: ForwardSearcher,
Returns an iterator over mutable substrings of this string, separated by a matcher.
pub fn rsplit<'a, M: IntoMatcher>(&'a self, m: M) -> RSplit<'a, M::Matcher>ⓘ where
<M as IntoMatcher>::Matcher: ReverseSearcher,
[src]
<M as IntoMatcher>::Matcher: ReverseSearcher,
Returns an iterator over substrings of this string, separated by a matcher, starting at the end of the slice and working backwards.
pub fn rsplit_mut<'a, M: IntoMatcher>(
&'a mut self,
m: M
) -> RSplitMut<'a, M::Matcher>ⓘ where
<M as IntoMatcher>::Matcher: ReverseSearcher,
[src]
&'a mut self,
m: M
) -> RSplitMut<'a, M::Matcher>ⓘ where
<M as IntoMatcher>::Matcher: ReverseSearcher,
Returns an iterator over mutable substrings of this string, separated by a matcher, starting at the end of the slice and working backwards.
pub fn splitn<'a, M: IntoMatcher>(
&'a self,
n: usize,
m: M
) -> SplitN<'a, M::Matcher>ⓘ where
<M as IntoMatcher>::Matcher: ForwardSearcher,
[src]
&'a self,
n: usize,
m: M
) -> SplitN<'a, M::Matcher>ⓘ where
<M as IntoMatcher>::Matcher: ForwardSearcher,
Returns an iterator over substrings of this string, separated by a matcher, returning
at most n
items.
If n
substrings are returned, the last substring will contain the remainder of the string.
pub fn splitn_mut<'a, M: IntoMatcher>(
&'a mut self,
n: usize,
m: M
) -> SplitNMut<'a, M::Matcher>ⓘ where
<M as IntoMatcher>::Matcher: ForwardSearcher,
[src]
&'a mut self,
n: usize,
m: M
) -> SplitNMut<'a, M::Matcher>ⓘ where
<M as IntoMatcher>::Matcher: ForwardSearcher,
Returns an iterator over mutable substrings of this string, separated by a matcher, returning
at most n
items.
If n
substrings are returned, the last substring will contain the remainder of the string.
pub fn rsplitn<'a, M: IntoMatcher>(
&'a self,
n: usize,
m: M
) -> RSplitN<'a, M::Matcher>ⓘ where
<M as IntoMatcher>::Matcher: ReverseSearcher,
[src]
&'a self,
n: usize,
m: M
) -> RSplitN<'a, M::Matcher>ⓘ where
<M as IntoMatcher>::Matcher: ReverseSearcher,
Returns an iterator over substrings of this string, separated by a matcher and stating from
the end of the string, returning at most n
items.
If n
substrings are returned, the last substring will contain the remainder of the string.
pub fn rsplitn_mut<'a, M: IntoMatcher>(
&'a mut self,
n: usize,
m: M
) -> RSplitNMut<'a, M::Matcher>ⓘNotable traits for RSplitNMut<'a, M>
impl<'a, M: ReverseSearcher> Iterator for RSplitNMut<'a, M> type Item = &'a mut ByteStr;
where
<M as IntoMatcher>::Matcher: ReverseSearcher,
[src]
&'a mut self,
n: usize,
m: M
) -> RSplitNMut<'a, M::Matcher>ⓘ
Notable traits for RSplitNMut<'a, M>
impl<'a, M: ReverseSearcher> Iterator for RSplitNMut<'a, M> type Item = &'a mut ByteStr;
<M as IntoMatcher>::Matcher: ReverseSearcher,
Returns an iterator over mutable substrings of this string, separated by a matcher and stating from
the end of the string, returning at most n
items.
If n
substrings are returned, the last substring will contain the remainder of the string.
pub fn matches<'a, M: IntoMatcher>(&'a self, m: M) -> Matches<'a, M::Matcher>ⓘ where
<M as IntoMatcher>::Matcher: ForwardSearcher,
[src]
<M as IntoMatcher>::Matcher: ForwardSearcher,
Returns an iterator over the disjoint matches within the given string.
pub fn matches_mut<'a, M: IntoMatcher>(
&'a mut self,
m: M
) -> MatchesMut<'a, M::Matcher>ⓘNotable traits for MatchesMut<'a, M>
impl<'a, M: ForwardSearcher> Iterator for MatchesMut<'a, M> type Item = &'a mut ByteStr;
where
<M as IntoMatcher>::Matcher: ForwardSearcher,
[src]
&'a mut self,
m: M
) -> MatchesMut<'a, M::Matcher>ⓘ
Notable traits for MatchesMut<'a, M>
impl<'a, M: ForwardSearcher> Iterator for MatchesMut<'a, M> type Item = &'a mut ByteStr;
<M as IntoMatcher>::Matcher: ForwardSearcher,
Returns an iterator over the mutable disjoint matches within the given string.
pub fn rmatches<'a, M: IntoMatcher>(&'a self, m: M) -> RMatches<'a, M::Matcher>ⓘ where
<M as IntoMatcher>::Matcher: ReverseSearcher,
[src]
<M as IntoMatcher>::Matcher: ReverseSearcher,
Returns an iterator over the disjoint matches within the given string, yielded in reverse order.
pub fn rmatches_mut<'a, M: IntoMatcher>(
&'a mut self,
m: M
) -> RMatchesMut<'a, M::Matcher>ⓘNotable traits for RMatchesMut<'a, M>
impl<'a, M: ReverseSearcher> Iterator for RMatchesMut<'a, M> type Item = &'a mut ByteStr;
where
<M as IntoMatcher>::Matcher: ReverseSearcher,
[src]
&'a mut self,
m: M
) -> RMatchesMut<'a, M::Matcher>ⓘ
Notable traits for RMatchesMut<'a, M>
impl<'a, M: ReverseSearcher> Iterator for RMatchesMut<'a, M> type Item = &'a mut ByteStr;
<M as IntoMatcher>::Matcher: ReverseSearcher,
Returns an iterator over the mutable disjoint matches within the given string, yielded in reverse order.
pub fn match_indices<'a, M: IntoMatcher>(
&'a self,
m: M
) -> MatchIndices<'a, M::Matcher>ⓘNotable traits for MatchIndices<'a, M>
impl<'a, M: ForwardSearcher> Iterator for MatchIndices<'a, M> type Item = (usize, &'a ByteStr);
where
<M as IntoMatcher>::Matcher: ForwardSearcher,
[src]
&'a self,
m: M
) -> MatchIndices<'a, M::Matcher>ⓘ
Notable traits for MatchIndices<'a, M>
impl<'a, M: ForwardSearcher> Iterator for MatchIndices<'a, M> type Item = (usize, &'a ByteStr);
<M as IntoMatcher>::Matcher: ForwardSearcher,
Returns an iterator over the disjoint matches within the given string, as well as the index that the match starts at.
pub fn match_indices_mut<'a, M: IntoMatcher>(
&'a mut self,
m: M
) -> MatchIndicesMut<'a, M::Matcher>ⓘNotable traits for MatchIndicesMut<'a, M>
impl<'a, M: ForwardSearcher> Iterator for MatchIndicesMut<'a, M> type Item = (usize, &'a mut ByteStr);
where
<M as IntoMatcher>::Matcher: ForwardSearcher,
[src]
&'a mut self,
m: M
) -> MatchIndicesMut<'a, M::Matcher>ⓘ
Notable traits for MatchIndicesMut<'a, M>
impl<'a, M: ForwardSearcher> Iterator for MatchIndicesMut<'a, M> type Item = (usize, &'a mut ByteStr);
<M as IntoMatcher>::Matcher: ForwardSearcher,
Returns an iterator over the mutable disjoint matches within the given string, as well as the index that the match starts at.
pub fn rmatch_indices<'a, M: IntoMatcher>(
&'a self,
m: M
) -> RMatchIndices<'a, M::Matcher>ⓘNotable traits for RMatchIndices<'a, M>
impl<'a, M: ReverseSearcher> Iterator for RMatchIndices<'a, M> type Item = (usize, &'a ByteStr);
where
<M as IntoMatcher>::Matcher: ReverseSearcher,
[src]
&'a self,
m: M
) -> RMatchIndices<'a, M::Matcher>ⓘ
Notable traits for RMatchIndices<'a, M>
impl<'a, M: ReverseSearcher> Iterator for RMatchIndices<'a, M> type Item = (usize, &'a ByteStr);
<M as IntoMatcher>::Matcher: ReverseSearcher,
Returns an iterator over the disjoint matches within the given string, yielded in reverse order, as well as the index that the match starts at.
pub fn rmatch_indices_mut<'a, M: IntoMatcher>(
&'a mut self,
m: M
) -> RMatchIndicesMut<'a, M::Matcher>ⓘNotable traits for RMatchIndicesMut<'a, M>
impl<'a, M: ReverseSearcher> Iterator for RMatchIndicesMut<'a, M> type Item = (usize, &'a mut ByteStr);
where
<M as IntoMatcher>::Matcher: ReverseSearcher,
[src]
&'a mut self,
m: M
) -> RMatchIndicesMut<'a, M::Matcher>ⓘ
Notable traits for RMatchIndicesMut<'a, M>
impl<'a, M: ReverseSearcher> Iterator for RMatchIndicesMut<'a, M> type Item = (usize, &'a mut ByteStr);
<M as IntoMatcher>::Matcher: ReverseSearcher,
Returns an iterator over the mutable disjoint matches within the given string, yielded in reverse order, as well as the index that the match starts at.
pub fn contains<M: IntoMatcher>(&self, m: M) -> bool where
<M as IntoMatcher>::Matcher: ForwardSearcher,
[src]
<M as IntoMatcher>::Matcher: ForwardSearcher,
Returns true
if the string contains a substring that matches the given matcher.
pub fn starts_with<M: IntoMatcher>(&self, m: M) -> bool where
<M as IntoMatcher>::Matcher: PrefixMatcher,
[src]
<M as IntoMatcher>::Matcher: PrefixMatcher,
Returns true
if the string beginning a matches the given matcher.
pub fn ends_with<M: IntoMatcher>(&self, m: M) -> bool where
<M as IntoMatcher>::Matcher: SufixMatcher,
[src]
<M as IntoMatcher>::Matcher: SufixMatcher,
Returns true
if the string ending a matches the given matcher.
pub fn find<M: IntoMatcher>(&self, m: M) -> Option<usize> where
<M as IntoMatcher>::Matcher: ForwardSearcher,
[src]
<M as IntoMatcher>::Matcher: ForwardSearcher,
Returns the byte index of the first character of self
that matches the
matcher or None
it it doesn’t match.
pub fn rfind<M: IntoMatcher>(&self, m: M) -> Option<usize> where
<M as IntoMatcher>::Matcher: ReverseSearcher,
[src]
<M as IntoMatcher>::Matcher: ReverseSearcher,
Returns the byte index of the last character of self
that matches the
matcher or None
it it doesn’t match.
pub fn swap(&mut self, a: usize, b: usize)
[src]
pub fn reverse(&mut self)
[src]
Reverses the order of bytes in the slice.
pub fn copy_from_slice(&mut self, src: &[u8])
[src]
Copies all elements from src
into self
, using a memcpy.
The length of src
must be the same as self
.
pub fn copy_from_byte_str(&mut self, src: &ByteStr)
[src]
Copies all elements from src
into self
, using a memcpy.
The length of src
must be the same as self
.
Trait Implementations
impl AsMut<[u8]> for ByteStr
[src]
impl AsMut<ByteStr> for ByteStr
[src]
impl AsMut<ByteStr> for ByteString
[src]
impl AsRef<[u8]> for ByteStr
[src]
impl AsRef<ByteStr> for ByteStr
[src]
impl AsRef<ByteStr> for ByteString
[src]
impl Borrow<ByteStr> for ByteString
[src]
impl BorrowMut<ByteStr> for ByteString
[src]
fn borrow_mut(&mut self) -> &mut ByteStr
[src]
impl Debug for ByteStr
[src]
impl<'a> Default for &'a ByteStr
[src]
impl<'a> Default for &'a mut ByteStr
[src]
impl Eq for ByteStr
[src]
impl<'a> From<&'a ByteStr> for ByteString
[src]
impl Index<Range<usize>> for ByteStr
[src]
type Output = ByteStr
The returned type after indexing.
fn index(&self, index: Range<usize>) -> &ByteStr
[src]
impl Index<RangeFrom<usize>> for ByteStr
[src]
type Output = ByteStr
The returned type after indexing.
fn index(&self, index: RangeFrom<usize>) -> &ByteStr
[src]
impl Index<RangeFull> for ByteStr
[src]
type Output = ByteStr
The returned type after indexing.
fn index(&self, index: RangeFull) -> &ByteStr
[src]
impl Index<RangeTo<usize>> for ByteStr
[src]
type Output = ByteStr
The returned type after indexing.
fn index(&self, index: RangeTo<usize>) -> &ByteStr
[src]
impl Index<usize> for ByteStr
[src]
impl IndexMut<Range<usize>> for ByteStr
[src]
impl IndexMut<RangeFrom<usize>> for ByteStr
[src]
impl IndexMut<RangeFull> for ByteStr
[src]
impl IndexMut<RangeTo<usize>> for ByteStr
[src]
impl IndexMut<usize> for ByteStr
[src]
impl<'a> IntoIterator for &'a ByteStr
[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<'a> IntoIterator for &'a mut ByteStr
[src]
type Item = &'a mut u8
The type of the elements being iterated over.
type IntoIter = IterMut<'a, u8>
Which kind of iterator are we turning this into?
fn into_iter(self) -> Self::IntoIter
[src]
impl<'a, T: ?Sized> PartialEq<&'a T> for ByteStr where
ByteStr: PartialEq<T>,
[src]
ByteStr: PartialEq<T>,
impl PartialEq<[u8; 0]> for ByteStr
[src]
fn eq(&self, other: &[u8; 0]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<'a> PartialEq<[u8; 0]> for &'a ByteStr
[src]
fn eq(&self, other: &[u8; 0]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl PartialEq<[u8; 1]> for ByteStr
[src]
fn eq(&self, other: &[u8; 1]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<'a> PartialEq<[u8; 1]> for &'a ByteStr
[src]
fn eq(&self, other: &[u8; 1]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl PartialEq<[u8; 10]> for ByteStr
[src]
fn eq(&self, other: &[u8; 10]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<'a> PartialEq<[u8; 10]> for &'a ByteStr
[src]
fn eq(&self, other: &[u8; 10]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl PartialEq<[u8; 11]> for ByteStr
[src]
fn eq(&self, other: &[u8; 11]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<'a> PartialEq<[u8; 11]> for &'a ByteStr
[src]
fn eq(&self, other: &[u8; 11]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl PartialEq<[u8; 12]> for ByteStr
[src]
fn eq(&self, other: &[u8; 12]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<'a> PartialEq<[u8; 12]> for &'a ByteStr
[src]
fn eq(&self, other: &[u8; 12]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl PartialEq<[u8; 13]> for ByteStr
[src]
fn eq(&self, other: &[u8; 13]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<'a> PartialEq<[u8; 13]> for &'a ByteStr
[src]
fn eq(&self, other: &[u8; 13]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl PartialEq<[u8; 14]> for ByteStr
[src]
fn eq(&self, other: &[u8; 14]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<'a> PartialEq<[u8; 14]> for &'a ByteStr
[src]
fn eq(&self, other: &[u8; 14]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl PartialEq<[u8; 15]> for ByteStr
[src]
fn eq(&self, other: &[u8; 15]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<'a> PartialEq<[u8; 15]> for &'a ByteStr
[src]
fn eq(&self, other: &[u8; 15]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl PartialEq<[u8; 16]> for ByteStr
[src]
fn eq(&self, other: &[u8; 16]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<'a> PartialEq<[u8; 16]> for &'a ByteStr
[src]
fn eq(&self, other: &[u8; 16]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl PartialEq<[u8; 17]> for ByteStr
[src]
fn eq(&self, other: &[u8; 17]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<'a> PartialEq<[u8; 17]> for &'a ByteStr
[src]
fn eq(&self, other: &[u8; 17]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl PartialEq<[u8; 18]> for ByteStr
[src]
fn eq(&self, other: &[u8; 18]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<'a> PartialEq<[u8; 18]> for &'a ByteStr
[src]
fn eq(&self, other: &[u8; 18]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl PartialEq<[u8; 19]> for ByteStr
[src]
fn eq(&self, other: &[u8; 19]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<'a> PartialEq<[u8; 19]> for &'a ByteStr
[src]
fn eq(&self, other: &[u8; 19]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl PartialEq<[u8; 2]> for ByteStr
[src]
fn eq(&self, other: &[u8; 2]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<'a> PartialEq<[u8; 2]> for &'a ByteStr
[src]
fn eq(&self, other: &[u8; 2]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl PartialEq<[u8; 20]> for ByteStr
[src]
fn eq(&self, other: &[u8; 20]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<'a> PartialEq<[u8; 20]> for &'a ByteStr
[src]
fn eq(&self, other: &[u8; 20]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl PartialEq<[u8; 21]> for ByteStr
[src]
fn eq(&self, other: &[u8; 21]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<'a> PartialEq<[u8; 21]> for &'a ByteStr
[src]
fn eq(&self, other: &[u8; 21]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl PartialEq<[u8; 22]> for ByteStr
[src]
fn eq(&self, other: &[u8; 22]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<'a> PartialEq<[u8; 22]> for &'a ByteStr
[src]
fn eq(&self, other: &[u8; 22]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl PartialEq<[u8; 23]> for ByteStr
[src]
fn eq(&self, other: &[u8; 23]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<'a> PartialEq<[u8; 23]> for &'a ByteStr
[src]
fn eq(&self, other: &[u8; 23]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl PartialEq<[u8; 24]> for ByteStr
[src]
fn eq(&self, other: &[u8; 24]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<'a> PartialEq<[u8; 24]> for &'a ByteStr
[src]
fn eq(&self, other: &[u8; 24]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl PartialEq<[u8; 25]> for ByteStr
[src]
fn eq(&self, other: &[u8; 25]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<'a> PartialEq<[u8; 25]> for &'a ByteStr
[src]
fn eq(&self, other: &[u8; 25]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl PartialEq<[u8; 26]> for ByteStr
[src]
fn eq(&self, other: &[u8; 26]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<'a> PartialEq<[u8; 26]> for &'a ByteStr
[src]
fn eq(&self, other: &[u8; 26]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl PartialEq<[u8; 27]> for ByteStr
[src]
fn eq(&self, other: &[u8; 27]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<'a> PartialEq<[u8; 27]> for &'a ByteStr
[src]
fn eq(&self, other: &[u8; 27]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl PartialEq<[u8; 28]> for ByteStr
[src]
fn eq(&self, other: &[u8; 28]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<'a> PartialEq<[u8; 28]> for &'a ByteStr
[src]
fn eq(&self, other: &[u8; 28]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl PartialEq<[u8; 29]> for ByteStr
[src]
fn eq(&self, other: &[u8; 29]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<'a> PartialEq<[u8; 29]> for &'a ByteStr
[src]
fn eq(&self, other: &[u8; 29]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl PartialEq<[u8; 3]> for ByteStr
[src]
fn eq(&self, other: &[u8; 3]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<'a> PartialEq<[u8; 3]> for &'a ByteStr
[src]
fn eq(&self, other: &[u8; 3]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl PartialEq<[u8; 30]> for ByteStr
[src]
fn eq(&self, other: &[u8; 30]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<'a> PartialEq<[u8; 30]> for &'a ByteStr
[src]
fn eq(&self, other: &[u8; 30]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl PartialEq<[u8; 31]> for ByteStr
[src]
fn eq(&self, other: &[u8; 31]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<'a> PartialEq<[u8; 31]> for &'a ByteStr
[src]
fn eq(&self, other: &[u8; 31]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl PartialEq<[u8; 32]> for ByteStr
[src]
fn eq(&self, other: &[u8; 32]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<'a> PartialEq<[u8; 32]> for &'a ByteStr
[src]
fn eq(&self, other: &[u8; 32]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl PartialEq<[u8; 4]> for ByteStr
[src]
fn eq(&self, other: &[u8; 4]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<'a> PartialEq<[u8; 4]> for &'a ByteStr
[src]
fn eq(&self, other: &[u8; 4]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl PartialEq<[u8; 5]> for ByteStr
[src]
fn eq(&self, other: &[u8; 5]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<'a> PartialEq<[u8; 5]> for &'a ByteStr
[src]
fn eq(&self, other: &[u8; 5]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl PartialEq<[u8; 6]> for ByteStr
[src]
fn eq(&self, other: &[u8; 6]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<'a> PartialEq<[u8; 6]> for &'a ByteStr
[src]
fn eq(&self, other: &[u8; 6]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl PartialEq<[u8; 7]> for ByteStr
[src]
fn eq(&self, other: &[u8; 7]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<'a> PartialEq<[u8; 7]> for &'a ByteStr
[src]
fn eq(&self, other: &[u8; 7]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl PartialEq<[u8; 8]> for ByteStr
[src]
fn eq(&self, other: &[u8; 8]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<'a> PartialEq<[u8; 8]> for &'a ByteStr
[src]
fn eq(&self, other: &[u8; 8]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl PartialEq<[u8; 9]> for ByteStr
[src]
fn eq(&self, other: &[u8; 9]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<'a> PartialEq<[u8; 9]> for &'a ByteStr
[src]
fn eq(&self, other: &[u8; 9]) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl PartialEq<[u8]> for ByteStr
[src]
impl<'a> PartialEq<[u8]> for &'a ByteStr
[src]
impl PartialEq<ByteStr> for ByteStr
[src]
impl<'a> PartialEq<ByteStr> for &'a ByteStr
[src]
fn eq(&self, other: &ByteStr) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl PartialEq<ByteString> for ByteStr
[src]
fn eq(&self, other: &ByteString) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<'a> PartialEq<ByteString> for &'a ByteStr
[src]
fn eq(&self, other: &ByteString) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<'b> PartialEq<Cow<'b, ByteStr>> for ByteStr
[src]
fn eq(&self, other: &Cow<'b, ByteStr>) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl<'a, 'b> PartialEq<Cow<'b, ByteStr>> for &'a ByteStr
[src]
fn eq(&self, other: &Cow<'b, ByteStr>) -> bool
[src]
#[must_use]pub fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
impl StructuralEq for ByteStr
[src]
impl StructuralPartialEq for ByteStr
[src]
impl ToOwned for ByteStr
[src]
type Owned = ByteString
The resulting type after obtaining ownership.