unist-util-find-after
!Buildbuild-badgebuild
!Coveragecoverage-badgecoverage
!Downloadsdownloads-badgedownloads
!Sizesize-badgesize
!Sponsorssponsors-badgecollective
!Backersbackers-badgecollective
!Chatchat-badgechatunist utility to find a node after another node.
Contents
* [`findAfter(parent, node|index[, test])`](#findafterparent-nodeindex-test)
What is this?
This is a tiny utility that you can use to find a node after another node or after an index in a parent.When should I use this?
This is super tiny. You can of course do it yourself. But this helps when integrating with the rest of unified and unist.Install
This package is ESM onlyesm. In Node.js (version 14.14+ and 16.0+), install with npm:npm install unist-util-find-after
In Deno with
esm.sh
esmsh:import {findAfter} from 'https://esm.sh/unist-util-find-after@4'
In browsers with
esm.sh
esmsh:<script type="module">
import {findAfter} from 'https://esm.sh/unist-util-find-after@4?bundle'
</script>
Use
import {u} from 'unist-builder'
import {findAfter} from 'unist-util-find-after'
const tree = u('tree', [
u('leaf', 'leaf 1'),
u('parent', [u('leaf', 'leaf 2'), u('leaf', 'leaf 3')]),
u('leaf', 'leaf 4'),
u('parent', [u('leaf', 'leaf 5')]),
u('leaf', 'leaf 6'),
u('empty'),
u('leaf', 'leaf 7')
])
console.log(findAfter(tree, 1, 'parent'))
Yields:
{type: 'parent', children: [{ type: 'leaf', value: 'leaf 5'}]}
API
This package exports the identifierfindAfter
api-findafter.
There is no default export.findAfter(parent, node|index[, test])
Find the first node in parent
after another node
or after an index,
that passes test
.Parameters
— parent node
index
(number
)
— index of child in `parent`
— child in `parent`
— `unist-util-is`-compatible test
Returns
Child ofparent
(Node
node) or null
.Types
This package is fully typed with TypeScript. It exports no additional types (types for the test are inunist-util-is
).Compatibility
Projects maintained by the unified collective are compatible with all maintained versions of Node.js. As of now, that is Node.js 14.14+ and 16.0+. Our projects sometimes work with older versions, but this is not guaranteed.Related
— walk the tree
— walk the tree 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 provided function and
then flattening
— 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
Seecontributing.md
contributing in syntax-tree/.github
health for
ways to get started.
See support.md
support for ways to get help.This project has a Code of Conductcoc. By interacting with this repository, organisation, or community you agree to abide by its terms.