@dotvirus/ptree
Deep object walking & manipulation
Last updated 7 months ago by dotvirus .
ISC · Repository · Bugs · Original npm · Tarball · package.json
$ cnpm install @dotvirus/ptree 
SYNC missed versions from official npm registry.

npm version

ptree

Deep object walking & manipulation

This package wraps regular Objects and Arrays, providing more functionality for accessing & manipulating deep objects.

Install

npm install @dotvirus/ptree --save
// Require
const ptree = require("@dotvirus/ptree").default;

// Import
import ptree from "@dotvirus/ptree";

Methods

Constructor

Create a new ptree wrapping your original object/array.

// Using object
const root = new ptree({ a: 2, b: 3 });

// Using array
const root = new ptree([1, 2, 3]);

get

Get the value at given key. Key can be a dot-separated string, or an array containing single key segments as strings, numbers or functions. If a non-existing key is accessed (see example 3), undefined is returned. If no argument is passed, the root object is returned (same as getRoot()).

const root = new ptree({ a: 2, b: 3 });
console.log(root.get("a")); // -> 2
console.log(root.get([() => "a"])); // -> 2

const root2 = new ptree({ a: [1, 2, 3], b: 3 });
console.log(root2.get("a.2")); // -> 3
console.log(root2.get(["a", 2])); // -> 3

const root3 = new ptree({ a: { x: {} }, b: 3 });
console.log(root2.get("a.x.y")); // -> undefined

keys

Returns all keys (leaves) (including deep keys) of the object as an array.

const root = new ptree([
  {
    name: "Peter",
    age: 24
  },
  {
    name: "John",
    age: 37
  }
]);
console.log(root.keys()); // -> [ '0.name', '0.age', '1.name', '1.age' ]

set

Changes the value of the leaf at the given key

const root = new ptree([
  {
    name: "Peter",
    age: 24
  },
  {
    name: "John",
    age: 37
  }
]);
root.set("0.age", 77);
console.log(root.get("0.age")); // -> 77

If you try to set a value of an non-existing key, the object will be artificially extended.

const tree = new ptree({});
tree.set("a.b.c", "My Value");
console.log(tree.root); // -> { a: { b: { c: 'My Value' } } }

values

Like keys, but returns all leaf values. Essentially acts as an infinitely deep array/object flatten.

const root = new ptree([1, 2, 3, 4, [5, 6, 7, [8, 9, 10, { a: 11, x: 12 }]]]);
console.log(root.values()); // -> [ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12 ]

fromKeys

Returns all values at the given keys.

const root = new ptree([1, 2, 3, 4, [5, 6, 7, [8, 9, 10, { a: 11, x: 12 }]]]);
console.log(root.fromKeys(["4.3.3.a", "4.3.3.x"])); // -> [ 11, 12 ]

filterKeys

Returns all keys where a certain condition is met

const root = new ptree([1, 2, 3, 4, [5, 6, 7, [8, 9, 10, { a: 11, x: 12 }]]]);
console.log(root.filterKeys(v => v > 9)); // -> [ '4.3.2', '4.3.3.a', '4.3.3.x' ]

flatten

Returns a new flattened version of the original root.

const root = new ptree([1, { a: 2, x: 3 }]);
console.log(root.flatten()); // -> { '0': 1, '1.a': 2, '1.x': 3 }

equal

Compares two objects/arrays

const root = new ptree([1, { a: 2, x: 3 }]);

const other = [
  1,
  {
    a: 2,
    x: 3
  }
];

console.log(root.equal(other)); // -> true
console.log(root.equal({ a: 2, x: 3 })); // -> false

findKey

Find the first key where a certain condition is met.

const root = new ptree([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]);
console.log(root.findKey(v => v >= 5)); // -> 4

map

Maps all leaves to new values. Returns a new object/array.

const root = new ptree({ a: 5, b: { c: 7, d: 8, e: 9 } });
console.log(root.map(v => v * v)); // -> { a: 25, b: { c: 49, d: 64, e: 81 } }
console.log(root.map(v => v.toString())); // -> { a: '5', b: { c: '7', d: '8', e: '9' } }

copy

Deep-copies the root object/array.

const root = new ptree([1, 2, 3]);
console.log(root.copy()); // -> [ 1, 2, 3 ]

forEach / each

Executes a function for every key.

const root = new ptree([1, 2, 3]);
console.log(root.forEach(i => console.log(i)));
// prints:
// 1
// 2
// 3

includes

Checks if the object/array includes a nested property with a certain value.

new ptree({
  a: 2,
  b: 3
}).includes(3); // -> true

new ptree({
  a: 2,
  b: 3
}).includes(5); // -> false

Remove

Removes a property from an object

const obj = {
  a: {
    b: 2,
    c: {
      d: 3,
      e: 5,
      f: [1, 2, 3]
    }
  }
};

console.log(obj.a.b); // -> 2
new ptree(obj).remove("a.b");
console.log(obj.a.b); // -> undefined

Pick

Returns a new object only with the given keys

every/all

Same as Array.prototype.every, but deep.

some/any

Same as Array.prototype.some, but deep.

Merge

Same as Object.assign(), but deep. Second argument controls if existing keys should be overwritten (default: true, like Object.assign()).

Current Tags

  • 2.1.0                                ...           latest (7 months ago)

17 Versions

  • 2.1.0                                ...           7 months ago
  • 2.0.0                                ...           7 months ago
  • 1.5.2                                ...           8 months ago
  • 1.5.1                                ...           8 months ago
  • 1.5.0                                ...           8 months ago
  • 1.4.0                                ...           8 months ago
  • 1.3.1-b                                ...           9 months ago
  • 1.3.1                                ...           10 months ago
  • 1.3.0                                ...           a year ago
  • 1.2.1                                ...           a year ago
  • 1.2.0                                ...           a year ago
  • 1.1.3                                ...           a year ago
  • 1.1.2                                ...           a year ago
  • 1.1.1                                ...           a year ago
  • 1.1.0                                ...           a year ago
  • 1.0.1                                ...           a year ago
  • 1.0.0                                ...           a year ago
Maintainers (1)
Downloads
Today 0
This Week 0
This Month 0
Last Day 0
Last Week 0
Last Month 0
Dependencies (1)
Dev Dependencies (1)
Dependents (1)

Copyright 2014 - 2016 © taobao.org |