"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

	// Tests hashing order to be consistent.
	for i, testCase := range testCases {
		if sipHashElement := hashKey("SIPMOD", testCase.objectName, 200, testUUID); sipHashElement != testCase.sipHash {
			t.Errorf("Test case %d: Expected \"%v\" but failed \"%v\"", i+1, testCase.sipHash, sipHashElement)
		}
	}

	if sipHashElement := hashKey("SIPMOD", "This will fail", -1, testUUID); sipHashElement != -1 {

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 {

@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

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=

```go
// hashes the key returning an integer.
func sipHashMod(key string, cardinality int, id [16]byte) int {
        if cardinality <= 0 {
                return -1
        }
        sip := siphash.New(id[:])
        sip.Write([]byte(key))
        return int(sip.Sum64() % uint64(cardinality))
}
```

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 PROVIDE

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

0x60, 0x14, 0x1b, 0xd2, 0x63, } var skHash = []byte{ 0x29, 0x37, 0x49, 0x51, 0xcb, 0x2b, 0xc3, 0xcd, 0xa7, 0x31, 0x5c, 0xe7, 0xf0, 0xab, 0x99, 0xc7, 0xd2, 0xd6, 0x52, 0x92, 0xe6, 0xc5, 0x15, 0x6e, 0x8a, 0xa6, 0x2a, 0xc1, 0x4b, 0x14, 0x12, 0xaf, } var sigHash = []byte{ 0xdc, 0xc7, 0x1a, 0x42, 0x1b, 0xc6, 0xff, 0xaf, 0xb7, 0xdf, 0x0c, 0x7f, 0x6d, 0x01, 0x8a, 0x19, 0xad, 0xa1, 0x54, 0xd1, 0xe2, 0xee, 0x36, 0x0e, 0xd5, 0x33, 0xce, 0xcd, 0x5d, 0xc9, 0x80, 0xad, } priv := newPrivateKey(seed, params44) H :=...