Mercurial > gemma
view pkg/octree/loader.go @ 2130:f3aabc05f9b2
Fix constraints on waterway profiles
staging_done in the UNIQUE constraint had no effect, because the
exclusion constraint prevented two rows with equal location and
validity anyhow. Adding staging_done to the exclusion constraint
makes the UNIQUE constraint checking only a corner case of what
the exclusion constraint checks. Thus, remove the UNIQUE constraint.
Casting staging_done to int is needed because there is no appropriate
operator class for booleans. Casting to smallint or even bit would have
been better (i.e. should result in smaller index size), but that would
have required creating such a CAST, in addition.
author | Tom Gottfried <tom@intevation.de> |
---|---|
date | Wed, 06 Feb 2019 15:42:32 +0100 |
parents | f4dcbe8941a1 |
children | 86c7a023400e |
line wrap: on
line source
// This is Free Software under GNU Affero General Public License v >= 3.0 // without warranty, see README.md and license for details. // // SPDX-License-Identifier: AGPL-3.0-or-later // License-Filename: LICENSES/AGPL-3.0.txt // // Copyright (C) 2018 by via donau // – Österreichische Wasserstraßen-Gesellschaft mbH // Software engineering by Intevation GmbH // // Author(s): // * Sascha L. Teichmann <sascha.teichmann@intevation.de> package octree import ( "bufio" "bytes" "encoding/binary" "log" "github.com/golang/snappy" ) func loadReader(r *bufio.Reader) (*Tree, error) { tree := new(Tree) if err := binary.Read(r, binary.LittleEndian, &tree.EPSG); err != nil { return nil, err } log.Printf("info: EPSG: %d\n", tree.EPSG) if err := tree.Min.Read(r); err != nil { return nil, err } if err := tree.Max.Read(r); err != nil { return nil, err } log.Printf("info: BBOX: [[%f, %f, %f], [%f, %f, %f]]\n", tree.Min.X, tree.Min.Y, tree.Min.Z, tree.Max.X, tree.Max.Y, tree.Max.Z) var numVertices uint32 if err := binary.Read(r, binary.LittleEndian, &numVertices); err != nil { return nil, err } log.Printf("info: vertices: %d\n", numVertices) vertices := make([]Vertex, numVertices) tree.vertices = vertices for i := range vertices { if err := vertices[i].Read(r); err != nil { return nil, err } } var numTriangles uint32 if err := binary.Read(r, binary.LittleEndian, &numTriangles); err != nil { return nil, err } log.Printf("info: triangles: %d\n", numTriangles) indices := make([]int32, 3*numTriangles) triangles := make([][]int32, numTriangles) tree.triangles = triangles var last int32 for i := range triangles { tri := indices[:3] indices = indices[3:] triangles[i] = tri for j := range tri { v, err := binary.ReadVarint(r) if err != nil { return nil, err } value := int32(v) + last tri[j] = value last = value } } var numNodes uint32 if err := binary.Read(r, binary.LittleEndian, &numNodes); err != nil { return nil, err } log.Printf("info: num nodes: %d\n", numNodes) tree.index = make([]int32, numNodes) entries := tree.index[1:] last = 0 for i := range entries { v, err := binary.ReadVarint(r) if err != nil { return nil, err } value := int32(v) + last entries[i] = value last = value } return tree, nil } func deserialize(data []byte) (*Tree, error) { return loadReader( bufio.NewReader( snappy.NewReader( bytes.NewReader(data)))) }