return new FilterReader(reader) {
      @Override
      public int read(char[] cbuf, int off, int len) throws IOException {
        // if a buffer isn't being cleared correctly, this method will eventually start being called
        // with a len of 0 forever
        if (len <= 0) {
          fail("read called with a len of " + len);
        }

    return new FilterReader(reader) {
      @Override
      public int read(char[] cbuf, int off, int len) throws IOException {
        // if a buffer isn't being cleared correctly, this method will eventually start being called
        // with a len of 0 forever
        if (len <= 0) {
          fail("read called with a len of " + len);
        }

	LockEnabled bool
}

// Retain - check whether given date is retainable by validity time.
func (r Retention) Retain(created time.Time) bool {
	t, err := UTCNowNTP()
	if err != nil {
		lockLogIf(context.Background(), err)
		// Retain
		return true
	}
	return created.Add(r.Validity).After(t)
}

// DefaultRetention - default retention configuration.
type DefaultRetention struct {

  /**
   * {@link Collection#toArray(Object[])} says: "Note that {@code toArray(new Object[0])} is
   * identical in function to {@code toArray()}."
   *
   * <p>For maximum effect, the collection under test should be created from an element array of a
   * type other than {@code Object[]}.
   */
  public void testToArray_isPlainObjectArray() {
    Object[] array = collection.toArray();
    assertEquals(Object[].class, array.getClass());
  }

     * and the array is sorted by weight in descending order.
     * If no extractor exists for the key, a new array containing the extractor is created and associated with the key.
     *
     * @param key       The key associated with the extractor. Must not be null or blank.
     * @param extractor The extractor to add. Must not be null.
     */

        excludeFilterCache = createFilterCache(EXCLUDE);
    }

    /**
     * Creates a filter cache.
     * @param type The filter type.
     * @return The created filter cache.
     */
    protected LoadingCache<String, List<Pattern>> createFilterCache(final String type) {
        return CacheBuilder.newBuilder()//

		sort 演算子の利用方法は sort:<field>.<order> になります。
		<order> は asc または desc で昇順・降順を指定できます。
		たとえば、Fess を含むドキュメントでサイズの降順にソートしたい場合、次のように入力します。
		<pre>Fess sort:content_length.desc</pre>
		標準で利用可能なフィールドは created, content_length および last_modified になります。
		設定で指定するフィールドは変更することができます。
	</dd>
	<dt>AND検索</dt>
	<dd>
		AND 演算子は省略可能な連結演算子です。
		AND 演算子は指定した検索語をすべて含むドキュメントにマッチします。
		たとえば、Fess と CodeLibs を含むドキュメント検索するには次のように入力します。

        artifact.setResolved(true);
    }

    /** {@inheritDoc} */
    @Override
    public File getFile() {
        // we need to get the latest file for the project, not the artifact that was created at one point in time
        return project.getArtifact().getFile();
    }

    /** {@inheritDoc} */
    @Override
    public String getGroupId() {
        return artifact.getGroupId();
    }

    multimap.put(null, 3);
    multimap.put(null, 1);
    multimap.put(null, 7);
    multimap.put("tree", 0);
    multimap.put("tree", null);
    return multimap;
  }

  /** Test that a TreeMultimap created from another uses the natural ordering. */
  public void testMultimapCreateFromTreeMultimap() {
    TreeMultimap<String, Integer> tree =
        TreeMultimap.create(StringLength.COMPARATOR, DECREASING_INT_COMPARATOR);

Persistent Volume Claims ## ref: http://kubernetes.io/docs/user-guide/persistent-volumes/ ## persistence: enabled: true annotations: {} ## A manually managed Persistent Volume and Claim ## Requires persistence.enabled: true ## If defined, PVC must be created manually before volume will be bound existingClaim: "" ## minio data Persistent Volume Storage Class ## If defined, storageClassName: <storageClass> ## If set to "-", storageClassName: "", which disables dynamic provisioning ## If undefined (the default)...