*
     * @return the shareType
     */
    public byte getShareType() {
        return this.shareType;
    }

    /**
     * Returns the flags describing characteristics of the connected share.
     *
     * @return the shareFlags
     */
    public int getShareFlags() {
        return this.shareFlags;
    }

    /**

 * sum that is used for purposes such as collecting statistics, not for fine-grained synchronization
 * control. Under low update contention, the two classes have similar characteristics. But under
 * high contention, expected throughput of this class is significantly higher, at the expense of
 * higher space consumption.
 *

    @Mock
    SmbFileHandleImpl fileHandle;

    @Mock
    Configuration config;

    private SmbPipeHandleImpl target;

    @BeforeEach
    void setUp() throws SmbException {
        // Default pipe characteristics: neither transact nor call; RDWR for access
        when(pipe.getPipeType()).thenReturn(SmbPipeResource.PIPE_TYPE_RDWR);
        when(pipe.getUncPath()).thenReturn("\\\\pipe\\\\my-pipe");

 * map that behaves similarly to a {@link ConcurrentHashMap}.
 *
 * <p>The returned map is implemented as a hash table with similar performance characteristics to
 * {@link ConcurrentHashMap}. It supports all optional operations of the {@code ConcurrentMap}
 * interface. It does not permit null keys or values.
 *

    return Collector.of(
        () -> TopKSelector.<T>least(k, comparator),
        TopKSelector::offer,
        TopKSelector::combine,
        TopKSelector::topK,
        Collector.Characteristics.UNORDERED);
  }

  /**
   * Returns a {@code Collector} that returns the {@code k} greatest (relative to the specified

        BloomFilter::put,
        (bf1, bf2) -> {
          bf1.putAll(bf2);
          return bf1;
        },
        Collector.Characteristics.UNORDERED,
        Collector.Characteristics.CONCURRENT);
  }

  /**
   * Creates a {@link BloomFilter} with the expected number of insertions and expected false
   * positive probability.
   *

    return spliteratorWithCharacteristics(SPLITERATOR_CHARACTERISTICS);
  }

  @GwtIncompatible // Spliterator
  Spliterator<E> spliteratorWithCharacteristics(int characteristics) {
    return CollectSpliterators.indexed(size(), characteristics, this::get);
  }

  @Override
  int copyIntoArray(@Nullable Object[] dst, int offset) {
    // this loop is faster for RandomAccess instances, which ImmutableLists are

    return Collector.of(
        () -> TopKSelector.<T>least(k, comparator),
        TopKSelector::offer,
        TopKSelector::combine,
        TopKSelector::topK,
        Collector.Characteristics.UNORDERED);
  }

  /**
   * Returns a {@code Collector} that returns the {@code k} greatest (relative to the specified

   * BufferedReader#lines()}.
   *
   * <p><b>Java 25+ users:</b> If the input is a {@link Reader}, you may prefer {@link
   * Reader#readAllLines()}. The two may have different performance characteristics for different
   * {@link Reader} classes and Java versions, but both methods read the entire input into memory
   * immediately, so we discourage use of both when memory usage is a concern.
   *

 * map that behaves similarly to a {@link ConcurrentHashMap}.
 *
 * <p>The returned map is implemented as a hash table with similar performance characteristics to
 * {@link ConcurrentHashMap}. It supports all optional operations of the {@code ConcurrentMap}
 * interface. It does not permit null keys or values.
 *