Search Options

Results per page
Sort
Preferred Languages
Advance

Results 61 - 70 of 1,307 for samme (0.03 sec)

  1. 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)
  2. 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)
  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. guava/src/com/google/common/collect/TreeTraverser.java

     *     their equivalent on the result of {@code Traverser.forTree(tree)} where {@code tree}
     *     implements {@code SuccessorsFunction}, which has a similar API as {@link #children} or can be
     *     the same lambda function as passed into {@link #using(Function)}.
     *     <p>This class is scheduled to be removed in October 2019.
     */
    // TODO(b/68134636): Remove by 2019-10
    @Deprecated
    @Beta
    @GwtCompatible
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 8.9K bytes
    - Viewed (0)
  5. dbflute_fess/dfprop/replaceSchemaMap.dfprop

        #  You can drop additional other schemas.
        #  Elements of this map are as below:
        #   o url: (NotRequired - Default same as main schema)
        #   o schema: (Required: if empty schema means valid schema, not required)
        #   o user: (NotRequired - Default same as main schema)
        #   o password: (NotRequired - Default same as main schema)
        #   o propertiesMap: (NotRequired - Default map:{})
    Registered: Thu Oct 31 13:40:30 UTC 2024
    - Last Modified: Sat Oct 31 23:35:14 UTC 2015
    - 9.3K bytes
    - Viewed (0)
  6. compat/maven-resolver-provider/src/main/java/org/apache/maven/repository/internal/PluginsMetadataGenerator.java

             * processes one artifact at a time and hence cannot associate the artifacts from the same project to use the
             * same version index. Allowing the caller to pass in metadata from a previous deployment allows to re-establish
             * the association between the artifacts of the same project.
             */
            for (Iterator<? extends Metadata> it = metadatas.iterator(); it.hasNext(); ) {
    Registered: Sun Nov 03 03:35:11 UTC 2024
    - Last Modified: Fri Oct 25 12:31:46 UTC 2024
    - 7.9K bytes
    - Viewed (0)
  7. 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)
  8. 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)
  9. 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)
  10. 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)
Back to top