Execute a Markov algorithm: Difference between revisions

Content added Content deleted

Inline

@@ Line 1,383: / Line 1,383: @@
 =={{header|D}}==
 {{trans|Perl}}
+<lang d>void main() {
-<lang d>import std.stdio, std.array, std.file, std.regex, std.string,
-       std.range;
+    import std.stdio, std.file, std.regex, std.string, std.range,
+           std.functional;
+    const rules = "markov_rules.txt".readText.splitLines.split("");
-void main() {
-    string[][] rules = readText("markov_rules.txt").splitLines()
+    auto tests = "markov_tests.txt".readText.splitLines;
+    auto re = ctRegex!(r"^([^#]*?)\s+->\s+(\.?)(.*)"); // 160 MB RAM.
-                       .split("");
-    auto tests = readText("markov_tests.txt").splitLines();
-    auto re = ctRegex!(r"^([^#]*?)\s+->\s+(\.?)(.*)"); // 130 MB RAM.
-    auto pairs = zip(StoppingPolicy.requireSameLength, tests, rules);
+    alias slZip = curry!(zip, StoppingPolicy.requireSameLength);
-    foreach (test, rule; pairs) {
+    foreach (test, const rule; slZip(tests, rules)) {
-        auto origTest = test.dup;
+        const origTest = test.dup;
         string[][] capt;
-        foreach (line; rule) {
+        foreach (const line; rule) {
             auto m = line.match(re);
-            if (!m.empty)
+            if (!m.empty) {
-                capt ~= m.captures.array()[1 .. $];
+                //capt.put(m.captures.dropOne);
+                capt ~= m.captures.dropOne.array;
+            }
         }
     REDO:
-        auto copy = test;
+        const copy = test;
-        foreach (c; capt) {
+        foreach (const c; capt) {
             test = test.replace(c[0], c[2]);
             if (c[1] == ".")