Package org.apache.solr.search

Examples of org.apache.solr.search.BitDocSet

111
112
113
114
115
116
117
118
119
120
121
     for(Entry<Integer, LongBit> e:this.bitMaps.entrySet())
     {
       bits[e.getKey()]=e.getValue().bit;
     }
    
     BitDocSet rtn= new BitDocSet(new OpenBitSet(bits, numwords));
    
     long endTime = System.currentTimeMillis();
        int ttime = (int)(endTime-startTime);
        if(ttime>1)
        {
View Full Code Here
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
   
  int[][] join=null;
  private int[] joinRevert=null;
  public DocSet filterByRight(DocSet leftDocs,DocSet rightDocs)
  {
    BitDocSet docset=new BitDocSet();
    DocIterator iter = rightDocs.iterator();
    while (iter.hasNext()) {
      int doc = iter.nextDoc();
      int[] list=join[doc];
      if(list==null)
      {
        continue;
      }
      for(int jp:list)
      {
        docset.add(jp);
      }
    }
   
    return leftDocs.intersection(docset);
  }
View Full Code Here
49
50
51
52
53
54
55
56
57
58
59
  public DocValueReadInterface tnr;
 
 
  public void init(String field, IndexReader reader,IndexSchema schema) throws IOException
  {
    this.bits = new BitDocSet(new OpenBitSet(reader.maxDoc()));
    this.field = field;
   
    FieldType schemaft=schema.getFieldType(field);
    String prefix=TrieField.getMainValuePrefix(schemaft);
    SchemaField sf = schema.getField(field);
View Full Code Here
64
65
66
67
68
69
70
71
72
73
74
75
76
77
    if (uni.checkEmpty()) {
      return true;
    }

    BitDocSet tmp = null;
    if (docs != null) {
      tmp = (BitDocSet) docs.andNot(uni.bits);
      if (tmp != null && tmp.size() <= 0) {
        return true;
      }
    }

    log.info("addDoclist start" + uni.field + " ,this.baseAdvanceDocs="+(uni.baseAdvanceDocs==null?0:uni.baseAdvanceDocs.size()));
View Full Code Here
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
   
    if (uni.checkEmpty()) {
      return ;
    }

    BitDocSet tmp=null;
    if(baseAdvanceDocs!=null)
    {
      tmp=(BitDocSet) baseAdvanceDocs.andNot(this.uni.bits);

      if(tmp!=null&&tmp.size()<=0)
      {
        return ;
      }
    }
 
View Full Code Here
566
567
568
569
570
571
572
573
574
575
576
    {
      subdocset[0]=docset;
    }else{
      for (int i = 0; i < subReaders.length; i++)
     {
        subdocset[i]=new BitDocSet();
     }
     
      int index=0;
      int end=this.getend(index);
      DocIterator iter = docset.iterator();
View Full Code Here
320
321
322
323
324
325
326
327
328
329
330
    {
      subdocset[0]=docset;
    }else{
      for (int i = 0; i < subReaders.length; i++)
     {
        subdocset[i]=new BitDocSet();
     }
     
      int index=0;
      int end=this.getend(index);
      DocIterator iter = docset.iterator();
View Full Code Here
55
56
57
58
59
60
61
62
          bs.fastSet(id);
          ids[count++]=id;
        }
      }
    }
    bds = new BitDocSet(bs,bitsToSet);
    hds = new HashDocSet(ids,0,count);
  }
View Full Code Here
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
    if ("test".equals(test)) {
      for (int it=0; it<iter; it++) {
        generate(randSize ? rand.nextInt(bitSetSize) : bitSetSize, numBitsSet);
        OpenBitSet bs1=bs;
        BitDocSet bds1=bds;
        HashDocSet hds1=hds;
        generate(randSize ? rand.nextInt(bitSetSize) : bitSetSize, numBitsSet);

        OpenBitSet res = ((OpenBitSet)bs1.clone());
        res.and(bs);
        int icount = (int)res.cardinality();

        test(bds1.intersection(bds).size() == icount);
        test(bds1.intersectionSize(bds) == icount);
        if (bds1.intersection(hds).size() != icount) {
          DocSet ds = bds1.intersection(hds);
          System.out.println("STOP");
        }

        test(bds1.intersection(hds).size() == icount);
        test(bds1.intersectionSize(hds) == icount);
        test(hds1.intersection(bds).size() == icount);
        test(hds1.intersectionSize(bds) == icount);
        test(hds1.intersection(hds).size() == icount);
        test(hds1.intersectionSize(hds) == icount);
View Full Code Here
55
56
57
58
59
60
61
62
          bs.fastSet(id);
          ids[count++]=id;
        }
      }
    }
    bds = new BitDocSet(bs,bitsToSet);
    hds = new HashDocSet(ids,0,count);
  }
View Full Code Here
TOP

Related Classes of org.apache.solr.search.BitDocSet

  • org.apache.lucene.index.DirectoryReader
  • org.apache.lucene.index.MultiReader
  • org.apache.lucene.util.OpenBitSet
  • org.apache.lucene.util.OpenBitSetIterator
  • org.apache.solr.request.join.HigoJoinSingleValues
  • org.apache.solr.request.MapBitSets
  • org.apache.solr.request.uninverted.MakeUnivertedFieldByIndex
  • org.apache.solr.request.uninverted.MakeUnivertedFieldBySigment
  • org.apache.solr.request.uninverted.UnInvertedFieldBase
  • org.apache.solr.search.DocSetPerf
    • 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.