fc85777a21
* core: reinit chain from freezer in batches * core/rawdb: concurrent database reinit from freezer dump * core/rawdb: reinit from freezer in sequential order
79 lines
2.3 KiB
Go
Executable File
79 lines
2.3 KiB
Go
Executable File
// CookieJar - A contestant's algorithm toolbox
|
|
// Copyright (c) 2013 Peter Szilagyi. All rights reserved.
|
|
//
|
|
// CookieJar is dual licensed: use of this source code is governed by a BSD
|
|
// license that can be found in the LICENSE file. Alternatively, the CookieJar
|
|
// toolbox may be used in accordance with the terms and conditions contained
|
|
// in a signed written agreement between you and the author(s).
|
|
|
|
// This is a duplicated and slightly modified version of "gopkg.in/karalabe/cookiejar.v2/collections/prque".
|
|
|
|
// Package prque implements a priority queue data structure supporting arbitrary
|
|
// value types and int64 priorities.
|
|
//
|
|
// If you would like to use a min-priority queue, simply negate the priorities.
|
|
//
|
|
// Internally the queue is based on the standard heap package working on a
|
|
// sortable version of the block based stack.
|
|
package prque
|
|
|
|
import (
|
|
"container/heap"
|
|
)
|
|
|
|
// Priority queue data structure.
|
|
type Prque struct {
|
|
cont *sstack
|
|
}
|
|
|
|
// New creates a new priority queue.
|
|
func New(setIndex SetIndexCallback) *Prque {
|
|
return &Prque{newSstack(setIndex)}
|
|
}
|
|
|
|
// Pushes a value with a given priority into the queue, expanding if necessary.
|
|
func (p *Prque) Push(data interface{}, priority int64) {
|
|
heap.Push(p.cont, &item{data, priority})
|
|
}
|
|
|
|
// Peek returns the value with the greates priority but does not pop it off.
|
|
func (p *Prque) Peek() (interface{}, int64) {
|
|
item := p.cont.blocks[0][0]
|
|
return item.value, item.priority
|
|
}
|
|
|
|
// Pops the value with the greates priority off the stack and returns it.
|
|
// Currently no shrinking is done.
|
|
func (p *Prque) Pop() (interface{}, int64) {
|
|
item := heap.Pop(p.cont).(*item)
|
|
return item.value, item.priority
|
|
}
|
|
|
|
// Pops only the item from the queue, dropping the associated priority value.
|
|
func (p *Prque) PopItem() interface{} {
|
|
return heap.Pop(p.cont).(*item).value
|
|
}
|
|
|
|
// Remove removes the element with the given index.
|
|
func (p *Prque) Remove(i int) interface{} {
|
|
if i < 0 {
|
|
return nil
|
|
}
|
|
return heap.Remove(p.cont, i)
|
|
}
|
|
|
|
// Checks whether the priority queue is empty.
|
|
func (p *Prque) Empty() bool {
|
|
return p.cont.Len() == 0
|
|
}
|
|
|
|
// Returns the number of element in the priority queue.
|
|
func (p *Prque) Size() int {
|
|
return p.cont.Len()
|
|
}
|
|
|
|
// Clears the contents of the priority queue.
|
|
func (p *Prque) Reset() {
|
|
*p = *New(p.cont.setIndex)
|
|
}
|