Unnamed repository; edit this file 'description' to name the repository.
Log | Files | Refs | README (905B)

      1 # Nullhash
      3 This is my own idea, but it's based on other things. It's either a simple array, or a synthesis of two dynamically-allocated structures - a simple array, and a ring buffer. The array's objects are pointers to voids. The dynamic ring buffer is a "magazine" of ssize_ts representing deallocated positions. It's not intended that you use the synthesis to build a hash table upon, as in the hash table example, you don't have as much control of the key as in, say, a thread table, or something where the application doesn't even need to see your keys.
      5 If you need to iterate over the items in a nullhash, your structure should be a linked list also containing your key. A means of creating a linked list will be supplied.
      7 UTHash does all the things - it hashes, it creates a table, and it does the linked list thing. Nullhash does none of that by itself - you have to do that.
      9 (Am I Sisyphus?)