-
-
Notifications
You must be signed in to change notification settings - Fork 804
Feat/accessor protocol for max by #6585
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.
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
Open
shwetasrsh
wants to merge
4
commits into
stdlib-js:develop
Choose a base branch
from
shwetasrsh:feat/accessor-protocol-for-max-by
base: develop
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
Open
Changes from all commits
Commits
Show all changes
4 commits
Select commit
Hold shift + click to select a range
6945eb9
feat: refactor and add protocol support to stats/base/max-by
shwetasrsh 3b768c0
feat: refactor and add protocol support to stats/base/max-by
shwetasrsh 50017c4
feat: refactor and add protocol support to stats/base/max-by
shwetasrsh 5ded71b
feat: refactor and add protocol support to stats/base/max-by
shwetasrsh File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
115 changes: 115 additions & 0 deletions
115
lib/node_modules/@stdlib/stats/base/max-by/lib/accessors.js
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,115 @@ | ||
/** | ||
* @license Apache-2.0 | ||
* | ||
* Copyright (c) 2025 The Stdlib Authors. | ||
* | ||
* Licensed under the Apache License, Version 2.0 (the "License"); | ||
* you may not use this file except in compliance with the License. | ||
* You may obtain a copy of the License at | ||
* | ||
* http://www.apache.org/licenses/LICENSE-2.0 | ||
* | ||
* Unless required by applicable law or agreed to in writing, software | ||
* distributed under the License is distributed on an "AS IS" BASIS, | ||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | ||
* See the License for the specific language governing permissions and | ||
* limitations under the License. | ||
*/ | ||
|
||
'use strict'; | ||
|
||
// MODULES // | ||
|
||
var isnan = require( '@stdlib/math/base/assert/is-nan' ); | ||
var isPositiveZero = require( '@stdlib/math/base/assert/is-positive-zero' ); | ||
|
||
|
||
// MAIN // | ||
|
||
/** | ||
* Calculates the maximum value of a strided array via a callback function. | ||
* | ||
* @param {PositiveInteger} N - number of indexed elements | ||
* @param {Object} x - input array object | ||
* @param {Array<Function>} x.accessors - array element accessors | ||
* @param {integer} stride - stride length | ||
* @param {Callback} clbk - callback | ||
* @param {*} [thisArg] - execution context | ||
* @returns {number} maximum value | ||
* | ||
* @example | ||
* var toAccessorArray = require( '@stdlib/array/base/to-accessor-array' ); | ||
* var arraylike2object = require( '@stdlib/array/base/arraylike2object' ); | ||
* | ||
* var x = [ 1.0, 2.0, 2.0, -7.0, -2.0, 3.0, 4.0, 2.0 ]; | ||
* | ||
* function accessor( v ) { | ||
* return v * 2.0; | ||
* } | ||
* var v = maxBy( x.length, toAccessorArray( x ), 1, accessor ); | ||
* | ||
*/ | ||
function maxBy( N, x, stride, clbk, thisArg ) { | ||
var xbuf; | ||
var tmp; | ||
var get; | ||
var max; | ||
var ix; | ||
var v; | ||
var i; | ||
|
||
// Cache reference to array data | ||
xbuf = x.data; | ||
|
||
// Cache a reference to the element accessor: | ||
get = x.accessors[ 0 ]; | ||
|
||
if ( N <= 0 ) { | ||
return NaN; | ||
} | ||
|
||
if ( N === 1 || stride === 0 ) { | ||
v = clbk.call( thisArg, x[ 0 ], 0, 0, x); | ||
if ( v === void 0 ) { | ||
return NaN; | ||
} | ||
return v; | ||
} | ||
if ( stride < 0 ) { | ||
ix = (1-N) * stride; | ||
} else { | ||
ix = 0; | ||
} | ||
for ( i = 0; i < N; i++) { | ||
tmp = get( xbuf, ix ); | ||
max = clbk.call( thisArg, tmp, i, ix, x); | ||
if ( max !== void 0 ) { | ||
break; | ||
} | ||
ix += stride; | ||
} | ||
if ( i === N) { | ||
return NaN; | ||
} | ||
i += 1; | ||
for ( i; i < N; i++) { | ||
ix += stride; | ||
tmp = get( xbuf, ix ); | ||
v = clbk.call( thisArg, tmp, i, ix, x ); | ||
if ( v === void 0 ) { | ||
continue; | ||
} | ||
if ( isnan(v) ) { | ||
return v; | ||
} | ||
if ( v > max || ( v === max && isPositiveZero( v ))) { | ||
max = v; | ||
} | ||
} | ||
return max; | ||
} | ||
|
||
|
||
// EXPORTS // | ||
|
||
module.exports = maxBy; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I think previous changes, more precise and broadly useful :)