- Sort Score
- Result 10 results
- Languages All
Results 91 - 100 of 242 for Algorithm (0.04 sec)
-
guava/src/com/google/common/graph/PredecessorsFunction.java
* * <p>This interface is meant to be used as the type of a parameter to graph algorithms (such as * topological sort) that only need a way of accessing the predecessors of a node in a graph. * * <h3>Usage</h3> * * Given an algorithm, for example: * * {@snippet : * public <N> someGraphAlgorithm(N startNode, PredecessorsFunction<N> predecessorsFunction); * } *
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 4K bytes - Viewed (0) -
src/main/java/jcifs/smb1/smb1/ACE.java
* based on these entries. * <p> * To fully understand the information exposed by this class a description * of the access check algorithm used by Windows is required. The following * is a basic description of the algorithm. For a more complete description * we recommend reading the section on Access Control in Keith Brown's * "The .NET Developer's Guide to Windows Security" (which is also
Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Sat Aug 16 01:32:48 UTC 2025 - 8.8K bytes - Viewed (0) -
src/main/java/jcifs/ACE.java
* based on these entries. * <p> * To fully understand the information exposed by this class a description * of the access check algorithm used by Windows is required. The following * is a basic description of the algorithm. For a more complete description * we recommend reading the section on Access Control in Keith Brown's * "The .NET Developer's Guide to Windows Security" (which is also
Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Sat Aug 16 01:32:48 UTC 2025 - 7.1K bytes - Viewed (0) -
cmd/erasure-healing-common_test.go
Checksums: map[string]string(nil), }, }, Erasure: ErasureInfo{ Algorithm: "ReedSolomon", DataBlocks: 6, ParityBlocks: 6, BlockSize: 1048576, Index: 1, Distribution: []int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12}, Checksums: []ChecksumInfo{{PartNumber: 1, Algorithm: 0x3, Hash: []uint8{}}}, }, NumVersions: 1, Idx: 0, }
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 22.4K bytes - Viewed (0) -
docs/bucket/versioning/DESIGN.md
"X-Minio-Internal-Server-Side-Encryption-Seal-Algorithm": "REFSRXYyLUhNQUMtU0hBMjU2", "X-Minio-Internal-Server-Side-Encryption-Iv": "bW5YRDhRUGczMVhkc2pJT1V1UVlnbWJBcndIQVhpTUN1dnVBS0QwNUVpaz0=",
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Sun Jul 17 15:43:14 UTC 2022 - 5.8K bytes - Viewed (0) -
internal/http/lambda-headers.go
AmzFwdHeaderSSE = "x-amz-fwd-header-x-amz-server-side-encryption" AmzFwdHeaderSSEC = "x-amz-fwd-header-x-amz-server-side-encryption-customer-algorithm" AmzFwdHeaderSSEKMSID = "x-amz-fwd-header-x-amz-server-side-encryption-aws-kms-key-id" AmzFwdHeaderSSECMD5 = "x-amz-fwd-header-x-amz-server-side-encryption-customer-key-MD5"
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Tue Mar 07 16:12:41 UTC 2023 - 3.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/PredecessorsFunction.java
* * <p>This interface is meant to be used as the type of a parameter to graph algorithms (such as * topological sort) that only need a way of accessing the predecessors of a node in a graph. * * <h3>Usage</h3> * * Given an algorithm, for example: * * {@snippet : * public <N> someGraphAlgorithm(N startNode, PredecessorsFunction<N> predecessorsFunction); * } *
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/SuccessorsFunction.java
* * <p>This interface is meant to be used as the type of a parameter to graph algorithms (such as * breadth first traversal) that only need a way of accessing the successors of a node in a graph. * * <h3>Usage</h3> * * Given an algorithm, for example: * * {@snippet : * public <N> someGraphAlgorithm(N startNode, SuccessorsFunction<N> successorsFunction); * } *
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 4.2K bytes - Viewed (0) -
internal/event/target/kafka_scram_client_contrib.go
scram.HashGeneratorFcn } // Begin constructs a SCRAM client component based on a given hash.Hash // factory receiver. This constructor will normalize the username, password // and authzID via the SASLprep algorithm, as recommended by RFC-5802. If // SASLprep fails, the method returns an error. func (x *XDGSCRAMClient) Begin(userName, password, authzID string) (err error) { x.Client, err = x.NewClient(userName, password, authzID)
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Sun Sep 28 20:59:21 UTC 2025 - 3.2K bytes - Viewed (0) -
internal/logger/target/kafka/kafka_scram_client_contrib.go
scram.HashGeneratorFcn } // Begin constructs a SCRAM client component based on a given hash.Hash // factory receiver. This constructor will normalize the username, password // and authzID via the SASLprep algorithm, as recommended by RFC-5802. If // SASLprep fails, the method returns an error. func (x *XDGSCRAMClient) Begin(userName, password, authzID string) (err error) { x.Client, err = x.NewClient(userName, password, authzID)
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Sun Sep 28 20:59:21 UTC 2025 - 3.3K bytes - Viewed (0)