feat: add stats/incr/nanminabs

[faisalaffan]

Resolves #5552.

Description

What is the purpose of this pull request?

This pull request:

• Adds @stdlib/stats/incr/nanminabs — an incremental accumulator for the minimum absolute value that ignores NaN inputs instead of propagating them.

The implementation is a thin wrapper around @stdlib/stats/incr/nanminabs, following the same pattern as @stdlib/stats/incr/nansum. When the accumulator receives a NaN, it skips it and returns the current minimum unchanged. If all inputs so far have been NaN, the accumulator returns null (consistent with the empty-state behavior of nanminabs).

The signed-zero behavior follows the same convention as nanminabs where -0 and +0 are treated as equal.

This is a revised version of #5637, which has been left open with review feedback unaddressed on the package name, description wording, and format string. All three issues have been addressed in this PR.

Related Issues

Does this pull request have any related issues?

This pull request has the following related issues:

• [RFC]: add stats/incr/nanminabs #5552
• feat: add stats/incr/nanminabs #5637

Questions

Any questions for reviewers of this pull request?

One minor thing: in the REPL docs I used "minimum absolute value" as the short description — same as nanminabs. Let me know if a different phrasing is preferred since the NaN-handling changes the semantics slightly.

Other

Any other information relevant to this pull request? This may include screenshots, references, and/or implementation notes.

make test TESTS_FILTER=".*/stats/incr/nanminabs/.*"
# 10/10 pass

make examples EXAMPLES_FILTER=".*/stats/incr/nanminabs/.*"
# runs successfully

make benchmark BENCHMARKS_FILTER=".*/stats/incr/nanminabs/.*"
# 6/6 pass

Checklist

Please ensure the following tasks are completed before submitting this pull request.

• Read, understood, and followed the contributing guidelines.
• Read and understood the Code of Conduct.
• Searched for existing issues and pull requests.

AI Assistance

When authoring the changes proposed in this PR, did you use any kind of AI assistance?

• Yes
• No

---

@stdlib-js/reviewers

[stdlib-bot]

👋 Hi there! 👋

And thank you for opening your first pull request! We will review it shortly. 🏃 💨

Getting Started

• Please read our contributing guidelines if you haven't already.
• For development guidance, refer to the development guide.

Next Steps

1. A project maintainer will approve GitHub Actions workflows for your PR.
2. All CI checks must pass before your submission can be fully reviewed.
3. You'll need to address any failures in linting or unit tests.

Running Tests Locally

You can use make to run any of the CI commands locally from the root directory of the stdlib repository:

# Run tests for all packages in the math namespace:
make test TESTS_FILTER=".*/@stdlib/math/.*"

# Run benchmarks for a specific package:
make benchmark BENCHMARKS_FILTER=".*/@stdlib/math/base/special/sin/.*"

If you haven't heard back from us within two weeks, please ping us by tagging the "reviewers" team in a comment on this PR.

If you have any further questions while waiting for a response, please join our Zulip community to chat with project maintainers and other community members.

We appreciate your contribution!

Documentation Links

• Contributing Guidelines
• Development Guide
• Zulip Chat
• make rules for running examples
• make rules for running unit tests
• make rules for running benchmarks