Returns a data structure to be a hash table bucket The only requirements of a hash table bucket are that we can: 1. Insert items (`add` method) 2. Remove items (`remove` method) 3. Iterate through items (`iterator` method) Each of these methods is supported by java.util.Collection, Most data st
()
| 69 | * OWN BUCKET DATA STRUCTURES WITH THE NEW OPERATOR! |
| 70 | */ |
| 71 | protected Collection<Node> createBucket() { |
| 72 | return null; |
| 73 | } |
| 74 | |
| 75 | /** |
| 76 | * Returns a table to back our hash table. As per the comment |
nothing calls this directly
no outgoing calls
no test coverage detected