npm package: @stdlib/stats-strided-distances-deuclidean
Description: Compute the Euclidean distance between two double-precision floating-point strided arrays.
Author: The Stdlib Authors
Latest version: 0.1.1

<!--

@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.

-->


<details>
  <summary>
    About stdlib...
  </summary>
  <p>We 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.</p>
  <p>The 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.</p>
  <p>When 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.</p>
  <p>To join us in bringing numerical computing to the web, get started by checking us out on <a href="https://github.com/stdlib-js/stdlib">GitHub</a>, and please consider <a href="https://opencollective.com/stdlib">financially supporting stdlib</a>. We greatly appreciate your continued support!</p>
</details>

# deuclidean

[![NPM version][npm-image]][npm-url] [![Build Status][test-image]][test-url] [![Coverage Status][coverage-image]][coverage-url] <!-- [![dependencies][dependencies-image]][dependencies-url] -->

> Compute the Euclidean distance between two double-precision floating-point strided arrays.

<section class="intro">

The [Euclidean distance][wikipedia-euclidean-distance] is defined as

<!-- <equation class="equation" label="eq:euclidean_distance" align="center" raw="d(X,Y) = \left\lVert X - Y \right\rVert = \sqrt{\sum_{i=0}^{N-1} (y_i - x_i)^2}" alt="Equation for the Euclidean distance."> -->

<!-- </equation> -->

where `x_i` and `y_i` are the _ith_ components of vectors **X** and **Y**, respectively.

</section>

<!-- /.intro -->

<section class="installation">

## Installation

```bash
npm install @stdlib/stats-strided-distances-deuclidean
```

</section>

<section class="usage">

## Usage

```javascript
var deuclidean = require( '@stdlib/stats-strided-distances-deuclidean' );
```

#### deuclidean( N, x, strideX, y, strideY )

Computes the Euclidean distance between two double-precision floating-point strided arrays.

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

var x = new Float64Array( [ 1.0, 2.0, 2.0, -7.0, -2.0, 3.0, 4.0, 2.0 ] );
var y = new Float64Array( [ 2.0, 1.0, 2.0, 1.0, -2.0, 2.0, 3.0, 4.0 ] );

var z = deuclidean( x.length, x, 1, y, 1 );
// returns ~8.485
```

The function has the following parameters:

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

The `N` and stride parameters determine which elements in the strided arrays are accessed at runtime. For example, to calculate the Euclidean distance between every other element in `x` and the first `N` elements of `y` in reverse order,

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

var x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ] );
var y = new Float64Array( [ 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 ] );

var z = deuclidean( 3, x, 2, y, -1 );
// returns ~4.472
```

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

<!-- eslint-disable stdlib/capitalized-comments -->

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

// Initial arrays...
var x0 = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ] );
var y0 = new Float64Array( [ 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );

// Create offset views...
var x1 = new Float64Array( x0.buffer, x0.BYTES_PER_ELEMENT*1 ); // start at 2nd element
var y1 = new Float64Array( y0.buffer, y0.BYTES_PER_ELEMENT*3 ); // start at 4th element

var z = deuclidean( 3, x1, 1, y1, 1 );
// returns ~13.856
```

#### deuclidean.ndarray( N, x, strideX, offsetX, y, strideY, offsetY )

Computes the Euclidean distance between two double-precision floating-point strided arrays using alternative indexing semantics.

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

var x = new Float64Array( [ 1.0, 2.0, 2.0, -7.0, -2.0, 3.0, 4.0, 2.0 ] );
var y = new Float64Array( [ 2.0, 1.0, 2.0, 1.0, -2.0, 2.0, 3.0, 4.0 ] );

var z = deuclidean.ndarray( x.length, x, 1, 0, y, 1, 0 );
// returns ~8.485
```

The function has the following additional parameters:

-   **offsetX**: starting index for `x`.
-   **offsetY**: starting index for `y`.

While [`typed array`][mdn-typed-array] views mandate a view offset based on the underlying buffer, the offset parameters support indexing semantics based on starting indices. For example, to calculate the Euclidean distance between every other element in `x` starting from the second element with the last 3 elements in `y` in reverse order

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

var x = new Float64Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ] );
var y = new Float64Array( [ 7.0, 8.0, 9.0, 10.0, 11.0, 12.0 ] );

var z = deuclidean.ndarray( 3, x, 2, 1, y, -1, y.length-1 );
// returns ~12.845
```

</section>

<!-- /.usage -->

<section class="notes">

## Notes

-   If `N <= 0`, both functions return `NaN`.

</section>

<!-- /.notes -->

<section class="examples">

## Examples

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

```javascript
var discreteUniform = require( '@stdlib/random-array-discrete-uniform' );
var deuclidean = require( '@stdlib/stats-strided-distances-deuclidean' );

var opts = {
    'dtype': 'float64'
};
var x = discreteUniform( 10, 0, 100, opts );
console.log( x );

var y = discreteUniform( x.length, 0, 10, opts );
console.log( y );

var out = deuclidean.ndarray( x.length, x, 1, 0, y, -1, y.length-1 );
console.log( out );
```

</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/stats/strided/distances/deuclidean.h"
```

#### stdlib_strided_deuclidean( N, \*X, strideX, \*Y, strideY )

Computes the Euclidean distance between two double-precision floating-point strided arrays.

```c
const double x[] = { 1.0, 2.0, 2.0, -7.0, -2.0, 3.0, 4.0, 2.0 };
const double y[] = { 2.0, 1.0, 2.0, 1.0, -2.0, 2.0, 3.0, 4.0 };

double v = stdlib_strided_deuclidean( 8, x, 1, y, 1 );
// returns ~8.485
```

The function accepts the following arguments:

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

```c
double stdlib_strided_deuclidean( const CBLAS_INT N, const double *X, const CBLAS_INT strideX, const double *Y, const CBLAS_INT strideY );
```

<!--lint disable maximum-heading-length-->

#### stdlib_strided_deuclidean_ndarray( N, \*X, strideX, offsetX, \*Y, strideY, offsetY )

<!--lint enable maximum-heading-length-->

Computes the Euclidean distance between two double-precision floating-point strided arrays using alternative indexing semantics.

```c
const double x[] = { 4.0, 2.0, -3.0, 5.0, -1.0 };
const double y[] = { 2.0, 6.0, -1.0, -4.0, 8.0 };

double v = stdlib_strided_deuclidean_ndarray( 5, x, -1, 4, y, -1, 4 );
// returns ~13.638
```

The function accepts the following arguments:

-   **N**: `[in] CBLAS_INT` number of indexed elements.
-   **X**: `[in] double*` first input array.
-   **strideX**: `[in] CBLAS_INT` stride length of `X`.
-   **offsetX**: `[in] CBLAS_INT` starting index for `X`.
-   **Y**: `[in] double*` second input array.
-   **strideY**: `[in] CBLAS_INT` stride length of `Y`.
-   **offsetY**: `[in] CBLAS_INT` starting index for `Y`.

```c
double stdlib_strided_deuclidean_ndarray( const CBLAS_INT N, const double *X, const CBLAS_INT strideX, const CBLAS_INT offsetX, const double *Y, const CBLAS_INT strideY, const CBLAS_INT offsetY );
```

</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/stats/strided/distances/deuclidean.h"
#include <stdio.h>

int main( void ) {
    // Create strided arrays:
    const double x[] = { 1.0, -2.0, 3.0, -4.0, 5.0, -6.0, 7.0, -8.0 };
    const double y[] = { 1.0, -2.0, 3.0, -4.0, 5.0, -6.0, 7.0, -8.0 };

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

    // Specify strides:
    const int strideX = 1;
    const int strideY = -1;

    // Compute the Euclidean distance between `x` and `y`:
    double d = stdlib_strided_deuclidean( N, x, strideX, y, strideY );

    // Print the result:
    printf( "Euclidean distance: %lf\n", d );

    // Compute the Euclidean distance between `x` and `y` with offsets:
    d = stdlib_strided_deuclidean_ndarray( N, x, strideX, 0, y, strideY, N-1 );

    // Print the result:
    printf( "Euclidean distance: %lf\n", d );
}
```

</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="main-repo" >

* * *

## Notice

This 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.

For 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].

#### Community

[![Chat][chat-image]][chat-url]

---

## License

See [LICENSE][stdlib-license].


## Copyright

Copyright &copy; 2016-2026. The Stdlib [Authors][stdlib-authors].

</section>

<!-- /.stdlib -->

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

<section class="links">

[npm-image]: http://img.shields.io/npm/v/@stdlib/stats-strided-distances-deuclidean.svg
[npm-url]: https://npmjs.org/package/@stdlib/stats-strided-distances-deuclidean

[test-image]: https://github.com/stdlib-js/stats-strided-distances-deuclidean/actions/workflows/test.yml/badge.svg?branch=v0.1.1
[test-url]: https://github.com/stdlib-js/stats-strided-distances-deuclidean/actions/workflows/test.yml?query=branch:v0.1.1

[coverage-image]: https://img.shields.io/codecov/c/github/stdlib-js/stats-strided-distances-deuclidean/main.svg
[coverage-url]: https://codecov.io/github/stdlib-js/stats-strided-distances-deuclidean?branch=main

<!--

[dependencies-image]: https://img.shields.io/david/stdlib-js/stats-strided-distances-deuclidean.svg
[dependencies-url]: https://david-dm.org/stdlib-js/stats-strided-distances-deuclidean/main

-->

[chat-image]: https://img.shields.io/badge/zulip-join_chat-brightgreen.svg
[chat-url]: https://stdlib.zulipchat.com

[stdlib]: https://github.com/stdlib-js/stdlib

[stdlib-authors]: https://github.com/stdlib-js/stdlib/graphs/contributors

[umd]: https://github.com/umdjs/umd
[es-module]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Modules

[deno-url]: https://github.com/stdlib-js/stats-strided-distances-deuclidean/tree/deno
[deno-readme]: https://github.com/stdlib-js/stats-strided-distances-deuclidean/blob/deno/README.md
[umd-url]: https://github.com/stdlib-js/stats-strided-distances-deuclidean/tree/umd
[umd-readme]: https://github.com/stdlib-js/stats-strided-distances-deuclidean/blob/umd/README.md
[esm-url]: https://github.com/stdlib-js/stats-strided-distances-deuclidean/tree/esm
[esm-readme]: https://github.com/stdlib-js/stats-strided-distances-deuclidean/blob/esm/README.md
[branches-url]: https://github.com/stdlib-js/stats-strided-distances-deuclidean/blob/main/branches.md

[stdlib-license]: https://raw.githubusercontent.com/stdlib-js/stats-strided-distances-deuclidean/main/LICENSE

[@stdlib/array/float64]: https://www.npmjs.com/package/@stdlib/array-float64

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

[wikipedia-euclidean-distance]: https://en.wikipedia.org/wiki/Euclidean_distance

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

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

</section>

<!-- /.links -->