unist-util-find-all-after

unist utility to find nodes after another node.

Install

npm:

npm install unist-util-find-all-after

Use

var u = require('unist-builder')
var findAllAfter = require('unist-util-find-all-after')

var tree = u('tree', [
  u('leaf', 'leaf 1'),
  u('node', [u('leaf', 'leaf 2'), u('leaf', 'leaf 3')]),
  u('leaf', 'leaf 4'),
  u('node', [u('leaf', 'leaf 5')]),
  u('leaf', 'leaf 6'),
  u('void'),
  u('leaf', 'leaf 7')
])

console.log(findAllAfter(tree, 1, 'leaf'))

Yields:

[
  {type: 'leaf', value: 'leaf 4'},
  {type: 'leaf', value: 'leaf 6'},
  {type: 'leaf', value: 'leaf 7'}
]

API

findAllAfter(parent, node|index[, test])

Find all children after index (or node) in parent that pass test (when given).

Parameters

• parent (Node) — Parent node
• node (Node) — Child of parent
• index (number, optional) — Index in parent
• test (Function, string, Object, Array, optional) — See unist-util-is

Returns

Array.<Node> — Children of parent passing test.

Related

• unist-util-visit — Recursively walk over nodes
• unist-util-visit-parents — Like visit, but with a stack of parents
• unist-util-filter — Create a new tree with all nodes that pass a test
• unist-util-map — Create a new tree with all nodes mapped by a given function
• unist-util-flatmap — Create a new tree by mapping (to an array) with the given function
• unist-util-find-after — Find a node after another node
• unist-util-find-before — Find a node before another node
• unist-util-find-all-after — Find all nodes after another node
• unist-util-find-all-before — Find all nodes before another node
• unist-util-find-all-between — Find all nodes between two nodes
• unist-util-remove — Remove nodes from a tree that pass a test
• unist-util-select — Select nodes with CSS-like selectors

Contribute

See contributing.md in syntax-tree/.github for ways to get started. See support.md for ways to get help.

This project has a code of conduct. By interacting with this repository, organization, or community you agree to abide by its terms.

License

MIT © Titus Wormer