Simple Hash Implementation (Linear Proving)

MyHash.java

package honux;

/**
 * Simple Hash implementation 
 * It can't expand and no exception handling for put!
 * 
 * @author honux
 *
 */
public class MyHash {
    private final static int TABLE_SIZE = 128;
    private int count = 0;
    HashEntry[] table;

    public MyHash() {
          table = new HashEntry[TABLE_SIZE];
          for (int i = 0; i < TABLE_SIZE; i++)
                table[i] = null;
    }

    public int get(int key) {
          int hash = (key % TABLE_SIZE);
          while (table[hash] != null && table[hash].getKey() != key)
                hash = (hash + 1) % TABLE_SIZE;
          if (table[hash] == null)
                return -1;
          else
                return table[hash].getValue();
    }

    public void put(int key, int value) {    		  
          int hash = (key % TABLE_SIZE);
          while (table[hash] != null && table[hash].getKey() != key)
                hash = (hash + 1) % TABLE_SIZE;
          table[hash] = new HashEntry(key, value);
          count++;
    }
}

class HashEntry {
    private int key;
    private int value;

    public HashEntry(int key, int value) {
          this.key = key;
          this.value = value;
    }     

    public int getKey() {
          return key;
    }

    public int getValue() {
          return value;
    }
}