eson
368447c31d
new file: LICENSE new file: README.md new file: compare/compare.go new file: for_test.go new file: heap/heap.go new file: heap/heap_test.go new file: interface.go new file: lastack/lastack.go new file: lastack/lastack_test.go new file: list/list.go new file: list/list_test.go new file: map/hashmap/hashmap.go new file: map/hashmap/hashmap_test.go new file: priority_list/iterator.go new file: priority_list/priority_list.go new file: priority_list/priority_list_test.go new file: priority_queue/iterator.go new file: priority_queue/priority_queue.go new file: priority_queue/priority_queue_test.go new file: priority_queue/vbt.go new file: priority_queue/vbt_test.go new file: priority_queuekey/iterator.go new file: priority_queuekey/priority_queuekey.go new file: priority_queuekey/priority_queuekey_test.go new file: priority_queuekey/vbt.go new file: priority_queuekey/vbt_test.go new file: set/hashset/hashset.go new file: set/hashset/hashset_test.go new file: set/treeset/treeset.go new file: set/treeset/treeset_test.go new file: sparse_array/array2/array2.go new file: sparse_array/array2/array2_test.go new file: sparse_array/array3/array3.go new file: sparse_array/array3/array3_test.go new file: sparse_array/arrayn/arrayn.go new file: sparse_array/arrayn/arrayn_test.go new file: stack/stack.go new file: stack/stack_test.go new file: tree/avl/avl.go new file: tree/avl/avl_test.go new file: tree/avl/iterator.go new file: tree/avldup/avldup.go new file: tree/avldup/avldup_test.go new file: tree/avldup/iterator.go new file: tree/avlkey/avlkey.go new file: tree/avlkey/avlkey_test.go new file: tree/avlkey/iterator.go new file: tree/avlkeydup/avlkeydup.go new file: tree/avlkeydup/avlkeydup_test.go new file: tree/avlkeydup/iterator.go new file: tree/vbt/iterator.go new file: tree/vbt/vbt.go new file: tree/vbt/vbt_test.go new file: tree/vbtkey/iterator.go new file: tree/vbtkey/vbtkey.go new file: tree/vbtkey/vbtkey_test.go
81 lines
1.8 KiB
Go
81 lines
1.8 KiB
Go
package pqueuekey
|
|
|
|
import "474420502.top/eson/structure/compare"
|
|
|
|
type PriorityQueue struct {
|
|
queue *vbTree
|
|
}
|
|
|
|
func (pq *PriorityQueue) Iterator() *Iterator {
|
|
return NewIterator(pq.queue.top)
|
|
}
|
|
|
|
func New(Compare compare.Compare) *PriorityQueue {
|
|
return &PriorityQueue{queue: newVBT(Compare)}
|
|
}
|
|
|
|
func (pq *PriorityQueue) Size() int {
|
|
return pq.queue.Size()
|
|
}
|
|
|
|
func (pq *PriorityQueue) Push(key, value interface{}) {
|
|
pq.queue.Put(key, value)
|
|
}
|
|
|
|
func (pq *PriorityQueue) Top() (result interface{}, ok bool) {
|
|
if pq.queue.top != nil {
|
|
return pq.queue.top.value, true
|
|
}
|
|
return nil, false
|
|
}
|
|
|
|
func (pq *PriorityQueue) Pop() (result interface{}, ok bool) {
|
|
if pq.queue.top != nil {
|
|
result = pq.queue.top.value
|
|
pq.queue.removeNode(pq.queue.top)
|
|
return result, true
|
|
}
|
|
return nil, false
|
|
}
|
|
|
|
func (pq *PriorityQueue) Index(idx int) (interface{}, bool) {
|
|
return pq.queue.Index(idx)
|
|
}
|
|
|
|
func (pq *PriorityQueue) IndexNode(idx int) (*Node, bool) {
|
|
n := pq.queue.indexNode(idx)
|
|
return n, n != nil
|
|
}
|
|
|
|
func (pq *PriorityQueue) Get(key interface{}) (interface{}, bool) {
|
|
return pq.queue.Get(key)
|
|
}
|
|
|
|
func (pq *PriorityQueue) GetNode(key interface{}) (*Node, bool) {
|
|
return pq.queue.GetNode(key)
|
|
}
|
|
|
|
func (pq *PriorityQueue) GetAround(key interface{}) [3]interface{} {
|
|
return pq.queue.GetAround(key)
|
|
}
|
|
|
|
func (pq *PriorityQueue) GetAroundNode(key interface{}) [3]*Node {
|
|
return pq.queue.getArounNode(key)
|
|
}
|
|
|
|
func (pq *PriorityQueue) GetRange(k1, k2 interface{}) []interface{} {
|
|
return pq.queue.GetRange(k1, k2)
|
|
}
|
|
|
|
func (pq *PriorityQueue) RemoveIndex(idx int) (interface{}, bool) {
|
|
return pq.queue.RemoveIndex(idx)
|
|
}
|
|
|
|
func (pq *PriorityQueue) Remove(key interface{}) (interface{}, bool) {
|
|
return pq.queue.Remove(key)
|
|
}
|
|
|
|
func (pq *PriorityQueue) Values() []interface{} {
|
|
return pq.queue.Values()
|
|
}
|