Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 232 for structures (0.07 sec)

  1. docs/en/docs/advanced/dataclasses.md

    This way, its schema will show up in the API docs user interface:
    
    <img src="/img/tutorial/dataclasses/image01.png">
    
    ## Dataclasses in Nested Data Structures
    
    You can also combine `dataclasses` with other type annotations to make nested data structures.
    
    In some cases, you might still have to use Pydantic's version of `dataclasses`. For example, if you have errors with the automatically generated API documentation.
    
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Mon Oct 28 10:35:06 UTC 2024
    - 4K bytes
    - Viewed (0)
  2. api/maven-api-xml/src/main/java/org/apache/maven/api/xml/XmlNode.java

        String SELF_COMBINATION_MERGE = "merge";
    
        String SELF_COMBINATION_REMOVE = "remove";
    
        /**
         * In case of complex XML structures, combining can be done based on id.
         */
        String ID_COMBINATION_MODE_ATTRIBUTE = "combine.id";
    
        /**
         * In case of complex XML structures, combining can be done based on keys.
         * This is a comma separated list of attribute names.
         */
    Registered: Sun Nov 03 03:35:11 UTC 2024
    - Last Modified: Mon Nov 27 23:11:34 UTC 2023
    - 4.3K bytes
    - Viewed (0)
  3. compat/maven-compat/src/main/java/org/apache/maven/repository/MetadataGraph.java

    import java.util.ArrayList;
    import java.util.Collection;
    
    /**
     * This is the main graph data structure used by the RepositorySystem to present tree and graph objects.
     *
     *
     */
    @Deprecated
    public class MetadataGraph {
        /** all graph nodes */
        Collection<MetadataGraphNode> nodes;
    
        /** entry point for tree-like structures */
        MetadataGraphNode entry;
    
        public MetadataGraph(MetadataGraphNode entry) {
    Registered: Sun Nov 03 03:35:11 UTC 2024
    - Last Modified: Fri Oct 25 12:31:46 UTC 2024
    - 2K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/escape/ArrayBasedEscaperMap.java

     * underlying (implementation specific) data structures to be shared.
     *
     * <p>The size of the data structure used by ArrayBasedCharEscaper and ArrayBasedUnicodeEscaper is
     * proportional to the highest valued character that has a replacement. For example a replacement
     * map containing the single character '{@literal \}u1000' will require approximately 16K of memory.
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Sat Oct 19 00:26:48 UTC 2024
    - 3.2K bytes
    - Viewed (0)
  5. doc/next/6-stdlib/99-minor/go/types/66626.md

    All `go/types` data structures that expose sequences using a pair of
    methods such as `Len() int` and `At(int) T` now also methods that
    return iterators, allowing you to simplify code such as this:
    
    ```go
    params := fn.Type.(*types.Signature).Params()
    for i := 0; i < params.Len(); i++ {
       use(params.At(i))
    }
    ```
    
    to this:
    
    ```go
    for param := range fn.Signature().Params().Variables() {
       use(param)
    }
    ```
    
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Wed Jul 31 22:54:09 UTC 2024
    - 1K bytes
    - Viewed (0)
  6. architecture/standards/0002-avoid-using-java-serialization.md

    - **Flexibility and Control:**
    Java serialization offers limited control over the serialization process, such as excluding certain fields, customizing naming conventions, and handling complex data structures more gracefully.
    
    - **Security:**
    Java serialization poses security risks, especially related to deserialization vulnerabilities.
    
    - **Version Compatibility:**
    Registered: Wed Nov 06 11:36:14 UTC 2024
    - Last Modified: Thu Feb 29 22:32:18 UTC 2024
    - 2.3K bytes
    - Viewed (0)
  7. android/guava/src/com/google/common/collect/HashBiMap.java

        Arrays.fill(result, oldSize, newSize, ABSENT);
        return result;
      }
    
      @Override
      public int size() {
        return size;
      }
    
      /**
       * Ensures that all of the internal structures in the HashBiMap are ready for this many elements.
       */
      private void ensureCapacity(int minCapacity) {
        if (nextInBucketKToV.length < minCapacity) {
          int oldCapacity = nextInBucketKToV.length;
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Mar 06 16:06:58 UTC 2023
    - 36.4K bytes
    - Viewed (0)
  8. docs/fr/docs/features.md

        * Parce que les structures de données de pydantic consistent seulement en une instance de classe que vous définissez; l'auto-complétion, le linting, mypy et votre intuition devrait être largement suffisante pour valider vos données.
    * Valide les **structures complexes**:
        * Utilise les modèles hiérarchique de Pydantic, le `typage` Python pour les `Lists`, `Dict`, etc.
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Tue Aug 06 04:48:30 UTC 2024
    - 11.1K bytes
    - Viewed (0)
  9. docs/en/docs/features.md

        * Because pydantic data structures are just instances of classes you define; auto-completion, linting, mypy and your intuition should all work properly with your validated data.
    * Validate **complex structures**:
        * Use of hierarchical Pydantic models, Python `typing`’s `List` and `Dict`, etc.
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Thu Aug 15 23:30:12 UTC 2024
    - 9.2K bytes
    - Viewed (0)
  10. tensorflow/c/eager/gradient_checker.cc

      // Get theta shape and store in theta_dims.
      int num_dims = TF_NumDims(theta_tensor);
      vector<int64_t> theta_dims(num_dims);
      GetDims(theta_tensor, theta_dims.data());
    
      // Initialize auxilary data structures.
      vector<float> thetaPlus_data(num_elems);
      vector<float> thetaMinus_data(num_elems);
      AbstractTensorHandle* f_outputs[1];
    
      // Numerical Grad Check
      for (int i = 0; i < num_elems; i++) {
    Registered: Tue Nov 05 12:39:12 UTC 2024
    - Last Modified: Sat Oct 12 05:11:17 UTC 2024
    - 7.3K bytes
    - Viewed (0)
Back to top