Refactor code-style

Author: wooorm

index.js

@@ -9,7 +9,7 @@
 
 import {convert} from 'unist-util-is'
 
-export var findAfter =
+export const findAfter =
   /**
    * @type {(
    *  (<T extends Node>(node: Parent, index: Node|number, test: T['type']|Partial<T>|import('unist-util-is').TestFunctionPredicate<T>|Array.<T['type']|Partial<T>|import('unist-util-is').TestFunctionPredicate<T>>) => T|null) &
@@ -24,7 +24,7 @@ export var findAfter =
      * @returns {Node|null}
      */
     function (parent, index, test) {
-      var is = convert(test)
+      const is = convert(test)
 
       if (!parent || !parent.type || !parent.children) {
         throw new Error('Expected parent node')

package.json

@@ -64,12 +64,7 @@
     "trailingComma": "none"
   },
   "xo": {
-    "prettier": true,
-    "rules": {
-      "import/no-mutable-exports": "off",
-      "no-var": "off",
-      "prefer-arrow-callback": "off"
-    }
+    "prettier": true
   },
   "remarkConfig": {
     "plugins": [

readme.md

@@ -27,7 +27,7 @@ npm install unist-util-find-after
 import {u} from 'unist-builder'
 import {findAfter} from 'unist-util-find-after'
 
-var tree = u('tree', [
+const tree = u('tree', [
   u('leaf', 'leaf 1'),
   u('node', [u('leaf', 'leaf 2'), u('leaf', 'leaf 3')]),
   u('leaf', 'leaf 4'),

test.js

@@ -7,15 +7,15 @@ import test from 'tape'
 import remark from 'remark'
 import {findAfter} from './index.js'
 
-var tree = remark().parse('Some _emphasis_, **importance**, and `code`.')
+const tree = remark().parse('Some _emphasis_, **importance**, and `code`.')
 /** @type {Parent} */
 // @ts-expect-error fine.
-var paragraph = tree.children[0]
-var children = paragraph.children
+const paragraph = tree.children[0]
+const children = paragraph.children
 
-test('unist-util-find-after', function (t) {
+test('unist-util-find-after', (t) => {
   t.throws(
-    function () {
+    () => {
       // @ts-expect-error runtime.
       findAfter()
     },
@@ -24,7 +24,7 @@ test('unist-util-find-after', function (t) {
   )
 
   t.throws(
-    function () {
+    () => {
       // @ts-expect-error runtime.
       findAfter({type: 'foo'})
     },
@@ -33,7 +33,7 @@ test('unist-util-find-after', function (t) {
   )
 
   t.throws(
-    function () {
+    () => {
       // @ts-expect-error runtime.
       findAfter({type: 'foo', children: []})
     },
@@ -42,23 +42,23 @@ test('unist-util-find-after', function (t) {
   )
 
   t.throws(
-    function () {
+    () => {
       findAfter({type: 'foo', children: []}, -1)
     },
     /Expected positive finite number as index/,
     'should fail without index (#2)'
   )
 
   t.throws(
-    function () {
+    () => {
       findAfter({type: 'foo', children: []}, {type: 'bar'})
     },
     /Expected child node or index/,
     'should fail without index (#3)'
   )
 
   t.throws(
-    function () {
+    () => {
       findAfter(
         {type: 'foo', children: [{type: 'bar'}, {type: 'baz'}]},
         0,
@@ -71,7 +71,7 @@ test('unist-util-find-after', function (t) {
   )
 
   t.throws(
-    function () {
+    () => {
       findAfter(
         {type: 'foo', children: [{type: 'bar'}, {type: 'baz'}]},
         0,