assertFalse(
          "Inverse should not contain key " + reversed.getKey(),
          inv.containsKey(reversed.getKey()));
      assertFalse(
          "Inverse should not contain value " + reversed.getValue(),
          inv.containsValue(reversed.getValue()));
      /*
       * TODO(cpovirk): This is a bit stronger than super.expectMissing(), which permits a <key,
       * someOtherValue> pair.
       */
      assertNull(

    }

    /**
     * Generate a unique key for the given request
     *
     * @param request the request to generate a key for
     * @return the generated key
     * @throws IOException if an I/O error occurs
     */
    protected abstract long makeKey(Request request) throws IOException;

    /**
     * Peek at the next key without removing it from the input stream
     *

    projectPaths = targetRuntimeDetails.map { it.map { it.key }}
    targetRuntimeDetailsFiles = targetRuntimeDetails.map { it.map { it.value }}
    projectBuildFiles = targetRuntimeDetails.zip(buildFiles) { projectDetails, buildFiles ->
        projectDetails.map { buildFiles[it.key] ?: error("Could not find build file for project ${it.key}") }
    }

    segment = cache.segments[0];
    chain = null;
    for (int i = 0; i < length; i++) {
      Object key = new Object();
      // TODO(b/145386688): This access should be guarded by 'this.segment', which is not currently
      // held
      chain = segment.newEntry(key, cache.hash(key), chain);
      if (i == 0) {
        head = chain;
      }
    }
  }

  @SuppressWarnings("GuardedBy")
  @Benchmark

            // meta
            extractData.getKeySet().stream().filter(k -> extractData.getValues(k) != null).forEach(key -> {
                final String[] values = extractData.getValues(key);
                metaDataMap.put(key, values);

                // meta -> content
                if (fessConfig.isCrawlerMetadataContentIncluded(key)) {
                    final String joinedValue = StringUtils.join(values, ' ');

boundaries.height,\n    },\n  };\n\n  const sortedAreas = Object.keys(rects)\n    .map(key => ({\n      key,\n      ...rects[key],\n      area: getArea(rects[key]),\n    }))\n    .sort((a, b) => b.area - a.area);\n\n  const filteredAreas = sortedAreas.filter(\n    ({ width, height }) =>\n      width >= popper.clientWidth && height >= popper.clientHeight\n  );\n\n  const computedPlacement = filteredAreas.length > 0\n    ? filteredAreas[0].key\n    : sortedAreas[0].key;\n\n  const variation = placement.split('-')[1];\n\n...

        }
    }

    /**
     * Escapes a JSON key-value pair.
     * @param key The key.
     * @param value The value.
     * @return The escaped key-value pair.
     */
    protected String escapeJsonKeyValue(final String key, final String value) {
        return "\"" + key + "\":" + escapeJson(value);
    }

    /**
     * Writes a JSON response.

     *
     * @param key The virtual host key.
     * @return A map of terms and boost information.
     */
    protected Map<String, List<Tuple3<String, QueryBuilder, ScoreFunctionBuilder<?>>>> getQueryMap(final String key) {
        final Map<String, List<Tuple3<String, QueryBuilder, ScoreFunctionBuilder<?>>>> map = keyMatchQueryMap.get(key);
        if (map != null) {
            return map;
        }

        }

        @Override
        public void registerNext(final org.lastaflute.job.key.LaJobKey triggeredJob) {
        }

        @Override
        public org.lastaflute.job.key.LaJobKey getJobKey() {
            return null;
        }

        @Override
        public OptionalThing<org.lastaflute.job.key.LaJobNote> getJobNote() {
            return OptionalThing.empty();
        }

You will learn more about adding extra information later in the docs, when learning to declare examples.

/// warning

Extra keys passed to `Field` will also be present in the resulting OpenAPI schema for your application.
As these keys may not necessarily be part of the OpenAPI specification, some OpenAPI tools, for example [the OpenAPI validator](https://validator.swagger.io/), may not work with your generated schema.