keywords:nested keys

nestie

A tiny (215B) and fast utility to expand a flattened object

lukeed

published 1.0.3 a year ago

M

Q

P

deeps

Highly performant utilities to manage deeply nested objects. get, set, merge, flatten, diff etc.

salakar

published 1.4.5 6 years ago

M

Q

P

merge-deeper-object

Deep merge properties of objects.

ilyassmabrouk

published 0.2.0 a year ago

M

Q

P

@d_hristov/get-value

Use property paths like 'a.b.c' to get a nested value from an object. Even works when keys have dots in them (no other dot-prop library can do this!).

dobromir-hristov

published 3.0.4 4 years ago

M

Q

P

keyarray-get

get nested properties with key arrays

kemitchell

published 1.0.0 8 years ago

M

Q

P

keyarray-has

recursive hasOwnProperty taking an array of keys

kemitchell

published 1.0.0 8 years ago

M

Q

P

tree-to-flat-map

Convert a tree to a flat map with dot-separated keys

tibdex

published 1.0.1 4 years ago

M

Q

P

all-object-keys-deep

recursive get all keys of object

padurets

published 2.2.3 7 years ago

M

Q

P

@bemoje/arr-sorted-index-of

Binary search -based indexOf for sorted arrays.

bemoje

published 1.0.2 4 years ago

M

Q

P

@bemoje/arr-sorted-insertion-index

Find the array index of where to add an element to keep it sorted.

bemoje

published 3.0.2 4 years ago

M

Q

P

@bemoje/arr-sorted-has

Binary search -based indexOf for sorted arrays.

bemoje

published 1.0.2 4 years ago

M

Q

P

@bemoje/arr-sorted-remove-duplicates

Remove all duplicate elements in a sorted array, leaving only uniques.

bemoje

published 1.0.1 4 years ago

M

Q

P

@bemoje/arr-sorted-indexes-of

Find all indexes at which an array element exists, by binary search.

bemoje

published 1.0.1 4 years ago

M

Q

P

For a sorted array, add an element. Whichever comparator function was used to sort the array, can be passed. Also supports comparator-builder options. For reference, see: https://github.com/bemoje/bemoje-arr-sort-comparator

bemoje

published 1.0.4 4 years ago

M

Q

P

@bemoje/arr-sort

Sort an array considerably faster than the native Array.prototype.sort as a drop-in replacement. Fork of of the famous timsort module, but this module allows for passing comparator-builder options instead of a comparator function. In short, advanced compa