start using the least used cluster. This expansion strategy works endlessly, so you can perpetually expand your clusters as needed.  When you restart, it is immediate and non-disruptive to the applications. Each group of servers in the command-line is called a pool. There are 2 server pools in this example. New objects are placed in server pools in proportion to the amount of free space in each pool. Within each pool, the location of the erasure-set of drives is determined based on a deterministic hashing...

   * algorithm, x86 variant</a> (little-endian variant), using the given seed value.
   *
   * <p>The exact C++ equivalent is the MurmurHash3_x86_32 function (Murmur3A).
   *
   * <p>This method is called {@code murmur3_32_fixed} because it fixes a bug in the {@code
   * HashFunction} returned by the original {@code murmur3_32} method.
   *
   * @since 31.0
   */

     * </pre>
     *
     *
     * @param str  String to escape values in, may be null
     * @return String with escaped values, <code>null</code> if null string input
     */
    @SuppressWarnings("checkstyle:MagicNumber")
    protected static String escapeJava(String str) {
        if (str == null) {
            return null;
        }
        int sz = str.length();

     * </pre>
     *
     *
     * @param str  String to escape values in, may be null
     * @return String with escaped values, <code>null</code> if null string input
     */
    @SuppressWarnings("checkstyle:MagicNumber")
    protected static String escapeJava(String str) {
        if (str == null) {
            return null;
        }
        int sz = str.length();

     *     is null. The builder is left in an invalid state.
     */
    @CanIgnoreReturnValue
    public Builder<K, V> putAll(K key, Iterable<? extends V> values) {
      if (key == null) {
        throw new NullPointerException("null key in entry: null=" + Iterables.toString(values));
      }
      Iterator<? extends V> valuesItr = values.iterator();

   */
  public static <K, V> ImmutableSetMultimap<K, V> copyOf(
      Multimap<? extends K, ? extends V> multimap) {
    checkNotNull(multimap); // eager for GWT

    /*
     * TODO(cpovirk): When given an ImmutableSetMultimap that has a non-null valueComparator, should
     * we always return a new instance with a null valueComparator, as we already do if the input is

   *
   * @param element the element to add one occurrence of; may be null only if explicitly allowed by
   *     the implementation
   * @return {@code true} always, since this call is required to modify the multiset, unlike other
   *     {@link Collection} types
   * @throws NullPointerException if {@code element} is null and this implementation does not permit
   *     null elements

                Arguments.of(new byte[] { 0x0A, 0x0B }, new byte[] { 0x0A, 0x0B }, 100L, true),
                // fid based equality (null fileId, same fid and tree id)
                Arguments.of(null, null, 200L, true));
    }

    @ParameterizedTest(name = "equals/hashCode consistent for treeId={2}")
    @MethodSource("equalsHashParams")

    }

    @Test
    @DisplayName("Null treeConnection throws NPE")
    void constructorNullTreeConnection() {
        // Null treeConnection throws NPE when acquire() is called
        assertThrows(NullPointerException.class, () -> new SmbTreeHandleImpl(resourceLoc, null));
    }

    @Test
    @DisplayName("Null resourceLoc is accepted but may cause issues later")

          public boolean processBytes(byte[] buf, int off, int len) throws IOException {
            assertTrue("consume() called twice", firstCall);
            firstCall = false;
            return false;
          }

          @Override
          public @Nullable Void getResult() {
            return null;
          }
        };

    source.read(processor);