mirror of https://github.com/tidwall/tile38.git
251 lines
5.5 KiB
Go
251 lines
5.5 KiB
Go
|
package geojson
|
||
|
|
||
|
import (
|
||
|
"bytes"
|
||
|
"encoding/binary"
|
||
|
|
||
|
"github.com/tidwall/tile38/geojson/geohash"
|
||
|
)
|
||
|
|
||
|
// FeatureCollection is a geojson object with the type "FeatureCollection"
|
||
|
type FeatureCollection struct {
|
||
|
Features []Object
|
||
|
BBox *BBox
|
||
|
}
|
||
|
|
||
|
func fillFeatureCollectionMap(m map[string]interface{}) (FeatureCollection, []byte, error) {
|
||
|
var g FeatureCollection
|
||
|
switch v := m["features"].(type) {
|
||
|
default:
|
||
|
return g, nil, errInvalidFeaturesMember
|
||
|
case nil:
|
||
|
return g, nil, errFeaturesMemberRequired
|
||
|
case []interface{}:
|
||
|
g.Features = make([]Object, len(v))
|
||
|
for i, v := range v {
|
||
|
m, ok := v.(map[string]interface{})
|
||
|
if !ok {
|
||
|
return g, nil, errInvalidFeature
|
||
|
}
|
||
|
o, err := objectMap(m, fcoll)
|
||
|
if err != nil {
|
||
|
return g, nil, err
|
||
|
}
|
||
|
g.Features[i] = o
|
||
|
}
|
||
|
}
|
||
|
var err error
|
||
|
g.BBox, err = fillBBox(m)
|
||
|
return g, nil, err
|
||
|
}
|
||
|
|
||
|
func fillFeatureCollectionBytes(b []byte, bbox *BBox, isCordZ bool) (FeatureCollection, []byte, error) {
|
||
|
var err error
|
||
|
var g FeatureCollection
|
||
|
g.BBox = bbox
|
||
|
if len(b) < 4 {
|
||
|
return g, nil, errNotEnoughData
|
||
|
}
|
||
|
g.Features = make([]Object, int(binary.LittleEndian.Uint32(b)))
|
||
|
b = b[4:]
|
||
|
for i := 0; i < len(g.Features); i++ {
|
||
|
g.Features[i], b, err = objectBytes(b)
|
||
|
if err != nil {
|
||
|
return g, b, err
|
||
|
}
|
||
|
}
|
||
|
return g, b, nil
|
||
|
}
|
||
|
|
||
|
// Geohash converts the object to a geohash value.
|
||
|
func (g FeatureCollection) Geohash(precision int) (string, error) {
|
||
|
p := g.CalculatedPoint()
|
||
|
return geohash.Encode(p.Y, p.X, precision)
|
||
|
}
|
||
|
|
||
|
// CalculatedPoint is a point representation of the object.
|
||
|
func (g FeatureCollection) CalculatedPoint() Position {
|
||
|
return g.CalculatedBBox().center()
|
||
|
}
|
||
|
|
||
|
// CalculatedBBox is exterior bbox containing the object.
|
||
|
func (g FeatureCollection) CalculatedBBox() BBox {
|
||
|
if g.BBox != nil {
|
||
|
return *g.BBox
|
||
|
}
|
||
|
var bbox BBox
|
||
|
for i, g := range g.Features {
|
||
|
if i == 0 {
|
||
|
bbox = g.CalculatedBBox()
|
||
|
} else {
|
||
|
bbox = bbox.union(g.CalculatedBBox())
|
||
|
}
|
||
|
}
|
||
|
return bbox
|
||
|
}
|
||
|
|
||
|
// PositionCount return the number of coordinates.
|
||
|
func (g FeatureCollection) PositionCount() int {
|
||
|
var res int
|
||
|
for _, g := range g.Features {
|
||
|
res += g.PositionCount()
|
||
|
}
|
||
|
if g.BBox != nil {
|
||
|
return 2 + res
|
||
|
}
|
||
|
return res
|
||
|
}
|
||
|
|
||
|
// Weight returns the in-memory size of the object.
|
||
|
func (g FeatureCollection) Weight() int {
|
||
|
var res int
|
||
|
for _, g := range g.Features {
|
||
|
res += g.Weight()
|
||
|
}
|
||
|
return res
|
||
|
}
|
||
|
|
||
|
// MarshalJSON allows the object to be encoded in json.Marshal calls.
|
||
|
func (g FeatureCollection) MarshalJSON() ([]byte, error) {
|
||
|
return []byte(g.JSON()), nil
|
||
|
}
|
||
|
|
||
|
// JSON is the json representation of the object. This might not be exactly the same as the original.
|
||
|
func (g FeatureCollection) JSON() string {
|
||
|
var buf bytes.Buffer
|
||
|
buf.WriteString(`{"type":"FeatureCollection","features":[`)
|
||
|
for i, g := range g.Features {
|
||
|
if i != 0 {
|
||
|
buf.WriteByte(',')
|
||
|
}
|
||
|
buf.WriteString(g.JSON())
|
||
|
}
|
||
|
buf.WriteByte(']')
|
||
|
g.BBox.write(&buf)
|
||
|
buf.WriteByte('}')
|
||
|
return buf.String()
|
||
|
}
|
||
|
|
||
|
// Bytes is the bytes representation of the object.
|
||
|
func (g FeatureCollection) Bytes() []byte {
|
||
|
var buf bytes.Buffer
|
||
|
isCordZ := g.BBox.isCordZDefined()
|
||
|
writeHeader(&buf, featureCollection, g.BBox, isCordZ)
|
||
|
b := make([]byte, 4)
|
||
|
binary.LittleEndian.PutUint32(b, uint32(len(g.Features)))
|
||
|
buf.Write(b)
|
||
|
for _, g := range g.Features {
|
||
|
buf.Write(g.Bytes())
|
||
|
}
|
||
|
return buf.Bytes()
|
||
|
}
|
||
|
func (g FeatureCollection) bboxPtr() *BBox {
|
||
|
return g.BBox
|
||
|
}
|
||
|
func (g FeatureCollection) hasPositions() bool {
|
||
|
if g.BBox != nil {
|
||
|
return true
|
||
|
}
|
||
|
for _, g := range g.Features {
|
||
|
if g.hasPositions() {
|
||
|
return true
|
||
|
}
|
||
|
}
|
||
|
return false
|
||
|
}
|
||
|
|
||
|
// WithinBBox detects if the object is fully contained inside a bbox.
|
||
|
func (g FeatureCollection) WithinBBox(bbox BBox) bool {
|
||
|
if g.BBox != nil {
|
||
|
return rectBBox(g.CalculatedBBox()).InsideRect(rectBBox(bbox))
|
||
|
}
|
||
|
if len(g.Features) == 0 {
|
||
|
return false
|
||
|
}
|
||
|
for _, g := range g.Features {
|
||
|
if !g.WithinBBox(bbox) {
|
||
|
return false
|
||
|
}
|
||
|
}
|
||
|
return true
|
||
|
}
|
||
|
|
||
|
// IntersectsBBox detects if the object intersects a bbox.
|
||
|
func (g FeatureCollection) IntersectsBBox(bbox BBox) bool {
|
||
|
if g.BBox != nil {
|
||
|
return rectBBox(g.CalculatedBBox()).IntersectsRect(rectBBox(bbox))
|
||
|
}
|
||
|
for _, g := range g.Features {
|
||
|
if g.IntersectsBBox(bbox) {
|
||
|
return false
|
||
|
}
|
||
|
}
|
||
|
return true
|
||
|
}
|
||
|
|
||
|
// Within detects if the object is fully contained inside another object.
|
||
|
func (g FeatureCollection) Within(o Object) bool {
|
||
|
return withinObjectShared(g, o,
|
||
|
func(v Polygon) bool {
|
||
|
if len(g.Features) == 0 {
|
||
|
return false
|
||
|
}
|
||
|
for _, f := range g.Features {
|
||
|
if !f.Within(o) {
|
||
|
return false
|
||
|
}
|
||
|
}
|
||
|
return true
|
||
|
},
|
||
|
func(v MultiPolygon) bool {
|
||
|
if len(g.Features) == 0 {
|
||
|
return false
|
||
|
}
|
||
|
for _, f := range g.Features {
|
||
|
if !f.Within(o) {
|
||
|
return false
|
||
|
}
|
||
|
}
|
||
|
return true
|
||
|
},
|
||
|
)
|
||
|
}
|
||
|
|
||
|
// Intersects detects if the object intersects another object.
|
||
|
func (g FeatureCollection) Intersects(o Object) bool {
|
||
|
return intersectsObjectShared(g, o,
|
||
|
func(v Polygon) bool {
|
||
|
if len(g.Features) == 0 {
|
||
|
return false
|
||
|
}
|
||
|
for _, f := range g.Features {
|
||
|
if f.Intersects(o) {
|
||
|
return true
|
||
|
}
|
||
|
}
|
||
|
return false
|
||
|
},
|
||
|
func(v MultiPolygon) bool {
|
||
|
if len(g.Features) == 0 {
|
||
|
return false
|
||
|
}
|
||
|
for _, f := range g.Features {
|
||
|
if f.Intersects(o) {
|
||
|
return true
|
||
|
}
|
||
|
}
|
||
|
return false
|
||
|
},
|
||
|
)
|
||
|
}
|
||
|
|
||
|
// Nearby detects if the object is nearby a position.
|
||
|
func (g FeatureCollection) Nearby(center Position, meters float64) bool {
|
||
|
return nearbyObjectShared(g, center.X, center.Y, meters)
|
||
|
}
|
||
|
|
||
|
// IsBBoxDefined returns true if the object has a defined bbox.
|
||
|
func (g FeatureCollection) IsBBoxDefined() bool {
|
||
|
return g.BBox != nil
|
||
|
}
|