checkNotNull(iterable);
    return new Iterator<T>() {
      Iterator<T> iterator = emptyModifiableIterator();

      @Override
      public boolean hasNext() {
        /*
         * Don't store a new Iterator until we know the user can't remove() the last returned
         * element anymore. Otherwise, when we remove from the old iterator, we may be invalidating

    checkNotNull(iterable);
    return new Iterator<T>() {
      Iterator<T> iterator = emptyModifiableIterator();

      @Override
      public boolean hasNext() {
        /*
         * Don't store a new Iterator until we know the user can't remove() the last returned
         * element anymore. Otherwise, when we remove from the old iterator, we may be invalidating

      //    internal char array (hard to avoid using StringBuilder)
      // 2. we avoid extra copies into temporary buffers altogether
      // The downside is that this will cause us to store the file bytes in memory twice for a short
      // amount of time.
      return new String(ByteSource.this.read(), charset);
    }

    @Override
    public String toString() {

    protected long durableHandleTimeout = 120000; // 2 minutes
    /** Maximum number of retry attempts for handle reconnection */
    protected int handleReconnectRetries = 3;
    /** Directory to store persistent handle state */
    protected String handleStateDirectory;

    // Directory leasing configuration fields
    /**
     * Whether to use directory leasing for cached directory listings
     */

     * @since 4.1.0
     */
    @Config(type = "java.lang.Boolean", defaultValue = "true")
    public static final String MAVEN_DEPLOY_BUILD_POM = "maven.deploy.buildPom";

    /**
     * User property used to store the build timestamp.
     *
     * @since 4.0.0
     */
    @Config(type = "java.time.Instant")
    public static final String MAVEN_START_INSTANT = "maven.startInstant";

    /**

      this.dedupedElements = Arrays.copyOf(toCopy.dedupedElements, toCopy.dedupedElements.length);
      this.distinct = toCopy.distinct;
    }

    /**
     * Resizes internal data structures if necessary to store the specified number of distinct
     * elements.
     */
    private void ensureCapacity(int minCapacity) {
      if (minCapacity > dedupedElements.length) {
        int newCapacity =

It's relatively tightly coupled with relational databases (like MySQL or PostgreSQL), so, having a NoSQL database (like Couchbase, MongoDB, Cassandra, etc) as the main store engine is not very easy.

//
// Questions left to address:
// * Might at some point need a way for callers to provide their own Env.
// * Maybe add TF_TensorShape that encapsulates dimension info.
//
// Design decisions made:
// * Backing store for tensor memory has an associated deallocation
//   function.  This deallocation function will point to client code
//   for tensors populated by the client.  So the client can do things
//   like shadowing a numpy array.

	public final fun maxAgeSeconds ()I
	public final fun maxStaleSeconds ()I
	public final fun minFreshSeconds ()I
	public final fun mustRevalidate ()Z
	public final fun noCache ()Z
	public final fun noStore ()Z
	public final fun noTransform ()Z
	public final fun onlyIfCached ()Z
	public static final fun parse (Lokhttp3/Headers;)Lokhttp3/CacheControl;
	public final fun sMaxAgeSeconds ()I
	public fun toString ()Ljava/lang/String;

   */

  private transient Map<K, Collection<V>> map;
  private transient int totalSize;

  /**
   * Creates a new multimap that uses the provided map.
   *
   * @param map place to store the mapping from each key to its corresponding values
   * @throws IllegalArgumentException if {@code map} is not empty
   */
  protected AbstractMapBasedMultimap(Map<K, Collection<V>> map) {
    checkArgument(map.isEmpty());