Package com.browseengine.bobo.util

Examples of com.browseengine.bobo.util.BigNestedIntArray

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
142
143
144
145
146
147
148
149
150
151
  @Override
  public RandomAccessDocIdSet getRandomAccessDocIdSet(BoboIndexReader reader) throws IOException
  {
  final MultiValueFacetDataCache dataCache = (MultiValueFacetDataCache)_facetHandler.getFacetData(reader);
  final int[] index = _valueConverter.convert(dataCache, _vals);
  final BigNestedIntArray nestedArray = dataCache._nestedArray;
  final BitVector bitset = new BitVector(dataCache.valArray.size());
 
  for (int i : index){
    bitset.set(i);
    }
 
  if (_takeCompliment)
    {
      // flip the bits
    int size = bitset.size();
      for (int i=0;i<size;++i){
        if (bitset.get(i)){
          bitset.clear(i);
        }
        else{
          bitset.set(i);
        }
      }
    }
 
  int count = bitset.count();
 
    if (count == 0)
    {
      final DocIdSet empty = EmptyDocIdSet.getInstance();
        return new RandomAccessDocIdSet()
        {
        @Override
        public boolean get(int docId)
        {
          return false;
        }
   
        @Override
        public DocIdSetIterator iterator() throws IOException
        {
          return empty.iterator();
        }        
        };
    }
    else
    {
        return new RandomAccessDocIdSet()
        {
            @Override
            public DocIdSetIterator iterator()
            {
                return new MultiValueOrFacetDocIdSetIterator(dataCache,bitset);
            }

            @Override
            final public boolean get(int docId)
            {
              return nestedArray.contains(docId,bitset);
            }
        };
    }
  }
View Full Code Here
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
      for(int val = 0; val < 2000; val += (id + 1))
      {
        if(loader.add(id, val)) count[id]++;
      }
    }
    BigNestedIntArray nestedArray = new BigNestedIntArray();
    nestedArray.load(maxId, loader);
   
    int[] buf = new int[1024];
    for(int id = 0; id < maxId; id++)
    {
      int cnt = nestedArray.getData(id, buf);
      assertEquals("item count", count[id], cnt);
     
      if(cnt > 0)
      {
        int val = 0;
View Full Code Here
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
      for(int val = 0; val < 3000; val += (id + 1))
      {
        if(loader.add(id, val)) count[id]++;
      }
    }
    BigNestedIntArray nestedArray = new BigNestedIntArray();
    nestedArray.load(maxId, loader);
   
    int[] buf = new int[1024];
    for(int id = 0; id < maxId; id++)
    {
      int cnt = nestedArray.getData(id, buf);
      assertEquals("item count", count[id], cnt);
     
      if(cnt > 0)
      {
        int val = 0;
View Full Code Here
103
104
105
106
107
108
109
110
111
112
113
        for(int val = 0; val < cnt; val++)
        {
          if(loader.add(id, val)) count[i][id]++;
        }
      }
      nestedArray[i] = new BigNestedIntArray();
      nestedArray[i].load(maxId, loader);
     
      loader.reset(maxId, BigNestedIntArray.MAX_ITEMS, buffer);
    }
   
View Full Code Here
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
    int[] maxNumItems = {1, 1, 2, 2, 3, 3, 3, 3, 1, 1 };
    int[] minNumItems = {1, 1, 0, 1, 0, 0, 2, 3, 1, 0 };
    int[] count = new int[maxId];
    BigIntBuffer buffer = new BigIntBuffer();
    BufferedLoader loader = null;
    BigNestedIntArray nestedArray = new BigNestedIntArray();
    Random rand = new Random();
   
    for(int i = 0; i < maxNumItems.length; i++)
    {
      loader = new BufferedLoader(maxId, BigNestedIntArray.MAX_ITEMS, buffer);
      for(int id = 0; id < maxId; id++)
      {
        count[id] = 0;
        int cnt = Math.max(rand.nextInt(maxNumItems[i] + 1), minNumItems[i]);
        for(int val = 0; val < cnt; val++)
        {
          if(loader.add(id, val)) count[id]++;
        }
      }
     
      nestedArray.load(maxId, loader);
     
      int[] buf = new int[1024];
      for(int id = 0; id < maxId; id++)
      {
        int cnt = nestedArray.getData(id, buf);
        assertEquals("count["+i+","+id+"]", count[id], cnt);
       
        if(cnt > 0)
        {
          for(int val = 0; val < cnt; val++)
View Full Code Here
193
194
195
196
197
198
199
200
201
202
203
      {
        int cnt = id % (maxNumItems[i] + 1);
        loader.addSize(id, cnt);
        count[i][id] = cnt;
      }
      nestedArray[i] = new BigNestedIntArray();
      nestedArray[i].load(maxId, loader);
      loader.reset();

      for(int id = 0; id < maxId; id++)
      {
View Full Code Here
277
278
279
280
281
282
283
284
285
286
287
      {
        int cnt = id % 2000;
        loader.addSize(id, cnt);
        count[i][id] = cnt;
      }
      nestedArray[i] = new BigNestedIntArray();
      nestedArray[i].setMaxItems(maxNumItems[i]);
      nestedArray[i].load(maxId, loader);
      loader.reset();

      for(int id = 0; id < maxId; id++)
View Full Code Here
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
      {
        loader.add(i, val);
      }
    }

    BigNestedIntArray nestedArray = new BigNestedIntArray();
    nestedArray.load(maxId, loader);

    BitVector filter = new BitVector(numVals);
    for (int i = 0; i < numVals; i++)
    {
      if (i % 2 == 0)
      {
        filter.set(i);
      }
    }

    for (int i = 0; i < maxId; i++)
    {
      nestedArray.countNoReturnWithFilter(i, count, filter);
    }

    for (int i = 0; i < numVals; i++)
    {
      if (i % 2 == 0)
View Full Code Here
40
41
42
43
44
45
46
  private boolean _overflow = false;
 
  public MultiValueFacetDataCache()
  {
    super();
    _nestedArray = new BigNestedIntArray();
  }
View Full Code Here
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
    for (int id = 0; id < maxId; id++) {
      for (int val = 0; val < 2000; val += (id + 1)) {
        if (loader.add(id, val)) count[id]++;
      }
    }
    BigNestedIntArray nestedArray = new BigNestedIntArray();
    nestedArray.load(maxId, loader);

    int[] buf = new int[1024];
    for (int id = 0; id < maxId; id++) {
      int cnt = nestedArray.getData(id, buf);
      assertEquals("item count", count[id], cnt);

      if (cnt > 0) {
        int val = 0;
        for (int i = 0; i < cnt; i++) {
View Full Code Here
TOP

Related Classes of com.browseengine.bobo.util.BigNestedIntArray

  • com.browseengine.bobo.facets.data.MultiValueFacetDataCache
  • com.browseengine.bobo.facets.data.MultiValueWithWeightFacetDataCache
  • com.browseengine.bobo.facets.filter.FacetRangeFilter
  • com.browseengine.bobo.facets.filter.MultiValueFacetFilter
  • com.browseengine.bobo.facets.filter.MultiValueORFacetFilter
  • com.browseengine.bobo.facets.range.MultiRangeFacetHandler
  • com.browseengine.bobo.util.test.BigNestedIntArrayTest
    • 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.