Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 71 - 80 of 205 for algorithm (0.06 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  1. 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)
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 3.2K bytes
    - Click Count (0)
  2. internal/crypto/key_test.go

    	sealedKey := key.Seal(extKey[:], iv, "SSE-S3", "bucket", "object")
    	sealedKey.Algorithm = InsecureSealAlgorithm
    	if err := key.Unseal(extKey[:], sealedKey, "SSE-S3", "bucket", "object"); err == nil {
    		t.Errorf("'%s' test succeeded but it should fail because the legacy algorithm was used", sealedKey.Algorithm)
    	}
    }
    
    var derivePartKeyTest = []struct {
    	PartID  uint32
    	PartKey string
    }{
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Jul 12 20:51:54 GMT 2024
    - 6.7K bytes
    - Click Count (0)
  3. 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);
     * }
     *
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Mar 11 01:10:31 GMT 2026
    - 4K bytes
    - Click Count (0)
  4. 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);
     * }
     *
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Mar 11 01:10:31 GMT 2026
    - 4.2K bytes
    - Click Count (0)
  5. 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)
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 3.3K bytes
    - Click Count (0)
  6. okhttp-tls/src/main/kotlin/okhttp3/tls/HeldCertificate.kt

          when (signedByKeyPair.private) {
            is RSAPrivateKey -> {
              AlgorithmIdentifier(
                algorithm = SHA256_WITH_RSA_ENCRYPTION,
                parameters = null,
              )
            }
    
            else -> {
              AlgorithmIdentifier(
                algorithm = SHA256_WITH_ECDSA,
                parameters = ByteString.EMPTY,
              )
            }
          }
    
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Tue Jan 27 09:00:39 GMT 2026
    - 21.6K bytes
    - Click Count (0)
  7. src/main/java/jcifs/internal/smb2/Smb2EncryptionContext.java

        private int getTransformFlags() {
            if (this.dialect.atLeast(DialectVersion.SMB311)) {
                return TRANSFORM_FLAG_ENCRYPTED;
            }
            // For SMB 3.0/3.0.2, this field contains the encryption algorithm
            return this.cipherId;
        }
    
        private byte[] getEncryptionKey() {
            if (keyManager != null) {
                String encKeyId = sessionId + "-enc";
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sun Aug 31 08:00:57 GMT 2025
    - 35.5K bytes
    - Click Count (0)
  8. docs/works_with_okhttp.md

     * [Ok2Curl](https://github.com/mrmike/Ok2Curl): Convert OkHttp requests into curl logs.
     * [OkHttp AWS Signer](https://github.com/babbel/okhttp-aws-signer): AWS V4 signing algorithm for OkHttp requests
     * [okhttp-digest](https://github.com/rburgst/okhttp-digest): A digest authenticator for OkHttp.
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Wed Nov 26 07:59:38 GMT 2025
    - 3.8K bytes
    - Click Count (0)
  9. docs/debugging/hash-set/main.go

    	"encoding/binary"
    	"flag"
    	"fmt"
    	"hash/crc32"
    	"log"
    	"os"
    	"strings"
    
    	"github.com/dchest/siphash"
    	"github.com/google/uuid"
    )
    
    // hashes the key returning an integer based on the input algorithm.
    // This function currently supports
    // - SIPMOD
    func sipHashMod(key string, cardinality int, id [16]byte) int {
    	if cardinality <= 0 {
    		return -1
    	}
    	// use the faster version as per siphash docs
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Mon Sep 19 18:05:16 GMT 2022
    - 3.7K bytes
    - Click Count (0)
  10. impl/maven-core/src/main/java/org/apache/maven/lifecycle/internal/builder/multithreaded/SmartProjectComparator.java

    /**
     * Smart project comparator that orders projects based on critical path analysis.
     * Projects with longer downstream dependency chains are prioritized to maximize
     * parallel execution efficiency.
     *
     * <p>The algorithm calculates a weight for each project as:
     * weight = 1 + max(downstream_project_weights)
     *
     * <p>Projects are then sorted by weight in descending order, ensuring that
    Created: Sun Apr 05 03:35:12 GMT 2026
    - Last Modified: Wed Aug 06 12:03:40 GMT 2025
    - 4.6K bytes
    - Click Count (0)
Back to Top