Package dovetaildb.bytes

Examples of dovetaildb.bytes.Bytes

385
386
387
388
389
390
391
392
393
394
395
396
397
      for(Iterator<TokenRec> i = table.getTokenRecs(); i.hasNext();) {
        TokenRec rec = i.next();
        buffer.add(FsTokenRec.write(data, rec));
      }
      long tblStart = data.getSize();
      Bytes prefix = table.getFixedPrefix();
      data.appendVLong(prefix.getLength());
      prefix.appendTo(data);
      int numRecs = buffer.size();
      data.appendVLong(numRecs);
      for(FsTokenRec rec : buffer) {
        data.appendByte(rec.getToken());
        FsTokenTable subTable = rec.getFsTokenTable();
View Full Code Here
524
525
526
527
528
529
530
531
532
533
534
            subTable = parent.getTokenTable();
            push = parent.getSegmentPush();
          }
          if (subTable == null) {
            if (termTableDepth > 0) {
              Bytes newPrefix = new CompoundBytes(table.getFixedPrefix(), ArrayBytes.SINGLE_BYTE_OBJECTS[editBufferByte & 0xff]);
              subTable = new MemoryTokenTable(newPrefix, new ArrayList<TokenRec>());
            }
          }
          if (subTable != null) {
            subTable = applyEditsToTokenTable(subTokenTableEdits, subTable, policy, termTableDepth-1);
View Full Code Here
902
903
904
905
906
907
908
909
910
911
912
  static boolean verifySegmentPush(SegmentPush push) {
    push = push.copy();
    TraversalStack stack = new TraversalStack(push.copy());
    long lastDocId = Long.MIN_VALUE;
    Bytes lastTerm = new ArrayBytes(new byte[]{});
    while(stack.nextOrDown()) {
      stack.printPosition();
      long docId = stack.getCurrent().getDocId();
      if (docId < lastDocId) {
        throw new RuntimeException("DOC ID ERROR: cur="+docId+" prev="+lastDocId);
View Full Code Here
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
    }
    for(Iterator<TokenRec> recItr = table.getTokenRecs(); recItr.hasNext();) {
      TokenRec rec = recItr.next();
      int tok = rec.token & 0xFF;
      if (top <= tok && tok <= bottom) {
        Bytes subPrefix = CompoundBytes.make(range.prefix, ArrayBytes.SINGLE_BYTE_OBJECTS[tok]);
        QueryNode n = new BlueSteelPostingListQuery(subPrefix, rec);
        if (top == tok || tok == bottom) {
          n = FilteredQueryNode.make(n, range);
        }
        if (n != null) nodes.add(n);
View Full Code Here
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
  @Override
  public QueryNode getTerms(List<Bytes> terms, long revNum) {
    if (terms.size() == 0) return null;
    Range range = new Range();
    Bytes minTerm = null;
    Bytes maxTerm = null;
    for(Bytes term : terms) {
      if (minTerm == null || minTerm.compareTo(term) > 0) {
        minTerm = term;
      }
      if (maxTerm == null || maxTerm.compareTo(term) < 0) {
        maxTerm = term;
      }
    }
    if (minTerm == maxTerm && minTerm != null) {
      maxTerm = minTerm.copy();
View Full Code Here
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
    public abstract Iterator<TokenRec> getTokenRecs();
    /** null return normally means that there are no results; but
     * a null return with a resulting empty SlicedBytes means
     * that all results apply. */
    public TokenRec descend(SlicedBytes bytes) {
      Bytes fixedPrefix = getFixedPrefix();
      int prefixLen = 0;
      if (fixedPrefix != null) {
        if (! fixedPrefix.isPrefixOf(bytes)) {
          return null;
        }
        prefixLen = fixedPrefix.getLength();
      }
      int bytesLen = bytes.getLength();
      if (prefixLen >= bytesLen) return null;
      int ch = bytes.get(prefixLen);
      for(Iterator<TokenRec> i=getTokenRecs(); i.hasNext(); ) {
View Full Code Here
46
47
48
49
50
51
52
53
54
55
56
57
    if (uncompressed == null) return null;
    int uncompressedLen = uncompressed.getLength();
    if (uncompressedLen == 0) return compressionLiterals[0];
    int pos = Arrays.binarySearch(mapping, uncompressed);
    if (pos < 0) pos = (-pos) - 2; // need one before the insertion point
    Bytes prefix = mapping[pos].getPrefix();
    assert prefix.isPrefixOf(uncompressed);
    int prefixLen = prefix.getLength();
    Bytes suffix = SlicedBytes.make(uncompressed, prefixLen,
        uncompressedLen - prefixLen);
    return CompoundBytes.make(compressionLiterals[pos], suffix);
  }
View Full Code Here
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
    if (pos < 0) pos = (-pos) - 2; // need one before the insertion point
    int startPos = pos;
    int endPos = pos;
    while (pos + 1 < mapping.length) {
      pos++;
      Bytes prefix = mapping[pos].getPrefix();
      if (! prefix.couldOverlapWith(uncompressed)) break;
      endPos = pos;
    }
    if (startPos != endPos) {
      Range range = new Range();
      range.setBoundsAndExtractPrefix(compressionLiterals[startPos], compressionLiterals[endPos]);
      return range.getPrefix();
    }
    Bytes prefix = mapping[startPos];
    assert prefix.isPrefixOf(uncompressed);
    int prefixLen = prefix.getLength();
    Bytes suffix = SlicedBytes.make(uncompressed, prefixLen, uncompressedLen - prefixLen);
    return CompoundBytes.make(compressionLiterals[pos], suffix);
  }
View Full Code Here
238
239
240
241
242
243
244
245
246
247
248
249
250
251
  }
 
  public PrefixCompressedBagIndex(BagIndex inner, Bytes[] prefixes) {
    super(inner);
    mapping = new CompoundBytes[prefixes.length];
    Bytes prev = ArrayBytes.EMPTY_BYTES;
    for(int i=0; i<prefixes.length; i++) {
      Bytes cur = prefixes[i].flatten();
      int curLen = cur.getLength();
      int prevLen = prev.getLength();
      while(prevLen > 0 && prev.get(prevLen-1) == 255) {
        prevLen -= 1;
      }
      if (curLen >= prevLen) {
View Full Code Here
291
292
293
294
295
296
297
298
299
300
  }
 
  @Override
  public QueryNode getRange(Range range, long revNum) {
    range.propagatePrefixIntoRange(0);
    Bytes minTerm = compress(range.getMinSuffix());
    Bytes maxTerm = compress(range.getMaxSuffix());
    range.setBoundsAndExtractPrefix(minTerm, maxTerm);
    return makeQueryNode(subBagIndex.getRange(range, revNum));
  }
View Full Code Here
TOP

Related Classes of dovetaildb.bytes.Bytes

  • dovetaildb.bagindex.BagIndexTest
  • dovetaildb.bagindex.BlueSteelBagIndex
  • dovetaildb.bagindex.BlueSteelBagIndex$BlueSteelPostingListQuery
  • dovetaildb.bagindex.BlueSteelBagIndex$TokenTable
  • dovetaildb.bagindex.FsBlueSteelBagIndex$FsPostingNode
  • dovetaildb.bagindex.FsBlueSteelBagIndex$FsTokenTable
  • dovetaildb.bagindex.ImmutableBagIndex
  • dovetaildb.bagindex.PrefixCompressedBagIndex
  • dovetaildb.bagindex.PrefixCompressedBagIndex$PrefixUncompressedQueryNode
  • dovetaildb.bagindex.PrefixCompressedBagIndex$SlotBuffer
    • 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.