More spacing fixes.

Author: dpvc

mathjax3-ts/core/MmlTree/MmlNodes/mo.ts

@@ -143,7 +143,7 @@ export class MmlMo extends AbstractMmlTokenNode {
     }
 
     /**
-     * @return{boolean}  True is this mo is an accent in an munderover construction
+     * @return {boolean}  True is this mo is an accent in an munderover construction
      */
     get isAccent() {
         let accent = false;
@@ -305,8 +305,8 @@ export class MmlMo extends AbstractMmlTokenNode {
     }
 
     /**
-     * @param{string[]} forms     The three forms in the default order they are to be tested
-     * @return{string[]}          The forms in the new order, if there is an explicit form attribute
+     * @param {string[]} forms     The three forms in the default order they are to be tested
+     * @return {string[]}          The forms in the new order, if there is an explicit form attribute
      */
     protected handleExplicitForm(forms: string[]) {
         if (this.attributes.isSet('form')) {

mathjax3-ts/input/tex/FindTeX.ts

@@ -136,9 +136,9 @@ export class FindTeX<N, T, D> extends AbstractFindMath<N, T, D> {
     /*
      * Add the needed patterns for a pair of delimiters
      *
-     * @param{string[]} starts  Array of starting delimiter strings
-     * @param{Delims} delims    Array of delimiter strings, as [start, end]
-     * @param{boolean} display  True if the delimiters are for display mode
+     * @param {string[]} starts  Array of starting delimiter strings
+     * @param {Delims} delims    Array of delimiter strings, as [start, end]
+     * @param {boolean} display  True if the delimiters are for display mode
      */
     protected addPattern(starts: string[], delims: Delims, display: boolean) {
         let [open, close] = delims;
@@ -149,8 +149,8 @@ export class FindTeX<N, T, D> extends AbstractFindMath<N, T, D> {
     /*
      * Create the pattern for a close delimiter
      *
-     * @param{string} end  The end delimiter text
-     * @return{RegExp}     The regular expression for the end delimiter
+     * @param {string} end  The end delimiter text
+     * @return {RegExp}     The regular expression for the end delimiter
      */
     protected endPattern(end: string) {
         return new RegExp(quotePattern(end) + '|\\\\(?:[a-zA-Z]|.)|[{}]', 'g');
@@ -161,11 +161,11 @@ export class FindTeX<N, T, D> extends AbstractFindMath<N, T, D> {
      *   skipping braced groups, and control sequences that aren't
      *   the close delimiter.
      *
-     * @param{string} text            The string being searched for the end delimiter
-     * @param{number} n               The index of the string being searched
-     * @param{RegExpExecArray} start  The result array from the start-delimiter search
-     * @param{EndItem} end            The end-delimiter data corresponding to the start delimiter
-     * @return{ProtoItem}             The proto math item for the math, if found
+     * @param {string} text            The string being searched for the end delimiter
+     * @param {number} n               The index of the string being searched
+     * @param {RegExpExecArray} start  The result array from the start-delimiter search
+     * @param {EndItem} end            The end-delimiter data corresponding to the start delimiter
+     * @return {ProtoItem}             The proto math item for the math, if found
      */
     protected findEnd(text: string, n: number, start: RegExpExecArray, end: EndItem) {
         let [close, display, pattern] = end;
@@ -188,9 +188,9 @@ export class FindTeX<N, T, D> extends AbstractFindMath<N, T, D> {
      * Search a string for math delimited by one of the delimiter pairs,
      *   or by \begin{env}...\end{env}, or \eqref{...}, \ref{...}, \\, or \$.
      *
-     * @param{ProtoItem[]} math  The array of proto math items located so far
-     * @param{number} n          The index of the string being searched
-     * @param{string} text       The string being searched
+     * @param {ProtoItem[]} math  The array of proto math items located so far
+     * @param {number} n          The index of the string being searched
+     * @param {string} text       The string being searched
      */
     protected findMathInString(math: ProtoItem<N, T>[], n: number, text: string) {
         let start, match;

mathjax3-ts/util/AsyncLoad-disabled.ts

@@ -22,8 +22,8 @@
  */
 
 /**
- * @param{string} name  The name of the file to load
- * @return{Promise}     The promise that always fails (indicating file not loaded)
+ * @param {string} name  The name of the file to load
+ * @return {Promise}     The promise that always fails (indicating file not loaded)
  */
 export function asyncLoad(name: string) {
     return new Promise((ok, fail) => fail());

mathjax3-ts/util/AsyncLoad.ts

@@ -28,8 +28,8 @@ declare var __dirname: string;
 /**
  * Load a file asynchronously, either using System.js, or node's require().
  *
- * @param{string} name  The name of the file to load
- * @return{Promise}     The promise that is satisfied when the file is loaded
+ * @param {string} name  The name of the file to load
+ * @return {Promise}     The promise that is satisfied when the file is loaded
  */
 export function asyncLoad(name: string) {
     if (name.charAt(0) === '.') {

mathjax3-ts/util/Entities.ts

@@ -508,8 +508,8 @@ function replace(match: string, entity: string) {
 }
 
 /**
- * @param{string} entity  The character code point as a string
- * @return{srting}        The character(s) with the given code point
+ * @param {string} entity  The character code point as a string
+ * @return {srting}        The character(s) with the given code point
  */
 export function numeric(entity: string) {
     let n = (entity.charAt(0) === 'x' ?

mathjax3-ts/util/FunctionList.ts

@@ -42,8 +42,8 @@ export class FunctionList extends PrioritizedList<Function> {
      *   passing the given data to the functions.  If any return
      *   false, the list is terminated.
      *
-     * @param{any[]} data  The array of arguments to pass to the functions
-     * @return{boolean}    False if any function stopped the list by
+     * @param {any[]} data  The array of arguments to pass to the functions
+     * @return {boolean}    False if any function stopped the list by
      *                       returning false, true otherwise
      */
     public execute(...data: any[]) {
@@ -67,8 +67,8 @@ export class FunctionList extends PrioritizedList<Function> {
      *   succeeds, but passes false as its argument.  Otherwise it succeeds
      *   and passes true.
      *
-     * @param{any[]} data  The array of arguments to pass to the functions
-     * @return{Promise}    The promise that is satisfied when the function
+     * @param {any[]} data  The array of arguments to pass to the functions
+     * @return {Promise}    The promise that is satisfied when the function
      *                       list completes (with argument true or false
      *                       depending on whether some function returned
      *                       false or not).

mathjax3-ts/util/LinkedList.ts

@@ -57,7 +57,7 @@ export class ListItem<DataClass> {
     public prev: ListItem<DataClass> = null;
 
     /**
-     * @param{any} data  The data to be stored in the list item
+     * @param {any} data  The data to be stored in the list item
      * @constructor
      */
     constructor (data: any = null) {
@@ -88,7 +88,7 @@ export class LinkedList<DataClass> {
      *    item in the list, without having to handle special
      *    cases.
      *
-     * @param{DataClass[]} args  The data items that form the initial list
+     * @param {DataClass[]} args  The data items that form the initial list
      * @constructor
      */
     constructor(...args: DataClass[]) {
@@ -104,7 +104,7 @@ export class LinkedList<DataClass> {
      *
      * so use toArray() to convert to array, when needed
      *
-     * @return{DataClass[]}  The list converted to an array
+     * @return {DataClass[]}  The list converted to an array
      */
     public toArray() {
         return Array.from(this) as DataClass[];
@@ -113,9 +113,9 @@ export class LinkedList<DataClass> {
     /**
      *  Used for sorting and merging lists (Overridden by subclasses)
      *
-     * @param{DataClass} a   The first item to compare
-     * @param{DataClass} b   The second item to compare
-     * @return{boolean}      True if a is before b, false otherwise
+     * @param {DataClass} a   The first item to compare
+     * @param {DataClass} b   The second item to compare
+     * @return {boolean}      True if a is before b, false otherwise
      */
     public isBefore(a: DataClass, b: DataClass) {
         return (a < b);
@@ -124,8 +124,8 @@ export class LinkedList<DataClass> {
     /**
      * Push items on the end of the list
      *
-     * @param{DataClass[]} args   The list of data items to be pushed
-     * @return{LinkedList}        The LinkedList object (for chaining)
+     * @param {DataClass[]} args   The list of data items to be pushed
+     * @return {LinkedList}        The LinkedList object (for chaining)
      */
     public push(...args: DataClass[]) {
         for (const data of args) {
@@ -141,7 +141,7 @@ export class LinkedList<DataClass> {
     /**
      * Pop the end item off the list and return its data
      *
-     * @return{DataClass}  The data from the last item in the list
+     * @return {DataClass}  The data from the last item in the list
      */
     public pop(): DataClass {
         let item = this.list.prev;
@@ -157,8 +157,8 @@ export class LinkedList<DataClass> {
     /**
      * Push items at the head of the list
      *
-     * @param{DataClass[]} args   The list of data items to inserted
-     * @return{LinkedList}        The LinkedList object (for chaining)
+     * @param {DataClass[]} args   The list of data items to inserted
+     * @return {LinkedList}        The LinkedList object (for chaining)
      */
     public unshift(...args: DataClass[]) {
         for (const data of args.slice(0).reverse()) {
@@ -174,7 +174,7 @@ export class LinkedList<DataClass> {
     /**
      * Remove an item from the head of the list and return its data
      *
-     * @return{DataClass}  The data from the first item in the list
+     * @return {DataClass}  The data from the first item in the list
      */
     public shift(): DataClass {
         let item = this.list.next;
@@ -190,7 +190,7 @@ export class LinkedList<DataClass> {
     /**
      * Empty the list
      *
-     * @return{LinkedList}  The LinkedList object (for chaining)
+     * @return {LinkedList}  The LinkedList object (for chaining)
      */
     public clear() {
         this.list.next.prev = this.list.prev.next = null;
@@ -201,7 +201,7 @@ export class LinkedList<DataClass> {
     /**
      * Make the list iterable and return the data from the items in the list
      *
-     * @return{{next: Function}}  The object containing the iterator's next() function
+     * @return {{next: Function}}  The object containing the iterator's next() function
      */
     public [Symbol.iterator](): Iterator<DataClass> {
         let current = this.list;
@@ -218,7 +218,7 @@ export class LinkedList<DataClass> {
     /**
      * An iterator for the list in reverse order
      *
-     * @return{Object}  The iterator for walking the list in reverse
+     * @return {Object}  The iterator for walking the list in reverse
      */
     public reversed() {
         let current = this.list;
@@ -241,9 +241,9 @@ export class LinkedList<DataClass> {
     /**
      * Insert a new item into a sorted list in the correct locations
      *
-     * @param{DataClass} data   The data item to add
-     * @param{SortFn} isBefore  The function used to order the data
-     * @param{LinkedList}       The LinkedList object (for chaining)
+     * @param {DataClass} data   The data item to add
+     * @param {SortFn} isBefore   The function used to order the data
+     * @param {LinkedList}        The LinkedList object (for chaining)
      */
     public insert(data: DataClass, isBefore: SortFn<DataClass> = null) {
         if (isBefore === null) {
@@ -263,8 +263,8 @@ export class LinkedList<DataClass> {
     /**
      * Sort the list using an optional sort function
      *
-     * @param{SortFn} isBefore  The function used to order the data
-     * @return{LinkedList}      The LinkedList object (for chaining)
+     * @param {SortFn} isBefore  The function used to order the data
+     * @return {LinkedList}      The LinkedList object (for chaining)
      */
     public sort(isBefore: SortFn<DataClass> = null) {
         if (isBefore === null) {
@@ -302,9 +302,9 @@ export class LinkedList<DataClass> {
     /**
      * Merge a sorted list with another sorted list
      *
-     * @param{LinkedList} list  The list to merge into this instance's list
-     * @param{SortFn} isBefore  The function used to order the data
-     * @return{LinkedList}      The LinkedList instance (for chaining)
+     * @param {LinkedList} list  The list to merge into this instance's list
+     * @param {SortFn} isBefore  The function used to order the data
+     * @return {LinkedList}      The LinkedList instance (for chaining)
      */
     public merge(list: LinkedList<DataClass>, isBefore: SortFn<DataClass> = null) {
         if (isBefore === null) {

mathjax3-ts/util/Options.ts

@@ -65,8 +65,8 @@ export function makeArray(x: any): any[] {
 /**
  * Get all keys and symbols from an object
  *
- * @param{Optionlist} def        The object whose keys are to be returned
- * @return{(string | symbol)[]}  The list of keys for the object
+ * @param {Optionlist} def        The object whose keys are to be returned
+ * @return {(string | symbol)[]}  The list of keys for the object
  */
 export function keys(def: OptionList) {
     if (!def) {
@@ -79,8 +79,8 @@ export function keys(def: OptionList) {
 /**
  * Make a deep copy of an object
  *
- * @param{OptionList} def  The object to be copied
- * @return{OptionList}     The copy of the object
+ * @param {OptionList} def  The object to be copied
+ * @return {OptionList}     The copy of the object
  */
 export function copy(def: OptionList): OptionList {
     let props: OptionList = {};
@@ -104,10 +104,10 @@ export function copy(def: OptionList): OptionList {
  * Insert one object into another (with optional warnings about
  * keys that aren't in the original)
  *
- * @param{OptionList} dst  The option list to merge into
- * @param{OptionList} src  The options to be merged
- * @param{boolean} warn    True if a warning shoudl be issued for a src option that isn't already in dst
- * @return{OptionList}     The modified destination option list (dst)
+ * @param {OptionList} dst  The option list to merge into
+ * @param {OptionList} src  The options to be merged
+ * @param {boolean} warn    True if a warning shoudl be issued for a src option that isn't already in dst
+ * @return {OptionList}     The modified destination option list (dst)
  */
 export function insert(dst: OptionList, src: OptionList, warn: boolean = true) {
     for (let key of keys(src)) {
@@ -142,9 +142,9 @@ export function insert(dst: OptionList, src: OptionList, warn: boolean = true) {
  * Merge options without warnings (so we can add new default values into an
  * existing default list)
  *
- * @param{OptionList} options  The option list to be merged into
- * @param{OptionList[]} defs   The option lists to merge into the first one
- * @return{OptionList}         The modified options list
+ * @param {OptionList} options  The option list to be merged into
+ * @param {OptionList[]} defs   The option lists to merge into the first one
+ * @return {OptionList}         The modified options list
  */
 export function defaultOptions(options: OptionList, ...defs: OptionList[]) {
     defs.forEach(def => insert(options, def, false));
@@ -156,9 +156,9 @@ export function defaultOptions(options: OptionList, ...defs: OptionList[]) {
  * Merge options with warnings about undefined ones (so we can merge
  * user options into the default list)
  *
- * @param{OptionList} options  The option list to be merged into
- * @param{OptionList[]} defs   The option lists to merge into the first one
- * @return{OptionList}         The modified options list
+ * @param {OptionList} options  The option list to be merged into
+ * @param {OptionList[]} defs   The option lists to merge into the first one
+ * @return {OptionList}         The modified options list
  */
 export function userOptions(options: OptionList, ...defs: OptionList[]) {
     defs.forEach(def => insert(options, def, true));
@@ -169,9 +169,9 @@ export function userOptions(options: OptionList, ...defs: OptionList[]) {
 /**
  * Select a subset of options by key name
  *
- * @param{OptionList} options  The option list from which option values will be taken
- * @param{string[]} keys       The names of the options to extract
- * @return{OptionList}         The option list consisting of only the ones whose keys were given
+ * @param {OptionList} options  The option list from which option values will be taken
+ * @param {string[]} keys       The names of the options to extract
+ * @return {OptionList}         The option list consisting of only the ones whose keys were given
  */
 export function selectOptions(options: OptionList, ...keys: string[]) {
     let subset: OptionList = {};
@@ -187,9 +187,9 @@ export function selectOptions(options: OptionList, ...keys: string[]) {
 /**
  * Select a subset of options by keys from an object
  *
- * @param{OptionList} options  The option list from which the option values will be taken
- * @param{OptionList} object   The option list whose keys will be used to select the options
- * @return{OptionList}         The option list consisting of the option values from the first
+ * @param {OptionList} options  The option list from which the option values will be taken
+ * @param {OptionList} object   The option list whose keys will be used to select the options
+ * @return {OptionList}         The option list consisting of the option values from the first
  *                               list whose keys are those from the second list.
  */
 export function selectOptionsFromKeys(options: OptionList, object: OptionList) {
@@ -203,10 +203,10 @@ export function selectOptionsFromKeys(options: OptionList, object: OptionList) {
  *  (Used to separate an option list into the options needed for several
  *   subobjects.)
  *
- * @param{OptionList} options    The option list to be split into parts
- * @param{OptionList[]} objects  The list of option lists whose keys are used to break up
+ * @param {OptionList} options    The option list to be split into parts
+ * @param {OptionList[]} objects  The list of option lists whose keys are used to break up
  *                                 the original options into separate pieces.
- * @return{OptionList[]}         The option lists taken from the original based on the
+ * @return {OptionList[]}         The option lists taken from the original based on the
  *                                 keys of the other objects.  The first one in the list
  *                                 consists of the values not appearing in any of the others
  *                                 (i.e., whose keys were not in any of the others).