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>

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 BaseProfile = P

The underlying profile that this profile is based on.

type Segmentation = <P as Profile>::Segmentation

The segmentation strategy that this profile uses.

fn is_ident_start(c: char) -> bool

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

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 in_profile(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).

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

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

Proof: If Super ⊆ Subset, then Lower<Super> ⊆ Lower<Subset>.

Let’s pretend that Superset=Unicode, and Subset=Ascii.

If Ascii: SubsetOf<Unicode> (true), then this implies the following:

• Lower<Ascii>: SubsetOf<Lower<Unicode>>

Proof

left_is_subset_of_right::<Lower<Ascii>, Lower<Ascii>>();
left_is_subset_of_right::<Lower<Unicode>, Lower<Unicode>>();
left_is_subset_of_right::<Lower<Ascii>, Lower<Unicode>>();

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

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

Proof: If Super ⊆ Subset, then LowerCamel<Super> ⊆ Lower<Subset> (because LowerCamel ⊆ Lower).

Let’s pretend that Superset=Unicode, and Subset=Ascii.

If Ascii: SubsetOf<Unicode> (true), then this implies the following:

• Lower<Ascii>: SubsetOf<LowerCamel<Unicode>>

Proof

left_is_subset_of_right::<Lower<Ascii>, LowerCamel<Ascii>>();
left_is_subset_of_right::<Lower<Unicode>, LowerCamel<Unicode>>();
left_is_subset_of_right::<Lower<Ascii>, LowerCamel<Unicode>>();

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

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

Proof: If Super ⊆ Subset, then Super ⊆ Lower<Subset>.

Let’s pretend that Superset=Unicode, and Subset=Ascii.

If Ascii: SubsetOf<Unicode> (true), then this implies the following:

• Lower<Ascii>: SubsetOf<Unicode>

Proof

left_is_subset_of_right::<Lower<Ascii>, Ascii>();
left_is_subset_of_right::<Lower<Unicode>, Unicode>();
left_is_subset_of_right::<Lower<Ascii>, Unicode>();