Last letter-first letter: Difference between revisions

Content deleted Content added

Inline

@@ Line 1,255: / Line 1,255: @@
        std.container, std.range;
-auto findChain(in string[] seq) /*pure nothrow*/ {
+auto findChain(in string[] seq) /*pure*/ nothrow {
     const adj = seq
-                .map!(item => tuple(item,
+                .map!(item => tuple(item, seq
-                                    seq
+                                          .filter!(x => x[0] == item[$ - 1])
-                                    .filter!(x => x[0] == item[$-1])
+                                          .array))
-                                    .array))
                 .assocArray;
     SList!string res;
-    foreach (immutable item; adj.byKey) { // Not nothrow.
+    foreach (immutable item; adj.byKey) {
         void inner(in string it, SList!string lst) nothrow {
             lst.insertFront(it);