Data commit

Task/Range-expansion/Python/range-expansion-1.py

@@ -0,0 +1,11 @@
+def rangeexpand(txt):
+    lst = []
+    for r in txt.split(','):
+        if '-' in r[1:]:
+            r0, r1 = r[1:].split('-', 1)
+            lst += range(int(r[0] + r0), int(r1) + 1)
+        else:
+            lst.append(int(r))
+    return lst
+
+print(rangeexpand('-6,-3--1,3-5,7-11,14,15,17-20'))

Task/Range-expansion/Python/range-expansion-2.py

@@ -0,0 +1,11 @@
+import re
+
+def rangeexpand(txt):
+    lst = []
+    for rng in txt.split(','):
+        start,end = re.match('^(-?\d+)(?:-(-?\d+))?$', rng).groups()
+        if end:
+            lst.extend(xrange(int(start),int(end)+1))
+        else:
+            lst.append(int(start))
+    return lst

Task/Range-expansion/Python/range-expansion-3.py

@@ -0,0 +1,102 @@
+'''Range expansion'''
+
+from functools import (reduce)
+
+
+# ------------------- EXPANSION FUNCTION -------------------
+
+# rangeExpansion :: String -> [Int]
+def rangeExpansion(s):
+    '''List of integers expanded from a
+       comma-delimited string of individual
+       numbers and hyphenated ranges.
+    '''
+    def go(a, x):
+        tpl = breakOn('-')(x[1:])
+        r = tpl[1]
+        return a + (
+            [int(x)] if not r
+            else enumFromTo(int(x[0] + tpl[0]))(
+                int(r[1:])
+            )
+        )
+    return reduce(go, s.split(','), [])
+
+
+# -------------------------- TEST --------------------------
+def main():
+    '''Expansion test'''
+
+    print(
+        fTable(__doc__ + ':')(
+            lambda x: "\n'" + str(x) + "'"
+        )(lambda x: '\n\n\t' + showList(x))(
+            rangeExpansion
+        )([
+            '-6,-3--1,3-5,7-11,14,15,17-20'
+        ])
+    )
+
+
+# ------------------- GENERIC FUNCTIONS --------------------
+
+# breakOn :: String -> String -> (String, String)
+def breakOn(needle):
+    '''A tuple of:
+       1. the prefix of haystack before needle,
+       2. the remainder of haystack, starting
+          with needle.
+    '''
+    def go(haystack):
+        xs = haystack.split(needle)
+        return (xs[0], haystack[len(xs[0]):]) if (
+            1 < len(xs)
+        ) else (haystack, '')
+    return lambda haystack: go(haystack) if (
+        needle
+    ) else None
+
+
+# enumFromTo :: Int -> Int -> [Int]
+def enumFromTo(m):
+    '''Enumeration of integer values [m..n]
+    '''
+    return lambda n: list(range(m, 1 + n))
+
+
+# fTable :: String -> (a -> String) ->
+# (b -> String) -> (a -> b) -> [a] -> String
+def fTable(s):
+    '''Heading -> x display function ->
+       fx display function -> f -> xs -> tabular string.
+    '''
+    def gox(xShow):
+        def gofx(fxShow):
+            def gof(f):
+                def goxs(xs):
+                    ys = [xShow(x) for x in xs]
+                    w = max(map(len, ys))
+
+                    def arrowed(x, y):
+                        return y.rjust(w, ' ') + ' -> ' + (
+                            fxShow(f(x))
+                        )
+                    return s + '\n' + '\n'.join(
+                        map(arrowed, xs, ys)
+                    )
+                return goxs
+            return gof
+        return gofx
+    return gox
+
+
+# showList :: [a] -> String
+def showList(xs):
+    '''Stringification of a list.
+    '''
+    return '[' + ','.join(str(x) for x in xs) + ']'
+
+
+# MAIN ---
+if __name__ == '__main__':
+    main()