Press n or j to go to the next uncovered block, b, p or k for the previous block.
| 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 | 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x | /**
* @license Apache-2.0
*
* Copyright (c) 2026 The Stdlib Authors.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
'use strict';
// MODULES //
var floor = require( '@stdlib/math/base/special/floor' );
var arraylike2object = require( '@stdlib/array/base/arraylike2object' );
var accessors = require( './accessors.js' );
// MAIN //
/**
* Returns the index of the first element in a sorted strided array which is greater than a specified search element using alternative indexing semantics.
*
* ## Notes
*
* - The input strided array must be sorted in ascending order.
* - If unable to find an element which is greater than the search element, the function returns `-1`.
*
* @param {PositiveInteger} N - number of indexed elements
* @param {*} searchElement - search element
* @param {Collection} x - sorted input array
* @param {integer} strideX - stride length
* @param {NonNegativeInteger} offsetX - starting index
* @returns {integer} index
*
* @example
* var x = [ 1.0, 2.0, 2.0, 3.0 ];
*
* var idx = gindexOfGreaterThanSorted( x.length, 2.0, x, 1, 0 );
* // returns 3
*/
function gindexOfGreaterThanSorted( N, searchElement, x, strideX, offsetX ) {
var mid;
var lo;
var hi;
var o;
if ( N <= 0 ) {
return -1;
}
o = arraylike2object( x );
if ( o.accessorProtocol ) {
return accessors( N, searchElement, o, strideX, offsetX );
}
lo = 0;
hi = N;
while ( lo < hi ) {
mid = lo + floor( ( hi - lo ) / 2 );
if ( searchElement < x[ offsetX + ( mid * strideX ) ] ) {
hi = mid;
} else {
lo = mid + 1;
}
}
if ( lo === N ) {
return -1;
}
return lo;
}
// EXPORTS //
module.exports = gindexOfGreaterThanSorted;
|