-
Notifications
You must be signed in to change notification settings - Fork 2.3k
/
NumberFullScanNonUniqueIndexSamplerTest.java
102 lines (92 loc) · 3.56 KB
/
NumberFullScanNonUniqueIndexSamplerTest.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
/*
* Copyright (c) 2002-2018 "Neo4j,"
* Neo4j Sweden AB [http://neo4j.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 org.junit.Test;
import java.io.IOException;
import org.neo4j.index.internal.gbptree.GBPTree;
import org.neo4j.index.internal.gbptree.Writer;
import org.neo4j.io.pagecache.IOLimiter;
import org.neo4j.storageengine.api.schema.IndexSample;
import org.neo4j.values.storable.NumberValue;
import org.neo4j.values.storable.RandomValues;
import org.neo4j.values.storable.Value;
import org.neo4j.values.storable.ValueGroup;
import static org.junit.Assert.assertEquals;
import static org.neo4j.kernel.impl.index.schema.LayoutTestUtil.countUniqueValues;
import static org.neo4j.kernel.impl.index.schema.NativeIndexKey.Inclusion.NEUTRAL;
public class NumberFullScanNonUniqueIndexSamplerTest extends NativeIndexTestUtil<NumberIndexKey,NativeIndexValue>
{
@Test
public void shouldIncludeAllValuesInTree() throws Exception
{
// GIVEN
Value[] values = generateNumberValues();
buildTree( values );
// WHEN
IndexSample sample;
try ( GBPTree<NumberIndexKey,NativeIndexValue> gbpTree = getTree() )
{
FullScanNonUniqueIndexSampler<NumberIndexKey,NativeIndexValue> sampler =
new FullScanNonUniqueIndexSampler<>( gbpTree, layout );
sample = sampler.result();
}
// THEN
assertEquals( values.length, sample.sampleSize() );
assertEquals( countUniqueValues( values ), sample.uniqueValues() );
assertEquals( values.length, sample.indexSize() );
}
private Value[] generateNumberValues()
{
RandomValues.Type[] numberTypes = RandomValues.including( t -> t.valueGroup == ValueGroup.NUMBER );
int size = 20;
Value[] result = new NumberValue[size];
for ( int i = 0; i < size; i++ )
{
result[i] = randomValues.nextValueOfTypes( numberTypes );
}
return result;
}
private void buildTree( Value[] values ) throws IOException
{
try ( GBPTree<NumberIndexKey,NativeIndexValue> gbpTree = getTree() )
{
try ( Writer<NumberIndexKey,NativeIndexValue> writer = gbpTree.writer() )
{
NumberIndexKey key = layout.newKey();
NativeIndexValue value = layout.newValue();
long nodeId = 0;
for ( Value number : values )
{
key.initialize( nodeId );
key.initFromValue( 0, number, NEUTRAL );
value.from( number );
writer.put( key, value );
nodeId++;
}
}
gbpTree.checkpoint( IOLimiter.UNLIMITED );
}
}
@Override
protected LayoutTestUtil<NumberIndexKey,NativeIndexValue> createLayoutTestUtil()
{
return new NumberNonUniqueLayoutTestUtil();
}
}