9bdcbe0447
Major integrations and fixes: - Added BACKBEAT SDK integration for P2P operation timing - Implemented beat-aware status tracking for distributed operations - Added Docker secrets support for secure license management - Resolved KACHING license validation via HTTPS/TLS - Updated docker-compose configuration for clean stack deployment - Disabled rollback policies to prevent deployment failures - Added license credential storage (CHORUS-DEV-MULTI-001) Technical improvements: - BACKBEAT P2P operation tracking with phase management - Enhanced configuration system with file-based secrets - Improved error handling for license validation - Clean separation of KACHING and CHORUS deployment stacks 🤖 Generated with [Claude Code](https://claude.ai/code) Co-Authored-By: Claude <noreply@anthropic.com>
81 lines
2.8 KiB
Go
81 lines
2.8 KiB
Go
// Copyright 2020 Google Inc. All rights reserved.
|
|
//
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
// you may not use this file except in compliance with the License.
|
|
// You may obtain a copy of the License at
|
|
//
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
// See the License for the specific language governing permissions and
|
|
// limitations under the License.
|
|
|
|
package s2
|
|
|
|
// A RegionUnion represents a union of possibly overlapping regions. It is
|
|
// convenient for computing a covering of a set of regions. However, note
|
|
// that currently, using RegionCoverer to compute coverings of RegionUnions
|
|
// may produce coverings with considerably less than the requested number of
|
|
// cells in cases of overlapping or tiling regions. This occurs because the
|
|
// current RegionUnion.Contains implementation for Cells only returns
|
|
// true if the cell is fully contained by one of the regions. So, cells along
|
|
// internal boundaries in the region union will be subdivided by the coverer
|
|
// even though this is unnecessary, using up the maxSize cell budget. Then,
|
|
// when the coverer normalizes the covering, groups of 4 sibling cells along
|
|
// these internal borders will be replaced by parents, resulting in coverings
|
|
// that may have significantly fewer than maxSize cells, and so are less
|
|
// accurate. This is not a concern for unions of disjoint regions.
|
|
type RegionUnion []Region
|
|
|
|
// CapBound returns a bounding cap for this RegionUnion.
|
|
func (ru RegionUnion) CapBound() Cap { return ru.RectBound().CapBound() }
|
|
|
|
// RectBound returns a bounding latitude-longitude rectangle for this RegionUnion.
|
|
func (ru RegionUnion) RectBound() Rect {
|
|
ret := EmptyRect()
|
|
for _, reg := range ru {
|
|
ret = ret.Union(reg.RectBound())
|
|
}
|
|
return ret
|
|
}
|
|
|
|
// ContainsCell reports whether the given Cell is contained by this RegionUnion.
|
|
//
|
|
// The current implementation only returns true if one of the regions in the
|
|
// union fully contains the cell.
|
|
func (ru RegionUnion) ContainsCell(c Cell) bool {
|
|
for _, reg := range ru {
|
|
if reg.ContainsCell(c) {
|
|
return true
|
|
}
|
|
}
|
|
return false
|
|
}
|
|
|
|
// IntersectsCell reports whether this RegionUnion intersects the given cell.
|
|
func (ru RegionUnion) IntersectsCell(c Cell) bool {
|
|
for _, reg := range ru {
|
|
if reg.IntersectsCell(c) {
|
|
return true
|
|
}
|
|
}
|
|
return false
|
|
}
|
|
|
|
// ContainsPoint reports whether this RegionUnion contains the Point.
|
|
func (ru RegionUnion) ContainsPoint(p Point) bool {
|
|
for _, reg := range ru {
|
|
if reg.ContainsPoint(p) {
|
|
return true
|
|
}
|
|
}
|
|
return false
|
|
}
|
|
|
|
// CellUnionBound computes a covering of the RegionUnion.
|
|
func (ru RegionUnion) CellUnionBound() []CellID {
|
|
return ru.CapBound().CellUnionBound()
|
|
}
|