Mercurial > gemma
view pkg/octree/node.go @ 4016:9ab7e1056360
Optimize index setup a bit
Optimize column order in multi-column indexes created automatically
for constraints in order to match access patterns better. This
makes the extra indexes on measure_date obsolete.
Add a further index for fast retrieval of newest measurement
per location, which is currently needed in some VIEWs for GeoServer.
author | Tom Gottfried <tom@intevation.de> |
---|---|
date | Fri, 19 Jul 2019 14:30:14 +0200 |
parents | 4fa92d468164 |
children |
line wrap: on
line source
// Copyright (C) 2018 Michael Fogleman // // Permission is hereby granted, free of charge, to any person obtaining // a copy of this software and associated documentation files (the "Software"), // to deal in the Software without restriction, including without limitation // the rights to use, copy, modify, merge, publish, distribute, sublicense, // and/or sell copies of the Software, and to permit persons to whom the // Software is furnished to do so, subject to the following conditions: // // The above copyright notice and this permission notice shall be included // in all copies or substantial portions of the Software. // // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS // OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL // THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. package octree type node struct { i int32 t int32 prev *node next *node } func newNode(nodes []node, i int32, prev *node) *node { n := &nodes[i] n.i = i if prev == nil { n.prev = n n.next = n } else { n.next = prev.next n.prev = prev prev.next.prev = n prev.next = n } return n } func (n *node) remove() *node { n.prev.next = n.next n.next.prev = n.prev n.i = -1 return n.prev }