-
Notifications
You must be signed in to change notification settings - Fork 2.3k
/
SpatialLayoutTestUtil.java
139 lines (124 loc) · 4.98 KB
/
SpatialLayoutTestUtil.java
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
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
/*
* Copyright (c) 2002-2018 "Neo Technology,"
* Network Engine for Objects in Lund AB [http://neotechnology.com]
*
* This file is part of Neo4j.
*
* Neo4j is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
package org.neo4j.kernel.impl.index.schema;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import java.util.Set;
import org.neo4j.gis.spatial.index.Envelope;
import org.neo4j.gis.spatial.index.curves.HilbertSpaceFillingCurve2D;
import org.neo4j.gis.spatial.index.curves.SpaceFillingCurve;
import org.neo4j.helpers.collection.PrefetchingIterator;
import org.neo4j.index.internal.gbptree.Layout;
import org.neo4j.internal.kernel.api.IndexQuery;
import org.neo4j.kernel.api.index.IndexEntryUpdate;
import org.neo4j.kernel.api.schema.index.IndexDescriptor;
import org.neo4j.kernel.api.schema.index.IndexDescriptorFactory;
import org.neo4j.test.rule.RandomRule;
import org.neo4j.values.storable.CoordinateReferenceSystem;
import org.neo4j.values.storable.PointValue;
import org.neo4j.values.storable.Value;
import org.neo4j.values.storable.Values;
class SpatialLayoutTestUtil extends LayoutTestUtil<SpatialSchemaKey,NativeSchemaValue>
{
private CoordinateReferenceSystem crs = CoordinateReferenceSystem.WGS84;
private SpaceFillingCurve curve = new HilbertSpaceFillingCurve2D( new Envelope( -180, 180, -90, 90 ), 5 );
SpatialLayoutTestUtil()
{
super( IndexDescriptorFactory.forLabel( 42, 666 ) );
}
@Override
Layout<SpatialSchemaKey,NativeSchemaValue> createLayout()
{
return new SpatialLayoutNonUnique( crs, curve );
}
@Override
IndexEntryUpdate<IndexDescriptor>[] someUpdates()
{
return someSpatialUpdatesWithDuplicateValues();
}
@Override
protected double fractionDuplicates()
{
return 0.1;
}
@Override
IndexQuery rangeQuery( Number from, boolean fromInclusive, Number to, boolean toInclusive )
{
return IndexQuery.range( 0, (PointValue) asValue( from ), fromInclusive, (PointValue) asValue( to ), toInclusive );
}
@Override
Value asValue( Number value )
{
// multiply value with 5 to make sure the points aren't too close together, avoiding false positives that will be filtered in higher level later
return Values.pointValue( CoordinateReferenceSystem.WGS84, 3 * value.doubleValue(), 3 * value.doubleValue() );
}
@Override
int compareIndexedPropertyValue( SpatialSchemaKey key1, SpatialSchemaKey key2 )
{
return Long.compare( key1.rawValueBits, key2.rawValueBits );
}
@Override
Iterator<IndexEntryUpdate<IndexDescriptor>> randomUpdateGenerator( RandomRule random )
{
double fractionDuplicates = fractionDuplicates();
return new PrefetchingIterator<IndexEntryUpdate<IndexDescriptor>>()
{
private final Set<Long> uniqueCompareValues = new HashSet<>();
private final List<Value> uniqueValues = new ArrayList<>();
private long currentEntityId;
@Override
protected IndexEntryUpdate<IndexDescriptor> fetchNextOrNull()
{
Value value;
if ( fractionDuplicates > 0 && !uniqueValues.isEmpty() && random.nextFloat() < fractionDuplicates )
{
value = existingNonUniqueValue( random );
}
else
{
value = newUniqueValue( random );
}
return add( currentEntityId++, value );
}
private Value newUniqueValue( RandomRule randomRule )
{
double x, y;
PointValue pointValue;
Long compareValue;
do
{
x = randomRule.nextDouble() * 360 - 180;
y = randomRule.nextDouble() * 180 - 90;
pointValue = Values.pointValue( CoordinateReferenceSystem.WGS84, x, y );
compareValue = curve.derivedValueFor( pointValue.coordinate() );
}
while ( !uniqueCompareValues.add( compareValue ) );
uniqueValues.add( pointValue );
return pointValue;
}
private Value existingNonUniqueValue( RandomRule randomRule )
{
return uniqueValues.get( randomRule.nextInt( uniqueValues.size() ) );
}
};
}
}