Brunobkr/llama.cpp_AlgMor24_github

1# unist-util-find-after2 3[![Build][build-badge]][build]4[![Coverage][coverage-badge]][coverage]5[![Downloads][downloads-badge]][downloads]6[![Size][size-badge]][size]7[![Sponsors][sponsors-badge]][collective]8[![Backers][backers-badge]][collective]9[![Chat][chat-badge]][chat]10 11[unist][] utility to find a node after another node.12 13## Contents14 15*   [What is this?](#what-is-this)16*   [When should I use this?](#when-should-i-use-this)17*   [Install](#install)18*   [Use](#use)19*   [API](#api)20    *   [`findAfter(parent, node|index[, test])`](#findafterparent-nodeindex-test)21*   [Types](#types)22*   [Compatibility](#compatibility)23*   [Related](#related)24*   [Contribute](#contribute)25*   [License](#license)26 27## What is this?28 29This is a tiny utility that you can use to find a node after another node or30after an index in a parent.31 32## When should I use this?33 34This is super tiny.35You can of course do it yourself.36But this helps when integrating with the rest of unified and unist.37 38## Install39 40This package is [ESM only][esm].41In Node.js (version 16+), install with [npm][]:42 43```sh44npm install unist-util-find-after45```46 47In Deno with [`esm.sh`][esmsh]:48 49```js50import {findAfter} from 'https://esm.sh/unist-util-find-after@5'51```52 53In browsers with [`esm.sh`][esmsh]:54 55```html56<script type="module">57  import {findAfter} from 'https://esm.sh/unist-util-find-after@5?bundle'58</script>59```60 61## Use62 63```js64import {u} from 'unist-builder'65import {findAfter} from 'unist-util-find-after'66 67const tree = u('tree', [68  u('leaf', 'leaf 1'),69  u('parent', [u('leaf', 'leaf 2'), u('leaf', 'leaf 3')]),70  u('leaf', 'leaf 4'),71  u('parent', [u('leaf', 'leaf 5')]),72  u('leaf', 'leaf 6'),73  u('empty'),74  u('leaf', 'leaf 7')75])76 77console.log(findAfter(tree, 1, 'parent'))78```79 80Yields:81 82```js83{type: 'parent', children: [{ type: 'leaf', value: 'leaf 5'}]}84```85 86## API87 88This package exports the identifier [`findAfter`][api-findafter].89There is no default export.90 91### `findAfter(parent, node|index[, test])`92 93Find the first node in `parent` after another `node` or after an index,94that passes `test`.95 96###### Parameters97 98*   `parent` ([`Node`][node])99    — parent node100*   `index` (`number`)101    — index of child in `parent`102*   `child` ([`Node`][node])103    — child in `parent`104*   `test` ([`Test`][test])105    — `unist-util-is`-compatible test106 107###### Returns108 109Child of `parent` ([`Node`][node]) or `undefined`.110 111## Types112 113This package is fully typed with [TypeScript][].114It exports no additional types (types for the test are in `unist-util-is`).115 116## Compatibility117 118Projects maintained by the unified collective are compatible with maintained119versions of Node.js.120 121When we cut a new major release, we drop support for unmaintained versions of122Node.123This means we try to keep the current release line, `unist-util-find-after@^5`,124compatible with Node.js 16.125 126## Related127 128*   [`unist-util-visit`](https://github.com/syntax-tree/unist-util-visit)129    — walk the tree130*   [`unist-util-visit-parents`](https://github.com/syntax-tree/unist-util-visit-parents)131    — walk the tree with a stack of parents132*   [`unist-util-filter`](https://github.com/syntax-tree/unist-util-filter)133    — create a new tree with all nodes that pass a test134*   [`unist-util-map`](https://github.com/syntax-tree/unist-util-map)135    — create a new tree with all nodes mapped by a given function136*   [`unist-util-flatmap`](https://gitlab.com/staltz/unist-util-flatmap)137    — create a new tree by mapping (to an array) with the provided function and138    then flattening139*   [`unist-util-find-before`](https://github.com/syntax-tree/unist-util-find-before)140    — find a node before another node141*   [`unist-util-find-all-after`](https://github.com/syntax-tree/unist-util-find-all-after)142    — find all nodes after another node143*   [`unist-util-find-all-before`](https://github.com/syntax-tree/unist-util-find-all-before)144    — find all nodes before another node145*   [`unist-util-find-all-between`](https://github.com/mrzmmr/unist-util-find-all-between)146    — find all nodes between two nodes147*   [`unist-util-remove`](https://github.com/syntax-tree/unist-util-remove)148    — remove nodes from a tree that pass a test149*   [`unist-util-select`](https://github.com/syntax-tree/unist-util-select)150    — select nodes with CSS-like selectors151 152## Contribute153 154See [`contributing.md`][contributing] in [`syntax-tree/.github`][health] for155ways to get started.156See [`support.md`][support] for ways to get help.157 158This project has a [Code of Conduct][coc].159By interacting with this repository, organisation, or community you agree to160abide by its terms.161 162## License163 164[MIT][license] © [Titus Wormer][author]165 166<!-- Definitions -->167 168[build-badge]: https://github.com/syntax-tree/unist-util-find-after/workflows/main/badge.svg169 170[build]: https://github.com/syntax-tree/unist-util-find-after/actions171 172[coverage-badge]: https://img.shields.io/codecov/c/github/syntax-tree/unist-util-find-after.svg173 174[coverage]: https://codecov.io/github/syntax-tree/unist-util-find-after175 176[downloads-badge]: https://img.shields.io/npm/dm/unist-util-find-after.svg177 178[downloads]: https://www.npmjs.com/package/unist-util-find-after179 180[size-badge]: https://img.shields.io/badge/dynamic/json?label=minzipped%20size&query=$.size.compressedSize&url=https://deno.bundlejs.com/?q=unist-util-find-after181 182[size]: https://bundlejs.com/?q=unist-util-find-after183 184[sponsors-badge]: https://opencollective.com/unified/sponsors/badge.svg185 186[backers-badge]: https://opencollective.com/unified/backers/badge.svg187 188[collective]: https://opencollective.com/unified189 190[chat-badge]: https://img.shields.io/badge/chat-discussions-success.svg191 192[chat]: https://github.com/syntax-tree/unist/discussions193 194[npm]: https://docs.npmjs.com/cli/install195 196[esm]: https://gist.github.com/sindresorhus/a39789f98801d908bbc7ff3ecc99d99c197 198[esmsh]: https://esm.sh199 200[typescript]: https://www.typescriptlang.org201 202[license]: license203 204[author]: https://wooorm.com205 206[health]: https://github.com/syntax-tree/.github207 208[contributing]: https://github.com/syntax-tree/.github/blob/main/contributing.md209 210[support]: https://github.com/syntax-tree/.github/blob/main/support.md211 212[coc]: https://github.com/syntax-tree/.github/blob/main/code-of-conduct.md213 214[unist]: https://github.com/syntax-tree/unist215 216[node]: https://github.com/syntax-tree/unist#node217 218[test]: https://github.com/syntax-tree/unist-util-is#test219 220[api-findafter]: #findafterparent-nodeindex-test221