pub struct Uniform<P>(/* private fields */);Expand description
A case adapter for a character profile that accepts either Lower or
or Upper (but not a mixture of both, like Mixed would).
§Caution
Unlike many other profiles, this profile presents an interdependent casing requirement (e.g. the case of the other restricted characters impact the validity of each other).
Because of this, just plainly calling the functions of this Profile may
be more permissive than actually calling the is_ident, is_fragment,
or is_ident_fragment functions.
Trait Implementations§
Source§impl<P: CharProfile> CasedProfile for Uniform<P>
impl<P: CharProfile> CasedProfile for Uniform<P>
Source§fn is_chunk<D: Delimiter>(s: &str) -> Result<(), SyntaxError>
fn is_chunk<D: Delimiter>(s: &str) -> Result<(), SyntaxError>
Source§fn is_fragment<D: Delimiter>(s: &str) -> Result<(), SyntaxError>
fn is_fragment<D: Delimiter>(s: &str) -> Result<(), SyntaxError>
Source§fn is_ident<D: Delimiter>(s: &str) -> Result<(), SyntaxError>
fn is_ident<D: Delimiter>(s: &str) -> Result<(), SyntaxError>
Source§fn is_ident_fragment<D: Delimiter>(fragment: &str) -> Result<(), SyntaxError>
fn is_ident_fragment<D: Delimiter>(fragment: &str) -> Result<(), SyntaxError>
is_fragment, check
whether or not it’s a valid identifier. Read moreSource§impl<P: CharProfile> Profile for Uniform<P>
impl<P: CharProfile> Profile for Uniform<P>
Source§const APPEND_CLOSED: AppendClosed = P::APPEND_CLOSED
const APPEND_CLOSED: AppendClosed = P::APPEND_CLOSED
Source§type CharProfile = P
type CharProfile = P
Source§type Segmentation = <P as Profile>::Segmentation
type Segmentation = <P as Profile>::Segmentation
Source§fn is_chunk_char(c: char) -> bool
fn is_chunk_char(c: char) -> bool
Source§fn is_chunk_continue(c: char) -> bool
fn is_chunk_continue(c: char) -> bool
impl<Superset, Subset> SubsetOf<Camel<Superset>> for Uniform<Subset>
Proof: If Subset ⊆ Superset, then Uniform<Subset> ⊆ Camel<Superset>
impl<Superset, Subset> SubsetOf<Mixed<Superset>> for Uniform<Subset>
Proof: If Subset ⊆ Superset, then Uniform<Subset> ⊆ Mixed<Superset>
impl<Superset, Subset> SubsetOf<Superset> for Uniform<Subset>
Proof: If Subset ⊆ Superset, then Uniform<Subset> ⊆ Superset
impl<Superset, Subset> SubsetOf<Uniform<Superset>> for Lower<Subset>
Proof: If Subset ⊆ Superset, then Lower<Subset> ⊆ Uniform<Superset>
impl<Superset, Subset> SubsetOf<Uniform<Superset>> for Uniform<Subset>
Proof: If Subset ⊆ Superset, then Uniform<Subset> ⊆ Uniform<Superset>
impl<Superset, Subset> SubsetOf<Uniform<Superset>> for Upper<Subset>
Proof: If Subset ⊆ Superset, then Upper<Subset> ⊆ Uniform<Superset>