26 Repositories
Rust double-array Libraries
j is a limited subset of J, an array programming language
j is a limited subset of J, an array programming language. this file is an accompanying essay.
Fast array expressions on the stack, no-std compatible
Strobe Fast, low-memory, elementwise array expressions on the stack. Compatible with no-std (and no-alloc) environments. This crate provides array exp
Create Bitcoin double-spend discouraging bonds on Liquid.
doubletake A tool for creating Bitcoin double-spend punishment bonds on Liquid. WARNING: Don't use this tool for real use cases yet. There are still a
Python module implemented in Rust for counting the number of one bits in a numpy array.
bit-counter Package for counting the number of one bits in a numpy array of uint8 values. Implemented as a Python module using Rust, providing high pe
๐ A fast implementation of the Aho-Corasick algorithm using the compact double-array data structure. (Python wrapper for daachorse)
python-daachorse daachorse is a fast implementation of the Aho-Corasick algorithm using the compact double-array data structure. This is a Python wrap
๐ฆ Rust library of natural language dictionaries using character-wise double-array tries.
๐ฆ Crawdad: ChaRActer-Wise Double-Array Dictionary Overview Crawdad is a library of natural language dictionaries using character-wise double-array tr
A prefix tree (trie) is a data structure that allows you to store an associative array whose keys are strings
RadixTrie A prefix tree (trie) is a data structure that allows you to store an associative array whose keys are strings. It is a root tree, each edge
A lightweight Rust library for BitVector Rank&Select operations, coupled with a generic Sparse Array implementation
A lightweight Rust library for BitVector Rank&Select operations, coupled with a generic Sparse Array implementation
This crate implements an array_chunks method for iterators
This crate implements an array_chunks method for iterators. It behaves like [slice::array_chunks] but works with any [Iterator] type. Several nightly
This library provides a data view for reading and writing data in a byte array.
Docs This library provides a data view for reading and writing data in a byte array. This library requires feature(generic_const_exprs) to be enabled.
Shellfirm - Intercept any risky patterns (default or defined by you) and prompt you a small challenge for double verification
shellfirm Opppppsss you did it again? ๐ฑ ๐ฑ ๐ฐ Protect yourself from yourself! rm -rf * git reset --hard before saving? kubectl delete ns which going
Click-once - A small tiny little binary to fix undesired mouse double clicks in Windows, written in Rust.
click-once A small tiny little binary to fix malfunctioning mouse double clicks in Windows, written in Rust. Minimal executable with little to no over
An efficient method of heaplessly converting numbers into their string representations, storing the representation within a reusable byte array.
NumToA #![no_std] Compatible with Zero Heap Allocations The standard library provides a convenient method of converting numbers into strings, but thes
Pure Rust implementation of the Double Ratchet algorithm
Double Ratchet A pure Rust implementation of the Double Ratchet, as specified by Trevor Perrin and Moxie Marlinspike. The Double Ratchet allows two us
Shade Protocol is an array of connected privacy-preserving dApps built on Secret Network
Shade Protocol Core Contracts Contract Reference Description mint doc Handles asset burning and silk minting oracle doc Handles asset price queries tr
Cyclic Double-Linked List
Double-Linked List This crate provides a doubly-linked list with owned nodes, implemented as a cyclic list. Usage First, add dependency in your Cargo.
๐ Daac Horse: Double-Array Aho-Corasick in Rust
๐ daachorse Daac Horse: Double-Array Aho-Corasick Overview A fast implementation of the Aho-Corasick algorithm using Double-Array Trie. Examples use
Avoid double indirection in nested smart pointers.
Pierce Avoid double indirection in nested smart pointers. The Pierce stuct allows you to cache the deref result of doubly-nested smart pointers. Quick
An implemenetation of (part of) the suffix array construction algorithm developed by Zhize Li (2016)
suffix-array-li2016 An implemenetation of (part of) the suffix array construction algorithm developed by Zhize Li et al. (2016). This algorithm is cla
Parallel finance a decentralized lending protocol built on top of the Polkadot ecosystem. Our unique approach will allow users to earn "double interests" from staking and lending their tokens simultaneously.
Parallel Finance A new Cumulus-based Substrate node, ready for hacking ๐ Getting Started Follow these steps to get started with the Cumulus Template
An inquiry into nondogmatic software development. An experiment showing double performance of the code running on JVM comparing to equivalent native C code.
java-2-times-faster-than-c An experiment showing double performance of the code running on JVM comparing to equivalent native C code โ ๏ธ The title of t
Rust parser combinator framework
nom, eating data byte by byte nom is a parser combinators library written in Rust. Its goal is to provide tools to build safe parsers without compromi
enum-map enum-map xfix/enum-map [enum-map] โ An optimized map implementation for enums using an array to store values.
enum-map A library providing enum map providing type safe enum array. It is implemented using regular Rust arrays, so using them is as fast as using r
Generic array types in Rust
generic-array This crate implements generic array types for Rust. Requires minumum Rust version of 1.36.0, or 1.41.0 for From[T; N] implementations
Array helpers for Rust's Vector and String types
array_tool Array helpers for Rust. Some of the most common methods you would use on Arrays made available on Vectors. Polymorphic implementations for
ndarray: an N-dimensional array with array views, multidimensional slicing, and efficient operations
ndarray The ndarray crate provides an n-dimensional container for general elements and for numerics. Please read the API documentation on docs.rs or t