1 |
|
2 |
|
3 |
|
4 |
|
5 |
|
6 |
|
7 |
|
8 |
|
9 |
|
10 |
|
11 |
|
12 |
|
13 |
|
14 |
|
15 |
|
16 |
|
17 |
|
18 |
|
19 |
|
20 | export type Primitive = number | string | boolean | Date;
|
21 |
|
22 |
|
23 |
|
24 |
|
25 | export interface Numeric {
|
26 | valueOf(): number;
|
27 | }
|
28 |
|
29 |
|
30 |
|
31 |
|
32 |
|
33 |
|
34 |
|
35 |
|
36 | export function min(iterable: Iterable<string>): string | undefined;
|
37 |
|
38 |
|
39 |
|
40 |
|
41 | export function min<T extends Numeric>(iterable: Iterable<T>): T | undefined;
|
42 |
|
43 |
|
44 |
|
45 | export function min<T>(
|
46 | iterable: Iterable<T>,
|
47 | accessor: (datum: T, index: number, array: Iterable<T>) => string | undefined | null
|
48 | ): string | undefined;
|
49 |
|
50 |
|
51 |
|
52 | export function min<T, U extends Numeric>(
|
53 | iterable: Iterable<T>,
|
54 | accessor: (datum: T, index: number, array: Iterable<T>) => U | undefined | null
|
55 | ): U | undefined;
|
56 |
|
57 |
|
58 |
|
59 |
|
60 | export function minIndex(iterable: Iterable<unknown>): number;
|
61 |
|
62 |
|
63 |
|
64 | export function minIndex<TDatum>(
|
65 | iterable: Iterable<TDatum>,
|
66 | accessor: (datum: TDatum, index: number, array: Iterable<TDatum>) => unknown
|
67 | ): number;
|
68 |
|
69 |
|
70 |
|
71 | export function minIndex(iterable: Iterable<unknown>): number;
|
72 |
|
73 |
|
74 |
|
75 |
|
76 | export function max(iterable: Iterable<string>): string | undefined;
|
77 |
|
78 |
|
79 |
|
80 | export function max<T extends Numeric>(iterable: Iterable<T>): T | undefined;
|
81 |
|
82 |
|
83 |
|
84 | export function max<T>(
|
85 | iterable: Iterable<T>,
|
86 | accessor: (datum: T, index: number, array: Iterable<T>) => string | undefined | null
|
87 | ): string | undefined;
|
88 |
|
89 |
|
90 |
|
91 | export function max<T, U extends Numeric>(
|
92 | iterable: Iterable<T>,
|
93 | accessor: (datum: T, index: number, array: Iterable<T>) => U | undefined | null
|
94 | ): U | undefined;
|
95 |
|
96 |
|
97 |
|
98 |
|
99 | export function maxIndex(iterable: Iterable<unknown>): number;
|
100 |
|
101 |
|
102 |
|
103 | export function maxIndex<TDatum>(
|
104 | iterable: Iterable<TDatum>,
|
105 | accessor: (datum: TDatum, index: number, array: Iterable<TDatum>) => unknown
|
106 | ): number;
|
107 |
|
108 |
|
109 |
|
110 |
|
111 | export function extent(iterable: Iterable<string>): [string, string] | [undefined, undefined];
|
112 |
|
113 |
|
114 |
|
115 | export function extent<T extends Numeric>(iterable: Iterable<T>): [T, T] | [undefined, undefined];
|
116 |
|
117 |
|
118 |
|
119 | export function extent<T>(
|
120 | iterable: Iterable<T>,
|
121 | accessor: (datum: T, index: number, array: Iterable<T>) => string | undefined | null
|
122 | ): [string, string] | [undefined, undefined];
|
123 |
|
124 |
|
125 |
|
126 | export function extent<T, U extends Numeric>(
|
127 | iterable: Iterable<T>,
|
128 | accessor: (datum: T, index: number, array: Iterable<T>) => U | undefined | null
|
129 | ): [U, U] | [undefined, undefined];
|
130 |
|
131 |
|
132 |
|
133 |
|
134 |
|
135 |
|
136 |
|
137 |
|
138 | export function mode(iterable: Iterable<Numeric | undefined | null>): number;
|
139 |
|
140 |
|
141 |
|
142 |
|
143 |
|
144 |
|
145 |
|
146 | export function mode<T>(iterable: Iterable<T>, accessor: (datum: T, index: number, array: Iterable<T>) => number | undefined | null): number;
|
147 |
|
148 |
|
149 |
|
150 |
|
151 | export function sum(iterable: Iterable<Numeric | undefined | null>): number;
|
152 |
|
153 |
|
154 |
|
155 | export function sum<T>(
|
156 | iterable: Iterable<T>,
|
157 | accessor: (datum: T, index: number, array: Iterable<T>) => number | undefined | null
|
158 | ): number;
|
159 |
|
160 |
|
161 |
|
162 |
|
163 | export function mean(iterable: Iterable<Numeric | undefined | null>): number | undefined;
|
164 |
|
165 |
|
166 |
|
167 | export function mean<T>(
|
168 | iterable: Iterable<T>,
|
169 | accessor: (datum: T, index: number, array: Iterable<T>) => number | undefined | null
|
170 | ): number | undefined;
|
171 |
|
172 |
|
173 |
|
174 |
|
175 | export function median(iterable: Iterable<Numeric | undefined | null>): number | undefined;
|
176 |
|
177 |
|
178 |
|
179 | export function median<T>(
|
180 | iterable: Iterable<T>,
|
181 | accessor: (element: T, i: number, array: Iterable<T>) => number | undefined | null
|
182 | ): number | undefined;
|
183 |
|
184 |
|
185 |
|
186 |
|
187 |
|
188 |
|
189 |
|
190 | export function cumsum(iterable: Iterable<Numeric | undefined | null>): Float64Array;
|
191 |
|
192 |
|
193 |
|
194 |
|
195 |
|
196 |
|
197 | export function cumsum<T>(
|
198 | iterable: Iterable<T>,
|
199 | accessor: (element: T, i: number, array: Iterable<T>) => number | undefined | null
|
200 | ): Float64Array;
|
201 |
|
202 |
|
203 |
|
204 |
|
205 |
|
206 |
|
207 | export function quantile(iterable: Iterable<Numeric | undefined | null>, p: number): number | undefined;
|
208 |
|
209 |
|
210 |
|
211 |
|
212 |
|
213 | export function quantile<T>(
|
214 | iterable: Iterable<T>,
|
215 | p: number,
|
216 | accessor: (element: T, i: number, array: Iterable<T>) => number | undefined | null
|
217 | ): number | undefined;
|
218 |
|
219 |
|
220 |
|
221 |
|
222 |
|
223 | export function quantileSorted(
|
224 | array: Array<Numeric | undefined | null>,
|
225 | p: number
|
226 | ): number | undefined;
|
227 |
|
228 |
|
229 |
|
230 |
|
231 | export function quantileSorted<T>(
|
232 | array: T[],
|
233 | p: number,
|
234 | accessor: (element: T, i: number, array: T[]) => number | undefined | null
|
235 | ): number | undefined;
|
236 |
|
237 |
|
238 |
|
239 |
|
240 |
|
241 |
|
242 |
|
243 | export function rank(iterable: Iterable<Numeric | undefined | null>): Float64Array;
|
244 |
|
245 |
|
246 |
|
247 |
|
248 |
|
249 |
|
250 | export function rank<T>(
|
251 | iterable: Iterable<T>,
|
252 | accessor: (datum: T, index: number, array: Iterable<T>) => number | undefined | null
|
253 | ): Float64Array;
|
254 |
|
255 |
|
256 |
|
257 |
|
258 |
|
259 |
|
260 |
|
261 | export function variance(iterable: Iterable<Numeric | undefined | null>): number | undefined;
|
262 |
|
263 |
|
264 |
|
265 |
|
266 |
|
267 |
|
268 | export function variance<T>(
|
269 | iterable: Iterable<T>,
|
270 | accessor: (datum: T, index: number, array: Iterable<T>) => number | undefined | null
|
271 | ): number | undefined;
|
272 |
|
273 |
|
274 |
|
275 |
|
276 | export function deviation(iterable: Iterable<Numeric | undefined | null>): number | undefined;
|
277 |
|
278 |
|
279 |
|
280 |
|
281 | export function deviation<T>(
|
282 | iterable: Iterable<T>,
|
283 | accessor: (datum: T, index: number, array: Iterable<T>) => number | undefined | null
|
284 | ): number | undefined;
|
285 |
|
286 |
|
287 |
|
288 |
|
289 |
|
290 | export function fsum(values: Iterable<Numeric | undefined | null>): number;
|
291 |
|
292 |
|
293 |
|
294 |
|
295 | export function fsum<T>(
|
296 | values: Iterable<T>,
|
297 | accessor: (datum: T, index: number, array: Iterable<T>) => number | undefined | null
|
298 | ): number;
|
299 |
|
300 |
|
301 |
|
302 |
|
303 |
|
304 | export function fcumsum(values: Iterable<Numeric | undefined | null>): Float64Array;
|
305 |
|
306 |
|
307 |
|
308 |
|
309 | export function fcumsum<T>(
|
310 | values: Iterable<T>,
|
311 | accessor: (datum: T, index: number, array: Iterable<T>) => number | undefined | null
|
312 | ): Float64Array;
|
313 |
|
314 | export class Adder {
|
315 | |
316 |
|
317 |
|
318 | constructor();
|
319 |
|
320 | /**
|
321 | * Adds the specified number to the adder’s current value and returns the adder.
|
322 | */
|
323 | add(number: number): Adder;
|
324 |
|
325 | /**
|
326 | * Returns the IEEE 754 double precision representation of the adder’s current value.
|
327 | * Most useful as the short-hand notation +adder.
|
328 | */
|
329 | valueOf(): number;
|
330 | }
|
331 |
|
332 | // --------------------------------------------------------------------------------------
|
333 | // Search
|
334 | // --------------------------------------------------------------------------------------
|
335 |
|
336 | /**
|
337 | * Returns the least element of the specified iterable according to the specified comparator.
|
338 | * If comparator is not specified, it defaults to ascending.
|
339 | */
|
340 | export function least<T>(iterable: Iterable<T>, comparator?: (a: T, b: T) => number): T | undefined;
|
341 | /**
|
342 | * Returns the least element of the specified iterable according to the specified accessor.
|
343 | */
|
344 | export function least<T>(iterable: Iterable<T>, accessor: (a: T) => unknown): T | undefined;
|
345 |
|
346 | /**
|
347 | * Returns the index of the least element of the specified iterable according to the specified comparator.
|
348 | */
|
349 | export function leastIndex(iterable: Iterable<unknown>): number | undefined;
|
350 | /**
|
351 | * Returns the index of the least element of the specified iterable according to the specified comparator.
|
352 | */
|
353 | export function leastIndex<T>(iterable: Iterable<T>, comparator: (a: T, b: T) => number): number | undefined;
|
354 | /**
|
355 | * Returns the index of the least element of the specified iterable according to the specified accessor.
|
356 | */
|
357 | // tslint:disable-next-line:unified-signatures
|
358 | export function leastIndex<T>(iterable: Iterable<T>, accessor: (a: T) => unknown): number | undefined;
|
359 |
|
360 | /**
|
361 | * Returns the greatest element of the specified iterable according to the specified comparator or accessor.
|
362 | * If the given iterable contains no comparable elements (i.e., the comparator returns NaN when comparing each element to itself), returns undefined.
|
363 | * If comparator is not specified, it defaults to ascending.
|
364 | */
|
365 | export function greatest<T>(iterable: Iterable<T>, comparator?: (a: T, b: T) => number): T | undefined;
|
366 | /**
|
367 | * Returns the greatest element of the specified iterable according to the specified comparator or accessor.
|
368 | * If the given iterable contains no comparable elements (i.e., the comparator returns NaN when comparing each element to itself), returns undefined.
|
369 | * If comparator is not specified, it defaults to ascending.
|
370 | */
|
371 | export function greatest<T>(iterable: Iterable<T>, accessor: (a: T) => unknown): T | undefined;
|
372 |
|
373 | /**
|
374 | * Returns the index of the greatest element of the specified iterable according to the specified comparator or accessor.
|
375 | * If the given iterable contains no comparable elements (i.e., the comparator returns NaN when comparing each element to itself), returns -1.
|
376 | * If comparator is not specified, it defaults to ascending.
|
377 | */
|
378 | export function greatestIndex(iterable: Iterable<unknown>): number | undefined;
|
379 | /**
|
380 | * Returns the index of the greatest element of the specified iterable according to the specified comparator or accessor.
|
381 | * If the given iterable contains no comparable elements (i.e., the comparator returns NaN when comparing each element to itself), returns -1.
|
382 | * If comparator is not specified, it defaults to ascending.
|
383 | */
|
384 | export function greatestIndex<T>(iterable: Iterable<T>, comparator: (a: T, b: T) => number): number | undefined;
|
385 | /**
|
386 | * Returns the index of the greatest element of the specified iterable according to the specified comparator or accessor.
|
387 | * If the given iterable contains no comparable elements (i.e., the comparator returns NaN when comparing each element to itself), returns -1.
|
388 | * If comparator is not specified, it defaults to ascending.
|
389 | */
|
390 | // tslint:disable-next-line:unified-signatures
|
391 | export function greatestIndex<T>(iterable: Iterable<T>, accessor: (a: T) => unknown): number | undefined;
|
392 |
|
393 | export function bisectLeft(array: ArrayLike<number>, x: number, lo?: number, hi?: number): number;
|
394 | export function bisectLeft(array: ArrayLike<string>, x: string, lo?: number, hi?: number): number;
|
395 | export function bisectLeft(array: ArrayLike<Date>, x: Date, lo?: number, hi?: number): number;
|
396 |
|
397 | export function bisectRight(array: ArrayLike<number>, x: number, lo?: number, hi?: number): number;
|
398 | export function bisectRight(array: ArrayLike<string>, x: string, lo?: number, hi?: number): number;
|
399 | export function bisectRight(array: ArrayLike<Date>, x: Date, lo?: number, hi?: number): number;
|
400 |
|
401 | export function bisectCenter(array: ArrayLike<number>, x: number, lo?: number, hi?: number): number;
|
402 | export function bisectCenter(array: ArrayLike<string>, x: string, lo?: number, hi?: number): number;
|
403 | export function bisectCenter(array: ArrayLike<Date>, x: Date, lo?: number, hi?: number): number;
|
404 |
|
405 | export const bisect: typeof bisectRight;
|
406 |
|
407 | export interface Bisector<T, U> {
|
408 | left(array: ArrayLike<T>, x: U, lo?: number, hi?: number): number;
|
409 | right(array: ArrayLike<T>, x: U, lo?: number, hi?: number): number;
|
410 | center(array: ArrayLike<T>, x: U, lo?: number, hi?: number): number;
|
411 | }
|
412 |
|
413 | export function bisector<T, U>(comparator: (a: T, b: U) => number): Bisector<T, U>;
|
414 |
|
415 | export function bisector<T, U>(accessor: (x: T) => U): Bisector<T, U>;
|
416 |
|
417 |
|
418 |
|
419 |
|
420 |
|
421 |
|
422 |
|
423 |
|
424 |
|
425 |
|
426 | export function quickselect<T>(array: ArrayLike<T>, k: number, left?: number, right?: number, compare?: (a: Primitive | undefined, b: Primitive | undefined) => number): T[];
|
427 |
|
428 |
|
429 |
|
430 |
|
431 |
|
432 | export function ascending(a: Primitive | undefined, b: Primitive | undefined): number;
|
433 |
|
434 |
|
435 |
|
436 |
|
437 |
|
438 | export function descending(a: Primitive | undefined, b: Primitive | undefined): number;
|
439 |
|
440 |
|
441 |
|
442 |
|
443 |
|
444 |
|
445 |
|
446 |
|
447 |
|
448 |
|
449 |
|
450 | export function group<TObject, TKey>(iterable: Iterable<TObject>, key: (value: TObject) => TKey): InternMap<TKey, TObject[]>;
|
451 |
|
452 |
|
453 |
|
454 |
|
455 |
|
456 |
|
457 |
|
458 | export function group<TObject, TKey1, TKey2>(
|
459 | iterable: Iterable<TObject>,
|
460 | key1: (value: TObject) => TKey1,
|
461 | key2: (value: TObject) => TKey2
|
462 | ): InternMap<TKey1, InternMap<TKey2, TObject[]>>;
|
463 |
|
464 |
|
465 |
|
466 |
|
467 |
|
468 |
|
469 |
|
470 |
|
471 | export function group<TObject, TKey1, TKey2, TKey3>(
|
472 | iterable: Iterable<TObject>,
|
473 | key1: (value: TObject) => TKey1,
|
474 | key2: (value: TObject) => TKey2,
|
475 | key3: (value: TObject) => TKey3
|
476 | ): InternMap<TKey1, InternMap<TKey2, InternMap<TKey3, TObject[]>>>;
|
477 |
|
478 |
|
479 |
|
480 |
|
481 |
|
482 |
|
483 |
|
484 | export function groups<TObject, TKey>(
|
485 | iterable: Iterable<TObject>,
|
486 | key: (value: TObject) => TKey
|
487 | ): Array<[TKey, TObject[]]>;
|
488 |
|
489 |
|
490 |
|
491 |
|
492 |
|
493 |
|
494 |
|
495 | export function groups<TObject, TKey1, TKey2>(
|
496 | iterable: Iterable<TObject>,
|
497 | key1: (value: TObject) => TKey1,
|
498 | key2: (value: TObject) => TKey2
|
499 | ): Array<[TKey1, Array<[TKey2, TObject[]]>]>;
|
500 |
|
501 |
|
502 |
|
503 |
|
504 |
|
505 |
|
506 |
|
507 |
|
508 | export function groups<TObject, TKey1, TKey2, TKey3>(
|
509 | iterable: Iterable<TObject>,
|
510 | key1: (value: TObject) => TKey1,
|
511 | key2: (value: TObject) => TKey2,
|
512 | key3: (value: TObject) => TKey3
|
513 | ): Array<[TKey1, Array<[TKey2, Array<[TKey3, TObject[]]>]>]>;
|
514 |
|
515 |
|
516 |
|
517 |
|
518 |
|
519 |
|
520 |
|
521 | export function flatGroup<TObject, TKey>(
|
522 | iterable: Iterable<TObject>,
|
523 | key: (value: TObject) => TKey
|
524 | ): Array<[TKey, TObject[]]>;
|
525 |
|
526 |
|
527 |
|
528 |
|
529 |
|
530 |
|
531 |
|
532 | export function flatGroup<TObject, TKey1, TKey2>(
|
533 | iterable: Iterable<TObject>,
|
534 | key1: (value: TObject) => TKey1,
|
535 | key2: (value: TObject) => TKey2
|
536 | ): Array<[TKey1, TKey2, TObject[]]>;
|
537 |
|
538 |
|
539 |
|
540 |
|
541 |
|
542 |
|
543 |
|
544 |
|
545 | export function flatGroup<TObject, TKey1, TKey2, TKey3>(
|
546 | iterable: Iterable<TObject>,
|
547 | key1: (value: TObject) => TKey1,
|
548 | key2: (value: TObject) => TKey2,
|
549 | key3: (value: TObject) => TKey3
|
550 | ): Array<[TKey1, TKey2, TKey3, TObject[]]>;
|
551 |
|
552 |
|
553 |
|
554 |
|
555 |
|
556 |
|
557 |
|
558 | export function index<TObject, TKey>(iterable: Iterable<TObject>, key: (value: TObject) => TKey): InternMap<TKey, TObject>;
|
559 |
|
560 |
|
561 |
|
562 |
|
563 |
|
564 |
|
565 |
|
566 | export function index<TObject, TKey1, TKey2>(
|
567 | iterable: Iterable<TObject>,
|
568 | key1: (value: TObject) => TKey1,
|
569 | key2: (value: TObject) => TKey2
|
570 | ): InternMap<TKey1, InternMap<TKey2, TObject>>;
|
571 |
|
572 |
|
573 |
|
574 |
|
575 |
|
576 |
|
577 |
|
578 |
|
579 | export function index<TObject, TKey1, TKey2, TKey3>(
|
580 | iterable: Iterable<TObject>,
|
581 | key1: (value: TObject) => TKey1,
|
582 | key2: (value: TObject) => TKey2,
|
583 | key3: (value: TObject) => TKey3
|
584 | ): InternMap<TKey1, InternMap<TKey2, InternMap<TKey3, TObject>>>;
|
585 |
|
586 |
|
587 |
|
588 |
|
589 |
|
590 |
|
591 |
|
592 | export function indexes<TObject, TKey>(
|
593 | iterable: Iterable<TObject>,
|
594 | key: (value: TObject) => TKey
|
595 | ): Array<[TKey, TObject]>;
|
596 |
|
597 |
|
598 |
|
599 |
|
600 |
|
601 |
|
602 |
|
603 | export function indexes<TObject, TKey1, TKey2>(
|
604 | iterable: Iterable<TObject>,
|
605 | key1: (value: TObject) => TKey1,
|
606 | key2: (value: TObject) => TKey2
|
607 | ): Array<[TKey1, Array<[TKey2, TObject]>]>;
|
608 |
|
609 |
|
610 |
|
611 |
|
612 |
|
613 |
|
614 |
|
615 |
|
616 | export function indexes<TObject, TKey1, TKey2, TKey3>(
|
617 | iterable: Iterable<TObject>,
|
618 | key1: (value: TObject) => TKey1,
|
619 | key2: (value: TObject) => TKey2,
|
620 | key3: (value: TObject) => TKey3
|
621 | ): Array<[TKey1, Array<[TKey2, Array<[TKey3, TObject]>]>]>;
|
622 |
|
623 |
|
624 |
|
625 |
|
626 |
|
627 |
|
628 |
|
629 |
|
630 | export function rollup<TObject, TReduce, TKey>(
|
631 | iterable: Iterable<TObject>,
|
632 | reduce: (value: TObject[]) => TReduce,
|
633 | key: (value: TObject) => TKey
|
634 | ): InternMap<TKey, TReduce>;
|
635 |
|
636 |
|
637 |
|
638 |
|
639 |
|
640 |
|
641 |
|
642 |
|
643 | export function rollup<TObject, TReduce, TKey1, TKey2>(
|
644 | iterable: Iterable<TObject>,
|
645 | reduce: (value: TObject[]) => TReduce,
|
646 | key1: (value: TObject) => TKey1,
|
647 | key2: (value: TObject) => TKey2
|
648 | ): InternMap<TKey1, InternMap<TKey2, TReduce>>;
|
649 |
|
650 |
|
651 |
|
652 |
|
653 |
|
654 |
|
655 |
|
656 |
|
657 |
|
658 | export function rollup<TObject, TReduce, TKey1, TKey2, TKey3>(
|
659 | iterable: Iterable<TObject>,
|
660 | reduce: (value: TObject[]) => TReduce,
|
661 | key1: (value: TObject) => TKey1,
|
662 | key2: (value: TObject) => TKey2,
|
663 | key3: (value: TObject) => TKey3
|
664 | ): InternMap<TKey1, InternMap<TKey2, InternMap<TKey3, TReduce>>>;
|
665 |
|
666 |
|
667 |
|
668 |
|
669 |
|
670 |
|
671 |
|
672 |
|
673 | export function rollups<TObject, TReduce, TKey>(
|
674 | iterable: Iterable<TObject>,
|
675 | reduce: (value: TObject[]) => TReduce,
|
676 | key: (value: TObject) => TKey
|
677 | ): Array<[TKey, TReduce]>;
|
678 |
|
679 |
|
680 |
|
681 |
|
682 |
|
683 |
|
684 |
|
685 |
|
686 | export function rollups<TObject, TReduce, TKey1, TKey2>(
|
687 | iterable: Iterable<TObject>,
|
688 | reduce: (value: TObject[]) => TReduce,
|
689 | key1: (value: TObject) => TKey1,
|
690 | key2: (value: TObject) => TKey2
|
691 | ): Array<[TKey1, Array<[TKey2, TReduce]>]>;
|
692 |
|
693 |
|
694 |
|
695 |
|
696 |
|
697 |
|
698 |
|
699 |
|
700 |
|
701 | export function rollups<TObject, TReduce, TKey1, TKey2, TKey3>(
|
702 | iterable: Iterable<TObject>,
|
703 | reduce: (value: TObject[]) => TReduce,
|
704 | key1: (value: TObject) => TKey1,
|
705 | key2: (value: TObject) => TKey2,
|
706 | key3: (value: TObject) => TKey3
|
707 | ): Array<[TKey1, Array<[TKey2, Array<[TKey3, TReduce]>]>]>;
|
708 |
|
709 |
|
710 |
|
711 |
|
712 |
|
713 |
|
714 |
|
715 |
|
716 | export function flatRollup<TObject, TReduce, TKey>(
|
717 | iterable: Iterable<TObject>,
|
718 | reduce: (value: TObject[]) => TReduce,
|
719 | key: (value: TObject) => TKey
|
720 | ): Array<[TKey, TReduce]>;
|
721 |
|
722 |
|
723 |
|
724 |
|
725 |
|
726 |
|
727 |
|
728 |
|
729 | export function flatRollup<TObject, TReduce, TKey1, TKey2>(
|
730 | iterable: Iterable<TObject>,
|
731 | reduce: (value: TObject[]) => TReduce,
|
732 | key1: (value: TObject) => TKey1,
|
733 | key2: (value: TObject) => TKey2
|
734 | ): Array<[TKey1, TKey2, TReduce]>;
|
735 |
|
736 |
|
737 |
|
738 |
|
739 |
|
740 |
|
741 |
|
742 |
|
743 |
|
744 | export function flatRollup<TObject, TReduce, TKey1, TKey2, TKey3>(
|
745 | iterable: Iterable<TObject>,
|
746 | reduce: (value: TObject[]) => TReduce,
|
747 | key1: (value: TObject) => TKey1,
|
748 | key2: (value: TObject) => TKey2,
|
749 | key3: (value: TObject) => TKey3
|
750 | ): Array<[TKey1, TKey2, TKey3, TReduce]>;
|
751 |
|
752 |
|
753 |
|
754 |
|
755 |
|
756 | export function groupSort<TObject, TKey>(
|
757 | iterable: Iterable<TObject>,
|
758 | comparator: (a: TObject[], b: TObject[]) => number,
|
759 | key: (value: TObject) => TKey
|
760 | ): TKey[];
|
761 |
|
762 |
|
763 |
|
764 | export function groupSort<TObject, TKey>(
|
765 | iterable: Iterable<TObject>,
|
766 |
|
767 | accessor: (value: TObject[]) => unknown,
|
768 | key: (value: TObject) => TKey
|
769 | ): TKey[];
|
770 |
|
771 |
|
772 |
|
773 |
|
774 |
|
775 |
|
776 | export function count(iterable: Iterable<unknown>): number;
|
777 |
|
778 |
|
779 |
|
780 |
|
781 |
|
782 |
|
783 | export function count<TObject>(
|
784 | iterable: Iterable<TObject>,
|
785 | accessor: (a: TObject, b: TObject) => number | null | undefined
|
786 | ): number;
|
787 |
|
788 |
|
789 |
|
790 |
|
791 |
|
792 |
|
793 |
|
794 |
|
795 |
|
796 | export function cross<S, T>(a: Iterable<S>, b: Iterable<T>): Array<[S, T]>;
|
797 |
|
798 |
|
799 |
|
800 |
|
801 |
|
802 |
|
803 |
|
804 |
|
805 |
|
806 |
|
807 | export function cross<S, T, U>(a: Iterable<S>, b: Iterable<T>, reducer: (a: S, b: T) => U): U[];
|
808 |
|
809 |
|
810 |
|
811 |
|
812 | export function merge<T>(iterables: Iterable<Iterable<T>>): T[];
|
813 |
|
814 |
|
815 |
|
816 |
|
817 |
|
818 |
|
819 |
|
820 | export function pairs<T>(iterable: Iterable<T>): Array<[T, T]>;
|
821 |
|
822 |
|
823 |
|
824 |
|
825 |
|
826 |
|
827 |
|
828 |
|
829 | export function pairs<T, U>(iterable: Iterable<T>, reducer: (a: T, b: T) => U): U[];
|
830 |
|
831 |
|
832 |
|
833 |
|
834 |
|
835 |
|
836 |
|
837 |
|
838 | export function permute<T>(source: { [key: number]: T; }, keys: Iterable<number>): T[];
|
839 |
|
840 |
|
841 |
|
842 |
|
843 |
|
844 | export function permute<T, K extends keyof T>(source: T, keys: Iterable<K>): Array<T[K]>;
|
845 |
|
846 |
|
847 |
|
848 |
|
849 | export function shuffle<T>(array: T[], lo?: number, hi?: number): T[];
|
850 | export function shuffle(array: Int8Array, lo?: number, hi?: number): Int8Array;
|
851 | export function shuffle(array: Uint8Array, lo?: number, hi?: number): Uint8Array;
|
852 | export function shuffle(array: Uint8ClampedArray, lo?: number, hi?: number): Uint8ClampedArray;
|
853 | export function shuffle(array: Int16Array, lo?: number, hi?: number): Int16Array;
|
854 | export function shuffle(array: Uint16Array, lo?: number, hi?: number): Uint16Array;
|
855 | export function shuffle(array: Int32Array, lo?: number, hi?: number): Int32Array;
|
856 | export function shuffle(array: Uint32Array, lo?: number, hi?: number): Uint32Array;
|
857 | export function shuffle(array: Float32Array, lo?: number, hi?: number): Float32Array;
|
858 | export function shuffle(array: Float64Array, lo?: number, hi?: number): Float64Array;
|
859 |
|
860 |
|
861 |
|
862 |
|
863 | export function shuffler(random: () => number): typeof shuffle;
|
864 |
|
865 |
|
866 |
|
867 |
|
868 |
|
869 |
|
870 |
|
871 |
|
872 |
|
873 |
|
874 |
|
875 |
|
876 | export function ticks(start: number, stop: number, count: number): number[];
|
877 |
|
878 |
|
879 |
|
880 |
|
881 |
|
882 |
|
883 |
|
884 |
|
885 |
|
886 |
|
887 |
|
888 |
|
889 |
|
890 |
|
891 |
|
892 | export function tickIncrement(start: number, stop: number, count: number): number;
|
893 |
|
894 |
|
895 |
|
896 |
|
897 |
|
898 |
|
899 |
|
900 |
|
901 |
|
902 |
|
903 |
|
904 |
|
905 | export function tickStep(start: number, stop: number, count: number): number;
|
906 |
|
907 |
|
908 |
|
909 |
|
910 |
|
911 |
|
912 |
|
913 |
|
914 |
|
915 | export function nice(start: number, stop: number, count: number): [number, number];
|
916 |
|
917 |
|
918 |
|
919 |
|
920 | export function range(stop: number): number[];
|
921 |
|
922 |
|
923 |
|
924 |
|
925 | export function range(start: number, stop: number, step?: number): number[];
|
926 |
|
927 |
|
928 |
|
929 |
|
930 | export function transpose<T>(matrix: ArrayLike<ArrayLike<T>>): T[][];
|
931 |
|
932 |
|
933 |
|
934 |
|
935 |
|
936 |
|
937 | export function zip<T>(...arrays: Array<ArrayLike<T>>): T[][];
|
938 |
|
939 |
|
940 |
|
941 |
|
942 |
|
943 |
|
944 |
|
945 |
|
946 |
|
947 |
|
948 | export function every<T>(
|
949 | iterable: Iterable<T>,
|
950 | test: (value: T, index: number, iterable: Iterable<T>) => unknown
|
951 | ): boolean;
|
952 |
|
953 |
|
954 |
|
955 |
|
956 |
|
957 |
|
958 | export function some<T>(
|
959 | iterable: Iterable<T>,
|
960 | test: (value: T, index: number, iterable: Iterable<T>) => unknown
|
961 | ): boolean;
|
962 |
|
963 |
|
964 |
|
965 |
|
966 |
|
967 | export function filter<T>(
|
968 | iterable: Iterable<T>,
|
969 | test: (value: T, index: number, iterable: Iterable<T>) => unknown
|
970 | ): T[];
|
971 |
|
972 |
|
973 |
|
974 |
|
975 |
|
976 | export function map<T, U>(iterable: Iterable<T>, mapper: (value: T, index: number, iterable: Iterable<T>) => U): U[];
|
977 |
|
978 |
|
979 |
|
980 |
|
981 |
|
982 | export function reduce<T>(
|
983 | iterable: Iterable<T>,
|
984 | reducer: (previousValue: T, currentValue: T, currentIndex: number, iterable: Iterable<T>) => T,
|
985 | initialValue?: T
|
986 | ): T;
|
987 |
|
988 |
|
989 |
|
990 |
|
991 | export function reduce<T, U>(
|
992 | iterable: Iterable<T>,
|
993 | reducer: (previousValue: U, currentValue: T, currentIndex: number, iterable: Iterable<T>) => U,
|
994 | initialValue: U
|
995 | ): U;
|
996 |
|
997 |
|
998 |
|
999 |
|
1000 |
|
1001 | export function reverse<T>(iterable: Iterable<T>): T[];
|
1002 |
|
1003 |
|
1004 |
|
1005 |
|
1006 |
|
1007 |
|
1008 | export function sort<T>(iterable: Iterable<T>, comparator?: (a: T, b: T) => number): T[];
|
1009 |
|
1010 |
|
1011 |
|
1012 |
|
1013 |
|
1014 |
|
1015 | export function sort<T>(iterable: Iterable<T>, ...accessors: Array<(a: T) => unknown>): T[];
|
1016 |
|
1017 |
|
1018 |
|
1019 |
|
1020 |
|
1021 |
|
1022 |
|
1023 |
|
1024 | export function difference<T>(iterable: Iterable<T>, ...others: Array<Iterable<T>>): InternSet<T>;
|
1025 |
|
1026 |
|
1027 |
|
1028 |
|
1029 |
|
1030 | export function union<T>(...iterables: Array<Iterable<T>>): InternSet<T>;
|
1031 |
|
1032 |
|
1033 |
|
1034 |
|
1035 |
|
1036 | export function intersection<T>(...iterables: Array<Iterable<T>>): InternSet<T>;
|
1037 |
|
1038 |
|
1039 |
|
1040 |
|
1041 | export function superset<T>(a: Iterable<T>, b: Iterable<T>): boolean;
|
1042 |
|
1043 |
|
1044 |
|
1045 |
|
1046 | export function subset<T>(a: Iterable<T>, b: Iterable<T>): boolean;
|
1047 |
|
1048 |
|
1049 |
|
1050 |
|
1051 | export function disjoint<T>(a: Iterable<T>, b: Iterable<T>): boolean;
|
1052 |
|
1053 |
|
1054 |
|
1055 |
|
1056 |
|
1057 | export interface Bin<Datum, Value extends number | Date | undefined> extends Array<Datum> {
|
1058 | x0: Value | undefined;
|
1059 | x1: Value | undefined;
|
1060 | }
|
1061 |
|
1062 |
|
1063 |
|
1064 |
|
1065 | export type ThresholdCountGenerator<Value extends number | undefined = number | undefined> =
|
1066 | (values: ArrayLike<Value>, min: number, max: number) => number;
|
1067 |
|
1068 |
|
1069 |
|
1070 |
|
1071 | export type ThresholdNumberArrayGenerator<Value extends number | undefined> =
|
1072 | (values: ArrayLike<Value>, min: number, max: number) => Value[];
|
1073 |
|
1074 |
|
1075 |
|
1076 |
|
1077 | export type ThresholdDateArrayGenerator<Value extends Date | undefined> =
|
1078 | (values: ArrayLike<Value>, min: Date, max: Date) => Value[];
|
1079 |
|
1080 | export interface HistogramCommon<Datum, Value extends number | Date | undefined> {
|
1081 | (data: ArrayLike<Datum>): Array<Bin<Datum, Value>>;
|
1082 |
|
1083 | value(): (d: Datum, i: number, data: ArrayLike<Datum>) => Value;
|
1084 | value(valueAccessor: (d: Datum, i: number, data: ArrayLike<Datum>) => Value): this;
|
1085 | }
|
1086 |
|
1087 | export interface HistogramGeneratorDate<Datum, Value extends Date | undefined> extends HistogramCommon<Datum, Date> {
|
1088 | domain(): (values: ArrayLike<Value>) => [Date, Date];
|
1089 | domain(domain: [Date, Date] | ((values: ArrayLike<Value>) => [Date, Date])): this;
|
1090 |
|
1091 | thresholds(): ThresholdDateArrayGenerator<Value>;
|
1092 | /**
|
1093 | * Set the array of values to be used as thresholds in determining the bins.
|
1094 | *
|
1095 | * Any threshold values outside the domain are ignored. The first bin.x0 is always equal to the minimum domain value,
|
1096 | * and the last bin.x1 is always equal to the maximum domain value.
|
1097 | *
|
1098 | * @param thresholds Either an array of threshold values used for binning. The elements must
|
1099 | * be of the same type as the materialized values of the histogram.
|
1100 | * Or a function which accepts as arguments the array of materialized values, and
|
1101 | * optionally the domain minimum and maximum. The function calculates and returns the array of values to be used as
|
1102 | * thresholds in determining the bins.
|
1103 | */
|
1104 | thresholds(thresholds: ArrayLike<Value> | ThresholdDateArrayGenerator<Value>): this;
|
1105 | }
|
1106 |
|
1107 | export interface HistogramGeneratorNumber<Datum, Value extends number | undefined> extends HistogramCommon<Datum, Value> {
|
1108 | domain(): (values: Iterable<Value>) => [number, number] | [undefined, undefined];
|
1109 | domain(domain: [number, number] | ((values: Iterable<Value>) => [number, number] | [undefined, undefined])): this;
|
1110 |
|
1111 | thresholds(): ThresholdCountGenerator<Value> | ThresholdNumberArrayGenerator<Value>;
|
1112 | /**
|
1113 | * Divide the domain uniformly into approximately count bins. IMPORTANT: This threshold
|
1114 | * setting approach only works, when the materialized values are numbers!
|
1115 | *
|
1116 | * Any threshold values outside the domain are ignored. The first bin.x0 is always equal to the minimum domain value,
|
1117 | * and the last bin.x1 is always equal to the maximum domain value.
|
1118 | *
|
1119 | * @param count Either the desired number of uniform bins or a function which accepts as arguments the array of
|
1120 | * materialized values, and optionally the domain minimum and maximum. The function calculates and returns the
|
1121 | * suggested number of bins.
|
1122 | */
|
1123 | thresholds(count: number | ThresholdCountGenerator<Value>): this;
|
1124 | /**
|
1125 | * Set the array of values to be used as thresholds in determining the bins.
|
1126 | *
|
1127 | * Any threshold values outside the domain are ignored. The first bin.x0 is always equal to the minimum domain value,
|
1128 | * and the last bin.x1 is always equal to the maximum domain value.
|
1129 | *
|
1130 | * @param thresholds Either an array of threshold values used for binning. The elements must
|
1131 | * be of the same type as the materialized values of the histogram.
|
1132 | * Or a function which accepts as arguments the array of materialized values, and
|
1133 | * optionally the domain minimum and maximum. The function calculates and returns the array of values to be used as
|
1134 | * thresholds in determining the bins.
|
1135 | */
|
1136 | // tslint:disable-next-line:unified-signatures
|
1137 | thresholds(thresholds: ArrayLike<Value> | ThresholdNumberArrayGenerator<Value>): this;
|
1138 | }
|
1139 |
|
1140 | /**
|
1141 | * @deprecated. Use bin instead.
|
1142 | */
|
1143 | export function histogram(): HistogramGeneratorNumber<number, number>;
|
1144 |
|
1145 | /**
|
1146 | * @deprecated Use bin instead.
|
1147 | */
|
1148 | // tslint:disable-next-line:no-unnecessary-generics
|
1149 | export function histogram<Datum, Value extends number | undefined>(): HistogramGeneratorNumber<Datum, Value>;
|
1150 |
|
1151 | /**
|
1152 | * @deprecated Use bin instead.
|
1153 | */
|
1154 | // tslint:disable-next-line:no-unnecessary-generics
|
1155 | export function histogram<Datum, Value extends Date | undefined>(): HistogramGeneratorDate<Datum, Value>;
|
1156 |
|
1157 | export function bin(): HistogramGeneratorNumber<number, number>;
|
1158 | // tslint:disable-next-line:no-unnecessary-generics
|
1159 | export function bin<Datum, Value extends number | undefined>(): HistogramGeneratorNumber<Datum, Value>;
|
1160 | // tslint:disable-next-line:no-unnecessary-generics
|
1161 | export function bin<Datum, Value extends Date | undefined>(): HistogramGeneratorDate<Datum, Value>;
|
1162 |
|
1163 | // --------------------------------------------------------------------------------------
|
1164 | // Histogram Thresholds
|
1165 | // --------------------------------------------------------------------------------------
|
1166 |
|
1167 | export function thresholdFreedmanDiaconis(values: ArrayLike<number | undefined>, min: number, max: number): number; // of type ThresholdCountGenerator
|
1168 |
|
1169 | export function thresholdScott(values: ArrayLike<number | undefined>, min: number, max: number): number; // of type ThresholdCountGenerator
|
1170 |
|
1171 | export function thresholdSturges(values: ArrayLike<number | undefined>): number; // of type ThresholdCountGenerator
|
1172 |
|
1173 | // --------------------------------------------------------------------------------------
|
1174 | // Interning
|
1175 | // --------------------------------------------------------------------------------------
|
1176 |
|
1177 | /**
|
1178 | * The InternMap class extends the native JavaScript Map class, allowing Dates and other non-primitive keys by bypassing the SameValueZero algorithm when determining key equality.
|
1179 | */
|
1180 | export class InternMap<K = any, V = any> extends Map<K, V> {
|
1181 | }
|
1182 |
|
1183 | /**
|
1184 | * The InternSet class extends the native JavaScript Set class, allowing Dates and other non-primitive keys by bypassing the SameValueZero algorithm when determining key equality.
|
1185 | */
|
1186 | export class InternSet<T = any> extends Set<T> {
|
1187 | }
|
1188 |
|
\ | No newline at end of file |