# HG changeset patch
# User Jeff Hammel <k0scist@gmail.com>
# Date 1477699070 25200
# Node ID b5a59c3e44210cb674b30fb07bb70d714594b4d1
# Parent  bea4dd61ae45aa8963a5379f51e355e8597df858
more fixups, for example, but lets throw it away anyway

diff -r bea4dd61ae45 -r b5a59c3e4421 python/prime.py
--- a/python/prime.py	Fri Oct 28 16:14:10 2016 -0700
+++ b/python/prime.py	Fri Oct 28 16:57:50 2016 -0700
@@ -1,6 +1,14 @@
 #!/usr/bin/env python
 
+"""
+print prime numbers for each argument given
+"""
+
 def prime(number):
+    """determines if `number` is prime"""
+    # XXX this is owefully inefficient and is written as
+    # a (bad) example only
+
     half = int(number / 2)
     for i in range(2, half):
         if not number % i:
@@ -14,6 +22,10 @@
 
 
 if __name__ == '__main__':
-    import sys
-    for arg in sys.argv[1:]:
-        print prime(int(arg))
+    import argparse
+    parser = argparse.ArgumentParser(description=__doc__)
+    parser.add_argument('arg', type=int, nargs='+',
+                        help="(positive) integer to find the primes for")
+    options = parser.parse_args()
+    for arg in options.arg:
+        print prime(arg)