* escaping for code points if required.
   *
   * <p>Note that arrays returned by this method must not be modified once they have been returned.
   * However it is acceptable to return the same array multiple times (even for different input
   * characters).
   *
   * @param cp the Unicode code point to escape
   * @return the replacement characters, or {@code null} if no escaping was required
   */

   */
  @Override
  Set<N> successors(N node);

  /**
   * Returns the count of {@code node}'s incident edges, counting self-loops twice (equivalently,
   * the number of times an edge touches {@code node}).
   *
   * <p>For directed graphs, this is equal to {@code inDegree(node) + outDegree(node)}.
   *
   * <p>For undirected graphs, this is equal to {@code incidentEdges(node).size()} + (number of

        };
        ComponentUtil.setFessConfig(mockConfig);

        // Setup mock request manager
        RequestManager mockRequestManager = createMockRequestManager("de_DE");

        // Execute multiple times
        OptionalThing<Locale> result1 = provider.findBusinessLocale(null, mockRequestManager);
        OptionalThing<Locale> result2 = provider.findBusinessLocale(null, mockRequestManager);

   *         .putEdgeValue(BERLIN, BRUSSELS, kilometers(764))
   *         .addNode(REYKJAVIK)
   *         .build();
   * }
   *
   * <p>Builder instances can be reused; it is safe to call {@link #build} multiple times to build
   * multiple graphs in series. Each new graph contains all the elements of the ones created before
   * it.
   *
   * @since 28.0
   */
  public static class Builder<N, V> {

        UnsignedLong bUnsigned = UnsignedLong.fromLongBits(b);
        long expected =
            aUnsigned.bigIntegerValue().multiply(bUnsigned.bigIntegerValue()).longValue();
        UnsignedLong unsignedMul = aUnsigned.times(bUnsigned);
        assertThat(unsignedMul.longValue()).isEqualTo(expected);
      }
    }
  }

  public void testDividedBy() {
    for (long a : TEST_LONGS) {
      for (long b : TEST_LONGS) {

        byte[] buffer = new byte[1024];
        int bufferIndex = 0;

        // Set structure size to 2
        SMBUtil.writeInt2(2, buffer, bufferIndex);

        // Call readBytesWireFormat multiple times
        for (int i = 0; i < 5; i++) {
            int result = response.readBytesWireFormat(buffer, bufferIndex);
            assertEquals(2, result, "Should consistently return 2 on call " + (i + 1));
        }
    }

C'est une spécification assez vaste qui couvre plusieurs cas d'utilisation complexes.

Elle inclut des moyens de s'authentifier en utilisant un « tiers ».

C'est ce que tous les systèmes avec « connexion avec Facebook, Google, X (Twitter), GitHub » utilisent en arrière-plan.

### OAuth 1 { #oauth-1 }

query_or_cookie_extractor(["query_or_cookie_extractor"])

read_query["/items/"]

query_extractor --> query_or_cookie_extractor --> read_query
```

## 같은 의존성을 여러 번 사용하기 { #using-the-same-dependency-multiple-times }

같은 *경로 처리*에 대해 의존성 중 하나가 여러 번 선언되는 경우(예: 여러 의존성이 공통 하위 의존성을 갖는 경우), **FastAPI**는 그 하위 의존성을 요청당 한 번만 호출해야 한다는 것을 알고 있습니다.

query_or_cookie_extractor(["query_or_cookie_extractor"])

read_query["/items/"]

query_extractor --> query_or_cookie_extractor --> read_query
```

## 多次使用同一個相依項 { #using-the-same-dependency-multiple-times }

如果你的某個相依項在同一個路徑操作中被宣告了多次，例如多個相依共用同一個子相依，**FastAPI** 會知道只需在每次請求中呼叫該子相依一次。

它會把回傳值儲存在一個 <dfn title="用來儲存已計算/產生之值的工具／系統，以便重複使用而不必再次計算。">「快取」</dfn> 中，並在該次請求中傳遞給所有需要它的「相依者」，而不是為同一個請求多次呼叫相同的相依項。

				Computed: etag,
			}
		}
	}
	return n, err
}

// ETag returns the ETag of all the content read
// so far. Reading more content changes the MD5
// checksum. Therefore, calling ETag multiple
// times may return different results.
func (r *Reader) ETag() ETag {
	sum := r.md5.Sum(nil)
	return ETag(sum)
}

// VerifyError is an error signaling that a
// computed ETag does not match an expected
// ETag.