1 + fix makefile to compute dependency lists as a side-effect of compilation (-MF)
2 + support integer keys for ht
3 + optimize tracing code, still too much overhead
4 + use NULL instead of a sentinal node in skiplist and list
5 + make the interfaces for all data structures consistent
6 + make list and skiplist use string keys
7 + optimize integer keys
14 - make rcu yield when its buffer gets full instead of throwing an assert
15 - alternate memory reclamation schemes: hazard pointers and/or reference counting
16 - seperate nbd_malloc/nbd_free into general purpose malloc/free replacement
20 - verify the key management in list, skiplist, and hashtable
22 - port perf tests from lib-high-scale
23 - characterize the performance of hashtable vs. skiplist vs. list
24 - validate function arguments in interface functions
25 - document usage of the library
30 - investigate 16 byte CAS; ht can store GUIDs inline instead of pointers to actual keys
31 - shortcut from write-set to entries/nodes
32 - use a shared scan for write-set validation, similar to ht copy logic
33 - experiment with the performance impact of not passing the hash between functions in ht
34 - experiment with embedding the keys in the list/skiplist nodes
38 - allow values of 0 to be inserted into maps (change DOES_NOT_EXIST to something other than 0)