Struct RedoxScheme 

pub struct RedoxScheme<'a>(/* private fields */);

The name of a scheme

Implementations

impl<'a> RedoxScheme<'a>

pub fn new<S: Into<Cow<'a, str>>>(scheme: S) -> Option<Self>

Create a new RedoxScheme, ensuring there are no invalid characters

pub fn canonicalize_as_scheme<'b>(&self, path: RedoxStr<'b>) -> RedoxPath<'b>

Similar to canonicalize_using_scheme

pub fn into_owned<'b>(self) -> RedoxScheme<'b>

Trait Implementations

impl<'a> AsRef<str> for RedoxScheme<'a>

fn as_ref(&self) -> &str

Converts this type into a shared reference of the (usually inferred) input type.

impl<'a> Clone for RedoxScheme<'a>

fn clone(&self) -> RedoxScheme<'a>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<'a> Debug for RedoxScheme<'a>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'a> Display for RedoxScheme<'a>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'a> Eq for RedoxScheme<'a>

impl<'a> Hash for RedoxScheme<'a>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<'a> PartialEq for RedoxScheme<'a>

fn eq(&self, other: &RedoxScheme<'a>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<'a> StructuralPartialEq for RedoxScheme<'a>