public class HashTable {	
	private static class Node {
		public String key;
		public String value;
	}
	
	private Node[] table = new Node[101];	
	private int size = 0;
	
	private int hash(String key) { }	
	private int step(String key) { }
	private int nextPrime(int length) { }	
	private boolean isPrime(int number) { }	
	
	public boolean containsKey(String key) { }	
	public boolean put( String key, String value ) { }
	public String get( String key ) { }
}