cfc65a13f6
This commit includes updates that affects the build, testing, and
deployment of Tile38.
- The root level build.sh has been broken up into multiple scripts
and placed in the "scripts" directory.
- The vendor directory has been updated to follow the Go modules
rules, thus `make` should work on isolated environments. Also
some vendored packages may have been updated to a later
version, if needed.
- The Makefile has been updated to allow for making single
binaries such as `make tile38-server`. There is some scaffolding
during the build process, so from now on all binaries should be
made using make. For example, to run a development version of
the tile38-cli binary, do this:
make tile38-cli && ./tile38-cli
not this:
go run cmd/tile38-cli/main.go
- Travis.CI docker push script has been updated to address a
change to Docker's JSON repo meta output, which in turn fixes
a bug where new Tile38 versions were not being properly pushed
to Docker
87 lines
1.3 KiB
Go
87 lines
1.3 KiB
Go
package tinyqueue
|
|
|
|
type Queue struct {
|
|
length int
|
|
data []Item
|
|
}
|
|
|
|
type Item interface {
|
|
Less(Item) bool
|
|
}
|
|
|
|
func New(data []Item) *Queue {
|
|
q := &Queue{}
|
|
q.data = data
|
|
q.length = len(data)
|
|
if q.length > 0 {
|
|
i := q.length >> 1
|
|
for ; i >= 0; i-- {
|
|
q.down(i)
|
|
}
|
|
}
|
|
return q
|
|
}
|
|
|
|
func (q *Queue) Push(item Item) {
|
|
q.data = append(q.data, item)
|
|
q.length++
|
|
q.up(q.length - 1)
|
|
}
|
|
func (q *Queue) Pop() Item {
|
|
if q.length == 0 {
|
|
return nil
|
|
}
|
|
top := q.data[0]
|
|
q.length--
|
|
if q.length > 0 {
|
|
q.data[0] = q.data[q.length]
|
|
q.down(0)
|
|
}
|
|
q.data = q.data[:len(q.data)-1]
|
|
return top
|
|
}
|
|
func (q *Queue) Peek() Item {
|
|
if q.length == 0 {
|
|
return nil
|
|
}
|
|
return q.data[0]
|
|
}
|
|
func (q *Queue) Len() int {
|
|
return q.length
|
|
}
|
|
func (q *Queue) down(pos int) {
|
|
data := q.data
|
|
halfLength := q.length >> 1
|
|
item := data[pos]
|
|
for pos < halfLength {
|
|
left := (pos << 1) + 1
|
|
right := left + 1
|
|
best := data[left]
|
|
if right < q.length && data[right].Less(best) {
|
|
left = right
|
|
best = data[right]
|
|
}
|
|
if !best.Less(item) {
|
|
break
|
|
}
|
|
data[pos] = best
|
|
pos = left
|
|
}
|
|
data[pos] = item
|
|
}
|
|
|
|
func (q *Queue) up(pos int) {
|
|
data := q.data
|
|
item := data[pos]
|
|
for pos > 0 {
|
|
parent := (pos - 1) >> 1
|
|
current := data[parent]
|
|
if !item.Less(current) {
|
|
break
|
|
}
|
|
data[pos] = current
|
|
pos = parent
|
|
}
|
|
data[pos] = item
|
|
}
|