-
Notifications
You must be signed in to change notification settings - Fork 2.3k
/
DuplicateCheckingCollector.java
141 lines (126 loc) · 4.46 KB
/
DuplicateCheckingCollector.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
140
141
/*
* Copyright (c) 2002-2017 "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.api.impl.schema.verification;
import org.apache.lucene.document.Document;
import org.apache.lucene.index.LeafReader;
import org.apache.lucene.index.LeafReaderContext;
import org.apache.lucene.search.SimpleCollector;
import java.io.IOException;
import java.util.Arrays;
import org.neo4j.kernel.api.StatementConstants;
import org.neo4j.kernel.api.exceptions.KernelException;
import org.neo4j.kernel.api.exceptions.index.IndexEntryConflictException;
import org.neo4j.kernel.api.impl.schema.LuceneDocumentStructure;
import org.neo4j.kernel.api.index.PropertyAccessor;
import org.neo4j.kernel.api.properties.Property;
import org.neo4j.kernel.api.schema_new.OrderedPropertyValues;
public class DuplicateCheckingCollector extends SimpleCollector
{
private final PropertyAccessor accessor;
private final int propertyKeyId;
private EntrySet actualValues;
private LeafReader reader;
public DuplicateCheckingCollector( PropertyAccessor accessor, int propertyKeyId )
{
this.accessor = accessor;
this.propertyKeyId = propertyKeyId;
actualValues = new EntrySet();
}
@Override
public void collect( int doc ) throws IOException
{
try
{
doCollect( doc );
}
catch ( KernelException e )
{
throw new IllegalStateException( "Indexed node should exist and have the indexed property.", e );
}
catch ( IndexEntryConflictException e )
{
throw new IOException( e );
}
}
private void doCollect( int doc ) throws IOException, KernelException, IndexEntryConflictException
{
Document document = reader.document( doc );
long nodeId = LuceneDocumentStructure.getNodeId( document );
Property property = accessor.getProperty( nodeId, propertyKeyId );
// We either have to find the first conflicting entry set element,
// or append one for the property we just fetched:
EntrySet current = actualValues;
scan:
do
{
for ( int i = 0; i < EntrySet.INCREMENT; i++ )
{
Object value = current.value[i];
if ( current.nodeId[i] == StatementConstants.NO_SUCH_NODE )
{
current.value[i] = property.value();
current.nodeId[i] = nodeId;
if ( i == EntrySet.INCREMENT - 1 )
{
current.next = new EntrySet();
}
break scan;
}
else if ( property.valueEquals( value ) )
{
throw new IndexEntryConflictException( current.nodeId[i], nodeId, value );
}
}
current = current.next;
}
while ( current != null );
}
@Override
protected void doSetNextReader( LeafReaderContext context ) throws IOException
{
this.reader = context.reader();
}
@Override
public boolean needsScores()
{
return false;
}
public void reset()
{
actualValues = new EntrySet();
}
/**
* A small struct of arrays of nodeId + property value pairs, with a next pointer.
* Should exhibit fairly fast linear iteration, small memory overhead and dynamic growth.
* <p>
* NOTE: Must always call reset() before use!
*/
private static class EntrySet
{
static final int INCREMENT = 10000;
Object[] value = new Object[INCREMENT];
long[] nodeId = new long[INCREMENT];
EntrySet next;
EntrySet()
{
Arrays.fill( nodeId, StatementConstants.NO_SUCH_NODE );
}
}
}