unist-util-find-all-after

unist utility to find nodes after another node

Downloads in past

Stats

StarsIssuesVersionUpdatedCreatedSize
unist-util-find-all-after
604.0.02 years ago7 years agoMinified + gzip package size for unist-util-find-all-after in KB

Readme

unist-util-find-all-after
!Buildbuild-badgebuild !Coveragecoverage-badgecoverage !Downloadsdownloads-badgedownloads !Sponsorssponsors-badgecollective !Backersbackers-badgecollective !Chatchat-badgechat !Sizesize-badgesize
unistunist utility to find nodes after another node.

Install

This package is ESM only: Node 12+ is needed to use it and it must be imported instead of required.
npm install unist-util-find-all-after
## Use

```js
import {u} from 'unist-builder'
import {findAllAfter} from '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

This package exports the following identifiers: findAllAfter. There is no default export.

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

Find all children after index (or node) in parent that pass test (when given).
Parameters
  • parent (Nodenode) — Parent node
  • node (Nodenode) — Child of parent
  • index (number, optional) — Index in parent
  • test (Function, string, Object, Array, optional)
— See [`unist-util-is`][is]
Returns
Array.<Node>nodeChildren of parent passing test.

Related

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

Contribute

See contributing.md in syntax-tree/.githubcontributing for ways to get started. See support.mdsupport for ways to get help.
This project has a code of conductcoc. By interacting with this repository, organization, or community you agree to abide by its terms.

License

MITlicense © Titus Wormerauthor