Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 99 for definitions (0.29 sec)

  1. fastapi/openapi/utils.py

                            security_schemes
                        )
                    if path_definitions:
                        definitions.update(path_definitions)
        if definitions:
            components["schemas"] = {k: definitions[k] for k in sorted(definitions)}
        if components:
            output["components"] = components
        output["paths"] = paths
        if webhook_paths:
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Tue Sep 17 18:54:10 UTC 2024
    - 22.6K bytes
    - Viewed (0)
  2. fastapi/_compat.py

        ) -> Dict[str, Any]:
            definitions: Dict[str, Dict[str, Any]] = {}
            for model in flat_models:
                m_schema, m_definitions, m_nested_models = model_process_schema(
                    model, model_name_map=model_name_map, ref_prefix=REF_PREFIX
                )
                definitions.update(m_definitions)
                model_name = model_name_map[model]
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Sat Oct 12 09:36:32 UTC 2024
    - 23.4K bytes
    - Viewed (0)
  3. compat/maven-embedder/src/test/java/org/apache/maven/cli/MavenCliTest.java

            cli.initialize(request);
            assertThrows(ParseException.class, () -> cli.cli(request));
        }
    
        /**
         * Read .mvn/maven.config with the following definitions:
         * <pre>
         *   -T
         *   3
         *   -Drevision=1.3.0
         *   "-Dlabel=Apache Maven"
         * </pre>
         * and check if the {@code -T 3} option can be overwritten via command line
    Registered: Sun Nov 03 03:35:11 UTC 2024
    - Last Modified: Fri Oct 25 12:31:46 UTC 2024
    - 30.3K bytes
    - Viewed (0)
  4. src/cmd/asm/internal/lex/input.go

    // macroDefinition returns the list of formals and the tokens of the definition.
    // The argument list is nil for no parens on the definition; otherwise a list of
    // formal argument names.
    func (in *Input) macroDefinition(name string) ([]string, []Token) {
    	prevCol := in.Stack.Col()
    	tok := in.Stack.Next()
    	if tok == '\n' || tok == scanner.EOF {
    		return nil, nil // No definition for macro
    	}
    	var args []string
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Fri Sep 06 13:17:27 UTC 2024
    - 12.5K bytes
    - Viewed (0)
  5. bin/update_crds.sh

    fi
    
    git clone --filter=tree:0 "https://${REPO}" "${API_TMP}" && cd "${API_TMP}"
    git checkout "${SHA}"
    if [ ! -f "${API_TMP}/kubernetes/customresourcedefinitions.gen.yaml" ]; then
      echo "Generated Custom Resource Definitions file does not exist in the commit SHA ${SHA}. Not updating the CRD file."
      exit
    fi
    rm -f "${ROOTDIR}/manifests/charts/base/files/crd-all.gen.yaml"
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Tue Oct 01 20:23:30 UTC 2024
    - 3.5K bytes
    - Viewed (0)
  6. src/cmd/cgo/doc.go

    Using //export in a file places a restriction on the preamble:
    since it is copied into two different C output files, it must not
    contain any definitions, only declarations. If a file contains both
    definitions and declarations, then the two output files will produce
    duplicate symbols and the linker will fail. To avoid this, definitions
    must be placed in preambles in other files, or in C source files.
    
    # Passing pointers
    
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Tue Oct 01 22:52:54 UTC 2024
    - 44K bytes
    - Viewed (0)
  7. LICENSES/third_party/forked/cgroups/LICENSE

                               Version 2.0, January 2004
                            http://www.apache.org/licenses/
    
       TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
    
       1. Definitions.
    
          "License" shall mean the terms and conditions for use, reproduction,
          and distribution as defined by Sections 1 through 9 of this document.
    
          "Licensor" shall mean the copyright owner or entity authorized by
    Registered: Fri Nov 01 09:05:11 UTC 2024
    - Last Modified: Thu Oct 31 17:42:39 UTC 2024
    - 11.1K bytes
    - Viewed (0)
  8. guava/src/com/google/common/graph/Network.java

     *
     * <h3>Capabilities</h3>
     *
     * <p>{@code Network} supports the following use cases (<a
     * href="https://github.com/google/guava/wiki/GraphsExplained#definitions">definitions of
     * terms</a>):
     *
     * <ul>
     *   <li>directed graphs
     *   <li>undirected graphs
     *   <li>graphs that do/don't allow parallel edges
     *   <li>graphs that do/don't allow self-loops
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Thu Oct 10 15:41:27 UTC 2024
    - 22.4K bytes
    - Viewed (0)
  9. guava/src/com/google/common/graph/ValueGraph.java

     *
     * <h3>Capabilities</h3>
     *
     * <p>{@code ValueGraph} supports the following use cases (<a
     * href="https://github.com/google/guava/wiki/GraphsExplained#definitions">definitions of
     * terms</a>):
     *
     * <ul>
     *   <li>directed graphs
     *   <li>undirected graphs
     *   <li>graphs that do/don't allow self-loops
     *   <li>graphs whose nodes/edges are insertion-ordered, sorted, or unordered
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Thu Oct 10 15:41:27 UTC 2024
    - 16K bytes
    - Viewed (0)
  10. android/guava/src/com/google/common/graph/Graph.java

     *
     * <h3>Capabilities</h3>
     *
     * <p>{@code Graph} supports the following use cases (<a
     * href="https://github.com/google/guava/wiki/GraphsExplained#definitions">definitions of
     * terms</a>):
     *
     * <ul>
     *   <li>directed graphs
     *   <li>undirected graphs
     *   <li>graphs that do/don't allow self-loops
     *   <li>graphs whose nodes/edges are insertion-ordered, sorted, or unordered
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Thu Oct 10 15:41:27 UTC 2024
    - 13.7K bytes
    - Viewed (0)
Back to top