Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 271 - 280 of 360 for graph_ (0.12 seconds)

  1. futures/listenablefuture1/src/com/google/common/util/concurrent/ListenableFuture.java

     * ListenableFuture}</a>.
     *
     * <p>This class is GWT-compatible.
     *
     * <h3>Purpose</h3>
     *
     * <p>The main purpose of {@code ListenableFuture} is to help you chain together a graph of
     * asynchronous operations. You can chain them together manually with calls to methods like {@link
     * Futures#transform(ListenableFuture, com.google.common.base.Function, Executor) Futures.transform}
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Jan 29 22:14:05 GMT 2026
    - 8K bytes
    - Click Count (0)
  2. compat/maven-embedder/src/main/java/org/apache/maven/cli/internal/BootstrapCoreExtensionManager.java

    import org.eclipse.aether.RepositorySystem;
    import org.eclipse.aether.RepositorySystemSession;
    import org.eclipse.aether.RepositorySystemSession.CloseableSession;
    import org.eclipse.aether.artifact.Artifact;
    import org.eclipse.aether.graph.DependencyFilter;
    import org.eclipse.aether.internal.impl.DefaultChecksumPolicyProvider;
    import org.eclipse.aether.internal.impl.DefaultRemoteRepositoryManager;
    Created: Sun Apr 05 03:35:12 GMT 2026
    - Last Modified: Tue Dec 16 13:41:14 GMT 2025
    - 13.3K bytes
    - Click Count (0)
  3. scripts/sponsors.py

    from typing import Any
    
    import httpx
    import yaml
    from github import Github
    from pydantic import BaseModel, SecretStr
    from pydantic_settings import BaseSettings
    
    github_graphql_url = "https://api.github.com/graphql"
    
    
    sponsors_query = """
    query Q($after: String) {
      user(login: "tiangolo") {
        sponsorshipsAsMaintainer(first: 100, after: $after) {
          edges {
            cursor
            node {
              sponsorEntity {
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Tue Dec 16 12:34:01 GMT 2025
    - 6.1K bytes
    - Click Count (0)
  4. docs/fr/docs/features.md

    * Même les dépendances peuvent avoir des dépendances, créant une hiérarchie ou un **« graphe » de dépendances**.
    * Le tout **géré automatiquement** par le framework.
    * Toutes les dépendances peuvent exiger des données des requêtes et **augmenter les contraintes du chemin d'accès** ainsi que la documentation automatique.
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 18:37:13 GMT 2026
    - 10.7K bytes
    - Click Count (0)
  5. tensorflow/c/eager/immediate_execution_context.h

          ContextDevicePlacementPolicy policy) = 0;
      // Returns the device placement policy for the current thread.
      virtual ContextDevicePlacementPolicy GetDevicePlacementPolicy() const = 0;
    
      // Configure graph collection in RunMetadata.
      virtual void SetShouldStoreGraphs(bool value) = 0;
    
      // Return the collected RunMetadata. This method will transfer the ownership
      // to the caller.
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Sat Oct 12 05:11:17 GMT 2024
    - 12.3K bytes
    - Click Count (0)
  6. docs/ko/docs/tutorial/dependencies/sub-dependencies.md

    *경로 처리 함수*에서는 `query_or_cookie_extractor`라는 의존성 하나만 선언하고 있다는 점에 주목하세요.
    
    하지만 **FastAPI**는 `query_or_cookie_extractor`를 호출하는 동안 그 결과를 전달하기 위해, 먼저 `query_extractor`를 해결해야 한다는 것을 알고 있습니다.
    
    ///
    
    ```mermaid
    graph TB
    
    query_extractor(["query_extractor"])
    query_or_cookie_extractor(["query_or_cookie_extractor"])
    
    read_query["/items/"]
    
    query_extractor --> query_or_cookie_extractor --> read_query
    ```
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Sat Feb 14 08:57:01 GMT 2026
    - 4.3K bytes
    - Click Count (0)
  7. docs/zh-hant/docs/tutorial/dependencies/sub-dependencies.md

    /// info
    
    注意,在路徑操作函式中我們只宣告了一個相依項 `query_or_cookie_extractor`。
    
    但 **FastAPI** 會知道它必須先解析 `query_extractor`,在呼叫 `query_or_cookie_extractor` 時把其結果傳入。
    
    ///
    
    ```mermaid
    graph TB
    
    query_extractor(["query_extractor"])
    query_or_cookie_extractor(["query_or_cookie_extractor"])
    
    read_query["/items/"]
    
    query_extractor --> query_or_cookie_extractor --> read_query
    ```
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Sat Feb 14 08:15:26 GMT 2026
    - 3.6K bytes
    - Click Count (0)
  8. android/guava/src/com/google/common/graph/ImmutableNetwork.java

     * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
     * See the License for the specific language governing permissions and
     * limitations under the License.
     */
    
    package com.google.common.graph;
    
    import static com.google.common.base.Preconditions.checkNotNull;
    
    import com.google.common.base.Function;
    import com.google.common.collect.ImmutableMap;
    import com.google.common.collect.Maps;
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Mar 11 01:10:31 GMT 2026
    - 9.6K bytes
    - Click Count (0)
  9. docs/ja/docs/tutorial/dependencies/sub-dependencies.md

    /// info | 情報
    
    *path operation 関数*の中で宣言している依存関係は`query_or_cookie_extractor`の1つだけであることに注意してください。
    
    しかし、**FastAPI** は`query_extractor`を最初に解決し、その結果を`query_or_cookie_extractor`を呼び出す時に渡す必要があることを知っています。
    
    ///
    
    ```mermaid
    graph TB
    
    query_extractor(["query_extractor"])
    query_or_cookie_extractor(["query_or_cookie_extractor"])
    
    read_query["/items/"]
    
    query_extractor --> query_or_cookie_extractor --> read_query
    ```
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Fri Feb 13 15:24:30 GMT 2026
    - 4.8K bytes
    - Click Count (0)
  10. android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java

     * Thread2: acquire(LockB) --X acquire(LockC)
     * ...
     * ThreadN: acquire(LockN) --X acquire(LockA)
     * </pre>
     *
     * <p>The implementation detects cycles by constructing a directed graph in which each lock
     * represents a node and each edge represents an acquisition ordering between two locks.
     *
     * <ul>
     *   <li>Each lock adds (and removes) itself to/from a ThreadLocal Set of acquired locks when the
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Apr 01 17:27:13 GMT 2026
    - 36K bytes
    - Click Count (0)
Back to Top