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 | 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 1x | /** * @license Apache-2.0 * * Copyright (c) 2018 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'; /** * Round each component of a double-precision floating-point complex number to the nearest multiple of `10^n` toward positive infinity. * * @module @stdlib/math/base/special/cceiln * * @example * var Complex128 = require( '@stdlib/complex/float64/ctor' ); * var cceiln = require( '@stdlib/math/base/special/cceiln' ); * * // Round components to 2 decimal places: * var z = new Complex128( -3.141592653589793, 3.141592653589793 ); * var v = cceiln( z, -2 ); * // returns <Complex128>[ -3.14, 3.15 ] * * // If n = 0, `cceiln` behaves like `cceil`: * z = new Complex128( 9.99999, 0.1 ); * v = cceiln( z, 0 ); * // returns <Complex128>[ 10.0, 1.0 ] * * // Round components to the nearest thousand: * z = new Complex128( 12368.0, -12368.0 ); * v = cceiln( z, 3 ); * // returns <Complex128>[ 13000.0, -12000.0 ] * * v = cceiln( new Complex128( NaN, NaN ), 2 ); * // returns <Complex128>[ NaN, NaN ] */ // MODULES // var main = require( './main.js' ); // EXPORTS // module.exports = main; |