convert_case/segmentation.rs
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 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459
#[cfg(test)]
use strum_macros::EnumIter;
use unicode_segmentation::{UnicodeSegmentation}; //, GraphemeCursor};
/// A boundary defines how a string is split into words. Some boundaries, `Hyphen`, `Underscore`,
/// and `Space`, consume the character they split on, whereas the other boundaries
/// do not.
///
/// The struct offers methods that return `Vec`s containing useful groups of boundaries. It also
/// contains the [`list_from`](Boundary::list_from) method which will generate a list of boundaries
/// based on a string slice.
///
/// Note that all boundaries are distinct and do not share functionality. That is, there is no
/// such DigitLetter variant, because that would be equivalent to the current `DigitUpper` and
/// `DigitLower` variants. For common functionality, consider using
/// some provided functions that return a list of boundaries.
/// ```
/// use convert_case::{Boundary, Case, Casing, Converter};
///
/// assert_eq!(
/// "transformations_in_3d",
/// "TransformationsIn3D"
/// .from_case(Case::Camel)
/// .without_boundaries(&Boundary::digit_letter())
/// .to_case(Case::Snake)
/// );
///
/// let conv = Converter::new()
/// .set_boundaries(&Boundary::list_from("aA "))
/// .to_case(Case::Title);
/// assert_eq!("7empest By Tool", conv.convert("7empest byTool"));
/// ```
#[cfg_attr(test, derive(EnumIter))]
#[derive(Clone, Copy, Eq, PartialEq, Debug)]
pub enum Boundary {
/// Splits on `-`, consuming the character on segmentation.
/// ```
/// use convert_case::Boundary;
/// assert_eq!(
/// vec![Boundary::Hyphen],
/// Boundary::list_from("-")
/// );
/// ```
Hyphen,
/// Splits on `_`, consuming the character on segmentation.
/// ```
/// use convert_case::Boundary;
/// assert_eq!(
/// vec![Boundary::Underscore],
/// Boundary::list_from("_")
/// );
/// ```
Underscore,
/// Splits on space, consuming the character on segmentation.
/// ```
/// use convert_case::Boundary;
/// assert_eq!(
/// vec![Boundary::Space],
/// Boundary::list_from(" ")
/// );
/// ```
Space,
/// Splits where an uppercase letter is followed by a lowercase letter. This is seldom used,
/// and is not included in the [defaults](Boundary::defaults).
/// ```
/// use convert_case::Boundary;
/// assert_eq!(
/// vec![Boundary::UpperLower],
/// Boundary::list_from("Aa")
/// );
/// ```
UpperLower,
/// Splits where a lowercase letter is followed by an uppercase letter.
/// ```
/// use convert_case::Boundary;
/// assert_eq!(
/// vec![Boundary::LowerUpper],
/// Boundary::list_from("aA")
/// );
/// ```
LowerUpper,
/// Splits where digit is followed by an uppercase letter.
/// ```
/// use convert_case::Boundary;
/// assert_eq!(
/// vec![Boundary::DigitUpper],
/// Boundary::list_from("1A")
/// );
/// ```
DigitUpper,
/// Splits where an uppercase letter is followed by a digit.
/// ```
/// use convert_case::Boundary;
/// assert_eq!(
/// vec![Boundary::UpperDigit],
/// Boundary::list_from("A1")
/// );
/// ```
UpperDigit,
/// Splits where digit is followed by a lowercase letter.
/// ```
/// use convert_case::Boundary;
/// assert_eq!(
/// vec![Boundary::DigitLower],
/// Boundary::list_from("1a")
/// );
/// ```
DigitLower,
/// Splits where a lowercase letter is followed by a digit.
/// ```
/// use convert_case::Boundary;
/// assert_eq!(
/// vec![Boundary::LowerDigit],
/// Boundary::list_from("a1")
/// );
/// ```
LowerDigit,
/// Acronyms are identified by two uppercase letters followed by a lowercase letter.
/// The word boundary is between the two uppercase letters. For example, "HTTPRequest"
/// would have an acronym boundary identified at "PRe" and split into "HTTP" and "Request".
/// ```
/// use convert_case::Boundary;
/// assert_eq!(
/// vec![Boundary::Acronym],
/// Boundary::list_from("AAa")
/// );
/// ```
Acronym,
}
impl Boundary {
/// Returns a list of all boundaries that are identified within the given string.
/// Could be a short of writing out all the boundaries in a list directly. This will not
/// identify boundary `UpperLower` if it also used as part of `Acronym`.
///
/// If you want to be very explicit and not overlap boundaries, it is recommended to use a colon
/// character.
/// ```
/// use convert_case::Boundary;
/// use Boundary::*;
/// assert_eq!(
/// vec![Hyphen, Space, LowerUpper, UpperDigit, DigitLower],
/// Boundary::list_from("aA8a -")
/// );
/// assert_eq!(
/// vec![Underscore, LowerUpper, DigitUpper, Acronym],
/// Boundary::list_from("bD:0B:_:AAa")
/// );
/// ```
pub fn list_from(s: &str) -> Vec<Self> {
Boundary::all().iter().filter(|boundary| {
let left_iter = s.graphemes(true);
let mid_iter = s.graphemes(true).skip(1);
let right_iter = s.graphemes(true).skip(2);
let mut one_iter = left_iter.clone();
// Also capture when the previous pair was both uppercase, so we don't
// match the UpperLower boundary in the case of Acronym
let two_iter = left_iter.clone().zip(mid_iter.clone());
let mut two_iter_and_upper = two_iter.clone()
.zip(std::iter::once(false).chain(
two_iter.map(|(a, b)| grapheme_is_uppercase(a) && grapheme_is_uppercase(b))
));
let mut three_iter = left_iter.zip(mid_iter).zip(right_iter);
one_iter.any(|a| boundary.detect_one(a))
|| two_iter_and_upper.any(|((a, b), is_acro)| boundary.detect_two(a, b) && !is_acro)
|| three_iter.any(|((a, b), c)| boundary.detect_three(a, b, c))
}).copied().collect()
}
/// The default list of boundaries used when `Casing::to_case` is called directly
/// and in a `Converter` generated from `Converter::new()`. This includes
/// all the boundaries except the `UpperLower` boundary.
/// ```
/// use convert_case::Boundary;
/// use Boundary::*;
/// assert_eq!(
/// vec![
/// Underscore, Hyphen, Space, LowerUpper, UpperDigit,
/// DigitUpper, DigitLower, LowerDigit, Acronym,
/// ],
/// Boundary::defaults()
/// );
/// ```
pub fn defaults() -> Vec<Self> {
use Boundary::*;
vec![
Underscore, Hyphen, Space, LowerUpper, UpperDigit, DigitUpper, DigitLower, LowerDigit,
Acronym,
]
}
/// Returns the boundaries that split around single characters: `Hyphen`,
/// `Underscore`, and `Space`.
/// ```
/// use convert_case::Boundary;
/// use Boundary::*;
/// assert_eq!(
/// vec![Hyphen, Underscore, Space],
/// Boundary::delims()
/// );
/// ```
pub fn delims() -> Vec<Self> {
use Boundary::*;
vec![Hyphen, Underscore, Space]
}
/// Returns the boundaries that involve digits: `DigitUpper`, `DigitLower`, `UpperDigit`, and
/// `LowerDigit`.
/// ```
/// use convert_case::Boundary;
/// use Boundary::*;
/// assert_eq!(
/// vec![DigitUpper, UpperDigit, DigitLower, LowerDigit],
/// Boundary::digits()
/// );
/// ```
pub fn digits() -> Vec<Self> {
use Boundary::*;
vec![DigitUpper, UpperDigit, DigitLower, LowerDigit]
}
/// Returns the boundaries that are letters followed by digits: `UpperDigit` and `LowerDigit`.
/// ```
/// use convert_case::Boundary;
/// use Boundary::*;
/// assert_eq!(
/// vec![UpperDigit, LowerDigit],
/// Boundary::letter_digit()
/// );
/// ```
pub fn letter_digit() -> Vec<Self> {
use Boundary::*;
vec![UpperDigit, LowerDigit]
}
/// Returns the boundaries that are digits followed by letters: `DigitUpper` and
/// `DigitLower`.
/// ```
/// use convert_case::Boundary;
/// use Boundary::*;
/// assert_eq!(
/// vec![DigitUpper, DigitLower],
/// Boundary::digit_letter()
/// );
/// ```
pub fn digit_letter() -> Vec<Self> {
use Boundary::*;
vec![DigitUpper, DigitLower]
}
/// Returns all boundaries. Note that this includes the `UpperLower` variant which
/// might be unhelpful. Please look at [`Boundary::defaults`].
/// ```
/// use convert_case::Boundary;
/// use Boundary::*;
/// assert_eq!(
/// vec![
/// Hyphen, Underscore, Space, LowerUpper, UpperLower, DigitUpper,
/// UpperDigit, DigitLower, LowerDigit, Acronym,
/// ],
/// Boundary::all()
/// );
/// ```
pub fn all() -> Vec<Self> {
use Boundary::*;
vec![
Hyphen, Underscore, Space, LowerUpper, UpperLower, DigitUpper, UpperDigit,
DigitLower, LowerDigit, Acronym
]
}
fn detect_one(&self, c: &str) -> bool {
use Boundary::*;
match self {
Hyphen => c == "-",
Underscore => c == "_",
Space => c == " ",
_ => false,
}
}
fn detect_two(&self, c: &str, d: &str) -> bool {
use Boundary::*;
match self {
UpperLower => grapheme_is_uppercase(c) && grapheme_is_lowercase(d),
LowerUpper => grapheme_is_lowercase(c) && grapheme_is_uppercase(d),
DigitUpper => grapheme_is_digit(c) && grapheme_is_uppercase(d),
UpperDigit => grapheme_is_uppercase(c) && grapheme_is_digit(d),
DigitLower => grapheme_is_digit(c) && grapheme_is_lowercase(d),
LowerDigit => grapheme_is_lowercase(c) && grapheme_is_digit(d),
_ => false,
}
}
fn detect_three(&self, c: &str, d: &str, e: &str) -> bool {
use Boundary::*;
if let Acronym = self {
grapheme_is_uppercase(c)
&& grapheme_is_uppercase(d)
&& grapheme_is_lowercase(e)
} else {
false
}
}
}
fn grapheme_is_digit(c: &str) -> bool {
c.chars().all(|c| c.is_ascii_digit())
}
fn grapheme_is_uppercase(c: &str) -> bool {
c.to_uppercase() != c.to_lowercase() && c == c.to_uppercase()
}
fn grapheme_is_lowercase(c: &str) -> bool {
c.to_uppercase() != c.to_lowercase() && c == c.to_lowercase()
}
pub fn split<T>(s: T, boundaries: &[Boundary]) -> Vec<String>
where
T: AsRef<str>,
{
use std::iter::once;
// create split_points function that counts off by graphemes into list
let s = s.as_ref();
// Some<bool> means the following
// None: no split
// Some(false): split between characters
// Some(true): split consuming characters
let left_iter = s.graphemes(true);
let mid_iter = s.graphemes(true).skip(1);
let right_iter = s.graphemes(true).skip(2);
let singles = left_iter.clone();
let doubles = left_iter.clone().zip(mid_iter.clone());
let triples = left_iter.zip(mid_iter).zip(right_iter);
let singles = singles
.map(|c| boundaries.iter().any(|b| b.detect_one(c)))
.map(|split| if split {Some(true)} else {None});
let doubles = doubles
.map(|(c,d)| boundaries.iter().any(|b| b.detect_two(c, d)))
.map(|split| if split {Some(false)} else {None});
let triples = triples
.map(|((c,d),e)| boundaries.iter().any(|b| b.detect_three(c, d, e)))
.map(|split| if split {Some(false)} else {None});
let split_points = singles
.zip(once(None).chain(doubles))
.zip(once(None).chain(triples).chain(once(None)))
.map(|((s, d), t)| s.or(d).or(t));
let mut words = Vec::new();
let mut word = String::new();
for (c, split) in s.graphemes(true).zip(split_points) {
match split {
// no split here
None => word.push_str(c),
// split here, consume letter
Some(true) => words.push(std::mem::take(&mut word)),
// split here, keep letter
Some(false) => {
words.push(std::mem::take(&mut word));
word.push_str(c);
}
}
}
words.push(word);
/*
let mut words = Vec::new();
let mut left_idx = 0;
let mut total_chars = 0;
let mut skip = 0;
let mut cur = GraphemeCursor::new(left_idx, s.len(), true);
for (right_idx, split) in split_points.enumerate() {
match split {
// no split here
None => {},
// split here, consume letter
Some(true) => {
let mut right_bound = left_bound;
for _ in 0..total_chars {
right_bound = cur.next_boundary(s, skip).unwrap().unwrap();
}
words.push(&s[left_bound..right_bound])
}
// split here, keep letter
Some(false) => {
}
// dont push an empty string, do nothing
_ => {}
}
}
*/
words.into_iter().filter(|s| !s.is_empty()).collect()
}
#[cfg(test)]
mod test {
use super::*;
use strum::IntoEnumIterator;
#[test]
fn all_boundaries_in_iter() {
let all = Boundary::all();
for boundary in Boundary::iter() {
assert!(all.contains(&boundary));
}
}
#[test]
fn split_on_delims() {
assert_eq!(
vec!["my", "word", "list", "separated", "by", "delims"],
split("my_word-list separated-by_delims", &Boundary::delims())
)
}
#[test]
fn boundaries_found_in_string() {
use Boundary::*;
assert_eq!(
vec![UpperLower],
Boundary::list_from(".Aaaa")
);
assert_eq!(
vec![LowerUpper, UpperLower, LowerDigit],
Boundary::list_from("a8.Aa.aA")
);
assert_eq!(
Boundary::digits(),
Boundary::list_from("b1B1b")
);
assert_eq!(
vec![Hyphen, Underscore, Space, Acronym],
Boundary::list_from("AAa -_")
);
}
}