A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://github.com/syntax-tree/unist/commit/d249445f01f565f81e30369049863958815dd5a1 below:

Add references to xast · syntax-tree/unist@d249445 · GitHub

File tree Expand file treeCollapse file tree 1 file changed

+12

-7

lines changed

Filter options

Expand file treeCollapse file tree 1 file changed

+12

-7

lines changed Original file line number Diff line number Diff line change

@@ -19,9 +19,9 @@ The latest released version is [`2.0.0`][release].

19 19

* [Syntax tree](#syntax-tree)

20 20

* [Where this specification fits](#where-this-specification-fits)

21 21

* [Nodes](#nodes)

22 -

* [Node](#node)

23 -

* [Parent](#parent)

24 -

* [Literal](#literal)

22 +

* [`Node`](#node)

23 +

* [`Parent`](#parent)

24 +

* [`Literal`](#literal)

25 25

* [Glossary](#glossary)

26 26

* [Tree traversal](#tree-traversal)

27 27

* [Utilities](#utilities)

@@ -59,7 +59,8 @@ unist is not intended to be self-sufficient.

59 59

Instead, it is expected that other specifications implement unist and extend it

60 60

to express language specific nodes.

61 61

For example, see projects such as [**mdast**][mdast] (for Markdown),

62 -

[**hast**][hast] (for HTML), and [**nlcst**][nlcst] (for natural language).

62 +

[**hast**][hast] (for HTML), [**xast**][xast] (for XML), and [**nlcst**][nlcst]

63 +

(for natural language).

63 64 64 65

unist relates to [JSON][] in that compliant syntax trees can be expressed

65 66

completely in JSON.

@@ -426,6 +427,7 @@ unist:

426 427 427 428

* [mdast utilities](https://github.com/syntax-tree/mdast#list-of-utilities)

428 429

* [hast utilities](https://github.com/syntax-tree/hast#list-of-utilities)

430 +

* [xast utilities](https://github.com/syntax-tree/xast#list-of-utilities)

429 431

* [nlcst utilities](https://github.com/syntax-tree/nlcst#list-of-utilities)

430 432 431 433

### List of Utilities

@@ -447,7 +449,8 @@ unist:

447 449

* [`unist-util-find-before`](https://github.com/syntax-tree/unist-util-find-before)

448 450

— Find a node before another node

449 451

* [`unist-util-flat-filter`](https://github.com/unicorn-utterances/unist-util-flat-filter)

450 -

— Create a new tree with all nodes that pass the given function without references to the parent

452 +

— Create a new tree with all nodes that pass the given function without

453 +

references to the parent

451 454

* [`unist-util-flatmap`](https://gitlab.com/staltz/unist-util-flatmap)

452 455

— Create a new tree by expanding a node into many

453 456

* [`unist-util-generated`](https://github.com/syntax-tree/unist-util-generated)

@@ -518,8 +521,8 @@ ways to get started.

518 521

See [`support.md`][support] for ways to get help.

519 522

Ideas for new utilities and tools can be posted in [`syntax-tree/ideas`][ideas].

520 523 521 -

A curated list of awesome syntax-tree, unist, hast, mdast, and nlcst resources

522 -

can be found in [awesome syntax-tree][awesome].

524 +

A curated list of awesome syntax-tree, unist, hast, xast, mdast, and nlcst

525 +

resources can be found in [awesome syntax-tree][awesome].

523 526 524 527

This project has a [Code of Conduct][coc].

525 528

By interacting with this repository, organisation, or community you agree to

@@ -659,6 +662,8 @@ for contributing to unist and related projects!

659 662 660 663

[hast]: https://github.com/syntax-tree/hast

661 664 665 +

[xast]: https://github.com/syntax-tree/xast

666 + 662 667

[nlcst]: https://github.com/syntax-tree/nlcst

663 668 664 669

[mdast]: https://github.com/syntax-tree/mdast

You can’t perform that action at this time.


RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4