Search Options

Results per page
Sort
Preferred Languages
Advance

Results 81 - 90 of 199 for algorithm (0.14 sec)

  1. 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
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Mon Sep 19 18:05:16 UTC 2022
    - 3.7K bytes
    - Viewed (0)
  2. guava/src/com/google/common/escape/CharEscaper.java

       * from the resulting text.
       *
       * <p>If the character does not need to be escaped, this method should return {@code null}, rather
       * than a one-character array containing the character itself. This enables the escaping algorithm
       * to perform more efficiently.
       *
       * <p>An escaper is expected to be able to deal with any {@code char} value, so this method should
       * not throw any exceptions.
       *
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Feb 13 15:45:16 UTC 2025
    - 6.7K bytes
    - Viewed (0)
  3. android/guava-tests/benchmark/com/google/common/collect/BinaryTreeTraverserBenchmark.java

            for (int i = 0; i < size; i++) {
              keys[i] = rng.nextInt();
            }
            return createTreap(Ints.asList(keys));
          }
    
          // See http://en.wikipedia.org/wiki/Treap for details on the algorithm.
          private Optional<BinaryNode> createTreap(List<Integer> keys) {
            if (keys.isEmpty()) {
              return Optional.absent();
            }
            int minIndex = 0;
            for (int i = 1; i < keys.size(); i++) {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 4.9K bytes
    - Viewed (0)
  4. docs/compression/README.md

    MinIO uses [`klauspost/compress/s2`](https://github.com/klauspost/compress/tree/master/s2)
    streaming compression due to its stability and performance.
    
    This algorithm is specifically optimized for machine generated content.
    Write throughput is typically at least 500MB/s per CPU core,
    and scales with the number of available CPU cores.
    Decompression speed is typically at least 1GB/s.
    
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Tue Aug 12 18:20:36 UTC 2025
    - 5.2K bytes
    - Viewed (0)
  5. maven-tests/mvnw.cmd

      }
      Import-Module $PSHOME\Modules\Microsoft.PowerShell.Utility -Function Get-FileHash
      if ((Get-FileHash "$TMP_DOWNLOAD_DIR/$distributionUrlName" -Algorithm SHA256).Hash.ToLower() -ne $distributionSha256Sum) {
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Sat Jul 12 12:05:57 UTC 2025
    - 6.8K bytes
    - Viewed (0)
  6. docs/erasure/README.md

    ## What is Erasure Code?
    
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Tue Aug 12 18:20:36 UTC 2025
    - 4.2K bytes
    - Viewed (0)
  7. cmd/sts-handlers_test.go

            "claims": {
                "accessKey": "u4ccRswj62HV3Ifwima7",
                "ldapUser": "uid=svc.algorithm,ou=swengg,dc=min,dc=io",
                "ldapUsername": "svc.algorithm",
                "parent": "uid=svc.algorithm,ou=swengg,dc=min,dc=io",
                "sa-policy": "inherited-policy"
            },
            "sessionPolicy": null,
            "status": "on",
            "name": "",
            "description": ""
        }
    }
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 100.2K bytes
    - Viewed (1)
  8. 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.
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 8.5K bytes
    - Viewed (0)
  9. docs/es/docs/tutorial/security/oauth2-jwt.md

    09d25e094faa6ca2556c818166b7a9563b93f7099f6f0f4caa6cf63b88e8d3e7
    ```
    
    </div>
    
    Y copia el resultado a la variable `SECRET_KEY` (no uses la del ejemplo).
    
    Crea una variable `ALGORITHM` con el algoritmo usado para firmar el token JWT y configúralo a `"HS256"`.
    
    Crea una variable para la expiración del token.
    
    Define un Modelo de Pydantic que se usará en el endpoint de token para el response.
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 10:49:48 UTC 2025
    - 10.9K bytes
    - Viewed (0)
  10. docs/ftp/README.md

    
    ### Custom Algorithms (SFTP)
    
    Custom algorithms can be specified via command line parameters.
    Algorithms are comma separated. 
    Note that valid values does not in all cases represent default values.
    
    `--sftp=pub-key-algos=...` specifies the supported client public key
    authentication algorithms. Note that this doesn't include certificate types
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Tue May 07 06:41:25 UTC 2024
    - 7.8K bytes
    - Viewed (0)
Back to top