Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- 同样作为链表&队列数据结构,Linux的list.h同BSD的queue.h设计各有千秋。前者有环形双链(list)和哈希双链(hlist),后者有四个SLIST/LIST/STAILQ/TAILQ,LIST对应哈希双链,TAILQ对应环形双链;编码风格上,前者内联函数可读性显然要比后者的宏清晰很多,执行速度上说不定内联还要快一些。个人喜欢前者
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement