soundex [1031883]

// from https://introcs.cs.princeton.edu/java/31datatype/Soundex.java.html

static S soundex(S s) { 
  if (empty(s)) ret "";
  char[] x = s.toUpperCase().toCharArray();
  char firstLetter = x[0];

  // convert letters to numeric code
  for (int i = 0; i < x.length; i++) {
      switch (x[i]) {

          case 'B':
          case 'F':
          case 'P':
          case 'V':
              x[i] = '1';
              break;

          case 'C':
          case 'G':
          case 'J':
          case 'K':
          case 'Q':
          case 'S':
          case 'X':
          case 'Z':
              x[i] = '2';
              break;

          case 'D':
          case 'T':
              x[i] = '3';
              break;

          case 'L':
              x[i] = '4';
              break;

          case 'M':
          case 'N':
              x[i] = '5';
              break;

          case 'R':
              x[i] = '6';
              break;

          default:
              x[i] = '0';
              break;
      }
  }

  // remove duplicates
  new StringBuilder output;
  output.append(firstLetter);
  for (int i = 1; i < x.length; i++)
      if (x[i] != x[i-1] && x[i] != '0')
          output.append(x[i]);

  // pad with 0's or truncate
  output.append("0000");
  return takeFirst(str(output), 4);
}

Snippet ID:	#1031883
Snippet name:	soundex
Eternal ID of this version:	#1031883/1
Text MD5:	e2a44de69600ed98ddfda4e84ac5445d
Transpilation MD5:	eb4fff2d25cd183b6d8929177c500dd8
Author:	stefan
Category:	javax
Type:	JavaX fragment (include)
Public (visible to everyone):	Yes
Archived (hidden from active list):	No
Created/modified:	2021-07-24 01:31:15
Source code size:	1369 bytes / 64 lines
Pitched / IR pitched:	No / No
Views / Downloads:	158 / 224
Referenced in:	[show references]

< > BotCompany Repo | #1031883 // soundex

JavaX fragment (include) [tags: use-pretranspiled]

1	// from https://introcs.cs.princeton.edu/java/31datatype/Soundex.java.html
2
3	static S soundex(S s) {
4	if (empty(s)) ret "";
5	char[] x = s.toUpperCase().toCharArray();
6	char firstLetter = x[0];
7
8	// convert letters to numeric code
9	for (int i = 0; i < x.length; i++) {
10	switch (x[i]) {
11
12	case 'B':
13	case 'F':
14	case 'P':
15	case 'V':
16	x[i] = '1';
17	break;
18
19	case 'C':
20	case 'G':
21	case 'J':
22	case 'K':
23	case 'Q':
24	case 'S':
25	case 'X':
26	case 'Z':
27	x[i] = '2';
28	break;
29
30	case 'D':
31	case 'T':
32	x[i] = '3';
33	break;
34
35	case 'L':
36	x[i] = '4';
37	break;
38
39	case 'M':
40	case 'N':
41	x[i] = '5';
42	break;
43
44	case 'R':
45	x[i] = '6';
46	break;
47
48	default:
49	x[i] = '0';
50	break;
51	}
52	}
53
54	// remove duplicates
55	new StringBuilder output;
56	output.append(firstLetter);
57	for (int i = 1; i < x.length; i++)
58	if (x[i] != x[i-1] && x[i] != '0')
59	output.append(x[i]);
60
61	// pad with 0's or truncate
62	output.append("0000");
63	return takeFirst(str(output), 4);
64	}