libevent simple queue的理解
2017-08-11 16:28:16 2 举报
libevent simple queue理解
作者其他创作
大纲/内容
S1
elem
first
NULL
simple queueinit
header
S2
next
simple queueinsert_tail
last_next
S2: *(header-last_next) = &(header-first)
lots of. nodes
simple queueinsert_head again
simple queueremove head onlycan't remove tail!
S3
simple queueinsert_head(first)
S2: *(header-last_next) = elem
simple queueremove head only one left!
0 条评论
回复 删除
下一页
