Refactor prose

Author: wooorm

package.json

@@ -1,13 +1,15 @@
 {
   "name": "unist-util-index",
   "version": "1.1.1",
-  "description": "Index Unist nodes by property or computed key",
+  "description": "unist utility to index property values or computed keys to nodes",
   "license": "MIT",
   "keywords": [
-    "ast",
+    "unist",
+    "unist-util",
+    "util",
+    "utility",
     "computed",
     "filter",
-    "function",
     "index",
     "indexing",
     "key",
@@ -17,8 +19,7 @@
     "property",
     "subset",
     "tree",
-    "unist",
-    "util"
+    "ast"
   ],
   "repository": "syntax-tree/unist-util-index",
   "bugs": "https://github.com/syntax-tree/unist-util-index/issues",

readme.md

@@ -19,7 +19,7 @@ computed keys back to nodes.
 npm install unist-util-index
 ```
 
-## Usage
+## Use
 
 ```js
 var fs = require('fs')
@@ -52,11 +52,11 @@ Yields:
 
 ### `Index([tree[, test], ]prop|keyFn)`
 
-Create an index data structure that maps keys (calculated by `keyFn` function
-or the values at `prop` in each node) to a list of nodes.
+Create an index data structure that maps keys (calculated by `keyFn` function or
+the values at `prop` in each node) to a list of nodes.
 
-If `tree` is given, the index is initialised with all nodes, optionally
-filtered by `test`.
+If `tree` is given, the index is initialized with all nodes, optionally filtered
+by `test`.
 
 ###### Signatures