this.releaseHighlightsTemplate.get().getAsFile(),
            this.releaseHighlightsFile.get().getAsFile(),
            entries
        );

        LOGGER.info("Generating breaking changes / deprecations notes...");
        BreakingChangesGenerator.update(
            this.breakingChangesTemplate.get().getAsFile(),
            this.breakingChangesFile.get().getAsFile(),
            entries

    // https://github.com/gradle/gradle-private/issues/4255
    private static final String CHROME_PATTERN_STR = "(/usr/bin/google-chrome-for-testing)";
    private static final String JAVA_PROCESS_STACK_TRACES_MONITOR_PATTERN_STR = "(JavaProcessStackTracesMonitor\\.java)";
    private static ExecutionMode executionMode;

    static String generateAllGradleProcessPattern() {

 * of the access check algorithm used by Windows is required. The following
 * is a basic description of the algorithm. For a more complete description
 * we recommend reading the section on Access Control in Keith Brown's
 * "The .NET Developer's Guide to Windows Security" (which is also
 * available online).
 * <p>
 * Direct ACEs are evaluated first in order. The SID of the user performing

    /**
     * Circuit breaker states
     */
    public enum State {
        CLOSED, // Normal operation
        OPEN, // Failing, requests blocked
        HALF_OPEN // Testing recovery
    }

    private final String name;
    private final AtomicReference<State> state = new AtomicReference<>(State.CLOSED);
    private final AtomicInteger consecutiveFailures = new AtomicInteger(0);

        // Test zero time separately - it's handled specially
        SMBUtil.writeTime(0L, buffer, 0);
        long readTime = SMBUtil.readTime(buffer, 0);
        // When writing 0, it writes 0 directly, and when reading 0, it returns negative offset
        assertEquals(-SmbConstants.MILLISECONDS_BETWEEN_1970_AND_1601, readTime);
    }

    @Test
    void testUTimeConversionRoundTrip() {

        if (!field.canAccess(bean)) {
            field.setAccessible(true);
        }
        field.set(bean, value);
    }

    /**
     * Clear all caches. Useful for testing or memory management.
     */
    public static void clearCaches() {
        METHOD_CACHE.clear();
        FIELD_CACHE.clear();
    }

「MINOR」は真ん中の数字です。例えば、`0.2.3` では MINOR バージョンは `2` です。

///

## FastAPIのバージョンのアップグレード { #upgrading-the-fastapi-versions }

アプリケーションにテストを追加すべきです。

**FastAPI** では非常に簡単に実現できます（Starlette のおかげです）。ドキュメントを確認して下さい: [テスト](../tutorial/testing.md)

テストを追加したら、**FastAPI** のバージョンをより新しいものにアップグレードし、テストを実行することで全てのコードが正しく動作するか確認できます。

全てが動作する、または必要な変更を行った後に全てのテストが通るなら、その新しいバージョンに `fastapi` を固定できます。

## Starletteについて { #about-starlette }

org.apache.lucene.search.TimeLimitingCollector#getGlobalCounter()

@defaultMessage Don't interrupt threads use FutureUtils#cancel(Future<T>) instead
java.util.concurrent.Future#cancel(boolean)

@defaultMessage Don't try reading from paths that are not configured in Environment, resolve from Environment instead
org.elasticsearch.core.PathUtils#get(java.lang.String, java.lang.String[])
org.elasticsearch.core.PathUtils#get(java.net.URI)

 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package com.google.common.collect.testing;

import static com.google.common.collect.testing.Helpers.mapEntry;
import static com.google.common.collect.testing.ReflectionFreeAssertThrows.assertThrows;
import static java.util.Arrays.asList;
import static java.util.Collections.emptyMap;

   * <p>Note that this entire implementation makes the assumption that all elements which are in the
   * map are also in this queue, and that all elements not in the queue are not in the map.
   *
   * <p>The benefits of creating our own queue are that (1) we can replace elements in the middle of
   * the queue as part of copyWriteEntry, and (2) the contains method is highly optimized for the
   * current model.
   */