Map an object key that ends with a value
get-map-key-by-value function
`Object.values(obj)` -> `Object.keys(obj).map(key => obj[key])`
`Object.values(obj)` -> `Object.keys(obj).map(key => obj[key])`
map key deep
Persistent ordered mapping from strings
Map key-value pairs treating deeply-equal keys as equivalent objects
xet( map, key, factory ) // => If map doesn't have key, set it to the return value of factory. Return value.
Store information about any JS value in a side channel, using a Map
A thing that is a lot like ES6 `Map`, but without iterators, for use in environments where `for..of` syntax and `Map` are not available.
Map and Set with automatic key interning
Map object keys and values into a new object
A WeakMap shim for Node.js and browsers
buffer(ArrayBuffer/Dataview) -> key value pair -> Map(key, value list)
Lowercase the keys of an object
Simple key-value storage with support for multiple backends
Map<key, Array<value>>
A Map-like data structure that only stores the most recently set key/value pair
JavaScript code generator from an ESTree-compliant AST.
Generates and consumes source maps
Map `visit` over an array of objects.
Stringify an object/array like JSON.stringify just without all the double-quotes
Basic cache object for storing key-value pairs.
Generates and consumes source maps
CRDTs as categorical colimits, built on comp-cat-rs
Async, zero-alloc, pull-based deserialization for Rust
Derive macros for strede
JSON format backend for strede
Runtime protobuf reflection for OxiProto via prost-reflect
A backport of ObjectSpace::WeakKeyMap for Ruby < 3.3
Parse Parameters with key mapping, transformation, and defaults.
Provides a mapping of symbols to common keycodes used in interacting with web browsers, intended to be used by capybara drivers.
Creating legends by hand is tedious. This software allows you to generate them automatically.
Supports only Linux so far.
Auto-magically map Hash[keys] to ActiveRecord.attributes
Maps values from hashes with different structures and/or key names. Ideal for normalizing arbitrary data to be consumed by your applications, or to prepare your data for different display formats (ie. json). Tiny module that allows you to easily adapt from one hash structure to another with a simple declarative DSL.
A little lib which maps original keys to the new ones and more
Read characters from the console and map special keys to symbols
Maps values from hashes with different structures and/or key names. Ideal for normalizing arbitrary data to be consumed by your applications, or to prepare your data for different display formats (ie. json). Tiny module that allows you to easily adapt from one hash structure to another with a simple declarative DSL.
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.
Query the registry using objects built dynamically from a string which maps each object to a registry key.
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.
No description provided.
No description provided.