#[repr(transparent)]pub struct Braced(_);
Expand description
Format a Uuid
as a braced hyphenated string, like
{67e55044-10b1-426f-9247-bb680e5fe0c8}
.
Implementations
sourceimpl Braced
impl Braced
sourcepub fn encode_lower<'buf>(&self, buffer: &'buf mut [u8]) -> &'buf mut str
pub fn encode_lower<'buf>(&self, buffer: &'buf mut [u8]) -> &'buf mut str
Writes the Uuid
as a lower-case hyphenated string surrounded by
braces to buffer
, and returns the subslice of the buffer that contains
the encoded UUID.
This is slightly more efficient than using the formatting infrastructure as it avoids virtual calls, and may avoid double buffering.
Panics
Panics if the buffer is not large enough: it must have length at least
LENGTH
. Uuid::encode_buffer
can be used to get a
sufficiently-large temporary buffer.
Examples
use uuid::Uuid;
fn main() -> Result<(), uuid::Error> {
let uuid = Uuid::parse_str("936DA01f9abd4d9d80c702af85c822a8")?;
// the encoded portion is returned
assert_eq!(
uuid.braced()
.encode_lower(&mut Uuid::encode_buffer()),
"{936da01f-9abd-4d9d-80c7-02af85c822a8}"
);
// the buffer is mutated directly, and trailing contents remains
let mut buf = [b'!'; 40];
uuid.braced().encode_lower(&mut buf);
assert_eq!(
&buf as &[_],
b"{936da01f-9abd-4d9d-80c7-02af85c822a8}!!" as &[_]
);
Ok(())
}
*/
sourcepub fn encode_upper<'buf>(&self, buffer: &'buf mut [u8]) -> &'buf mut str
pub fn encode_upper<'buf>(&self, buffer: &'buf mut [u8]) -> &'buf mut str
Writes the Uuid
as an upper-case hyphenated string surrounded by
braces to buffer
, and returns the subslice of the buffer that contains
the encoded UUID.
This is slightly more efficient than using the formatting infrastructure as it avoids virtual calls, and may avoid double buffering.
Panics
Panics if the buffer is not large enough: it must have length at least
LENGTH
. Uuid::encode_buffer
can be used to get a
sufficiently-large temporary buffer.
Examples
use uuid::Uuid;
fn main() -> Result<(), uuid::Error> {
let uuid = Uuid::parse_str("936da01f9abd4d9d80c702af85c822a8")?;
// the encoded portion is returned
assert_eq!(
uuid.braced()
.encode_upper(&mut Uuid::encode_buffer()),
"{936DA01F-9ABD-4D9D-80C7-02AF85C822A8}"
);
// the buffer is mutated directly, and trailing contents remains
let mut buf = [b'!'; 40];
uuid.braced().encode_upper(&mut buf);
assert_eq!(
&buf as &[_],
b"{936DA01F-9ABD-4D9D-80C7-02AF85C822A8}!!" as &[_]
);
Ok(())
}
*/
Trait Implementations
sourceimpl Ord for Braced
impl Ord for Braced
sourceimpl PartialOrd<Braced> for Braced
impl PartialOrd<Braced> for Braced
sourcefn partial_cmp(&self, other: &Braced) -> Option<Ordering>
fn partial_cmp(&self, other: &Braced) -> Option<Ordering>
This method returns an ordering between self
and other
values if one exists. Read more
1.0.0 · sourcefn lt(&self, other: &Rhs) -> bool
fn lt(&self, other: &Rhs) -> bool
This method tests less than (for self
and other
) and is used by the <
operator. Read more
1.0.0 · sourcefn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for self
and other
) and is used by the <=
operator. Read more
impl Copy for Braced
impl Eq for Braced
impl StructuralEq for Braced
impl StructuralPartialEq for Braced
Auto Trait Implementations
impl RefUnwindSafe for Braced
impl Send for Braced
impl Sync for Braced
impl Unpin for Braced
impl UnwindSafe for Braced
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcepub fn borrow_mut(&mut self) -> &mut T
pub fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
sourceimpl<T> ToOwned for T where
T: Clone,
impl<T> ToOwned for T where
T: Clone,
type Owned = T
type Owned = T
The resulting type after obtaining ownership.
sourcepub fn to_owned(&self) -> T
pub fn to_owned(&self) -> T
Creates owned data from borrowed data, usually by cloning. Read more
sourcepub fn clone_into(&self, target: &mut T)
pub fn clone_into(&self, target: &mut T)
toowned_clone_into
)Uses borrowed data to replace owned data, usually by cloning. Read more