unist utility to find a node before another node.
- What is this?
- When should I use this?
- Install
- Use
- API
- Types
- Compatibility
- Related
- Contribute
- License
This is a tiny utility that you can use to find a node before another node or before an index in a parent.
This is super tiny. You can of course do it yourself. But this helps when integrating with the rest of unified and unist.
This package is ESM only. In Node.js (version 12.20+, 14.14+, 16.0+, 18.0+), install with npm:
npm install unist-util-find-before
In Deno with esm.sh
:
import {findBefore} from "https://esm.sh/unist-util-find-before@3"
In browsers with esm.sh
:
<script type="module">
import {findBefore} from "https://esm.sh/unist-util-find-before@3?bundle"
</script>
import {u} from 'unist-builder'
import {findBefore} from 'unist-util-find-before'
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')
])
const empty = tree.children[5]
console.log(findBefore(tree, empty, 'parent'))
Yields:
{type: 'parent', children: [{type: 'leaf', value: 'leaf 5'}]}
This package exports the identifier findBefore
.
There is no default export.
Find the first node in parent
(Parent
) before another node
(Node
) or before an index, that passes test
(Test
from
unist-util-is
).
Child of parent
that passes test
, if found (Node?
).
This package is fully typed with TypeScript.
It exports no additional types (types for the test are in unist-util-is
).
Projects maintained by the unified collective are compatible with all maintained versions of Node.js. As of now, that is Node.js 12.20+, 14.14+, 16.0+, and 18.0+. Our projects sometimes work with older versions, but this is not guaranteed.
unist-util-find-after
— find a node after 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-visit
— walk the treeunist-util-visit-parents
— walk the tree 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) by a given functionunist-util-remove
— remove nodes from a tree that pass a testunist-util-select
— select nodes with CSS-like selectors
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.