|
|
2 年之前 | |
|---|---|---|
| .. | ||
| index.d.ts | 2 年之前 | |
| index.js | 2 年之前 | |
| license | 2 年之前 | |
| package.json | 2 年之前 | |
| readme.md | 2 年之前 | |
unist utility to find nodes after another node.
npm:
npm install unist-util-find-all-after
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'}
]
findAllAfter(parent, node|index[, test])Find all children after index (or node) in parent that pass test (when
given).
parent (Node) — Parent nodenode (Node) — Child of parentindex (number, optional) — Index in parenttest (Function, string, Object, Array, optional)
— See unist-util-isArray.<Node> — Children of parent passing test.
unist-util-visit
— Recursively walk over nodesunist-util-visit-parents
— Like visit, 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 given functionunist-util-find-after
— Find a node after another nodeunist-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 selectorsSee 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.