I'm looking for an open source C implementation of a hash table which keeps all the data in a memory block, That's why it's easy to send to a network. I can only find people who allocate small pieces of memory for every important value pair.
Long ago thanks for all inputs.
EDIT: This is not necessary to have a hash table, which will probably do the key-value pair table. Current Unix System I will probably use a shared memory buffer (see), or if it is in memory If the mapped file is not available with the MAP_SHARED flag, then looking at OS-specific differences, however
if both shm_open and mmap are not available You can still use the file on the disk (to a lesser extent), you have to pay attention to the proper locking, d in the next process, Send lock signal and possibly to seek part of the updated file, then the process is locked again to the file, it updates the signs that interesting role and normally received (update / delete / etc).
In any case, you can design the layout of the hashtable or whatever you want, such as looking for fixed width keys / pairs, thus you have access to your hashtable key fast If necessary, then you should look for the data portion, then copy / delete / modify etc.
Ideally this file should be on a RAM disk, of course.
Comments
Post a Comment