1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
|
/*
Copyright 2016 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
import (
"testing"
)
// testShape is a minimal implementation of the Shape interface for use in testing
// until such time as there are other s2 types that implement it.
type testShape struct {
a, b Point
edges int
}
func newTestShape() *testShape { return &testShape{} }
func (s *testShape) NumEdges() int { return s.edges }
func (s *testShape) Edge(id int) (a, b Point) { return s.a, s.b }
func (s *testShape) dimension() dimension { return pointGeometry }
func (s *testShape) numChains() int { return 0 }
func (s *testShape) chainStart(i int) int { return 0 }
func (s *testShape) HasInterior() bool { return false }
func (s *testShape) ContainsOrigin() bool { return false }
func TestShapeIndexBasics(t *testing.T) {
si := NewShapeIndex()
s := newTestShape()
if si.Len() != 0 {
t.Errorf("initial index should be empty after creation")
}
si.Add(s)
if si.Len() == 0 {
t.Errorf("index should not be empty after adding shape")
}
si.Reset()
if si.Len() != 0 {
t.Errorf("index should be empty after reset")
}
}
func TestShapeIndexCellBasics(t *testing.T) {
s := &shapeIndexCell{}
if len(s.shapes) != 0 {
t.Errorf("len(s.shapes) = %v, want %d", len(s.shapes), 0)
}
// create some clipped shapes to add.
c1 := &clippedShape{}
s.add(c1)
c2 := newClippedShape(7, 1)
s.add(c2)
c3 := &clippedShape{}
s.add(c3)
// look up the element at a given index
if got := s.shapes[1]; got != c2 {
t.Errorf("%v.shapes[%d] = %v, want %v", s, 1, got, c2)
}
// look for the clipped shape that is part of the given shape.
if got := s.findByID(7); got != c2 {
t.Errorf("%v.findByID(%v) = %v, want %v", s, 7, got, c2)
}
}
|
