proxy.golang.org : github.com/hdonnay/rabin
Package rabin provides functions to calculate Rabin Fingerprints, using the Adler32 prime by default The algorithm used is: Where POW is (PRIME ** windowsize) % MOD However, the modulus operations can be turned into a bit mask if MOD is a power of two. So this implementation takes a shift instead of an integer.
Registry
-
Source
- Documentation
- JSON
- codemeta.json
purl: pkg:golang/github.com/hdonnay/rabin
License: MIT
Latest release: about 7 years ago
First release: about 7 years ago
Namespace: github.com/hdonnay
Stars: 0 on GitHub
Forks: 0 on GitHub
See more repository details: repos.ecosyste.ms
Last synced: 5 months ago