A linked list implementation with unique features and an extended list of constant time methods providing high performance traversals and mutations.
Ordered Hashmap implementation to overcome arbitrary order of key-values problem in Rust
A beautiful tree 🌳 with convenient, efficient, parallelizable growth, mutation and traversal features.
jql - JSON Query Language - is a fast and simple command-line tool to manipulate JSON data.
Parser for jql - the JSON Query Language tool.
Runner for jql - the JSON Query Language tool.
AlephBFT is an asynchronous and Byzantine fault tolerant consensus protocol aimed at ordering arbitrary messages (transactions). It has been designed to continuously operate even in the harshest conditions: with no bounds on message-delivery delays and in the presence of malicious actors. This makes it an excellent fit for blockchain-related applications.
AlephBFT is an asynchronous and Byzantine fault tolerant consensus protocol aimed at ordering arbitrary messages (transactions). It has been designed to continuously operate even in the harshest conditions: with no bounds on message-delivery delays and in the presence of malicious actors. This makes it an excellent fit for blockchain-related applications.
A wrapper for adding arbitrary partial/total order to a type.
Link-time collections for Rust (distributed slices, registries)
Interpolation module for SciRS2 (scirs2-interpolate)
scheme parser for dynamic config files