本来想分析一下libevent实现的链表,队列,最小椎,哈希表这三个数据结构的,后来发现网上已经有人写过分析了,我就不重要造轮子啦。
上链接:
1:TAILQ队列(compat/sys/queue.h): http://bachmozart.iteye.com/blog/292836
2:最小堆(minheap-internal.h): http://www.cppblog.com/kevinlynx/archive/2008/07/18/56511.html
3:哈希表(ht-internal.h): http://blog.csdn.net/jiayp004/article/details/13508627
上链接:
1:TAILQ队列(compat/sys/queue.h): http://bachmozart.iteye.com/blog/292836
2:最小堆(minheap-internal.h): http://www.cppblog.com/kevinlynx/archive/2008/07/18/56511.html
3:哈希表(ht-internal.h): http://blog.csdn.net/jiayp004/article/details/13508627