Struct Lower 

pub struct Lower<P>(/* private fields */);

A case adapter for a character profile that accepts uncased and lowercase characters.

Trait Implementations

impl<P: CharProfile> CasedProfile for Lower<P>

fn is_chunk<D: Delimiter>(s: &str) -> Result<(), SyntaxError>

Given a UTF-8 string, check whether or not it’s a valid chunk.

fn is_fragment<D: Delimiter>(s: &str) -> Result<(), SyntaxError>

Given a UTF-8 string, check whether or not it’s a valid fragment.

fn is_ident<D: Delimiter>(s: &str) -> Result<(), SyntaxError>

Given a UTF-8 string, check whether or not it’s a valid identifier.

fn is_ident_fragment<D: Delimiter>(fragment: &str) -> Result<(), SyntaxError>

Given a UTF-8 string that is known to pass is_fragment, check whether or not it’s a valid identifier.

impl<P: CharProfile> Profile for Lower<P>

const APPEND_CLOSED: AppendClosed = P::APPEND_CLOSED

Whether or not a fragment containing characters in this profile are append-closed.

type CharProfile = P

The underlying character profile that this profile is based on.

type Segmentation = <P as Profile>::Segmentation

The segmentation strategy that this profile uses.

fn is_chunk_char(c: char) -> bool

Whether or not the provided character can appear at any point in a chunk.

fn is_chunk_continue(c: char) -> bool

Whether or not the provided character is valid at any position after the first character of a chunk (a run of non-delimiter characters).

fn is_chunk_start(c: char) -> bool

Whether or not the provided character can appear at the start of a new chunk (e.g. right after a delimiter).

fn is_ident_start_char(c: char) -> bool

Whether or not the provided character can appear at the absolute start of an identifier.

impl<Superset, Subset> SubsetOf<Camel<Superset>> for Lower<Subset>

where Superset: CharProfile, Subset: CharProfile + SubsetOf<Superset>,

Proof: If Subset ⊆ Superset, then Lower<Subset> ⊆ Camel<Superset>

impl<Superset, Subset> SubsetOf<Lower<Superset>> for Lower<Subset>

where Superset: CharProfile, Subset: CharProfile + SubsetOf<Superset>,

Proof: If Subset ⊆ Superset, then Lower<Subset> ⊆ Lower<Superset>

impl<Superset, Subset> SubsetOf<LowerCamel<Superset>> for Lower<Subset>

where Superset: CharProfile, Subset: CharProfile + SubsetOf<Superset>,

Proof: If Subset ⊆ Superset, then Lower<Subset> ⊆ LowerCamel<Superset>

impl<Superset, Subset> SubsetOf<Mixed<Superset>> for Lower<Subset>

where Superset: CharProfile, Subset: CharProfile + SubsetOf<Superset>,

Proof: If Subset ⊆ Superset, then Lower<Subset> ⊆ Mixed<Superset>

impl<Superset, Subset> SubsetOf<Superset> for Lower<Subset>

where Superset: CharProfile, Subset: CharProfile + SubsetOf<Superset>,

Proof: If Subset ⊆ Superset, then Lower<Subset> ⊆ Superset

impl<Superset, Subset> SubsetOf<Uniform<Superset>> for Lower<Subset>

where Superset: CharProfile, Subset: CharProfile + SubsetOf<Superset>,

Proof: If Subset ⊆ Superset, then Lower<Subset> ⊆ Uniform<Superset>