Crate frd_pu 

FRD-PU: The Fast RAM Data-Processing Unit

A high-performance, zero-dependency library built from the ground up for extreme efficiency. It is designed to handle massive computational tasks and data streams with minimal resource consumption. This library is ideal for creating hyper-fast applications without a monstrous hardware footprint.

Our philosophy is simple: Do more with less. We achieve this through a unique blend of mathematical algorithms and zero-copy data streaming, all built on top of a truly dependency-free foundation. This is how we give you the power to create professional, dominant applications that make bloated, resource-hogging software a thing of the past.

Core Features:

• Absolute 0 Dependencies: We rely only on the Rust standard library, ensuring a tiny footprint and lightning-fast compilation.
• Memory-First Design: The library’s core is built to avoid unnecessary memory allocations, allowing you to process massive datasets with minimal memory impact.
• Optimized Engines: We provide specialized APIs for different types of computation:
  • cpu_task for single-threaded, sequential tasks.
  • parallel for data-parallel tasks that leverage multiple CPU cores.
  • data_stream for handling large files efficiently.
  • bloom_filter for memory-efficient set checks.
  • cache for a high-performance, memory-aware Least Recently Used (LRU) cache.
  • concurrent for thread-safe data structures for safe parallel processing.
  • hasher for a zero-dependency, high-performance hashing engine.
  • btree for an efficient binary search tree.
  • trie for a memory-efficient prefix tree.
  • quicksort for an insanely fast in-place sorting algorithm.

Re-exports

pub use bloom_filter::BloomFilter;

pub use bloom_filter::BloomFilterError;

pub use cpu_task::CpuTask;

pub use cpu_task::CpuTaskError;

pub use cpu_task::new_cpu_task;

pub use data_stream::DataStream;

pub use data_stream::DataStreamError;

pub use data_stream::new_file_stream;

pub use data_stream::new_network_stream;

pub use parallel::execute_parallel;

pub use parallel::ParallelTaskError;

pub use cache::LruCache;

pub use cache::CacheError;

pub use concurrent::ConcurrentList;

pub use concurrent::ConcurrentListError;

pub use hasher::hash_bytes;

pub use hasher::hash_file;

pub use hasher::hash_stream;

pub use hasher::HasherError;

pub use btree::BinarySearchTree;

pub use btree::BinarySearchTreeError;

pub use trie::Trie;

pub use trie::TrieError;

pub use quicksort::quicksort;

pub use quicksort::QuickSortError;

Modules

bloom_filter

btree

cache

concurrent

cpu_task

data_stream

hasher

parallel

quicksort

trie