Use double hashing to reimplement the hash table from Figure 11.5. FIGURE 11.5 Implementation of the Table

Use double hashing to reimplement the hash table from Figure 11.5.

Transcribed Image Text:

FIGURE 11.5 Implementation of the Table Class Implementation // FILE: Table.java from the package edu.colorado.collections // Documentation is available starting on page 584 or from the Table link at // http://www.cs.colorado.edu/~main/docs/. package edu.colorado.collections; public class Table { private int manyItems; private Object[ ] keys; private Object[ ] data; private boolean[ ] hasBeenUsed; public Table(int capacity) { if (capacity <= 0) throw new IllegalArgumentException ("Capacity is negative."); keys = new Object[capacity]; data = new Object[capacity]; hasBeenUsed new boolean [capacity]; }