"""

 Author: Eugen Sawin <sawine@informatik.uni-freiburg.de>

 """

 import math

 def main():    

     args = parse_arguments()

     if args.d:

         probe = double_hash

     elif args.l:

         probe = linear_probing

     elif args.q:

         probe = quadratic_probing

     else:

         print "you need to select a probing procedure"

         exit()

     table = {}

     for key in args.values.split():

         table = hash(int(key), args.table_size, table, probe)

     for k, v in table.iteritems():      

         print "%i: %i" % (k, v)

     #print "%s: %i" % (key, double_hash(int(key), used))

 def hash(k, size, table, probe):

     j = 0

     code = h(k, size) % size

     while code in table:

         j += 1

         code = (h(k, size) - probe(j, k, size)) % size

     table[code] = k

     return table

 def linear_probing(j, k, size):

     return j

 def quadratic_probing(j, k, size):

     return (-1)**j * math.ceil(j/2.0)**2

 def double_hash(j, k, size):

     return j * h2(k, size)

 def h(k, size):

     return k % size

 def h2(k, size):

     return 1 + (k % (size - 2)) 

 from argparse import ArgumentParser

 def parse_arguments():

     parser = ArgumentParser(description="Returns the hash for given string using the double-hash technique.")

     parser.add_argument("table_size", type=int, help="size of the hash table")

     parser.add_argument("values", help="values")    

     parser.add_argument("-d", action="store_true", help="double hashing")

     parser.add_argument("-l", action="store_true", help="linear probing")

     parser.add_argument("-q", action="store_true", help="quadratic probing")

     return parser.parse_args()

 if __name__ == "__main__":

     main()