Map object keys returning a new object
Transforms nested keys of complex objects
map an object, predicate updates keys, receives (value, key, object)
Map/rename keys recursively with lodash as only dependency.
Map keys from one object to a new object having the same values.
Map keys from one object to a new object having the same values.
🔑 Maps object keys recursively
Map keys to LudumPad input.
Persistent ordered mapping from strings
Recursive lodash.mapKeys
- npm install --save-dev change-array-map-keys # Usage #### nodejs commonjs ``` const changeArrayMapKeys = require('change-array-map-keys') var maps = { nickname: 'nickName' } var arr = [{nickname: 'zzx'}] var newArr = changeArrayMapKeys(maps, arr) ```
Map and Set with automatic key interning
Lowercase the keys of an object
Map object keys and values into a new object
High Performance In-Memory Cache for Node.js
A `Map` subclass with support for multiple keys for one entry.
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.
Various cache implementations
Automatically cleanup expired items in a Map
Webpack loader to replace json values with the key path.
Retrieves a name:pathname Map for a given workspaces config
A splay tree typescript library
A Map with weakly referenced values.
Bigmap for Keyv
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
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.
Supports only Linux so far.
Creating legends by hand is tedious. This software allows you to generate them automatically.
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.
Trie-like, prefix-tree data structures. First, a prefix-tree based on Arrays, which differs from a traditional trie, which maps strings to values. Second, a more general prefix-tree data structure that works for any type of keys, provided those keys can be transformed to and from an array. Both of these data structures are implemented in terms of hashes.
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.