Computationally efficient rolling window iterators for Python (sum, variance, min/max, etc.)
-
Updated
Mar 9, 2024 - Python
Computationally efficient rolling window iterators for Python (sum, variance, min/max, etc.)
📌📚 An extensive standalone data structure library for JavaScript.
Minimal Adler32 implementation for Rust.
Content-Defined Chunking for Rust
A haskell library implementing the Adler-32 checksum, with support for rolling checksum operation
The Rabin-Karp algorithm, which uses a rolling hash to match patterns in text, is commonly used for exact string matching and plagiarism detection. This work presents a parallel version of the Accelerated Rabin-Karp algorithm, implemented using MPI and Distributed Python disPy.
Rabin-Karp string-matching algorithm
packaged python implementation of a rolling hash function
gives positions of occurrence of a substring using rolling hash functions
A diverse array of non-cryptographic hash functions in Common Lisp
Encrypts and stores passwords using a rolling hash algorithm
Add a description, image, and links to the rolling-hash-functions topic page so that developers can more easily learn about it.
To associate your repository with the rolling-hash-functions topic, visit your repo's landing page and select "manage topics."