frequency.set(0);
    }
    backingMap.clear();
    size = 0L;
  }

  @Override
  int distinctElements() {
    return backingMap.size();
  }

  // Optimizations - Query Operations

  @Override
  public int size() {
    return Ints.saturatedCast(size);
  }

  @Override
  public Iterator<E> iterator() {
    return new MapBasedMultisetIterator();
  }

      @Override
      <E extends @Nullable Object> int resultIndex(
          Comparator<? super E> comparator,
          @ParametricNullness E key,
          List<? extends E> list,
          int foundIndex) {
        // Of course, we have to use binary search to find the precise
        // breakpoint...
        int lower = foundIndex;
        int upper = list.size() - 1;

    private static final int FILE_NOTIFY_CHANGE_EA = 0x00000080;
    private static final int FILE_NOTIFY_CHANGE_SECURITY = 0x00000100;
    private static final int FILE_NOTIFY_CHANGE_STREAM_NAME = 0x00000200;
    private static final int FILE_NOTIFY_CHANGE_STREAM_SIZE = 0x00000400;
    private static final int FILE_NOTIFY_CHANGE_STREAM_WRITE = 0x00000800;

        assertEquals(response.getTreeId(), response.getTid());
    }

    /**
     * Helper method to create a valid response buffer
     */
    private byte[] createValidResponseBuffer(int shareType, int shareFlags, int capabilities, int maxAccess) {
        byte[] buffer = new byte[256];
        SMBUtil.writeInt2(16, buffer, 0);
        buffer[2] = (byte) shareType;
        buffer[3] = 0;

        Funnel<? super T> funnel,
        int numHashFunctions,
        LockFreeBitArray bits) {
      long bitSize = bits.bitSize();
      long hash64 = Hashing.murmur3_128().hashObject(object, funnel).asLong();
      int hash1 = (int) hash64;
      int hash2 = (int) (hash64 >>> 32);

      boolean bitsChanged = false;
      for (int i = 1; i <= numHashFunctions; i++) {
        int combinedHash = hash1 + (i * hash2);

  @Override
  public int drainTo(Collection<? super E> c, int maxElements) {
    if (c == null) throw new NullPointerException();
    if (c == this) throw new IllegalArgumentException();
    if (maxElements <= 0) return 0;
    E[] items = this.items;
    Monitor monitor = this.monitor;
    monitor.enter();
    try {
      int i = takeIndex;
      int n = 0;

   * after index validation has already been performed.
   */
  ImmutableList<E> subListUnchecked(int fromIndex, int toIndex) {
    return new SubList(fromIndex, toIndex - fromIndex);
  }

  private final class SubList extends ImmutableList<E> {
    final transient int offset;
    final transient int length;

    SubList(int offset, int length) {
      this.offset = offset;
      this.length = length;
    }

func (*parser) parseString(b []byte) string {
	if i := bytes.IndexByte(b, 0); i >= 0 {
		return string(b[:i])
	}
	return string(b)
}

// formatString copies s into b, NUL-terminating if possible.
func (f *formatter) formatString(b []byte, s string) {
	if len(s) > len(b) {
		f.err = ErrFieldTooLong
	}
	copy(b, s)
	if len(s) < len(b) {
		b[len(s)] = 0
	}

// and can be read back from another goroutine.
// It is safe to concurrently read and write RingBuffer.
type RingBuffer struct {
	buf       []byte
	size      int
	r         int // next position to read
	w         int // next position to write
	isFull    bool
	err       error
	block     bool
	mu        sync.Mutex
	wg        sync.WaitGroup
	readCond  *sync.Cond // Signaled when data has been read.

    /**
     * Compression algorithm constants matching SMB3 specification.
     */
    public static final int COMPRESSION_NONE = 0x0;
    public static final int COMPRESSION_LZ77 = 0x1;
    public static final int COMPRESSION_LZ77_HUFFMAN = 0x2;
    public static final int COMPRESSION_LZNT1 = 0x3;
    public static final int COMPRESSION_PATTERN_V1 = 0x4;

    /**
     * Compresses data using the specified algorithm.
     *