摘要:
ANALYSIS OF SKIP LIST ALGORITHMS 跳跃链表的算法分析 The time required to execute the Search, Delete and Insert operations is dominated by the time required to 阅读全文
摘要:
Skip Lists: A Probabilistic Alternative to Balanced Trees William Pugh 跳跃列表: 一种平衡树的概率代替方案--作者 William Pugh Skip lists are a data structure that can be 阅读全文
摘要:
/* ZSETs are ordered sets using two data structures to hold the same elements * in order to get O(log(N)) INSERT and REMOVE operations into a sorted * 阅读全文
摘要:
*********************************************************************** /* Given a pointer 'p' to the prevlen info that prefixes an entry, this * func 阅读全文
摘要:
1 /* Optional callback used for iterators and be notified on each rax node, 2 * including nodes not representing keys. If the callback returns true 3 阅读全文
摘要:
************************************************************************************ /* Remove the specified item. Returns 1 if the item was found and 阅读全文
摘要:
*********************************************************************************** /* Allocate a new rax and return its pointer. On out of memory the 阅读全文