forked from apache/lucenenet
/
IntersectsPrefixTreeFilter.cs
128 lines (110 loc) · 4.52 KB
/
IntersectsPrefixTreeFilter.cs
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
using Lucene.Net.Index;
using Lucene.Net.Search;
using Lucene.Net.Spatial.Prefix.Tree;
using Lucene.Net.Util;
using Spatial4n.Shapes;
using System;
using System.IO;
namespace Lucene.Net.Spatial.Prefix
{
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You 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.
*/
/// <summary>
/// A Filter matching documents that have an <see cref="SpatialRelation.INTERSECTS"/>
/// (i.e. not DISTINCT) relationship with a provided query shape.
///
/// @lucene.internal
/// </summary>
public class IntersectsPrefixTreeFilter : AbstractVisitingPrefixTreeFilter
{
private readonly bool hasIndexedLeaves;
public IntersectsPrefixTreeFilter(IShape queryShape, string fieldName,
SpatialPrefixTree grid, int detailLevel,
int prefixGridScanLevel, bool hasIndexedLeaves)
: base(queryShape, fieldName, grid, detailLevel, prefixGridScanLevel)
{
this.hasIndexedLeaves = hasIndexedLeaves;
}
public override bool Equals(object? o)
{
return base.Equals(o) && hasIndexedLeaves == ((IntersectsPrefixTreeFilter)o).hasIndexedLeaves;
}
/// <summary>
/// LUCENENET specific: need to override GetHashCode to
/// prevent a compiler warning and realistically, the hash code
/// should work similarly to Equals.
/// </summary>
public override int GetHashCode()
{
int h = base.GetHashCode();
h ^= hasIndexedLeaves.GetHashCode(); // reversible
return h;
}
/// <exception cref="IOException"></exception>
public override DocIdSet? GetDocIdSet(AtomicReaderContext context, IBits acceptDocs)
{
return new VisitorTemplateAnonymousClass(this, context, acceptDocs, hasIndexedLeaves).GetDocIdSet();
}
#region Nested type: VisitorTemplateAnonymousClass
private sealed class VisitorTemplateAnonymousClass : VisitorTemplate
{
private FixedBitSet? results;
public VisitorTemplateAnonymousClass(IntersectsPrefixTreeFilter outerInstance, AtomicReaderContext context, IBits acceptDocs, bool hasIndexedLeaves)
: base(outerInstance, context, acceptDocs, hasIndexedLeaves)
{
}
protected override void Start()
{
results = new FixedBitSet(m_maxDoc);
}
protected override DocIdSet Finish()
{
return results!;
}
protected override bool Visit(Cell cell)
{
// LUCENENET specific - added guard clause
if (cell is null)
throw new ArgumentNullException(nameof(cell));
if (cell.ShapeRel == SpatialRelation.Within || cell.Level == m_filter.m_detailLevel)
{
CollectDocs(results!);
return false;
}
return true;
}
protected override void VisitLeaf(Cell cell)
{
// LUCENENET specific - added guard clause
if (cell is null)
throw new ArgumentNullException(nameof(cell));
CollectDocs(results!);
}
protected override void VisitScanned(Cell cell)
{
// LUCENENET specific - added guard clause
if (cell is null)
throw new ArgumentNullException(nameof(cell));
if (m_filter.m_queryShape.Relate(cell.Shape).Intersects())
{
CollectDocs(results!);
}
}
}
#endregion
}
}