Experimented with concurrentHashMap and HashTable; CHM is concurrent, but uses ~5 times the memory
hashStorage dumps to stdout
Java Mergesort implementation working; ready to time
Clean-up of java-learning repo.
My HashMap's contructor can verify power of 2 size
Demo of Object.hashCode() & how to implement overloaded hashCode given instance variables
HashMap can be added to, but i think there is a bug on insert; it needs to believe in a circular buffer
I think hashmap is working. need to keep testing
Yeah HashMap put() is working, stderr output when map is full
hashmap.get() is working; Resize is next
Hashtable is demonstrating how after a point, collisions are nearly 100% certain, until the resize happens
Hashmap now doubles size when half-full; it runs ~9x faster on 1M elements
INIT Heap.java
Working on Heap, going to get food.
Heap is able to add
Heap can add,poll,peek,sort
Heap clean-up
Stack, started & finished
Queue via Doubly Linked List
BinaryTree INIT; sleeptime.