From 7bf6da4ecac9a80d1d07922613862a4bc4c593c8 Mon Sep 17 00:00:00 2001 From: bculkin2442 Date: Wed, 17 Aug 2016 10:41:47 -0400 Subject: Removed unused test classes --- .../bjc/RGens/text/markov/FrequencyCounter.java | 62 --------------- .../java/bjc/RGens/text/markov/SuffixCounter.java | 88 ---------------------- 2 files changed, 150 deletions(-) delete mode 100755 RGens/src/main/java/bjc/RGens/text/markov/FrequencyCounter.java delete mode 100755 RGens/src/main/java/bjc/RGens/text/markov/SuffixCounter.java diff --git a/RGens/src/main/java/bjc/RGens/text/markov/FrequencyCounter.java b/RGens/src/main/java/bjc/RGens/text/markov/FrequencyCounter.java deleted file mode 100755 index ccc8cb5..0000000 --- a/RGens/src/main/java/bjc/RGens/text/markov/FrequencyCounter.java +++ /dev/null @@ -1,62 +0,0 @@ -package bjc.RGens.text.markov; - -import java.util.*; - -/** - * Counts the frequencies of k-length substrings of input text. - * - * @author Daniel Friedman - * - */ -public class FrequencyCounter { - - /** - * Main method - * - * @param args - * CLI args - */ - public static void main(String[] args) { - String text; - - int k = 0; - - if (args.length == 1) { - k = Integer.parseInt(args[0]); - } - - System.out.print("Enter string: "); - - Scanner s = new Scanner(System.in); - text = s.nextLine(); - - Map hash = new HashMap<>(); - int distinct = 0; - - for (int i = 0; i <= text.length() - k; i++) { - String sub = text.substring(i, i + k); - - Markov m = new Markov(sub); - m.add(); - - if (hash.containsKey(sub)) { - Integer count = hash.get(sub); - hash.put(sub, count + 1); - } else { - hash.put(sub, m.count); - distinct++; - } - } - - s.close(); - System.out.println(distinct + " distinct keys"); - - Iterator keys = hash.keySet().iterator(); - - while (keys.hasNext()) { - String key = keys.next(); - Integer value = hash.get(key); - System.out.println(value + " " + key); - } - } -} diff --git a/RGens/src/main/java/bjc/RGens/text/markov/SuffixCounter.java b/RGens/src/main/java/bjc/RGens/text/markov/SuffixCounter.java deleted file mode 100755 index 8f9a076..0000000 --- a/RGens/src/main/java/bjc/RGens/text/markov/SuffixCounter.java +++ /dev/null @@ -1,88 +0,0 @@ -package bjc.RGens.text.markov; - -import java.util.HashMap; -import java.util.Iterator; -import java.util.Map; -import java.util.Map.Entry; -import java.util.Scanner; - -/** - * Similar to FrequencyCounter, but also counts the suffixes for each - * k-length substring in the text. - * - * @author Daniel Friedman - * - */ - -public class SuffixCounter { - /** - * Main method - * - * @param args - * CLI args - */ - public static void main(String[] args) { - String text; - int k = 0; - - if (args.length == 1) { - k = Integer.parseInt(args[0]); - } - - System.out.print("Enter string: "); - Scanner s = new Scanner(System.in); - text = s.nextLine(); - - Map hash = new HashMap<>(); - - int distinct = 0; - - for (int i = 0; i <= text.length() - k; i++) { - String sub = text.substring(i, i + k); - Character suffix = null; - - if (((i + k) <= (text.length() - 1))) { - suffix = text.charAt(i + k); - } - - if (hash.containsKey(sub)) { - Markov temp = hash.get(sub); - - if (!(suffix == null)) { - temp.add(suffix); - hash.put(sub, temp); - } - - } else { - Markov m; - - if (!(suffix == null)) { - m = new Markov(sub, suffix); - hash.put(sub, m); - distinct++; - } - } - } - - System.out.println(distinct + " distinct keys"); - Iterator keys = hash.keySet().iterator(); - - while (keys.hasNext()) { - String hashKey = keys.next(); - - Markov hashValue = hash.get(hashKey); - System.out.print(hashValue.count() + " " + hashKey + ":"); - - for (Entry entry : hashValue.getMap() - .entrySet()) { - char suffix = entry.getKey(); - int frequencyCount = entry.getValue(); - System.out.print(" " + frequencyCount + " " + suffix); - } - - System.out.println(); - } - - s.close(); - } -} -- cgit v1.2.3