Refactor to move implementation to lib/

Author: wooorm

Diff for: index.js

@@ -1,74 +1 @@
-/**
- * @typedef {import('unist').Node} Node
- * @typedef {import('unist').Parent} Parent
- *
- * @typedef {string} Type
- * @typedef {Record<string, unknown>} Props
- * @typedef {import('unist-util-is').TestFunctionAnything} TestFunctionAnything
- */
-
-import {convert} from 'unist-util-is'
-
-/**
- * Find the first node in `parent` before another `node` or before an index,
- * that passes `test`.
-
- * @param parent
- *   Parent node.
- * @param index
- *   Child of `parent` or it’s index.
- * @param [test]
- *   `unist-util-is`-compatible test.
- * @returns
- *   Children of `parent` that pass `test`.
- */
-export const findAllBefore =
-  /**
-   * @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>>) => Array<T>) &
-   *  ((node: Parent, index: Node|number, test?: null|undefined|Type|Props|TestFunctionAnything|Array<Type|Props|TestFunctionAnything>) => Array<Node>)
-   * )}
-   */
-  (
-    /**
-     * @param {Parent} parent
-     * @param {Node|number} index
-     * @param {null|undefined|Type|Props|TestFunctionAnything|Array<Type|Props|TestFunctionAnything>} [test]
-     * @returns {Array<Node>}
-     */
-    function (parent, index, test) {
-      const is = convert(test)
-      /** @type {Array<Node>} */
-      const results = []
-      let offset = -1
-
-      if (!parent || !parent.type || !parent.children) {
-        throw new Error('Expected parent node')
-      }
-
-      if (typeof index === 'number') {
-        if (index < 0 || index === Number.POSITIVE_INFINITY) {
-          throw new Error('Expected positive finite number as index')
-        }
-      } else {
-        index = parent.children.indexOf(index)
-
-        if (index < 0) {
-          throw new Error('Expected child node or index')
-        }
-      }
-
-      // Performance.
-      if (index > parent.children.length) {
-        index = parent.children.length
-      }
-
-      while (++offset < index) {
-        if (is(parent.children[offset], offset, parent)) {
-          results.push(parent.children[offset])
-        }
-      }
-
-      return results
-    }
-  )
+export {findAllBefore} from './lib/index.js'

Diff for: lib/index.js

@@ -0,0 +1,74 @@
+/**
+ * @typedef {import('unist').Node} Node
+ * @typedef {import('unist').Parent} Parent
+ *
+ * @typedef {string} Type
+ * @typedef {Record<string, unknown>} Props
+ * @typedef {import('unist-util-is').TestFunctionAnything} TestFunctionAnything
+ */
+
+import {convert} from 'unist-util-is'
+
+/**
+ * Find the first node in `parent` before another `node` or before an index,
+ * that passes `test`.
+
+ * @param parent
+ *   Parent node.
+ * @param index
+ *   Child of `parent` or it’s index.
+ * @param [test]
+ *   `unist-util-is`-compatible test.
+ * @returns
+ *   Children of `parent` that pass `test`.
+ */
+export const findAllBefore =
+  /**
+   * @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>>) => Array<T>) &
+   *  ((node: Parent, index: Node|number, test?: null|undefined|Type|Props|TestFunctionAnything|Array<Type|Props|TestFunctionAnything>) => Array<Node>)
+   * )}
+   */
+  (
+    /**
+     * @param {Parent} parent
+     * @param {Node|number} index
+     * @param {null|undefined|Type|Props|TestFunctionAnything|Array<Type|Props|TestFunctionAnything>} [test]
+     * @returns {Array<Node>}
+     */
+    function (parent, index, test) {
+      const is = convert(test)
+      /** @type {Array<Node>} */
+      const results = []
+      let offset = -1
+
+      if (!parent || !parent.type || !parent.children) {
+        throw new Error('Expected parent node')
+      }
+
+      if (typeof index === 'number') {
+        if (index < 0 || index === Number.POSITIVE_INFINITY) {
+          throw new Error('Expected positive finite number as index')
+        }
+      } else {
+        index = parent.children.indexOf(index)
+
+        if (index < 0) {
+          throw new Error('Expected child node or index')
+        }
+      }
+
+      // Performance.
+      if (index > parent.children.length) {
+        index = parent.children.length
+      }
+
+      while (++offset < index) {
+        if (is(parent.children[offset], offset, parent)) {
+          results.push(parent.children[offset])
+        }
+      }
+
+      return results
+    }
+  )

Diff for: package.json

@@ -27,6 +27,7 @@
   "main": "index.js",
   "types": "index.d.ts",
   "files": [
+    "lib/",
     "index.d.ts",
     "index.js"
   ],