- Sort Score
- Num 10 results
- Language All
Results 1 - 10 of 11 for sipHash (0.06 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
android/guava/src/com/google/common/hash/SipHashFunction.java
* or implied. See the License for the specific language governing permissions and limitations under * the License. */ /* * SipHash-c-d was designed by Jean-Philippe Aumasson and Daniel J. Bernstein and is described in * "SipHash: a fast short-input PRF" (available at https://131002.net/siphash/siphash.pdf). */ package com.google.common.hash; import static com.google.common.base.Preconditions.checkArgument;
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Thu Feb 13 17:34:21 GMT 2025 - 5.3K bytes - Click Count (0) -
guava/src/com/google/common/hash/SipHashFunction.java
* or implied. See the License for the specific language governing permissions and limitations under * the License. */ /* * SipHash-c-d was designed by Jean-Philippe Aumasson and Daniel J. Bernstein and is described in * "SipHash: a fast short-input PRF" (available at https://131002.net/siphash/siphash.pdf). */ package com.google.common.hash; import static com.google.common.base.Preconditions.checkArgument;
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Thu Feb 13 17:34:21 GMT 2025 - 5.3K bytes - Click Count (0) -
docs/debugging/hash-set/main.go
"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 // https://github.com/dchest/siphash#usage
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Mon Sep 19 18:05:16 GMT 2022 - 3.7K bytes - Click Count (0) -
android/guava/src/com/google/common/hash/Hashing.java
* SipHash-2-4 algorithm</a> using a seed value of {@code k = 00 01 02 ...}. * * @since 15.0 */ public static HashFunction sipHash24() { return SipHashFunction.SIP_HASH_24; } /** * Returns a hash function implementing the <a href="https://131002.net/siphash/">64-bit * SipHash-2-4 algorithm</a> using the given seed. *
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Thu Jul 17 15:26:41 GMT 2025 - 29.8K bytes - Click Count (0) -
cmd/erasure-sets.go
func sipHashMod(key string, cardinality int, id [16]byte) int { if cardinality <= 0 { return -1 } // use the faster version as per siphash docs // https://github.com/dchest/siphash#usage k0, k1 := binary.LittleEndian.Uint64(id[0:8]), binary.LittleEndian.Uint64(id[8:16]) sum64 := siphash.Hash(k0, k1, []byte(key)) return int(sum64 % uint64(cardinality)) } func crcHashMod(key string, cardinality int) int {
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Fri Aug 29 02:39:48 GMT 2025 - 37K bytes - Click Count (1) -
go.mod
github.com/cespare/xxhash/v2 v2.3.0 github.com/cheggaaa/pb v1.0.29 github.com/coreos/go-oidc/v3 v3.14.1 github.com/coreos/go-systemd/v22 v22.5.0 github.com/cosnicolaou/pbzip2 v1.0.5 github.com/dchest/siphash v1.2.3 github.com/dustin/go-humanize v1.0.1 github.com/eclipse/paho.mqtt.golang v1.5.0 github.com/elastic/go-elasticsearch/v7 v7.17.10 github.com/fatih/color v1.18.0 github.com/felixge/fgprof v0.9.5
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Fri Oct 10 18:57:03 GMT 2025 - 12.2K bytes - Click Count (0) -
ci/official/utilities/code_check_full.bats
@com_google_absl//absl @pybind11_abseil//pybind11_abseil @org_tensorflow// @com_github_googlecloudplatform_google_cloud_cpp//google @com_github_grpc_grpc//src/compiler @com_google_protobuf//upb_generator @llvm-project//third-party/siphash @platforms//os @ml_dtypes_py//ml_dtypes @ruy// @rules_java_builtin//toolchains @rules_ml_toolchain// @rules_python// @stablehlo//stablehlo/experimental EOF
Created: Tue Dec 30 12:39:10 GMT 2025 - Last Modified: Fri Dec 19 18:47:57 GMT 2025 - 13.5K bytes - Click Count (0) -
go.sum
github.com/davecgh/go-spew v1.1.2-0.20180830191138-d8f796af33cc/go.mod h1:J7Y8YcW2NihsgmVo/mv3lAwl/skON4iLHjSsI+c5H38= github.com/dchest/siphash v1.2.3 h1:QXwFc8cFOR2dSa/gE6o/HokBMWtLUaNDVd+22aKHeEA= github.com/dchest/siphash v1.2.3/go.mod h1:0NvQU092bT0ipiFN++/rXm69QG9tVxLAlQHIXMPAkHc= github.com/decred/dcrd/dcrec/secp256k1/v4 v4.4.0 h1:NMZiJj8QnKe1LgsbDayM4UoHwbvwDRwnI3hwNaAHRnc=
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 79.8K bytes - Click Count (0) -
CREDITS
OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. ================================================================ github.com/dchest/siphash https://github.com/dchest/siphash ---------------------------------------------------------------- Creative Commons Legal Code CC0 1.0 Universal CREATIVE COMMONS CORPORATION IS NOT A LAW FIRM AND DOES NOT PROVIDECreated: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Thu Mar 13 05:29:51 GMT 2025 - 1.8M bytes - Click Count (0) -
android/guava-tests/test/com/google/common/io/testdata/alice_in_wonderland.txt
before, `and things are worse than ever,' thought the poor child, `for I never was so small as this before, never! And I declare it's too bad, that it is!' As she said these words her foot slipped, and in another moment, splash! she was up to her chin in salt water. Her first idea was that she had somehow fallen into the sea, `and in that case I can go back by railway,' she said to herself. (Alice had
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Fri Apr 21 02:27:51 GMT 2017 - 145.2K bytes - Click Count (0)