@stdlib/utils-while-each 0.0.7 → 0.1.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/CITATION.cff +30 -0
- package/LICENSE +0 -304
- package/NOTICE +1 -1
- package/README.md +51 -5
- package/dist/index.d.ts +3 -0
- package/dist/index.js +5 -0
- package/dist/index.js.map +7 -0
- package/docs/types/index.d.ts +12 -12
- package/lib/index.js +2 -2
- package/lib/{while_each.js → main.js} +4 -3
- package/package.json +17 -15
- package/docs/repl.txt +0 -47
- package/docs/types/test.ts +0 -71
package/CITATION.cff
ADDED
|
@@ -0,0 +1,30 @@
|
|
|
1
|
+
cff-version: 1.2.0
|
|
2
|
+
title: stdlib
|
|
3
|
+
message: >-
|
|
4
|
+
If you use this software, please cite it using the
|
|
5
|
+
metadata from this file.
|
|
6
|
+
|
|
7
|
+
type: software
|
|
8
|
+
|
|
9
|
+
authors:
|
|
10
|
+
- name: The Stdlib Authors
|
|
11
|
+
url: https://github.com/stdlib-js/stdlib/graphs/contributors
|
|
12
|
+
|
|
13
|
+
repository-code: https://github.com/stdlib-js/stdlib
|
|
14
|
+
url: https://stdlib.io
|
|
15
|
+
|
|
16
|
+
abstract: |
|
|
17
|
+
Standard library for JavaScript and Node.js.
|
|
18
|
+
|
|
19
|
+
keywords:
|
|
20
|
+
- JavaScript
|
|
21
|
+
- Node.js
|
|
22
|
+
- TypeScript
|
|
23
|
+
- standard library
|
|
24
|
+
- scientific computing
|
|
25
|
+
- numerical computing
|
|
26
|
+
- statistical computing
|
|
27
|
+
|
|
28
|
+
license: Apache-2.0 AND BSL-1.0
|
|
29
|
+
|
|
30
|
+
date-released: 2016
|
package/LICENSE
CHANGED
|
@@ -175,307 +175,3 @@
|
|
|
175
175
|
of your accepting any such warranty or additional liability.
|
|
176
176
|
|
|
177
177
|
END OF TERMS AND CONDITIONS
|
|
178
|
-
|
|
179
|
-
|
|
180
|
-
|
|
181
|
-
Boost Software License - Version 1.0 - August 17th, 2003
|
|
182
|
-
|
|
183
|
-
Permission is hereby granted, free of charge, to any person or organization
|
|
184
|
-
obtaining a copy of the software and accompanying documentation covered by this
|
|
185
|
-
license (the "Software") to use, reproduce, display, distribute, execute, and
|
|
186
|
-
transmit the Software, and to prepare derivative works of the Software, and to
|
|
187
|
-
permit third-parties to whom the Software is furnished to do so, all subject to
|
|
188
|
-
the following:
|
|
189
|
-
|
|
190
|
-
The copyright notices in the Software and this entire statement, including the
|
|
191
|
-
above license grant, this restriction and the following disclaimer, must be
|
|
192
|
-
included in all copies of the Software, in whole or in part, and all derivative
|
|
193
|
-
works of the Software, unless such copies or derivative works are solely in the
|
|
194
|
-
form of machine-executable object code generated by a source language processor.
|
|
195
|
-
|
|
196
|
-
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
197
|
-
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
|
|
198
|
-
FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE
|
|
199
|
-
COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE FOR ANY DAMAGES
|
|
200
|
-
OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF
|
|
201
|
-
OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
202
|
-
|
|
203
|
-
|
|
204
|
-
|
|
205
|
-
|
|
206
|
-
DEPENDENCIES
|
|
207
|
-
|
|
208
|
-
The library links against the following external libraries, which have their own
|
|
209
|
-
licenses:
|
|
210
|
-
|
|
211
|
-
* OpenBLAS <https://raw.githubusercontent.com/xianyi/OpenBLAS/
|
|
212
|
-
def146efed8d5908ea04e22668feeab7099599a0/LICENSE>
|
|
213
|
-
|
|
214
|
-
Copyright (c) 2011-2014, The OpenBLAS Project
|
|
215
|
-
All rights reserved.
|
|
216
|
-
|
|
217
|
-
Redistribution and use in source and binary forms, with or without
|
|
218
|
-
modification, are permitted provided that the following conditions are
|
|
219
|
-
met:
|
|
220
|
-
|
|
221
|
-
1. Redistributions of source code must retain the above copyright
|
|
222
|
-
notice, this list of conditions and the following disclaimer.
|
|
223
|
-
|
|
224
|
-
2. Redistributions in binary form must reproduce the above copyright
|
|
225
|
-
notice, this list of conditions and the following disclaimer in
|
|
226
|
-
the documentation and/or other materials provided with the
|
|
227
|
-
distribution.
|
|
228
|
-
|
|
229
|
-
3. Neither the name of the OpenBLAS project nor the names of
|
|
230
|
-
its contributors may be used to endorse or promote products
|
|
231
|
-
derived from this software without specific prior written
|
|
232
|
-
permission.
|
|
233
|
-
|
|
234
|
-
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
235
|
-
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
236
|
-
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
237
|
-
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
|
238
|
-
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
239
|
-
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
|
|
240
|
-
GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
241
|
-
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
242
|
-
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
|
|
243
|
-
THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
244
|
-
|
|
245
|
-
|
|
246
|
-
* Electron <https://raw.githubusercontent.com/electron/electron/
|
|
247
|
-
c4cfb3e7110266b9d7ad80e1ae097c4db564501c/LICENSE>
|
|
248
|
-
|
|
249
|
-
Copyright (c) 2013-2017 GitHub Inc.
|
|
250
|
-
|
|
251
|
-
Permission is hereby granted, free of charge, to any person obtaining
|
|
252
|
-
a copy of this software and associated documentation files (the
|
|
253
|
-
"Software"), to deal in the Software without restriction, including
|
|
254
|
-
without limitation the rights to use, copy, modify, merge, publish,
|
|
255
|
-
distribute, sublicense, and/or sell copies of the Software, and to
|
|
256
|
-
permit persons to whom the Software is furnished to do so, subject to
|
|
257
|
-
the following conditions:
|
|
258
|
-
|
|
259
|
-
The above copyright notice and this permission notice shall be
|
|
260
|
-
included in all copies or substantial portions of the Software.
|
|
261
|
-
|
|
262
|
-
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
|
263
|
-
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
264
|
-
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
|
265
|
-
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
|
266
|
-
LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
|
267
|
-
OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
|
268
|
-
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
269
|
-
|
|
270
|
-
|
|
271
|
-
* Boost <http://www.boost.org/LICENSE_1_0.txt>
|
|
272
|
-
|
|
273
|
-
Boost Software License - Version 1.0 - August 17th, 2003
|
|
274
|
-
|
|
275
|
-
Permission is hereby granted, free of charge, to any person or organization
|
|
276
|
-
obtaining a copy of the software and accompanying documentation covered by
|
|
277
|
-
this license (the "Software") to use, reproduce, display, distribute,
|
|
278
|
-
execute, and transmit the Software, and to prepare derivative works of the
|
|
279
|
-
Software, and to permit third-parties to whom the Software is furnished to
|
|
280
|
-
do so, all subject to the following:
|
|
281
|
-
|
|
282
|
-
The copyright notices in the Software and this entire statement, including
|
|
283
|
-
the above license grant, this restriction and the following disclaimer,
|
|
284
|
-
must be included in all copies of the Software, in whole or in part, and
|
|
285
|
-
all derivative works of the Software, unless such copies or derivative
|
|
286
|
-
works are solely in the form of machine-executable object code generated by
|
|
287
|
-
a source language processor.
|
|
288
|
-
|
|
289
|
-
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
290
|
-
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
291
|
-
FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT
|
|
292
|
-
SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE
|
|
293
|
-
FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,
|
|
294
|
-
ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
|
|
295
|
-
DEALINGS IN THE SOFTWARE.
|
|
296
|
-
|
|
297
|
-
|
|
298
|
-
* Cephes <http://www.netlib.org/cephes/readme>
|
|
299
|
-
|
|
300
|
-
Copyright (c) 1984-2000 Stephen L. Moshier
|
|
301
|
-
|
|
302
|
-
Some software in this archive may be from the book _Methods and Programs for
|
|
303
|
-
Mathematical Functions_ (Prentice-Hall or Simon & Schuster International, 1989)
|
|
304
|
-
or from the Cephes Mathematical Library, a commercial product. In either event,
|
|
305
|
-
it is copyrighted by the author. What you see here may be used freely but it
|
|
306
|
-
comes with no support or guarantee.
|
|
307
|
-
|
|
308
|
-
Stephen L. Moshier
|
|
309
|
-
moshier@na-net.ornl.gov
|
|
310
|
-
|
|
311
|
-
|
|
312
|
-
|
|
313
|
-
ATTRIBUTION
|
|
314
|
-
|
|
315
|
-
The library contains implementations from the following external libraries,
|
|
316
|
-
which have their own licenses:
|
|
317
|
-
|
|
318
|
-
* FreeBSD <https://svnweb.freebsd.org/>
|
|
319
|
-
|
|
320
|
-
Copyright (C) 1993-2004 by Sun Microsystems, Inc. All rights reserved.
|
|
321
|
-
|
|
322
|
-
Developed at SunPro, a Sun Microsystems, Inc. business.
|
|
323
|
-
Permission to use, copy, modify, and distribute this
|
|
324
|
-
software is freely granted, provided that this notice
|
|
325
|
-
is preserved.
|
|
326
|
-
|
|
327
|
-
|
|
328
|
-
* FDLIBM <http://www.netlib.org/fdlibm/>
|
|
329
|
-
|
|
330
|
-
Copyright (C) 2004 by Sun Microsystems, Inc. All rights reserved.
|
|
331
|
-
|
|
332
|
-
Developed at SunPro, a Sun Microsystems, Inc. business.
|
|
333
|
-
Permission to use, copy, modify, and distribute this
|
|
334
|
-
software is freely granted, provided that this notice
|
|
335
|
-
is preserved.
|
|
336
|
-
|
|
337
|
-
|
|
338
|
-
* Go <https://raw.githubusercontent.com/golang/go/master/LICENSE>
|
|
339
|
-
|
|
340
|
-
Copyright (c) 2009 The Go Authors. All rights reserved.
|
|
341
|
-
|
|
342
|
-
Redistribution and use in source and binary forms, with or without
|
|
343
|
-
modification, are permitted provided that the following conditions are
|
|
344
|
-
met:
|
|
345
|
-
|
|
346
|
-
* Redistributions of source code must retain the above copyright
|
|
347
|
-
notice, this list of conditions and the following disclaimer.
|
|
348
|
-
* Redistributions in binary form must reproduce the above
|
|
349
|
-
copyright notice, this list of conditions and the following disclaimer
|
|
350
|
-
in the documentation and/or other materials provided with the
|
|
351
|
-
distribution.
|
|
352
|
-
* Neither the name of Google Inc. nor the names of its
|
|
353
|
-
contributors may be used to endorse or promote products derived from
|
|
354
|
-
this software without specific prior written permission.
|
|
355
|
-
|
|
356
|
-
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
357
|
-
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
358
|
-
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
359
|
-
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
360
|
-
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
361
|
-
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
362
|
-
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
363
|
-
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
364
|
-
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
365
|
-
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
366
|
-
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
367
|
-
|
|
368
|
-
|
|
369
|
-
* SLATEC Common Mathematical Library <http://www.netlib.no/netlib/slatec/>
|
|
370
|
-
|
|
371
|
-
Public domain.
|
|
372
|
-
|
|
373
|
-
|
|
374
|
-
* ESLint <https://raw.githubusercontent.com/eslint/eslint/master/LICENSE>
|
|
375
|
-
|
|
376
|
-
Copyright JS Foundation and other contributors, https://js.foundation
|
|
377
|
-
|
|
378
|
-
Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
379
|
-
of this software and associated documentation files (the "Software"), to deal
|
|
380
|
-
in the Software without restriction, including without limitation the rights
|
|
381
|
-
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
382
|
-
copies of the Software, and to permit persons to whom the Software is
|
|
383
|
-
furnished to do so, subject to the following conditions:
|
|
384
|
-
|
|
385
|
-
The above copyright notice and this permission notice shall be included in
|
|
386
|
-
all copies or substantial portions of the Software.
|
|
387
|
-
|
|
388
|
-
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
389
|
-
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
390
|
-
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
391
|
-
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
392
|
-
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
393
|
-
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
|
394
|
-
THE SOFTWARE.
|
|
395
|
-
|
|
396
|
-
|
|
397
|
-
* StatsFuns.jl <https://raw.githubusercontent.com/JuliaStats/StatsFuns.jl/
|
|
398
|
-
e66dd973650c375bc1739c820e5b96bb5bd000a8/LICENSE.md>
|
|
399
|
-
|
|
400
|
-
Copyright (c) 2015: Dahua Lin.
|
|
401
|
-
|
|
402
|
-
Permission is hereby granted, free of charge, to any person obtaining
|
|
403
|
-
a copy of this software and associated documentation files (the
|
|
404
|
-
"Software"), to deal in the Software without restriction, including
|
|
405
|
-
without limitation the rights to use, copy, modify, merge, publish,
|
|
406
|
-
distribute, sublicense, and/or sell copies of the Software, and to
|
|
407
|
-
permit persons to whom the Software is furnished to do so, subject to
|
|
408
|
-
the following conditions:
|
|
409
|
-
|
|
410
|
-
The above copyright notice and this permission notice shall be
|
|
411
|
-
included in all copies or substantial portions of the Software.
|
|
412
|
-
|
|
413
|
-
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
|
414
|
-
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
415
|
-
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
|
|
416
|
-
IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
|
|
417
|
-
CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
|
|
418
|
-
TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
|
419
|
-
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
420
|
-
|
|
421
|
-
|
|
422
|
-
* SpecialFunctions.jl <https://raw.githubusercontent.com/JuliaMath/
|
|
423
|
-
SpecialFunctions.jl/02a173fbe24a61c4b392aec17a9764ac5727feb1/LICENSE>
|
|
424
|
-
|
|
425
|
-
The MIT License (MIT)
|
|
426
|
-
|
|
427
|
-
Copyright (c) 2017 Jeff Bezanson, Stefan Karpinski, Viral B. Shah, and others:
|
|
428
|
-
|
|
429
|
-
https://github.com/JuliaMath/SpecialFunctions.jl/graphs/contributors
|
|
430
|
-
|
|
431
|
-
Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
432
|
-
of this software and associated documentation files (the "Software"), to deal
|
|
433
|
-
in the Software without restriction, including without limitation the rights
|
|
434
|
-
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
435
|
-
copies of the Software, and to permit persons to whom the Software is
|
|
436
|
-
furnished to do so, subject to the following conditions:
|
|
437
|
-
|
|
438
|
-
The above copyright notice and this permission notice shall be included in all
|
|
439
|
-
copies or substantial portions of the Software.
|
|
440
|
-
|
|
441
|
-
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
442
|
-
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
443
|
-
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
444
|
-
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
445
|
-
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
446
|
-
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|
447
|
-
SOFTWARE.
|
|
448
|
-
|
|
449
|
-
|
|
450
|
-
* MT19937 <http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/MT2002/CODES/
|
|
451
|
-
mt19937ar.c>
|
|
452
|
-
|
|
453
|
-
Copyright (C) 1997 - 2002, Makoto Matsumoto and Takuji Nishimura,
|
|
454
|
-
All rights reserved.
|
|
455
|
-
|
|
456
|
-
Redistribution and use in source and binary forms, with or without
|
|
457
|
-
modification, are permitted provided that the following conditions
|
|
458
|
-
are met:
|
|
459
|
-
|
|
460
|
-
1. Redistributions of source code must retain the above copyright
|
|
461
|
-
notice, this list of conditions and the following disclaimer.
|
|
462
|
-
|
|
463
|
-
2. Redistributions in binary form must reproduce the above copyright
|
|
464
|
-
notice, this list of conditions and the following disclaimer in the
|
|
465
|
-
documentation and/or other materials provided with the distribution.
|
|
466
|
-
|
|
467
|
-
3. The names of its contributors may not be used to endorse or promote
|
|
468
|
-
products derived from this software without specific prior written
|
|
469
|
-
permission.
|
|
470
|
-
|
|
471
|
-
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
472
|
-
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
473
|
-
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
474
|
-
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
475
|
-
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
476
|
-
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
477
|
-
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
478
|
-
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
479
|
-
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
480
|
-
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
481
|
-
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
package/NOTICE
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
Copyright (c) 2016-
|
|
1
|
+
Copyright (c) 2016-2023 The Stdlib Authors.
|
package/README.md
CHANGED
|
@@ -18,9 +18,20 @@ limitations under the License.
|
|
|
18
18
|
|
|
19
19
|
-->
|
|
20
20
|
|
|
21
|
+
|
|
22
|
+
<details>
|
|
23
|
+
<summary>
|
|
24
|
+
About stdlib...
|
|
25
|
+
</summary>
|
|
26
|
+
<p>We believe in a future in which the web is a preferred environment for numerical computation. To help realize this future, we've built stdlib. stdlib is a standard library, with an emphasis on numerical and scientific computation, written in JavaScript (and C) for execution in browsers and in Node.js.</p>
|
|
27
|
+
<p>The library is fully decomposable, being architected in such a way that you can swap out and mix and match APIs and functionality to cater to your exact preferences and use cases.</p>
|
|
28
|
+
<p>When you use stdlib, you can be absolutely certain that you are using the most thorough, rigorous, well-written, studied, documented, tested, measured, and high-quality code out there.</p>
|
|
29
|
+
<p>To join us in bringing numerical computing to the web, get started by checking us out on <a href="https://github.com/stdlib-js/stdlib">GitHub</a>, and please consider <a href="https://opencollective.com/stdlib">financially supporting stdlib</a>. We greatly appreciate your continued support!</p>
|
|
30
|
+
</details>
|
|
31
|
+
|
|
21
32
|
# whileEach
|
|
22
33
|
|
|
23
|
-
[![NPM version][npm-image]][npm-url] [![Build Status][test-image]][test-url] [![Coverage Status][coverage-image]][coverage-url] [![dependencies][dependencies-image]][dependencies-url]
|
|
34
|
+
[![NPM version][npm-image]][npm-url] [![Build Status][test-image]][test-url] [![Coverage Status][coverage-image]][coverage-url] <!-- [![dependencies][dependencies-image]][dependencies-url] -->
|
|
24
35
|
|
|
25
36
|
> While a test condition is true, invoke a function for each element in a collection.
|
|
26
37
|
|
|
@@ -250,6 +261,21 @@ whileEach( arr, predicate, log );
|
|
|
250
261
|
|
|
251
262
|
<!-- /.references -->
|
|
252
263
|
|
|
264
|
+
<!-- Section for related `stdlib` packages. Do not manually edit this section, as it is automatically populated. -->
|
|
265
|
+
|
|
266
|
+
<section class="related">
|
|
267
|
+
|
|
268
|
+
* * *
|
|
269
|
+
|
|
270
|
+
## See Also
|
|
271
|
+
|
|
272
|
+
- <span class="package-name">[`@stdlib/utils-until-each`][@stdlib/utils/until-each]</span><span class="delimiter">: </span><span class="description">until a test condition is true, invoke a function for each element in a collection.</span>
|
|
273
|
+
- <span class="package-name">[`@stdlib/utils-while-each-right`][@stdlib/utils/while-each-right]</span><span class="delimiter">: </span><span class="description">while a test condition is true, invoke a function for each element in a collection, iterating from right to left.</span>
|
|
274
|
+
|
|
275
|
+
</section>
|
|
276
|
+
|
|
277
|
+
<!-- /.related -->
|
|
278
|
+
|
|
253
279
|
<!-- Section for all links. Make sure to keep an empty line after the `section` element and another before the `/section` close. -->
|
|
254
280
|
|
|
255
281
|
|
|
@@ -276,7 +302,7 @@ See [LICENSE][stdlib-license].
|
|
|
276
302
|
|
|
277
303
|
## Copyright
|
|
278
304
|
|
|
279
|
-
Copyright © 2016-
|
|
305
|
+
Copyright © 2016-2023. The Stdlib [Authors][stdlib-authors].
|
|
280
306
|
|
|
281
307
|
</section>
|
|
282
308
|
|
|
@@ -289,22 +315,34 @@ Copyright © 2016-2021. The Stdlib [Authors][stdlib-authors].
|
|
|
289
315
|
[npm-image]: http://img.shields.io/npm/v/@stdlib/utils-while-each.svg
|
|
290
316
|
[npm-url]: https://npmjs.org/package/@stdlib/utils-while-each
|
|
291
317
|
|
|
292
|
-
[test-image]: https://github.com/stdlib-js/utils-while-each/actions/workflows/test.yml/badge.svg
|
|
293
|
-
[test-url]: https://github.com/stdlib-js/utils-while-each/actions/workflows/test.yml
|
|
318
|
+
[test-image]: https://github.com/stdlib-js/utils-while-each/actions/workflows/test.yml/badge.svg?branch=v0.1.0
|
|
319
|
+
[test-url]: https://github.com/stdlib-js/utils-while-each/actions/workflows/test.yml?query=branch:v0.1.0
|
|
294
320
|
|
|
295
321
|
[coverage-image]: https://img.shields.io/codecov/c/github/stdlib-js/utils-while-each/main.svg
|
|
296
322
|
[coverage-url]: https://codecov.io/github/stdlib-js/utils-while-each?branch=main
|
|
297
323
|
|
|
324
|
+
<!--
|
|
325
|
+
|
|
298
326
|
[dependencies-image]: https://img.shields.io/david/stdlib-js/utils-while-each.svg
|
|
299
327
|
[dependencies-url]: https://david-dm.org/stdlib-js/utils-while-each/main
|
|
300
328
|
|
|
329
|
+
-->
|
|
330
|
+
|
|
301
331
|
[chat-image]: https://img.shields.io/gitter/room/stdlib-js/stdlib.svg
|
|
302
|
-
[chat-url]: https://gitter.im
|
|
332
|
+
[chat-url]: https://app.gitter.im/#/room/#stdlib-js_stdlib:gitter.im
|
|
303
333
|
|
|
304
334
|
[stdlib]: https://github.com/stdlib-js/stdlib
|
|
305
335
|
|
|
306
336
|
[stdlib-authors]: https://github.com/stdlib-js/stdlib/graphs/contributors
|
|
307
337
|
|
|
338
|
+
[umd]: https://github.com/umdjs/umd
|
|
339
|
+
[es-module]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Modules
|
|
340
|
+
|
|
341
|
+
[deno-url]: https://github.com/stdlib-js/utils-while-each/tree/deno
|
|
342
|
+
[umd-url]: https://github.com/stdlib-js/utils-while-each/tree/umd
|
|
343
|
+
[esm-url]: https://github.com/stdlib-js/utils-while-each/tree/esm
|
|
344
|
+
[branches-url]: https://github.com/stdlib-js/utils-while-each/blob/main/branches.md
|
|
345
|
+
|
|
308
346
|
[stdlib-license]: https://raw.githubusercontent.com/stdlib-js/utils-while-each/main/LICENSE
|
|
309
347
|
|
|
310
348
|
[mdn-array]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array
|
|
@@ -313,6 +351,14 @@ Copyright © 2016-2021. The Stdlib [Authors][stdlib-authors].
|
|
|
313
351
|
|
|
314
352
|
[mdn-object]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object
|
|
315
353
|
|
|
354
|
+
<!-- <related-links> -->
|
|
355
|
+
|
|
356
|
+
[@stdlib/utils/until-each]: https://www.npmjs.com/package/@stdlib/utils-until-each
|
|
357
|
+
|
|
358
|
+
[@stdlib/utils/while-each-right]: https://www.npmjs.com/package/@stdlib/utils-while-each-right
|
|
359
|
+
|
|
360
|
+
<!-- </related-links> -->
|
|
361
|
+
|
|
316
362
|
</section>
|
|
317
363
|
|
|
318
364
|
<!-- /.links -->
|
package/dist/index.d.ts
ADDED
package/dist/index.js
ADDED
|
@@ -0,0 +1,5 @@
|
|
|
1
|
+
"use strict";var v=function(r,e){return function(){return e||r((e={exports:{}}).exports,e),e.exports}};var m=v(function(E,s){
|
|
2
|
+
var g=require('@stdlib/assert-is-collection/dist'),n=require('@stdlib/assert-is-function/dist'),t=require('@stdlib/error-tools-fmtprodmsg/dist');function w(r,e,u,h){var i,a;if(!g(r))throw new TypeError(t('1YRAh',r));if(!n(e))throw new TypeError(t('1YR2H',e));if(!n(u))throw new TypeError(t('1YR3N',u));for(i=r.length,a=0;a<i&&e(r[a],a,r);)u.call(h,r[a],a,r),a+=1,i=r.length;return r}s.exports=w
|
|
3
|
+
});var f=m();module.exports=f;
|
|
4
|
+
/** @license Apache-2.0 */
|
|
5
|
+
//# sourceMappingURL=index.js.map
|
|
@@ -0,0 +1,7 @@
|
|
|
1
|
+
{
|
|
2
|
+
"version": 3,
|
|
3
|
+
"sources": ["../lib/main.js", "../lib/index.js"],
|
|
4
|
+
"sourcesContent": ["/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isCollection = require( '@stdlib/assert-is-collection' );\nvar isFunction = require( '@stdlib/assert-is-function' );\nvar format = require( '@stdlib/string-format' );\n\n\n// MAIN //\n\n/**\n* While a test condition is true, invokes a function once for each element in a collection.\n*\n* @param {Collection} collection - input collection\n* @param {Function} predicate - function which indicates whether to continue iterating over a collection\n* @param {Function} fcn - function to invoke\n* @param {*} [thisArg] - execution context for the applied function\n* @throws {TypeError} first argument must be a collection\n* @throws {TypeError} second argument must be a function\n* @throws {TypeError} third argument must be a function\n* @returns {Collection} input collection\n*\n* @example\n* function predicate( v, index, collection ) {\n* return ( v === v );\n* }\n*\n* function log( v, index, collection ) {\n* console.log( '%s: %d', index, v );\n* }\n*\n* var arr = [ 1, 2, 3, 4, NaN, 5 ];\n*\n* whileEach( arr, predicate, log );\n*/\nfunction whileEach( collection, predicate, fcn, thisArg ) {\n\tvar len;\n\tvar i;\n\tif ( !isCollection( collection ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a collection. Value: `%s`.', collection ) );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Second argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tif ( !isFunction( fcn ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Third argument must be a function. Value: `%s`.', fcn ) );\n\t}\n\tlen = collection.length;\n\ti = 0;\n\twhile (\n\t\ti < len &&\n\t\tpredicate( collection[ i ], i, collection )\n\t) {\n\t\tfcn.call( thisArg, collection[ i ], i, collection );\n\t\ti += 1;\n\t\tlen = collection.length; // ...account for dynamically resizing a collection\n\t}\n\treturn collection;\n}\n\n\n// EXPORTS //\n\nmodule.exports = whileEach;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* While a test condition is true, invoke a function once for each element in a collection.\n*\n* @module @stdlib/utils-while-each\n*\n* @example\n* var whileEach = require( '@stdlib/utils-while-each' );\n*\n* function predicate( v, index, collection ) {\n* return ( v === v );\n* }\n*\n* function log( v, index, collection ) {\n* console.log( '%s: %d', index, v );\n* }\n*\n* var arr = [ 1, 2, 3, 4, NaN, 5 ];\n*\n* whileEach( arr, predicate, log );\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n"],
|
|
5
|
+
"mappings": "uGAAA,IAAAA,EAAAC,EAAA,SAAAC,EAAAC,EAAA,cAsBA,IAAIC,EAAe,QAAS,8BAA+B,EACvDC,EAAa,QAAS,4BAA6B,EACnDC,EAAS,QAAS,uBAAwB,EA8B9C,SAASC,EAAWC,EAAYC,EAAWC,EAAKC,EAAU,CACzD,IAAIC,EACAC,EACJ,GAAK,CAACT,EAAcI,CAAW,EAC9B,MAAM,IAAI,UAAWF,EAAQ,sEAAuEE,CAAW,CAAE,EAElH,GAAK,CAACH,EAAYI,CAAU,EAC3B,MAAM,IAAI,UAAWH,EAAQ,qEAAsEG,CAAU,CAAE,EAEhH,GAAK,CAACJ,EAAYK,CAAI,EACrB,MAAM,IAAI,UAAWJ,EAAQ,oEAAqEI,CAAI,CAAE,EAIzG,IAFAE,EAAMJ,EAAW,OACjBK,EAAI,EAEHA,EAAID,GACJH,EAAWD,EAAYK,CAAE,EAAGA,EAAGL,CAAW,GAE1CE,EAAI,KAAMC,EAASH,EAAYK,CAAE,EAAGA,EAAGL,CAAW,EAClDK,GAAK,EACLD,EAAMJ,EAAW,OAElB,OAAOA,CACR,CAKAL,EAAO,QAAUI,ICvCjB,IAAIO,EAAO,IAKX,OAAO,QAAUA",
|
|
6
|
+
"names": ["require_main", "__commonJSMin", "exports", "module", "isCollection", "isFunction", "format", "whileEach", "collection", "predicate", "fcn", "thisArg", "len", "i", "main"]
|
|
7
|
+
}
|
package/docs/types/index.d.ts
CHANGED
|
@@ -16,11 +16,11 @@
|
|
|
16
16
|
* limitations under the License.
|
|
17
17
|
*/
|
|
18
18
|
|
|
19
|
-
// TypeScript Version:
|
|
19
|
+
// TypeScript Version: 4.1
|
|
20
20
|
|
|
21
21
|
/// <reference types="@stdlib/types"/>
|
|
22
22
|
|
|
23
|
-
import { Collection } from '@stdlib/types/
|
|
23
|
+
import { Collection } from '@stdlib/types/array';
|
|
24
24
|
|
|
25
25
|
/**
|
|
26
26
|
* Checks whether an element in a collection passes a test.
|
|
@@ -35,7 +35,7 @@ type NullaryPredicate = () => boolean;
|
|
|
35
35
|
* @param value - collection value
|
|
36
36
|
* @returns boolean indicating whether an element in a collection passes a test
|
|
37
37
|
*/
|
|
38
|
-
type UnaryPredicate = ( value:
|
|
38
|
+
type UnaryPredicate<T> = ( value: T ) => boolean;
|
|
39
39
|
|
|
40
40
|
/**
|
|
41
41
|
* Checks whether an element in a collection passes a test.
|
|
@@ -44,7 +44,7 @@ type UnaryPredicate = ( value: any ) => boolean;
|
|
|
44
44
|
* @param index - collection index
|
|
45
45
|
* @returns boolean indicating whether an element in a collection passes a test
|
|
46
46
|
*/
|
|
47
|
-
type BinaryPredicate = ( value:
|
|
47
|
+
type BinaryPredicate<T> = ( value: T, index: number ) => boolean;
|
|
48
48
|
|
|
49
49
|
/**
|
|
50
50
|
* Checks whether an element in a collection passes a test.
|
|
@@ -54,7 +54,7 @@ type BinaryPredicate = ( value: any, index: number ) => boolean;
|
|
|
54
54
|
* @param collection - input collection
|
|
55
55
|
* @returns boolean indicating whether an element in a collection passes a test
|
|
56
56
|
*/
|
|
57
|
-
type
|
|
57
|
+
type TernaryPredicate<T> = ( value: T, index: number, collection: Collection<T> ) => boolean;
|
|
58
58
|
|
|
59
59
|
/**
|
|
60
60
|
* Checks whether an element in a collection passes a test.
|
|
@@ -64,19 +64,19 @@ type TertiaryPredicate = ( value: any, index: number, collection: Collection ) =
|
|
|
64
64
|
* @param collection - input collection
|
|
65
65
|
* @returns boolean indicating whether an element in a collection passes a test
|
|
66
66
|
*/
|
|
67
|
-
type Predicate = NullaryPredicate | UnaryPredicate | BinaryPredicate |
|
|
67
|
+
type Predicate<T> = NullaryPredicate | UnaryPredicate<T> | BinaryPredicate<T> | TernaryPredicate<T>;
|
|
68
68
|
|
|
69
69
|
/**
|
|
70
70
|
* Function invoked for each collection element passing a test.
|
|
71
71
|
*/
|
|
72
|
-
type Nullary = () => void;
|
|
72
|
+
type Nullary<U> = ( this: U ) => void;
|
|
73
73
|
|
|
74
74
|
/**
|
|
75
75
|
* Function invoked for each collection element passing a test.
|
|
76
76
|
*
|
|
77
77
|
* @param value - collection value
|
|
78
78
|
*/
|
|
79
|
-
type Unary = ( value:
|
|
79
|
+
type Unary<T, U> = ( this: U, value: T ) => void;
|
|
80
80
|
|
|
81
81
|
/**
|
|
82
82
|
* Function invoked for each collection element passing a test.
|
|
@@ -84,7 +84,7 @@ type Unary = ( value: any ) => void;
|
|
|
84
84
|
* @param value - collection value
|
|
85
85
|
* @param index - collection index
|
|
86
86
|
*/
|
|
87
|
-
type Binary = ( value:
|
|
87
|
+
type Binary<T, U> = ( this: U, value: T, index: number ) => void;
|
|
88
88
|
|
|
89
89
|
/**
|
|
90
90
|
* Function invoked for each collection element passing a test.
|
|
@@ -93,7 +93,7 @@ type Binary = ( value: any, index: number ) => void;
|
|
|
93
93
|
* @param index - collection index
|
|
94
94
|
* @param collection - input collection
|
|
95
95
|
*/
|
|
96
|
-
type
|
|
96
|
+
type Ternary<T, U> = ( this: U, value: T, index: number, collection: Collection<T> ) => void;
|
|
97
97
|
|
|
98
98
|
/**
|
|
99
99
|
* Function invoked for each collection element passing a test.
|
|
@@ -102,7 +102,7 @@ type Tertiary = ( value: any, index: number, collection: Collection ) => void;
|
|
|
102
102
|
* @param index - collection index
|
|
103
103
|
* @param collection - input collection
|
|
104
104
|
*/
|
|
105
|
-
type Callback = Nullary | Unary | Binary |
|
|
105
|
+
type Callback<T, U> = Nullary<U> | Unary<T, U> | Binary<T, U> | Ternary<T, U>;
|
|
106
106
|
|
|
107
107
|
/**
|
|
108
108
|
* While a test condition is true, invokes a function once for each element in a collection.
|
|
@@ -134,7 +134,7 @@ type Callback = Nullary | Unary | Binary | Tertiary;
|
|
|
134
134
|
*
|
|
135
135
|
* whileEach( arr, predicate, log );
|
|
136
136
|
*/
|
|
137
|
-
declare function whileEach( collection: Collection
|
|
137
|
+
declare function whileEach<T = unknown, U = unknown>( collection: Collection<T>, predicate: Predicate<T>, fcn: Callback<T, U>, thisArg?: ThisParameterType<Callback<T, U>> ): Collection<T>;
|
|
138
138
|
|
|
139
139
|
|
|
140
140
|
// EXPORTS //
|
package/lib/index.js
CHANGED
|
@@ -22,6 +22,7 @@
|
|
|
22
22
|
|
|
23
23
|
var isCollection = require( '@stdlib/assert-is-collection' );
|
|
24
24
|
var isFunction = require( '@stdlib/assert-is-function' );
|
|
25
|
+
var format = require( '@stdlib/string-format' );
|
|
25
26
|
|
|
26
27
|
|
|
27
28
|
// MAIN //
|
|
@@ -55,13 +56,13 @@ function whileEach( collection, predicate, fcn, thisArg ) {
|
|
|
55
56
|
var len;
|
|
56
57
|
var i;
|
|
57
58
|
if ( !isCollection( collection ) ) {
|
|
58
|
-
throw new TypeError( 'invalid argument. First argument must be a collection. Value:
|
|
59
|
+
throw new TypeError( format( 'invalid argument. First argument must be a collection. Value: `%s`.', collection ) );
|
|
59
60
|
}
|
|
60
61
|
if ( !isFunction( predicate ) ) {
|
|
61
|
-
throw new TypeError( 'invalid argument. Second argument must be a function. Value:
|
|
62
|
+
throw new TypeError( format( 'invalid argument. Second argument must be a function. Value: `%s`.', predicate ) );
|
|
62
63
|
}
|
|
63
64
|
if ( !isFunction( fcn ) ) {
|
|
64
|
-
throw new TypeError( 'invalid argument. Third argument must be a function. Value:
|
|
65
|
+
throw new TypeError( format( 'invalid argument. Third argument must be a function. Value: `%s`.', fcn ) );
|
|
65
66
|
}
|
|
66
67
|
len = collection.length;
|
|
67
68
|
i = 0;
|
package/package.json
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
{
|
|
2
2
|
"name": "@stdlib/utils-while-each",
|
|
3
|
-
"version": "0.0
|
|
3
|
+
"version": "0.1.0",
|
|
4
4
|
"description": "While a test condition is true, invoke a function for each element in a collection.",
|
|
5
5
|
"license": "Apache-2.0",
|
|
6
6
|
"author": {
|
|
@@ -37,22 +37,24 @@
|
|
|
37
37
|
"url": "https://github.com/stdlib-js/stdlib/issues"
|
|
38
38
|
},
|
|
39
39
|
"dependencies": {
|
|
40
|
-
"@stdlib/assert-is-collection": "^0.0
|
|
41
|
-
"@stdlib/assert-is-function": "^0.0
|
|
42
|
-
"@stdlib/
|
|
40
|
+
"@stdlib/assert-is-collection": "^0.1.0",
|
|
41
|
+
"@stdlib/assert-is-function": "^0.1.0",
|
|
42
|
+
"@stdlib/string-format": "^0.1.0",
|
|
43
|
+
"@stdlib/types": "^0.1.0",
|
|
44
|
+
"@stdlib/error-tools-fmtprodmsg": "^0.1.0"
|
|
43
45
|
},
|
|
44
46
|
"devDependencies": {
|
|
45
|
-
"@stdlib/array-float32": "^0.0
|
|
46
|
-
"@stdlib/array-float64": "^0.0
|
|
47
|
-
"@stdlib/assert-is-even": "^0.0
|
|
48
|
-
"@stdlib/bench": "^0.0
|
|
49
|
-
"@stdlib/math-base-assert-is-nan": "^0.0
|
|
50
|
-
"@stdlib/math-base-special-floor": "^0.0
|
|
51
|
-
"@stdlib/random-base-randu": "^0.0.
|
|
52
|
-
"@stdlib/utils-noop": "^0.0
|
|
47
|
+
"@stdlib/array-float32": "^0.1.0",
|
|
48
|
+
"@stdlib/array-float64": "^0.1.0",
|
|
49
|
+
"@stdlib/assert-is-even": "^0.1.0",
|
|
50
|
+
"@stdlib/bench": "^0.1.0",
|
|
51
|
+
"@stdlib/math-base-assert-is-nan": "^0.1.0",
|
|
52
|
+
"@stdlib/math-base-special-floor": "^0.1.0",
|
|
53
|
+
"@stdlib/random-base-randu": "^0.0.8",
|
|
54
|
+
"@stdlib/utils-noop": "^0.1.0",
|
|
53
55
|
"tape": "git+https://github.com/kgryte/tape.git#fix/globby",
|
|
54
56
|
"istanbul": "^0.4.1",
|
|
55
|
-
"tap-
|
|
57
|
+
"tap-min": "git+https://github.com/Planeshifter/tap-min.git"
|
|
56
58
|
},
|
|
57
59
|
"engines": {
|
|
58
60
|
"node": ">=0.10.0",
|
|
@@ -89,7 +91,7 @@
|
|
|
89
91
|
"typed array"
|
|
90
92
|
],
|
|
91
93
|
"funding": {
|
|
92
|
-
"type": "
|
|
93
|
-
"url": "https://
|
|
94
|
+
"type": "opencollective",
|
|
95
|
+
"url": "https://opencollective.com/stdlib"
|
|
94
96
|
}
|
|
95
97
|
}
|
package/docs/repl.txt
DELETED
|
@@ -1,47 +0,0 @@
|
|
|
1
|
-
|
|
2
|
-
{{alias}}( collection, predicate, fcn[, thisArg] )
|
|
3
|
-
While a test condition is true, invokes a function for each element in a
|
|
4
|
-
collection.
|
|
5
|
-
|
|
6
|
-
When invoked, both the predicate function and the function to apply are
|
|
7
|
-
provided three arguments:
|
|
8
|
-
|
|
9
|
-
- `value`: collection value
|
|
10
|
-
- `index`: collection index
|
|
11
|
-
- `collection`: the input collection
|
|
12
|
-
|
|
13
|
-
Parameters
|
|
14
|
-
----------
|
|
15
|
-
collection: Array|TypedArray|Object
|
|
16
|
-
Input collection over which to iterate. If provided an object, the
|
|
17
|
-
object must be array-like (excluding strings and functions).
|
|
18
|
-
|
|
19
|
-
predicate: Function
|
|
20
|
-
The predicate function which indicates whether to continue iterating
|
|
21
|
-
over a collection.
|
|
22
|
-
|
|
23
|
-
fcn: Function
|
|
24
|
-
The function to invoke for each element in a collection.
|
|
25
|
-
|
|
26
|
-
thisArg: any (optional)
|
|
27
|
-
Execution context for the applied function.
|
|
28
|
-
|
|
29
|
-
Returns
|
|
30
|
-
-------
|
|
31
|
-
out: Array|TypedArray|Object
|
|
32
|
-
Input collection.
|
|
33
|
-
|
|
34
|
-
Examples
|
|
35
|
-
--------
|
|
36
|
-
> function predicate( v ) { return v === v; };
|
|
37
|
-
> function logger( v, i ) { console.log( '%s: %d', i, v ); };
|
|
38
|
-
> var arr = [ 1, 2, 3, 4, NaN, 5 ];
|
|
39
|
-
> {{alias}}( arr, predicate, logger )
|
|
40
|
-
0: 1
|
|
41
|
-
1: 2
|
|
42
|
-
2: 3
|
|
43
|
-
3: 4
|
|
44
|
-
|
|
45
|
-
See Also
|
|
46
|
-
--------
|
|
47
|
-
|
package/docs/types/test.ts
DELETED
|
@@ -1,71 +0,0 @@
|
|
|
1
|
-
/*
|
|
2
|
-
* @license Apache-2.0
|
|
3
|
-
*
|
|
4
|
-
* Copyright (c) 2019 The Stdlib Authors.
|
|
5
|
-
*
|
|
6
|
-
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
7
|
-
* you may not use this file except in compliance with the License.
|
|
8
|
-
* You may obtain a copy of the License at
|
|
9
|
-
*
|
|
10
|
-
* http://www.apache.org/licenses/LICENSE-2.0
|
|
11
|
-
*
|
|
12
|
-
* Unless required by applicable law or agreed to in writing, software
|
|
13
|
-
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
14
|
-
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
15
|
-
* See the License for the specific language governing permissions and
|
|
16
|
-
* limitations under the License.
|
|
17
|
-
*/
|
|
18
|
-
|
|
19
|
-
import whileEach = require( './index' );
|
|
20
|
-
|
|
21
|
-
const log = ( v: any, index: number ): void => {
|
|
22
|
-
console.log( `${index}: ${v}` );
|
|
23
|
-
};
|
|
24
|
-
|
|
25
|
-
const isNotNaN = ( v: number ): boolean => {
|
|
26
|
-
return ( v === v );
|
|
27
|
-
};
|
|
28
|
-
|
|
29
|
-
// TESTS //
|
|
30
|
-
|
|
31
|
-
// The function returns the input collection...
|
|
32
|
-
{
|
|
33
|
-
whileEach( [ 0, 1, 1, NaN, 2 ], isNotNaN, log ); // $ExpectType Collection
|
|
34
|
-
whileEach( [ -1, 1, 2 ], isNotNaN, log, {} ); // $ExpectType Collection
|
|
35
|
-
}
|
|
36
|
-
|
|
37
|
-
// The compiler throws an error if the function is provided a first argument which is not a collection...
|
|
38
|
-
{
|
|
39
|
-
whileEach( 2, isNotNaN, log ); // $ExpectError
|
|
40
|
-
whileEach( false, isNotNaN, log ); // $ExpectError
|
|
41
|
-
whileEach( true, isNotNaN, log ); // $ExpectError
|
|
42
|
-
whileEach( {}, isNotNaN, log ); // $ExpectError
|
|
43
|
-
}
|
|
44
|
-
|
|
45
|
-
// The compiler throws an error if the function is provided a second argument which is not a function...
|
|
46
|
-
{
|
|
47
|
-
whileEach( [ 0, 1, 1, NaN, 2 ], 2, log ); // $ExpectError
|
|
48
|
-
whileEach( [ 0, 1, 1, NaN, 2 ], false, log ); // $ExpectError
|
|
49
|
-
whileEach( [ 0, 1, 1, NaN, 2 ], true, log ); // $ExpectError
|
|
50
|
-
whileEach( [ 0, 1, 1, NaN, 2 ], 'abc', log ); // $ExpectError
|
|
51
|
-
whileEach( [ 0, 1, 1, NaN, 2 ], {}, log ); // $ExpectError
|
|
52
|
-
whileEach( [ 0, 1, 1, NaN, 2 ], [], log ); // $ExpectError
|
|
53
|
-
}
|
|
54
|
-
|
|
55
|
-
// The compiler throws an error if the function is provided a third argument which is not a function...
|
|
56
|
-
{
|
|
57
|
-
whileEach( [ 0, 1, 1, NaN, 2 ], isNotNaN, 2 ); // $ExpectError
|
|
58
|
-
whileEach( [ 0, 1, 1, NaN, 2 ], isNotNaN, false ); // $ExpectError
|
|
59
|
-
whileEach( [ 0, 1, 1, NaN, 2 ], isNotNaN, true ); // $ExpectError
|
|
60
|
-
whileEach( [ 0, 1, 1, NaN, 2 ], isNotNaN, 'abc' ); // $ExpectError
|
|
61
|
-
whileEach( [ 0, 1, 1, NaN, 2 ], isNotNaN, {} ); // $ExpectError
|
|
62
|
-
whileEach( [ 0, 1, 1, NaN, 2 ], isNotNaN, [] ); // $ExpectError
|
|
63
|
-
}
|
|
64
|
-
|
|
65
|
-
// The compiler throws an error if the function is provided an invalid number of arguments...
|
|
66
|
-
{
|
|
67
|
-
whileEach(); // $ExpectError
|
|
68
|
-
whileEach( [ 1, 2, 3 ] ); // $ExpectError
|
|
69
|
-
whileEach( [ 1, 2, 3 ], isNotNaN ); // $ExpectError
|
|
70
|
-
whileEach( [ 1, 2, 3 ], isNotNaN, log, {}, 3 ); // $ExpectError
|
|
71
|
-
}
|