Refactor prose

Author: wooorm

package.json

@@ -1,15 +1,16 @@
 {
   "name": "unist-util-find-after",
   "version": "2.0.4",
-  "description": "Utility to find a node after another node",
+  "description": "unist utility to find a node after another node",
   "license": "MIT",
   "keywords": [
     "unist",
+    "unist-util",
+    "util",
+    "utility",
     "node",
     "find",
-    "after",
-    "util",
-    "utility"
+    "after"
   ],
   "repository": "syntax-tree/unist-util-find-after",
   "bugs": "https://github.com/syntax-tree/unist-util-find-after/issues",

readme.md

@@ -10,15 +10,15 @@
 
 [**unist**][unist] utility to find a node after another node.
 
-## Installation
+## Install
 
 [npm][]:
 
 ```sh
 npm install unist-util-find-after
 ```
 
-## Usage
+## Use
 
 ```js
 var u = require('unist-builder')
@@ -40,7 +40,7 @@ console.log(findAfter(tree, 1, 'node'))
 Yields:
 
 ```js
-{ type: 'node', children: [ { type: 'leaf', value: 'leaf 5' } ] }
+{type: 'node', children: [{ type: 'leaf', value: 'leaf 5'}]}
 ```
 
 ## API
@@ -64,6 +64,17 @@ Find the first [child][] after `index` (or `node`) in `parent`, that passes
 
 ## Related
 
+*   [`unist-util-visit`](https://github.com/syntax-tree/unist-util-visit)
+    — Recursively walk over nodes
+*   [`unist-util-visit-parents`](https://github.com/syntax-tree/unist-util-visit-parents)
+    — Like `visit`, but with a stack of parents
+*   [`unist-util-filter`](https://github.com/eush77/unist-util-filter)
+    — Create a new tree with all nodes that pass a test
+*   [`unist-util-map`](https://github.com/syntax-tree/unist-util-map)
+    — Create a new tree with all nodes mapped by a given function
+*   [`unist-util-flatmap`](https://gitlab.com/staltz/unist-util-flatmap)
+    — Create a new tree by mapping (to an array) with the provided function and
+    then flattening
 *   [`unist-util-find-before`](https://github.com/syntax-tree/unist-util-find-before)
     — Find a node before another node
 *   [`unist-util-find-all-after`](https://github.com/syntax-tree/unist-util-find-all-after)
@@ -72,8 +83,10 @@ Find the first [child][] after `index` (or `node`) in `parent`, that passes
     — Find all nodes before another node
 *   [`unist-util-find-all-between`](https://github.com/mrzmmr/unist-util-find-all-between)
     — Find all nodes between two nodes
-*   [`unist-util-find`](https://github.com/blahah/unist-util-find)
-    — Find nodes matching a predicate
+*   [`unist-util-remove`](https://github.com/eush77/unist-util-remove)
+    — Remove nodes from a tree that pass a test
+*   [`unist-util-select`](https://github.com/eush77/unist-util-select)
+    — Select nodes with CSS-like selectors
 
 ## Contribute
 
@@ -113,7 +126,7 @@ abide by its terms.
 
 [collective]: https://opencollective.com/unified
 
-[chat-badge]: https://img.shields.io/badge/join%20the%20community-on%20spectrum-7b16ff.svg
+[chat-badge]: https://img.shields.io/badge/chat-spectrum-7b16ff.svg
 
 [chat]: https://spectrum.chat/unified/syntax-tree