A hash that keeps an ordering with efficient methods
Ordered Hash array mapped trie
ordered list extension for tiptap
Conversion of JavaScript primitives to and from Buffer with binary order matching natural primitive order
Combines array of streams into one Readable stream in strict order.
Ensure values are ordered consistently in your CSS.
Generate hashes from javascript objects in node and the browser.
Object literal maintaining its properties in the order they were added
Stable JS value hash.
A MurmurHash2 implementation
Implementation of JSON Web Signatures
JWA implementation (supports all JWS algorithms)
A deterministic object hashing algorithm for Node.js.
remark-lint rule to warn when the markers of ordered lists violate a given style
abstract base class for hash-streams
An incremental implementation of MurmurHash3
Stable JS value hash.
remark-lint rule to check the marker value of ordered lists
A pure JS implementation SHA256.
SHA256 wrapper for browsers that prefers `window.crypto.subtle` but will fall back to a pure JS implementation in @aws-crypto/sha256-js to provide a consistent interface for SHA256.
Hashing made simple. Get the hash of a buffer/string/stream/file.
create hashes for browserify
simple but flexible lexically ordered AST traversal with pre and post visitors
Generates a hash for an installed npm package, useful for salting caches
An insertion-ordered hash map that provides O(1) (amortized) insertion, lookup, update and removal.
HashMap which preserves insertion order
Ordered Hashmap implementation to overcome arbitrary order of key-values problem in Rust
Hashes a set of items independent of their ordering
The Dictionary class is a type of ordered Hash, which keeps it's contents in a customizable order.
Ordered json hash conversion
Add methods to manipulate the order of the entries in the Hash object.
Make consistent hashcodes from flat Hashes, regardless of key ordering. Useful for hashing rows in a table.
A library providing a hash with preserved order and some array-like extensions.
A QueueHash is an ordered hash: Keys are ordered according to when they were inserted.
Adds Hash#ordered and Hash#slashed to Hash, which flavor a hash to behave in certain more humanly manners.
Core extensions on array and hash I find useful for everyday development
Use OrderTree when you need both insertion order access and nested hash path style access
Takes an object, serializes the attributes to an ordered hash based on a pre-defined schema
Defines higher-order functions available in Enumerable that work over a Hash's values and return a Hash.
A RBTree is a sorted associative collection that is implemented with a Red-Black Tree. It maps keys to values like a Hash, but maintains its elements in ascending key order. The interface is the almost identical to that of Hash.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.