Skip to content
Draft
Show file tree
Hide file tree
Changes from all commits
Commits
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
286 changes: 286 additions & 0 deletions lib/node_modules/@stdlib/blas/ext/base/dminheapify/README.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,286 @@
<!--

@license Apache-2.0

Copyright (c) 2026 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.

-->

# dminheapify

> Convert a double-precision floating-point strided array to a min-heap.

<section class="usage">

## Usage

```javascript
var dminheapify = require( '@stdlib/blas/ext/base/dminheapify' );
```

#### dminheapify( N, x, strideX )

Converts a double-precision floating-point strided array to a min-heap.

```javascript
var Float64Array = require( '@stdlib/array/float64' );

var x = new Float64Array( [ 7.0, 5.0, 3.0, 1.0, 9.0 ] );

dminheapify( 5, x, 1 );
// x => <Float64Array>[ 1.0, 5.0, 3.0, 7.0, 9.0 ]
```

The function has the following parameters:

- **N**: number of indexed elements.
- **x**: input [`Float64Array`][@stdlib/array/float64].
- **strideX**: stride length.

The `N` and stride parameters determine which elements in the strided array are accessed at runtime. For example, to heapify elements occupying every other position:

```javascript
var Float64Array = require( '@stdlib/array/float64' );

var x = new Float64Array( [ 7.0, 0.0, 5.0, 0.0, 3.0, 0.0, 1.0, 0.0, 9.0 ] );

dminheapify( 5, x, 2 );
// x => <Float64Array>[ 1.0, 0.0, 5.0, 0.0, 3.0, 0.0, 7.0, 0.0, 9.0 ]
```

Note that indexing is relative to the first index. To introduce an offset, use [`typed array`][mdn-typed-array] views.

```javascript
var Float64Array = require( '@stdlib/array/float64' );

// Initial array...
var x0 = new Float64Array( [ 0.0, 7.0, 5.0, 3.0, 1.0, 9.0 ] );

// Create an offset view...
var x1 = new Float64Array( x0.buffer, x0.BYTES_PER_ELEMENT*1 ); // start at 2nd element

dminheapify( 5, x1, 1 );
// x0 => <Float64Array>[ 0.0, 1.0, 5.0, 3.0, 7.0, 9.0 ]
```

#### dminheapify.ndarray( N, x, strideX, offsetX )

Converts a double-precision floating-point strided array to a min-heap using alternative indexing semantics.

```javascript
var Float64Array = require( '@stdlib/array/float64' );

var x = new Float64Array( [ 7.0, 5.0, 3.0, 1.0, 9.0 ] );

dminheapify.ndarray( 5, x, 1, 0 );
// x => <Float64Array>[ 1.0, 5.0, 3.0, 7.0, 9.0 ]
```

The function has the following additional parameters:

- **offsetX**: starting index.

While [`typed array`][mdn-typed-array] views mandate a view offset based on the underlying buffer, the offset parameter supports indexing semantics based on a starting index. For example, to heapify the last five elements:

```javascript
var Float64Array = require( '@stdlib/array/float64' );

var x = new Float64Array( [ 0.0, 7.0, 5.0, 3.0, 1.0, 9.0 ] );

dminheapify.ndarray( 5, x, 1, 1 );
// x => <Float64Array>[ 0.0, 1.0, 5.0, 3.0, 7.0, 9.0 ]
```

</section>

<!-- /.usage -->

<section class="notes">

## Notes

- If `N <= 0`, both functions return `x` unchanged.
- The input strided array is modified **in-place** (i.e., the input strided array is **mutated**).
- The min-heap algorithm is sensitive to the presence of `NaN` values. Since `NaN` comparisons always return `false`, if `NaN` values are present in the input array, the results may be unpredictable.

</section>

<!-- /.notes -->

<section class="examples">

## Examples

<!-- eslint no-undef: "error" -->

```javascript
var uniform = require( '@stdlib/random/array/uniform' );
var dminheapify = require( '@stdlib/blas/ext/base/dminheapify' );

// Generate a random unordered array:
var x = uniform( 10, 0.0, 100.0, {
'dtype': 'float64'
});
console.log( x );

// Convert to a min-heap:
dminheapify( x.length, x, 1 );
console.log( x );
```

</section>

<!-- /.examples -->

<!-- C interface documentation. -->

* * *

<section class="c">

## C APIs

<!-- Section to include introductory text. Make sure to keep an empty line after the intro `section` element and another before the `/section` close. -->

<section class="intro">

</section>

<!-- /.intro -->

<!-- C usage documentation. -->

<section class="usage">

### Usage

```c
#include "stdlib/blas/ext/base/dminheapify.h"
```

#### stdlib_strided_dminheapify( N, \*X, strideX )

Converts a double-precision floating-point strided array to a min-heap.

```c
double x[] = { 7.0, 5.0, 3.0, 1.0, 9.0 };

stdlib_strided_dminheapify( 5, x, 1 );
```

The function accepts the following arguments:

- **N**: `[in] CBLAS_INT` number of indexed elements.
- **X**: `[inout] double*` input array.
- **strideX**: `[in] CBLAS_INT` stride length.

```c
void stdlib_strided_dminheapify( const CBLAS_INT N, double *X, const CBLAS_INT strideX );
```

#### stdlib_strided_dminheapify_ndarray( N, \*X, strideX, offsetX )

Converts a double-precision floating-point strided array to a min-heap using alternative indexing semantics.

```c
double x[] = { 7.0, 5.0, 3.0, 1.0, 9.0 };

stdlib_strided_dminheapify_ndarray( 5, x, 1, 0 );
```

The function accepts the following arguments:

- **N**: `[in] CBLAS_INT` number of indexed elements.
- **X**: `[inout] double*` input array.
- **strideX**: `[in] CBLAS_INT` stride length.
- **offsetX**: `[in] CBLAS_INT` starting index.

```c
void stdlib_strided_dminheapify_ndarray( const CBLAS_INT N, double *X, const CBLAS_INT strideX, const CBLAS_INT offsetX );
```

</section>

<!-- /.usage -->

<!-- C API usage notes. Make sure to keep an empty line after the `section` element and another before the `/section` close. -->

<section class="notes">

</section>

<!-- /.notes -->

<!-- C API usage examples. -->

<section class="examples">

### Examples

```c
#include "stdlib/blas/ext/base/dminheapify.h"
#include <stdio.h>

int main( void ) {
// Create an unordered array:
double x[] = { 7.0, 5.0, 3.0, 1.0, 9.0 };

// Specify the number of indexed elements:
const int N = 5;

// Specify a stride:
const int strideX = 1;

// Convert the array to a min-heap:
stdlib_strided_dminheapify( N, x, strideX );

// Print the result:
for ( int i = 0; i < 5; i++ ) {
printf( "x[ %i ] = %lf\n", i, x[ i ] );
}
}
```

</section>

<!-- /.examples -->

</section>

<!-- /.c -->

<!-- Section for related `stdlib` packages. Do not manually edit this section, as it is automatically populated. -->

<section class="related">

</section>

<!-- /.related -->

<!-- Section for all links. Make sure to keep an empty line after the `section` element and another before the `/section` close. -->

<section class="links">

[@stdlib/array/float64]: https://github.com/stdlib-js/stdlib/tree/develop/lib/node_modules/%40stdlib/array/float64

[mdn-typed-array]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/TypedArray

<!-- <related-links> -->

<!-- </related-links> -->

</section>

<!-- /.links -->
Original file line number Diff line number Diff line change
@@ -0,0 +1,103 @@
/**
* @license Apache-2.0
*
* Copyright (c) 2026 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 bench = require( '@stdlib/bench' );
var uniform = require( '@stdlib/random/array/uniform' );
var isnan = require( '@stdlib/math/base/assert/is-nan' );
var pow = require( '@stdlib/math/base/special/pow' );
var format = require( '@stdlib/string/format' );
var pkg = require( './../package.json' ).name;
var dminheapify = require( './../lib/dminheapify.js' );


// VARIABLES //

var options = {
'dtype': 'float64'
};


// FUNCTIONS //

/**
* Create a benchmark function.
*
* @private
* @param {PositiveInteger} len - array length
* @returns {Function} benchmark function
*/
function createBenchmark( len ) {
var x = uniform( len, 0.0, 100.0, options );
return benchmark;

/**
* Benchmark function.
*
* @private
* @param {Benchmark} b - benchmark instance
*/
function benchmark( b ) {
var out;
var i;

b.tic();
for ( i = 0; i < b.iterations; i++ ) {
out = dminheapify( len, x, ( i%2 ) ? 1 : -1 );
if ( isnan( out[ 0 ] ) ) {
b.fail( 'should not return NaN' );
}
}
b.toc();
if ( isnan( out[ 0 ] ) ) {
b.fail( 'should not return NaN' );
}
b.pass( 'benchmark finished' );
b.end();
}
}


// MAIN //

/**
* Main execution sequence.
*
* @private
*/
function main() {
var len;
var min;
var max;
var f;
var i;

min = 1; // 10^min
max = 6; // 10^max

for ( i = min; i <= max; i++ ) {
len = pow( 10, i );
f = createBenchmark( len );
bench( format( '%s:len=%d', pkg, len ), f );
}
}

main();
Loading
Loading