Refactor code-style

Author: wooorm

index.js

@@ -9,7 +9,7 @@
 
 import {convert} from 'unist-util-is'
 
-export var findBefore =
+export const findBefore =
   /**
    * @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 findBefore =
      * @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-before
 import {u} from 'unist-builder'
 import {findBefore} from 'unist-util-find-before'
 
-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'),
@@ -37,7 +37,7 @@ var tree = u('tree', [
   u('leaf', 'leaf 7')
 ])
 
-var empty = tree.children[5]
+const empty = tree.children[5]
 
 console.log(findBefore(tree, empty, 'node'))
 ```

test.js

@@ -8,21 +8,21 @@ import test from 'tape'
 import remark from 'remark'
 import {findBefore} from './index.js'
 
-test('unist-util-find-before', function (t) {
+test('unist-util-find-before', (t) => {
   /** @type {Root} */
   // @ts-expect-error: fine.
-  var tree = remark().parse('Some *emphasis*, **importance**, and `code`.')
+  const tree = remark().parse('Some *emphasis*, **importance**, and `code`.')
 
   assert(tree.type === 'root')
-  var paragraph = tree.children[0]
+  const paragraph = tree.children[0]
   assert(paragraph.type === 'paragraph')
-  var head = paragraph.children[0]
+  const head = paragraph.children[0]
   assert(head.type === 'text')
-  var next = paragraph.children[1]
+  const next = paragraph.children[1]
   assert(next.type === 'emphasis')
 
   t.throws(
-    function () {
+    () => {
       // @ts-ignore runtime
       findBefore()
     },
@@ -31,7 +31,7 @@ test('unist-util-find-before', function (t) {
   )
 
   t.throws(
-    function () {
+    () => {
       // @ts-ignore runtime
       findBefore({type: 'foo'})
     },
@@ -40,7 +40,7 @@ test('unist-util-find-before', function (t) {
   )
 
   t.throws(
-    function () {
+    () => {
       // @ts-ignore runtime
       findBefore({type: 'foo', children: []})
     },
@@ -49,23 +49,23 @@ test('unist-util-find-before', function (t) {
   )
 
   t.throws(
-    function () {
+    () => {
       findBefore({type: 'foo', children: []}, -1)
     },
     /Expected positive finite number as index/,
     'should fail without index (#2)'
   )
 
   t.throws(
-    function () {
+    () => {
       findBefore({type: 'foo', children: []}, {type: 'bar'})
     },
     /Expected child node or index/,
     'should fail without index (#3)'
   )
 
   t.throws(
-    function () {
+    () => {
       // @ts-ignore runtime
       findBefore({type: 'foo', children: [{type: 'bar'}]}, 1, false)
     },
@@ -74,7 +74,7 @@ test('unist-util-find-before', function (t) {
   )
 
   t.throws(
-    function () {
+    () => {
       // @ts-ignore runtime
       findBefore({type: 'foo', children: [{type: 'bar'}]}, 1, true)
     },