Struct LowerCamel 

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

A case adapter for a character profile that accepts uncased and lowercase characters on the first character of a chunk or identifier.

Note

If you’re using the regular unicode profile, it’s possible that you can construct valid strings which appear to break the requirements of this type.

use typed_ident::presets::unicode::LowerCamelIdent;
assert!(LowerCamelIdent::new("_A").is_err()); // Doesn't work (expected).
assert!(LowerCamelIdent::new("_゙A").is_ok()); // Works?

The payload provided for that second case is:

• _ (U+005F) LOW LINE
• ゙ (U+3099) COMBINING KATAKANA-HIRAGANA VOICED SOUND MARK
• A (U+0041) LATIN CAPITAL LETTER A

The way to prevent this is to disallow Mn/Mc/Me characters on chunk start.

You can get a profile which does this by enabling unicode-strict. This will enable the Strict profile which can be used directly - or if you have presets enabled - used indirectly through strict presets.

use typed_ident::presets::strict::LowerCamelIdent;
assert!(LowerCamelIdent::new("_A").is_err()); // Doesn't work (expected).
assert!(LowerCamelIdent::new("_゙A").is_err()); // Now it doesn't work!

See Strict for more details on when you should do this.

Trait Implementations

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

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

const APPEND_CLOSED: AppendClosed

LowerCamel cannot be append-closed for >=Fragment, because is_chunk_start is not identical to is_chunk_continue.

See Profile::APPEND_CLOSED for details.

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<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<LowerCamel<Superset>> for LowerCamel<Subset>

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

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

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

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

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

Proof

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

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

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

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

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

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

• LowerCamel<Ascii>: SubsetOf<Unicode>

Proof

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