summaryrefslogtreecommitdiff
path: root/src/main/java/bjc/rgens/text
diff options
context:
space:
mode:
authorBenjamin J. Culkin <bjculkin@mix.wvu.edu>2019-08-28 19:50:36 -0300
committerBenjamin J. Culkin <bjculkin@mix.wvu.edu>2019-08-28 19:50:36 -0300
commit1914335b9505b0086a0aeed0997c566e0e5ceca3 (patch)
tree9ab2b53aa18f945c1693d503b555fef8a1032fc5 /src/main/java/bjc/rgens/text
parentb7193cf955e7b2d2474d728c4087bc36597f0c7f (diff)
Add additional comments & such
Diffstat (limited to 'src/main/java/bjc/rgens/text')
-rwxr-xr-xsrc/main/java/bjc/rgens/text/markov/Markov.java5
1 files changed, 5 insertions, 0 deletions
diff --git a/src/main/java/bjc/rgens/text/markov/Markov.java b/src/main/java/bjc/rgens/text/markov/Markov.java
index e21d60f..45f5b39 100755
--- a/src/main/java/bjc/rgens/text/markov/Markov.java
+++ b/src/main/java/bjc/rgens/text/markov/Markov.java
@@ -148,6 +148,11 @@ public class Markov {
return map;
}
+ /*
+ * @TODO @PERF Ben Culkin 7/21/2019 :PerfSelect
+ * Couldn't we come up some better way to do the random sampling? Maybe use
+ * like the reservoir sampling stuff, or build the array list ahead of time?
+ */
/**
* Using probability, returns a pseudo-random character to follow the
* substring.