}

  /**
   * Returns the empty multimap.
   *
   * <p><b>Performance note:</b> the instance returned is a singleton.
   */
  // Casting is safe because the multimap will never hold any elements.
  @SuppressWarnings("unchecked")
  public static <K, V> ImmutableListMultimap<K, V> of() {
    return (ImmutableListMultimap<K, V>) EmptyImmutableListMultimap.INSTANCE;
  }

          .isEqualTo(i + shift2);
    }
    assertThat(CacheTesting.expirationQueueSize(cache)).isEqualTo(10);
    assertThat(removalListener.getCount()).isEqualTo(10); // these are the invalidated ones

    // old timeouts must expire after this wait
    ticker.advance(ttl * 2 / 3, MILLISECONDS);

    assertThat(CacheTesting.expirationQueueSize(cache)).isEqualTo(10);
    assertThat(removalListener.getCount()).isEqualTo(10);

      errorCode: ErrorCode,
      debugData: ByteString,
    ) {
      if (debugData.size > 0) {
        // TODO: log the debugData
      }

      // Copy the streams first. We don't want to hold a lock when we call receiveRstStream().
      val streamsCopy: Array<Http2Stream>
      withLock {
        streamsCopy = streams.values.toTypedArray()
        isShutdown = true
      }

 * it requires that the complete universe of rows and columns be specified at construction time.
 * Second, it is always backed by an array large enough to hold a value for every possible
 * combination of row and column keys. (This is rarely optimal unless the table is extremely dense.)
 * Finally, every possible combination of row and column keys is always considered to have a value

	// Remove entries that are above.
	for i, z := range p {
		if z.Available > 0 && z.MaxUsedPct < maxUsed {
			continue
		}
		p[i].Available = 0
	}
}

// getAvailablePoolIdx will return an index that can hold size bytes.
// -1 is returned if no serverPools have available space for the size given.
func (z *erasureServerPools) getAvailablePoolIdx(ctx context.Context, bucket, object string, size int64) int {

CLASS_NAME_COLLAPSED) {\n      if (this._options.noTransitionAfterReload) {\n        $body.addClass('hold-transition').addClass(CLASS_NAME_COLLAPSED).delay(50).queue(function () {\n          $(this).removeClass('hold-transition')\n          $(this).dequeue()\n        })\n      } else {\n        $body.addClass(CLASS_NAME_COLLAPSED)\n      }\n    } else if (this._options.noTransitionAfterReload) {\n      $body.addClass('hold-transition').removeClass(CLASS_NAME_COLLAPSED).delay(50).queue(function () {\n        $...

   * weak, or phantom references.
   *
   * @param backingMap place to store the mapping from each row key to its corresponding column key
   *     / value map
   * @param factory supplier of new, empty maps that will each hold all column key / value mappings
   *     for a given row key
   * @throws IllegalArgumentException if {@code backingMap} is not empty
   * @since 10.0
   */
  public static <R, C, V> Table<R, C, V> newCustomTable(

 * it requires that the complete universe of rows and columns be specified at construction time.
 * Second, it is always backed by an array large enough to hold a value for every possible
 * combination of row and column keys. (This is rarely optimal unless the table is extremely dense.)
 * Finally, every possible combination of row and column keys is always considered to have a value

                }
            }
        } catch (Exception e) {
            log.error("Error validating key lengths", e);
            return false;
        }
    }

    /**
     * Helper class to hold encryption results
     */
    private static class EncryptionResult {
        final byte[] ciphertext;
        final byte[] authTag;

        EncryptionResult(byte[] ciphertext, byte[] authTag) {

     */
    int getMaxRequestRetries();

    /**
     * Property {@code jcifs.smb.client.strictResourceLifecycle} (bool, default false)
     *
     * If enabled, SmbFile instances starting with their first use will hold a reference to their tree.
     * This means that trees/sessions/connections won't be idle-disconnected even if there are no other active
     * references (currently executing code, file descriptors).
     *