-------
- verify the memory management of keys in list, skiplist, and hashtable
- transaction tests
-- port perf tests from lib-high-scale
-- characterize the performance of hashtable vs. skiplist vs. list
- validate function arguments in interface functions
- document usage
- document algorithms
optimization
------------
- investigate 16 byte CAS; ht can store GUIDs inline instead of pointers to actual keys
-- write after write can just update the old update record instead of pushing a new one
+- txn write after write can just update the old update record instead of pushing a new one
- use a shared scan for write-set validation in txn, similar to ht copy logic
- experiment with the performance impact of not passing the hash between functions in ht
- experiment with embedding the nstring keys in the list/skiplist nodes
+- lower skiplist's high_water when the actual number of levels in use drops
+- non-power-of 2 sized hashtables for improved memory usage
+- mem2
features
--------