Package com.kamikaze.docidset.impl

Examples of com.kamikaze.docidset.impl.AndDocIdSet

211
212
213
214
215
216
217
218
219
220
221
                  br.setFilter(
                    new Filter(){
                @Override
                public DocIdSet getDocIdSet(IndexReader reader)
                    throws IOException {
                  return new AndDocIdSet(docsets);
                }
                  });
                }
            }
             
View Full Code Here
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
        RandomAccessDocIdSet s = f.getRandomAccessDocIdSet(reader);
        list.add(s);
        randomAccessList.add(s);
      }
      final RandomAccessDocIdSet[] randomAccessDocIdSets = randomAccessList.toArray(new RandomAccessDocIdSet[randomAccessList.size()]);
      final DocIdSet andDocIdSet = new AndDocIdSet(list);
      return new RandomAccessDocIdSet()
      {
        @Override
        public boolean get(int docId)
        {
          for(RandomAccessDocIdSet s : randomAccessDocIdSets)
          {
            if(!s.get(docId)) return false;
          }
          return true;
        }

        @Override
        public DocIdSetIterator iterator() throws IOException
        {
          return andDocIdSet.iterator();
        }
      };
    }
  }
View Full Code Here
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
        {
          selSet=selSetList.get(0);
        }
        else
        {
          selSet=new AndDocIdSet(selSetList);
        }
      }
    }
     
    DocIdSet notSelSet=null;
   
    if (notSelectionNodes!=null && notSelectionNodes.length > 0)
    {
      ArrayList<DocIdSet> notSelSetList=new ArrayList<DocIdSet>(notSelectionNodes.length);
      for (SelectionNode selectionNode : notSelectionNodes)
      {
        DocIdSet ds=selectionNode.getDocSet();
       
        if (ds!=null)
        {
          notSelSetList.add(ds);
        }
       
        if (notSelSetList.size()>0)
        {
          if (notSelSetList.size()==1)
          {
            notSelSet=notSelSetList.get(0);
          }
          else
          {
            notSelSet=new OrDocIdSet(notSelSetList);
          }
        } 
      }
    }
   
    if (notSelSet!=null)
    {
      notSelSet=new NotDocIdSet(notSelSet,maxDoc);
    }
   
    if (selSet!=null && notSelSet!=null)
    {
      DocIdSet[] sets=new DocIdSet[]{selSet,notSelSet};
      docSet=new AndDocIdSet(Arrays.asList(sets));
    }
    else if (selSet!=null)
    {
      docSet=selSet;
    }
View Full Code Here
34
35
36
37
38
39
40
41
      List<DocIdSet> list = new ArrayList<DocIdSet>(_filters.size());
      for (Filter f : _filters)
      {
        list.add(f.getDocIdSet(reader));
      }
      return new AndDocIdSet(list);
    }
  }
View Full Code Here
211
212
213
214
215
216
217
218
219
220
221
                  br.setFilter(
                    new Filter(){
                @Override
                public DocIdSet getDocIdSet(IndexReader reader)
                    throws IOException {
                  return new AndDocIdSet(docsets);
                }
                  });
                }
            }
             
View Full Code Here
79
80
81
82
83
84
85
86
    } else if (totalDocIdSetCardinalityEstimate.isZero()) {
      return SenseiDocIdSet.buildMatchNone(plan);
    } else if (docIdSets.size() == 1) {
      return new SenseiDocIdSet(docIdSets.get(0), totalDocIdSetCardinalityEstimate, plan);
    } else {
      return new SenseiDocIdSet(new AndDocIdSet(docIdSets), totalDocIdSetCardinalityEstimate, plan);
    }
  }
View Full Code Here
91
92
93
94
95
96
97
98
99
100
101
      return docSetList.get(0);
    }
    else if (docSetList.size()==0) return null;
    else{
      if (isAnd) {
        return new AndDocIdSet(docSetList);
      }
      else{
        return new OrDocIdSet(docSetList);
      }
    }
View Full Code Here
137
138
139
140
141
142
143
144
145
146
147
      if (negativeSet==null){
        return positiveSet;
      }
      else {
        DocIdSet[] sets = new DocIdSet[]{positiveSet,new NotDocIdSet(negativeSet, reader.maxDoc())};
        return new AndDocIdSet(Arrays.asList(sets));
      }
    }
    else{
      if (negativeSet==null){
        return EmptyFilter.getInstance().getRandomAccessDocIdSet(reader);
View Full Code Here
TOP

Related Classes of com.kamikaze.docidset.impl.AndDocIdSet

  • com.browseengine.bobo.facets.filter.AndFilter
  • com.browseengine.bobo.facets.filter.RandomAccessAndFilter
  • com.browseengine.bobo.service.DefaultBrowseQueryParser
  • com.browseengine.solr.BoboFacetComponent
  • com.senseidb.search.query.filters.SenseiAndFilter
  • com.senseidb.search.query.filters.SenseiTermFilter
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.