Search Results for "zstd-v1.5.5"

Binding is statically linked with a specific version of RocksDB. If you want to build it yourself, make sure you've also cloned the RocksDB and compression submodules. By default, support for the Snappy, LZ4, Zstd, Zlib, and Bzip2 compression is enabled through crate features. If support for all of these compression algorithms is not needed, default features can be disabled and specific compression algorithms can be enabled. The underlying RocksDB does allow column families to be created and dropped from multiple threads concurrently. But this crate doesn't allow it by default for compatibility. ...

Static Web Server (or SWS abbreviated) is a tiny and fast production-ready web server suitable to serve static web files or assets. It is focused on lightness and easy-to-use principles while keeping high performance and safety powered by The Rust Programming Language. Written on top of Hyper and Tokio runtime, it provides concurrent and asynchronous networking abilities and the latest HTTP/1 - HTTP/2 implementations. Cross-platform and available for Linux, macOS, Windows, FreeBSD, NetBSD,...

Stegcore combines cryptography and steganography to hide encrypted data inside ordinary files. It encrypts your payload before embedding it, so the hidden content is unreadable even if someone extracts it, and invisible to anyone who doesn't know it's there. Unlike basic steganography tools that hide data without encrypting it, Stegcore ensures the payload is cryptographically protected at rest. Unlike pure encryption tools, the payload isn't even visible. Designed for journalists,...

Roa is an async web framework inspired by koajs, lightweight but powerful.

...Fully atomic single-key operations, including compare and swap. Forward and reverse iterators over ranges of items. A crash-safe monotonic ID generator capable of generating 75-125 million unique ID's per second. Zstd compression (use the compression build feature, disabled by default). Cpu-scalable lock-free implementation. Flash-optimized log-structured storage. Uses modern b-tree techniques such as prefix encoding and suffix truncation for reducing the storage costs of long keys with shared prefixes. If keys are the same length and sequential then the system can avoid storing 99%+ of the key data in most cases, essentially acting like a learned index. sled performs prefix encoding on long keys with similar prefixes that are grouped together in a range, as well as suffix truncation to further reduce the indexing costs of long keys.