All checks were successful
Publish To Prod / deploy_and_publish (push) Successful in 35s
4.6 KiB
4.6 KiB
unist-util-find-after
unist utility to find a node after another node.
Install
npm:
npm install unist-util-find-after
Use
var u = require('unist-builder')
var findAfter = require('unist-util-find-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(findAfter(tree, 1, 'node'))
Yields:
{type: 'node', children: [{ type: 'leaf', value: 'leaf 5'}]}
API
findAfter(parent, node|index[, test])
Find the first child after index (or node) in parent, that passes
test.
Parameters
parent(Node) — Parent nodenode(Node) — Child ofparentindex(number, optional) — Index inparenttest(Function,string,Object,Array, optional) — Seeunist-util-is
Returns
Node? — Child of parent passing test.
Related
unist-util-visit— Recursively walk over nodesunist-util-visit-parents— Likevisit, but with a stack of parentsunist-util-filter— Create a new tree with all nodes that pass a testunist-util-map— Create a new tree with all nodes mapped by a given functionunist-util-flatmap— Create a new tree by mapping (to an array) with the provided function and then flatteningunist-util-find-before— Find a node before another nodeunist-util-find-all-after— Find all nodes after another nodeunist-util-find-all-before— Find all nodes before another nodeunist-util-find-all-between— Find all nodes between two nodesunist-util-remove— Remove nodes from a tree that pass a testunist-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, organisation, or community you agree to abide by its terms.