25 Repositories
Rust array-chunks 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
Split text into semantic chunks, up to a desired chunk size. Supports calculating length by characters and tokens
Large language models (LLMs) can be used for many tasks, but often have a limited context size that can be smaller than documents you might want to use. To use documents of larger length, you often have to split your text into chunks to fit within this context size.
store virtually unlimited, large files on discord by splitting them into small chunks
Discord Drive This repo hold an MVP implementation of an concept to store data on discord by dividing them into chunks of 7MB each, which are then upl
`N` dimensional cubic chunks crate
Hypercube Todo create OffsetShapeS: Shape, const D: usize a Shape offset by some amount Api positions(self) - OffsetPositionsSelf create OffsetPo
Using bevy and custom render pipelines in order to render many objects in a forest using chunks for performance.
bevy_efficient_forest_example Using bevy and custom render pipelines in order to render many objects in a forest using chunks for performance. Grass i
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
A simple allocator written in Rust that manages memory in fixed-size chunks.
Simple Chunk Allocator A simple no_std allocator written in Rust that manages memory in fixed-size chunks/blocks. Useful for basic no_std binaries whe
🦞 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.
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
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
🐎 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
decode a byte stream of varint length-encoded messages into a stream of chunks
length-prefixed-stream decode a byte stream of varint length-encoded messages into a stream of chunks This crate is similar to and compatible with the
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
SegVec data structure for rust. Similar to Vec, but allocates memory in chunks of increasing size.
segvec This crate provides the SegVec data structure. It is similar to Vec, but allocates memory in chunks of increasing size, referred to as "segment
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