Remove extra space before code fence language

Author: Planeshifter

lib/node_modules/@stdlib/math/base/special/acosh/lib/acosh.js

@@ -40,13 +40,13 @@ var HUGE = 1 << 28; // 2**28
 *
 * Based on
 *
-* ``` tex
+* ```tex
 * \operatorname{acosh}(x) = \log \left[ x + \sqrt{ x^2 - 1 } \right]
 * ```
 *
 * we have
 *
-* ``` tex
+* ```tex
 * \operatorname{acosh}(x) = \begin{cases}
 * \log(x) + \tfrac{\ln}{2} & \text{ if x is large } \\
 * \log \left( 2x-\tfrac{1}{\sqrt{x^2-1}+x} \right) & \text{ if } x > 2 \\
@@ -56,7 +56,7 @@ var HUGE = 1 << 28; // 2**28
 *
 * #### Special Cases
 *
-* ``` tex
+* ```tex
 * \begin{align*}
 * \operatorname{acosh}(x) &= \mathrm{NaN}\ \text{ if } x < 1 \\
 * \end{align*}

lib/node_modules/@stdlib/math/base/special/asinh/lib/asinh.js

@@ -42,13 +42,13 @@ var HUGE = 1 << 28; // 2**28
 *
 * Based on
 *
-* ``` tex
+* ```tex
 * \operatorname{asinh}(x) = \operatorname{sgn}(x) \cdot \log \left( |x| + \sqrt{x^2 + 1} \right)
 * ```
 *
 * we have
 *
-* ``` tex
+* ```tex
 * \operatorname{asinh}(x) = \begin{cases}
 * x  & \text{ if }  1+x^2 =1, \\
 * \operatorname{sgn}(x) \cdot \left( \log(x) + \tfrac{\ln}{2} \right) & \text{ if large } |x| \\

lib/node_modules/@stdlib/math/base/special/atan2/lib/atan2.js

@@ -53,7 +53,7 @@ var PI = require( '@stdlib/math/constants/float64-pi' );
 *
 * #### Special Cases
 *
-* ``` tex
+* ```tex
 * \begin{align}
 * \operatorname{atan2}(y,\mathrm{NaN}) &= \mathrm{NaN}\\
 * \operatorname{atan2}(\mathrm{NaN},x) &= \mathrm{NaN}\\

lib/node_modules/@stdlib/math/base/special/atanh/lib/atanh.js

@@ -41,19 +41,19 @@ var NEAR_ZERO = 1.0 / (1 << 28); // 2**-28
 *
 * 2. For \\( x \ge 0.5 \\), we calculate
 *
-*    ``` tex
+*    ```tex
 *    \operatorname{atanh}(x) = \frac{1}{2} \cdot \log\left( 1 + \tfrac{2x}{1-x} \right) = \frac{1}{2} \cdot \operatorname{log1p}\left( 2 \tfrac{x}{1-x} \right)
 *    ```
 *
 *    For \\( x < 0.5 \\), we have
 *
-*    ``` tex
+*    ```tex
 *    \operatorname{atanh}(x) = \frac{1}{2} \cdot \operatorname{log1p}\left( 2x + \tfrac{2x^2}{1-x} \right)
 *    ```
 *
 * #### Special Cases
 *
-* ``` tex
+* ```tex
 * \begin{align*}
 * \operatorname{atanh}(\mathrm{NaN}) &= \mathrm{NaN}\\
 * \operatorname{atanh}(1.0) &= \infty \\

lib/node_modules/@stdlib/math/base/special/betaln/lib/gamma_correction.js

@@ -40,7 +40,7 @@ var XMAX = 3.745194030963158e306;
 /**
 * Compute the log gamma correction factor for x >= 10 so that
 *
-* ``` tex
+* ```tex
 * \log(\gamma(x)) = \log(\sqrt{2*\Pi}) + (x-0.5) \cdot \log(x) - x \operatorname{R9LGMC}(x).
 * ```
 *

lib/node_modules/@stdlib/math/base/special/binomcoef/lib/binomcoef.js

@@ -17,7 +17,7 @@ var round = require( '@stdlib/math/base/special/round' );
 *
 * * Instead of evaluating the factorial form, which is inefficient and prone to overflow for large inputs arguments, this module computes the following multiplicative representation of the binomial coefficient for integer arguments
 *
-*   ``` tex
+*   ```tex
 *   \binom nk = \prod_{i=1}^k \frac{n+1-i}{i}
 *   ```
 *

lib/node_modules/@stdlib/math/base/special/cbrt/lib/cbrt.js

@@ -75,7 +75,7 @@ var polyval = evalpoly( P );
 *
 * 1. Rough cube root to \\( 5 \\) bits:
 *
-*    ``` tex
+*    ```tex
 *    \sqrt[3]{2^e (1+m)} \approx 2^(e/3) \biggl(1 + \frac{(e \mathrm{mod}\ 3) + m}{3}\biggr)
 *    ```
 *
@@ -91,7 +91,7 @@ var polyval = evalpoly( P );
 *
 * 2. New cube root to \\( 23 \\) bits:
 *
-*    ``` tex
+*    ```tex
 *    \sqrt[3]{x} = t \cdot \sqrt[3]{x/t^3} \approx t \mathrm{P}(t^3/x)
 *    ```
 *

lib/node_modules/@stdlib/math/base/special/ceiln/lib/ceiln.js

@@ -29,7 +29,7 @@ var HUGE = 1e+308;
 *
 * 1. If \\(|x| <= 2^{53}\\) and \\(|n| <= 308\\), we can use the formula
 *
-*    ``` tex
+*    ```tex
 *    \operatorname{ceiln}(x,n) = \frac{\operatorname{ceil}(x \cdot 10^{-n})}{10^{-n}}
 *    ```
 *
@@ -55,7 +55,7 @@ var HUGE = 1e+308;
 *
 * 5. If \\(n < -308\\), we let \\(m = n + 308\\) and modify the above formula to avoid overflow.
 *
-*    ``` tex
+*    ```tex
 *    \operatorname{ceiln}(x,n) = \frac{\biggl(\frac{\operatorname{ceil}( (x \cdot 10^{308}) 10^{-m})}{10^{308}}\biggr)}{10^{-m}}
 *    ```
 *
@@ -64,7 +64,7 @@ var HUGE = 1e+308;
 *
 * #### Special Cases
 *
-* ``` tex
+* ```tex
 * \begin{align*}
 * \operatorname{ceiln}(\mathrm{NaN}, n) &= \mathrm{NaN} \\
 * \operatorname{ceiln}(x, \mathrm{NaN}) &= \mathrm{NaN} \\

lib/node_modules/@stdlib/math/base/special/cosh/lib/cosh.js

@@ -13,7 +13,7 @@ var exp = require( '@stdlib/math/base/special/exp' );
 *
 * #### Method
 *
-* ``` tex
+* ```tex
 * \operatorname{cosh}(x)  =  \frac{ \exp(x) + \exp(-x) }{2}
 * ```
 *

lib/node_modules/@stdlib/math/base/special/digamma/lib/digamma.js

@@ -37,23 +37,23 @@ var MIN_SAFE_ASYMPTOTIC = 10.0; // BIG
 *
 * 1. For \\(x < 0\\), we use the reflection formula
 *
-*    ``` tex
+*    ```tex
 *    \psi(1-x) = \psi(x) + \frac{\pi}{\tan(\pi x)}
 *    ```
 *
 *    to make \\(x\\) positive.
 *
 * 2. For \\(x \in [0,1]\\), we use the recurrence relation
 *
-*    ``` tex
+*    ```tex
 *    \psi(x) = \psi(x+1) - \frac{1}{x}
 *    ```
 *
 *    to shift the evaluation range to \\([1,2]\\).
 *
 * 3. For \\(x \in [1,2]\\), we use a rational approximation of the form
 *
-*    ``` tex
+*    ```tex
 *    \psi(x) = (x - \mathrm{root})(Y + \operatorname{R}(x-1))
 *    ```
 *
@@ -68,15 +68,15 @@ var MIN_SAFE_ASYMPTOTIC = 10.0; // BIG
 *
 * 4. For \\(x \in [2,\mathrm{BIG}]\\), we use the recurrence relation
 *
-*    ``` tex
+*    ```tex
 *    \psi(x+1) = \psi(x) + \frac{1}{x}
 *    ```
 *
 *    to shift the evaluation range to \\([1,2]\\).
 *
 * 5. For \\(x > \mathrm{BIG}\\), we use the asymptotic expression
 *
-*    ``` tex
+*    ```tex
 *    \psi(x) = \ln(x) + \frac{1}{2x} - \biggl( \frac{B_{21}}{2x^2} + \frac{B_{22}}{4x^4} + \frac{B_{23}}{6x^6} + \ldots \biggr)
 *    ```
 *