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 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 | 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 3x 8619x 8619x 8619x 8619x 8619x 8619x 8619x 9x 9x 9x 9x 8610x 8610x 8610x 8610x 8619x 4208x 4208x 4208x 4208x 4208x 4402x 8619x 500x 500x 8619x 1202x 1202x 1202x 1202x 1202x 1202x 1202x 8619x 1000x 1000x 1000x 1000x 1000x 8619x 1200x 1200x 1200x 1200x 1200x 1200x 1200x 500x 500x 500x 8619x 3x 3x 3x 3x 3x | /**
* @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 isnanf = require( '@stdlib/math/base/assert/is-nanf' );
var isInfinitef = require( '@stdlib/math/base/assert/is-infinitef' );
var absf = require( '@stdlib/math/base/special/absf' );
var sincosf = require( '@stdlib/math/base/special/sincosf' ).assign;
var floorf = require( '@stdlib/math/base/special/floorf' );
var PI = require( '@stdlib/constants/float32/pi' );
var copysignf = require( '@stdlib/math/base/special/copysignf' );
// MAIN //
/**
* Simultaneously computes the sine and cosine of a number times π (single-precision).
*
* @private
* @param {number} x - input value
* @param {Collection} out - output array
* @param {integer} stride - output array stride
* @param {NonNegativeInteger} offset - output array index offset
* @returns {Collection} two-element array containing sin(πx) and cos(πx)
*
* @example
* var v = sincospif( 0.0, [ 0.0, 0.0 ], 1, 0 );
* // returns [ 0.0, 1.0 ]
*
* @example
* var v = sincospif( 0.5, [ 0.0, 0.0 ], 1, 0 );
* // returns [ 1.0, 0.0 ]
*
* @example
* var v = sincospif( 0.1, [ 0.0, 0.0 ], 1, 0 );
* // returns [ ~0.309, ~0.951 ]
*
* @example
* var v = sincospif( NaN, [ 0.0, 0.0 ], 1, 0 );
* // returns [ NaN, NaN ]
*/
function sincospif( x, out, stride, offset ) {
var tmp;
var ix;
var ar;
var r;
if ( isnanf( x ) || isInfinitef( x ) ) {
out[ offset ] = NaN;
out[ offset + stride ] = NaN;
return out;
}
r = x % 2.0;
ar = absf( r );
if ( ar === 0.0 || ar === 1.0 ) {
ix = floorf( ar );
out[ offset ] = copysignf( 0.0, r );
out[ offset + stride ] = ( ix%2 === 1 ) ? -1.0 : 1.0;
return out;
}
if ( ar < 0.25 ) {
return sincosf( PI*r, out, stride, offset );
}
if ( ar < 0.75 ) {
ar = 0.5 - ar;
sincosf( PI*ar, out, stride, offset );
tmp = out[ offset ];
out[ offset ] = copysignf( out[ offset + stride ], r );
out[ offset + stride ] = tmp;
return out;
}
if ( ar < 1.25 ) {
r = copysignf( 1.0, r ) - r;
sincosf( PI*r, out, stride, offset );
out[ offset + stride ] *= -1;
return out;
}
if ( ar < 1.75 ) {
ar -= 1.5;
sincosf( PI*ar, out, stride, offset );
tmp = out[ offset ];
out[ offset ] = -copysignf( out[ offset + stride ], r );
out[ offset + stride ] = tmp;
return out;
}
r -= copysignf( 2.0, r );
return sincosf( PI*r, out, stride, offset );
}
// EXPORTS //
module.exports = sincospif;
|