Search Options

Results per page
Sort
Preferred Languages
Advance

Results 91 - 100 of 1,058 for isSame (0.07 sec)

  1. tensorflow/c/eager/parallel_device/parallel_device.h

    // per device in `underlying_devices`. Implicit copies off of the device throw
    // an error.
    //
    // All component tensors must have the same dtype. Currently they must also have
    // the same shape, although this requirement may be relaxed in the future.
    //
    // `device_name` must not name an existing physical or custom device (see
    Registered: Tue Nov 05 12:39:12 UTC 2024
    - Last Modified: Thu Jun 04 21:49:16 UTC 2020
    - 2.9K bytes
    - Viewed (0)
  2. docs/en/docs/tutorial/header-params.md

    # Header Parameters
    
    You can define Header parameters the same way you define `Query`, `Path` and `Cookie` parameters.
    
    ## Import `Header`
    
    First import `Header`:
    
    //// tab | Python 3.10+
    
    ```Python hl_lines="3"
    {!> ../../docs_src/header_params/tutorial001_an_py310.py!}
    ```
    
    ////
    
    //// tab | Python 3.9+
    
    ```Python hl_lines="3"
    {!> ../../docs_src/header_params/tutorial001_an_py39.py!}
    ```
    
    ////
    
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Sun Oct 06 20:36:54 UTC 2024
    - 5.6K bytes
    - Viewed (0)
  3. docs/en/docs/advanced/openapi-webhooks.md

    {* ../../docs_src/openapi_webhooks/tutorial001.py hl[9:13,36:53] *}
    
    The webhooks that you define will end up in the **OpenAPI** schema and the automatic **docs UI**.
    
    /// info
    
    The `app.webhooks` object is actually just an `APIRouter`, the same type you would use when structuring your app with multiple files.
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Mon Oct 28 10:38:23 UTC 2024
    - 2.8K bytes
    - Viewed (0)
  4. src/builtin/builtin.go

    // Type is here for the purposes of documentation only. It is a stand-in
    // for any Go type, but represents the same type for any given function
    // invocation.
    type Type int
    
    // Type1 is here for the purposes of documentation only. It is a stand-in
    // for any Go type, but represents the same type for any given function
    // invocation.
    type Type1 int
    
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Thu Apr 11 20:22:45 UTC 2024
    - 12.7K bytes
    - Viewed (0)
  5. android/guava-tests/test/com/google/common/graph/GraphEquivalenceTest.java

      }
    
      // Node/edge sets are the same, but node/edge connections differ due to edge type.
      @Test
      public void equivalent_directedVsUndirected() {
        graph.putEdge(N1, N2);
    
        MutableGraph<Integer> g2 = createGraph(oppositeType(edgeType));
        g2.putEdge(N1, N2);
    
        assertThat(graph).isNotEqualTo(g2);
      }
    
      // Node/edge sets and node/edge connections are the same, but directedness differs.
      @Test
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 16 17:21:56 UTC 2024
    - 4.6K bytes
    - Viewed (0)
  6. guava-tests/test/com/google/common/graph/GraphEquivalenceTest.java

      }
    
      // Node/edge sets are the same, but node/edge connections differ due to edge type.
      @Test
      public void equivalent_directedVsUndirected() {
        graph.putEdge(N1, N2);
    
        MutableGraph<Integer> g2 = createGraph(oppositeType(edgeType));
        g2.putEdge(N1, N2);
    
        assertThat(graph).isNotEqualTo(g2);
      }
    
      // Node/edge sets and node/edge connections are the same, but directedness differs.
      @Test
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 16 17:21:56 UTC 2024
    - 4.6K bytes
    - Viewed (0)
  7. src/bytes/iter.go

    // The iterator yields the same strings that would be returned by Split(s, sep),
    // but without constructing the slice.
    // It returns a single-use iterator.
    func SplitSeq(s, sep []byte) iter.Seq[[]byte] {
    	return splitSeq(s, sep, 0)
    }
    
    // SplitAfterSeq returns an iterator over substrings of s split after each instance of sep.
    // The iterator yields the same strings that would be returned by SplitAfter(s, sep),
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Wed Aug 14 18:23:13 UTC 2024
    - 3.7K bytes
    - Viewed (0)
  8. doc/next/6-stdlib/99-minor/encoding/62384.md

    Two new interfaces, [TextAppender] and [BinaryAppender], have been
    introduced to append the textual or binary representation of an object
    to a byte slice. These interfaces provide the same functionality as
    [TextMarshaler] and [BinaryMarshaler], but instead of allocating a new slice
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Tue Jul 30 14:22:50 UTC 2024
    - 346 bytes
    - Viewed (0)
  9. ci/official/containers/linux_arm64/devel.usertools/wheel_verification.bats

    # Suite of verification tests for the SINGLE TensorFlow wheel in /tf/pkg
    # or whatever path is set as $TF_WHEEL.
    
    setup_file() {
        cd /tf/pkg
        if [[ -z "$TF_WHEEL" ]]; then
            export TF_WHEEL=$(find /tf/pkg -iname "*.whl")
        fi
    }
    
    teardown_file() {
        rm -rf /tf/venv
    }
    
    @test "Wheel is manylinux2014 (manylinux_2_17) compliant" {
        python3 -m auditwheel show "$TF_WHEEL" > audit.txt
    Registered: Tue Nov 05 12:39:12 UTC 2024
    - Last Modified: Tue Jan 23 02:14:00 UTC 2024
    - 2.7K bytes
    - Viewed (0)
  10. docs/en/docs/tutorial/dependencies/dependencies-with-yield.md

    ```Python hl_lines="5-6"
    {!../../docs_src/dependencies/tutorial007.py!}
    ```
    
    /// tip
    
    You can use `async` or regular functions.
    
    **FastAPI** will do the right thing with each, the same as with normal dependencies.
    
    ///
    
    ## A dependency with `yield` and `try`
    
    If you use a `try` block in a dependency with `yield`, you'll receive any exception that was thrown when using the dependency.
    
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Sun Oct 06 20:36:54 UTC 2024
    - 14K bytes
    - Viewed (0)
Back to top