#!/usr/bin/env python

'''Implementation of a simple hash table.
The table has `hash`, `get` and `set` methods.
The hash function uses a very basic hash algorithm to insert the value
into the table.
'''


class HashItem(object):
    def __init__(self, key, value):
        self.key = key
        self.value = value


class Hash(object):
    def __init__(self, size=1024):
        self.table = []
        for i in range(size):
            self.table.append(list())

    def hash(self, key):
        hash_value = 0
        for i in key:
            hash_value += ord(key)
        return hash_value % len(self.table)

    def get(self, key):
        hashed_key = self.hash(key)
        for k in self.table[hashed_key]:
            if k[0] == key:
                return k[1]
        else:
            raise KeyError('Value not found')

    def set(self):
        pass

#!/usr/bin/env python

'''Implementation of a simple hash table.
The table has `hash`, `get` and `set` methods.
The hash function uses a very basic hash algorithm to insert the value
into the table.
'''


class HashItem(object):
    def __init__(self, key, value):
        self.key = key
        self.value = value


class Hash(object):
    def __init__(self, size=1024):
        self.table = []
        for i in range(size):
            self.table.append(list())

    def hash(self, key):
        hash_value = 0
        for i in key:
            hash_value += ord(key)
        return hash_value % len(self.table)

    def get(self, key):
        hashed_key = self.hash(key)
        for k in self.table[hashed_key]:
            if k[0] == key:
                return k[1]
        else:
            raise KeyError('Value not found')

    def set(self, key, val):
        hashed_key = self.hash(key)
        self.table[hashed_key].append((key, val))

Build out set function of hash table class; still need to deal with outcome of setting multiple values to same key
Build out set function of hash table class; still need to deal with outcome of setting multiple values to same key
