Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 942 for oper (0.36 sec)

  1. tensorflow/c/c_api.cc

    const char* TF_OperationName(TF_Operation* oper) {
      return oper->node.name().c_str();
    }
    
    const char* TF_OperationOpType(TF_Operation* oper) {
      return oper->node.type_string().c_str();
    }
    
    const char* TF_OperationDevice(TF_Operation* oper) {
      return oper->node.requested_device().c_str();
    }
    
    int TF_OperationNumOutputs(TF_Operation* oper) {
      return oper->node.num_outputs();
    }
    
    Registered: Tue Dec 30 12:39:10 UTC 2025
    - Last Modified: Sat Oct 04 05:55:32 UTC 2025
    - 102.4K bytes
    - Viewed (0)
  2. tensorflow/c/c_api_test.cc

      bool found_neg = false;
      size_t pos = 0;
      TF_Operation* oper;
      while ((oper = TF_GraphNextOperation(graph, &pos)) != nullptr) {
        if (oper == feed) {
          EXPECT_FALSE(found_placeholder);
          found_placeholder = true;
        } else if (oper == three) {
          EXPECT_FALSE(found_scalar_const);
          found_scalar_const = true;
        } else if (oper == add) {
          EXPECT_FALSE(found_add);
          found_add = true;
    Registered: Tue Dec 30 12:39:10 UTC 2025
    - Last Modified: Mon Nov 17 00:00:38 UTC 2025
    - 97K bytes
    - Viewed (0)
  3. tensorflow/c/c_test_util.cc

      TF_DeleteBuffer(buffer);
      TF_DeleteStatus(s);
      return ret;
    }
    
    bool GetNodeDef(TF_Operation* oper, tensorflow::NodeDef* node_def) {
      TF_Status* s = TF_NewStatus();
      TF_Buffer* buffer = TF_NewBuffer();
      TF_OperationToNodeDef(oper, buffer, s);
      bool ret = TF_GetCode(s) == TF_OK;
      EXPECT_EQ(TF_OK, TF_GetCode(s)) << TF_Message(s);
    Registered: Tue Dec 30 12:39:10 UTC 2025
    - Last Modified: Sat Oct 04 05:55:32 UTC 2025
    - 17.8K bytes
    - Viewed (1)
  4. android/guava/src/com/google/thirdparty/publicsuffix/PublicSuffixPatterns.java

    -ytinummoc,?p&h21,iog:ol,,ohsdaerpsym,?r&e&ntrapdeeps.remotsuc,su&-lautriv,lautriv,?t&adpusnd,tub-ni,uor-ym,?vres&-e&bucl,mohym,?bew-emoh:.nyd,,luhcs,??ogiv-&niem,ym,??s&d-&onys,ygolonys,?nd&-&dd,nufiat,sehcsimanyd,tenretni,yard,?isoc.nyd,ps,yard,?oper-&nvs,tig,?sndd:.&nyd,sndnyd,?,?vresi-&niem,tset,?xi2,y&awetag-&llawerif,ym,?m,srab,tic-amil,?zten&mitbel,sadtretteuf,??art?i&sdoow?ug??on--nx??e!.&bil?dem?eif?gro?irp?kiir?moc?pia?ude?vog??ei?ffoc?gg?r&f?ged???f&a&c?s??il??g!.&gro?loohcs?moc?t&en?...
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Tue Dec 16 20:00:28 UTC 2025
    - 76.5K bytes
    - Viewed (1)
  5. docs/de/docs/tutorial/dependencies/dependencies-with-yield.md

        client ->> dep_req: Startet den Request
        Note over dep_req: Führt den Code bis zum yield aus
        dep_req ->> dep_func: Reicht Abhängigkeit weiter
        Note over dep_func: Führt den Code bis zum yield aus
        dep_func ->> operation: Führt Pfadoperation mit Abhängigkeit aus
        operation ->> dep_func: Kehrt aus Pfadoperation zurück
        Note over dep_func: Führt Code nach yield aus
        Note over dep_func: ✅ Abhängigkeit geschlossen
    Registered: Sun Dec 28 07:19:09 UTC 2025
    - Last Modified: Wed Dec 17 20:41:43 UTC 2025
    - 14.7K bytes
    - Viewed (0)
  6. docs/en/docs/tutorial/dependencies/dependencies-with-yield.md

        client ->> dep_req: Start request
        Note over dep_req: Run code up to yield
        dep_req ->> dep_func: Pass dependency
        Note over dep_func: Run code up to yield
        dep_func ->> operation: Run path operation with dependency
        operation ->> dep_func: Return from path operation
        Note over dep_func: Run code after yield
        Note over dep_func: ✅ Dependency closed
        dep_func ->> client: Send response to client
    Registered: Sun Dec 28 07:19:09 UTC 2025
    - Last Modified: Wed Dec 17 20:41:43 UTC 2025
    - 12.9K bytes
    - Viewed (0)
  7. docs/de/docs/help-fastapi.md

        * Andere Open-Source-Projekte sehen, die ich erstellt habe und die Ihnen helfen könnten.
        * Mir folgen, um zu sehen, wenn ich ein neues Open-Source-Projekt erstelle.
    * <a href="https://x.com/tiangolo" class="external-link" target="_blank">Mir auf **X (Twitter)** folgen</a> oder <a href="https://fosstodon.org/@tiangolo" class="external-link" target="_blank">Mastodon</a>.
    Registered: Sun Dec 28 07:19:09 UTC 2025
    - Last Modified: Sat Sep 20 15:10:09 UTC 2025
    - 16.2K bytes
    - Viewed (0)
  8. docs/de/docs/advanced/events.md

    ```Python
    with open("file.txt") as file:
        file.read()
    ```
    
    In neueren Versionen von Python gibt es auch einen **asynchronen Kontextmanager**. Sie würden ihn mit `async with` verwenden:
    
    ```Python
    async with lifespan(app):
        await do_stuff()
    ```
    
    Registered: Sun Dec 28 07:19:09 UTC 2025
    - Last Modified: Wed Dec 17 20:41:43 UTC 2025
    - 9.5K bytes
    - Viewed (0)
  9. guava/src/com/google/common/collect/ContiguousSet.java

       *
       * <p>Note that this method will return ranges with unbounded endpoints if {@link BoundType#OPEN}
       * is requested for a domain minimum or maximum. For example, if {@code set} was created from the
       * range {@code [1..Integer.MAX_VALUE]} then {@code set.range(CLOSED, OPEN)} must return {@code
       * [1..∞)}.
       *
       * @throws NoSuchElementException if this set is empty
       */
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 9.9K bytes
    - Viewed (0)
  10. android/guava/src/com/google/common/collect/ContiguousSet.java

       *
       * <p>Note that this method will return ranges with unbounded endpoints if {@link BoundType#OPEN}
       * is requested for a domain minimum or maximum. For example, if {@code set} was created from the
       * range {@code [1..Integer.MAX_VALUE]} then {@code set.range(CLOSED, OPEN)} must return {@code
       * [1..∞)}.
       *
       * @throws NoSuchElementException if this set is empty
       */
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 9.9K bytes
    - Viewed (0)
Back to top