Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1181 - 1190 of 1,249 for volume (0.06 seconds)

  1. docs/zh-hant/docs/features.md

        "id": 4,
        "name": "Mary",
        "joined": "2018-11-30",
    }
    
    my_second_user: User = User(**second_user_data)
    ```
    
    
    /// info
    
    `**second_user_data` 意思是:
    
    將 `second_user_data` 字典直接作為 key-value 引數傳遞,等同於:`User(id=4, name="Mary", joined="2018-11-30")`
    
    ///
    
    ### 多種編輯器支援
    
    整個框架的設計是為了讓使用變得簡單且直觀,在開始開發之前,所有決策都在多個編輯器上進行了測試,以確保提供最佳的開發體驗。
    
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Sat Oct 11 17:48:49 GMT 2025
    - 9.6K bytes
    - Click Count (0)
  2. cmd/bucket-stats.go

    	for k, v := range avg {
    		// Convert nanoseconds to milliseconds
    		ret[sizeTagToString(k)] = uint64(v.avg() / time.Millisecond)
    	}
    	return ret
    }
    
    // Update replication upload latency with a new value
    func (rl *ReplicationLatency) update(size int64, duration time.Duration) {
    	rl.UploadHistogram.Add(size, duration)
    }
    
    // ReplicationLastMinute has last minute replication counters
    type ReplicationLastMinute struct {
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 13.5K bytes
    - Click Count (0)
  3. lib/fips140/v1.1.0-rc1.zip

    &mLimbs[0], Y) T[n+i], c = bits.Add(c1, c2, c) } copy(x.reset(n).limbs, T[n:]) x.maybeSubtractModulus(choice(c), m) } return x } // addMulVVW multiplies the multi-word value x by the single-word value y, // adding the result to the multi-word value z and returning the final carry. // It can be thought of as one row of a pen-and-paper column multiplication. // //go:norace func addMulVVW(z, x []uint, y uint) (carry uint) { _ = x[len(z)-1] // bounds check elimination hint for i := range z { hi, lo := bits.Mul(x[i],...
    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. docs/en/docs/_llm-test.md

    * the statement
    
    * the frontend
    * the backend
    
    * the GitHub discussion
    * the GitHub issue
    
    * the performance
    * the performance optimization
    
    * the return type
    * the return value
    
    * the security
    * the security scheme
    
    * the task
    * the background task
    * the task function
    
    * the template
    * the template engine
    
    * the type annotation
    * the type hint
    
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Thu Dec 11 14:48:47 GMT 2025
    - 11.4K bytes
    - Click Count (0)
  5. src/bytes/bytes.go

    // non-empty. Unlike [Split], leading and trailing runs of code points
    // satisfying f(c) are discarded.
    //
    // FieldsFunc makes no guarantees about the order in which it calls f(c)
    // and assumes that f always returns the same value for a given c.
    func FieldsFunc(s []byte, f func(rune) bool) [][]byte {
    	// A span is used to record a slice of s of the form s[start:end].
    	// The start index is inclusive and the end index is exclusive.
    	type span struct {
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Tue Sep 16 16:42:15 GMT 2025
    - 35.5K bytes
    - Click Count (0)
  6. src/bytes/bytes_test.go

    		if input == nil && clone != nil {
    			t.Errorf("Clone(%#v) return value should be equal to nil slice.", input)
    		}
    
    		if input != nil && clone == nil {
    			t.Errorf("Clone(%#v) return value should not be equal to nil slice.", input)
    		}
    
    		if cap(input) != 0 && unsafe.SliceData(input) == unsafe.SliceData(clone) {
    			t.Errorf("Clone(%q) return value should not reference inputs backing memory.", input)
    		}
    	}
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Tue Dec 23 23:54:14 GMT 2025
    - 62.9K bytes
    - Click Count (0)
  7. docs/security/README.md

    The *Secure Channel* splits the object content into chunks of a fixed size of `65536` bytes. The last chunk may be smaller to avoid adding additional overhead and is treated specially to prevent truncation attacks. The nonce value is 96 bits long and generated randomly per object / multi-part part. The *Secure Channel* supports plaintexts up to `65536 * 2^32 = 256 TiB`.
    
    #### Randomness
    
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Wed Feb 26 09:25:50 GMT 2025
    - 13.8K bytes
    - Click Count (0)
  8. impl/maven-core/src/main/java/org/apache/maven/lifecycle/internal/DefaultLifecycleExecutionPlanCalculator.java

                        }
    
                        parameterConfiguration = XmlNode.newInstance(
                                parameter.getName(),
                                parameterConfiguration.value(),
                                attributes,
                                parameterConfiguration.children(),
                                parameterConfiguration.inputLocation());
    
    Created: Sun Dec 28 03:35:09 GMT 2025
    - Last Modified: Tue Mar 25 09:45:07 GMT 2025
    - 26.7K bytes
    - Click Count (0)
  9. docs/de/docs/tutorial/security/oauth2-jwt.md

    ---
    
    **FastAPI** geht bei keiner Datenbank, keinem Datenmodell oder Tool Kompromisse ein.
    
    Es gibt Ihnen die volle Flexibilität, diejenigen auszuwählen, die am besten zu Ihrem Projekt passen.
    
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Wed Oct 01 15:19:54 GMT 2025
    - 12.7K bytes
    - Click Count (0)
  10. cmd/ftp-server-driver.go

    				return nil, err
    			}
    
    			// Set the parent of the temporary access key, this is useful
    			// in obtaining service accounts by this cred.
    			cred.ParentUser = lookupResult.NormDN
    
    			// Set this value to LDAP groups, LDAP user can be part
    			// of large number of groups
    			cred.Groups = targetGroups
    
    			// Set the newly generated credentials, policyName is empty on purpose
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 14.3K bytes
    - Click Count (0)
Back to Top