Textonyms: Difference between revisions

=={{header|Java}}==

{{trans|c++}}

<lang java>

import java.io.IOException;

import java.nio.charset.StandardCharsets;

import java.nio.file.Path;

import java.nio.file.Paths;

import java.util.Arrays;

import java.util.HashMap;

import java.util.List;

import java.util.Map;

import java.util.Scanner;

import java.util.Vector;

public class RTextonyms {

private static final Map<Character, Character> mapping;

private int total, elements, textonyms, max_found;

private String filename, mappingResult;

private Vector<String> max_strings;

private Map<String, Vector<String>> values;

static {

mapping = new HashMap<Character, Character>();

mapping.put('A', '2'); mapping.put('B', '2'); mapping.put('C', '2');

mapping.put('D', '3'); mapping.put('E', '3'); mapping.put('F', '3');

mapping.put('G', '4'); mapping.put('H', '4'); mapping.put('I', '4');

mapping.put('J', '5'); mapping.put('K', '5'); mapping.put('L', '5');

mapping.put('M', '6'); mapping.put('N', '6'); mapping.put('O', '6');

mapping.put('P', '7'); mapping.put('Q', '7'); mapping.put('R', '7'); mapping.put('S', '7');

mapping.put('T', '8'); mapping.put('U', '8'); mapping.put('V', '8');

mapping.put('W', '9'); mapping.put('X', '9'); mapping.put('Y', '9'); mapping.put('Z', '9');

}

public RTextonyms(String filename) {

this.filename = filename;

this.total = this.elements = this.textonyms = this.max_found = 0;

this.values = new HashMap<String, Vector<String>>();

this.max_strings = new Vector<String>();

return;

}

public void add(String line) {

String mapping = "";

total++;

if (!get_mapping(line)) {

return;

}

mapping = mappingResult;

if (values.get(mapping) == null) {

values.put(mapping, new Vector<String>());

}

int num_strings;

num_strings = values.get(mapping).size();

textonyms += num_strings == 1 ? 1 : 0;

elements++;

if (num_strings > max_found) {

max_strings.clear();

max_strings.add(mapping);

max_found = num_strings;

}

else if (num_strings == max_found) {

max_strings.add(mapping);

}

values.get(mapping).add(line);

return;

}

public void results() {

System.out.printf("Read %,d words from %s%n%n", total, filename);

System.out.printf("There are %,d words in %s which can be represented by the digit key mapping.%n", elements,

filename);

System.out.printf("They require %,d digit combinations to represent them.%n", values.size());

System.out.printf("%,d digit combinations represent Textonyms.%n", textonyms);

System.out.printf("The numbers mapping to the most words map to %,d words each:%n", max_found + 1);

for (String key : max_strings) {

System.out.printf("%16s maps to: %s%n", key, values.get(key).toString());

}

System.out.println();

return;

}

public void match(String key) {

Vector<String> match;

match = values.get(key);

if (match == null) {

System.out.printf("Key %s not found%n", key);

}

else {

System.out.printf("Key %s matches: %s%n", key, match.toString());

}

return;

}

private boolean get_mapping(String line) {

mappingResult = line;

StringBuilder mappingBuilder = new StringBuilder();

for (char cc : line.toCharArray()) {

if (Character.isAlphabetic(cc)) {

mappingBuilder.append(mapping.get(Character.toUpperCase(cc)));

}

else if (Character.isDigit(cc)) {

mappingBuilder.append(cc);

}

else {

return false;

}

}

mappingResult = mappingBuilder.toString();

return true;

}

public static void main(String[] args) {

String filename = "./unixdict.txt";

RTextonyms tc;

tc = new RTextonyms(filename);

Path fp = Paths.get(filename);

try (Scanner fs = new Scanner(fp, StandardCharsets.UTF_8.name())) {

while (fs.hasNextLine()) {

tc.add(fs.nextLine());

}

}

catch (IOException ex) {

ex.printStackTrace();

}

List<String> numbers = Arrays.asList(

"001", "228", "27484247", "7244967473642",

"."

);

tc.results();

for (String number : numbers) {

if (number.equals(".")) {

System.out.println();

}

else {

tc.match(number);

}

}

return;

}

}

</lang>

{{out|Output with "java RTextonyms ./unixdict.txt"}}

<pre>

Read 25,104 words from ./unixdict.txt

There are 24,988 words in ./unixdict.txt which can be represented by the digit key mapping.

They require 22,905 digit combinations to represent them.

1,477 digit combinations represent Textonyms.

The numbers mapping to the most words map to 9 words each:

269 maps to: [amy, any, bmw, bow, box, boy, cow, cox, coy]

729 maps to: [paw, pax, pay, paz, raw, ray, saw, sax, say]

Key 001 not found

Key 228 matches: [aau, act, bat, cat]

Key 27484247 not found

Key 7244967473642 matches: [schizophrenia, schizophrenic]

</pre>