cache.evictAll()
    val urls: MutableIterator<String> = cache.urls()
    val writeAbortCount: Int = cache.writeAbortCount()
    val writeSuccessCount: Int = cache.writeSuccessCount()
    val size: Long = cache.size()
    val maxSize: Long = cache.maxSize()
    cache.flush()
    cache.close()
    val directory: File = cache.directory
    val networkCount: Int = cache.networkCount()

    // Insert in chronological order. Always compare deltas because nanoTime() is permitted to wrap.
    var insertAt = futureTasks.indexOfFirst { it.nextExecuteNanoTime - now > delayNanos }
    if (insertAt == -1) insertAt = futureTasks.size
    futureTasks.add(insertAt, task)

    // Impact the coordinator if we inserted at the front.
    return insertAt == 0
  }

  /**

        @Override
        ImmutableSortedSet<C> delegateCollection() {
          return RegularContiguousSet.this;
        }

        @Override
        public C get(int i) {
          checkElementIndex(i, size());
          return domain.offset(first(), i);
        }

        // redeclare to help optimizers with b/310253115
        @SuppressWarnings("RedundantOverride")
        @Override

    }

    @Override
    public Object setProperty(final String key, final String value) {
        return getProperties().setProperty(key, value);
    }

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

    @Override
    public void store(final OutputStream out, final String comments) throws IOException {
        getProperties().store(out, comments);
    }

    @Override

¦EcDist” ¨CSumAlgo ¨PartNums‘ ©PartETagsÀ©PartSizes‘Ñ äªPartASizes‘Ñ ä¤SizeÑ ä¥MTimeÓ ¹ôc â N§MetaSys ¼x-minio-internal-inline-dataÄ true§MetaUsr‚¬content-type¸application/octet-stream¤etagÙ 9fe7a344ef4227d3e537¡vÎeçnÐÄ$•Ä sÉöQð#Ef° ÌS Û|âÓ ¹ôb Îf­Ä ñ.È´ Å Mƒ¤Type ¥V2ObjÞ ¢IDÄ sÉöQð#Ef° ÌS Û|â¤DDirÄ #" ‘³sF"¥ URÄ,C ¦EcAlgo £EcM £EcN §EcBSizeÒ §EcIndex ¦EcDist” ¨CSumAlgo ¨PartNums‘ ©PartETagsÀ©PartSizes‘Ñ äªPartASizes‘Ñ ä¤SizeÑ ä¥MTimeÓ ¹ôb Îf­§MetaSys ¼x-minio-internal-inline-dataÄ true§MetaUsr‚¬...

  @MapFeature.Require(SUPPORTS_REMOVE)
  public void testClear() {
    getMap().clear();
    assertTrue("After clear(), a map should be empty.", getMap().isEmpty());
    assertEquals(0, getMap().size());
    assertFalse(getMap().entrySet().iterator().hasNext());
  }

  @MapFeature.Require({FAILS_FAST_ON_CONCURRENT_MODIFICATION, SUPPORTS_REMOVE})
  @CollectionSize.Require(SEVERAL)

                    // we are already visiting this vertex, this mean we have a cycle
                    int pos = cycle.lastIndexOf(v);
                    List<String> ret = cycle.subList(pos, cycle.size());
                    ret.add(v);
                    return ret;
                }
            }
        }
        return null;
    }

    public static class CycleDetectedException extends Exception {

            List<T> dominant, List<T> recessive, String recessiveSourceLevel) {
        Map<String, T> dominantById = mapById(dominant);
        final List<T> identifiables = new ArrayList<>(recessive.size());

        for (T identifiable : recessive) {
            if (!dominantById.containsKey(identifiable.getId())) {
                identifiable.setSourceLevel(recessiveSourceLevel);

    //                                                                            ========
    /**
     * {@inheritDoc} <br>
     * Application Origin Methods:
     * <pre>
     * <span style="font-size: 130%; color: #553000">[Small Helper]</span>
     * o saveInfo() <span style="color: #3F7E5E">// save messages to session</span>
     * o write() <span style="color: #3F7E5E">// write text to specified file</span>

        }

        if (_specification != null) {
            builder.setFetchSource(_specification.columnList.toArray(new String[_specification.columnList.size()]), null);
        }

        return builder;
    }

    // ===================================================================================