From 893c1ea374a037e6052f35877e733960003bdc24 Mon Sep 17 00:00:00 2001 From: headlessNode Date: Thu, 30 Oct 2025 17:26:48 +0500 Subject: [PATCH] test: add tests for complete test code coverage --- type: pre_commit_static_analysis_report description: Results of running static analysis checks when committing changes. report: - task: lint_filenames status: passed - task: lint_editorconfig status: passed - task: lint_markdown status: na - task: lint_package_json status: na - task: lint_repl_help status: na - task: lint_javascript_src status: passed - task: lint_javascript_cli status: na - task: lint_javascript_examples status: na - task: lint_javascript_tests status: passed - task: lint_javascript_benchmarks status: na - task: lint_python status: na - task: lint_r status: na - task: lint_c_src status: na - task: lint_c_examples status: na - task: lint_c_benchmarks status: na - task: lint_c_tests_fixtures status: na - task: lint_shell status: na - task: lint_typescript_declarations status: passed - task: lint_typescript_tests status: na - task: lint_license_headers status: passed --- --- .../@stdlib/ndarray/base/count-if/lib/main.js | 2 +- .../ndarray/base/count-if/test/test.10d.js | 2655 +++++++++++++++++ .../ndarray/base/count-if/test/test.1d.js | 202 ++ .../ndarray/base/count-if/test/test.2d.js | 1285 ++++++++ .../ndarray/base/count-if/test/test.3d.js | 1479 +++++++++ .../ndarray/base/count-if/test/test.4d.js | 1577 ++++++++++ .../ndarray/base/count-if/test/test.5d.js | 1771 +++++++++++ .../ndarray/base/count-if/test/test.6d.js | 1917 ++++++++++++ .../ndarray/base/count-if/test/test.7d.js | 2063 +++++++++++++ .../ndarray/base/count-if/test/test.8d.js | 2209 ++++++++++++++ .../ndarray/base/count-if/test/test.9d.js | 2435 +++++++++++++++ .../ndarray/base/count-if/test/test.js | 18 + .../ndarray/base/count-if/test/test.nd.js | 1040 +++++++ 13 files changed, 18652 insertions(+), 1 deletion(-) create mode 100644 lib/node_modules/@stdlib/ndarray/base/count-if/test/test.10d.js create mode 100644 lib/node_modules/@stdlib/ndarray/base/count-if/test/test.1d.js create mode 100644 lib/node_modules/@stdlib/ndarray/base/count-if/test/test.2d.js create mode 100644 lib/node_modules/@stdlib/ndarray/base/count-if/test/test.3d.js create mode 100644 lib/node_modules/@stdlib/ndarray/base/count-if/test/test.4d.js create mode 100644 lib/node_modules/@stdlib/ndarray/base/count-if/test/test.5d.js create mode 100644 lib/node_modules/@stdlib/ndarray/base/count-if/test/test.6d.js create mode 100644 lib/node_modules/@stdlib/ndarray/base/count-if/test/test.7d.js create mode 100644 lib/node_modules/@stdlib/ndarray/base/count-if/test/test.8d.js create mode 100644 lib/node_modules/@stdlib/ndarray/base/count-if/test/test.9d.js create mode 100644 lib/node_modules/@stdlib/ndarray/base/count-if/test/test.nd.js diff --git a/lib/node_modules/@stdlib/ndarray/base/count-if/lib/main.js b/lib/node_modules/@stdlib/ndarray/base/count-if/lib/main.js index 5695a2388adc..debb122e9e6f 100644 --- a/lib/node_modules/@stdlib/ndarray/base/count-if/lib/main.js +++ b/lib/node_modules/@stdlib/ndarray/base/count-if/lib/main.js @@ -193,7 +193,7 @@ function countIf( arrays, predicate, thisArg ) { } // Check whether we were provided an empty ndarray... if ( numel( shx ) === 0 ) { - return true; + return 0; } // Determine whether we can avoid blocked iteration... if ( ndims <= MAX_DIMS && iterationOrder( x.strides ) !== 0 ) { diff --git a/lib/node_modules/@stdlib/ndarray/base/count-if/test/test.10d.js b/lib/node_modules/@stdlib/ndarray/base/count-if/test/test.10d.js new file mode 100644 index 000000000000..0fd984a21a06 --- /dev/null +++ b/lib/node_modules/@stdlib/ndarray/base/count-if/test/test.10d.js @@ -0,0 +1,2655 @@ +/** +* @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 tape = require( 'tape' ); +var zeros = require( '@stdlib/array/zeros' ); +var ones = require( '@stdlib/array/ones' ); +var real = require( '@stdlib/complex/float64/real' ); +var imag = require( '@stdlib/complex/float64/imag' ); +var Complex128Array = require( '@stdlib/array/complex128' ); +var numel = require( '@stdlib/ndarray/base/numel' ); +var shape2strides = require( '@stdlib/ndarray/base/shape2strides' ); +var strides2offset = require( '@stdlib/ndarray/base/strides2offset' ); +var ndarray = require( '@stdlib/ndarray/ctor' ); +var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' ); +var countIf = require( './../lib' ); + + +// TESTS // + +tape( 'main export is a function', function test( t ) { + t.ok( true, __filename ); + t.strictEqual( typeof countIf, 'function', 'main export is a function'); + t.end(); +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (row-major, singleton dimensions)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 4, 1, 1, 1, 1, 1, 1, 1, 1, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (row-major, singleton dimensions, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 4, 1, 1, 1, 1, 1, 1, 1, 1, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function supports specifying the callback execution context (row-major, contiguous)', function test( t ) { + var expected; + var indices; + var values; + var arrays; + var actual; + var ctx; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 1, 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + indices = []; + values = []; + arrays = []; + + ctx = { + 'count': 0 + }; + actual = countIf( [ x ], clbk, ctx ); + + t.strictEqual( actual, 8, 'returns expected value' ); + t.strictEqual( ctx.count, 8, 'returns expected value' ); + + expected = [ + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0 + ]; + t.deepEqual( values, expected, 'returns expected value' ); + + expected = [ + [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ], + [ 0, 0, 0, 0, 0, 0, 0, 0, 1, 0 ], + [ 0, 0, 0, 0, 0, 0, 1, 0, 0, 0 ], + [ 0, 0, 0, 0, 0, 0, 1, 0, 1, 0 ], + [ 0, 0, 0, 0, 1, 0, 0, 0, 0, 0 ], + [ 0, 0, 0, 0, 1, 0, 0, 0, 1, 0 ], + [ 0, 0, 0, 0, 1, 0, 1, 0, 0, 0 ], + [ 0, 0, 0, 0, 1, 0, 1, 0, 1, 0 ] + ]; + t.deepEqual( indices, expected, 'returns expected value' ); + + expected = [ + x, + x, + x, + x, + x, + x, + x, + x + ]; + t.deepEqual( arrays, expected, 'returns expected value' ); + + t.end(); + + function clbk( v, idx, arr ) { + this.count += 1; // eslint-disable-line no-invalid-this + values.push( v ); + indices.push( idx ); + arrays.push( arr ); + return v !== 0.0; + } +}); + +tape( 'the function supports specifying the callback execution context (row-major, contiguous, accessors)', function test( t ) { + var expected; + var indices; + var values; + var arrays; + var actual; + var xbuf; + var ctx; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 1, 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + indices = []; + values = []; + arrays = []; + + ctx = { + 'count': 0 + }; + actual = countIf( [ x ], clbk, ctx ); + + t.strictEqual( actual, 8, 'returns expected value' ); + t.strictEqual( ctx.count, 8, 'returns expected value' ); + + expected = [ + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ] + ]; + t.deepEqual( values, expected, 'returns expected value' ); + + expected = [ + [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ], + [ 0, 0, 0, 0, 0, 0, 0, 0, 1, 0 ], + [ 0, 0, 0, 0, 0, 0, 1, 0, 0, 0 ], + [ 0, 0, 0, 0, 0, 0, 1, 0, 1, 0 ], + [ 0, 0, 0, 0, 1, 0, 0, 0, 0, 0 ], + [ 0, 0, 0, 0, 1, 0, 0, 0, 1, 0 ], + [ 0, 0, 0, 0, 1, 0, 1, 0, 0, 0 ], + [ 0, 0, 0, 0, 1, 0, 1, 0, 1, 0 ] + ]; + t.deepEqual( indices, expected, 'returns expected value' ); + + expected = [ + x, + x, + x, + x, + x, + x, + x, + x + ]; + t.deepEqual( arrays, expected, 'returns expected value' ); + + t.end(); + + function clbk( v, idx, arr ) { + this.count += 1; // eslint-disable-line no-invalid-this + values.push( [ real( v ), imag( v ) ] ); + indices.push( idx ); + arrays.push( arr ); + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (row-major, contiguous)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 1, 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (row-major, contiguous, negative strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 1, 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ -8, -8, -8, -8, -4, -4, -2, -2, -1, -1 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, same sign strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 1, 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ 16, 16, 16, 16, 8, 8, 4, 4, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, mixed sign strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 1, 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ 16, 16, 16, 16, 8, -8, -4, -4, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ bsize*2, 1, 2, 1, 2, 1, 1, 1, 1, 1 ]; + st = [ -8, 8, 4, 4, 2, 2, 2, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, bsize*2, 1, 1, 2, 1, 1, 1, 1, 1 ]; + st = [ bsize*8, -4, -4, 4, 2, 2, 2, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, bsize*2, 1, 2, 1, 1, 1, 1, 1 ]; + st = [ bsize*8, -bsize*8, -4, 4, 2, 2, 2, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, bsize*2, 1, 1, 1, 1, 1, 1 ]; + st = [ bsize*8, -bsize*8, -bsize*4, 2, 2, 2, 2, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, bsize*2, 1, 1, 1, 1, 1 ]; + st = [ bsize*8, -bsize*8, -bsize*4, bsize*4, 2, 2, 2, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, bsize*2, 1, 1, 1, 1 ]; + st = [ bsize*8, -bsize*8, -bsize*4, bsize*4, bsize*4, 2, 2, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, 1, bsize*2, 1, 1, 1 ]; + st = [ bsize*8, -bsize*8, -bsize*4, bsize*4, bsize*4, bsize*4, 2, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, 1, 1, bsize*2, 1, 1 ]; + st = [ + bsize*8, + -bsize*8, + -bsize*4, + bsize*4, + bsize*4, + bsize*4, + bsize*4, + 2, + 2, + 2 + ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, 1, 1, 1, bsize*2, 1 ]; + st = [ + bsize*8, + -bsize*8, + -bsize*4, + bsize*4, + bsize*4, + bsize*4, + bsize*4, + bsize*4, + 2, + 2 + ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, 1, 1, 1, 1, bsize*2 ]; + st = [ + bsize*8, + -bsize*8, + -bsize*4, + bsize*4, + bsize*4, + bsize*4, + bsize*4, + bsize*4, + bsize*4, + 2 + ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (row-major, contiguous, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 1, 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (row-major, contiguous, negative strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 1, 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ -8, -8, -8, -8, -4, -4, -2, -2, -1, -1 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, same sign strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 1, 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ 16, 16, 16, 16, 8, 8, 4, 4, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, mixed sign strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 1, 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ -16, -16, -16, -16, -8, 8, 4, 4, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ bsize*2, 1, 2, 1, 2, 1, 1, 1, 1, 1 ]; + st = [ -8, 8, 4, 4, 2, 2, 2, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, bsize*2, 1, 2, 1, 1, 1, 1, 1, 1 ]; + st = [ bsize*8, -4, -4, 2, 2, 2, 2, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, bsize*2, 1, 2, 1, 1, 1, 1, 1 ]; + st = [ bsize*8, -bsize*8, -4, 4, 2, 2, 2, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, bsize*2, 1, 1, 1, 1, 1, 1 ]; + st = [ bsize*8, -bsize*8, -bsize*4, 2, 2, 2, 2, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, bsize*2, 1, 1, 1, 1, 1 ]; + st = [ bsize*8, -bsize*8, -bsize*4, bsize*4, 2, 2, 2, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, bsize*2, 1, 1, 1, 1 ]; + st = [ bsize*8, -bsize*8, -bsize*4, bsize*4, bsize*4, 2, 2, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, 1, bsize*2, 1, 1, 1 ]; + st = [ bsize*8, -bsize*8, -bsize*4, bsize*4, bsize*4, bsize*4, 2, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, 1, 1, bsize*2, 1, 1 ]; + st = [ + bsize*8, + -bsize*8, + -bsize*4, + bsize*4, + bsize*4, + bsize*4, + bsize*4, + 2, + 2, + 2 + ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, 1, 1, 1, bsize*2, 1 ]; + st = [ + bsize*8, + -bsize*8, + -bsize*4, + bsize*4, + bsize*4, + bsize*4, + bsize*4, + bsize*4, + 2, + 2 + ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, 1, 1, 1, 1, bsize*2 ]; + st = [ + bsize*8, + -bsize*8, + -bsize*4, + bsize*4, + bsize*4, + bsize*4, + bsize*4, + bsize*4, + bsize*4, + 2 + ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (column-major, singleton dimensions)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 4 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (column-major, singleton dimensions, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 4 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function supports specifying the callback execution context (column-major, contiguous)', function test( t ) { + var expected; + var indices; + var values; + var arrays; + var actual; + var ctx; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 1, 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + indices = []; + values = []; + arrays = []; + + ctx = { + 'count': 0 + }; + actual = countIf( [ x ], clbk, ctx ); + + t.strictEqual( actual, 8, 'returns expected value' ); + t.strictEqual( ctx.count, 8, 'returns expected value' ); + + expected = [ + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0 + ]; + t.deepEqual( values, expected, 'returns expected value' ); + + expected = [ + [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ], + [ 0, 0, 0, 0, 1, 0, 0, 0, 0, 0 ], + [ 0, 0, 0, 0, 0, 0, 1, 0, 0, 0 ], + [ 0, 0, 0, 0, 1, 0, 1, 0, 0, 0 ], + [ 0, 0, 0, 0, 0, 0, 0, 0, 1, 0 ], + [ 0, 0, 0, 0, 1, 0, 0, 0, 1, 0 ], + [ 0, 0, 0, 0, 0, 0, 1, 0, 1, 0 ], + [ 0, 0, 0, 0, 1, 0, 1, 0, 1, 0 ] + ]; + t.deepEqual( indices, expected, 'returns expected value' ); + + expected = [ + x, + x, + x, + x, + x, + x, + x, + x + ]; + t.deepEqual( arrays, expected, 'returns expected value' ); + + t.end(); + + function clbk( v, idx, arr ) { + this.count += 1; // eslint-disable-line no-invalid-this + values.push( v ); + indices.push( idx ); + arrays.push( arr ); + return v !== 0.0; + } +}); + +tape( 'the function supports specifying the callback execution context (column-major, contiguous, accessors)', function test( t ) { + var expected; + var indices; + var values; + var arrays; + var actual; + var xbuf; + var ctx; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 1, 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + indices = []; + values = []; + arrays = []; + + ctx = { + 'count': 0 + }; + actual = countIf( [ x ], clbk, ctx ); + + t.strictEqual( actual, 8, 'returns expected value' ); + t.strictEqual( ctx.count, 8, 'returns expected value' ); + + expected = [ + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ] + ]; + t.deepEqual( values, expected, 'returns expected value' ); + + expected = [ + [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ], + [ 0, 0, 0, 0, 1, 0, 0, 0, 0, 0 ], + [ 0, 0, 0, 0, 0, 0, 1, 0, 0, 0 ], + [ 0, 0, 0, 0, 1, 0, 1, 0, 0, 0 ], + [ 0, 0, 0, 0, 0, 0, 0, 0, 1, 0 ], + [ 0, 0, 0, 0, 1, 0, 0, 0, 1, 0 ], + [ 0, 0, 0, 0, 0, 0, 1, 0, 1, 0 ], + [ 0, 0, 0, 0, 1, 0, 1, 0, 1, 0 ] + ]; + t.deepEqual( indices, expected, 'returns expected value' ); + + expected = [ + x, + x, + x, + x, + x, + x, + x, + x + ]; + t.deepEqual( arrays, expected, 'returns expected value' ); + + t.end(); + + function clbk( v, idx, arr ) { + this.count += 1; // eslint-disable-line no-invalid-this + values.push( [ real( v ), imag( v ) ] ); + indices.push( idx ); + arrays.push( arr ); + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (column-major, contiguous)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 1, 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (column-major, contiguous, negative strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 1, 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ -1, -1, -1, -1, -1, -2, -2, 4, -4, 8 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, same sign strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 1, 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ 2, 2, 2, 2, 2, 4, 4, 8, 8, 16 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, mixed sign strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 1, 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ -2, -2, -2, -2, -2, -4, 4, 8, 8, 16 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ bsize*2, 1, 2, 1, 2, 1, 1, 1, 1, 1 ]; + st = [ + 2, + bsize*4, + -bsize*4, + bsize*8, + bsize*8, + bsize*16, + bsize*16, + bsize*16, + bsize*16, + bsize*16 + ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, bsize*2, 1, 1, 2, 1, 1, 1, 1, 1 ]; + st = [ + 2, + -4, + bsize*8, + bsize*8, + bsize*8, + bsize*16, + bsize*16, + bsize*16, + bsize*16, + bsize*16 + ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, bsize*2, 1, 2, 1, 1, 1, 1, 1 ]; + st = [ + 2, + -4, + 4, + bsize*8, + bsize*8, + bsize*16, + bsize*16, + bsize*16, + bsize*16, + bsize*16 + ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 1, bsize*2, 2, 1, 1, 1, 1, 1 ]; + st = [ + -2, + -4, + 4, + 4, + bsize*8, + bsize*16, + bsize*16, + bsize*16, + bsize*16, + bsize*16 + ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, bsize*2, 1, 1, 1, 1, 1 ]; + st = [ -2, -4, 4, 8, 8, bsize*16, bsize*16, bsize*16, bsize*16, bsize*16 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, bsize*2, 1, 1, 1, 1 ]; + st = [ -2, -4, 4, 8, 8, 8, bsize*16, bsize*16, bsize*16, bsize*16 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, 1, bsize*2, 1, 1, 1 ]; + st = [ -2, -4, 4, 8, 8, 8, 8, bsize*16, bsize*16, bsize*16 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, 1, 1, bsize*2, 1, 1 ]; + st = [ -2, -4, 4, 8, 8, 8, 8, 8, bsize*16, bsize*16 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, 1, 1, 1, bsize*2, 1 ]; + st = [ -2, -4, 4, 8, 8, 8, 8, 8, 8, bsize*16 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, 1, 1, 1, 1, bsize*2 ]; + st = [ -2, -4, 4, 8, 8, 8, 8, 8, 8, 8 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (column-major, contiguous, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 1, 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (column-major, contiguous, negative strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 1, 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ -1, -1, -1, -1, -1, -2, -2, 4, 4, 8 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, same sign strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 1, 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ 2, 2, 2, 2, 2, 4, 4, 8, 8, 16 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, mixed sign strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 1, 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ 2, 2, 2, 2, 2, -4, 4, 8, 8, 16 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ bsize*2, 1, 2, 1, 2, 1, 1, 1, 1, 1 ]; + st = [ + -2, + -bsize*4, + bsize*4, + bsize*8, + bsize*8, + bsize*16, + bsize*16, + bsize*16, + bsize*16, + bsize*16 + ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, bsize*2, 1, 1, 2, 1, 1, 1, 1, 1 ]; + st = [ + 2, + -4, + bsize*8, + bsize*8, + bsize*8, + bsize*16, + bsize*16, + bsize*16, + bsize*16, + bsize*16 + ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, bsize*2, 1, 2, 1, 1, 1, 1, 1 ]; + st = [ + 2, + 4, + -4, + bsize*8, + bsize*8, + bsize*16, + bsize*16, + bsize*16, + bsize*16, + bsize*16 + ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 1, bsize*2, 2, 1, 1, 1, 1, 1 ]; + st = [ + 2, + 4, + -4, + 4, + bsize*8, + bsize*16, + bsize*16, + bsize*16, + bsize*16, + bsize*16 + ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, bsize*2, 1, 1, 1, 1, 1 ]; + st = [ 2, 4, -4, 8, 8, bsize*16, bsize*16, bsize*16, bsize*16, bsize*16 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, bsize*2, 1, 1, 1, 1 ]; + st = [ 2, 4, -4, 8, 8, 8, bsize*16, bsize*16, bsize*16, bsize*16 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, 1, bsize*2, 1, 1, 1 ]; + st = [ 2, 4, -4, 8, 8, 8, 8, bsize*16, bsize*16, bsize*16 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, 1, 1, bsize*2, 1, 1 ]; + st = [ 2, 4, -4, 8, 8, 8, 8, 8, bsize*16, bsize*16 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, 1, 1, 1, bsize*2, 1 ]; + st = [ 2, 4, -4, 8, 8, 8, 8, 8, 8, bsize*16 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 10-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, 1, 1, 1, 1, bsize*2 ]; + st = [ 2, 4, -4, 8, 8, 8, 8, 8, 8, 8 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); diff --git a/lib/node_modules/@stdlib/ndarray/base/count-if/test/test.1d.js b/lib/node_modules/@stdlib/ndarray/base/count-if/test/test.1d.js new file mode 100644 index 000000000000..32557faa66ab --- /dev/null +++ b/lib/node_modules/@stdlib/ndarray/base/count-if/test/test.1d.js @@ -0,0 +1,202 @@ +/** +* @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 tape = require( 'tape' ); +var ones = require( '@stdlib/array/ones' ); +var zeros = require( '@stdlib/array/zeros' ); +var real = require( '@stdlib/complex/float64/real' ); +var imag = require( '@stdlib/complex/float64/imag' ); +var Complex128Array = require( '@stdlib/array/complex128' ); +var ndarray = require( '@stdlib/ndarray/ctor' ); +var countIf = require( './../lib' ); + + +// TESTS // + +tape( 'main export is a function', function test( t ) { + t.ok( true, __filename ); + t.strictEqual( typeof countIf, 'function', 'main export is a function'); + t.end(); +}); + +tape( 'the function counts the number of elements in a 1-dimensional ndarray which pass a test implemented by a predicate function', function test( t ) { + var actual; + var x; + + x = ndarray( 'float64', zeros( 8, 'float64' ), [ 4 ], [ 2 ], 1, 'row-major' ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( 'float64', ones( 8, 'float64' ), [ 4 ], [ 2 ], 1, 'row-major' ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 1-dimensional ndarray which pass a test implemented by a predicate function (accessors)', function test( t ) { + var actual; + var xbuf; + var x; + + xbuf = zeros( 6*2, 'float64' ); + x = ndarray( 'complex128', new Complex128Array( xbuf ), [ 4 ], [ 1 ], 1, 'row-major' ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( 6*2, 'float64' ); + x = ndarray( 'complex128', new Complex128Array( xbuf ), [ 4 ], [ 1 ], 1, 'row-major' ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function supports specifying the callback execution context', function test( t ) { + var expected; + var indices; + var values; + var arrays; + var actual; + var ctx; + var x; + + x = new ndarray( 'float64', ones( 8, 'float64'), [ 4 ], [ 2 ], 0, 'row-major' ); + + indices = []; + values = []; + arrays = []; + + ctx = { + 'count': 0 + }; + actual = countIf( [ x ], clbk, ctx ); + + t.strictEqual( actual, 4, 'returns expected value' ); + t.strictEqual( ctx.count, 4, 'returns expected value' ); + + expected = [ + 1.0, + 1.0, + 1.0, + 1.0 + ]; + t.deepEqual( values, expected, 'returns expected value' ); + + expected = [ + [ 0 ], + [ 1 ], + [ 2 ], + [ 3 ] + ]; + t.deepEqual( indices, expected, 'returns expected value' ); + + expected = [ + x, + x, + x, + x + ]; + t.deepEqual( arrays, expected, 'returns expected value' ); + + t.end(); + + function clbk( v, idx, arr ) { + this.count += 1; // eslint-disable-line no-invalid-this + values.push( v ); + indices.push( idx ); + arrays.push( arr ); + return v !== 0.0; + } +}); + +tape( 'the function supports specifying the callback execution context (accessors)', function test( t ) { + var expected; + var indices; + var values; + var arrays; + var actual; + var xbuf; + var ctx; + var x; + + xbuf = ones( 6*2, 'float64' ); + x = ndarray( 'complex128', new Complex128Array( xbuf ), [ 4 ], [ 1 ], 1, 'row-major' ); + + indices = []; + values = []; + arrays = []; + + ctx = { + 'count': 0 + }; + actual = countIf( [ x ], clbk, ctx ); + + t.strictEqual( actual, 4, 'returns expected value' ); + t.strictEqual( ctx.count, 4, 'returns expected value' ); + + expected = [ + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ] + ]; + t.deepEqual( values, expected, 'returns expected value' ); + + expected = [ + [ 0 ], + [ 1 ], + [ 2 ], + [ 3 ] + ]; + t.deepEqual( indices, expected, 'returns expected value' ); + + expected = [ + x, + x, + x, + x + ]; + t.deepEqual( arrays, expected, 'returns expected value' ); + + t.end(); + + function clbk( v, idx, arr ) { + this.count += 1; // eslint-disable-line no-invalid-this + values.push( [ real( v ), imag( v ) ] ); + indices.push( idx ); + arrays.push( arr ); + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); diff --git a/lib/node_modules/@stdlib/ndarray/base/count-if/test/test.2d.js b/lib/node_modules/@stdlib/ndarray/base/count-if/test/test.2d.js new file mode 100644 index 000000000000..2054de0e2e3f --- /dev/null +++ b/lib/node_modules/@stdlib/ndarray/base/count-if/test/test.2d.js @@ -0,0 +1,1285 @@ +/** +* @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 tape = require( 'tape' ); +var zeros = require( '@stdlib/array/zeros' ); +var ones = require( '@stdlib/array/ones' ); +var real = require( '@stdlib/complex/float64/real' ); +var imag = require( '@stdlib/complex/float64/imag' ); +var Complex128Array = require( '@stdlib/array/complex128' ); +var numel = require( '@stdlib/ndarray/base/numel' ); +var shape2strides = require( '@stdlib/ndarray/base/shape2strides' ); +var strides2offset = require( '@stdlib/ndarray/base/strides2offset' ); +var ndarray = require( '@stdlib/ndarray/ctor' ); +var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' ); +var countIf = require( './../lib' ); + + +// TESTS // + +tape( 'main export is a function', function test( t ) { + t.ok( true, __filename ); + t.strictEqual( typeof countIf, 'function', 'main export is a function'); + t.end(); +}); + +tape( 'the function counts the number of elements in a 2-dimensional ndarray which pass a test implemented by a predicate function (row-major, singleton dimensions)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 4, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 2-dimensional ndarray which pass a test implemented by a predicate function (row-major, singleton dimensions, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 4, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function supports specifying the callback execution context (row-major, contiguous)', function test( t ) { + var expected; + var indices; + var values; + var arrays; + var actual; + var ctx; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 2, 2 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + indices = []; + values = []; + arrays = []; + + ctx = { + 'count': 0 + }; + actual = countIf( [ x ], clbk, ctx ); + + t.strictEqual( actual, 4, 'returns expected value' ); + t.strictEqual( ctx.count, 4, 'returns expected value' ); + + expected = [ + 1.0, + 1.0, + 1.0, + 1.0 + ]; + t.deepEqual( values, expected, 'returns expected value' ); + + expected = [ + [ 0, 0 ], + [ 0, 1 ], + [ 1, 0 ], + [ 1, 1 ] + ]; + t.deepEqual( indices, expected, 'returns expected value' ); + + expected = [ + x, + x, + x, + x + ]; + t.deepEqual( arrays, expected, 'returns expected value' ); + + t.end(); + + function clbk( v, idx, arr ) { + this.count += 1; // eslint-disable-line no-invalid-this + values.push( v ); + indices.push( idx ); + arrays.push( arr ); + return v !== 0.0; + } +}); + +tape( 'the function supports specifying the callback execution context (row-major, contiguous, accessors)', function test( t ) { + var expected; + var indices; + var values; + var arrays; + var actual; + var xbuf; + var ctx; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 2, 2 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + indices = []; + values = []; + arrays = []; + + ctx = { + 'count': 0 + }; + actual = countIf( [ x ], clbk, ctx ); + + t.strictEqual( actual, 4, 'returns expected value' ); + t.strictEqual( ctx.count, 4, 'returns expected value' ); + + expected = [ + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ] + ]; + t.deepEqual( values, expected, 'returns expected value' ); + + expected = [ + [ 0, 0 ], + [ 0, 1 ], + [ 1, 0 ], + [ 1, 1 ] + ]; + t.deepEqual( indices, expected, 'returns expected value' ); + + expected = [ + x, + x, + x, + x + ]; + t.deepEqual( arrays, expected, 'returns expected value' ); + + t.end(); + + function clbk( v, idx, arr ) { + this.count += 1; // eslint-disable-line no-invalid-this + values.push( [ real( v ), imag( v ) ] ); + indices.push( idx ); + arrays.push( arr ); + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 2-dimensional ndarray which pass a test implemented by a predicate function (row-major, contiguous)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 2, 2 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 2-dimensional ndarray which pass a test implemented by a predicate function (row-major, contiguous, negative strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 2, 2 ]; + st = [ -2, -1 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 2-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, same sign strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 2, 2 ]; + st = [ 4, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( 8, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 2-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, mixed sign strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 2, 2 ]; + st = [ 4, -2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( 8, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 2-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ bsize*2, 2 ]; + st = [ -4, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 2-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, bsize*2 ]; + st = [ bsize*4, -2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 2-dimensional ndarray which pass a test implemented by a predicate function (row-major, contiguous, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 2, 2 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 2-dimensional ndarray which pass a test implemented by a predicate function (row-major, contiguous, negative strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 2, 2 ]; + st = [ -2, -1 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 2-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, same sign strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 2, 2 ]; + st = [ 4, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( 8*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( 8*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 2-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, mixed sign strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 2, 2 ]; + st = [ -4, -2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( 8*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( 8*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 2-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ bsize*2, 2 ]; + st = [ -4, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 2-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, bsize*2 ]; + st = [ bsize*4, -2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 2-dimensional ndarray which pass a test implemented by a predicate function (column-major, singleton dimensions)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 1, 4 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 2-dimensional ndarray which pass a test implemented by a predicate function (column-major, singleton dimensions, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 1, 4 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function supports specifying the callback execution context (column-major, contiguous)', function test( t ) { + var expected; + var indices; + var values; + var arrays; + var actual; + var ctx; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 2, 2 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + indices = []; + values = []; + arrays = []; + + ctx = { + 'count': 0 + }; + actual = countIf( [ x ], clbk, ctx ); + + t.strictEqual( actual, 4, 'returns expected value' ); + t.strictEqual( ctx.count, 4, 'returns expected value' ); + + expected = [ + 1.0, + 1.0, + 1.0, + 1.0 + ]; + t.deepEqual( values, expected, 'returns expected value' ); + + expected = [ + [ 0, 0 ], + [ 1, 0 ], + [ 0, 1 ], + [ 1, 1 ] + ]; + t.deepEqual( indices, expected, 'returns expected value' ); + + expected = [ + x, + x, + x, + x + ]; + t.deepEqual( arrays, expected, 'returns expected value' ); + + t.end(); + + function clbk( v, idx, arr ) { + this.count += 1; // eslint-disable-line no-invalid-this + values.push( v ); + indices.push( idx ); + arrays.push( arr ); + return v !== 0.0; + } +}); + +tape( 'the function supports specifying the callback execution context (column-major, contiguous, accessors)', function test( t ) { + var expected; + var indices; + var values; + var arrays; + var actual; + var xbuf; + var ctx; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 2, 2 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + indices = []; + values = []; + arrays = []; + + ctx = { + 'count': 0 + }; + actual = countIf( [ x ], clbk, ctx ); + + t.strictEqual( actual, 4, 'returns expected value' ); + t.strictEqual( ctx.count, 4, 'returns expected value' ); + + expected = [ + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ] + ]; + t.deepEqual( values, expected, 'returns expected value' ); + + expected = [ + [ 0, 0 ], + [ 1, 0 ], + [ 0, 1 ], + [ 1, 1 ] + ]; + t.deepEqual( indices, expected, 'returns expected value' ); + + expected = [ + x, + x, + x, + x + ]; + t.deepEqual( arrays, expected, 'returns expected value' ); + + t.end(); + + function clbk( v, idx, arr ) { + this.count += 1; // eslint-disable-line no-invalid-this + values.push( [ real( v ), imag( v ) ] ); + indices.push( idx ); + arrays.push( arr ); + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 2-dimensional ndarray which pass a test implemented by a predicate function (column-major, contiguous)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 2, 2 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 2-dimensional ndarray which pass a test implemented by a predicate function (column-major, contiguous, negative strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 2, 2 ]; + st = [ -1, -2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 2-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, same sign strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 2, 2 ]; + st = [ 2, 4 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( 8, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 2-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, mixed sign strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 2, 2 ]; + st = [ -2, 4 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( 8, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 2-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ bsize*2, 2 ]; + st = [ 2, -bsize*4 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 2-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, bsize*2 ]; + st = [ -2, 4 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 2-dimensional ndarray which pass a test implemented by a predicate function (column-major, contiguous, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 2, 2 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 2-dimensional ndarray which pass a test implemented by a predicate function (column-major, contiguous, negative strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 2, 2 ]; + st = [ -1, -2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 2-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, same sign strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 2, 2 ]; + st = [ 2, 4 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( 8*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( 8*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 2-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, mixed sign strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 2, 2 ]; + st = [ -2, 4 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( 8*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( 8*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 2-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ bsize*2, 2 ]; + st = [ -2, bsize*2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 2-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, bsize*2 ]; + st = [ 2, -4 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); diff --git a/lib/node_modules/@stdlib/ndarray/base/count-if/test/test.3d.js b/lib/node_modules/@stdlib/ndarray/base/count-if/test/test.3d.js new file mode 100644 index 000000000000..d01d0ccdad6a --- /dev/null +++ b/lib/node_modules/@stdlib/ndarray/base/count-if/test/test.3d.js @@ -0,0 +1,1479 @@ +/** +* @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 tape = require( 'tape' ); +var zeros = require( '@stdlib/array/zeros' ); +var ones = require( '@stdlib/array/ones' ); +var real = require( '@stdlib/complex/float64/real' ); +var imag = require( '@stdlib/complex/float64/imag' ); +var Complex128Array = require( '@stdlib/array/complex128' ); +var numel = require( '@stdlib/ndarray/base/numel' ); +var shape2strides = require( '@stdlib/ndarray/base/shape2strides' ); +var strides2offset = require( '@stdlib/ndarray/base/strides2offset' ); +var ndarray = require( '@stdlib/ndarray/ctor' ); +var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' ); +var countIf = require( './../lib' ); + + +// TESTS // + +tape( 'main export is a function', function test( t ) { + t.ok( true, __filename ); + t.strictEqual( typeof countIf, 'function', 'main export is a function'); + t.end(); +}); + +tape( 'the function counts the number of elements in a 3-dimensional ndarray which pass a test implemented by a predicate function (row-major, singleton dimensions)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 4, 1, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 3-dimensional ndarray which pass a test implemented by a predicate function (row-major, singleton dimensions, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 4, 1, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function supports specifying the callback execution context (row-major, contiguous)', function test( t ) { + var expected; + var indices; + var values; + var arrays; + var actual; + var ctx; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 2, 2, 2 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + indices = []; + values = []; + arrays = []; + + ctx = { + 'count': 0 + }; + actual = countIf( [ x ], clbk, ctx ); + + t.strictEqual( actual, 8, 'returns expected value' ); + t.strictEqual( ctx.count, 8, 'returns expected value' ); + + expected = [ + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0 + ]; + t.deepEqual( values, expected, 'returns expected value' ); + + expected = [ + [ 0, 0, 0 ], + [ 0, 0, 1 ], + [ 0, 1, 0 ], + [ 0, 1, 1 ], + [ 1, 0, 0 ], + [ 1, 0, 1 ], + [ 1, 1, 0 ], + [ 1, 1, 1 ] + ]; + t.deepEqual( indices, expected, 'returns expected value' ); + + expected = [ + x, + x, + x, + x, + x, + x, + x, + x + ]; + t.deepEqual( arrays, expected, 'returns expected value' ); + + t.end(); + + function clbk( v, idx, arr ) { + this.count += 1; // eslint-disable-line no-invalid-this + values.push( v ); + indices.push( idx ); + arrays.push( arr ); + return v !== 0.0; + } +}); + +tape( 'the function supports specifying the callback execution context (row-major, contiguous, accessors)', function test( t ) { + var expected; + var indices; + var values; + var arrays; + var actual; + var xbuf; + var ctx; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 2, 2, 2 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + indices = []; + values = []; + arrays = []; + + ctx = { + 'count': 0 + }; + actual = countIf( [ x ], clbk, ctx ); + + t.strictEqual( actual, 8, 'returns expected value' ); + t.strictEqual( ctx.count, 8, 'returns expected value' ); + + expected = [ + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ] + ]; + t.deepEqual( values, expected, 'returns expected value' ); + + expected = [ + [ 0, 0, 0 ], + [ 0, 0, 1 ], + [ 0, 1, 0 ], + [ 0, 1, 1 ], + [ 1, 0, 0 ], + [ 1, 0, 1 ], + [ 1, 1, 0 ], + [ 1, 1, 1 ] + ]; + t.deepEqual( indices, expected, 'returns expected value' ); + + expected = [ + x, + x, + x, + x, + x, + x, + x, + x + ]; + t.deepEqual( arrays, expected, 'returns expected value' ); + + t.end(); + + function clbk( v, idx, arr ) { + this.count += 1; // eslint-disable-line no-invalid-this + values.push( [ real( v ), imag( v ) ] ); + indices.push( idx ); + arrays.push( arr ); + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 3-dimensional ndarray which pass a test implemented by a predicate function (row-major, contiguous)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 2, 2, 2 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 3-dimensional ndarray which pass a test implemented by a predicate function (row-major, contiguous, negative strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 2, 2, 2 ]; + st = [ -2, -2, -1 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 3-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, same sign strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 2, 1, 2 ]; + st = [ 4, 4, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( 8, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 3-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, mixed sign strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 2, 1, 2 ]; + st = [ 4, -4, -2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( 8, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 3-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ bsize*2, 1, 2 ]; + st = [ -4, 4, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 3-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, bsize*2, 1 ]; + st = [ bsize*4, -2, -2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 3-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, bsize*2 ]; + st = [ bsize*4, -bsize*4, -2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 3-dimensional ndarray which pass a test implemented by a predicate function (row-major, contiguous, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 2, 2, 2 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 3-dimensional ndarray which pass a test implemented by a predicate function (row-major, contiguous, negative strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 2, 2, 2 ]; + st = [ -2, -2, -1 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 3-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, same sign strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 2, 1, 2 ]; + st = [ 4, 4, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( 8*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( 8*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 3-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, mixed sign strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 2, 1, 2 ]; + st = [ -4, 4, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( 8*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( 8*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 3-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ bsize*2, 1, 2 ]; + st = [ -4, 4, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 3-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, bsize*2, 1 ]; + st = [ bsize*4, -2, -2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 3-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, bsize*2 ]; + st = [ bsize*4, -bsize*4, -2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 3-dimensional ndarray which pass a test implemented by a predicate function (column-major, singleton dimensions)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 1, 1, 4 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 3-dimensional ndarray which pass a test implemented by a predicate function (column-major, singleton dimensions, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 1, 1, 4 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function supports specifying the callback execution context (column-major, contiguous)', function test( t ) { + var expected; + var indices; + var values; + var arrays; + var actual; + var ctx; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 2, 2, 2 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + indices = []; + values = []; + arrays = []; + + ctx = { + 'count': 0 + }; + actual = countIf( [ x ], clbk, ctx ); + + t.strictEqual( actual, 8, 'returns expected value' ); + t.strictEqual( ctx.count, 8, 'returns expected value' ); + + expected = [ + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0 + ]; + t.deepEqual( values, expected, 'returns expected value' ); + + expected = [ + [ 0, 0, 0 ], + [ 1, 0, 0 ], + [ 0, 1, 0 ], + [ 1, 1, 0 ], + [ 0, 0, 1 ], + [ 1, 0, 1 ], + [ 0, 1, 1 ], + [ 1, 1, 1 ] + ]; + t.deepEqual( indices, expected, 'returns expected value' ); + + expected = [ + x, + x, + x, + x, + x, + x, + x, + x + ]; + t.deepEqual( arrays, expected, 'returns expected value' ); + + t.end(); + + function clbk( v, idx, arr ) { + this.count += 1; // eslint-disable-line no-invalid-this + values.push( v ); + indices.push( idx ); + arrays.push( arr ); + return v !== 0.0; + } +}); + +tape( 'the function supports specifying the callback execution context (column-major, contiguous, accessors)', function test( t ) { + var expected; + var indices; + var values; + var arrays; + var actual; + var xbuf; + var ctx; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 2, 2, 2 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + indices = []; + values = []; + arrays = []; + + ctx = { + 'count': 0 + }; + actual = countIf( [ x ], clbk, ctx ); + + t.strictEqual( actual, 8, 'returns expected value' ); + t.strictEqual( ctx.count, 8, 'returns expected value' ); + + expected = [ + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ] + ]; + t.deepEqual( values, expected, 'returns expected value' ); + + expected = [ + [ 0, 0, 0 ], + [ 1, 0, 0 ], + [ 0, 1, 0 ], + [ 1, 1, 0 ], + [ 0, 0, 1 ], + [ 1, 0, 1 ], + [ 0, 1, 1 ], + [ 1, 1, 1 ] + ]; + t.deepEqual( indices, expected, 'returns expected value' ); + + expected = [ + x, + x, + x, + x, + x, + x, + x, + x + ]; + t.deepEqual( arrays, expected, 'returns expected value' ); + + t.end(); + + function clbk( v, idx, arr ) { + this.count += 1; // eslint-disable-line no-invalid-this + values.push( [ real( v ), imag( v ) ] ); + indices.push( idx ); + arrays.push( arr ); + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 3-dimensional ndarray which pass a test implemented by a predicate function (column-major, contiguous)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 2, 2, 2 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 3-dimensional ndarray which pass a test implemented by a predicate function (column-major, contiguous, negative strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 2, 2, 2 ]; + st = [ -1, 2, -4 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 3-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, same sign strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 2, 1, 2 ]; + st = [ 2, 2, 4 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( 8, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 3-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, mixed sign strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 2, 1, 2 ]; + st = [ -2, 2, 4 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( 8, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 3-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ bsize*2, 1, 2 ]; + st = [ 2, -bsize*4, bsize*4 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 3-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, bsize*2, 1 ]; + st = [ -2, 4, bsize*8 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 3-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, bsize*2 ]; + st = [ -2, 4, 4 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 3-dimensional ndarray which pass a test implemented by a predicate function (column-major, contiguous, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 2, 2, 2 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 3-dimensional ndarray which pass a test implemented by a predicate function (column-major, contiguous, negative strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 2, 2, 2 ]; + st = [ -1, -2, 4 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 3-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, same sign strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 2, 1, 2 ]; + st = [ 2, 4, 4 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( 8*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( 8*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 3-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, mixed sign strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 2, 1, 2 ]; + st = [ -2, 4, 4 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( 8*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( 8*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 3-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ bsize*2, 1, 2 ]; + st = [ -2, bsize*4, bsize*4 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 3-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, bsize*2, 1 ]; + st = [ 2, -4, bsize*8 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 3-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, bsize*2 ]; + st = [ 2, -4, 4 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); diff --git a/lib/node_modules/@stdlib/ndarray/base/count-if/test/test.4d.js b/lib/node_modules/@stdlib/ndarray/base/count-if/test/test.4d.js new file mode 100644 index 000000000000..423b5fdac090 --- /dev/null +++ b/lib/node_modules/@stdlib/ndarray/base/count-if/test/test.4d.js @@ -0,0 +1,1577 @@ +/** +* @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 tape = require( 'tape' ); +var zeros = require( '@stdlib/array/zeros' ); +var ones = require( '@stdlib/array/ones' ); +var real = require( '@stdlib/complex/float64/real' ); +var imag = require( '@stdlib/complex/float64/imag' ); +var Complex128Array = require( '@stdlib/array/complex128' ); +var numel = require( '@stdlib/ndarray/base/numel' ); +var shape2strides = require( '@stdlib/ndarray/base/shape2strides' ); +var strides2offset = require( '@stdlib/ndarray/base/strides2offset' ); +var ndarray = require( '@stdlib/ndarray/ctor' ); +var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' ); +var countIf = require( './../lib' ); + + +// TESTS // + +tape( 'main export is a function', function test( t ) { + t.ok( true, __filename ); + t.strictEqual( typeof countIf, 'function', 'main export is a function'); + t.end(); +}); + +tape( 'the function counts the number of elements in a 4-dimensional ndarray which pass a test implemented by a predicate function (row-major, singleton dimensions)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 4, 1, 1, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 4-dimensional ndarray which pass a test implemented by a predicate function (row-major, singleton dimensions, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 4, 1, 1, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function supports specifying the callback execution context (row-major, contiguous)', function test( t ) { + var expected; + var indices; + var values; + var arrays; + var actual; + var ctx; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + indices = []; + values = []; + arrays = []; + + ctx = { + 'count': 0 + }; + actual = countIf( [ x ], clbk, ctx ); + + t.strictEqual( actual, 4, 'returns expected value' ); + t.strictEqual( ctx.count, 4, 'returns expected value' ); + + expected = [ + 1.0, + 1.0, + 1.0, + 1.0 + ]; + t.deepEqual( values, expected, 'returns expected value' ); + + expected = [ + [ 0, 0, 0, 0 ], + [ 0, 0, 1, 0 ], + [ 1, 0, 0, 0 ], + [ 1, 0, 1, 0 ] + ]; + t.deepEqual( indices, expected, 'returns expected value' ); + + expected = [ + x, + x, + x, + x + ]; + t.deepEqual( arrays, expected, 'returns expected value' ); + + t.end(); + + function clbk( v, idx, arr ) { + this.count += 1; // eslint-disable-line no-invalid-this + values.push( v ); + indices.push( idx ); + arrays.push( arr ); + return v !== 0.0; + } +}); + +tape( 'the function supports specifying the callback execution context (row-major, contiguous, accessors)', function test( t ) { + var expected; + var indices; + var values; + var arrays; + var actual; + var xbuf; + var ctx; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + indices = []; + values = []; + arrays = []; + + ctx = { + 'count': 0 + }; + actual = countIf( [ x ], clbk, ctx ); + + t.strictEqual( actual, 4, 'returns expected value' ); + t.strictEqual( ctx.count, 4, 'returns expected value' ); + + expected = [ + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ] + ]; + t.deepEqual( values, expected, 'returns expected value' ); + + expected = [ + [ 0, 0, 0, 0 ], + [ 0, 0, 1, 0 ], + [ 1, 0, 0, 0 ], + [ 1, 0, 1, 0 ] + ]; + t.deepEqual( indices, expected, 'returns expected value' ); + + expected = [ + x, + x, + x, + x + ]; + t.deepEqual( arrays, expected, 'returns expected value' ); + + t.end(); + + function clbk( v, idx, arr ) { + this.count += 1; // eslint-disable-line no-invalid-this + values.push( [ real( v ), imag( v ) ] ); + indices.push( idx ); + arrays.push( arr ); + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 4-dimensional ndarray which pass a test implemented by a predicate function (row-major, contiguous)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 4-dimensional ndarray which pass a test implemented by a predicate function (row-major, contiguous, negative strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 2, 1, 2, 1 ]; + st = [ -2, -2, -1, -1 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 4-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, same sign strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 2, 1, 2, 1 ]; + st = [ 4, 4, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( 8, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 4-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, mixed sign strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 2, 1, 2, 1 ]; + st = [ 4, -4, -2, -2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( 8, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 4-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ bsize*2, 1, 2, 1 ]; + st = [ -4, 4, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 4-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, bsize*2, 1, 1 ]; + st = [ bsize*4, -2, -2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 4-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, bsize*2, 1 ]; + st = [ bsize*4, -bsize*4, -2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 4-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 1, bsize*2 ]; + st = [ bsize*4, -bsize*4, -bsize*4, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 4-dimensional ndarray which pass a test implemented by a predicate function (row-major, contiguous, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 4-dimensional ndarray which pass a test implemented by a predicate function (row-major, contiguous, negative strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 2, 1, 2, 1 ]; + st = [ -2, -2, -1, -1 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 4-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, same sign strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 2, 1, 2, 1 ]; + st = [ 4, 4, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( 8*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( 8*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 4-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, mixed sign strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 2, 1, 2, 1 ]; + st = [ -4, 4, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( 8*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( 8*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 4-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ bsize*2, 1, 2, 1 ]; + st = [ -4, 4, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 4-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, bsize*2, 1, 1 ]; + st = [ bsize*4, -2, -2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 4-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, bsize*2, 1 ]; + st = [ bsize*4, -bsize*4, -2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 4-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 1, bsize*2 ]; + st = [ bsize*4, -bsize*4, -bsize*4, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 4-dimensional ndarray which pass a test implemented by a predicate function (column-major, singleton dimensions)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 1, 1, 1, 4 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 4-dimensional ndarray which pass a test implemented by a predicate function (column-major, singleton dimensions, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 1, 1, 1, 4 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function supports specifying the callback execution context (column-major, contiguous)', function test( t ) { + var expected; + var indices; + var values; + var arrays; + var actual; + var ctx; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + indices = []; + values = []; + arrays = []; + + ctx = { + 'count': 0 + }; + actual = countIf( [ x ], clbk, ctx ); + + t.strictEqual( actual, 4, 'returns expected value' ); + t.strictEqual( ctx.count, 4, 'returns expected value' ); + + expected = [ + 1.0, + 1.0, + 1.0, + 1.0 + ]; + t.deepEqual( values, expected, 'returns expected value' ); + + expected = [ + [ 0, 0, 0, 0 ], + [ 1, 0, 0, 0 ], + [ 0, 0, 1, 0 ], + [ 1, 0, 1, 0 ] + ]; + t.deepEqual( indices, expected, 'returns expected value' ); + + expected = [ + x, + x, + x, + x + ]; + t.deepEqual( arrays, expected, 'returns expected value' ); + + t.end(); + + function clbk( v, idx, arr ) { + this.count += 1; // eslint-disable-line no-invalid-this + values.push( v ); + indices.push( idx ); + arrays.push( arr ); + return v !== 0.0; + } +}); + +tape( 'the function supports specifying the callback execution context (column-major, contiguous, accessors)', function test( t ) { + var expected; + var indices; + var values; + var arrays; + var actual; + var xbuf; + var ctx; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + indices = []; + values = []; + arrays = []; + + ctx = { + 'count': 0 + }; + actual = countIf( [ x ], clbk, ctx ); + + t.strictEqual( actual, 4, 'returns expected value' ); + t.strictEqual( ctx.count, 4, 'returns expected value' ); + + expected = [ + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ] + ]; + t.deepEqual( values, expected, 'returns expected value' ); + + expected = [ + [ 0, 0, 0, 0 ], + [ 1, 0, 0, 0 ], + [ 0, 0, 1, 0 ], + [ 1, 0, 1, 0 ] + ]; + t.deepEqual( indices, expected, 'returns expected value' ); + + expected = [ + x, + x, + x, + x + ]; + t.deepEqual( arrays, expected, 'returns expected value' ); + + t.end(); + + function clbk( v, idx, arr ) { + this.count += 1; // eslint-disable-line no-invalid-this + values.push( [ real( v ), imag( v ) ] ); + indices.push( idx ); + arrays.push( arr ); + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 4-dimensional ndarray which pass a test implemented by a predicate function (column-major, contiguous)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 4-dimensional ndarray which pass a test implemented by a predicate function (column-major, contiguous, negative strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 2, 1, 2, 1 ]; + st = [ -1, 2, -2, 4 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 4-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, same sign strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 2, 1, 2, 1 ]; + st = [ 2, 4, 4, 8 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( 8, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 4-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, mixed sign strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 2, 1, 2, 1 ]; + st = [ -2, 4, 4, 8 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( 8, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( 8, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 4-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ bsize*2, 1, 2, 1 ]; + st = [ 2, -bsize*4, bsize*4, bsize*8 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 4-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, bsize*2, 1, 1 ]; + st = [ -2, 4, bsize*8, bsize*8 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 4-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, bsize*2, 1 ]; + st = [ -2, 4, 4, bsize*8 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 4-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 1, bsize*2 ]; + st = [ -2, 4, 4, 4 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 4-dimensional ndarray which pass a test implemented by a predicate function (column-major, contiguous, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 4-dimensional ndarray which pass a test implemented by a predicate function (column-major, contiguous, negative strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 2, 1, 2, 1 ]; + st = [ -1, -2, 2, 4 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 4-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, same sign strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 2, 1, 2, 1 ]; + st = [ 2, 4, 4, 8 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( 8*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( 8*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 4-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, mixed sign strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 2, 1, 2, 1 ]; + st = [ -2, 4, 4, 8 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( 8*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( 8*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 4-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ bsize*2, 1, 2, 1 ]; + st = [ -2, bsize*4, bsize*4, bsize*8 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 4-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, bsize*2, 1, 1 ]; + st = [ 2, -4, bsize*8, bsize*8 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 4-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, bsize*2, 1 ]; + st = [ 2, -4, 4, bsize*8 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 4-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 1, bsize*2 ]; + st = [ 2, -4, 4, 4 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); diff --git a/lib/node_modules/@stdlib/ndarray/base/count-if/test/test.5d.js b/lib/node_modules/@stdlib/ndarray/base/count-if/test/test.5d.js new file mode 100644 index 000000000000..3d023ae96a87 --- /dev/null +++ b/lib/node_modules/@stdlib/ndarray/base/count-if/test/test.5d.js @@ -0,0 +1,1771 @@ +/** +* @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 tape = require( 'tape' ); +var zeros = require( '@stdlib/array/zeros' ); +var ones = require( '@stdlib/array/ones' ); +var real = require( '@stdlib/complex/float64/real' ); +var imag = require( '@stdlib/complex/float64/imag' ); +var Complex128Array = require( '@stdlib/array/complex128' ); +var numel = require( '@stdlib/ndarray/base/numel' ); +var shape2strides = require( '@stdlib/ndarray/base/shape2strides' ); +var strides2offset = require( '@stdlib/ndarray/base/strides2offset' ); +var ndarray = require( '@stdlib/ndarray/ctor' ); +var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' ); +var countIf = require( './../lib' ); + + +// TESTS // + +tape( 'main export is a function', function test( t ) { + t.ok( true, __filename ); + t.strictEqual( typeof countIf, 'function', 'main export is a function'); + t.end(); +}); + +tape( 'the function counts the number of elements in a 5-dimensional ndarray which pass a test implemented by a predicate function (row-major, singleton dimensions)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 4, 1, 1, 1, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 5-dimensional ndarray which pass a test implemented by a predicate function (row-major, singleton dimensions, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 4, 1, 1, 1, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function supports specifying the callback execution context (row-major, contiguous)', function test( t ) { + var expected; + var indices; + var values; + var arrays; + var actual; + var ctx; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 2, 1, 2, 1, 2 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + indices = []; + values = []; + arrays = []; + + ctx = { + 'count': 0 + }; + actual = countIf( [ x ], clbk, ctx ); + + t.strictEqual( actual, 8, 'returns expected value' ); + t.strictEqual( ctx.count, 8, 'returns expected value' ); + + expected = [ + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0 + ]; + t.deepEqual( values, expected, 'returns expected value' ); + + expected = [ + [ 0, 0, 0, 0, 0 ], + [ 0, 0, 0, 0, 1 ], + [ 0, 0, 1, 0, 0 ], + [ 0, 0, 1, 0, 1 ], + [ 1, 0, 0, 0, 0 ], + [ 1, 0, 0, 0, 1 ], + [ 1, 0, 1, 0, 0 ], + [ 1, 0, 1, 0, 1 ] + ]; + t.deepEqual( indices, expected, 'returns expected value' ); + + expected = [ + x, + x, + x, + x, + x, + x, + x, + x + ]; + t.deepEqual( arrays, expected, 'returns expected value' ); + + t.end(); + + function clbk( v, idx, arr ) { + this.count += 1; // eslint-disable-line no-invalid-this + values.push( v ); + indices.push( idx ); + arrays.push( arr ); + return v !== 0.0; + } +}); + +tape( 'the function supports specifying the callback execution context (row-major, contiguous, accessors)', function test( t ) { + var expected; + var indices; + var values; + var arrays; + var actual; + var xbuf; + var ctx; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 2, 1, 2, 1, 2 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + indices = []; + values = []; + arrays = []; + + ctx = { + 'count': 0 + }; + actual = countIf( [ x ], clbk, ctx ); + + t.strictEqual( actual, 8, 'returns expected value' ); + t.strictEqual( ctx.count, 8, 'returns expected value' ); + + expected = [ + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ] + ]; + t.deepEqual( values, expected, 'returns expected value' ); + + expected = [ + [ 0, 0, 0, 0, 0 ], + [ 0, 0, 0, 0, 1 ], + [ 0, 0, 1, 0, 0 ], + [ 0, 0, 1, 0, 1 ], + [ 1, 0, 0, 0, 0 ], + [ 1, 0, 0, 0, 1 ], + [ 1, 0, 1, 0, 0 ], + [ 1, 0, 1, 0, 1 ] + ]; + t.deepEqual( indices, expected, 'returns expected value' ); + + expected = [ + x, + x, + x, + x, + x, + x, + x, + x + ]; + t.deepEqual( arrays, expected, 'returns expected value' ); + + t.end(); + + function clbk( v, idx, arr ) { + this.count += 1; // eslint-disable-line no-invalid-this + values.push( [ real( v ), imag( v ) ] ); + indices.push( idx ); + arrays.push( arr ); + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 5-dimensional ndarray which pass a test implemented by a predicate function (row-major, contiguous)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 2, 1, 2, 1, 2 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 5-dimensional ndarray which pass a test implemented by a predicate function (row-major, contiguous, negative strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 2, 1, 2, 1, 2 ]; + st = [ -4, -4, -2, -2, -1 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 5-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, same sign strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 2, 1, 2, 1, 2 ]; + st = [ 8, 8, 4, 4, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 5-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, mixed sign strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 2, 1, 2, 1, 2 ]; + st = [ 8, -8, -4, -4, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 5-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ bsize*2, 1, 2, 1, 2 ]; + st = [ -8, 8, 4, 4, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 5-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, bsize*2, 1, 1, 2 ]; + st = [ bsize*8, -4, -4, 4, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 5-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, bsize*2, 1, 2 ]; + st = [ bsize*8, -bsize*8, -4, 4, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 5-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, bsize*2, 1 ]; + st = [ bsize*8, -bsize*8, -bsize*4, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 5-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, bsize*2 ]; + st = [ bsize*8, -bsize*8, -bsize*4, bsize*4, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 5-dimensional ndarray which pass a test implemented by a predicate function (row-major, contiguous, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 2, 1, 2, 1, 2 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 5-dimensional ndarray which pass a test implemented by a predicate function (row-major, contiguous, negative strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 2, 1, 2, 1, 2 ]; + st = [ -4, -4, -2, -2, -1 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 5-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, same sign strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 2, 1, 2, 1, 2 ]; + st = [ 8, 8, 4, 4, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 5-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, mixed sign strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 2, 1, 2, 1, 2 ]; + st = [ -8, 8, 4, 4, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 5-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ bsize*2, 1, 2, 1, 2 ]; + st = [ -8, 8, 4, 4, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 5-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, bsize*2, 1, 2, 1 ]; + st = [ bsize*8, -4, -4, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 5-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, bsize*2, 1, 2 ]; + st = [ bsize*8, -bsize*8, -4, 4, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 5-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, bsize*2, 1 ]; + st = [ bsize*8, -bsize*8, -bsize*4, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 5-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, bsize*2 ]; + st = [ bsize*8, -bsize*8, -bsize*4, bsize*4, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 5-dimensional ndarray which pass a test implemented by a predicate function (column-major, singleton dimensions)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 1, 1, 1, 1, 4 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 5-dimensional ndarray which pass a test implemented by a predicate function (column-major, singleton dimensions, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 1, 1, 1, 1, 4 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function supports specifying the callback execution context (column-major, contiguous)', function test( t ) { + var expected; + var indices; + var values; + var arrays; + var actual; + var ctx; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 2, 1, 2, 1, 2 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + indices = []; + values = []; + arrays = []; + + ctx = { + 'count': 0 + }; + actual = countIf( [ x ], clbk, ctx ); + + t.strictEqual( actual, 8, 'returns expected value' ); + t.strictEqual( ctx.count, 8, 'returns expected value' ); + + expected = [ + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0 + ]; + t.deepEqual( values, expected, 'returns expected value' ); + + expected = [ + [ 0, 0, 0, 0, 0 ], + [ 1, 0, 0, 0, 0 ], + [ 0, 0, 1, 0, 0 ], + [ 1, 0, 1, 0, 0 ], + [ 0, 0, 0, 0, 1 ], + [ 1, 0, 0, 0, 1 ], + [ 0, 0, 1, 0, 1 ], + [ 1, 0, 1, 0, 1 ] + ]; + t.deepEqual( indices, expected, 'returns expected value' ); + + expected = [ + x, + x, + x, + x, + x, + x, + x, + x + ]; + t.deepEqual( arrays, expected, 'returns expected value' ); + + t.end(); + + function clbk( v, idx, arr ) { + this.count += 1; // eslint-disable-line no-invalid-this + values.push( v ); + indices.push( idx ); + arrays.push( arr ); + return v !== 0.0; + } +}); + +tape( 'the function supports specifying the callback execution context (column-major, contiguous, accessors)', function test( t ) { + var expected; + var indices; + var values; + var arrays; + var actual; + var xbuf; + var ctx; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 2, 1, 2, 1, 2 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + indices = []; + values = []; + arrays = []; + + ctx = { + 'count': 0 + }; + actual = countIf( [ x ], clbk, ctx ); + + t.strictEqual( actual, 8, 'returns expected value' ); + t.strictEqual( ctx.count, 8, 'returns expected value' ); + + expected = [ + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ] + ]; + t.deepEqual( values, expected, 'returns expected value' ); + + expected = [ + [ 0, 0, 0, 0, 0 ], + [ 1, 0, 0, 0, 0 ], + [ 0, 0, 1, 0, 0 ], + [ 1, 0, 1, 0, 0 ], + [ 0, 0, 0, 0, 1 ], + [ 1, 0, 0, 0, 1 ], + [ 0, 0, 1, 0, 1 ], + [ 1, 0, 1, 0, 1 ] + ]; + t.deepEqual( indices, expected, 'returns expected value' ); + + expected = [ + x, + x, + x, + x, + x, + x, + x, + x + ]; + t.deepEqual( arrays, expected, 'returns expected value' ); + + t.end(); + + function clbk( v, idx, arr ) { + this.count += 1; // eslint-disable-line no-invalid-this + values.push( [ real( v ), imag( v ) ] ); + indices.push( idx ); + arrays.push( arr ); + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 5-dimensional ndarray which pass a test implemented by a predicate function (column-major, contiguous)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 2, 1, 2, 1, 2 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 5-dimensional ndarray which pass a test implemented by a predicate function (column-major, contiguous, negative strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 2, 1, 2, 1, 2 ]; + st = [ -1, -2, 2, -4, 4 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 5-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, same sign strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 2, 1, 2, 1, 2 ]; + st = [ 2, 4, 4, 8, 8 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 5-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, mixed sign strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 2, 1, 2, 1, 2 ]; + st = [ -2, -4, 4, 8, 8 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 5-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ bsize*2, 1, 2, 1, 2 ]; + st = [ 2, bsize*4, -bsize*4, bsize*8, bsize*8 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 5-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, bsize*2, 1, 1, 2 ]; + st = [ 2, -4, bsize*8, bsize*8, bsize*8 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 5-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, bsize*2, 1, 2 ]; + st = [ 2, -4, 4, bsize*8, bsize*8 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 5-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 1, bsize*2, 2 ]; + st = [ -2, -4, 4, 4, bsize*8 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 5-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, bsize*2 ]; + st = [ -2, -4, 4, 8, 8 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 5-dimensional ndarray which pass a test implemented by a predicate function (column-major, contiguous, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 2, 1, 2, 1, 2 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 5-dimensional ndarray which pass a test implemented by a predicate function (column-major, contiguous, negative strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 2, 1, 2, 1, 2 ]; + st = [ -1, -2, -2, 4, 4 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 5-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, same sign strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 2, 1, 2, 1, 2 ]; + st = [ 2, 4, 4, 8, 8 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 5-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, mixed sign strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 2, 1, 2, 1, 2 ]; + st = [ 2, -4, 4, 8, 8 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 5-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ bsize*2, 1, 2, 1, 2 ]; + st = [ -2, -bsize*4, bsize*4, bsize*8, bsize*8 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 5-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, bsize*2, 1, 1, 2 ]; + st = [ 2, -4, bsize*8, bsize*8, bsize*8 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 5-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, bsize*2, 1, 2 ]; + st = [ 2, 4, -4, bsize*8, bsize*8 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 5-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 1, bsize*2, 2 ]; + st = [ 2, 4, -4, 4, bsize*8 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 5-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, bsize*2 ]; + st = [ 2, 4, -4, 8, 8 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); diff --git a/lib/node_modules/@stdlib/ndarray/base/count-if/test/test.6d.js b/lib/node_modules/@stdlib/ndarray/base/count-if/test/test.6d.js new file mode 100644 index 000000000000..ab4c1249e661 --- /dev/null +++ b/lib/node_modules/@stdlib/ndarray/base/count-if/test/test.6d.js @@ -0,0 +1,1917 @@ +/** +* @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 tape = require( 'tape' ); +var zeros = require( '@stdlib/array/zeros' ); +var ones = require( '@stdlib/array/ones' ); +var real = require( '@stdlib/complex/float64/real' ); +var imag = require( '@stdlib/complex/float64/imag' ); +var Complex128Array = require( '@stdlib/array/complex128' ); +var numel = require( '@stdlib/ndarray/base/numel' ); +var shape2strides = require( '@stdlib/ndarray/base/shape2strides' ); +var strides2offset = require( '@stdlib/ndarray/base/strides2offset' ); +var ndarray = require( '@stdlib/ndarray/ctor' ); +var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' ); +var countIf = require( './../lib' ); + + +// TESTS // + +tape( 'main export is a function', function test( t ) { + t.ok( true, __filename ); + t.strictEqual( typeof countIf, 'function', 'main export is a function'); + t.end(); +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (row-major, singleton dimensions)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 4, 1, 1, 1, 1, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (row-major, singleton dimensions, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 4, 1, 1, 1, 1, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function supports specifying the callback execution context (row-major, contiguous)', function test( t ) { + var expected; + var indices; + var values; + var arrays; + var actual; + var ctx; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + indices = []; + values = []; + arrays = []; + + ctx = { + 'count': 0 + }; + actual = countIf( [ x ], clbk, ctx ); + + t.strictEqual( actual, 8, 'returns expected value' ); + t.strictEqual( ctx.count, 8, 'returns expected value' ); + + expected = [ + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0 + ]; + t.deepEqual( values, expected, 'returns expected value' ); + + expected = [ + [ 0, 0, 0, 0, 0, 0 ], + [ 0, 0, 0, 0, 1, 0 ], + [ 0, 0, 1, 0, 0, 0 ], + [ 0, 0, 1, 0, 1, 0 ], + [ 1, 0, 0, 0, 0, 0 ], + [ 1, 0, 0, 0, 1, 0 ], + [ 1, 0, 1, 0, 0, 0 ], + [ 1, 0, 1, 0, 1, 0 ] + ]; + t.deepEqual( indices, expected, 'returns expected value' ); + + expected = [ + x, + x, + x, + x, + x, + x, + x, + x + ]; + t.deepEqual( arrays, expected, 'returns expected value' ); + + t.end(); + + function clbk( v, idx, arr ) { + this.count += 1; // eslint-disable-line no-invalid-this + values.push( v ); + indices.push( idx ); + arrays.push( arr ); + return v !== 0.0; + } +}); + +tape( 'the function supports specifying the callback execution context (row-major, contiguous, accessors)', function test( t ) { + var expected; + var indices; + var values; + var arrays; + var actual; + var xbuf; + var ctx; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + indices = []; + values = []; + arrays = []; + + ctx = { + 'count': 0 + }; + actual = countIf( [ x ], clbk, ctx ); + + t.strictEqual( actual, 8, 'returns expected value' ); + t.strictEqual( ctx.count, 8, 'returns expected value' ); + + expected = [ + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ] + ]; + t.deepEqual( values, expected, 'returns expected value' ); + + expected = [ + [ 0, 0, 0, 0, 0, 0 ], + [ 0, 0, 0, 0, 1, 0 ], + [ 0, 0, 1, 0, 0, 0 ], + [ 0, 0, 1, 0, 1, 0 ], + [ 1, 0, 0, 0, 0, 0 ], + [ 1, 0, 0, 0, 1, 0 ], + [ 1, 0, 1, 0, 0, 0 ], + [ 1, 0, 1, 0, 1, 0 ] + ]; + t.deepEqual( indices, expected, 'returns expected value' ); + + expected = [ + x, + x, + x, + x, + x, + x, + x, + x + ]; + t.deepEqual( arrays, expected, 'returns expected value' ); + + t.end(); + + function clbk( v, idx, arr ) { + this.count += 1; // eslint-disable-line no-invalid-this + values.push( [ real( v ), imag( v ) ] ); + indices.push( idx ); + arrays.push( arr ); + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (row-major, contiguous)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (row-major, contiguous, negative strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 2, 1, 2, 1, 2, 1 ]; + st = [ -4, -4, -2, -2, -1, -1 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (row-major, non-contiguous, same sign strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 2, 1, 2, 1, 2, 1 ]; + st = [ 8, 8, 4, 4, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (row-major, non-contiguous, mixed sign strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 2, 1, 2, 1, 2, 1 ]; + st = [ 8, -8, -4, -4, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ bsize*2, 1, 2, 1, 2, 1 ]; + st = [ -8, 8, 4, 4, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, bsize*2, 1, 1, 2, 1 ]; + st = [ bsize*8, -4, -4, 4, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, bsize*2, 1, 2, 1 ]; + st = [ bsize*8, -bsize*8, -4, 4, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, bsize*2, 1, 1 ]; + st = [ bsize*8, -bsize*8, -bsize*4, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, bsize*2, 1 ]; + st = [ bsize*8, -bsize*8, -bsize*4, bsize*4, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, bsize*2 ]; + st = [ bsize*8, -bsize*8, -bsize*4, bsize*4, bsize*4, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (row-major, contiguous, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (row-major, contiguous, negative strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 2, 1, 2, 1, 2, 1 ]; + st = [ -4, -4, -2, -2, -1, -1 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (row-major, non-contiguous, same sign strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 2, 1, 2, 1, 2, 1 ]; + st = [ 8, 8, 4, 4, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (row-major, non-contiguous, mixed sign strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 2, 1, 2, 1, 2, 1 ]; + st = [ -8, 8, 4, 4, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ bsize*2, 1, 2, 1, 2, 1 ]; + st = [ -8, 8, 4, 4, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, bsize*2, 1, 2, 1, 1 ]; + st = [ bsize*8, -4, -4, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, bsize*2, 1, 2, 1 ]; + st = [ bsize*8, -bsize*8, -4, 4, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, bsize*2, 1, 1 ]; + st = [ bsize*8, -bsize*8, -bsize*4, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, bsize*2, 1 ]; + st = [ bsize*8, -bsize*8, -bsize*4, bsize*4, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, bsize*2 ]; + st = [ bsize*8, -bsize*8, -bsize*4, bsize*4, bsize*4, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (column-major, singleton dimensions)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 1, 1, 1, 1, 1, 4 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (column-major, singleton dimensions, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 1, 1, 1, 1, 1, 4 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function supports specifying the callback execution context (column-major, contiguous)', function test( t ) { + var expected; + var indices; + var values; + var arrays; + var actual; + var ctx; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + indices = []; + values = []; + arrays = []; + + ctx = { + 'count': 0 + }; + actual = countIf( [ x ], clbk, ctx ); + + t.strictEqual( actual, 8, 'returns expected value' ); + t.strictEqual( ctx.count, 8, 'returns expected value' ); + + expected = [ + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0 + ]; + t.deepEqual( values, expected, 'returns expected value' ); + + expected = [ + [ 0, 0, 0, 0, 0, 0 ], + [ 1, 0, 0, 0, 0, 0 ], + [ 0, 0, 1, 0, 0, 0 ], + [ 1, 0, 1, 0, 0, 0 ], + [ 0, 0, 0, 0, 1, 0 ], + [ 1, 0, 0, 0, 1, 0 ], + [ 0, 0, 1, 0, 1, 0 ], + [ 1, 0, 1, 0, 1, 0 ] + ]; + t.deepEqual( indices, expected, 'returns expected value' ); + + expected = [ + x, + x, + x, + x, + x, + x, + x, + x + ]; + t.deepEqual( arrays, expected, 'returns expected value' ); + + t.end(); + + function clbk( v, idx, arr ) { + this.count += 1; // eslint-disable-line no-invalid-this + values.push( v ); + indices.push( idx ); + arrays.push( arr ); + return v !== 0.0; + } +}); + +tape( 'the function supports specifying the callback execution context (column-major, contiguous, accessors)', function test( t ) { + var expected; + var indices; + var values; + var arrays; + var actual; + var xbuf; + var ctx; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + indices = []; + values = []; + arrays = []; + + ctx = { + 'count': 0 + }; + actual = countIf( [ x ], clbk, ctx ); + + t.strictEqual( actual, 8, 'returns expected value' ); + t.strictEqual( ctx.count, 8, 'returns expected value' ); + + expected = [ + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ] + ]; + t.deepEqual( values, expected, 'returns expected value' ); + + expected = [ + [ 0, 0, 0, 0, 0, 0 ], + [ 1, 0, 0, 0, 0, 0 ], + [ 0, 0, 1, 0, 0, 0 ], + [ 1, 0, 1, 0, 0, 0 ], + [ 0, 0, 0, 0, 1, 0 ], + [ 1, 0, 0, 0, 1, 0 ], + [ 0, 0, 1, 0, 1, 0 ], + [ 1, 0, 1, 0, 1, 0 ] + ]; + t.deepEqual( indices, expected, 'returns expected value' ); + + expected = [ + x, + x, + x, + x, + x, + x, + x, + x + ]; + t.deepEqual( arrays, expected, 'returns expected value' ); + + t.end(); + + function clbk( v, idx, arr ) { + this.count += 1; // eslint-disable-line no-invalid-this + values.push( [ real( v ), imag( v ) ] ); + indices.push( idx ); + arrays.push( arr ); + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (column-major, contiguous)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (column-major, contiguous, negative strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 2, 1, 2, 1, 2, 1 ]; + st = [ -1, -2, -2, 4, -4, 8 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (column-major, non-contiguous, same sign strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 2, 1, 2, 1, 2, 1 ]; + st = [ 2, 4, 4, 8, 8, 16 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (column-major, non-contiguous, mixed sign strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 2, 1, 2, 1, 2, 1 ]; + st = [ -2, -4, 4, 8, 8, 16 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ bsize*2, 1, 2, 1, 2, 1 ]; + st = [ 2, bsize*4, -bsize*4, bsize*8, bsize*8, bsize*16 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, bsize*2, 1, 1, 2, 1 ]; + st = [ 2, -4, bsize*8, bsize*8, bsize*8, bsize*16 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, bsize*2, 1, 2, 1 ]; + st = [ 2, -4, 4, bsize*8, bsize*8, bsize*16 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 1, bsize*2, 2, 1 ]; + st = [ -2, -4, 4, 4, bsize*8, bsize*16 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, bsize*2, 1 ]; + st = [ -2, -4, 4, 8, 8, bsize*16 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, bsize*2 ]; + st = [ -2, -4, 4, 8, 8, 8 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (column-major, contiguous, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (column-major, contiguous, negative strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 2, 1, 2, 1, 2, 1 ]; + st = [ -1, -2, -2, 4, 4, 8 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (column-major, non-contiguous, same sign strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 2, 1, 2, 1, 2, 1 ]; + st = [ 2, 4, 4, 8, 8, 16 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (column-major, non-contiguous, mixed sign strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 2, 1, 2, 1, 2, 1 ]; + st = [ 2, -4, 4, 8, 8, 16 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ bsize*2, 1, 2, 1, 2, 1 ]; + st = [ -2, -bsize*4, bsize*4, bsize*8, bsize*8, bsize*16 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, bsize*2, 1, 1, 2, 1 ]; + st = [ 2, -4, bsize*8, bsize*8, bsize*8, bsize*16 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, bsize*2, 1, 2, 1 ]; + st = [ 2, 4, -4, bsize*8, bsize*8, bsize*16 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 1, bsize*2, 2, 1 ]; + st = [ 2, 4, -4, 4, bsize*8, bsize*16 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, bsize*2, 1 ]; + st = [ 2, 4, -4, 8, 8, bsize*16 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 6-dimensional ndarray which pass the test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, bsize*2 ]; + st = [ 2, 4, -4, 8, 8, 8 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); diff --git a/lib/node_modules/@stdlib/ndarray/base/count-if/test/test.7d.js b/lib/node_modules/@stdlib/ndarray/base/count-if/test/test.7d.js new file mode 100644 index 000000000000..11b9e1175149 --- /dev/null +++ b/lib/node_modules/@stdlib/ndarray/base/count-if/test/test.7d.js @@ -0,0 +1,2063 @@ +/** +* @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 tape = require( 'tape' ); +var zeros = require( '@stdlib/array/zeros' ); +var ones = require( '@stdlib/array/ones' ); +var real = require( '@stdlib/complex/float64/real' ); +var imag = require( '@stdlib/complex/float64/imag' ); +var Complex128Array = require( '@stdlib/array/complex128' ); +var numel = require( '@stdlib/ndarray/base/numel' ); +var shape2strides = require( '@stdlib/ndarray/base/shape2strides' ); +var strides2offset = require( '@stdlib/ndarray/base/strides2offset' ); +var ndarray = require( '@stdlib/ndarray/ctor' ); +var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' ); +var countIf = require( './../lib' ); + + +// TESTS // + +tape( 'main export is a function', function test( t ) { + t.ok( true, __filename ); + t.strictEqual( typeof countIf, 'function', 'main export is a function'); + t.end(); +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (row-major, singleton dimensions)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 4, 1, 1, 1, 1, 1, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (row-major, singleton dimensions, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 4, 1, 1, 1, 1, 1, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function supports specifying the callback execution context (row-major, contiguous)', function test( t ) { + var expected; + var indices; + var values; + var arrays; + var actual; + var ctx; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 1, 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + indices = []; + values = []; + arrays = []; + + ctx = { + 'count': 0 + }; + actual = countIf( [ x ], clbk, ctx ); + + t.strictEqual( actual, 8, 'returns expected value' ); + t.strictEqual( ctx.count, 8, 'returns expected value' ); + + expected = [ + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0 + ]; + t.deepEqual( values, expected, 'returns expected value' ); + + expected = [ + [ 0, 0, 0, 0, 0, 0, 0 ], + [ 0, 0, 0, 0, 0, 1, 0 ], + [ 0, 0, 0, 1, 0, 0, 0 ], + [ 0, 0, 0, 1, 0, 1, 0 ], + [ 0, 1, 0, 0, 0, 0, 0 ], + [ 0, 1, 0, 0, 0, 1, 0 ], + [ 0, 1, 0, 1, 0, 0, 0 ], + [ 0, 1, 0, 1, 0, 1, 0 ] + ]; + t.deepEqual( indices, expected, 'returns expected value' ); + + expected = [ + x, + x, + x, + x, + x, + x, + x, + x + ]; + t.deepEqual( arrays, expected, 'returns expected value' ); + + t.end(); + + function clbk( v, idx, arr ) { + this.count += 1; // eslint-disable-line no-invalid-this + values.push( v ); + indices.push( idx ); + arrays.push( arr ); + return v !== 0.0; + } +}); + +tape( 'the function supports specifying the callback execution context (row-major, contiguous, accessors)', function test( t ) { + var expected; + var indices; + var values; + var arrays; + var actual; + var xbuf; + var ctx; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 1, 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + indices = []; + values = []; + arrays = []; + + ctx = { + 'count': 0 + }; + actual = countIf( [ x ], clbk, ctx ); + + t.strictEqual( actual, 8, 'returns expected value' ); + t.strictEqual( ctx.count, 8, 'returns expected value' ); + + expected = [ + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ] + ]; + t.deepEqual( values, expected, 'returns expected value' ); + + expected = [ + [ 0, 0, 0, 0, 0, 0, 0 ], + [ 0, 0, 0, 0, 0, 1, 0 ], + [ 0, 0, 0, 1, 0, 0, 0 ], + [ 0, 0, 0, 1, 0, 1, 0 ], + [ 0, 1, 0, 0, 0, 0, 0 ], + [ 0, 1, 0, 0, 0, 1, 0 ], + [ 0, 1, 0, 1, 0, 0, 0 ], + [ 0, 1, 0, 1, 0, 1, 0 ] + ]; + t.deepEqual( indices, expected, 'returns expected value' ); + + expected = [ + x, + x, + x, + x, + x, + x, + x, + x + ]; + t.deepEqual( arrays, expected, 'returns expected value' ); + + t.end(); + + function clbk( v, idx, arr ) { + this.count += 1; // eslint-disable-line no-invalid-this + values.push( [ real( v ), imag( v ) ] ); + indices.push( idx ); + arrays.push( arr ); + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (row-major, contiguous)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 1, 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (row-major, contiguous, negative strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 1, 2, 1, 2, 1, 2, 1 ]; + st = [ -8, -4, -4, -2, -2, -1, -1 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, same sign strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 1, 2, 1, 2, 1, 2, 1 ]; + st = [ 16, 8, 8, 4, 4, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, mixed sign strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 1, 2, 1, 2, 1, 2, 1 ]; + st = [ 16, 8, -8, -4, -4, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ bsize*2, 1, 2, 1, 2, 1, 1 ]; + st = [ -8, 8, 4, 4, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, bsize*2, 1, 1, 2, 1, 1 ]; + st = [ bsize*8, -4, -4, 4, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, bsize*2, 1, 2, 1, 1 ]; + st = [ bsize*8, -bsize*8, -4, 4, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, bsize*2, 1, 1, 1 ]; + st = [ bsize*8, -bsize*8, -bsize*4, 2, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, bsize*2, 1, 1 ]; + st = [ bsize*8, -bsize*8, -bsize*4, bsize*4, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, bsize*2, 1 ]; + st = [ bsize*8, -bsize*8, -bsize*4, bsize*4, bsize*4, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, 1, bsize*2 ]; + st = [ bsize*8, -bsize*8, -bsize*4, bsize*4, bsize*4, bsize*4, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (row-major, contiguous, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 1, 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (row-major, contiguous, negative strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 1, 2, 1, 2, 1, 2, 1 ]; + st = [ -8, -4, -4, -2, -2, -1, -1 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, same sign strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 1, 2, 1, 2, 1, 2, 1 ]; + st = [ 16, 8, 8, 4, 4, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, mixed sign strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 1, 2, 1, 2, 1, 2, 1 ]; + st = [ -16, -8, 8, 4, 4, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ bsize*2, 1, 2, 1, 2, 1, 1 ]; + st = [ -8, 8, 4, 4, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, bsize*2, 1, 2, 1, 1, 1 ]; + st = [ bsize*8, -4, -4, 2, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, bsize*2, 1, 2, 1, 1 ]; + st = [ bsize*8, -bsize*8, -4, 4, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, bsize*2, 1, 1, 1 ]; + st = [ bsize*8, -bsize*8, -bsize*4, 2, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, bsize*2, 1, 1 ]; + st = [ bsize*8, -bsize*8, -bsize*4, bsize*4, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, bsize*2, 1 ]; + st = [ bsize*8, -bsize*8, -bsize*4, bsize*4, bsize*4, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, 1, bsize*2 ]; + st = [ bsize*8, -bsize*8, -bsize*4, bsize*4, bsize*4, bsize*4, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (column-major, singleton dimensions)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 1, 1, 1, 1, 1, 1, 4 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (column-major, singleton dimensions, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 1, 1, 1, 1, 1, 1, 4 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function supports specifying the callback execution context (column-major, contiguous)', function test( t ) { + var expected; + var indices; + var values; + var arrays; + var actual; + var ctx; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 1, 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + indices = []; + values = []; + arrays = []; + + ctx = { + 'count': 0 + }; + actual = countIf( [ x ], clbk, ctx ); + + t.strictEqual( actual, 8, 'returns expected value' ); + t.strictEqual( ctx.count, 8, 'returns expected value' ); + + expected = [ + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0 + ]; + t.deepEqual( values, expected, 'returns expected value' ); + + expected = [ + [ 0, 0, 0, 0, 0, 0, 0 ], + [ 0, 1, 0, 0, 0, 0, 0 ], + [ 0, 0, 0, 1, 0, 0, 0 ], + [ 0, 1, 0, 1, 0, 0, 0 ], + [ 0, 0, 0, 0, 0, 1, 0 ], + [ 0, 1, 0, 0, 0, 1, 0 ], + [ 0, 0, 0, 1, 0, 1, 0 ], + [ 0, 1, 0, 1, 0, 1, 0 ] + ]; + t.deepEqual( indices, expected, 'returns expected value' ); + + expected = [ + x, + x, + x, + x, + x, + x, + x, + x + ]; + t.deepEqual( arrays, expected, 'returns expected value' ); + + t.end(); + + function clbk( v, idx, arr ) { + this.count += 1; // eslint-disable-line no-invalid-this + values.push( v ); + indices.push( idx ); + arrays.push( arr ); + return v !== 0.0; + } +}); + +tape( 'the function supports specifying the callback execution context (column-major, contiguous, accessors)', function test( t ) { + var expected; + var indices; + var values; + var arrays; + var actual; + var xbuf; + var ctx; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 1, 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + indices = []; + values = []; + arrays = []; + + ctx = { + 'count': 0 + }; + actual = countIf( [ x ], clbk, ctx ); + + t.strictEqual( actual, 8, 'returns expected value' ); + t.strictEqual( ctx.count, 8, 'returns expected value' ); + + expected = [ + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ] + ]; + t.deepEqual( values, expected, 'returns expected value' ); + + expected = [ + [ 0, 0, 0, 0, 0, 0, 0 ], + [ 0, 1, 0, 0, 0, 0, 0 ], + [ 0, 0, 0, 1, 0, 0, 0 ], + [ 0, 1, 0, 1, 0, 0, 0 ], + [ 0, 0, 0, 0, 0, 1, 0 ], + [ 0, 1, 0, 0, 0, 1, 0 ], + [ 0, 0, 0, 1, 0, 1, 0 ], + [ 0, 1, 0, 1, 0, 1, 0 ] + ]; + t.deepEqual( indices, expected, 'returns expected value' ); + + expected = [ + x, + x, + x, + x, + x, + x, + x, + x + ]; + t.deepEqual( arrays, expected, 'returns expected value' ); + + t.end(); + + function clbk( v, idx, arr ) { + this.count += 1; // eslint-disable-line no-invalid-this + values.push( [ real( v ), imag( v ) ] ); + indices.push( idx ); + arrays.push( arr ); + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (column-major, contiguous)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 1, 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (column-major, contiguous, negative strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 1, 2, 1, 2, 1, 2, 1 ]; + st = [ -1, -1, -2, -2, 4, -4, 8 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, same sign strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 1, 2, 1, 2, 1, 2, 1 ]; + st = [ 2, 2, 4, 4, 8, 8, 16 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, mixed sign strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 1, 2, 1, 2, 1, 2, 1 ]; + st = [ -2, -2, -4, 4, 8, 8, 16 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ bsize*2, 1, 2, 1, 2, 1, 1 ]; + st = [ 2, bsize*4, -bsize*4, bsize*8, bsize*8, bsize*16, bsize*16 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, bsize*2, 1, 1, 2, 1, 1 ]; + st = [ 2, -4, bsize*8, bsize*8, bsize*8, bsize*16, bsize*16 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, bsize*2, 1, 2, 1, 1 ]; + st = [ 2, -4, 4, bsize*8, bsize*8, bsize*16, bsize*16 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 1, bsize*2, 2, 1, 1 ]; + st = [ -2, -4, 4, 4, bsize*8, bsize*16, bsize*16 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, bsize*2, 1, 1 ]; + st = [ -2, -4, 4, 8, 8, bsize*16, bsize*16 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, bsize*2, 1 ]; + st = [ -2, -4, 4, 8, 8, 8, bsize*16 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, 1, bsize*2 ]; + st = [ -2, -4, 4, 8, 8, 8, 8 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (column-major, contiguous, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 1, 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (column-major, contiguous, negative strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 1, 2, 1, 2, 1, 2, 1 ]; + st = [ -1, -1, -2, -2, 4, 4, 8 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, same sign strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 1, 2, 1, 2, 1, 2, 1 ]; + st = [ 2, 2, 4, 4, 8, 8, 16 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, mixed sign strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 1, 2, 1, 2, 1, 2, 1 ]; + st = [ 2, 2, -4, 4, 8, 8, 16 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ bsize*2, 1, 2, 1, 2, 1, 1 ]; + st = [ -2, -bsize*4, bsize*4, bsize*8, bsize*8, bsize*16, bsize*16 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, bsize*2, 1, 1, 2, 1, 1 ]; + st = [ 2, -4, bsize*8, bsize*8, bsize*8, bsize*16, bsize*16 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, bsize*2, 1, 2, 1, 1 ]; + st = [ 2, 4, -4, bsize*8, bsize*8, bsize*16, bsize*16 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 1, bsize*2, 2, 1, 1 ]; + st = [ 2, 4, -4, 4, bsize*8, bsize*16, bsize*16 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, bsize*2, 1, 1 ]; + st = [ 2, 4, -4, 8, 8, bsize*16, bsize*16 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, bsize*2, 1 ]; + st = [ 2, 4, -4, 8, 8, 8, bsize*16 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 7-dimensional ndarray which pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, 1, bsize*2 ]; + st = [ 2, 4, -4, 8, 8, 8, 8 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); diff --git a/lib/node_modules/@stdlib/ndarray/base/count-if/test/test.8d.js b/lib/node_modules/@stdlib/ndarray/base/count-if/test/test.8d.js new file mode 100644 index 000000000000..965dd642b419 --- /dev/null +++ b/lib/node_modules/@stdlib/ndarray/base/count-if/test/test.8d.js @@ -0,0 +1,2209 @@ +/** +* @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 tape = require( 'tape' ); +var zeros = require( '@stdlib/array/zeros' ); +var ones = require( '@stdlib/array/ones' ); +var real = require( '@stdlib/complex/float64/real' ); +var imag = require( '@stdlib/complex/float64/imag' ); +var Complex128Array = require( '@stdlib/array/complex128' ); +var numel = require( '@stdlib/ndarray/base/numel' ); +var shape2strides = require( '@stdlib/ndarray/base/shape2strides' ); +var strides2offset = require( '@stdlib/ndarray/base/strides2offset' ); +var ndarray = require( '@stdlib/ndarray/ctor' ); +var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' ); +var countIf = require( './../lib' ); + + +// TESTS // + +tape( 'main export is a function', function test( t ) { + t.ok( true, __filename ); + t.strictEqual( typeof countIf, 'function', 'main export is a function'); + t.end(); +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (row-major, singleton dimensions)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 4, 1, 1, 1, 1, 1, 1, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (row-major, singleton dimensions, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 4, 1, 1, 1, 1, 1, 1, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function supports specifying the callback execution context (row-major, contiguous)', function test( t ) { + var expected; + var indices; + var values; + var arrays; + var actual; + var ctx; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + indices = []; + values = []; + arrays = []; + + ctx = { + 'count': 0 + }; + actual = countIf( [ x ], clbk, ctx ); + + t.strictEqual( actual, 8, 'returns expected value' ); + t.strictEqual( ctx.count, 8, 'returns expected value' ); + + expected = [ + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0 + ]; + t.deepEqual( values, expected, 'returns expected value' ); + + expected = [ + [ 0, 0, 0, 0, 0, 0, 0, 0 ], + [ 0, 0, 0, 0, 0, 0, 1, 0 ], + [ 0, 0, 0, 0, 1, 0, 0, 0 ], + [ 0, 0, 0, 0, 1, 0, 1, 0 ], + [ 0, 0, 1, 0, 0, 0, 0, 0 ], + [ 0, 0, 1, 0, 0, 0, 1, 0 ], + [ 0, 0, 1, 0, 1, 0, 0, 0 ], + [ 0, 0, 1, 0, 1, 0, 1, 0 ] + ]; + t.deepEqual( indices, expected, 'returns expected value' ); + + expected = [ + x, + x, + x, + x, + x, + x, + x, + x + ]; + t.deepEqual( arrays, expected, 'returns expected value' ); + + t.end(); + + function clbk( v, idx, arr ) { + this.count += 1; // eslint-disable-line no-invalid-this + values.push( v ); + indices.push( idx ); + arrays.push( arr ); + return v !== 0.0; + } +}); + +tape( 'the function supports specifying the callback execution context (row-major, contiguous, accessors)', function test( t ) { + var expected; + var indices; + var values; + var arrays; + var actual; + var xbuf; + var ctx; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + indices = []; + values = []; + arrays = []; + + ctx = { + 'count': 0 + }; + actual = countIf( [ x ], clbk, ctx ); + + t.strictEqual( actual, 8, 'returns expected value' ); + t.strictEqual( ctx.count, 8, 'returns expected value' ); + + expected = [ + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ] + ]; + t.deepEqual( values, expected, 'returns expected value' ); + + expected = [ + [ 0, 0, 0, 0, 0, 0, 0, 0 ], + [ 0, 0, 0, 0, 0, 0, 1, 0 ], + [ 0, 0, 0, 0, 1, 0, 0, 0 ], + [ 0, 0, 0, 0, 1, 0, 1, 0 ], + [ 0, 0, 1, 0, 0, 0, 0, 0 ], + [ 0, 0, 1, 0, 0, 0, 1, 0 ], + [ 0, 0, 1, 0, 1, 0, 0, 0 ], + [ 0, 0, 1, 0, 1, 0, 1, 0 ] + ]; + t.deepEqual( indices, expected, 'returns expected value' ); + + expected = [ + x, + x, + x, + x, + x, + x, + x, + x + ]; + t.deepEqual( arrays, expected, 'returns expected value' ); + + t.end(); + + function clbk( v, idx, arr ) { + this.count += 1; // eslint-disable-line no-invalid-this + values.push( [ real( v ), imag( v ) ] ); + indices.push( idx ); + arrays.push( arr ); + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (row-major, contiguous)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (row-major, contiguous, negative strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ -8, -8, -4, -4, -2, -2, -1, -1 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, same sign strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ 16, 16, 8, 8, 4, 4, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, mixed sign strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ 16, 16, 8, -8, -4, -4, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ bsize*2, 1, 2, 1, 2, 1, 1, 1 ]; + st = [ -8, 8, 4, 4, 2, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, bsize*2, 1, 1, 2, 1, 1, 1 ]; + st = [ bsize*8, -4, -4, 4, 2, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, bsize*2, 1, 2, 1, 1, 1 ]; + st = [ bsize*8, -bsize*8, -4, 4, 2, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, bsize*2, 1, 1, 1, 1 ]; + st = [ bsize*8, -bsize*8, -bsize*4, 2, 2, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, bsize*2, 1, 1, 1 ]; + st = [ bsize*8, -bsize*8, -bsize*4, bsize*4, 2, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, bsize*2, 1, 1 ]; + st = [ bsize*8, -bsize*8, -bsize*4, bsize*4, bsize*4, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, 1, bsize*2, 1 ]; + st = [ bsize*8, -bsize*8, -bsize*4, bsize*4, bsize*4, bsize*4, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, 1, 1, bsize*2 ]; + st = [ bsize*8, -bsize*8, -bsize*4, bsize*4, bsize*4, bsize*4, bsize*4, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (row-major, contiguous, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (row-major, contiguous, negative strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ -8, -8, -4, -4, -2, -2, -1, -1 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, same sign strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ 16, 16, 8, 8, 4, 4, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, mixed sign strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ -16, -16, -8, 8, 4, 4, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ bsize*2, 1, 2, 1, 2, 1, 1, 1 ]; + st = [ -8, 8, 4, 4, 2, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, bsize*2, 1, 2, 1, 1, 1, 1 ]; + st = [ bsize*8, -4, -4, 2, 2, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, bsize*2, 1, 2, 1, 1, 1 ]; + st = [ bsize*8, -bsize*8, -4, 4, 2, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, bsize*2, 1, 1, 1, 1 ]; + st = [ bsize*8, -bsize*8, -bsize*4, 2, 2, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, bsize*2, 1, 1, 1 ]; + st = [ bsize*8, -bsize*8, -bsize*4, bsize*4, 2, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, bsize*2, 1, 1 ]; + st = [ bsize*8, -bsize*8, -bsize*4, bsize*4, bsize*4, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, 1, bsize*2, 1 ]; + st = [ bsize*8, -bsize*8, -bsize*4, bsize*4, bsize*4, bsize*4, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, 1, 1, bsize*2 ]; + st = [ bsize*8, -bsize*8, -bsize*4, bsize*4, bsize*4, bsize*4, bsize*4, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (column-major, singleton dimensions)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 1, 1, 1, 1, 1, 1, 1, 4 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (column-major, singleton dimensions, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 1, 1, 1, 1, 1, 1, 1, 4 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function supports specifying the callback execution context (column-major, contiguous)', function test( t ) { + var expected; + var indices; + var values; + var arrays; + var actual; + var ctx; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + indices = []; + values = []; + arrays = []; + + ctx = { + 'count': 0 + }; + actual = countIf( [ x ], clbk, ctx ); + + t.strictEqual( actual, 8, 'returns expected value' ); + t.strictEqual( ctx.count, 8, 'returns expected value' ); + + expected = [ + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0 + ]; + t.deepEqual( values, expected, 'returns expected value' ); + + expected = [ + [ 0, 0, 0, 0, 0, 0, 0, 0 ], + [ 0, 0, 1, 0, 0, 0, 0, 0 ], + [ 0, 0, 0, 0, 1, 0, 0, 0 ], + [ 0, 0, 1, 0, 1, 0, 0, 0 ], + [ 0, 0, 0, 0, 0, 0, 1, 0 ], + [ 0, 0, 1, 0, 0, 0, 1, 0 ], + [ 0, 0, 0, 0, 1, 0, 1, 0 ], + [ 0, 0, 1, 0, 1, 0, 1, 0 ] + ]; + t.deepEqual( indices, expected, 'returns expected value' ); + + expected = [ + x, + x, + x, + x, + x, + x, + x, + x + ]; + t.deepEqual( arrays, expected, 'returns expected value' ); + + t.end(); + + function clbk( v, idx, arr ) { + this.count += 1; // eslint-disable-line no-invalid-this + values.push( v ); + indices.push( idx ); + arrays.push( arr ); + return v !== 0.0; + } +}); + +tape( 'the function supports specifying the callback execution context (column-major, contiguous, accessors)', function test( t ) { + var expected; + var indices; + var values; + var arrays; + var actual; + var xbuf; + var ctx; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + indices = []; + values = []; + arrays = []; + + ctx = { + 'count': 0 + }; + actual = countIf( [ x ], clbk, ctx ); + + t.strictEqual( actual, 8, 'returns expected value' ); + t.strictEqual( ctx.count, 8, 'returns expected value' ); + + expected = [ + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ] + ]; + t.deepEqual( values, expected, 'returns expected value' ); + + expected = [ + [ 0, 0, 0, 0, 0, 0, 0, 0 ], + [ 0, 0, 1, 0, 0, 0, 0, 0 ], + [ 0, 0, 0, 0, 1, 0, 0, 0 ], + [ 0, 0, 1, 0, 1, 0, 0, 0 ], + [ 0, 0, 0, 0, 0, 0, 1, 0 ], + [ 0, 0, 1, 0, 0, 0, 1, 0 ], + [ 0, 0, 0, 0, 1, 0, 1, 0 ], + [ 0, 0, 1, 0, 1, 0, 1, 0 ] + ]; + t.deepEqual( indices, expected, 'returns expected value' ); + + expected = [ + x, + x, + x, + x, + x, + x, + x, + x + ]; + t.deepEqual( arrays, expected, 'returns expected value' ); + + t.end(); + + function clbk( v, idx, arr ) { + this.count += 1; // eslint-disable-line no-invalid-this + values.push( [ real( v ), imag( v ) ] ); + indices.push( idx ); + arrays.push( arr ); + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (column-major, contiguous)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (column-major, contiguous, negative strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ -1, -1, -1, -2, -2, 4, -4, 8 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, same sign strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ 2, 2, 2, 4, 4, 8, 8, 16 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, mixed sign strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ -2, -2, -2, -4, 4, 8, 8, 16 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ bsize*2, 1, 2, 1, 2, 1, 1, 1 ]; + st = [ 2, bsize*4, -bsize*4, bsize*8, bsize*8, bsize*16, bsize*16, bsize*16 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, bsize*2, 1, 1, 2, 1, 1, 1 ]; + st = [ 2, -4, bsize*8, bsize*8, bsize*8, bsize*16, bsize*16, bsize*16 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, bsize*2, 1, 2, 1, 1, 1 ]; + st = [ 2, -4, 4, bsize*8, bsize*8, bsize*16, bsize*16, bsize*16 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 1, bsize*2, 2, 1, 1, 1 ]; + st = [ -2, -4, 4, 4, bsize*8, bsize*16, bsize*16, bsize*16 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, bsize*2, 1, 1, 1 ]; + st = [ -2, -4, 4, 8, 8, bsize*16, bsize*16, bsize*16 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, bsize*2, 1, 1 ]; + st = [ -2, -4, 4, 8, 8, 8, bsize*16, bsize*16 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, 1, bsize*2, 1 ]; + st = [ -2, -4, 4, 8, 8, 8, 8, bsize*16 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, 1, 1, bsize*2 ]; + st = [ -2, -4, 4, 8, 8, 8, 8, 8 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (column-major, contiguous, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (column-major, contiguous, negative strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ -1, -1, -1, -2, -2, 4, 4, 8 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, same sign strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ 2, 2, 2, 4, 4, 8, 8, 16 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, mixed sign strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ 2, 2, 2, -4, 4, 8, 8, 16 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ bsize*2, 1, 2, 1, 2, 1, 1, 1 ]; + st = [ -2, -bsize*4, bsize*4, bsize*8, bsize*8, bsize*16, bsize*16, bsize*16 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, bsize*2, 1, 1, 2, 1, 1, 1 ]; + st = [ 2, -4, bsize*8, bsize*8, bsize*8, bsize*16, bsize*16, bsize*16 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, bsize*2, 1, 2, 1, 1, 1 ]; + st = [ 2, 4, -4, bsize*8, bsize*8, bsize*16, bsize*16, bsize*16 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 1, bsize*2, 2, 1, 1, 1 ]; + st = [ 2, 4, -4, 4, bsize*8, bsize*16, bsize*16, bsize*16 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, bsize*2, 1, 1, 1 ]; + st = [ 2, 4, -4, 8, 8, bsize*16, bsize*16, bsize*16 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, bsize*2, 1, 1 ]; + st = [ 2, 4, -4, 8, 8, 8, bsize*16, bsize*16 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, 1, bsize*2, 1 ]; + st = [ 2, 4, -4, 8, 8, 8, 8, bsize*16 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 8-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, 1, 1, bsize*2 ]; + st = [ 2, 4, -4, 8, 8, 8, 8, 8 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); diff --git a/lib/node_modules/@stdlib/ndarray/base/count-if/test/test.9d.js b/lib/node_modules/@stdlib/ndarray/base/count-if/test/test.9d.js new file mode 100644 index 000000000000..a97f1a295e1d --- /dev/null +++ b/lib/node_modules/@stdlib/ndarray/base/count-if/test/test.9d.js @@ -0,0 +1,2435 @@ +/** +* @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 tape = require( 'tape' ); +var zeros = require( '@stdlib/array/zeros' ); +var ones = require( '@stdlib/array/ones' ); +var real = require( '@stdlib/complex/float64/real' ); +var imag = require( '@stdlib/complex/float64/imag' ); +var Complex128Array = require( '@stdlib/array/complex128' ); +var numel = require( '@stdlib/ndarray/base/numel' ); +var shape2strides = require( '@stdlib/ndarray/base/shape2strides' ); +var strides2offset = require( '@stdlib/ndarray/base/strides2offset' ); +var ndarray = require( '@stdlib/ndarray/ctor' ); +var blockSize = require( '@stdlib/ndarray/base/nullary-tiling-block-size' ); +var countIf = require( './../lib' ); + + +// TESTS // + +tape( 'main export is a function', function test( t ) { + t.ok( true, __filename ); + t.strictEqual( typeof countIf, 'function', 'main export is a function'); + t.end(); +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (row-major, singleton dimensions)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 4, 1, 1, 1, 1, 1, 1, 1, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (row-major, singleton dimensions, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 4, 1, 1, 1, 1, 1, 1, 1, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function supports specifying the callback execution context (row-major, contiguous)', function test( t ) { + var expected; + var indices; + var values; + var arrays; + var actual; + var ctx; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + indices = []; + values = []; + arrays = []; + + ctx = { + 'count': 0 + }; + actual = countIf( [ x ], clbk, ctx ); + + t.strictEqual( actual, 8, 'returns expected value' ); + t.strictEqual( ctx.count, 8, 'returns expected value' ); + + expected = [ + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0 + ]; + t.deepEqual( values, expected, 'returns expected value' ); + + expected = [ + [ 0, 0, 0, 0, 0, 0, 0, 0, 0 ], + [ 0, 0, 0, 0, 0, 0, 0, 1, 0 ], + [ 0, 0, 0, 0, 0, 1, 0, 0, 0 ], + [ 0, 0, 0, 0, 0, 1, 0, 1, 0 ], + [ 0, 0, 0, 1, 0, 0, 0, 0, 0 ], + [ 0, 0, 0, 1, 0, 0, 0, 1, 0 ], + [ 0, 0, 0, 1, 0, 1, 0, 0, 0 ], + [ 0, 0, 0, 1, 0, 1, 0, 1, 0 ] + ]; + t.deepEqual( indices, expected, 'returns expected value' ); + + expected = [ + x, + x, + x, + x, + x, + x, + x, + x + ]; + t.deepEqual( arrays, expected, 'returns expected value' ); + + t.end(); + + function clbk( v, idx, arr ) { + this.count += 1; // eslint-disable-line no-invalid-this + values.push( v ); + indices.push( idx ); + arrays.push( arr ); + return v !== 0.0; + } +}); + +tape( 'the function supports specifying the callback execution context (row-major, contiguous, accessors)', function test( t ) { + var expected; + var indices; + var values; + var arrays; + var actual; + var xbuf; + var ctx; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + indices = []; + values = []; + arrays = []; + + ctx = { + 'count': 0 + }; + actual = countIf( [ x ], clbk, ctx ); + + t.strictEqual( actual, 8, 'returns expected value' ); + t.strictEqual( ctx.count, 8, 'returns expected value' ); + + expected = [ + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ] + ]; + t.deepEqual( values, expected, 'returns expected value' ); + + expected = [ + [ 0, 0, 0, 0, 0, 0, 0, 0, 0 ], + [ 0, 0, 0, 0, 0, 0, 0, 1, 0 ], + [ 0, 0, 0, 0, 0, 1, 0, 0, 0 ], + [ 0, 0, 0, 0, 0, 1, 0, 1, 0 ], + [ 0, 0, 0, 1, 0, 0, 0, 0, 0 ], + [ 0, 0, 0, 1, 0, 0, 0, 1, 0 ], + [ 0, 0, 0, 1, 0, 1, 0, 0, 0 ], + [ 0, 0, 0, 1, 0, 1, 0, 1, 0 ] + ]; + t.deepEqual( indices, expected, 'returns expected value' ); + + expected = [ + x, + x, + x, + x, + x, + x, + x, + x + ]; + t.deepEqual( arrays, expected, 'returns expected value' ); + + t.end(); + + function clbk( v, idx, arr ) { + this.count += 1; // eslint-disable-line no-invalid-this + values.push( [ real( v ), imag( v ) ] ); + indices.push( idx ); + arrays.push( arr ); + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (row-major, contiguous)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (row-major, contiguous, negative strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ -8, -8, -8, -4, -4, -2, -2, -1, -1 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, same sign strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ 16, 16, 16, 8, 8, 4, 4, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, mixed sign strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ 16, 16, 16, 8, -8, -4, -4, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ bsize*2, 1, 2, 1, 2, 1, 1, 1, 1 ]; + st = [ -8, 8, 4, 4, 2, 2, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, bsize*2, 1, 1, 2, 1, 1, 1, 1 ]; + st = [ bsize*8, -4, -4, 4, 2, 2, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, bsize*2, 1, 2, 1, 1, 1, 1 ]; + st = [ bsize*8, -bsize*8, -4, 4, 2, 2, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, bsize*2, 1, 1, 1, 1, 1 ]; + st = [ bsize*8, -bsize*8, -bsize*4, 2, 2, 2, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, bsize*2, 1, 1, 1, 1 ]; + st = [ bsize*8, -bsize*8, -bsize*4, bsize*4, 2, 2, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, bsize*2, 1, 1, 1 ]; + st = [ bsize*8, -bsize*8, -bsize*4, bsize*4, bsize*4, 2, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, 1, bsize*2, 1, 1 ]; + st = [ bsize*8, -bsize*8, -bsize*4, bsize*4, bsize*4, bsize*4, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, 1, 1, bsize*2, 1 ]; + st = [ + bsize*8, + -bsize*8, + -bsize*4, + bsize*4, + bsize*4, + bsize*4, + bsize*4, + 2, + 2 + ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, 1, 1, 1, bsize*2 ]; + st = [ + bsize*8, + -bsize*8, + -bsize*4, + bsize*4, + bsize*4, + bsize*4, + bsize*4, + bsize*4, + 2 + ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (row-major, contiguous, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (row-major, contiguous, negative strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ -8, -8, -8, -4, -4, -2, -2, -1, -1 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, same sign strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ 16, 16, 16, 8, 8, 4, 4, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, mixed sign strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ -16, -16, -16, -8, 8, 4, 4, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ bsize*2, 1, 2, 1, 2, 1, 1, 1, 1 ]; + st = [ -8, 8, 4, 4, 2, 2, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, bsize*2, 1, 2, 1, 1, 1, 1, 1 ]; + st = [ bsize*8, -4, -4, 2, 2, 2, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, bsize*2, 1, 2, 1, 1, 1, 1 ]; + st = [ bsize*8, -bsize*8, -4, 4, 2, 2, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, bsize*2, 1, 1, 1, 1, 1 ]; + st = [ bsize*8, -bsize*8, -bsize*4, 2, 2, 2, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, bsize*2, 1, 1, 1, 1 ]; + st = [ bsize*8, -bsize*8, -bsize*4, bsize*4, 2, 2, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, bsize*2, 1, 1, 1 ]; + st = [ bsize*8, -bsize*8, -bsize*4, bsize*4, bsize*4, 2, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, 1, bsize*2, 1, 1 ]; + st = [ bsize*8, -bsize*8, -bsize*4, bsize*4, bsize*4, bsize*4, 2, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, 1, 1, bsize*2, 1 ]; + st = [ + bsize*8, + -bsize*8, + -bsize*4, + bsize*4, + bsize*4, + bsize*4, + bsize*4, + 2, + 2 + ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, 1, 1, 1, bsize*2 ]; + st = [ + bsize*8, + -bsize*8, + -bsize*4, + bsize*4, + bsize*4, + bsize*4, + bsize*4, + bsize*4, + 2 + ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (column-major, singleton dimensions)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 1, 1, 1, 1, 1, 1, 1, 1, 4 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (column-major, singleton dimensions, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 1, 1, 1, 1, 1, 1, 1, 1, 4 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function supports specifying the callback execution context (column-major, contiguous)', function test( t ) { + var expected; + var indices; + var values; + var arrays; + var actual; + var ctx; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + indices = []; + values = []; + arrays = []; + + ctx = { + 'count': 0 + }; + actual = countIf( [ x ], clbk, ctx ); + + t.strictEqual( actual, 8, 'returns expected value' ); + t.strictEqual( ctx.count, 8, 'returns expected value' ); + + expected = [ + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0 + ]; + t.deepEqual( values, expected, 'returns expected value' ); + + expected = [ + [ 0, 0, 0, 0, 0, 0, 0, 0, 0 ], + [ 0, 0, 0, 1, 0, 0, 0, 0, 0 ], + [ 0, 0, 0, 0, 0, 1, 0, 0, 0 ], + [ 0, 0, 0, 1, 0, 1, 0, 0, 0 ], + [ 0, 0, 0, 0, 0, 0, 0, 1, 0 ], + [ 0, 0, 0, 1, 0, 0, 0, 1, 0 ], + [ 0, 0, 0, 0, 0, 1, 0, 1, 0 ], + [ 0, 0, 0, 1, 0, 1, 0, 1, 0 ] + ]; + t.deepEqual( indices, expected, 'returns expected value' ); + + expected = [ + x, + x, + x, + x, + x, + x, + x, + x + ]; + t.deepEqual( arrays, expected, 'returns expected value' ); + + t.end(); + + function clbk( v, idx, arr ) { + this.count += 1; // eslint-disable-line no-invalid-this + values.push( v ); + indices.push( idx ); + arrays.push( arr ); + return v !== 0.0; + } +}); + +tape( 'the function supports specifying the callback execution context (column-major, contiguous, accessors)', function test( t ) { + var expected; + var indices; + var values; + var arrays; + var actual; + var xbuf; + var ctx; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + indices = []; + values = []; + arrays = []; + + ctx = { + 'count': 0 + }; + actual = countIf( [ x ], clbk, ctx ); + + t.strictEqual( actual, 8, 'returns expected value' ); + t.strictEqual( ctx.count, 8, 'returns expected value' ); + + expected = [ + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ] + ]; + t.deepEqual( values, expected, 'returns expected value' ); + + expected = [ + [ 0, 0, 0, 0, 0, 0, 0, 0, 0 ], + [ 0, 0, 0, 1, 0, 0, 0, 0, 0 ], + [ 0, 0, 0, 0, 0, 1, 0, 0, 0 ], + [ 0, 0, 0, 1, 0, 1, 0, 0, 0 ], + [ 0, 0, 0, 0, 0, 0, 0, 1, 0 ], + [ 0, 0, 0, 1, 0, 0, 0, 1, 0 ], + [ 0, 0, 0, 0, 0, 1, 0, 1, 0 ], + [ 0, 0, 0, 1, 0, 1, 0, 1, 0 ] + ]; + t.deepEqual( indices, expected, 'returns expected value' ); + + expected = [ + x, + x, + x, + x, + x, + x, + x, + x + ]; + t.deepEqual( arrays, expected, 'returns expected value' ); + + t.end(); + + function clbk( v, idx, arr ) { + this.count += 1; // eslint-disable-line no-invalid-this + values.push( [ real( v ), imag( v ) ] ); + indices.push( idx ); + arrays.push( arr ); + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (column-major, contiguous)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (column-major, contiguous, negative strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ -1, -1, -1, -1, -2, -2, 4, -4, 8 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, same sign strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ 2, 2, 2, 2, 4, 4, 8, 8, 16 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, mixed sign strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ -2, -2, -2, -2, -4, 4, 8, 8, 16 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ bsize*2, 1, 2, 1, 2, 1, 1, 1, 1 ]; + st = [ + 2, + bsize*4, + -bsize*4, + bsize*8, + bsize*8, + bsize*16, + bsize*16, + bsize*16, + bsize*16 + ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, bsize*2, 1, 1, 2, 1, 1, 1, 1 ]; + st = [ + 2, + -4, + bsize*8, + bsize*8, + bsize*8, + bsize*16, + bsize*16, + bsize*16, + bsize*16 + ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, bsize*2, 1, 2, 1, 1, 1, 1 ]; + st = [ 2, -4, 4, bsize*8, bsize*8, bsize*16, bsize*16, bsize*16, bsize*16 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 1, bsize*2, 2, 1, 1, 1, 1 ]; + st = [ -2, -4, 4, 4, bsize*8, bsize*16, bsize*16, bsize*16, bsize*16 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, bsize*2, 1, 1, 1, 1 ]; + st = [ -2, -4, 4, 8, 8, bsize*16, bsize*16, bsize*16, bsize*16 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, bsize*2, 1, 1, 1 ]; + st = [ -2, -4, 4, 8, 8, 8, bsize*16, bsize*16, bsize*16 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, 1, bsize*2, 1, 1 ]; + st = [ -2, -4, 4, 8, 8, 8, 8, bsize*16, bsize*16 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, 1, 1, bsize*2, 1 ]; + st = [ -2, -4, 4, 8, 8, 8, 8, 8, bsize*16 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, large arrays)', function test( t ) { + var actual; + var bsize; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, 1, 1, 1, bsize*2 ]; + st = [ -2, -4, 4, 8, 8, 8, 8, 8, 8 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*2, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (column-major, contiguous, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (column-major, contiguous, negative strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ -1, -1, -1, -1, -2, -2, 4, 4, 8 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, same sign strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ 2, 2, 2, 2, 4, 4, 8, 8, 16 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, mixed sign strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ 2, 2, 2, 2, -4, 4, 8, 8, 16 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ bsize*2, 1, 2, 1, 2, 1, 1, 1, 1 ]; + st = [ + -2, + -bsize*4, + bsize*4, + bsize*8, + bsize*8, + bsize*16, + bsize*16, + bsize*16, + bsize*16 + ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, bsize*2, 1, 1, 2, 1, 1, 1, 1 ]; + st = [ + 2, + -4, + bsize*8, + bsize*8, + bsize*8, + bsize*16, + bsize*16, + bsize*16, + bsize*16 + ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, bsize*2, 1, 2, 1, 1, 1, 1 ]; + st = [ 2, 4, -4, bsize*8, bsize*8, bsize*16, bsize*16, bsize*16, bsize*16 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 1, bsize*2, 2, 1, 1, 1, 1 ]; + st = [ 2, 4, -4, 4, bsize*8, bsize*16, bsize*16, bsize*16, bsize*16 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, bsize*2, 1, 1, 1, 1 ]; + st = [ 2, 4, -4, 8, 8, bsize*16, bsize*16, bsize*16, bsize*16 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, bsize*2, 1, 1, 1 ]; + st = [ 2, 4, -4, 8, 8, 8, bsize*16, bsize*16, bsize*16 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, 1, bsize*2, 1, 1 ]; + st = [ 2, 4, -4, 8, 8, 8, 8, bsize*16, bsize*16 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, 1, 1, bsize*2, 1 ]; + st = [ 2, 4, -4, 8, 8, 8, 8, 8, bsize*16 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a 9-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, large arrays, accessors)', function test( t ) { + var actual; + var bsize; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + + bsize = blockSize( dt ); + sh = [ 2, 1, 2, 1, 1, 1, 1, 1, bsize*2 ]; + st = [ 2, 4, -4, 8, 8, 8, 8, 8, 8 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, bsize*8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); diff --git a/lib/node_modules/@stdlib/ndarray/base/count-if/test/test.js b/lib/node_modules/@stdlib/ndarray/base/count-if/test/test.js index 509fad85a45e..1d769246b667 100644 --- a/lib/node_modules/@stdlib/ndarray/base/count-if/test/test.js +++ b/lib/node_modules/@stdlib/ndarray/base/count-if/test/test.js @@ -21,6 +21,8 @@ // MODULES // var tape = require( 'tape' ); +var ones = require( '@stdlib/array/ones' ); +var ndarray = require( '@stdlib/ndarray/ctor' ); var countIf = require( './../lib' ); @@ -31,3 +33,19 @@ tape( 'main export is a function', function test( t ) { t.strictEqual( typeof countIf, 'function', 'main export is a function' ); t.end(); }); + +tape( 'the function returns `0` if provided an empty input ndarray', function test( t ) { + var actual; + var x; + + x = ndarray( 'float64', ones( 8, 'float64' ), [ 0 ], [ 1 ], 0, 'row-major' ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0.0; + } +}); diff --git a/lib/node_modules/@stdlib/ndarray/base/count-if/test/test.nd.js b/lib/node_modules/@stdlib/ndarray/base/count-if/test/test.nd.js new file mode 100644 index 000000000000..daa0f1e541eb --- /dev/null +++ b/lib/node_modules/@stdlib/ndarray/base/count-if/test/test.nd.js @@ -0,0 +1,1040 @@ +/** +* @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 tape = require( 'tape' ); +var zeros = require( '@stdlib/array/zeros' ); +var ones = require( '@stdlib/array/ones' ); +var real = require( '@stdlib/complex/float64/real' ); +var imag = require( '@stdlib/complex/float64/imag' ); +var Complex128Array = require( '@stdlib/array/complex128' ); +var numel = require( '@stdlib/ndarray/base/numel' ); +var shape2strides = require( '@stdlib/ndarray/base/shape2strides' ); +var strides2offset = require( '@stdlib/ndarray/base/strides2offset' ); +var ndarray = require( '@stdlib/ndarray/ctor' ); +var countIf = require( './../lib' ); + + +// TESTS // + +tape( 'main export is a function', function test( t ) { + t.ok( true, __filename ); + t.strictEqual( typeof countIf, 'function', 'main export is a function'); + t.end(); +}); + +tape( 'the function counts the number of elements in a n-dimensional ndarray pass a test implemented by a predicate function (row-major, singleton dimensions)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a n-dimensional ndarray pass a test implemented by a predicate function (row-major, singleton dimensions, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function supports specifying the callback execution context (row-major, contiguous)', function test( t ) { + var expected; + var indices; + var values; + var arrays; + var actual; + var ctx; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + indices = []; + values = []; + arrays = []; + + ctx = { + 'count': 0 + }; + actual = countIf( [ x ], clbk, ctx ); + + t.strictEqual( actual, 8, 'returns expected value' ); + t.strictEqual( ctx.count, 8, 'returns expected value' ); + + expected = [ + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0 + ]; + t.deepEqual( values, expected, 'returns expected value' ); + + expected = [ + [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ], + [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0 ], + [ 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0 ], + [ 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0 ], + [ 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0 ], + [ 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0 ], + [ 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0 ], + [ 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0 ] + ]; + t.deepEqual( indices, expected, 'returns expected value' ); + + expected = [ + x, + x, + x, + x, + x, + x, + x, + x + ]; + t.deepEqual( arrays, expected, 'returns expected value' ); + + t.end(); + + function clbk( v, idx, arr ) { + this.count += 1; // eslint-disable-line no-invalid-this + values.push( v ); + indices.push( idx ); + arrays.push( arr ); + return v !== 0.0; + } +}); + +tape( 'the function supports specifying the callback execution context (row-major, contiguous, accessors)', function test( t ) { + var expected; + var indices; + var values; + var arrays; + var actual; + var xbuf; + var ctx; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + indices = []; + values = []; + arrays = []; + + ctx = { + 'count': 0 + }; + actual = countIf( [ x ], clbk, ctx ); + + t.strictEqual( actual, 8, 'returns expected value' ); + t.strictEqual( ctx.count, 8, 'returns expected value' ); + + expected = [ + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ] + ]; + t.deepEqual( values, expected, 'returns expected value' ); + + expected = [ + [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ], + [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0 ], + [ 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0 ], + [ 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0 ], + [ 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0 ], + [ 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0 ], + [ 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0 ], + [ 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0 ] + ]; + t.deepEqual( indices, expected, 'returns expected value' ); + + expected = [ + x, + x, + x, + x, + x, + x, + x, + x + ]; + t.deepEqual( arrays, expected, 'returns expected value' ); + + t.end(); + + function clbk( v, idx, arr ) { + this.count += 1; // eslint-disable-line no-invalid-this + values.push( [ real( v ), imag( v ) ] ); + indices.push( idx ); + arrays.push( arr ); + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a n-dimensional ndarray pass a test implemented by a predicate function (row-major, contiguous)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a n-dimensional ndarray pass a test implemented by a predicate function (row-major, contiguous, negative strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ -8, -8, -8, -8, -8, -4, -4, -2, -2, -1, -1 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a n-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, same sign strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ 16, 16, 16, 16, 16, 8, 8, 4, 4, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a n-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, mixed sign strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'row-major'; + sh = [ 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ 16, 16, 16, 16, 16, 8, -8, -4, -4, 2, 2 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a n-dimensional ndarray pass a test implemented by a predicate function (row-major, contiguous, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a n-dimensional ndarray pass a test implemented by a predicate function (row-major, contiguous, negative strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ -8, -8, -8, -8, -8, -4, -4, -2, -2, -1, -1 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a n-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, same sign strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ 16, 16, 16, 16, 16, 8, 8, 4, 4, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a n-dimensional ndarray pass a test implemented by a predicate function (row-major, non-contiguous, mixed sign strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'row-major'; + sh = [ 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ -16, -16, -16, -16, -16, -8, 8, 4, 4, 2, 2 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a n-dimensional ndarray pass a test implemented by a predicate function (column-major, singleton dimensions)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a n-dimensional ndarray pass a test implemented by a predicate function (column-major, singleton dimensions, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 4, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function supports specifying the callback execution context (column-major, contiguous)', function test( t ) { + var expected; + var indices; + var values; + var arrays; + var actual; + var ctx; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + indices = []; + values = []; + arrays = []; + + ctx = { + 'count': 0 + }; + actual = countIf( [ x ], clbk, ctx ); + + t.strictEqual( actual, 8, 'returns expected value' ); + t.strictEqual( ctx.count, 8, 'returns expected value' ); + + expected = [ + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0, + 1.0 + ]; + t.deepEqual( values, expected, 'returns expected value' ); + + expected = [ + [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ], + [ 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0 ], + [ 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0 ], + [ 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0 ], + [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0 ], + [ 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0 ], + [ 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0 ], + [ 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0 ] + ]; + t.deepEqual( indices, expected, 'returns expected value' ); + + expected = [ + x, + x, + x, + x, + x, + x, + x, + x + ]; + t.deepEqual( arrays, expected, 'returns expected value' ); + + t.end(); + + function clbk( v, idx, arr ) { + this.count += 1; // eslint-disable-line no-invalid-this + values.push( v ); + indices.push( idx ); + arrays.push( arr ); + return v !== 0.0; + } +}); + +tape( 'the function supports specifying the callback execution context (column-major, contiguous, accessors)', function test( t ) { + var expected; + var indices; + var values; + var arrays; + var actual; + var xbuf; + var ctx; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + indices = []; + values = []; + arrays = []; + + ctx = { + 'count': 0 + }; + actual = countIf( [ x ], clbk, ctx ); + + t.strictEqual( actual, 8, 'returns expected value' ); + t.strictEqual( ctx.count, 8, 'returns expected value' ); + + expected = [ + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ], + [ 1.0, 1.0 ] + ]; + t.deepEqual( values, expected, 'returns expected value' ); + + expected = [ + [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ], + [ 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0 ], + [ 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0 ], + [ 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0 ], + [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0 ], + [ 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0 ], + [ 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0 ], + [ 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0 ] + ]; + t.deepEqual( indices, expected, 'returns expected value' ); + + expected = [ + x, + x, + x, + x, + x, + x, + x, + x + ]; + t.deepEqual( arrays, expected, 'returns expected value' ); + + t.end(); + + function clbk( v, idx, arr ) { + this.count += 1; // eslint-disable-line no-invalid-this + values.push( [ real( v ), imag( v ) ] ); + indices.push( idx ); + arrays.push( arr ); + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a n-dimensional ndarray pass a test implemented by a predicate function (column-major, contiguous)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a n-dimensional ndarray pass a test implemented by a predicate function (column-major, contiguous, negative strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ -1, -1, -1, -1, -1, -1, -2, -2, 4, -4, 8 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh ), dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a n-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, same sign strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ 2, 2, 2, 2, 2, 2, 4, 4, 8, 8, 16 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a n-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, mixed sign strides)', function test( t ) { + var actual; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'float64'; + ord = 'column-major'; + sh = [ 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ -2, -2, -2, -2, -2, -2, -4, 4, 8, 8, 16 ]; + o = strides2offset( sh, st ); + + x = ndarray( dt, zeros( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + x = ndarray( dt, ones( numel( sh )*4, dt ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return v !== 0; + } +}); + +tape( 'the function counts the number of elements in a n-dimensional ndarray pass a test implemented by a predicate function (column-major, contiguous, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = shape2strides( sh, ord ); + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a n-dimensional ndarray pass a test implemented by a predicate function (column-major, contiguous, negative strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ -1, -1, -1, -1, -1, -1, -2, -2, 4, 4, 8 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( numel( sh )*2, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a n-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, same sign strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ 2, 2, 2, 2, 2, 2, 4, 4, 8, 8, 16 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +}); + +tape( 'the function counts the number of elements in a n-dimensional ndarray pass a test implemented by a predicate function (column-major, non-contiguous, mixed sign strides, accessors)', function test( t ) { + var actual; + var xbuf; + var ord; + var sh; + var st; + var dt; + var o; + var x; + + dt = 'complex128'; + ord = 'column-major'; + sh = [ 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1 ]; + st = [ 2, 2, 2, 2, 2, 2, -4, 4, 8, 8, 16 ]; + o = strides2offset( sh, st ); + + xbuf = zeros( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 0, 'returns expected value' ); + + xbuf = ones( 8*4, 'float64' ); + x = ndarray( dt, new Complex128Array( xbuf ), sh, st, o, ord ); + + actual = countIf( [ x ], clbk ); + t.strictEqual( actual, 8, 'returns expected value' ); + + t.end(); + + function clbk( v ) { + return ( real( v ) !== 0.0 && imag( v ) !== 0.0 ); + } +});