update

Task/Number-names/PureBasic/number-names-2.purebasic

@@ -1,48 +1,64 @@
+TENS = [None, None, "twenty", "thirty", "forty",
+        "fifty", "sixty", "seventy", "eighty", "ninety"]
+SMALL = ["zero", "one", "two", "three", "four", "five",
+         "six", "seven", "eight", "nine", "ten", "eleven",
+         "twelve", "thirteen", "fourteen", "fifteen",
+         "sixteen", "seventeen", "eighteen", "nineteen"]
+HUGE = [None, None] + [h + "illion"
+                       for h in ("m", "b", "tr", "quadr", "quint", "sext",
+                                  "sept", "oct", "non", "dec")]
+
+def nonzero(c, n, connect=''):
+    return "" if n == 0 else connect + c + spell_integer(n)
+
+def last_and(num):
+    if ',' in num:
+        pre, last = num.rsplit(',', 1)
+        if ' and ' not in last:
+            last = ' and' + last
+        num = ''.join([pre, ',', last])
+    return num
+
+def big(e, n):
+    if e == 0:
+        return spell_integer(n)
+    elif e == 1:
+        return spell_integer(n) + " thousand"
+    else:
+        return spell_integer(n) + " " + HUGE[e]
+
+def base1000_rev(n):
+    # generates the value of the digits of n in base 1000
+    # (i.e. 3-digit chunks), in reverse.
+    while n != 0:
+        n, r = divmod(n, 1000)
+        yield r
+
 def spell_integer(n):
-    tens = [None, None, "twenty", "thirty", "forty",
-            "fifty", "sixty", "seventy", "eighty", "ninety"]
-
-    small = ["zero", "one", "two", "three", "four", "five",
-             "six", "seven", "eight", "nine", "ten", "eleven",
-             "twelve", "thirteen", "fourteen", "fifteen",
-             "sixteen", "seventeen", "eighteen", "nineteen"]
-
-    bl = [None, None, "m", "b", "tr", "quadr",
-          "quint", "sext", "sept", "oct", "non", "dec"]
-
-    def nonzero(c, n):
-        return "" if n == 0 else c + spell_integer(n)
-
-    def big(e, n):
-        if e == 0:
-            return spell_integer(n)
-        elif e == 1:
-            return spell_integer(n) + " thousand"
-        else:
-            return spell_integer(n) + " " + bl[e] + "illion"
-
-    def base1000_rev(n):
-        # generates the value of the digits of n in base 1000
-        # (i.e. 3-digit chunks), in reverse.
-        while n != 0:
-            n, r = divmod(n, 1000)
-            yield r
-
     if n < 0:
-        return "negative " + spell_integer(-n)
+        return "minus " + spell_integer(-n)
     elif n < 20:
-        return small[n]
+        return SMALL[n]
     elif n < 100:
         a, b = divmod(n, 10)
-        return tens[a] + nonzero("-", b)
+        return TENS[a] + nonzero("-", b)
     elif n < 1000:
         a, b = divmod(n, 100)
-        return small[a] + " hundred" + nonzero(" ", b)
+        return SMALL[a] + " hundred" + nonzero(" ", b, ' and')
     else:
-        return ", ".join([big(e, x) for e, x in
-                          enumerate(base1000_rev(n)) if x][::-1])
+        num = ", ".join([big(e, x) for e, x in
+                         enumerate(base1000_rev(n)) if x][::-1])
+        return last_and(num)
 
-# example
-print spell_integer(1278)
-print spell_integer(1752)
-print spell_integer(2010)
+if __name__ == '__main__':
+    # examples
+    for n in (0, -3, 5, -7, 11, -13, 17, -19, 23, -29):
+        print('%+4i -> %s' % (n, spell_integer(n)))
+    print('')
+
+    n = 201021002001
+    while n:
+        print('%-12i -> %s' % (n, spell_integer(n)))
+        n //= -10
+    print('%-12i -> %s' % (n, spell_integer(n)))
+    print('')