Hashsplitting is a way of dividing a byte stream into pieces based on the stream's content rather than on any predetermined chunk size. As the Splitter reads the stream it maintains a rolling checksum of the last several bytes. A chunk boundary occurs when the rolling checksum has enough…
Die Hauptfunktionen von bobg/hashsplit sind: Data Structures.
Open-Source-Alternativen zu bobg/hashsplit sind unter anderem: xtaci/algorithms — This is a collection of classical algorithms and data structures implemented as a header-only C++ library. It provides… adrianbrad/queue — ⏪️ Go package providing multiple queue implementations. Developed in a thread-safe generic way. agext/levenshtein — Levenshtein distance and similarity metrics with customizable edit costs and Winkler-like bonus for common prefix. agnivade/levenshtein — Go implementation to calculate Levenshtein Distance. aio-arch/graphlib — Topological sort lib,Sorting and pruning of DAG graphs. accelerationnet/access — A common lisp library to unify access to common dictionary-like data-structures.
This is a collection of classical algorithms and data structures implemented as a header-only C++ library. It provides a suite of tools for general algorithm implementation, including data structure management, graph theory analysis, and string processing. The library is distinguished by its specialized toolkits for cryptographic hashing and encoding, featuring implementations of MD5, SHA-1, and Base64. It also includes advanced capabilities for high-performance string processing via suffix trees and arrays, as well as computational number theory for primality testing and arbitrary-precision
⏪️ Go package providing multiple queue implementations. Developed in a thread-safe generic way.
Levenshtein distance and similarity metrics with customizable edit costs and Winkler-like bonus for common prefix.
A common lisp library to unify access to common dictionary-like data-structures