kylefang/DefinitelyTyped
1
0
Fork 0
mirror of https://github.com/zhigang1992/DefinitelyTyped.git synced 2026-04-19 16:49:45 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #1573 from Igorbek/master

Browse Source 
Fix #1545
This commit is contained in:
Igorbek
2014-01-18 12:39:52 -08:00
parent 1c3040699b 12058a9447
commit 6ca13abfe3
1 changed files with 43 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

50
d3/d3.d.ts vendored
View File

@@ -88,42 +88,78 @@ declare module D3 {
* @param arr Array to search
* @param map Accsessor function
*/
min<T, U>(arr: T[], map?: (v: T) => U): U;
min<T, U>(arr: T[], map: (v: T) => U): U;
/**
* Find the minimum value in an array
*
* @param arr Array to search
*/
min<T>(arr: T[]): T;
/**
* Find the maximum value in an array
*
* @param arr Array to search
* @param map Accsessor function
*/
max<T, U>(arr: T[], map?: (v: T) => U): U;
max<T, U>(arr: T[], map: (v: T) => U): U;
/**
* Find the maximum value in an array
*
* @param arr Array to search
*/
max<T>(arr: T[]): T;
/**
* Find the minimum and maximum value in an array
*
* @param arr Array to search
* @param map Accsessor function
*/
extent<T, U>(arr: T[], map?: (v: T) => U): U[];
extent<T, U>(arr: T[], map: (v: T) => U): U[];
/**
* Find the minimum and maximum value in an array
*
* @param arr Array to search
*/
extent<T>(arr: T[]): T[];
/**
* Compute the sum of an array of numbers
*
* @param arr Array to search
* @param map Accsessor function
*/
sum<T>(arr: T[], map?: (v: T) => number): number;
sum<T>(arr: T[], map: (v: T) => number): number;
/**
* Compute the sum of an array of numbers
*
* @param arr Array to search
*/
sum(arr: number[]): number;
/**
* Compute the arithmetic mean of an array of numbers
*
* @param arr Array to search
* @param map Accsessor function
*/
mean<T>(arr: T[], map?: (v: T) => number): number;
mean<T>(arr: T[], map: (v: T) => number): number;
/**
* Compute the arithmetic mean of an array of numbers
*
* @param arr Array to search
*/
mean(arr: number[]): number;
/**
* Compute the median of an array of numbers (the 0.5-quantile).
*
* @param arr Array to search
* @param map Accsessor function
*/
median<T>(arr: T[], map?: (v: T) => number): number;
median<T>(arr: T[], map: (v: T) => number): number;
/**
* Compute the median of an array of numbers (the 0.5-quantile).
*
* @param arr Array to search
*/
median(arr: number[]): number;
/**
* Compute a quantile for a sorted array of numbers.
*
@@ -135,7 +171,7 @@ declare module D3 {
* Locate the insertion point for x in array to maintain sorted order
*
* @param arr Array to search
* @param x Value to serch for insertion point
* @param x Value to search for insertion point
* @param low Minimum value of array subset
* @param hihg Maximum value of array subset
*/