Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 341 - 350 of 353 for Column (0.13 seconds)

  1. docs/en/docs/release-notes.md

    The sequence of execution before FastAPI 0.106.0 was like this diagram:
    
    Time flows from top to bottom. And each column is one of the parts interacting or executing code.
    
    ```mermaid
    sequenceDiagram
    
    participant client as Client
    participant handler as Exception handler
    participant dep as Dep with yield
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Sat Dec 27 19:06:15 GMT 2025
    - 586.7K bytes
    - Click Count (0)
  2. lib/fips140/v1.0.0-c2097c7c.zip

    Software // Implementations of Modular Exponentiation" by Shay Gueron // [https://eprint.iacr.org/2011/239.pdf]. var c uint for i := 0; i < n; i++ { _ = T[n+i] // bounds check elimination hint // Step 1 (T = a × b) is computed as a large pen-and-paper column // multiplication of two numbers with n base-2^_W digits. If we just // wanted to produce 2n-wide T, we would do // // for i := 0; i < n; i++ { // d := bLimbs[i] // T[n+i] = addMulVVW(T[i:n+i], aLimbs, d) // } // // where d is a digit of the multiplier,...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Sep 25 19:53:19 GMT 2025
    - 642.7K bytes
    - Click Count (0)
  3. lib/fips140/v1.1.0-rc1.zip

    Software // Implementations of Modular Exponentiation" by Shay Gueron // [https://eprint.iacr.org/2011/239.pdf]. var c uint for i := 0; i < n; i++ { _ = T[n+i] // bounds check elimination hint // Step 1 (T = a × b) is computed as a large pen-and-paper column // multiplication of two numbers with n base-2^_W digits. If we just // wanted to produce 2n-wide T, we would do // // for i := 0; i < n; i++ { // d := bLimbs[i] // T[n+i] = addMulVVW(T[i:n+i], aLimbs, d) // } // // where d is a digit of the multiplier,...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Dec 11 16:27:41 GMT 2025
    - 663K bytes
    - Click Count (0)
  4. api/go1.txt

    pkg database/sql/driver, type Result interface, RowsAffected() (int64, error)
    pkg database/sql/driver, type Rows interface { Close, Columns, Next }
    pkg database/sql/driver, type Rows interface, Close() error
    pkg database/sql/driver, type Rows interface, Columns() []string
    pkg database/sql/driver, type Rows interface, Next([]Value) error
    pkg database/sql/driver, type RowsAffected int64
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Wed Aug 14 18:58:28 GMT 2013
    - 1.7M bytes
    - Click Count (0)
  5. LICENSE

      A compilation of a covered work with other separate and independent
    works, which are not by their nature extensions of the covered work,
    and which are not combined with it such as to form a larger program,
    in or on a volume of a storage or distribution medium, is called an
    "aggregate" if the compilation and its resulting copyright are not
    used to limit the access or legal rights of the compilation's users
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Apr 23 18:58:53 GMT 2021
    - 33.7K bytes
    - Click Count (0)
  6. cmd/erasure-healing.go

    				return nil
    			}
    			volsInfo, err := storageDisks[index].ListVols(ctx)
    			if err != nil {
    				return err
    			}
    
    			for _, volInfo := range volsInfo {
    				// StorageAPI can send volume names which are
    				// incompatible with buckets - these are
    				// skipped, like the meta-bucket.
    				if isReservedOrInvalidBucket(volInfo.Name, false) {
    					continue
    				}
    
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 34.7K bytes
    - Click Count (0)
  7. android/guava/src/com/google/common/io/Files.java

       * be exploited to create security vulnerabilities, especially when executable files are to be
       * written into the directory.
       *
       * <p>This method assumes that the temporary volume is writable, has free inodes and free blocks,
       * and that it will not be called thousands of times per second.
       *
       * <p><b>{@link java.nio.file.Path} equivalent:</b> {@link
       * java.nio.file.Files#createTempDirectory}.
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Sep 25 20:24:13 GMT 2025
    - 32.8K bytes
    - Click Count (0)
  8. guava/src/com/google/common/io/Files.java

       * be exploited to create security vulnerabilities, especially when executable files are to be
       * written into the directory.
       *
       * <p>This method assumes that the temporary volume is writable, has free inodes and free blocks,
       * and that it will not be called thousands of times per second.
       *
       * <p><b>{@link java.nio.file.Path} equivalent:</b> {@link
       * java.nio.file.Files#createTempDirectory}.
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Sep 25 20:24:13 GMT 2025
    - 32.8K bytes
    - Click Count (0)
  9. cmd/testdata/xl-meta-merge.zip

    [MinIO Erasure Code Overview](https://min.io/docs/minio/linux/operations/concepts/erasure-coding.html) for more complete documentation. ### Stable Run the following command to run the latest stable image of MinIO as a container using an ephemeral data volume: ```sh podman run -p 9000:9000 -p 9001:9001 \ quay.io/minio/minio server /data --console-address ":9001" ``` The MinIO deployment starts using default root credentials `minioadmin:minioadmin`. You can test the deployment using the MinIO Console, an...
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Mar 08 17:50:48 GMT 2024
    - 30.2K bytes
    - Click Count (0)
  10. android/guava-tests/test/com/google/common/io/testdata/alice_in_wonderland.txt

      The Fish-Footman began by producing from under his arm a great
    letter, nearly as large as himself, and this he handed over to
    the other, saying, in a solemn tone, `For the Duchess.  An
    invitation from the Queen to play croquet.'  The Frog-Footman
    repeated, in the same solemn tone, only changing the order of the
    words a little, `From the Queen.  An invitation for the Duchess
    to play croquet.'
    
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Fri Apr 21 02:27:51 GMT 2017
    - 145.2K bytes
    - Click Count (0)
Back to Top