Lucene.Net  3.0.3
Lucene.Net is a port of the Lucene search engine library, written in C# and targeted at .NET runtime users.
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Properties Pages
FilteredDocIdSet.cs
Go to the documentation of this file.
1 /*
2  * Licensed to the Apache Software Foundation (ASF) under one or more
3  * contributor license agreements. See the NOTICE file distributed with
4  * this work for additional information regarding copyright ownership.
5  * The ASF licenses this file to You under the Apache License, Version 2.0
6  * (the "License"); you may not use this file except in compliance with
7  * the License. You may obtain a copy of the License at
8  *
9  * http://www.apache.org/licenses/LICENSE-2.0
10  *
11  * Unless required by applicable law or agreed to in writing, software
12  * distributed under the License is distributed on an "AS IS" BASIS,
13  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
14  * See the License for the specific language governing permissions and
15  * limitations under the License.
16  */
17 
18 using System;
19 
20 namespace Lucene.Net.Search
21 {
22 
23  /// <summary> Abstract decorator class for a DocIdSet implementation
24  /// that provides on-demand filtering/validation
25  /// mechanism on a given DocIdSet.
26  ///
27  /// <p/>
28  ///
29  /// Technically, this same functionality could be achieved
30  /// with ChainedFilter (under contrib/misc), however the
31  /// benefit of this class is it never materializes the full
32  /// bitset for the filter. Instead, the <see cref="Match" />
33  /// method is invoked on-demand, per docID visited during
34  /// searching. If you know few docIDs will be visited, and
35  /// the logic behind <see cref="Match" /> is relatively costly,
36  /// this may be a better way to filter than ChainedFilter.
37  ///
38  /// </summary>
39  /// <seealso cref="DocIdSet">
40  /// </seealso>
41 
42  public abstract class FilteredDocIdSet:DocIdSet
43  {
44  private class AnonymousClassFilteredDocIdSetIterator:FilteredDocIdSetIterator
45  {
46  public AnonymousClassFilteredDocIdSetIterator(FilteredDocIdSet enclosingInstance) : base(null)
47  {
48  System.Diagnostics.Debug.Fail("Port issue:", "Lets see if we need this"); // {{Aroush-2.9}}
49  InitBlock(enclosingInstance);
50  }
51  private void InitBlock(FilteredDocIdSet enclosingInstance)
52  {
53  this.enclosingInstance = enclosingInstance;
54  }
55  private FilteredDocIdSet enclosingInstance;
56  public FilteredDocIdSet Enclosing_Instance
57  {
58  get
59  {
60  return enclosingInstance;
61  }
62 
63  }
64  internal AnonymousClassFilteredDocIdSetIterator(FilteredDocIdSet enclosingInstance, Lucene.Net.Search.DocIdSetIterator Param1):base(Param1)
65  {
66  InitBlock(enclosingInstance);
67  }
68  public /*protected internal*/ override bool Match(int docid)
69  {
70  return Enclosing_Instance.Match(docid);
71  }
72  }
73  private DocIdSet _innerSet;
74 
75  /// <summary> Constructor.</summary>
76  /// <param name="innerSet">Underlying DocIdSet
77  /// </param>
78  protected FilteredDocIdSet(DocIdSet innerSet)
79  {
80  _innerSet = innerSet;
81  }
82 
83  /// <summary>This DocIdSet implementation is cacheable if the inner set is cacheable. </summary>
84  public override bool IsCacheable
85  {
86  get { return _innerSet.IsCacheable; }
87  }
88 
89  /// <summary> Validation method to determine whether a docid should be in the result set.</summary>
90  /// <param name="docid">docid to be tested
91  /// </param>
92  /// <returns> true if input docid should be in the result set, false otherwise.
93  /// </returns>
94  public /*protected internal*/ abstract bool Match(int docid);
95 
96  /// <summary> Implementation of the contract to build a DocIdSetIterator.</summary>
97  /// <seealso cref="DocIdSetIterator">
98  /// </seealso>
99  /// <seealso cref="FilteredDocIdSetIterator">
100  /// </seealso>
101  // @Override
102  public override DocIdSetIterator Iterator()
103  {
104  return new AnonymousClassFilteredDocIdSetIterator(this, _innerSet.Iterator());
105  }
106  }
107 }