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 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 | 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 42x 42x 42x 1x 1x 1x 1x 1x 1x 1x 1x 195x 195x 195x 195x 195x 195x 195x 195x 195x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 157x 157x 157x 157x 157x 157x 157x 157x 157x 157x 157x 157x 157x 8x 8x 149x 149x 157x 338x 338x 143x 338x 195x 195x 195x 3x 3x 195x 8x 8x 192x 195x 60x 60x 60x 60x 6x 6x 60x 18x 18x 18x 60x 15x 15x 60x 21x 21x 60x 60x 60x 195x 4x 4x 4x 4x 4x 195x 55x 10x 10x 10x 10x 10x 55x 192x 192x 195x 195x 195x 195x 195x 195x 195x 63x 63x 63x 63x 195x 34x 34x 34x 34x 195x 14x 14x 14x 14x 14x 14x 14x 195x 195x 195x 195x 195x 195x 81x 81x 36x 36x 81x 81x 24x 24x 24x 24x 24x 81x 81x 195x 195x 192x 195x 8x 8x 195x 9x 195x 56x 56x 195x 195x 195x 338x 146x 157x 1x 1x 1x 1x 1x | /**
* @license Apache-2.0
*
* Copyright (c) 2022 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 formatInteger = require( './format_integer.js' );
var isString = require( './is_string.js' );
var isNumber = require( './is_number.js' );
var formatDouble = require( './format_double.js' );
var spacePad = require( './space_pad.js' );
var zeroPad = require( './zero_pad.js' );
// VARIABLES //
var fromCharCode = String.fromCharCode;
var isArray = Array.isArray; // NOTE: We use the global `Array.isArray` function here instead of `@stdlib/assert/is-array` to avoid circular dependencies.
// FUNCTIONS //
/**
* Returns a boolean indicating whether a value is `NaN`.
*
* @private
* @param {*} value - input value
* @returns {boolean} boolean indicating whether a value is `NaN`
*
* @example
* var bool = isnan( NaN );
* // returns true
*
* @example
* var bool = isnan( 4 );
* // returns false
*/
function isnan( value ) { // explicitly define a function here instead of `@stdlib/math/base/assert/is-nan` in order to avoid circular dependencies
return ( value !== value );
}
/**
* Initializes token object with properties of supplied format identifier object or default values if not present.
*
* @private
* @param {Object} token - format identifier object
* @returns {Object} token object
*/
function initialize( token ) {
var out = {};
out.specifier = token.specifier;
out.precision = ( token.precision === void 0 ) ? 1 : token.precision;
out.width = token.width;
out.flags = token.flags || '';
out.mapping = token.mapping;
return out;
}
// MAIN //
/**
* Generates string from a token array by interpolating values.
*
* @param {Array} tokens - string parts and format identifier objects
* @param {Array} ...args - variable values
* @throws {TypeError} first argument must be an array
* @throws {Error} invalid flags
* @returns {string} formatted string
*
* @example
* var tokens = [ 'beep ', { 'specifier': 's' } ];
* var out = formatInterpolate( tokens, 'boop' );
* // returns 'beep boop'
*/
function formatInterpolate( tokens ) {
var hasPeriod;
var flags;
var token;
var flag;
var num;
var out;
var pos;
var f;
var i;
var j;
if ( !isArray( tokens ) ) {
throw new TypeError( 'invalid argument. First argument must be an array. Value: `' + tokens + '`.' );
}
out = '';
pos = 1;
for ( i = 0; i < tokens.length; i++ ) {
token = tokens[ i ];
if ( isString( token ) ) {
out += token;
} else {
hasPeriod = token.precision !== void 0;
token = initialize( token );
if ( !token.specifier ) {
throw new TypeError( 'invalid argument. Token is missing `specifier` property. Index: `'+ i +'`. Value: `' + token + '`.' );
}
if ( token.mapping ) {
pos = token.mapping;
}
flags = token.flags;
for ( j = 0; j < flags.length; j++ ) {
flag = flags.charAt( j );
switch ( flag ) {
case ' ':
token.sign = ' ';
break;
case '+':
token.sign = '+';
break;
case '-':
token.padRight = true;
token.padZeros = false;
break;
case '0':
token.padZeros = flags.indexOf( '-' ) < 0; // NOTE: We use built-in `Array.prototype.indexOf` here instead of `@stdlib/assert/contains` in order to avoid circular dependencies.
break;
case '#':
token.alternate = true;
break;
default:
throw new Error( 'invalid flag: ' + flag );
}
}
if ( token.width === '*' ) {
token.width = parseInt( arguments[ pos ], 10 );
pos += 1;
if ( isnan( token.width ) ) {
throw new TypeError( 'the argument for * width at position ' + pos + ' is not a number. Value: `' + token.width + '`.' );
}
if ( token.width < 0 ) {
token.padRight = true;
token.width = -token.width;
}
}
if ( hasPeriod ) {
if ( token.precision === '*' ) {
token.precision = parseInt( arguments[ pos ], 10 );
pos += 1;
if ( isnan( token.precision ) ) {
throw new TypeError( 'the argument for * precision at position ' + pos + ' is not a number. Value: `' + token.precision + '`.' );
}
if ( token.precision < 0 ) {
token.precision = 1;
hasPeriod = false;
}
}
}
token.arg = arguments[ pos ];
switch ( token.specifier ) {
case 'b':
case 'o':
case 'x':
case 'X':
case 'd':
case 'i':
case 'u':
// Case: %b (binary), %o (octal), %x, %X (hexadecimal), %d, %i (decimal), %u (unsigned decimal)
if ( hasPeriod ) {
token.padZeros = false;
}
token.arg = formatInteger( token );
break;
case 's':
// Case: %s (string)
token.maxWidth = ( hasPeriod ) ? token.precision : -1;
token.arg = String( token.arg );
break;
case 'c':
// Case: %c (character)
if ( !isnan( token.arg ) ) {
num = parseInt( token.arg, 10 );
if ( num < 0 || num > 127 ) {
throw new Error( 'invalid character code. Value: ' + token.arg );
}
token.arg = ( isnan( num ) ) ? String( token.arg ) : fromCharCode( num ); // eslint-disable-line max-len
}
break;
case 'e':
case 'E':
case 'f':
case 'F':
case 'g':
case 'G':
// Case: %e, %E (scientific notation), %f, %F (decimal floating point), %g, %G (uses the shorter of %e/E or %f/F)
if ( !hasPeriod ) {
token.precision = 6;
}
f = parseFloat( token.arg );
if ( !isFinite( f ) ) { // NOTE: We use the global `isFinite` function here instead of `@stdlib/math/base/assert/is-finite` in order to avoid circular dependencies.
if ( !isNumber( token.arg ) ) {
throw new Error( 'invalid floating-point number. Value: ' + out );
}
// Case: NaN, Infinity, or -Infinity
f = token.arg;
token.padZeros = false;
}
token.arg = formatDouble( f, token );
break;
default:
throw new Error( 'invalid specifier: ' + token.specifier );
}
// Fit argument into field width...
if ( token.maxWidth >= 0 && token.arg.length > token.maxWidth ) {
token.arg = token.arg.substring( 0, token.maxWidth );
}
if ( token.padZeros ) {
token.arg = zeroPad( token.arg, token.width || token.precision, token.padRight ); // eslint-disable-line max-len
} else if ( token.width ) {
token.arg = spacePad( token.arg, token.width, token.padRight );
}
out += token.arg || '';
pos += 1;
}
}
return out;
}
// EXPORTS //
module.exports = formatInterpolate;
|