Refactor code-style

Author: wooorm

lib/index.js

@@ -19,11 +19,11 @@
  * @typedef {import('vfile').VFile} VFile
  *
  * @typedef {{
- *   parse(nodes: NlcstContent[]): NlcstRoot
+ *   parse(nodes: Array<NlcstContent>): NlcstRoot
  *   tokenizeSource(value: string): NlcstSource
  *   tokenizeWhiteSpace(value: string): NlcstWhiteSpace
- *   tokenizeParagraph(nodes: NlcstSentenceContent[]): NlcstParagraph
- *   tokenize(value: string): NlcstSentenceContent[]
+ *   tokenizeParagraph(nodes: Array<NlcstSentenceContent>): NlcstParagraph
+ *   tokenize(value: string): Array<NlcstSentenceContent>
  * }} ParserInstance
  * @typedef {new () => ParserInstance} ParserConstructor
  */
@@ -104,7 +104,7 @@ export function toNlcst(tree, file, Parser) {
   const doc = String(file)
   const loc = location(doc)
   const parser = 'parse' in Parser ? Parser : new Parser()
-  /** @type {NlcstContent[]} */
+  /** @type {Array<NlcstContent>} */
   const results = []
 
   find(tree)
@@ -136,7 +136,7 @@ export function toNlcst(tree, file, Parser) {
   }
 
   /**
-   * @param {HastContent[]} children
+   * @param {Array<HastContent>} children
    */
   function findAll(children) {
     let index = -1
@@ -147,11 +147,11 @@ export function toNlcst(tree, file, Parser) {
   }
 
   /**
-   * @param {HastElementContent[]} children
-   * @returns {HastElementContent[]}
+   * @param {Array<HastElementContent>} children
+   * @returns {Array<HastElementContent>}
    */
   function flattenAll(children) {
-    /** @type {HastElementContent[]} */
+    /** @type {Array<HastElementContent>} */
     const results = []
     let index = -1
 
@@ -176,10 +176,10 @@ export function toNlcst(tree, file, Parser) {
   }
 
   /**
-   * @param {HastElementContent|HastElementContent[]} node
+   * @param {HastElementContent|Array<HastElementContent>} node
    */
   function add(node) {
-    /** @type {NlcstSentenceContent[]|undefined} */
+    /** @type {Array<NlcstSentenceContent>|undefined} */
     const result = Array.isArray(node) ? all(node) : one(node)
 
     if (result && result.length > 0) {
@@ -188,7 +188,7 @@ export function toNlcst(tree, file, Parser) {
   }
 
   /**
-   * @param {HastElementContent[]} children
+   * @param {Array<HastElementContent>} children
    */
   function implicit(children) {
     let index = -1
@@ -225,10 +225,10 @@ export function toNlcst(tree, file, Parser) {
    * Convert `node` (hast) to nlcst.
    *
    * @param {HastContent} node
-   * @returns {NlcstSentenceContent[]|undefined}
+   * @returns {Array<NlcstSentenceContent>|undefined}
    */
   function one(node) {
-    /** @type {NlcstSentenceContent[]|undefined} */
+    /** @type {Array<NlcstSentenceContent>|undefined} */
     let replacement
     /** @type {boolean|undefined} */
     let change
@@ -259,11 +259,11 @@ export function toNlcst(tree, file, Parser) {
   /**
    * Convert all `children` (hast) to nlcst.
    *
-   * @param {HastContent[]} children
-   * @returns {NlcstSentenceContent[]}
+   * @param {Array<HastContent>} children
+   * @returns {Array<NlcstSentenceContent>}
    */
   function all(children) {
-    /** @type {NlcstSentenceContent[]} */
+    /** @type {Array<NlcstSentenceContent>} */
     const results = []
     let index = -1
 
@@ -281,7 +281,7 @@ export function toNlcst(tree, file, Parser) {
    * Note that nlcst nodes are concrete, meaning that their starting and ending
    * positions can be inferred from their content.
    *
-   * @template {NlcstContent[]} T
+   * @template {Array<NlcstContent>} T
    * @param {T} nodes
    * @param {ReturnType<location>} location
    * @param {number} offset