A home for collection data structures with different referencing and observation techniques. Ships LinkedQueue, ObservableQueue, IndexMap, LinkedHeap, SingleEntryObject, and HeapMap.
A indexed map
## 集成请使用稳定版本 0.1.28
Maps interface from Clique Retire
A form validation library for HeroUI.
WASM binding for rdf-proofs
TypeScript definitions for string-algorithms
A data structure that allows indexing by multiple fields for fast data access.
drag and drop tag with vue.
IOL INC. Systems Dev - FrontEnd Utility Functions
BSP based procedural dungeon generation package.
Priority Queue implementation in typescript.
IOL Inc. / Systems Dev / Front-End utility functions
A search plugin for docsify that leverages algolia
Process framework: typed, event-emitting, subscribable long-running computations. Processes are addressable, controllable (pause/resume/cancel/seek), and compose via factories. Pairs with @console-one/multimap and @console-one/collections.
An extended version of the Map class that can act as WeakMap as well.
A Component for Vue.js.
A hash table with consistent order and fast iteration.
IndexMap and IndexSet powered by indexmap (SwissTable) and the axhash engine.
A no_std compatible implementation of the indexmap crate
Persistent IndexMap for Rust — embedded key-value store with in-memory hash map + append-only WAL on disk. O(1) get/insert/remove, insertion-order iteration, crash-safe recovery, automatic log compaction, serde-generic keys and values. No dependencies on sled/sqlite.
(Namada fork) A hash table with consistent order and fast iteration.
A hash table with consistent order and fast iteration. The indexmap is a hash table where the iteration order of the key-value pairs is independent of the hash values of the keys. It has the usual hash table functionality, it preserves insertion order except after removals, and it allows lookup of its elements by either hash table key or numerical index. A corresponding hash set type is also provided. This crate was initially published under the name ordermap, but it was renamed to indexmap.
A utility crate for enhanced collection operations with capacity control.
A fork of the popular `indexmap` library that adds a few extra APIs that are yet to be upstreamed.
A hash table with consistent order and fast iteration. The indexmap is a hash table where the iteration order of the key-value pairs is independent of the hash values of the keys. It has the usual hash table functionality, it preserves insertion order except after removals, and it allows lookup of its elements by either hash table key or numerical index. A corresponding hash set type is also provided. This crate is an ongoing fork of bluss/indexmap that provides amortized resizes.
A hash table with data accessible by index.
TOML deserilization with pretty error messages
DMS data-syntax parser (Rust reference implementation)