reword 7.0.1

Provides some utility functions for human-readable formatting of words.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213

use crate::{fold, name, name_with_limit};
use alloc::string::String;

fn pat(c: char) -> bool {
    c.is_ascii_punctuation() || c.is_whitespace()
}

/// Formats the input string as a kebab case name.
///
/// # Examples
/// ```
/// assert_eq!(reword::kebab_case("Even Olsson Rogstadkjærnet"), "even-olsson-rogstadkjærnet");
/// ```
pub fn kebab_case<T: AsRef<str>>(t: T) -> String {
    name(t)
        .split(pat)
        .filter(|t| !t.is_empty())
        .map(str::to_lowercase)
        .fold(String::new(), fold_kebab_case)
}

/// Formats the input string as a kebab case name and limits the length of the name.
///
/// # Examples
/// ```
/// assert_eq!(reword::kebab_case_with_limit("Even Olsson Rogstadkjærnet", 25), "even-o-rogstadkjærnet");
/// ```
pub fn kebab_case_with_limit<T: AsRef<str>>(t: T, limit: usize) -> String {
    name_with_limit(t, limit)
        .split(pat)
        .filter(|t| !t.is_empty())
        .map(str::to_lowercase)
        .fold(String::new(), fold_kebab_case)
}

/// Formats the input string as a screaming kebab case name.
///
/// # Examples
/// ```
/// assert_eq!(reword::screaming_kebab_case("Even Olsson Rogstadkjærnet"), "EVEN-OLSSON-ROGSTADKJÆRNET");
/// ```
pub fn screaming_kebab_case<T: AsRef<str>>(t: T) -> String {
    name(t)
        .split(pat)
        .filter(|t| !t.is_empty())
        .map(str::to_uppercase)
        .fold(String::new(), fold_kebab_case)
}

/// Formats the input string as a screaming kebab case name and limits the length of the name.
///
/// # Examples
/// ```
/// assert_eq!(reword::screaming_kebab_case_with_limit("Even Olsson Rogstadkjærnet", 25), "EVEN-O-ROGSTADKJÆRNET");
/// ```
pub fn screaming_kebab_case_with_limit<T: AsRef<str>>(t: T, limit: usize) -> String {
    name_with_limit(t, limit)
        .split(pat)
        .filter(|t| !t.is_empty())
        .map(str::to_uppercase)
        .fold(String::new(), fold_kebab_case)
}

/// Formats the input string as a snake case name.
///
/// # Examples
/// ```
/// assert_eq!(reword::snake_case("Even Olsson Rogstadkjærnet"), "even_olsson_rogstadkjærnet");
/// ```
pub fn snake_case<T: AsRef<str>>(t: T) -> String {
    name(t)
        .split(pat)
        .filter(|t| !t.is_empty())
        .map(str::to_lowercase)
        .fold(String::new(), fold_snake_case)
}

/// Formats the input string as a snake case name and limits the length of the name.
///
/// # Examples
/// ```
/// assert_eq!(reword::snake_case_with_limit("Even Olsson Rogstadkjærnet", 25), "even_o_rogstadkjærnet");
/// ```
pub fn snake_case_with_limit<T: AsRef<str>>(t: T, limit: usize) -> String {
    name_with_limit(t, limit)
        .split(pat)
        .filter(|t| !t.is_empty())
        .map(str::to_lowercase)
        .fold(String::new(), fold_snake_case)
}

/// Formats the input string as a screaming snake case name.
///
/// # Examples
/// ```
/// assert_eq!(reword::screaming_snake_case("Even Olsson Rogstadkjærnet"), "EVEN_OLSSON_ROGSTADKJÆRNET");
/// ```
pub fn screaming_snake_case<T: AsRef<str>>(t: T) -> String {
    name(t)
        .split(pat)
        .filter(|t| !t.is_empty())
        .map(str::to_uppercase)
        .fold(String::new(), fold_snake_case)
}

/// Formats the input string as a screaming snake case name and limits the length of the name.
///
/// # Examples
/// ```
/// assert_eq!(reword::screaming_snake_case_with_limit("Even Olsson Rogstadkjærnet", 25), "EVEN_O_ROGSTADKJÆRNET");
/// ```
pub fn screaming_snake_case_with_limit<T: AsRef<str>>(t: T, limit: usize) -> String {
    name_with_limit(t, limit)
        .split(pat)
        .filter(|t| !t.is_empty())
        .map(str::to_uppercase)
        .fold(String::new(), fold_snake_case)
}

/// Formats the input string as a camel case name.
///
/// # Examples
/// ```
/// assert_eq!(reword::camel_case("Even Olsson Rogstadkjærnet"), "evenOlssonRogstadkjærnet");
/// ```
pub fn camel_case<T: AsRef<str>>(t: T) -> String {
    name(t)
        .split(pat)
        .filter(|t| !t.is_empty())
        .enumerate()
        .map(|(i, word)| to_camel_case(word, i != 0))
        .fold(String::new(), fold_camel_case)
}

/// Formats the input string as a camel case name with a limit on the length.
///
/// # Examples
/// ```
/// assert_eq!(reword::camel_case_with_limit("Even Olsson Rogstadkjærnet", 25), "evenORogstadkjærnet");
/// ```
pub fn camel_case_with_limit<T: AsRef<str>>(t: T, limit: usize) -> String {
    name_with_limit(t, limit)
        .split(pat)
        .filter(|t| !t.is_empty())
        .enumerate()
        .map(|(i, word)| to_camel_case(word, i != 0))
        .fold(String::new(), fold_camel_case)
}

/// Formats the input string as a pascal case name.
///
/// # Examples
/// ```
/// assert_eq!(reword::pascal_case("Even Olsson Rogstadkjærnet"), "EvenOlssonRogstadkjærnet");
/// ```
pub fn pascal_case<T: AsRef<str>>(t: T) -> String {
    name(t)
        .split(pat)
        .filter(|t| !t.is_empty())
        .map(|word| to_camel_case(word, true))
        .fold(String::new(), fold_camel_case)
}

/// Formats the input string as a pascal case name with a limit on the length.
///
/// # Examples
/// ```
/// assert_eq!(reword::pascal_case_with_limit("Even Olsson Rogstadkjærnet", 25), "EvenORogstadkjærnet");
/// ```
pub fn pascal_case_with_limit<T: AsRef<str>>(t: T, limit: usize) -> String {
    name_with_limit(t, limit)
        .split(pat)
        .filter(|t| !t.is_empty())
        .map(|word| to_camel_case(word, true))
        .fold(String::new(), fold_camel_case)
}

fn to_camel_case(word: &str, mut upper: bool) -> String {
    let mut cc = String::new();
    let mut prev_is_lowercase = false;

    for c in word.chars() {
        if upper {
            cc.extend(c.to_uppercase());
        } else {
            cc.extend(c.to_lowercase());
        }

        upper = prev_is_lowercase && c.is_uppercase();
        prev_is_lowercase = c.is_lowercase();
    }

    cc
}

fn fold_kebab_case(acc: String, w: String) -> String {
    fold(acc, &w, '-')
}

fn fold_snake_case(acc: String, w: String) -> String {
    fold(acc, &w, '_')
}

fn fold_camel_case(mut acc: String, w: String) -> String {
    let start_is_num = matches!(w.chars().next(), Some(c) if c.is_numeric());
    let end_is_num = matches!(acc.chars().last(), Some(c) if c.is_numeric());
    // Split with _ if two word boundaries are numeric.
    if start_is_num && end_is_num {
        acc.push('_');
    }
    acc.push_str(&w);
    acc
}