return name.equals(that.name) && parameterTypes.equals(that.parameterTypes);
      }
      return false;
    }

    @Override
    public int hashCode() {
      return Objects.hash(name, parameterTypes);
    }
  }

  /**
   * Verifies that {@code invokable} produces a {@link NullPointerException} or {@link

 * governing permissions and limitations under the License.
 */
package org.codelibs.fess.dict;

/**
 * Exception thrown when a dictionary has expired and is no longer valid.
 * This runtime exception indicates that a dictionary file or dictionary data
 * has exceeded its lifetime and should be refreshed or reloaded.
 */
public class DictionaryExpiredException extends RuntimeException {

    ]
}
```

/// info

Notice how the `images` key now has a list of image objects.

///

## Deeply nested models { #deeply-nested-models }

You can define arbitrarily deeply nested models:

{* ../../docs_src/body_nested_models/tutorial007_py310.py hl[7,12,18,21,25] *}

/// info

Notice how `Offer` has a list of `Item`s, which in turn have an optional list of `Image`s

///

    String ROLE = ArtifactTransformationManager.class.getName();

    /**
     * Take in an artifact and return the transformed artifact for locating in the remote repository. If no
     * transformation has occurred the original artifact is returned.
     *
     * @param artifact           Artifact to be transformed.
     * @param request the repositories to check
     */

	if r.Form.Get(storageRESTBitrotAlgo) != "" {
		hashStr := r.Form.Get(storageRESTBitrotHash)
		var hash []byte
		hash, err = hex.DecodeString(hashStr)
		if err != nil {
			s.writeErrorResponse(w, err)
			return
		}
		verifier = NewBitrotVerifier(BitrotAlgorithmFromString(r.Form.Get(storageRESTBitrotAlgo)), hash)
	}
	buf := make([]byte, length)
	defer metaDataPoolPut(buf) // Reuse if we can.

    static class Key {

        private final String groupId;

        private final String artifactId;

        private final String version;

        private final String tag;

        private final int hash;

        Key(String groupId, String artifactId, String version, String tag) {
            this.groupId = groupId;
            this.artifactId = artifactId;
            this.version = version;
            this.tag = tag;

		if err != nil {
			return false
		}
		r.Body = hash.NewChecker(r.Body, md5.New(), want, r.ContentLength)
		return true
	}
	cs, err := hash.GetContentChecksum(r.Header)
	if err != nil {
		return false
	}
	if cs == nil || !cs.Type.IsSet() {
		return false
	}
	if cs.Valid() && !cs.Type.Trailing() {
		r.Body = hash.NewChecker(r.Body, cs.Type.Hasher(), cs.Raw, r.ContentLength)
	}
	return true

  /** Returns the platform preferred implementation of a map based on a hash table. */
  static <K extends @Nullable Object, V extends @Nullable Object>
      Map<K, V> newHashMapWithExpectedSize(int expectedSize) {
    return CompactHashMap.createWithExpectedSize(expectedSize);
  }

  /**
   * Returns the platform preferred implementation of an insertion ordered map based on a hash
   * table.
   */

   */
  public static Comparator<Boolean> falseFirst() {
    return BooleanComparator.FALSE_FIRST;
  }

  /**
   * Returns a hash code for {@code value}; obsolete alternative to {@link
   * Boolean#hashCode(boolean)}.
   *
   * @param value a primitive {@code boolean} value
   * @return a hash code for the value
   */
  @InlineMe(replacement = "Boolean.hashCode(value)")
  public static int hashCode(boolean value) {

   */
  public static Comparator<Boolean> falseFirst() {
    return BooleanComparator.FALSE_FIRST;
  }

  /**
   * Returns a hash code for {@code value}; obsolete alternative to {@link
   * Boolean#hashCode(boolean)}.
   *
   * @param value a primitive {@code boolean} value
   * @return a hash code for the value
   */
  @InlineMe(replacement = "Boolean.hashCode(value)")
  public static int hashCode(boolean value) {