Cette page vise à fournir des détails sur la syntaxe `async def` pour les *fonctions de chemins* et quelques rappels sur le code asynchrone, la concurrence et le parallélisme.

## Vous êtes pressés ?

<abbr title="'too long; didn't read' en anglais, ou 'trop long ; j'ai pas lu'"><strong>TL;DR :</strong></abbr>

Si vous utilisez des bibliothèques tierces qui nécessitent d'être appelées avec `await`, telles que :

```Python
results = await some_library()
```

        assertFalse(tag.matches(nodeWithDifferentId));

        // Node without id attribute
        MockNode nodeWithoutId = new MockNode("div");
        assertFalse(tag.matches(nodeWithoutId));

        // Wrong tag with correct id
        MockNode wrongTag = new MockNode("span");
        wrongTag.addAttribute("id", "test-id");
        assertFalse(tag.matches(wrongTag));
    }

    public void test_matches_withCss() {

    val stringTag = "dilophosaurus"
    val longTag = 20170815L as Long?
    val objectTag = Any()
    val request =
      Request
        .Builder()
        .url("https://square.com")
        .tag(Any::class.java, objectTag)
        .tag(UUID::class.java, uuidTag)
        .tag(String::class.java, stringTag)
        .tag(Long::class.javaObjectType, longTag)
        .build()

        assertEquals("query1", facetInfo.query[0]);
        assertEquals("query2", facetInfo.query[1]);
        assertEquals(Integer.valueOf(100), facetInfo.size);
        assertEquals(Long.valueOf(5), facetInfo.minDocCount);
        assertEquals("count", facetInfo.sort);
        assertEquals("other", facetInfo.missing);
    }

    public void test_createFacetInfo_withOnlyFields() {

    }

    /**
     * OpenID Connect user implementation.
     */
    public static class OpenIdUser implements FessUser {

        private static final long serialVersionUID = 1L;

        /** The user name. */
        protected final String name;

        /** The user groups. */
        protected String[] groups;

        /** The user roles. */

    // CONTAINS_VALUE_RETRIES increases, though without locking it is theoretically possible.
    Segment<K, V, E, S>[] segments = this.segments;
    long last = -1L;
    for (int i = 0; i < CONTAINS_VALUE_RETRIES; i++) {
      long sum = 0L;
      for (Segment<K, V, E, S> segment : segments) {
        // ensure visibility of most recent completed write
        int unused = segment.count; // read-volatile

        final LanguageHelper languageHelper = ComponentUtil.getLanguageHelper();

        final StringBuilder resultBuf = new StringBuilder();

        try {
            final long count = searchEngineClient.updateByQuery(fessConfig.getIndexDocumentUpdateIndex(), option -> {
                if (queryBuilder != null) {
                    option.setQuery(queryBuilder);
                }

     * @param id The ID of the Kuromoji item.
     * @return An optional entity of the Kuromoji item.
     */
    public OptionalEntity<KuromojiItem> getKuromojiItem(final String dictId, final long id) {
        return getKuromojiFile(dictId).map(file -> file.get(id).get());
    }

    /**
     * Store a Kuromoji item.
     *
     * @param dictId The dictionary ID.

  @BeforeExperiment
  void setUp() {
    // random integers will be generated in this range, then raised to the
    // power of (1/concentration) and floor()ed
    max = Ints.checkedCast((long) Math.pow(distinctKeys, concentration));

    cache =
        CacheBuilder.newBuilder()
            .concurrencyLevel(segments)
            .maximumSize(maximumSize)
            .build(

     * didn't see that discussed in the review, which included many other
     * changes: https://mail.openjdk.org/pipermail/core-libs-dev/2013-May/thread.html#17367
     *
     * TODO(cpovirk): decide what the best long-term action here is: force users
     * to suppress (as we do now), stop testing entrySet().add() at all, make
     * entrySet().add() tests tolerant of either behavior, introduce a map