execution: convert HashTable to SnapVector
authorBrian Norris <banorris@uci.edu>
Tue, 16 Apr 2013 16:30:17 +0000 (09:30 -0700)
committerBrian Norris <banorris@uci.edu>
Tue, 16 Apr 2013 18:38:01 +0000 (11:38 -0700)
We don't actually need a hash table for threads, since we allocate their
indeces contiguously, at least for now. Also, HashTable is really
designed for pointer-based keys and may not accept a 0-valued key. To
avoid these problems, just switch to a snapshotted vector.


No differences found