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 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 | 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 113x 113x 113x 15x 15x 15x 15x 15x 15x 15x 15x 113x 113x 113x 15x 15x 15x 15x 15x 15x 15x 15x 11x 11x 11x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 119x 119x 119x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 15x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 113x 113x 113x 113x 113x 113x 113x 113x 113x 113x 113x 113x 113x 113x 113x 113x 113x 113x 113x 8x 113x 105x 105x 12x 102x 90x 93x 3x 3x 105x 113x 113x 113x 113x 113x 113x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 50x 50x 10x 10x 50x 10x 10x 30x 50x 15x 15x 50x 20x 20x 10x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 23x 23x 23x 23x 10x 10x 23x 9x 9x 4x 23x 11x 1x 1x 11x 3x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 24x 24x 24x 24x 24x 24x 10x 10x 24x 9x 9x 5x 5x 24x 16x 16x 8x 8x 16x 5x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 23x 23x 23x 23x 10x 10x 23x 9x 9x 4x 23x 12x 12x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 20x 20x 20x 20x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 35x 35x 35x 35x 10x 10x 35x 22x 10x 10x 22x 4x 4x 2x 2x 4x 35x 3x 3x 15x 35x 22x 6x 6x 22x 9x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 35x 35x 35x 35x 10x 10x 35x 22x 10x 10x 22x 4x 4x 2x 2x 4x 35x 3x 3x 15x 35x 22x 6x 6x 22x 9x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 24x 24x 24x 24x 24x 24x 10x 10x 24x 11x 9x 9x 2x 24x 3x 3x 5x 5x 24x 10x 10x 5x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 31x 31x 31x 31x 10x 10x 31x 18x 10x 10x 18x 2x 18x 3x 3x 31x 3x 3x 11x 31x 19x 7x 7x 19x 4x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 135x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 22x 22x 22x 22x 22x 22x 10x 10x 22x 9x 9x 3x 3x 3x 22x 8x 8x 8x 3x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 23x 23x 23x 23x 23x 23x 10x 10x 23x 9x 9x 4x 4x 23x 1x 1x 23x 3x 1x 1x 2x 2x 2x 23x 10x 10x 3x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 23x 23x 23x 23x 23x 23x 10x 10x 23x 9x 9x 4x 4x 23x 1x 1x 23x 3x 1x 1x 2x 2x 2x 23x 10x 10x 3x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 24x 24x 24x 24x 10x 10x 24x 9x 9x 5x 24x 16x 3x 3x 16x 2x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 16x 16x 16x 16x 16x 16x 16x 8x 8x 6x 6x 20x 16x 16x 16x 16x 16x 16x 16x 4x 4x 4x 20x 6x 6x 1x 6x 6x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 27x 27x 27x 27x 27x 27x 10x 10x 27x 10x 10x 7x 7x 27x 3x 3x 27x 4x 4x 3x 3x 3x 3x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 398x 398x 398x 288x 288x 28x 398x 260x 398x 398x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 119x 90x 90x 90x 90x 90x 90x 90x 90x 90x 90x 379x 379x 90x 90x 119x 15x 15x 15x 15x 15x | /**
* @license Apache-2.0
*
* Copyright (c) 2024 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.
*/
/* eslint-disable max-len, no-restricted-syntax, no-invalid-this, max-lines */
'use strict';
// MODULES //
var isNonNegativeInteger = require( '@stdlib/assert/is-nonnegative-integer' ).isPrimitive;
var isInteger = require( '@stdlib/assert/is-integer' ).isPrimitive;
var isCollection = require( '@stdlib/assert/is-collection' );
var isArrayBuffer = require( '@stdlib/assert/is-arraybuffer' );
var isObject = require( '@stdlib/assert/is-object' );
var isFunction = require( '@stdlib/assert/is-function' );
var isString = require( '@stdlib/assert/is-string' ).isPrimitive;
var isByteOrder = require( '@stdlib/array/base/assert/is-byte-order' );
var lowercase = require( '@stdlib/string/base/lowercase' );
var hasIteratorSymbolSupport = require( '@stdlib/assert/has-iterator-symbol-support' );
var ITERATOR_SYMBOL = require( '@stdlib/symbol/iterator' );
var setReadOnly = require( '@stdlib/utils/define-nonenumerable-read-only-property' );
var isPrototypeOf = require( '@stdlib/assert/is-prototype-of' ); // eslint-disable-line stdlib/no-redeclare
var setReadOnlyAccessor = require( '@stdlib/utils/define-nonenumerable-read-only-accessor' );
var ArrayBuffer = require( '@stdlib/array/buffer' );
var DataView = require( '@stdlib/array/dataview' );
var getter = require( '@stdlib/array/base/getter' );
var accessorGetter = require( '@stdlib/array/base/accessor-getter' );
var contains = require( '@stdlib/array/base/assert/contains' ).factory;
var bytesPerElement = require( '@stdlib/ndarray/base/bytes-per-element' );
var capitalize = require( '@stdlib/string/base/capitalize' );
var format = require( '@stdlib/string/format' );
var fromIterator = require( './from_iterator.js' );
var fromIteratorMap = require( './from_iterator_map.js' );
// VARIABLES //
var HAS_ITERATOR_SYMBOL = hasIteratorSymbolSupport();
var LITTLE_ENDIAN = 'little-endian';
var BIG_ENDIAN = 'big-endian';
var DTYPES = [ 'float64', 'float32', 'int32', 'int16', 'uint32', 'uint16' ];
var DTYPE2SET = {
'float64': 'setFloat64',
'float32': 'setFloat32',
'int32': 'setInt32',
'int16': 'setInt16',
'uint32': 'setUint32',
'uint16': 'setUint16'
};
var DTYPE2GET = {
'float64': 'getFloat64',
'float32': 'getFloat32',
'int32': 'getInt32',
'int16': 'getInt16',
'uint32': 'getUint32',
'uint16': 'getUint16'
};
var CHAR2ARTICLE = {
'c': 'a',
'f': 'a',
'i': 'an',
'u': 'a',
'b': 'a'
};
var isDataType = contains( DTYPES );
// FUNCTIONS //
/**
* Normalizes a byte order value.
*
* @private
* @param {*} value - byte order
* @returns {(string|null)} normalized byte order
*/
function byteOrder( value ) {
return ( isString( value ) ) ? lowercase( value ) : null;
}
/**
* Tests whether a provided byte order is little-endian byte order.
*
* @private
* @param {string} value - byte order
* @returns {boolean} boolean indicating whether a byte order is little-endian byte order
*/
function isLittleEndian( value ) {
return ( value === LITTLE_ENDIAN );
}
/**
* Resolves a byte order string from a boolean flag.
*
* @private
* @param {boolean} isLE - flag indicating whether an array is little-endian
* @returns {string} resolved byte order
*/
function flag2byteOrder( isLE ) {
return ( isLE ) ? LITTLE_ENDIAN : BIG_ENDIAN;
}
/**
* Converts a data type string to a constructor name.
*
* @private
* @param {string} dtype - data type
* @returns {string} constructor name
*
* @example
* var n = dtype2ctor( 'float64' );
* // returns 'Float64ArrayFE'
*
* @example
* var n = dtype2ctor( 'int32' );
* // returns 'Int32ArrayFE'
*/
function dtype2ctor( dtype ) {
return capitalize( dtype ) + 'ArrayFE';
}
// MAIN //
/**
* Returns a typed array constructor for creating typed arrays having a specified byte order.
*
* @param {string} dtype - typed array data type
* @throws {TypeError} first argument must be a supported data type
* @returns {Function} typed array constructor
*
* @example
* var Float64ArrayFE = factory( 'float64' );
*
* var arr = new Float64ArrayFE( 'little-endian' );
* // returns <Float64ArrayFE>
*
* var len = arr.length;
* // returns 0
*
* @example
* var Float64ArrayFE = factory( 'float64' );
*
* var arr = new Float64ArrayFE( 'little-endian', 2 );
* // returns <Float64ArrayFE>
*
* var len = arr.length;
* // returns 2
*
* @example
* var Float64ArrayFE = factory( 'float64' );
*
* var arr = new Float64ArrayFE( 'little-endian', [ 1.0, 2.0 ] );
* // returns <Float64ArrayFE>
*
* var len = arr.length;
* // returns 2
*
* @example
* var ArrayBuffer = require( '@stdlib/array/buffer' );
*
* var Float64ArrayFE = factory( 'float64' );
*
* var buf = new ArrayBuffer( 16 );
* var arr = new Float64ArrayFE( 'little-endian', buf );
* // returns <Float64ArrayFE>
*
* var len = arr.length;
* // returns 2
*
* @example
* var ArrayBuffer = require( '@stdlib/array/buffer' );
*
* var Float64ArrayFE = factory( 'float64' );
*
* var buf = new ArrayBuffer( 16 );
* var arr = new Float64ArrayFE( 'little-endian', buf, 8 );
* // returns <Float64ArrayFE>
*
* var len = arr.length;
* // returns 1
*
* @example
* var ArrayBuffer = require( '@stdlib/array/buffer' );
*
* var Float64ArrayFE = factory( 'float64' );
*
* var buf = new ArrayBuffer( 32 );
* var arr = new Float64ArrayFE( 'little-endian', buf, 8, 2 );
* // returns <Float64ArrayFE>
*
* var len = arr.length;
* // returns 2
*/
function factory( dtype ) { // eslint-disable-line max-lines-per-function, stdlib/jsdoc-require-throws-tags
var BYTES_PER_ELEMENT;
var CTOR_NAME;
var GETTER;
var SETTER;
if ( !isDataType( dtype ) ) {
throw new TypeError( format( 'invalid argument. First argument must be a supported data type. Value: `%s`.', dtype ) );
}
BYTES_PER_ELEMENT = bytesPerElement( dtype );
CTOR_NAME = dtype2ctor( dtype );
GETTER = DTYPE2GET[ dtype ];
SETTER = DTYPE2SET[ dtype ];
/**
* Typed array constructor which returns a typed array representing an array of values in a specified byte order.
*
* @private
* @constructor
* @param {string} endianness - byte order
* @param {(NonNegativeInteger|Collection|ArrayBuffer|Iterable)} [arg] - length, typed array, array-like object, buffer, or an iterable
* @param {NonNegativeInteger} [byteOffset=0] - byte offset
* @param {NonNegativeInteger} [length] - view length
* @throws {TypeError} first argument must be a supported byte order
* @throws {TypeError} if provided only two arguments, the second argument must be a valid argument
* @throws {TypeError} byte offset must be a nonnegative integer
* @throws {RangeError} must provide sufficient memory to accommodate byte offset and view length requirements
* @returns {TypedArray} typed array instance
*/
function TypedArray() {
var byteOffset;
var endianness;
var nargs;
var isLE;
var buf;
var len;
var arg;
var tmp;
nargs = arguments.length;
if ( !(this instanceof TypedArray) ) {
if ( nargs < 2 ) {
return new TypedArray( arguments[0] );
}
if ( nargs === 2 ) {
return new TypedArray( arguments[0], arguments[1] );
}
if ( nargs === 3 ) {
return new TypedArray( arguments[0], arguments[1], arguments[2] );
}
return new TypedArray( arguments[0], arguments[1], arguments[2], arguments[3] );
}
endianness = byteOrder( arguments[ 0 ] );
if ( endianness === null || !isByteOrder( endianness ) ) {
throw new TypeError( format( 'invalid argument. First argument must be a supported byte order. Value: `%s`.', arguments[ 0 ] ) );
}
isLE = isLittleEndian( endianness );
nargs -= 1;
// Create the underlying data buffer...
if ( nargs === 0 ) {
buf = new DataView( new ArrayBuffer( 0 ) ); // backward-compatibility
} else if ( nargs === 1 ) {
arg = arguments[ nargs ];
if ( isNonNegativeInteger( arg ) ) {
buf = new DataView( new ArrayBuffer( arg*BYTES_PER_ELEMENT ) );
} else if ( isCollection( arg ) ) {
buf = fromArray( new DataView( new ArrayBuffer( arg.length*BYTES_PER_ELEMENT ) ), arg, isLE );
} else if ( isArrayBuffer( arg ) ) {
buf = new DataView( arg );
} else if ( isObject( arg ) ) {
if ( HAS_ITERATOR_SYMBOL === false ) {
throw new TypeError( format( 'invalid argument. Environment lacks Symbol.iterator support. Must provide a length, ArrayBuffer, typed array, or array-like object. Value: `%s`.', arg ) );
}
if ( !isFunction( arg[ ITERATOR_SYMBOL ] ) ) {
throw new TypeError( format( 'invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.', arg ) );
}
buf = arg[ ITERATOR_SYMBOL ]();
if ( !isFunction( buf.next ) ) {
throw new TypeError( format( 'invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.', arg ) );
}
tmp = fromIterator( buf );
buf = fromArray( new DataView( new ArrayBuffer( tmp.length*BYTES_PER_ELEMENT ) ), tmp, isLE );
} else {
throw new TypeError( format( 'invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.', arg ) );
}
} else {
buf = arguments[ 1 ];
if ( !isArrayBuffer( buf ) ) {
throw new TypeError( format( 'invalid argument. Must provide an ArrayBuffer. Value: `%s`.', buf ) );
}
byteOffset = arguments[ 2 ];
if ( !isNonNegativeInteger( byteOffset ) ) {
throw new TypeError( format( 'invalid argument. Byte offset must be a nonnegative integer. Value: `%s`.', byteOffset ) );
}
if ( nargs === 2 ) {
buf = new DataView( buf, byteOffset );
} else {
len = arguments[ 3 ];
if ( !isNonNegativeInteger( len ) ) {
throw new TypeError( format( 'invalid argument. Length must be a nonnegative integer. Value: `%s`.', len ) );
}
len *= BYTES_PER_ELEMENT;
if ( len > (buf.byteLength-byteOffset) ) {
throw new RangeError( format( 'invalid arguments. ArrayBuffer has insufficient capacity. Either decrease the array length or provide a bigger buffer. Minimum capacity: `%u`.', len ) );
}
buf = new DataView( buf, byteOffset, len );
}
}
setReadOnly( this, '_buffer', buf );
setReadOnly( this, '_length', buf.byteLength/BYTES_PER_ELEMENT );
setReadOnly( this, '_isLE', isLE );
return this;
}
/**
* Size (in bytes) of each array element.
*
* @private
* @name BYTES_PER_ELEMENT
* @memberof TypedArray
* @readonly
* @type {PositiveInteger}
*/
setReadOnly( TypedArray, 'BYTES_PER_ELEMENT', BYTES_PER_ELEMENT );
/**
* Constructor name.
*
* @private
* @name name
* @memberof TypedArray
* @readonly
* @type {string}
*/
setReadOnly( TypedArray, 'name', CTOR_NAME );
/**
* Creates a new typed array from an array-like object or an iterable.
*
* @private
* @name from
* @memberof TypedArray
* @type {Function}
* @param {string} endianness - byte order
* @param {(Collection|Iterable)} src - array-like object or iterable
* @param {Function} [clbk] - callback to invoke for each source element
* @param {*} [thisArg] - context
* @throws {TypeError} `this` context must be a constructor
* @throws {TypeError} `this` must be a typed array constructor
* @throws {TypeError} first argument must be a supported byte order
* @throws {TypeError} second argument must be an array-like object or an iterable
* @throws {TypeError} third argument must be a function
* @returns {TypedArray} typed array instance
*/
setReadOnly( TypedArray, 'from', function from( endianness, src ) {
var thisArg;
var order;
var nargs;
var clbk;
var isLE;
var out;
var buf;
var tmp;
var get;
var len;
var i;
if ( !isFunction( this ) ) {
throw new TypeError( 'invalid invocation. `this` context must be a constructor.' );
}
if ( !isTypedArrayConstructor( this ) ) {
throw new TypeError( format( 'invalid invocation. `this` is not %s %s.', CHAR2ARTICLE[ dtype[0] ], CTOR_NAME ) );
}
order = byteOrder( endianness );
if ( order === null || !isByteOrder( order ) ) {
throw new TypeError( format( 'invalid argument. First argument must be a supported byte order. Value: `%s`.', endianness ) );
}
isLE = isLittleEndian( order );
nargs = arguments.length;
if ( nargs > 2 ) {
clbk = arguments[ 2 ];
if ( !isFunction( clbk ) ) {
throw new TypeError( format( 'invalid argument. Third argument must be a function. Value: `%s`.', clbk ) );
}
if ( nargs > 3 ) {
thisArg = arguments[ 3 ];
}
}
if ( isCollection( src ) ) {
if ( clbk ) {
len = src.length;
if ( src.get && src.set ) {
get = accessorGetter( 'default' );
} else {
get = getter( 'default' );
}
out = new this( order, len );
buf = out._buffer; // eslint-disable-line no-underscore-dangle
for ( i = 0; i < len; i++ ) {
buf[ SETTER ]( i*BYTES_PER_ELEMENT, clbk.call( thisArg, get( src, i ), i ), isLE );
}
return out;
}
return new this( order, src );
}
if ( isObject( src ) && HAS_ITERATOR_SYMBOL && isFunction( src[ ITERATOR_SYMBOL ] ) ) {
buf = src[ ITERATOR_SYMBOL ]();
if ( !isFunction( buf.next ) ) {
throw new TypeError( format( 'invalid argument. Second argument must be an array-like object or an iterable. Value: `%s`.', src ) );
}
if ( clbk ) {
tmp = fromIteratorMap( buf, clbk, thisArg );
} else {
tmp = fromIterator( buf );
}
len = tmp.length;
out = new this( order, len );
buf = out._buffer; // eslint-disable-line no-underscore-dangle
for ( i = 0; i < len; i++ ) {
buf[ SETTER ]( i*BYTES_PER_ELEMENT, tmp[ i ], isLE );
}
return out;
}
throw new TypeError( format( 'invalid argument. Second argument must be an array-like object or an iterable. Value: `%s`.', src ) );
});
/**
* Creates a new typed array from a variable number of arguments.
*
* @private
* @name of
* @memberof TypedArray
* @type {Function}
* @param {string} endianness - byte order
* @param {...*} element - array elements
* @throws {TypeError} `this` context must be a constructor
* @throws {TypeError} `this` must be a typed array constructor
* @throws {TypeError} first argument must be a supported byte order
* @returns {TypedArray} typed array instance
*/
setReadOnly( TypedArray, 'of', function of( endianness ) {
var order;
var args;
var i;
if ( !isFunction( this ) ) {
throw new TypeError( 'invalid invocation. `this` context must be a constructor.' );
}
if ( !isTypedArrayConstructor( this ) ) {
throw new TypeError( format( 'invalid invocation. `this` is not %s %s.', CHAR2ARTICLE[ dtype[0] ], CTOR_NAME ) );
}
order = byteOrder( endianness );
if ( order === null || !isByteOrder( order ) ) {
throw new TypeError( format( 'invalid argument. First argument must be a supported byte order. Value: `%s`.', endianness ) );
}
args = [];
for ( i = 1; i < arguments.length; i++ ) {
args.push( arguments[ i ] );
}
return new this( order, args );
});
/**
* Returns an array element located at integer position (index) `i`, with support for both nonnegative and negative integer indices.
*
* @private
* @name at
* @memberof TypedArray.prototype
* @type {Function}
* @param {integer} idx - element index
* @throws {TypeError} `this` must be a typed array instance
* @throws {TypeError} must provide an integer
* @returns {(*|void)} array element
*/
setReadOnly( TypedArray.prototype, 'at', function at( idx ) {
var len;
if ( !isTypedArray( this ) ) {
throw new TypeError( format( 'invalid invocation. `this` is not %s %s.', CHAR2ARTICLE[ dtype[0] ], CTOR_NAME ) );
}
if ( !isInteger( idx ) ) {
throw new TypeError( format( 'invalid argument. Must provide an integer. Value: `%s`.', idx ) );
}
len = this._length;
if ( idx < 0 ) {
idx += len;
}
if ( idx < 0 || idx >= len ) {
return;
}
return this._buffer[ GETTER ]( idx * BYTES_PER_ELEMENT, this._isLE );
});
/**
* Pointer to the underlying data buffer.
*
* @private
* @name buffer
* @memberof TypedArray.prototype
* @readonly
* @type {ArrayBuffer}
*/
setReadOnlyAccessor( TypedArray.prototype, 'buffer', function get() {
return this._buffer.buffer;
});
/**
* Size (in bytes) of the array.
*
* @private
* @name byteLength
* @memberof TypedArray.prototype
* @readonly
* @type {NonNegativeInteger}
*/
setReadOnlyAccessor( TypedArray.prototype, 'byteLength', function get() {
return this._buffer.byteLength;
});
/**
* Offset (in bytes) of the array from the start of its underlying `ArrayBuffer`.
*
* @private
* @name byteOffset
* @memberof TypedArray.prototype
* @readonly
* @type {NonNegativeInteger}
*/
setReadOnlyAccessor( TypedArray.prototype, 'byteOffset', function get() {
return this._buffer.byteOffset;
});
/**
* Size (in bytes) of each array element.
*
* @private
* @name BYTES_PER_ELEMENT
* @memberof TypedArray.prototype
* @readonly
* @type {PositiveInteger}
*/
setReadOnly( TypedArray.prototype, 'BYTES_PER_ELEMENT', TypedArray.BYTES_PER_ELEMENT );
/**
* Tests whether all elements in an array pass a test implemented by a predicate function.
*
* @private
* @name every
* @memberof TypedArray.prototype
* @type {Function}
* @param {Function} predicate - predicate function
* @param {*} [thisArg] - predicate function execution context
* @throws {TypeError} `this` must be a typed array instance
* @throws {TypeError} first argument must be a function
* @returns {boolean} boolean indicating whether all elements pass a test
*/
setReadOnly( TypedArray.prototype, 'every', function every( predicate, thisArg ) {
var buf;
var i;
if ( !isTypedArray( this ) ) {
throw new TypeError( format( 'invalid invocation. `this` is not %s %s.', CHAR2ARTICLE[ dtype[0] ], CTOR_NAME ) );
}
if ( !isFunction( predicate ) ) {
throw new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );
}
buf = this._buffer;
for ( i = 0; i < this._length; i++ ) {
if ( !predicate.call( thisArg, buf[ GETTER ]( i * BYTES_PER_ELEMENT, this._isLE ), i, this ) ) {
return false;
}
}
return true;
});
/**
* Returns a new array containing the elements of an array which pass a test implemented by a predicate function.
*
* @private
* @name filter
* @memberof TypedArray.prototype
* @type {Function}
* @param {Function} predicate - test function
* @param {*} [thisArg] - predicate function execution context
* @throws {TypeError} `this` must be a typed array instance
* @throws {TypeError} first argument must be a function
* @returns {TypedArray} typed array
*/
setReadOnly( TypedArray.prototype, 'filter', function filter( predicate, thisArg ) {
var buf;
var out;
var i;
var v;
if ( !isTypedArray( this ) ) {
throw new TypeError( format( 'invalid invocation. `this` is not %s %s.', CHAR2ARTICLE[ dtype[0] ], CTOR_NAME ) );
}
if ( !isFunction( predicate ) ) {
throw new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );
}
buf = this._buffer;
out = [];
for ( i = 0; i < this._length; i++ ) {
v = buf[ GETTER ]( i*BYTES_PER_ELEMENT, this._isLE );
if ( predicate.call( thisArg, v, i, this ) ) {
out.push( v );
}
}
return new this.constructor( flag2byteOrder( this._isLE ), out );
});
/**
* Invokes a function once for each array element.
*
* @private
* @name forEach
* @memberof TypedArray.prototype
* @type {Function}
* @param {Function} fcn - function to invoke
* @param {*} [thisArg] - function invocation context
* @throws {TypeError} `this` must be a typed array instance
* @throws {TypeError} first argument must be a function
*/
setReadOnly( TypedArray.prototype, 'forEach', function forEach( fcn, thisArg ) {
var buf;
var i;
if ( !isTypedArray( this ) ) {
throw new TypeError( format( 'invalid invocation. `this` is not %s %s.', CHAR2ARTICLE[ dtype[0] ], CTOR_NAME ) );
}
if ( !isFunction( fcn ) ) {
throw new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', fcn ) );
}
buf = this._buffer;
for ( i = 0; i < this._length; i++ ) {
fcn.call( thisArg, buf[ GETTER ]( i*BYTES_PER_ELEMENT, this._isLE ), i, this );
}
});
/**
* Returns an array element.
*
* @private
* @name get
* @memberof TypedArray.prototype
* @type {Function}
* @param {NonNegativeInteger} idx - element index
* @throws {TypeError} `this` must be a typed array instance
* @throws {TypeError} must provide a nonnegative integer
* @returns {(*|void)} array element
*/
setReadOnly( TypedArray.prototype, 'get', function get( idx ) {
if ( !isTypedArray( this ) ) {
throw new TypeError( format( 'invalid invocation. `this` is not %s %s.', CHAR2ARTICLE[ dtype[0] ], CTOR_NAME ) );
}
if ( !isNonNegativeInteger( idx ) ) {
throw new TypeError( format( 'invalid argument. Must provide a nonnegative integer. Value: `%s`.', idx ) );
}
if ( idx >= this._length ) {
return;
}
return this._buffer[ GETTER ]( idx*BYTES_PER_ELEMENT, this._isLE );
});
/**
* Returns a boolean indicating whether an array includes a provided value.
*
* @private
* @name includes
* @memberof TypedArray.prototype
* @type {Function}
* @param {*} searchElement - search element
* @param {integer} [fromIndex=0] - starting index (inclusive)
* @throws {TypeError} `this` must be a typed array instance
* @throws {TypeError} second argument must be an integer
* @returns {boolean} boolean indicating whether an array includes a provided value
*/
setReadOnly( TypedArray.prototype, 'includes', function includes( searchElement, fromIndex ) {
var buf;
var i;
if ( !isTypedArray( this ) ) {
throw new TypeError( format( 'invalid invocation. `this` is not %s %s.', CHAR2ARTICLE[ dtype[0] ], CTOR_NAME ) );
}
if ( arguments.length > 1 ) {
if ( !isInteger( fromIndex ) ) {
throw new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', fromIndex ) );
}
if ( fromIndex < 0 ) {
fromIndex += this._length;
if ( fromIndex < 0 ) {
fromIndex = 0;
}
}
} else {
fromIndex = 0;
}
buf = this._buffer;
for ( i = fromIndex; i < this._length; i++ ) {
if ( buf[ GETTER ]( i * BYTES_PER_ELEMENT, this._isLE ) === searchElement ) {
return true;
}
}
return false;
});
/**
* Returns the index of the first occurrence of a given element.
*
* @private
* @name indexOf
* @memberof TypedArray.prototype
* @type {Function}
* @param {*} searchElement - element to search for
* @param {integer} [fromIndex=0] - starting index (inclusive)
* @throws {TypeError} `this` must be a typed array instance
* @throws {TypeError} second argument must be an integer
* @returns {integer} index or -1
*/
setReadOnly( TypedArray.prototype, 'indexOf', function indexOf( searchElement, fromIndex ) {
var buf;
var i;
if ( !isTypedArray( this ) ) {
throw new TypeError( format( 'invalid invocation. `this` is not %s %s.', CHAR2ARTICLE[ dtype[0] ], CTOR_NAME ) );
}
if ( arguments.length > 1 ) {
if ( !isInteger( fromIndex ) ) {
throw new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', fromIndex ) );
}
if ( fromIndex < 0 ) {
fromIndex += this._length;
if ( fromIndex < 0 ) {
fromIndex = 0;
}
}
} else {
fromIndex = 0;
}
buf = this._buffer;
for ( i = fromIndex; i < this._length; i++ ) {
if ( buf[ GETTER ]( i * BYTES_PER_ELEMENT, this._isLE ) === searchElement ) {
return i;
}
}
return -1;
});
/**
* Returns a new string by concatenating all array elements.
*
* @private
* @name join
* @memberof TypedArray.prototype
* @type {Function}
* @param {string} [separator=','] - element separator
* @throws {TypeError} `this` must be a typed array instance
* @throws {TypeError} first argument must be a string
* @returns {string} joined string
*/
setReadOnly( TypedArray.prototype, 'join', function join( separator ) {
var out;
var buf;
var sep;
var i;
if ( !isTypedArray( this ) ) {
throw new TypeError( format( 'invalid invocation. `this` is not %s %s.', CHAR2ARTICLE[ dtype[0] ], CTOR_NAME ) );
}
if ( arguments.length > 0 ) {
if ( !isString( separator ) ) {
throw new TypeError( format( 'invalid argument. First argument must be a string. Value: `%s`.', separator ) );
}
sep = separator;
} else {
sep = ',';
}
out = [];
buf = this._buffer;
for ( i = 0; i < this._length; i++ ) {
out.push( buf[ GETTER ]( i * BYTES_PER_ELEMENT, this._isLE ) );
}
return out.join( sep );
});
/**
* Returns the index of the last occurrence of a given element.
*
* @private
* @name lastIndexOf
* @memberof TypedArray.prototype
* @type {Function}
* @param {*} searchElement - element to search for
* @param {integer} [fromIndex] - starting index (inclusive)
* @throws {TypeError} `this` must be a typed array instance
* @throws {TypeError} second argument must be an integer
* @returns {integer} index or -1
*/
setReadOnly( TypedArray.prototype, 'lastIndexOf', function lastIndexOf( searchElement, fromIndex ) {
var buf;
var i;
if ( !isTypedArray( this ) ) {
throw new TypeError( format( 'invalid invocation. `this` is not %s %s.', CHAR2ARTICLE[ dtype[ 0 ] ], CTOR_NAME ) );
}
if ( arguments.length > 1 ) {
if ( !isInteger( fromIndex ) ) {
throw new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', fromIndex ) );
}
if ( fromIndex >= this._length ) {
fromIndex = this._length - 1;
} else if ( fromIndex < 0 ) {
fromIndex += this._length;
}
} else {
fromIndex = this._length - 1;
}
buf = this._buffer;
for ( i = fromIndex; i >= 0; i-- ) {
if ( buf[ GETTER ]( i * BYTES_PER_ELEMENT, this._isLE ) === searchElement ) {
return i;
}
}
return -1;
});
/**
* Number of array elements.
*
* @private
* @name length
* @memberof TypedArray.prototype
* @readonly
* @type {NonNegativeInteger}
*/
setReadOnlyAccessor( TypedArray.prototype, 'length', function get() {
return this._length;
});
/**
* Returns a new array with each element being the result of a provided callback function.
*
* @private
* @name map
* @memberof TypedArray.prototype
* @type {Function}
* @param {Function} fcn - function to invoke
* @param {*} [thisArg] - function invocation context
* @throws {TypeError} `this` must be a typed array instance
* @throws {TypeError} first argument must be a function
* @returns {TypedArray} new typed array
*/
setReadOnly( TypedArray.prototype, 'map', function map( fcn, thisArg ) {
var obuf;
var out;
var buf;
var i;
var v;
if ( !isTypedArray( this ) ) {
throw new TypeError( format( 'invalid invocation. `this` is not %s %s.', CHAR2ARTICLE[ dtype[0] ], CTOR_NAME ) );
}
if ( !isFunction( fcn ) ) {
throw new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', fcn ) );
}
buf = this._buffer;
out = new this.constructor( flag2byteOrder( this._isLE ), this._length );
obuf = out._buffer; // eslint-disable-line no-underscore-dangle
for ( i = 0; i < this._length; i++ ) {
v = fcn.call( thisArg, buf[ GETTER ]( i * BYTES_PER_ELEMENT, this._isLE ), i, this );
obuf[ SETTER ]( i * BYTES_PER_ELEMENT, v, this._isLE );
}
return out;
});
/**
* Applies a provided callback function to each element of the array, in order, passing in the return value from the calculation on the preceding element and returning the accumulated result upon completion.
*
* @private
* @name reduce
* @memberof TypedArray.prototype
* @type {Function}
* @param {Function} reducer - callback function
* @param {*} [initialValue] - initial value
* @throws {TypeError} `this` must be a typed array
* @throws {Error} if not provided an initial value, the array must have at least one element
* @returns {*} accumulated result
*/
setReadOnly( TypedArray.prototype, 'reduce', function reduce( reducer, initialValue ) {
var buf;
var len;
var acc;
var i;
if ( !isTypedArray( this ) ) {
throw new TypeError( format( 'invalid invocation. `this` is not %s %s.', CHAR2ARTICLE[ dtype[0] ], CTOR_NAME ) );
}
if ( !isFunction( reducer ) ) {
throw new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', reducer ) );
}
buf = this._buffer;
len = this._length;
if ( arguments.length > 1 ) {
acc = initialValue;
i = 0;
} else {
if ( len === 0 ) {
throw new Error( 'invalid operation. If not provided an initial value, an array must contain at least one element.' );
}
acc = buf[ GETTER ]( 0 * BYTES_PER_ELEMENT, this._isLE );
i = 1;
}
for ( ; i < len; i++ ) {
acc = reducer( acc, buf[ GETTER ]( i * BYTES_PER_ELEMENT, this._isLE ), i, this );
}
return acc;
});
/**
* Applies a provided callback function to each element of the array, in reverse order, passing in the return value from the calculation on the following element and returning the accumulated result upon completion.
*
* @private
* @name reduceRight
* @memberof TypedArray.prototype
* @type {Function}
* @param {Function} reducer - callback function
* @param {*} [initialValue] - initial value
* @throws {TypeError} `this` must be a typed array
* @throws {Error} if not provided an initial value, the array must have at least one element
* @returns {*} accumulated result
*/
setReadOnly( TypedArray.prototype, 'reduceRight', function reduceRight( reducer, initialValue ) {
var buf;
var len;
var acc;
var i;
if ( !isTypedArray( this ) ) {
throw new TypeError( format( 'invalid invocation. `this` is not %s %s.', CHAR2ARTICLE[ dtype[0] ], CTOR_NAME ) );
}
if ( !isFunction( reducer ) ) {
throw new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', reducer ) );
}
buf = this._buffer;
len = this._length;
if ( arguments.length > 1 ) {
acc = initialValue;
i = len - 1;
} else {
if ( len === 0 ) {
throw new Error( 'invalid operation. If not provided an initial value, an array must contain at least one element.' );
}
acc = buf[ GETTER ]( ( len - 1 ) * BYTES_PER_ELEMENT, this._isLE );
i = len - 2;
}
for ( ; i >= 0; i-- ) {
acc = reducer( acc, buf[ GETTER ]( i * BYTES_PER_ELEMENT, this._isLE ), i, this );
}
return acc;
});
/**
* Sets an array element.
*
* ## Notes
*
* - When provided a typed array, we must check whether the source array shares the same buffer as the target array and whether the underlying memory overlaps. In particular, we are concerned with the following scenario:
*
* ```text
* buf: ---------------------
* src: ---------------------
* ```
*
* In the above, as we copy values from `src`, we will overwrite values in the `src` view, resulting in duplicated values copied into the end of `buf`, which is not intended. Hence, to avoid overwriting source values, we must **copy** source values to a temporary array.
*
* In the other overlapping scenario,
*
* ```text
* buf: ---------------------
* src: ---------------------
* ```
*
* by the time we begin copying into the overlapping region, we are copying from the end of `src`, a non-overlapping region, which means we don't run the risk of copying copied values, rather than the original `src` values, as intended.
*
* @private
* @name set
* @memberof TypedArray.prototype
* @type {Function}
* @param {(Collection|TypedArray|*)} value - value(s)
* @param {NonNegativeInteger} [i=0] - element index at which to start writing values
* @throws {TypeError} `this` must be a typed array instance
* @throws {TypeError} index argument must be a nonnegative integer
* @throws {RangeError} index argument is out-of-bounds
* @throws {RangeError} target array lacks sufficient storage to accommodate source values
* @returns {void}
*/
setReadOnly( TypedArray.prototype, 'set', function set( value ) {
var sbuf;
var idx;
var buf;
var tmp;
var get;
var N;
var i;
var j;
if ( !isTypedArray( this ) ) {
throw new TypeError( format( 'invalid invocation. `this` is not %s %s.', CHAR2ARTICLE[ dtype[0] ], CTOR_NAME ) );
}
buf = this._buffer;
if ( arguments.length > 1 ) {
idx = arguments[ 1 ];
if ( !isNonNegativeInteger( idx ) ) {
throw new TypeError( format( 'invalid argument. Index argument must be a nonnegative integer. Value: `%s`.', idx ) );
}
} else {
idx = 0;
}
if ( isCollection( value ) ) {
N = value.length;
if ( idx+N > this._length ) {
throw new RangeError( 'invalid arguments. Target array lacks sufficient storage to accommodate source values.' );
}
sbuf = value;
if ( sbuf.get && sbuf.set ) {
get = accessorGetter( 'default' );
} else {
get = getter( 'default' );
}
// Check for overlapping memory...
j = buf.byteOffset + (idx*BYTES_PER_ELEMENT);
if (
sbuf.buffer === buf.buffer &&
(
sbuf.byteOffset < j &&
sbuf.byteOffset+sbuf.byteLength > j
)
) {
// We need to copy source values...
tmp = [];
for ( i = 0; i < value.length; i++ ) {
tmp.push( get( value, i ) );
}
sbuf = tmp;
get = getter( 'default' );
}
for ( i = 0; i < N; idx++, i++ ) {
buf[ SETTER ]( idx*BYTES_PER_ELEMENT, get( sbuf, i ), this._isLE );
}
return;
}
if ( idx >= this._length ) {
throw new RangeError( format( 'invalid argument. Index argument is out-of-bounds. Value: `%u`.', idx ) );
}
buf[ SETTER ]( idx*BYTES_PER_ELEMENT, value, this._isLE );
});
/**
* Tests whether at least one element in the typed array passes a test implemented by a predicate function.
*
* @private
* @name some
* @memberof TypedArray.prototype
* @type {Function}
* @param {Function} predicate - predicate function
* @param {*} [thisArg] - predicate function execution context
* @throws {TypeError} `this` must be a typed array instance
* @throws {TypeError} first argument must be a function
* @returns {boolean} boolean indicating whether at least one element passes a test
*/
setReadOnly( TypedArray.prototype, 'some', function some( predicate, thisArg ) {
var buf;
var i;
if ( !isTypedArray( this ) ) {
throw new TypeError( format( 'invalid invocation. `this` is not %s %s.', CHAR2ARTICLE[ dtype[0] ], CTOR_NAME ) );
}
if ( !isFunction( predicate ) ) {
throw new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );
}
buf = this._buffer;
for ( i = 0; i < this._length; i++ ) {
if ( predicate.call( thisArg, buf[ GETTER ]( i * BYTES_PER_ELEMENT, this._isLE ), i, this ) ) {
return true;
}
}
return false;
});
/**
* Returns an iterator for array elements.
*
* @private
* @name values
* @memberof TypedArray.prototype
* @type {Function}
* @throws {TypeError} `this` must be a typed array instance
* @returns {Object} iterator for array elements
*/
setReadOnly( TypedArray.prototype, 'values', function values() {
var iterator;
var index = 0;
var value;
var isLE = this._isLE;
var buf = this._buffer;
var len = this._length;
if ( !isTypedArray( this ) ) {
throw new TypeError( format( 'invalid invocation. `this` is not %s %s.', CHAR2ARTICLE[ dtype[0] ], CTOR_NAME ) );
}
iterator = {
'next': function next() {
if ( index < len ) {
value = buf[ GETTER ]( index * BYTES_PER_ELEMENT, isLE );
index += 1;
return {
'value': value,
'done': false
};
}
return {
'done': true
};
}
};
iterator[ Symbol.iterator ] = function iterator() {
return this;
};
return iterator;
});
/**
* Serializes an array as a string.
*
* @private
* @name toString
* @memberof TypedArray.prototype
* @type {Function}
* @throws {TypeError} `this` must be a typed array instance
* @returns {string} string representation
*/
setReadOnly( TypedArray.prototype, 'toString', function toString() {
var out;
var buf;
var i;
if ( !isTypedArray( this ) ) {
throw new TypeError( format( 'invalid invocation. `this` is not %s %s.', CHAR2ARTICLE[ dtype[0] ], CTOR_NAME ) );
}
out = [];
buf = this._buffer;
for ( i = 0; i < this._length; i++ ) {
out.push( buf[ GETTER ]( i*BYTES_PER_ELEMENT, this._isLE ) );
}
return out.join( ',' );
});
/**
* Returns a new typed array with the element at a provided index replaced with a provided value.
*
* @private
* @name with
* @memberof TypedArray.prototype
* @type {Function}
* @param {integer} index - element index
* @param {number} value - new value
* @throws {TypeError} `this` must be a typed array instance
* @throws {TypeError} first argument must be an integer
* @throws {RangeError} index argument is out-of-bounds
* @returns {TypedArray} new typed array
*/
setReadOnly( TypedArray.prototype, 'with', function copyWith( index, value ) {
var outbuf;
var buf;
var out;
var len;
if ( !isTypedArray( this ) ) {
throw new TypeError( format( 'invalid invocation. `this` is not %s %s.', CHAR2ARTICLE[ dtype[0] ], CTOR_NAME ) );
}
if ( !isInteger( index ) ) {
throw new TypeError( format( 'invalid argument. First argument must be an integer. Value: `%s`.', index ) );
}
len = this._length;
buf = this._buffer;
if ( index < 0 ) {
index += len;
}
if ( index < 0 || index >= len ) {
throw new RangeError( format( 'invalid argument. Index argument is out-of-bounds. Value: `%s`.', index ) );
}
out = new this.constructor( flag2byteOrder( this._isLE ), buf.buffer );
outbuf = out._buffer; // eslint-disable-line no-underscore-dangle
outbuf[ SETTER ]( index * BYTES_PER_ELEMENT, value, this._isLE );
return out;
});
return TypedArray;
/**
* Returns a boolean indicating if a value is a typed array constructor.
*
* @private
* @param {*} value - value to test
* @returns {boolean} boolean indicating if a value is a typed array constructor
*/
function isTypedArrayConstructor( value ) {
return ( value === TypedArray );
}
/**
* Returns a boolean indicating if a value is a typed array.
*
* @private
* @param {*} value - value to test
* @returns {boolean} boolean indicating if a value is a typed array
*/
function isTypedArray( value ) {
return (
typeof value === 'object' &&
value !== null &&
(
value.constructor.name === CTOR_NAME ||
isPrototypeOf( value, TypedArray.prototype )
) &&
value.BYTES_PER_ELEMENT === BYTES_PER_ELEMENT
);
}
/**
* Fills an output DataView with array values.
*
* @private
* @param {DataView} view - output data view
* @param {Array} arr - input array
* @param {boolean} isLE - boolean indicating whether to store values in little-endian byte order
* @returns {DataView} output data view
*/
function fromArray( view, arr, isLE ) {
var len;
var get;
var i;
len = arr.length;
if ( arr.get && arr.set ) {
get = accessorGetter( 'default' );
} else {
get = getter( 'default' );
}
for ( i = 0; i < len; i++ ) {
view[ SETTER ]( i*BYTES_PER_ELEMENT, get( arr, i ), isLE );
}
return view;
}
}
// EXPORTS //
module.exports = factory;
|