{"id":21140658,"url":"https://github.com/stdlib-js/blas-ext-base","last_synced_at":"2025-08-31T23:42:01.358Z","repository":{"id":43785425,"uuid":"377254681","full_name":"stdlib-js/blas-ext-base","owner":"stdlib-js","description":"Standard library extended basic linear algebra subroutines (BLAS).","archived":false,"fork":false,"pushed_at":"2024-11-20T03:24:31.000Z","size":5314,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":3,"default_branch":"main","last_synced_at":"2024-11-20T04:20:46.969Z","etag":null,"topics":["algebra","array","base","basic","blas","javascript","lib","library","linear","math","mathematics","ndarray","node","node-js","nodejs","routines","standard","stdlib","subprograms","vector"],"latest_commit_sha":null,"homepage":"https://github.com/stdlib-js/stdlib","language":"JavaScript","has_issues":false,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"apache-2.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/stdlib-js.png","metadata":{"files":{"readme":"README.md","changelog":"CHANGELOG.md","contributing":"CONTRIBUTING.md","funding":null,"license":"LICENSE","code_of_conduct":"CODE_OF_CONDUCT.md","threat_model":null,"audit":null,"citation":"CITATION.cff","codeowners":null,"security":"SECURITY.md","support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null},"funding":{"github":["stdlib-js"],"open_collective":"stdlib","tidelift":"npm/@stdlib/stdlib"}},"created_at":"2021-06-15T18:10:08.000Z","updated_at":"2024-11-20T03:20:50.000Z","dependencies_parsed_at":"2023-02-17T07:46:05.229Z","dependency_job_id":"9e3ba692-c968-4b5b-a9c9-f6dc3a607d48","html_url":"https://github.com/stdlib-js/blas-ext-base","commit_stats":{"total_commits":46,"total_committers":1,"mean_commits":46.0,"dds":0.0,"last_synced_commit":"cf48249bedb3c71785d61f5346a654256214866f"},"previous_names":[],"tags_count":22,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/stdlib-js%2Fblas-ext-base","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/stdlib-js%2Fblas-ext-base/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/stdlib-js%2Fblas-ext-base/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/stdlib-js%2Fblas-ext-base/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/stdlib-js","download_url":"https://codeload.github.com/stdlib-js/blas-ext-base/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":225470803,"owners_count":17479368,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algebra","array","base","basic","blas","javascript","lib","library","linear","math","mathematics","ndarray","node","node-js","nodejs","routines","standard","stdlib","subprograms","vector"],"created_at":"2024-11-20T07:17:06.330Z","updated_at":"2025-07-09T04:31:30.844Z","avatar_url":"https://github.com/stdlib-js.png","language":"JavaScript","readme":"\u003c!--\n\n@license Apache-2.0\n\nCopyright (c) 2020 The Stdlib Authors.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n   http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n\n--\u003e\n\n\n\u003cdetails\u003e\n  \u003csummary\u003e\n    About stdlib...\n  \u003c/summary\u003e\n  \u003cp\u003eWe believe in a future in which the web is a preferred environment for numerical computation. To help realize this future, we've built stdlib. stdlib is a standard library, with an emphasis on numerical and scientific computation, written in JavaScript (and C) for execution in browsers and in Node.js.\u003c/p\u003e\n  \u003cp\u003eThe library is fully decomposable, being architected in such a way that you can swap out and mix and match APIs and functionality to cater to your exact preferences and use cases.\u003c/p\u003e\n  \u003cp\u003eWhen you use stdlib, you can be absolutely certain that you are using the most thorough, rigorous, well-written, studied, documented, tested, measured, and high-quality code out there.\u003c/p\u003e\n  \u003cp\u003eTo join us in bringing numerical computing to the web, get started by checking us out on \u003ca href=\"https://github.com/stdlib-js/stdlib\"\u003eGitHub\u003c/a\u003e, and please consider \u003ca href=\"https://opencollective.com/stdlib\"\u003efinancially supporting stdlib\u003c/a\u003e. We greatly appreciate your continued support!\u003c/p\u003e\n\u003c/details\u003e\n\n# Extended BLAS\n\n[![NPM version][npm-image]][npm-url] [![Build Status][test-image]][test-url] [![Coverage Status][coverage-image]][coverage-url] \u003c!-- [![dependencies][dependencies-image]][dependencies-url] --\u003e\n\n\u003e Base (i.e., lower-level) extensions to basic linear algebra subprograms (BLAS).\n\n\u003csection class=\"installation\"\u003e\n\n## Installation\n\n```bash\nnpm install @stdlib/blas-ext-base\n```\n\nAlternatively,\n\n-   To load the package in a website via a `script` tag without installation and bundlers, use the [ES Module][es-module] available on the [`esm`][esm-url] branch (see [README][esm-readme]).\n-   If you are using Deno, visit the [`deno`][deno-url] branch (see [README][deno-readme] for usage intructions).\n-   For use in Observable, or in browser/node environments, use the [Universal Module Definition (UMD)][umd] build available on the [`umd`][umd-url] branch (see [README][umd-readme]).\n\nThe [branches.md][branches-url] file summarizes the available branches and displays a diagram illustrating their relationships.\n\nTo view installation and usage instructions specific to each branch build, be sure to explicitly navigate to the respective README files on each branch, as linked to above.\n\n\u003c/section\u003e\n\n\u003csection class=\"usage\"\u003e\n\n## Usage\n\n```javascript\nvar ns = require( '@stdlib/blas-ext-base' );\n```\n\n#### ns\n\nNamespace for \"base\" (i.e., lower-level) extensions to basic linear algebra subprograms (BLAS).\n\n```javascript\nvar o = ns;\n// returns {...}\n```\n\n\u003c!-- \u003ctoc pattern=\"*\"\u003e --\u003e\n\n\u003cdiv class=\"namespace-toc\"\u003e\n\n-   \u003cspan class=\"signature\"\u003e[`cfill( N, alpha, x, strideX )`][@stdlib/blas/ext/base/cfill]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003efill a single-precision complex floating-point strided array with a specified scalar constant.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`csum( N, x, strideX )`][@stdlib/blas/ext/base/csum]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of single-precision complex floating-point strided array elements.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`csumkbn( N, x, strideX )`][@stdlib/blas/ext/base/csumkbn]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of single-precision complex floating-point strided array elements using an improved Kahan–Babuška algorithm.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dapx( N, alpha, x, strideX )`][@stdlib/blas/ext/base/dapx]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003eadd a scalar constant to each element in a double-precision floating-point strided array.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dapxsum( N, alpha, x, strideX )`][@stdlib/blas/ext/base/dapxsum]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003eadd a scalar constant to each double-precision floating-point strided array element and compute the sum.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dapxsumkbn( N, alpha, x, strideX )`][@stdlib/blas/ext/base/dapxsumkbn]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003eadd a scalar constant to each double-precision floating-point strided array element and compute the sum using an improved Kahan–Babuška algorithm.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dapxsumkbn2( N, alpha, x, strideX )`][@stdlib/blas/ext/base/dapxsumkbn2]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003eadd a scalar constant to each double-precision floating-point strided array element and compute the sum using a second-order iterative Kahan–Babuška algorithm.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dapxsumors( N, alpha, x, strideX )`][@stdlib/blas/ext/base/dapxsumors]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003eadd a scalar constant to each double-precision floating-point strided array element and compute the sum using ordinary recursive summation.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dapxsumpw( N, alpha, x, strideX )`][@stdlib/blas/ext/base/dapxsumpw]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003eadd a scalar constant to each double-precision floating-point strided array element and compute the sum using pairwise summation.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dasumpw( N, x, strideX )`][@stdlib/blas/ext/base/dasumpw]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of absolute values (_L1_ norm) of double-precision floating-point strided array elements using pairwise summation.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dcusum( N, sum, x, strideX, y, strideY )`][@stdlib/blas/ext/base/dcusum]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the cumulative sum of double-precision floating-point strided array elements.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dcusumkbn( N, sum, x, strideX, y, strideY )`][@stdlib/blas/ext/base/dcusumkbn]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the cumulative sum of double-precision floating-point strided array elements using an improved Kahan–Babuška algorithm.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dcusumkbn2( N, sum, x, strideX, y, strideY )`][@stdlib/blas/ext/base/dcusumkbn2]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the cumulative sum of double-precision floating-point strided array elements using a second-order iterative Kahan–Babuška algorithm.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dcusumors( N, sum, x, strideX, y, strideY )`][@stdlib/blas/ext/base/dcusumors]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the cumulative sum of double-precision floating-point strided array elements using ordinary recursive summation.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dcusumpw( N, sum, x, strideX, y, strideY )`][@stdlib/blas/ext/base/dcusumpw]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the cumulative sum of double-precision floating-point strided array elements using pairwise summation.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dfill( N, alpha, x, strideX )`][@stdlib/blas/ext/base/dfill]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003efill a double-precision floating-point strided array with a specified scalar constant.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dnanasum( N, x, strideX )`][@stdlib/blas/ext/base/dnanasum]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of absolute values (_L1_ norm) of double-precision floating-point strided array elements, ignoring `NaN` values.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dnanasumors( N, x, strideX )`][@stdlib/blas/ext/base/dnanasumors]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of absolute values (_L1_ norm) of double-precision floating-point strided array elements, ignoring `NaN` values and using ordinary recursive summation.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dnannsum( N, x, strideX, out, strideOut )`][@stdlib/blas/ext/base/dnannsum]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of double-precision floating-point strided array elements, ignoring `NaN` values.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dnannsumkbn( N, x, strideX, out, strideOut )`][@stdlib/blas/ext/base/dnannsumkbn]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of double-precision floating-point strided array elements, ignoring `NaN` values and using an improved Kahan–Babuška algorithm.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dnannsumkbn2( N, x, strideX, out, strideOut )`][@stdlib/blas/ext/base/dnannsumkbn2]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of double-precision floating-point strided array elements, ignoring `NaN` values and using a second-order iterative Kahan–Babuška algorithm.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dnannsumors( N, x, strideX, out, strideOut )`][@stdlib/blas/ext/base/dnannsumors]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of double-precision floating-point strided array elements, ignoring `NaN` values and using ordinary recursive summation.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dnannsumpw( N, x, strideX, out, strideOut )`][@stdlib/blas/ext/base/dnannsumpw]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of double-precision floating-point strided array elements, ignoring `NaN` values and using pairwise summation.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dnansum( N, x, strideX )`][@stdlib/blas/ext/base/dnansum]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of double-precision floating-point strided array elements, ignoring `NaN` values.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dnansumkbn( N, x, strideX )`][@stdlib/blas/ext/base/dnansumkbn]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of double-precision floating-point strided array elements, ignoring `NaN` values and using an improved Kahan–Babuška algorithm.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dnansumkbn2( N, x, strideX )`][@stdlib/blas/ext/base/dnansumkbn2]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of double-precision floating-point strided array elements, ignoring `NaN` values and using a second-order iterative Kahan–Babuška algorithm.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dnansumors( N, x, strideX )`][@stdlib/blas/ext/base/dnansumors]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of double-precision floating-point strided array elements, ignoring `NaN` values and using ordinary recursive summation.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dnansumpw( N, x, strideX )`][@stdlib/blas/ext/base/dnansumpw]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of double-precision floating-point strided array elements, ignoring `NaN` values and using pairwise summation.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`drev( N, x, strideX )`][@stdlib/blas/ext/base/drev]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ereverse a double-precision floating-point strided array in-place.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dsapxsum( N, alpha, x, strideX )`][@stdlib/blas/ext/base/dsapxsum]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003eadd a scalar constant to each single-precision floating-point strided array element, and compute the sum using extended accumulation and returning an extended precision result.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dsapxsumpw( N, alpha, x, strideX )`][@stdlib/blas/ext/base/dsapxsumpw]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003eadd a constant to each single-precision floating-point strided array element, and compute the sum using pairwise summation with extended accumulation and returning an extended precision result.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dsnannsumors( N, x, strideX, out, strideOut )`][@stdlib/blas/ext/base/dsnannsumors]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of single-precision floating-point strided array elements, ignoring `NaN` values, using ordinary recursive summation with extended accumulation, and returning an extended precision result.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dsnansum( N, x, strideX )`][@stdlib/blas/ext/base/dsnansum]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of single-precision floating-point strided array elements, ignoring `NaN` values, using extended accumulation, and returning an extended precision result.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dsnansumors( N, x, strideX )`][@stdlib/blas/ext/base/dsnansumors]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of single-precision floating-point strided array elements, ignoring `NaN` values, using ordinary recursive summation with extended accumulation, and returning an extended precision result.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dsnansumpw( N, x, strideX )`][@stdlib/blas/ext/base/dsnansumpw]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of single-precision floating-point strided array elements, ignoring `NaN` values, using pairwise summation with extended accumulation, and returning an extended precision result.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dsort2hp( N, order, x, strideX, y, strideY )`][@stdlib/blas/ext/base/dsort2hp]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003esimultaneously sort two double-precision floating-point strided arrays based on the sort order of the first array using heapsort.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dsort2ins( N, order, x, strideX, y, strideY )`][@stdlib/blas/ext/base/dsort2ins]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003esimultaneously sort two double-precision floating-point strided arrays based on the sort order of the first array using insertion sort.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dsort2sh( N, order, x, strideX, y, strideY )`][@stdlib/blas/ext/base/dsort2sh]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003esimultaneously sort two double-precision floating-point strided arrays based on the sort order of the first array using Shellsort.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dsorthp( N, order, x, strideX )`][@stdlib/blas/ext/base/dsorthp]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003esort a double-precision floating-point strided array using heapsort.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dsortins( N, order, x, strideX )`][@stdlib/blas/ext/base/dsortins]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003esort a double-precision floating-point strided array using insertion sort.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dsortsh( N, order, x, stride )`][@stdlib/blas/ext/base/dsortsh]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003esort a double-precision floating-point strided array using Shellsort.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dssum( N, x, strideX )`][@stdlib/blas/ext/base/dssum]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of single-precision floating-point strided array elements using extended accumulation and returning an extended precision result.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dssumors( N, x, strideX )`][@stdlib/blas/ext/base/dssumors]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of single-precision floating-point strided array elements using ordinary recursive summation with extended accumulation and returning an extended precision result.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dssumpw( N, x, strideX )`][@stdlib/blas/ext/base/dssumpw]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of single-precision floating-point strided array elements using pairwise summation with extended accumulation and returning an extended precision result.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dsum( N, x, strideX )`][@stdlib/blas/ext/base/dsum]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of double-precision floating-point strided array elements.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dsumkbn( N, x, strideX )`][@stdlib/blas/ext/base/dsumkbn]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of double-precision floating-point strided array elements using an improved Kahan–Babuška algorithm.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dsumkbn2( N, x, strideX )`][@stdlib/blas/ext/base/dsumkbn2]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of double-precision floating-point strided array elements using a second-order iterative Kahan–Babuška algorithm.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dsumors( N, x, strideX )`][@stdlib/blas/ext/base/dsumors]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of double-precision floating-point strided array elements using ordinary recursive summation.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`dsumpw( N, x, strideX )`][@stdlib/blas/ext/base/dsumpw]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of double-precision floating-point strided array elements using pairwise summation.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`gapx( N, alpha, x, strideX )`][@stdlib/blas/ext/base/gapx]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003eadd a scalar constant to each element in a strided array.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`gapxsum( N, alpha, x, strideX )`][@stdlib/blas/ext/base/gapxsum]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003eadd a scalar constant to each strided array element and compute the sum.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`gapxsumkbn( N, alpha, x, strideX )`][@stdlib/blas/ext/base/gapxsumkbn]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003eadd a scalar constant to each strided array element and compute the sum using an improved Kahan–Babuška algorithm.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`gapxsumkbn2( N, alpha, x, strideX )`][@stdlib/blas/ext/base/gapxsumkbn2]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003eadd a scalar constant to each strided array element and compute the sum using a second-order iterative Kahan–Babuška algorithm.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`gapxsumors( N, alpha, x, strideX )`][@stdlib/blas/ext/base/gapxsumors]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003eadd a scalar constant to each strided array element and compute the sum using ordinary recursive summation.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`gapxsumpw( N, alpha, x, strideX )`][@stdlib/blas/ext/base/gapxsumpw]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003eadd a scalar constant to each strided array element and compute the sum using pairwise summation.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`gasumpw( N, x, strideX )`][@stdlib/blas/ext/base/gasumpw]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of absolute values (_L1_ norm) of strided array elements using pairwise summation.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`gcusum( N, sum, x, strideX, y, strideY )`][@stdlib/blas/ext/base/gcusum]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the cumulative sum of strided array elements.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`gcusumkbn( N, sum, x, strideX, y, strideY )`][@stdlib/blas/ext/base/gcusumkbn]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the cumulative sum of strided array elements using an improved Kahan–Babuška algorithm.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`gcusumkbn2( N, sum, x, strideX, y, strideY )`][@stdlib/blas/ext/base/gcusumkbn2]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the cumulative sum of strided array elements using a second-order iterative Kahan–Babuška algorithm.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`gcusumors( N, sum, x, strideX, y, strideY )`][@stdlib/blas/ext/base/gcusumors]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the cumulative sum of strided array elements using ordinary recursive summation.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`gcusumpw( N, sum, x, strideX, y, strideY )`][@stdlib/blas/ext/base/gcusumpw]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the cumulative sum of strided array elements using pairwise summation.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`gfillBy( N, x, strideX, clbk[, thisArg] )`][@stdlib/blas/ext/base/gfill-by]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003efill a strided array according to a provided callback function.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`gfill( N, alpha, x, strideX )`][@stdlib/blas/ext/base/gfill]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003efill a strided array with a specified scalar constant.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`gnannsumkbn( N, x, strideX, out, strideOut )`][@stdlib/blas/ext/base/gnannsumkbn]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of strided array elements, ignoring `NaN` values and using an improved Kahan–Babuška algorithm.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`gnannsumpw( N, x, strideX, out, strideOut )`][@stdlib/blas/ext/base/gnannsumpw]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of strided array elements, ignoring `NaN` values and using pairwise summation.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`gnansum( N, x, strideX )`][@stdlib/blas/ext/base/gnansum]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of strided array elements, ignoring `NaN` values.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`gnansumkbn( N, x, strideX )`][@stdlib/blas/ext/base/gnansumkbn]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of strided array elements, ignoring `NaN` values and using an improved Kahan–Babuška algorithm.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`gnansumkbn2( N, x, strideX )`][@stdlib/blas/ext/base/gnansumkbn2]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of strided array elements, ignoring `NaN` values and using a second-order iterative Kahan–Babuška algorithm.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`gnansumors( N, x, strideX )`][@stdlib/blas/ext/base/gnansumors]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of strided array elements, ignoring `NaN` values and using ordinary recursive summation.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`gnansumpw( N, x, strideX )`][@stdlib/blas/ext/base/gnansumpw]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of strided array elements, ignoring `NaN` values and using pairwise summation.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`grev( N, x, strideX )`][@stdlib/blas/ext/base/grev]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ereverse a strided array in-place.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`gsort2hp( N, order, x, strideX, y, strideY )`][@stdlib/blas/ext/base/gsort2hp]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003esimultaneously sort two strided arrays based on the sort order of the first array using heapsort.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`gsort2ins( N, order, x, strideX, y, strideY )`][@stdlib/blas/ext/base/gsort2ins]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003esimultaneously sort two strided arrays based on the sort order of the first array using insertion sort.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`gsort2sh( N, order, x, strideX, y, strideY )`][@stdlib/blas/ext/base/gsort2sh]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003esimultaneously sort two strided arrays based on the sort order of the first array using Shellsort.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`gsorthp( N, order, x, strideX )`][@stdlib/blas/ext/base/gsorthp]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003esort a strided array using heapsort.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`gsortins( N, order, x, strideX )`][@stdlib/blas/ext/base/gsortins]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003esort a strided array using insertion sort.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`gsortsh( N, order, x, strideX )`][@stdlib/blas/ext/base/gsortsh]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003esort a strided array using Shellsort.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`gsum( N, x, strideX )`][@stdlib/blas/ext/base/gsum]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of strided array elements.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`gsumkbn( N, x, strideX )`][@stdlib/blas/ext/base/gsumkbn]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of strided array elements using an improved Kahan–Babuška algorithm.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`gsumkbn2( N, x, strideX )`][@stdlib/blas/ext/base/gsumkbn2]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of strided array elements using a second-order iterative Kahan–Babuška algorithm.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`gsumors( N, x, strideX )`][@stdlib/blas/ext/base/gsumors]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of strided array elements using ordinary recursive summation.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`gsumpw( N, x, strideX )`][@stdlib/blas/ext/base/gsumpw]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of strided array elements using pairwise summation.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`ndarray`][@stdlib/blas/ext/base/ndarray]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ebase ndarray extended BLAS functions.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`sapx( N, alpha, x, strideX )`][@stdlib/blas/ext/base/sapx]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003eadd a scalar constant to each element in a single-precision floating-point strided array.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`sapxsum( N, alpha, x, strideX )`][@stdlib/blas/ext/base/sapxsum]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003eadd a scalar constant to each single-precision floating-point strided array element and compute the sum.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`sapxsumkbn( N, alpha, x, strideX )`][@stdlib/blas/ext/base/sapxsumkbn]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003eadd a scalar constant to each single-precision floating-point strided array element and compute the sum using an improved Kahan–Babuška algorithm.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`sapxsumkbn2( N, alpha, x, strideX )`][@stdlib/blas/ext/base/sapxsumkbn2]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003eadd a scalar constant to each single-precision floating-point strided array element and compute the sum using a second-order iterative Kahan–Babuška algorithm.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`sapxsumors( N, alpha, x, strideX )`][@stdlib/blas/ext/base/sapxsumors]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003eadd a scalar constant to each single-precision floating-point strided array element and compute the sum using ordinary recursive summation.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`sapxsumpw( N, alpha, x, strideX )`][@stdlib/blas/ext/base/sapxsumpw]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003eadd a scalar constant to each single-precision floating-point strided array element and compute the sum using pairwise summation.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`sasumpw( N, x, strideX )`][@stdlib/blas/ext/base/sasumpw]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of absolute values (_L1_ norm) of single-precision floating-point strided array elements using pairwise summation.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`scusum( N, sum, x, strideX, y, strideY )`][@stdlib/blas/ext/base/scusum]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the cumulative sum of single-precision floating-point strided array elements.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`scusumkbn( N, sum, x, strideX, y, strideY )`][@stdlib/blas/ext/base/scusumkbn]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the cumulative sum of single-precision floating-point strided array elements using an improved Kahan–Babuška algorithm.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`scusumkbn2( N, sum, x, strideX, y, strideY )`][@stdlib/blas/ext/base/scusumkbn2]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the cumulative sum of single-precision floating-point strided array elements using a second-order iterative Kahan–Babuška algorithm.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`scusumors( N, sum, x, strideX, y, strideY )`][@stdlib/blas/ext/base/scusumors]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the cumulative sum of single-precision floating-point strided array elements using ordinary recursive summation.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`scusumpw( N, sum, x, strideX, y, strideY )`][@stdlib/blas/ext/base/scusumpw]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the cumulative sum of single-precision floating-point strided array elements using pairwise summation.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`sdsapxsum( N, alpha, x, strideX )`][@stdlib/blas/ext/base/sdsapxsum]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003eadd a scalar constant to each single-precision floating-point strided array element and compute the sum using extended accumulation.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`sdsapxsumpw( N, alpha, x, strideX )`][@stdlib/blas/ext/base/sdsapxsumpw]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003eadd a scalar constant to each single-precision floating-point strided array element and compute the sum using pairwise summation with extended accumulation.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`sdsnansum( N, x, strideX )`][@stdlib/blas/ext/base/sdsnansum]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of single-precision floating-point strided array elements, ignoring `NaN` values and using extended accumulation.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`sdsnansumpw( N, x, strideX )`][@stdlib/blas/ext/base/sdsnansumpw]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of single-precision floating-point strided array elements, ignoring `NaN` values and using pairwise summation with extended accumulation.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`sdssum( N, x, strideX )`][@stdlib/blas/ext/base/sdssum]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of single-precision floating-point strided array elements using extended accumulation.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`sdssumpw( N, x, strideX )`][@stdlib/blas/ext/base/sdssumpw]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of single-precision floating-point strided array elements using pairwise summation with extended accumulation.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`sfill( N, alpha, x, strideX )`][@stdlib/blas/ext/base/sfill]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003efill a single-precision floating-point strided array with a specified scalar constant.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`snansum( N, x, strideX )`][@stdlib/blas/ext/base/snansum]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of single-precision floating-point strided array elements, ignoring `NaN` values.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`snansumkbn( N, x, strideX )`][@stdlib/blas/ext/base/snansumkbn]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of single-precision floating-point strided array elements, ignoring `NaN` values and using an improved Kahan–Babuška algorithm.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`snansumkbn2( N, x, strideX )`][@stdlib/blas/ext/base/snansumkbn2]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of single-precision floating-point strided array elements, ignoring `NaN` values and using a second-order iterative Kahan–Babuška algorithm.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`snansumors( N, x, strideX )`][@stdlib/blas/ext/base/snansumors]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of single-precision floating-point strided array elements, ignoring `NaN` values and using ordinary recursive summation.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`snansumpw( N, x, strideX )`][@stdlib/blas/ext/base/snansumpw]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of single-precision floating-point strided array elements, ignoring `NaN` values and using pairwise summation.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`srev( N, x, strideX )`][@stdlib/blas/ext/base/srev]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ereverse a single-precision floating-point strided array in-place.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`ssort2hp( N, order, x, strideX, y, strideY )`][@stdlib/blas/ext/base/ssort2hp]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003esimultaneously sort two single-precision floating-point strided arrays based on the sort order of the first array using heapsort.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`ssort2ins( N, order, x, strideX, y, strideY )`][@stdlib/blas/ext/base/ssort2ins]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003esimultaneously sort two single-precision floating-point strided arrays based on the sort order of the first array using insertion sort.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`ssort2sh( N, order, x, strideX, y, strideY )`][@stdlib/blas/ext/base/ssort2sh]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003esimultaneously sort two single-precision floating-point strided arrays based on the sort order of the first array using Shellsort.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`ssorthp( N, order, x, stride )`][@stdlib/blas/ext/base/ssorthp]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003esort a single-precision floating-point strided array using heapsort.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`ssortins( N, order, x, stride )`][@stdlib/blas/ext/base/ssortins]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003esort a single-precision floating-point strided array using insertion sort.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`ssortsh( N, order, x, stride )`][@stdlib/blas/ext/base/ssortsh]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003esort a single-precision floating-point strided array using Shellsort.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`ssum( N, x, strideX )`][@stdlib/blas/ext/base/ssum]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of single-precision floating-point strided array elements.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`ssumkbn( N, x, strideX )`][@stdlib/blas/ext/base/ssumkbn]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of single-precision floating-point strided array elements using an improved Kahan–Babuška algorithm.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`ssumkbn2( N, x, strideX )`][@stdlib/blas/ext/base/ssumkbn2]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of single-precision floating-point strided array elements using a second-order iterative Kahan–Babuška algorithm.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`ssumors( N, x, strideX )`][@stdlib/blas/ext/base/ssumors]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of single-precision floating-point strided array elements using ordinary recursive summation.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`ssumpw( N, x, strideX )`][@stdlib/blas/ext/base/ssumpw]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of single-precision floating-point strided array elements using pairwise summation.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`wasm`][@stdlib/blas/ext/base/wasm]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003eextensions to basic linear algebra subprograms (BLAS) compiled to WebAssembly.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`zfill( N, alpha, x, strideX )`][@stdlib/blas/ext/base/zfill]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003efill a double-precision complex floating-point strided array with a specified scalar constant.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`zsum( N, x, strideX )`][@stdlib/blas/ext/base/zsum]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of double-precision complex floating-point strided array elements.\u003c/span\u003e\n-   \u003cspan class=\"signature\"\u003e[`zsumkbn( N, x, strideX )`][@stdlib/blas/ext/base/zsumkbn]\u003c/span\u003e\u003cspan class=\"delimiter\"\u003e: \u003c/span\u003e\u003cspan class=\"description\"\u003ecalculate the sum of double-precision complex floating-point strided array elements using an improved Kahan–Babuška algorithm.\u003c/span\u003e\n\n\u003c/div\u003e\n\n\u003c!-- \u003c/toc\u003e --\u003e\n\n\u003c/section\u003e\n\n\u003c!-- /.usage --\u003e\n\n\u003c!-- Package notes. Make sure to keep an empty line after the `section` element and another before the `/section` close. --\u003e\n\n\u003csection class=\"notes\"\u003e\n\n\u003c/section\u003e\n\n\u003c!-- /.notes --\u003e\n\n\u003csection class=\"examples\"\u003e\n\n## Examples\n\n\u003c!-- TODO: better examples --\u003e\n\n\u003c!-- eslint no-undef: \"error\" --\u003e\n\n```javascript\nvar objectKeys = require( '@stdlib/utils-keys' );\nvar ns = require( '@stdlib/blas-ext-base' );\n\nconsole.log( objectKeys( ns ) );\n```\n\n\u003c/section\u003e\n\n\u003c!-- /.examples --\u003e\n\n\u003c!-- Section for related `stdlib` packages. Do not manually edit this section, as it is automatically populated. --\u003e\n\n\u003csection class=\"related\"\u003e\n\n\u003c/section\u003e\n\n\u003c!-- /.related --\u003e\n\n\u003c!-- Section for all links. Make sure to keep an empty line after the `section` element and another before the `/section` close. --\u003e\n\n\n\u003csection class=\"main-repo\" \u003e\n\n* * *\n\n## Notice\n\nThis package is part of [stdlib][stdlib], a standard library for JavaScript and Node.js, with an emphasis on numerical and scientific computing. The library provides a collection of robust, high performance libraries for mathematics, statistics, streams, utilities, and more.\n\nFor more information on the project, filing bug reports and feature requests, and guidance on how to develop [stdlib][stdlib], see the main project [repository][stdlib].\n\n#### Community\n\n[![Chat][chat-image]][chat-url]\n\n---\n\n## License\n\nSee [LICENSE][stdlib-license].\n\n\n## Copyright\n\nCopyright \u0026copy; 2016-2025. The Stdlib [Authors][stdlib-authors].\n\n\u003c/section\u003e\n\n\u003c!-- /.stdlib --\u003e\n\n\u003c!-- Section for all links. Make sure to keep an empty line after the `section` element and another before the `/section` close. --\u003e\n\n\u003csection class=\"links\"\u003e\n\n[npm-image]: http://img.shields.io/npm/v/@stdlib/blas-ext-base.svg\n[npm-url]: https://npmjs.org/package/@stdlib/blas-ext-base\n\n[test-image]: https://github.com/stdlib-js/blas-ext-base/actions/workflows/test.yml/badge.svg?branch=main\n[test-url]: https://github.com/stdlib-js/blas-ext-base/actions/workflows/test.yml?query=branch:main\n\n[coverage-image]: https://img.shields.io/codecov/c/github/stdlib-js/blas-ext-base/main.svg\n[coverage-url]: https://codecov.io/github/stdlib-js/blas-ext-base?branch=main\n\n\u003c!--\n\n[dependencies-image]: https://img.shields.io/david/stdlib-js/blas-ext-base.svg\n[dependencies-url]: https://david-dm.org/stdlib-js/blas-ext-base/main\n\n--\u003e\n\n[chat-image]: https://img.shields.io/gitter/room/stdlib-js/stdlib.svg\n[chat-url]: https://app.gitter.im/#/room/#stdlib-js_stdlib:gitter.im\n\n[stdlib]: https://github.com/stdlib-js/stdlib\n\n[stdlib-authors]: https://github.com/stdlib-js/stdlib/graphs/contributors\n\n[umd]: https://github.com/umdjs/umd\n[es-module]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Modules\n\n[deno-url]: https://github.com/stdlib-js/blas-ext-base/tree/deno\n[deno-readme]: https://github.com/stdlib-js/blas-ext-base/blob/deno/README.md\n[umd-url]: https://github.com/stdlib-js/blas-ext-base/tree/umd\n[umd-readme]: https://github.com/stdlib-js/blas-ext-base/blob/umd/README.md\n[esm-url]: https://github.com/stdlib-js/blas-ext-base/tree/esm\n[esm-readme]: https://github.com/stdlib-js/blas-ext-base/blob/esm/README.md\n[branches-url]: https://github.com/stdlib-js/blas-ext-base/blob/main/branches.md\n\n[stdlib-license]: https://raw.githubusercontent.com/stdlib-js/blas-ext-base/main/LICENSE\n\n\u003c!-- \u003ctoc-links\u003e --\u003e\n\n[@stdlib/blas/ext/base/cfill]: https://github.com/stdlib-js/blas-ext-base-cfill\n\n[@stdlib/blas/ext/base/csum]: https://github.com/stdlib-js/blas-ext-base-csum\n\n[@stdlib/blas/ext/base/csumkbn]: https://github.com/stdlib-js/blas-ext-base-csumkbn\n\n[@stdlib/blas/ext/base/dapx]: https://github.com/stdlib-js/blas-ext-base-dapx\n\n[@stdlib/blas/ext/base/dapxsum]: https://github.com/stdlib-js/blas-ext-base-dapxsum\n\n[@stdlib/blas/ext/base/dapxsumkbn]: https://github.com/stdlib-js/blas-ext-base-dapxsumkbn\n\n[@stdlib/blas/ext/base/dapxsumkbn2]: https://github.com/stdlib-js/blas-ext-base-dapxsumkbn2\n\n[@stdlib/blas/ext/base/dapxsumors]: https://github.com/stdlib-js/blas-ext-base-dapxsumors\n\n[@stdlib/blas/ext/base/dapxsumpw]: https://github.com/stdlib-js/blas-ext-base-dapxsumpw\n\n[@stdlib/blas/ext/base/dasumpw]: https://github.com/stdlib-js/blas-ext-base-dasumpw\n\n[@stdlib/blas/ext/base/dcusum]: https://github.com/stdlib-js/blas-ext-base-dcusum\n\n[@stdlib/blas/ext/base/dcusumkbn]: https://github.com/stdlib-js/blas-ext-base-dcusumkbn\n\n[@stdlib/blas/ext/base/dcusumkbn2]: https://github.com/stdlib-js/blas-ext-base-dcusumkbn2\n\n[@stdlib/blas/ext/base/dcusumors]: https://github.com/stdlib-js/blas-ext-base-dcusumors\n\n[@stdlib/blas/ext/base/dcusumpw]: https://github.com/stdlib-js/blas-ext-base-dcusumpw\n\n[@stdlib/blas/ext/base/dfill]: https://github.com/stdlib-js/blas-ext-base-dfill\n\n[@stdlib/blas/ext/base/dnanasum]: https://github.com/stdlib-js/blas-ext-base-dnanasum\n\n[@stdlib/blas/ext/base/dnanasumors]: https://github.com/stdlib-js/blas-ext-base-dnanasumors\n\n[@stdlib/blas/ext/base/dnannsum]: https://github.com/stdlib-js/blas-ext-base-dnannsum\n\n[@stdlib/blas/ext/base/dnannsumkbn]: https://github.com/stdlib-js/blas-ext-base-dnannsumkbn\n\n[@stdlib/blas/ext/base/dnannsumkbn2]: https://github.com/stdlib-js/blas-ext-base-dnannsumkbn2\n\n[@stdlib/blas/ext/base/dnannsumors]: https://github.com/stdlib-js/blas-ext-base-dnannsumors\n\n[@stdlib/blas/ext/base/dnannsumpw]: https://github.com/stdlib-js/blas-ext-base-dnannsumpw\n\n[@stdlib/blas/ext/base/dnansum]: https://github.com/stdlib-js/blas-ext-base-dnansum\n\n[@stdlib/blas/ext/base/dnansumkbn]: https://github.com/stdlib-js/blas-ext-base-dnansumkbn\n\n[@stdlib/blas/ext/base/dnansumkbn2]: https://github.com/stdlib-js/blas-ext-base-dnansumkbn2\n\n[@stdlib/blas/ext/base/dnansumors]: https://github.com/stdlib-js/blas-ext-base-dnansumors\n\n[@stdlib/blas/ext/base/dnansumpw]: https://github.com/stdlib-js/blas-ext-base-dnansumpw\n\n[@stdlib/blas/ext/base/drev]: https://github.com/stdlib-js/blas-ext-base-drev\n\n[@stdlib/blas/ext/base/dsapxsum]: https://github.com/stdlib-js/blas-ext-base-dsapxsum\n\n[@stdlib/blas/ext/base/dsapxsumpw]: https://github.com/stdlib-js/blas-ext-base-dsapxsumpw\n\n[@stdlib/blas/ext/base/dsnannsumors]: https://github.com/stdlib-js/blas-ext-base-dsnannsumors\n\n[@stdlib/blas/ext/base/dsnansum]: https://github.com/stdlib-js/blas-ext-base-dsnansum\n\n[@stdlib/blas/ext/base/dsnansumors]: https://github.com/stdlib-js/blas-ext-base-dsnansumors\n\n[@stdlib/blas/ext/base/dsnansumpw]: https://github.com/stdlib-js/blas-ext-base-dsnansumpw\n\n[@stdlib/blas/ext/base/dsort2hp]: https://github.com/stdlib-js/blas-ext-base-dsort2hp\n\n[@stdlib/blas/ext/base/dsort2ins]: https://github.com/stdlib-js/blas-ext-base-dsort2ins\n\n[@stdlib/blas/ext/base/dsort2sh]: https://github.com/stdlib-js/blas-ext-base-dsort2sh\n\n[@stdlib/blas/ext/base/dsorthp]: https://github.com/stdlib-js/blas-ext-base-dsorthp\n\n[@stdlib/blas/ext/base/dsortins]: https://github.com/stdlib-js/blas-ext-base-dsortins\n\n[@stdlib/blas/ext/base/dsortsh]: https://github.com/stdlib-js/blas-ext-base-dsortsh\n\n[@stdlib/blas/ext/base/dssum]: https://github.com/stdlib-js/blas-ext-base-dssum\n\n[@stdlib/blas/ext/base/dssumors]: https://github.com/stdlib-js/blas-ext-base-dssumors\n\n[@stdlib/blas/ext/base/dssumpw]: https://github.com/stdlib-js/blas-ext-base-dssumpw\n\n[@stdlib/blas/ext/base/dsum]: https://github.com/stdlib-js/blas-ext-base-dsum\n\n[@stdlib/blas/ext/base/dsumkbn]: https://github.com/stdlib-js/blas-ext-base-dsumkbn\n\n[@stdlib/blas/ext/base/dsumkbn2]: https://github.com/stdlib-js/blas-ext-base-dsumkbn2\n\n[@stdlib/blas/ext/base/dsumors]: https://github.com/stdlib-js/blas-ext-base-dsumors\n\n[@stdlib/blas/ext/base/dsumpw]: https://github.com/stdlib-js/blas-ext-base-dsumpw\n\n[@stdlib/blas/ext/base/gapx]: https://github.com/stdlib-js/blas-ext-base-gapx\n\n[@stdlib/blas/ext/base/gapxsum]: https://github.com/stdlib-js/blas-ext-base-gapxsum\n\n[@stdlib/blas/ext/base/gapxsumkbn]: https://github.com/stdlib-js/blas-ext-base-gapxsumkbn\n\n[@stdlib/blas/ext/base/gapxsumkbn2]: https://github.com/stdlib-js/blas-ext-base-gapxsumkbn2\n\n[@stdlib/blas/ext/base/gapxsumors]: https://github.com/stdlib-js/blas-ext-base-gapxsumors\n\n[@stdlib/blas/ext/base/gapxsumpw]: https://github.com/stdlib-js/blas-ext-base-gapxsumpw\n\n[@stdlib/blas/ext/base/gasumpw]: https://github.com/stdlib-js/blas-ext-base-gasumpw\n\n[@stdlib/blas/ext/base/gcusum]: https://github.com/stdlib-js/blas-ext-base-gcusum\n\n[@stdlib/blas/ext/base/gcusumkbn]: https://github.com/stdlib-js/blas-ext-base-gcusumkbn\n\n[@stdlib/blas/ext/base/gcusumkbn2]: https://github.com/stdlib-js/blas-ext-base-gcusumkbn2\n\n[@stdlib/blas/ext/base/gcusumors]: https://github.com/stdlib-js/blas-ext-base-gcusumors\n\n[@stdlib/blas/ext/base/gcusumpw]: https://github.com/stdlib-js/blas-ext-base-gcusumpw\n\n[@stdlib/blas/ext/base/gfill-by]: https://github.com/stdlib-js/blas-ext-base-gfill-by\n\n[@stdlib/blas/ext/base/gfill]: https://github.com/stdlib-js/blas-ext-base-gfill\n\n[@stdlib/blas/ext/base/gnannsumkbn]: https://github.com/stdlib-js/blas-ext-base-gnannsumkbn\n\n[@stdlib/blas/ext/base/gnannsumpw]: https://github.com/stdlib-js/blas-ext-base-gnannsumpw\n\n[@stdlib/blas/ext/base/gnansum]: https://github.com/stdlib-js/blas-ext-base-gnansum\n\n[@stdlib/blas/ext/base/gnansumkbn]: https://github.com/stdlib-js/blas-ext-base-gnansumkbn\n\n[@stdlib/blas/ext/base/gnansumkbn2]: https://github.com/stdlib-js/blas-ext-base-gnansumkbn2\n\n[@stdlib/blas/ext/base/gnansumors]: https://github.com/stdlib-js/blas-ext-base-gnansumors\n\n[@stdlib/blas/ext/base/gnansumpw]: https://github.com/stdlib-js/blas-ext-base-gnansumpw\n\n[@stdlib/blas/ext/base/grev]: https://github.com/stdlib-js/blas-ext-base-grev\n\n[@stdlib/blas/ext/base/gsort2hp]: https://github.com/stdlib-js/blas-ext-base-gsort2hp\n\n[@stdlib/blas/ext/base/gsort2ins]: https://github.com/stdlib-js/blas-ext-base-gsort2ins\n\n[@stdlib/blas/ext/base/gsort2sh]: https://github.com/stdlib-js/blas-ext-base-gsort2sh\n\n[@stdlib/blas/ext/base/gsorthp]: https://github.com/stdlib-js/blas-ext-base-gsorthp\n\n[@stdlib/blas/ext/base/gsortins]: https://github.com/stdlib-js/blas-ext-base-gsortins\n\n[@stdlib/blas/ext/base/gsortsh]: https://github.com/stdlib-js/blas-ext-base-gsortsh\n\n[@stdlib/blas/ext/base/gsum]: https://github.com/stdlib-js/blas-ext-base-gsum\n\n[@stdlib/blas/ext/base/gsumkbn]: https://github.com/stdlib-js/blas-ext-base-gsumkbn\n\n[@stdlib/blas/ext/base/gsumkbn2]: https://github.com/stdlib-js/blas-ext-base-gsumkbn2\n\n[@stdlib/blas/ext/base/gsumors]: https://github.com/stdlib-js/blas-ext-base-gsumors\n\n[@stdlib/blas/ext/base/gsumpw]: https://github.com/stdlib-js/blas-ext-base-gsumpw\n\n[@stdlib/blas/ext/base/ndarray]: https://github.com/stdlib-js/blas-ext-base-ndarray\n\n[@stdlib/blas/ext/base/sapx]: https://github.com/stdlib-js/blas-ext-base-sapx\n\n[@stdlib/blas/ext/base/sapxsum]: https://github.com/stdlib-js/blas-ext-base-sapxsum\n\n[@stdlib/blas/ext/base/sapxsumkbn]: https://github.com/stdlib-js/blas-ext-base-sapxsumkbn\n\n[@stdlib/blas/ext/base/sapxsumkbn2]: https://github.com/stdlib-js/blas-ext-base-sapxsumkbn2\n\n[@stdlib/blas/ext/base/sapxsumors]: https://github.com/stdlib-js/blas-ext-base-sapxsumors\n\n[@stdlib/blas/ext/base/sapxsumpw]: https://github.com/stdlib-js/blas-ext-base-sapxsumpw\n\n[@stdlib/blas/ext/base/sasumpw]: https://github.com/stdlib-js/blas-ext-base-sasumpw\n\n[@stdlib/blas/ext/base/scusum]: https://github.com/stdlib-js/blas-ext-base-scusum\n\n[@stdlib/blas/ext/base/scusumkbn]: https://github.com/stdlib-js/blas-ext-base-scusumkbn\n\n[@stdlib/blas/ext/base/scusumkbn2]: https://github.com/stdlib-js/blas-ext-base-scusumkbn2\n\n[@stdlib/blas/ext/base/scusumors]: https://github.com/stdlib-js/blas-ext-base-scusumors\n\n[@stdlib/blas/ext/base/scusumpw]: https://github.com/stdlib-js/blas-ext-base-scusumpw\n\n[@stdlib/blas/ext/base/sdsapxsum]: https://github.com/stdlib-js/blas-ext-base-sdsapxsum\n\n[@stdlib/blas/ext/base/sdsapxsumpw]: https://github.com/stdlib-js/blas-ext-base-sdsapxsumpw\n\n[@stdlib/blas/ext/base/sdsnansum]: https://github.com/stdlib-js/blas-ext-base-sdsnansum\n\n[@stdlib/blas/ext/base/sdsnansumpw]: https://github.com/stdlib-js/blas-ext-base-sdsnansumpw\n\n[@stdlib/blas/ext/base/sdssum]: https://github.com/stdlib-js/blas-ext-base-sdssum\n\n[@stdlib/blas/ext/base/sdssumpw]: https://github.com/stdlib-js/blas-ext-base-sdssumpw\n\n[@stdlib/blas/ext/base/sfill]: https://github.com/stdlib-js/blas-ext-base-sfill\n\n[@stdlib/blas/ext/base/snansum]: https://github.com/stdlib-js/blas-ext-base-snansum\n\n[@stdlib/blas/ext/base/snansumkbn]: https://github.com/stdlib-js/blas-ext-base-snansumkbn\n\n[@stdlib/blas/ext/base/snansumkbn2]: https://github.com/stdlib-js/blas-ext-base-snansumkbn2\n\n[@stdlib/blas/ext/base/snansumors]: https://github.com/stdlib-js/blas-ext-base-snansumors\n\n[@stdlib/blas/ext/base/snansumpw]: https://github.com/stdlib-js/blas-ext-base-snansumpw\n\n[@stdlib/blas/ext/base/srev]: https://github.com/stdlib-js/blas-ext-base-srev\n\n[@stdlib/blas/ext/base/ssort2hp]: https://github.com/stdlib-js/blas-ext-base-ssort2hp\n\n[@stdlib/blas/ext/base/ssort2ins]: https://github.com/stdlib-js/blas-ext-base-ssort2ins\n\n[@stdlib/blas/ext/base/ssort2sh]: https://github.com/stdlib-js/blas-ext-base-ssort2sh\n\n[@stdlib/blas/ext/base/ssorthp]: https://github.com/stdlib-js/blas-ext-base-ssorthp\n\n[@stdlib/blas/ext/base/ssortins]: https://github.com/stdlib-js/blas-ext-base-ssortins\n\n[@stdlib/blas/ext/base/ssortsh]: https://github.com/stdlib-js/blas-ext-base-ssortsh\n\n[@stdlib/blas/ext/base/ssum]: https://github.com/stdlib-js/blas-ext-base-ssum\n\n[@stdlib/blas/ext/base/ssumkbn]: https://github.com/stdlib-js/blas-ext-base-ssumkbn\n\n[@stdlib/blas/ext/base/ssumkbn2]: https://github.com/stdlib-js/blas-ext-base-ssumkbn2\n\n[@stdlib/blas/ext/base/ssumors]: https://github.com/stdlib-js/blas-ext-base-ssumors\n\n[@stdlib/blas/ext/base/ssumpw]: https://github.com/stdlib-js/blas-ext-base-ssumpw\n\n[@stdlib/blas/ext/base/wasm]: https://github.com/stdlib-js/blas-ext-base-wasm\n\n[@stdlib/blas/ext/base/zfill]: https://github.com/stdlib-js/blas-ext-base-zfill\n\n[@stdlib/blas/ext/base/zsum]: https://github.com/stdlib-js/blas-ext-base-zsum\n\n[@stdlib/blas/ext/base/zsumkbn]: https://github.com/stdlib-js/blas-ext-base-zsumkbn\n\n\u003c!-- \u003c/toc-links\u003e --\u003e\n\n\u003c/section\u003e\n\n\u003c!-- /.links --\u003e\n","funding_links":["https://github.com/sponsors/stdlib-js","https://opencollective.com/stdlib","https://tidelift.com/funding/github/npm/@stdlib/stdlib"],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fstdlib-js%2Fblas-ext-base","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fstdlib-js%2Fblas-ext-base","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fstdlib-js%2Fblas-ext-base/lists"}