- Sort Score
- Num 10 results
- Language All
Results 181 - 190 of 211 for algoritma (0.07 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
src/main/java/jcifs/config/BaseConfiguration.java
/** SMB client capabilities */ protected int capabilities = 0; /** Maximum number of concurrent SMB sessions */ protected int sessionLimit = SmbConstants.DEFAULT_SSN_LIMIT; /** Whether to disable Nagle's algorithm for TCP connections */ protected boolean smbTcpNoDelay = false; /** Response timeout in milliseconds for SMB operations */ protected int smbResponseTimeout = SmbConstants.DEFAULT_RESPONSE_TIMEOUT;Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Sun Aug 31 08:00:57 GMT 2025 - 36.5K bytes - Click Count (0) -
impl/maven-cli/src/main/java/org/apache/maven/cling/invoker/mvnup/goals/PluginUpgradeStrategy.java
} return groupId + ":" + artifactId; } /** * Finds the last local parent in the hierarchy where plugin management should be added. * This implements the algorithm: start with the effective model, check if parent is in pomMap, * if so continue to its parent, else that's the target. */ private Path findLastLocalParentForPluginManagement(Created: Sun Apr 05 03:35:12 GMT 2026 - Last Modified: Tue Nov 18 18:03:26 GMT 2025 - 37K bytes - Click Count (0) -
cmd/object-handlers.go
dstOpts.WantChecksum = nil } } else { // S3: All copied objects without checksums and specified destination checksum algorithms // automatically gain a CRC-64NVME checksum algorithm. dstOpts.WantServerSideChecksumType = hash.ChecksumCRC64NVME srcInfo.Reader.AddServerSideChecksumHasher(dstOpts.WantServerSideChecksumType) dstOpts.WantChecksum = nil }Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 120.6K bytes - Click Count (0) -
android/guava/src/com/google/common/primitives/Doubles.java
* {@code toIndex > fromIndex} * @since 32.0.0 */ public static void rotate(double[] array, int distance, int fromIndex, int toIndex) { // See Ints.rotate for more details about possible algorithms here. checkNotNull(array); checkPositionIndexes(fromIndex, toIndex, array.length); if (array.length <= 1) { return; } int length = toIndex - fromIndex;Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Mar 23 16:38:16 GMT 2026 - 27.8K bytes - Click Count (0) -
docs/ja/docs/tutorial/security/oauth2-jwt.md
09d25e094faa6ca2556c818166b7a9563b93f7099f6f0f4caa6cf63b88e8d3e7 ``` </div> そして、出力された文字列を変数`SECRET_KEY`にコピーします。(例に記載している秘密鍵は実際に使用しないでください) JWTトークンの署名に使用するアルゴリズム`"HS256"`を指定した変数`ALGORITHM`を作成します。 トークンの有効期限を指定した変数を作成します。 レスポンスのトークンエンドポイントで使用するPydanticモデルを定義します。 新しいアクセストークンを生成するユーティリティ関数を作成します。 {* ../../docs_src/security/tutorial004_an_py310.py hl[4,7,13:15,29:31,82:90] *}
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Fri Mar 20 14:07:17 GMT 2026 - 14.6K bytes - Click Count (1) -
cmd/bucket-lifecycle.go
SelectRestoreRequest RestoreRequestType = "SELECT" ) // Encryption specifies encryption setting on restored bucket type Encryption struct { EncryptionType sse.Algorithm `xml:"EncryptionType"` KMSContext string `xml:"KMSContext,omitempty"` KMSKeyID string `xml:"KMSKeyId,omitempty"` } // MetadataEntry denotes name and value. type MetadataEntry struct {
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Fri Aug 29 02:39:48 GMT 2025 - 33.7K bytes - Click Count (0) -
cmd/test-utils_test.go
region := globalSite.Region() date := UTCNow() scope := getScope(date, region) credential := fmt.Sprintf("%s/%s", accessKeyID, scope) // Set URL query. query := req.URL.Query() query.Set("X-Amz-Algorithm", signV4Algorithm) query.Set("X-Amz-Date", date.Format(iso8601Format)) query.Set("X-Amz-Expires", strconv.FormatInt(expires, 10)) query.Set("X-Amz-SignedHeaders", "host") query.Set("X-Amz-Credential", credential)
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Fri Aug 29 02:39:48 GMT 2025 - 77K bytes - Click Count (0) -
guava/src/com/google/common/collect/MapMakerInternalMap.java
* * The Least Recently Used page replacement algorithm was chosen due to its simplicity, high hit * rate, and ability to be implemented with O(1) time complexity. The initial LRU implementation * operates per-segment rather than globally for increased implementation simplicity. We expect * the cache hit rate to be similar to that of a global LRU algorithm. */ // Constants /**
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Apr 01 17:27:13 GMT 2026 - 89.9K bytes - Click Count (0) -
lib/fips140/v1.26.0.zip
], len1) return v } // gcmHashKey represents the 16-byte hash key required by the GHASH algorithm. type gcmHashKey [16]byte type gcmPlatformData struct { hashKey gcmHashKey } func initGCM(g *GCM) { if !useGCM && !useGHASH { return } // Note that hashKey is also used in the KMA codepath to hash large nonces. aes.EncryptBlockInternal(&g.cipher, g.hashKey[:], g.hashKey[:]) } // ghashAsm uses the GHASH algorithm to hash data with the given key. The initial // hash value is given by hash which will be...
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Jan 08 17:58:32 GMT 2026 - 660.3K bytes - Click Count (0) -
cmd/erasure-healing.go
tillOffset := erasure.ShardFileOffset(0, partSize, partSize) readers := make([]io.ReaderAt, len(latestDisks)) prefer := make([]bool, len(latestDisks)) checksumAlgo := erasureInfo.GetChecksumInfo(partNumber).Algorithm for i, disk := range latestDisks { if disk == OfflineDisk { continue } thisPartErrs := shuffleCheckParts(dataErrsByPart[partIndex], latestMeta.Erasure.Distribution)
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 34.7K bytes - Click Count (0)