6257ddba78
The big change is that the GeoJSON package has been completely rewritten to fix a few of geometry calculation bugs, increase performance, and to better follow the GeoJSON spec RFC 7946. GeoJSON updates - A LineString now requires at least two points. - All json members, even foreign, now persist with the object. - The bbox member persists too but is no longer used for geometry calculations. This is change in behavior. Previously Tile38 would treat the bbox as the object's physical rectangle. - Corrections to geometry intersects and within calculations. Faster spatial queries - The performance of Point-in-polygon and object intersect operations are greatly improved for complex polygons and line strings. It went from O(n) to roughly O(log n). - The same for all collection types with many children, including FeatureCollection, GeometryCollection, MultiPoint, MultiLineString, and MultiPolygon. Codebase changes - The pkg directory has been renamed to internal - The GeoJSON internal package has been moved to a seperate repo at https://github.com/tidwall/geojson. It's now vendored. Please look out for higher memory usage for datasets using complex shapes. A complex shape is one that has 64 or more points. For these shapes it's expected that there will be increase of least 54 bytes per point.
115 lines
1.8 KiB
Go
115 lines
1.8 KiB
Go
package expire
|
|
|
|
import (
|
|
"sync"
|
|
"time"
|
|
)
|
|
|
|
// Item is a something that can expire
|
|
type Item interface {
|
|
Expires() time.Time
|
|
}
|
|
|
|
// List of expireable items
|
|
type List struct {
|
|
mu sync.Mutex
|
|
queue queue
|
|
bgrun bool
|
|
Expired func(item Item)
|
|
}
|
|
|
|
// Push an item onto the queue
|
|
func (list *List) Push(item Item) {
|
|
unix := item.Expires().UnixNano()
|
|
list.mu.Lock()
|
|
if !list.bgrun {
|
|
list.bgrun = true
|
|
go list.bg()
|
|
}
|
|
list.queue.push(unix, item)
|
|
list.mu.Unlock()
|
|
}
|
|
|
|
func (list *List) bg() {
|
|
now := time.Now().UnixNano()
|
|
for {
|
|
list.mu.Lock()
|
|
if list.queue.len == 0 {
|
|
list.bgrun = false
|
|
list.mu.Unlock()
|
|
break
|
|
}
|
|
if now > list.queue.peek().unix { // now.After(list.queue.peek().unix)
|
|
n := list.queue.pop()
|
|
list.mu.Unlock()
|
|
if list.Expired != nil {
|
|
list.Expired(n.item)
|
|
}
|
|
} else {
|
|
list.mu.Unlock()
|
|
time.Sleep(time.Second / 10)
|
|
now = time.Now().UnixNano()
|
|
}
|
|
}
|
|
}
|
|
|
|
type qnode struct {
|
|
unix int64
|
|
item Item
|
|
}
|
|
|
|
type queue struct {
|
|
nodes []qnode
|
|
len int
|
|
size int
|
|
}
|
|
|
|
func (q *queue) push(unix int64, item Item) {
|
|
if q.nodes == nil {
|
|
q.nodes = make([]qnode, 2)
|
|
} else {
|
|
q.nodes = append(q.nodes, qnode{})
|
|
}
|
|
i := q.len + 1
|
|
j := i / 2
|
|
for i > 1 && q.nodes[j].unix > unix {
|
|
q.nodes[i] = q.nodes[j]
|
|
i = j
|
|
j = j / 2
|
|
}
|
|
q.nodes[i].unix = unix
|
|
q.nodes[i].item = item
|
|
q.len++
|
|
}
|
|
|
|
func (q *queue) peek() qnode {
|
|
if q.len == 0 {
|
|
return qnode{}
|
|
}
|
|
return q.nodes[1]
|
|
}
|
|
|
|
func (q *queue) pop() qnode {
|
|
if q.len == 0 {
|
|
return qnode{}
|
|
}
|
|
n := q.nodes[1]
|
|
q.nodes[1] = q.nodes[q.len]
|
|
q.len--
|
|
var j, k int
|
|
i := 1
|
|
for i != q.len+1 {
|
|
k = q.len + 1
|
|
j = 2 * i
|
|
if j <= q.len && q.nodes[j].unix < q.nodes[k].unix {
|
|
k = j
|
|
}
|
|
if j+1 <= q.len && q.nodes[j+1].unix < q.nodes[k].unix {
|
|
k = j + 1
|
|
}
|
|
q.nodes[i] = q.nodes[k]
|
|
i = k
|
|
}
|
|
return n
|
|
}
|