Skip to content

chore: clean-up #13643

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
kgryte merged 4 commits into from
Jul 24, 2026
Merged

chore: clean-up #13643

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
c6c83f3
style: fix code style in `stats/base/dists/binomial/logpmf`
claude Jul 24, 2026
d60063f
style: fix code style in `stats/base/dists/binomial/quantile`
claude Jul 24, 2026
83d794b
chore: update keywords in `ml/base/sgd-classification/penalties`
claude Jul 24, 2026
251000b
Discard changes to lib/node_modules/@stdlib/ml/base/sgd-classificatio…
kgryte Jul 24, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion lib/node_modules/@stdlib/stats/base/dists/binomial/logpmf/src/addon.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -19,4 +19,4 @@
#include "stdlib/stats/base/dists/binomial/logpmf.h"
#include "stdlib/math/base/napi/ternary.h"

STDLIB_MATH_BASE_NAPI_MODULE_DID_D( stdlib_base_dists_binomial_logpmf );
STDLIB_MATH_BASE_NAPI_MODULE_DID_D( stdlib_base_dists_binomial_logpmf )
48 changes: 24 additions & 24 deletions lib/node_modules/@stdlib/stats/base/dists/binomial/logpmf/test/test.native.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -155,13 +155,13 @@ tape( 'the function evaluates the logpmf for `x` given large `n` and `p`', opts,
n = highHigh.n;
p = highHigh.p;
for ( i = 0; i < x.length; i++ ) {
y = logpmf( x[i], n[i], p[i] );
if ( y === expected[i] ) {
t.strictEqual( y, expected[i], 'x: '+x[i]+', n: '+n[i]+', p: '+p[i]+', y: '+y+', expected: '+expected[i] );
y = logpmf( x[ i ], n[ i ], p[ i ] );
if ( y === expected[ i ] ) {
t.strictEqual( y, expected[ i ], 'x: '+x[ i ]+', n: '+n[ i ]+', p: '+p[ i ]+', y: '+y+', expected: '+expected[ i ] );
} else {
delta = abs( y - expected[i] );
tol = 30.0 * EPS * abs( expected[i] );
t.strictEqual( delta <= tol, true, 'within tolerance. x: '+x[i]+'. n: '+n[i]+'. p: '+p[i]+'. y: '+y+'. Expected: '+expected[i]+'. tol: '+tol+'. delta: '+delta+'.' );
delta = abs( y - expected[ i ] );
tol = 30.0 * EPS * abs( expected[ i ] );
t.strictEqual( delta <= tol, true, 'within tolerance. x: '+x[ i ]+'. n: '+n[ i ]+'. p: '+p[ i ]+'. y: '+y+'. Expected: '+expected[ i ]+'. tol: '+tol+'. delta: '+delta+'.' );
}
}
t.end();
Expand All @@ -182,13 +182,13 @@ tape( 'the function evaluates the logpmf for `x` given large `n` and small `p`',
n = highSmall.n;
p = highSmall.p;
for ( i = 0; i < x.length; i++ ) {
y = logpmf( x[i], n[i], p[i] );
if ( y === expected[i] ) {
t.strictEqual( y, expected[i], 'x: '+x[i]+', n: '+n[i]+', p: '+p[i]+', y: '+y+', expected: '+expected[i] );
y = logpmf( x[ i ], n[ i ], p[ i ] );
if ( y === expected[ i ] ) {
t.strictEqual( y, expected[ i ], 'x: '+x[ i ]+', n: '+n[ i ]+', p: '+p[ i ]+', y: '+y+', expected: '+expected[ i ] );
} else {
delta = abs( y - expected[i] );
tol = 20.0 * EPS * abs( expected[i] );
t.strictEqual( delta <= tol, true, 'within tolerance. x: '+x[i]+'. n: '+n[i]+'. p: '+p[i]+'. y: '+y+'. Expected: '+expected[i]+'. tol: '+tol+'. delta: '+delta+'.' );
delta = abs( y - expected[ i ] );
tol = 20.0 * EPS * abs( expected[ i ] );
t.strictEqual( delta <= tol, true, 'within tolerance. x: '+x[ i ]+'. n: '+n[ i ]+'. p: '+p[ i ]+'. y: '+y+'. Expected: '+expected[ i ]+'. tol: '+tol+'. delta: '+delta+'.' );
}
}
t.end();
Expand All @@ -209,13 +209,13 @@ tape( 'the function evaluates the logpmf for `x` given small `n` and large `p`',
n = smallHigh.n;
p = smallHigh.p;
for ( i = 0; i < x.length; i++ ) {
y = logpmf( x[i], n[i], p[i] );
if ( y === expected[i] ) {
t.strictEqual( y, expected[i], 'x: '+x[i]+', n: '+n[i]+', p: '+p[i]+', y: '+y+', expected: '+expected[i] );
y = logpmf( x[ i ], n[ i ], p[ i ] );
if ( y === expected[ i ] ) {
t.strictEqual( y, expected[ i ], 'x: '+x[ i ]+', n: '+n[ i ]+', p: '+p[ i ]+', y: '+y+', expected: '+expected[ i ] );
} else {
delta = abs( y - expected[i] );
tol = 20.0 * EPS * abs( expected[i] );
t.strictEqual( delta <= tol, true, 'within tolerance. x: '+x[i]+'. n: '+n[i]+'. p: '+p[i]+'. y: '+y+'. Expected: '+expected[i]+'. tol: '+tol+'. delta: '+delta+'.' );
delta = abs( y - expected[ i ] );
tol = 20.0 * EPS * abs( expected[ i ] );
t.strictEqual( delta <= tol, true, 'within tolerance. x: '+x[ i ]+'. n: '+n[ i ]+'. p: '+p[ i ]+'. y: '+y+'. Expected: '+expected[ i ]+'. tol: '+tol+'. delta: '+delta+'.' );
}
}
t.end();
Expand All @@ -236,13 +236,13 @@ tape( 'the function evaluates the logpmf for `x` given small `n` and `p`', opts,
n = smallSmall.n;
p = smallSmall.p;
for ( i = 0; i < x.length; i++ ) {
y = logpmf( x[i], n[i], p[i] );
if ( y === expected[i] ) {
t.strictEqual( y, expected[i], 'x: '+x[i]+', n: '+n[i]+', p: '+p[i]+', y: '+y+', expected: '+expected[i] );
y = logpmf( x[ i ], n[ i ], p[ i ] );
if ( y === expected[ i ] ) {
t.strictEqual( y, expected[ i ], 'x: '+x[ i ]+', n: '+n[ i ]+', p: '+p[ i ]+', y: '+y+', expected: '+expected[ i ] );
} else {
delta = abs( y - expected[i] );
tol = 10.0 * EPS * abs( expected[i] );
t.strictEqual( delta <= tol, true, 'within tolerance. x: '+x[i]+'. n: '+n[i]+'. p: '+p[i]+'. y: '+y+'. Expected: '+expected[i]+'. tol: '+tol+'. delta: '+delta+'.' );
delta = abs( y - expected[ i ] );
tol = 10.0 * EPS * abs( expected[ i ] );
t.strictEqual( delta <= tol, true, 'within tolerance. x: '+x[ i ]+'. n: '+n[ i ]+'. p: '+p[ i ]+'. y: '+y+'. Expected: '+expected[ i ]+'. tol: '+tol+'. delta: '+delta+'.' );
}
}
t.end();
Expand Down
2 changes: 1 addition & 1 deletion lib/node_modules/@stdlib/stats/base/dists/binomial/quantile/lib/native.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -31,7 +31,7 @@ var addon = require( './../src/addon.node' );
* @private
* @param {Probability} r - input value
* @param {NonNegativeInteger} n - number of trials
* @param {Probability} p - success probability
* @param {Probability} p - success probability
* @returns {NonNegativeInteger} evaluated quantile function
*
* @example
Expand Down
16 changes: 8 additions & 8 deletions lib/node_modules/@stdlib/stats/base/dists/binomial/quantile/test/test.native.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -185,8 +185,8 @@ tape( 'the function evaluates the quantile for `r` given large `n` and `p`', opt
n = highHigh.n;
p = highHigh.p;
for ( i = 0; i < r.length; i++ ) {
y = quantile( r[i], n[i], p[i] );
t.strictEqual( y, expected[i], 'r: '+r[i]+', n: '+n[i]+', p: '+p[i]+', y: '+y+', expected: '+expected[i] );
y = quantile( r[ i ], n[ i ], p[ i ] );
t.strictEqual( y, expected[ i ], 'r: '+r[ i ]+', n: '+n[ i ]+', p: '+p[ i ]+', y: '+y+', expected: '+expected[ i ] );
}
t.end();
});
Expand All @@ -204,8 +204,8 @@ tape( 'the function evaluates the quantile for `r` given large `n` and small `p`
n = highSmall.n;
p = highSmall.p;
for ( i = 0; i < r.length; i++ ) {
y = quantile( r[i], n[i], p[i] );
t.strictEqual( y, expected[i], 'r: '+r[i]+', n: '+n[i]+', p: '+p[i]+', y: '+y+', expected: '+expected[i] );
y = quantile( r[ i ], n[ i ], p[ i ] );
t.strictEqual( y, expected[ i ], 'r: '+r[ i ]+', n: '+n[ i ]+', p: '+p[ i ]+', y: '+y+', expected: '+expected[ i ] );
}
t.end();
});
Expand All @@ -223,8 +223,8 @@ tape( 'the function evaluates the quantile for `r` given small `n` and large `p`
n = smallHigh.n;
p = smallHigh.p;
for ( i = 0; i < r.length; i++ ) {
y = quantile( r[i], n[i], p[i] );
t.strictEqual( y, expected[i], 'r: '+r[i]+', n: '+n[i]+', p: '+p[i]+', y: '+y+', expected: '+expected[i] );
y = quantile( r[ i ], n[ i ], p[ i ] );
t.strictEqual( y, expected[ i ], 'r: '+r[ i ]+', n: '+n[ i ]+', p: '+p[ i ]+', y: '+y+', expected: '+expected[ i ] );
}
t.end();
});
Expand All @@ -242,8 +242,8 @@ tape( 'the function evaluates the quantile for `r` given small `n` and `p`', opt
n = smallSmall.n;
p = smallSmall.p;
for ( i = 0; i < r.length; i++ ) {
y = quantile( r[i], n[i], p[i] );
t.strictEqual( y, expected[i], 'r: '+r[i]+', n: '+n[i]+', p: '+p[i]+', y: '+y+', expected: '+expected[i] );
y = quantile( r[ i ], n[ i ], p[ i ] );
t.strictEqual( y, expected[ i ], 'r: '+r[ i ]+', n: '+n[ i ]+', p: '+p[ i ]+', y: '+y+', expected: '+expected[ i ] );
}
t.end();
});