librfn/list: A simple singly linked list implementation
authorDaniel Thompson <daniel@redfelineninja.org.uk>
Mon, 7 Jan 2013 22:01:31 +0000 (22:01 +0000)
committerDaniel Thompson <daniel@redfelineninja.org.uk>
Mon, 7 Jan 2013 22:01:31 +0000 (22:01 +0000)
commit6bb8cfbeda0db4193e21b6e7fed2e73f2f3b43fc
treecc5e18cf2d5026b29b9390d5c49c4746f84a33dd
parenta77f0650c893bf38886af852c07881acf6ef1a9d
librfn/list: A simple singly linked list implementation

This implementation is nothing especially magical. Noteable points:

- list maintains a tail pointer to allow optimized insertation at the end
  as well as the start of the list
- iterators include (safe) insertion and removal operations that do not
  invalidate the iterator.
- designed to work well with the containerof()

Signed-off-by: Daniel Thompson <daniel@redfelineninja.org.uk>
.gitignore
Makefile-librfn.am
src/librfn/include/librfn.h
src/librfn/include/librfn/list.h [new file with mode: 0644]
src/librfn/list.c [new file with mode: 0644]
src/librfn/tests/listtest.c [new file with mode: 0644]