| name | offer | peak | poll | size | comments |
|---|---|---|---|---|---|
| PriorityQueue | o(log(n)) | o(1) | o(log(n)) | o(1) | priority heap backed by array, reference:http://blog.csdn.net/pecywang/article/details/24024835 http://www.jianshu.com/p/9a456d1b59b5 |
| LinkedList | o(1) | o(1) | o(1) | o(1) | LinkedList underlying |
| ArrayDequeue | o(1） | o(1) | o(1) | o(1) | array underlying |
| ConcurrentLinkedQueue | o(1) | o(1) | o(1) | o(n) | head and tail node. node has item and next fields they are all volatile variables. use CAS algorithm without blocking. offer node at the tail of queue. poll node from the head of queue. CAS operation to set next of tail to new node. If failed, continue searching tail node by following next of current node. Or jump to tail node if tail is changed. Otherwise jump to head after sentinel node is found. != is not atomic. update head and tail after two hops. |
| ArrayBlockingQueue | o(1) | o(1) | o(1) | o(1) | array underlying |
| PriorirityBlockingQueue | o(log(n)) | o(1) | o(log(n)) | o(1) | priority heap based on array |
| SynchronousQueue | o(1) | o(1) | o(1) | o(1) | |
| DealyQueue | o(log(n)) | o(1) | o(log(n)) | o(1) | priority heap based on array |
| LinkedBlockingQueue | o(1) | o(1) | o(1) | o(1) |
Queue
最新推荐文章于 2022-10-04 14:24:58 发布
1613
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
