- Sort Score
- Num 10 results
- Language All
Results 21 - 30 of 202 for algorithms (0.08 seconds)
-
docs_src/security/tutorial004_an_py39.py
Created: Sun Dec 28 07:19:09 GMT 2025 - Last Modified: Mon Sep 29 02:57:38 GMT 2025 - 4.2K bytes - Click Count (0) -
guava-tests/test/com/google/common/hash/MacHashFunctionTest.java
Hashing.hmacSha1(keyData).toString()); assertEquals( "Hashing.hmacSha256(Key[algorithm=HmacSHA256, format=RAW])", Hashing.hmacSha256(SHA256_KEY).toString()); assertEquals( "Hashing.hmacSha256(Key[algorithm=HmacSHA256, format=RAW])", Hashing.hmacSha256(keyData).toString()); assertEquals(
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Fri Dec 27 16:19:35 GMT 2024 - 13.8K bytes - Click Count (0) -
docs_src/security/tutorial005_py39.py
detail="Could not validate credentials", headers={"WWW-Authenticate": authenticate_value}, ) try: payload = jwt.decode(token, SECRET_KEY, algorithms=[ALGORITHM]) username: str = payload.get("sub") if username is None: raise credentials_exception scope: str = payload.get("scope", "") token_scopes = scope.split(" ")
Created: Sun Dec 28 07:19:09 GMT 2025 - Last Modified: Mon Sep 29 02:57:38 GMT 2025 - 5.3K bytes - Click Count (0) -
CITATION.cff
architecture gives flexibility to the application developer, whereas in previous “parameter server” designs the management of shared state is built into the system, TensorFlow enables developers to experiment with novel optimizations and training algorithms. TensorFlow supports a variety of applications, with a focus on training and inference on deep neural networks. Several Google services use TensorFlow in production, we have released it as an open-source project, and it has become widely used for...
Created: Tue Dec 30 12:39:10 GMT 2025 - Last Modified: Mon Sep 06 15:26:23 GMT 2021 - 3.5K bytes - Click Count (0) -
cmd/bitrot.go
} for algorithm := range bitrotAlgorithms { if !algorithm.Available() { continue } checksum, err := hex.DecodeString(checksums[algorithm]) if err != nil { logger.Fatal(errSelfTestFailure, fmt.Sprintf("bitrot: failed to decode %v checksum %s for selftest: %v", algorithm, checksums[algorithm], err)) } var ( hash = algorithm.New()Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 7.7K bytes - Click Count (0) -
android/guava/src/com/google/common/hash/HashFunction.java
* * <h3>Relationship to {@link Object#hashCode}</h3> * * <p>Java's baked-in concept of hash codes is constrained to 32 bits, and provides no separation * between hash algorithms and the data they act on, so alternate hash algorithms can't be easily * substituted. Also, implementations of {@code hashCode} tend to be poor-quality, in part because
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Mon Mar 17 20:26:29 GMT 2025 - 10.9K bytes - Click Count (0) -
guava/src/com/google/common/hash/HashFunction.java
* * <h3>Relationship to {@link Object#hashCode}</h3> * * <p>Java's baked-in concept of hash codes is constrained to 32 bits, and provides no separation * between hash algorithms and the data they act on, so alternate hash algorithms can't be easily * substituted. Also, implementations of {@code hashCode} tend to be poor-quality, in part because
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Mon Mar 17 20:26:29 GMT 2025 - 10.9K bytes - Click Count (0) -
guava/src/com/google/common/hash/AbstractNonStreamingHashFunction.java
import com.google.errorprone.annotations.Immutable; import java.nio.ByteBuffer; import java.nio.ByteOrder; import java.nio.charset.Charset; /** * Skeleton implementation of {@link HashFunction}, appropriate for non-streaming algorithms. All * the hash computation done using {@linkplain #newHasher()} are delegated to the {@linkplain * #hashBytes(byte[], int, int)} method. * * @author Dimitris Andreou */ @ImmutableCreated: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Thu Dec 04 15:39:10 GMT 2025 - 4.8K bytes - Click Count (0) -
docs/features/connections.md
URLs are abstract:
Created: Fri Dec 26 11:42:13 GMT 2025 - Last Modified: Mon Feb 21 03:33:59 GMT 2022 - 5.4K bytes - Click Count (0) -
cmd/erasure-coding.go
tillOffset := min(endShard*shardSize+shardSize, shardFileSize) return tillOffset } // erasureSelfTest performs a self-test to ensure that erasure // algorithms compute expected erasure codes. If any algorithm // produces an incorrect value it fails with a hard error. // // erasureSelfTest tries to catch any issue in the erasure implementation // early instead of silently corrupting data.
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 8.5K bytes - Click Count (0)