Current libraries:

• bitmap (v1.5)

  • It's a bitmap, it stores bits!
  • Wishlist:
    • FLZ/FLS
    • a for_each for ALL bits, which passes the bit # and a bool (???)
      • Rename current to for_each_set
      • Which just begs the question of for_each_unset
        • HMMMMMM...
    • Better FFZ/FFS/for_each
    • Resumeable FFS/FFZ/FLZ/FLS ?
    • Parameter checking
      • Just never give us a bad pointer or bit address and it's fine :p
    • Rename export to data (that's what C++ calls it)???

• dyn_array (v1.3)

  • It's a vector, it's a stack, it's a deque, it's all your hopes and dreams!
  • Supports destructors! Function pointers are fun.
  • Wishlist:
    • Better insert_sorted (bsearch-based)
    • shrink_to_fit (add a flag to the struct, have it be read by dyn_request_size_increase)
    • prune (remove those who match a certain criteria (via function pointer))
    • Rename export to data (that's what C++ calls it)???
    • Inserting/removing n objects at a time
      • Dyn's core already supports this, the API doesn't.
        • I didn't want to write more unit tests...

• block_store (v2.0.1)

  • Generic in-memory block storage system with optional file linking
  • Wishlist:
    • Better testing. Flush testing is a little lighter than I'd like, but I'm tired of looking at it
    • Better utility implementation, block based. Actually, may be better to just offload block work to the OS? (the way it is now)
    • Make in-memory optional, add flag (FILE_BACKED) and detect and switch internal functions if it's set
      • mmap? anonymous files? Voodoo?

Eventually (maybe):

• dyn_list

  • It's a list, it stores things!
  • Doubly-linked

• dyn_hash

  • It's a hash table, it stores AND hashes things! Exciting!

-- Will, the best TA