don't be n^2 for removal, lol. i should probably switch to rust's robin hood hashing - it isn't that much code and supposedly performs much better when the table gets full. *however*, it requires checking the hash of every entry in the chain during insert, which basically means storing it, which means more memory usage ... but by allowing fuller tables it could decrease memory usage. but if you have a big table anyway to avoid copying, you don't want *extra*... and storing the hash twice in the simple case is so dumb feeling. dunno.2015-07-13T03:00:57+00:00comex2015-07-13T03:00:57+00:00985b1043b6285031cee976f5eeb8512a07e7acbb
fix my hash table algorithm - argh2015-07-12T23:25:22+00:00comex2015-07-12T23:25:22+00:00d07d1dd683bcdc70edb26fc38719f38a591f1468
redo crash reporting - untested (but it compiles)2015-07-12T20:44:58+00:00comex2015-07-12T20:42:48+00:0041aefc7572abb3c689774354231217aaafe0b01a
A number of critical fixes painstakingly discovered in the slowest way possible.2015-03-02T04:07:15+00:00comex2015-03-02T04:07:15+00:007f24621bec0b0a5b3cab9ec2dfc68929a2d49d25
make jump-dis use a vec as a stack, rather than a hacky queue2015-03-01T18:26:58+00:00comex2015-03-01T18:26:58+00:00220bc631f92890d09d7473eb62e80966faaefc4d