chore: update implementation

---
type: pre_commit_static_analysis_report
description: Results of running static analysis checks when committing changes.
report:
  - task: lint_filenames
    status: passed
  - task: lint_editorconfig
    status: passed
  - task: lint_markdown
    status: na
  - task: lint_package_json
    status: na
  - task: lint_repl_help
    status: na
  - task: lint_javascript_src
    status: na
  - task: lint_javascript_cli
    status: na
  - task: lint_javascript_examples
    status: na
  - task: lint_javascript_tests
    status: na
  - task: lint_javascript_benchmarks
    status: na
  - task: lint_python
    status: na
  - task: lint_r
    status: na
  - task: lint_c_src
    status: missing_dependencies
  - task: lint_c_examples
    status: na
  - task: lint_c_benchmarks
    status: na
  - task: lint_c_tests_fixtures
    status: na
  - task: lint_shell
    status: na
  - task: lint_typescript_declarations
    status: na
  - task: lint_typescript_tests
    status: na
  - task: lint_license_headers
    status: passed
---

Author: ShabiShett07

lib/node_modules/@stdlib/math/base/special/bessely1/src/main.c

@@ -249,36 +249,36 @@ double stdlib_base_bessely1( double x ) {
 	double y2;
 	double xc;
 
-    if (x < 0.0) {
-        return NAN;
-    }
-    if (x == 0.0) {
-        return -INFINITY;
-    }
-    if (x == INFINITY) {
-        return 0.0;
-    }
+	if (x < 0.0) {
+		return NAN;
+	}
+	if (x == 0.0) {
+		return -INFINITY;
+	}
+	if (x == INFINITY) {
+		return 0.0;
+	}
 	xc = x;
-    if (xc <= 4.0) {
-        y = xc * xc;
-        z = ( stdlib_base_ln( xc / x1 ) * stdlib_base_besselj1( xc ) ) * TWO_DIV_PI;
-        r = rational_p1q1( y );
-        f = ( ( xc+x1 ) * ( ( xc - ( x11 / 256.0) ) - x12 ) ) / xc;
-        return z + ( f * r );
-    }
-    if ( xc <= 8.0 ) {
-        y = xc * xc;
-        z = ( stdlib_base_ln( xc / x2 ) * stdlib_base_besselj1( xc ) ) * TWO_DIV_PI;
-        r = rational_p2q2( y );
-        f = ( ( xc + x2 ) * ( ( xc - ( x21 / 256.0 ) ) - x22 ) ) / xc;
-        return z + ( f * r );
-    }
+	if (xc <= 4.0) {
+		y = xc * xc;
+		z = ( stdlib_base_ln( xc / x1 ) * stdlib_base_besselj1( xc ) ) * TWO_DIV_PI;
+		r = rational_p1q1( y );
+		f = ( ( xc+x1 ) * ( ( xc - ( x11 / 256.0) ) - x12 ) ) / xc;
+		return z + ( f * r );
+	}
+	if ( xc <= 8.0 ) {
+		y = xc * xc;
+		z = ( stdlib_base_ln( xc / x2 ) * stdlib_base_besselj1( xc ) ) * TWO_DIV_PI;
+		r = rational_p2q2( y );
+		f = ( ( xc + x2 ) * ( ( xc - ( x21 / 256.0 ) ) - x22 ) ) / xc;
+		return z + ( f * r );
+	}
 
-    y = 8.0 / xc;
-    y2 = y * y;
-    rc = rational_pcqc( y2 );
-    rs = rational_psqs( y2 );
-    f = ONE_DIV_SQRT_PI / stdlib_base_sqrt( xc );
+	y = 8.0 / xc;
+	y2 = y * y;
+	rc = rational_pcqc( y2 );
+	rs = rational_psqs( y2 );
+	f = ONE_DIV_SQRT_PI / stdlib_base_sqrt( xc );
 
 	/*
 	* This code is really just: