libhl-1.4.1

• bugfixing

libhl-1.4

• introduced a red/black tree implementation (rbtree.[ch])
• bugfixes in the hashtable implementation
  (potential race conditions when setting new values while the table is being grown)
• cleanings and minor fixes

libhl-1.3

• extended the semantic of return codes in the link list iterator
• bugfixes

libhl-1.2.2

• introduced two new functions: fbuf_read_ln() and fbuf_fread_ln()

libhl-1.2.1

• fixed all the issues reported by the clang static analyzer
  NOTE: all the fixed issues were minor and unlikely to happen so it's not vital to upgrade
  from libhl-1.2

libhl-1.2

• new function ht_exists()
• removed some unused variable to make it build with stricter compiler's options

libhl-1.1

Renamed 'rbuf' API to 'rqueue' API , since it actually implements a lock-free queue using a ring buffer to implement the queue. But by itself allows to push/pop pointers out of the ring buffer but it doesn't allow writing/reading actual bytes.
'rqueue' represents an alternative to 'queue' which is still a lock-free queue implementation which instead uses a (dynamically growing) double-linked list instead of a ring buffer.

Introduced a new ring buffer API 'rbuf' which is instead an actual circular buffer and allows writing/reading bytes. It's opposed to fbuf which instead implements a flat buffer which grows linearly.

The documentation has been improved across the whole library.

libhl-1.0

Merge pull request #1 from dgryski/linklist-pick-tagged-value-segfault

linklist: handle NULL returns from pick_tagged_value()