- if existing_name.len > count {
- if existing_name.len - count != 1 || levenstein_not_1(&interned_name, &existing_name.interned) {
- continue;
- }
- } else if existing_name.len < count {
- if count - existing_name.len != 1 || levenstein_not_1(&existing_name.interned, &interned_name) {
- continue;
- }
- } else {
- let mut interned_chars = interned_name.chars();
- let mut existing_chars = existing_name.interned.chars();
- let first_i = interned_chars.next().expect("we know we have at least one char");
- let first_e = existing_chars.next().expect("we know we have at least one char");
- let eq_or_numeric = |(a, b): (char, char)| a == b || a.is_numeric() && b.is_numeric();
-
- if eq_or_numeric((first_i, first_e)) {
- let last_i = interned_chars.next_back().expect("we know we have at least two chars");
- let last_e = existing_chars.next_back().expect("we know we have at least two chars");
- if eq_or_numeric((last_i, last_e)) {
- if interned_chars
- .zip(existing_chars)
- .filter(|&ie| !eq_or_numeric(ie))
- .count()
- != 1
- {
- continue;
+ match existing_name.len.cmp(&count) {
+ Ordering::Greater => {
+ if existing_name.len - count != 1
+ || levenstein_not_1(&interned_name, &existing_name.interned.as_str())
+ {
+ continue;
+ }
+ },
+ Ordering::Less => {
+ if count - existing_name.len != 1
+ || levenstein_not_1(&existing_name.interned.as_str(), &interned_name)
+ {
+ continue;
+ }
+ },
+ Ordering::Equal => {
+ let mut interned_chars = interned_name.chars();
+ let interned_str = existing_name.interned.as_str();
+ let mut existing_chars = interned_str.chars();
+ let first_i = interned_chars.next().expect("we know we have at least one char");
+ let first_e = existing_chars.next().expect("we know we have at least one char");
+ let eq_or_numeric = |(a, b): (char, char)| a == b || a.is_numeric() && b.is_numeric();
+
+ if eq_or_numeric((first_i, first_e)) {
+ let last_i = interned_chars.next_back().expect("we know we have at least two chars");
+ let last_e = existing_chars.next_back().expect("we know we have at least two chars");
+ if eq_or_numeric((last_i, last_e)) {
+ if interned_chars
+ .zip(existing_chars)
+ .filter(|&ie| !eq_or_numeric(ie))
+ .count()
+ != 1
+ {
+ continue;
+ }
+ } else {
+ let second_last_i = interned_chars
+ .next_back()
+ .expect("we know we have at least three chars");
+ let second_last_e = existing_chars
+ .next_back()
+ .expect("we know we have at least three chars");
+ if !eq_or_numeric((second_last_i, second_last_e))
+ || second_last_i == '_'
+ || !interned_chars.zip(existing_chars).all(eq_or_numeric)
+ {
+ // allowed similarity foo_x, foo_y
+ // or too many chars differ (foo_x, boo_y) or (foox, booy)
+ continue;
+ }
+ split_at = interned_name.char_indices().rev().next().map(|(i, _)| i);