Examples of CircularByteQueue

org.rabinfingerprint.datastructures.CircularByteQueue
A fast but unsafe circular byte queue. There is no enforcement that the indices are valid, and it is easily possible to overflow when adding or polling. But, this is faster than Queue by a factor of 5 or so.

Examples of org.rabinfingerprint.datastructures.CircularByteQueue

  protected final long[] popTable;


  public RabinFingerprintLongWindowed(Polynomial poly, long bytesPerWindow) {
    super(poly);
    this.bytesPerWindow = bytesPerWindow;
    this.byteWindow = new CircularByteQueue((int) bytesPerWindow + 1);
    this.popTable = new long[256];
    precomputePopTable();
  }

View Full Code Here

Examples of org.rabinfingerprint.datastructures.CircularByteQueue

  }


  public RabinFingerprintLongWindowed(RabinFingerprintLongWindowed that) {
    super(that);
    this.bytesPerWindow = that.bytesPerWindow;
    this.byteWindow = new CircularByteQueue((int) bytesPerWindow + 1);
    this.popTable = that.popTable;
  }

View Full Code Here

Examples of org.rabinfingerprint.datastructures.CircularByteQueue

  public RabinFingerprintPolynomial(Polynomial poly, long bytesPerWindow) {
    super(poly);
    this.byteShift = BigInteger.valueOf(8);
    this.windowShift = BigInteger.valueOf(bytesPerWindow * 8);
    this.bytesPerWindow = bytesPerWindow;
    this.byteWindow = new CircularByteQueue((int) bytesPerWindow + 1);
    this.fingerprint = new Polynomial();
  }

View Full Code Here

TOP

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.