i := len(dirPath)
	for i > 0 && os.IsPathSeparator(dirPath[i-1]) { // Skip trailing path separator.
		i--
	}

	j := i
	for j > 0 && !os.IsPathSeparator(dirPath[j-1]) { // Scan backward over element.
		j--
	}

	if j > 1 {
		// Create parent.
		if err := osMkdirAll(dirPath[:j-1], perm, baseDir); err != nil {
			return err
		}
	}

	// Parent now exists; invoke Mkdir and use its result.

escape-svg($breadcrumb-divider);\n    }\n  }\n\n  // IE9-11 hack to properly handle hyperlink underlines for breadcrumbs built\n  // without `<ul>`s. The `::before` pseudo-element generates an element\n  // *within* the .breadcrumb-item and thereby inherits the `text-decoration`.\n  //\n  // To trick IE into suppressing the underline, we give the pseudo-element an\n  // underline and then immediately remove it.\n  + .breadcrumb-item:hover::before {\n    text-decoration: underline;\n  }\n  // stylelint-disable-next-line...

            // Act: type USER, decrement true
            SID sid = new SID(st, jcifs.SID.SID_TYPE_USER, "DOM", "alice", true);

            // Assert: last element dropped
            assertEquals("S-1-5-10-20", sid.toString());
            assertEquals("DOM", sid.getDomainName());
            assertEquals("alice", sid.getAccountName());
        }

        @Test

            assertArrayEquals(largeHashAlgos, decodedContext.getHashAlgos());
            assertArrayEquals(largeSalt, decodedContext.getSalt());
        }

        @Test
        @DisplayName("Should handle single element arrays")
        void testSingleElementArrays() throws SMBProtocolDecodingException {
            // Arrange
            int[] singleCipher = new int[] { EncryptionNegotiateContext.CIPHER_AES128_GCM };

    exceptions.add(e);
    return exceptions;
  }

  /**
   * Concatenates the contents of the two given collections of exceptions. If either collection is
   * null, the other collection is returned. Otherwise, the elements of {@code other} are added to
   * {@code exceptions} and {@code exceptions} is returned.
   */
  private static @Nullable Collection<IOException> concat(

		m["range"] = rangeField
	}

	if _, ok := r.Header[xhttp.MinIOSourceReplicationRequest]; ok {
		m[xhttp.MinIOSourceReplicationRequest] = ""
	}
	return m
}

// Extract response elements to be sent with event notification.
func extractRespElements(w http.ResponseWriter) map[string]string {
	if w == nil {
		return map[string]string{}
	}
	return map[string]string{

        assertEquals(queryFieldConfig.facetFields.length, queryFieldConfig.facetFieldSet.size());
        assertEquals(queryFieldConfig.sortFields.length, queryFieldConfig.sortFieldSet.size());

        // Verify all array elements are in Set
        for (String field : queryFieldConfig.searchFields) {
            assertTrue("Search field " + field + " should be in Set", queryFieldConfig.searchFieldSet.contains(field));
        }

  private static final ImmutableRangeMap<Comparable<?>, Object> EMPTY =
      new ImmutableRangeMap<>(ImmutableList.of(), ImmutableList.of());

  /**
   * Returns a {@code Collector} that accumulates the input elements into a new {@code
   * ImmutableRangeMap}. As in {@link Builder}, overlapping ranges are not permitted.
   *
   * @since 33.2.0 (available since 23.1 in guava-jre)
   */

# OAuth2 simple avec Password et Bearer { #simple-oauth2-with-password-and-bearer }

Construisons maintenant à partir du chapitre précédent et ajoutons les éléments manquants pour avoir un flux de sécurité complet.

## Obtenir `username` et `password` { #get-the-username-and-password }

Nous allons utiliser les utilités de sécurité de **FastAPI** pour obtenir `username` et `password`.

public final class MoreObjects {
  /**
   * Returns the first of two given parameters that is not {@code null}, if either is, or otherwise
   * throws a {@link NullPointerException}.
   *
   * <p>To find the first non-null element in an iterable, use {@code Iterables.find(iterable,
   * Predicates.notNull())}. For varargs, use {@code Iterables.find(Arrays.asList(a, b, c, ...),
   * Predicates.notNull())}, static importing as necessary.
   *