I am in need of a Open Source C++ implementation of a hash table that has a way to rehash an entry without calling malloc/new or free/delete. By rehash I mean, I need to change the value of the hash key on an entry in the hash table. Changing the key will cause the entry to move to a new location in the hash table. The no-malloc-calls requirement is very important. I'll be using the hash table from inside a garbage collection algorithm and calls to the malloc library will result in deadlocks. I'd prefer to not implement this myself if an implementation already exists. Does anyone know of such a beast? CAVEAT: it doesn't actually have to be a hash table. A tree of some sort meeting the no-malloc-calls requirement will work also. Mike P.S. For those interested, I need this for a JVMPI based Java performance profiler agent. When the JVM garbage collector runs it can choose to move objects around in memory. The profiler agent must track these movements and track them in a way that does not use the malloc library. _______________________________________________ tclug-devel mailing list tclug-devel at mn-linux.org https://mailman.real-time.com/mailman/listinfo/tclug-devel