3 * Adapt more implementations to take opaque key data and a comparison
4 function, as in set_func.h, skip_cas_func.c
6 * Adapt implementations for use in various kernels
8 * Implement key-pointer/comparison function versions of more structures, in
13 * It would be attractive to develop an implementation of the priority queue
14 implementation described in
16 H. Sundell and P. Tsigas, “Fast and Lock-Free Concurrent Priority
17 Queues for Multi-Thread Systems,” in Proceedings of the 17th Inter-
18 national Parallel and Distributed Processing Symposium, 11 pp., IEEE
21 (A more up-to-date description is available in the Ph.D. thesis of H°akan
24 * It would be interesting to compare the CAS skiplist implementation here with
25 that in the H°akan Sundell thesis, Ch. 6, which claims to have better