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