wassname/DefinitelyTyped
1
0
Fork 0
mirror of https://github.com/wassname/DefinitelyTyped.git synced 2026-09-09 11:13:57 +08:00
Code Issues Packages Projects Releases Wiki Activity

Correction on return types for find, head and last

Browse Source
This commit is contained in:
Haskell Camargo
2015-06-14 23:31:32 -03:00
parent f9c3edf6c6
commit 19795463b3
2 changed files with 23 additions and 15 deletions
Download Patch File Download Diff File Expand all files Collapse all files
prelude-ls/prelude-ls-tests.ts
+19 -11
View File
@@ -20,32 +20,40 @@ prelude.replicate(0, "a"); //=> []
// List
var dblStrArray: Array<Array<string>> =
var eachRes: Array<Array<string>> =
prelude.each(x => x.push("boom"), [["a"], ["b"], ["c"]]);
//=> [["a", "boom"], ["b", "boom"], ["c", "boom"]]
prelude.map(x => x * 2, [1, 2, 3, 4, 5]); //=> [2, 4, 6, 8, 10]
var mapRes: Array<string> =
prelude.map(x => x.toString(), [1, 2, 3, 4, 5]) //=> ["1", "2", "3", "4", "5"]
prelude.map(x => x.toUpperCase(), ["ha", "ma"]); //=> ["HA", "MA"]
prelude.map(x => x.num, [{num: 3}, {num: 1}]); //=> [3, 1]
prelude.compact([0, 1, false, true, "", "ha"]) //=> [1, true, "ha"]
var compactRes: Array<any> =
prelude.compact([0, 1, false, true, "", "ha"]) //=> [1, true, "ha"]
prelude.filter(x => x < 3, [1, 2, 3, 4, 5]); //=> [1, 2]
var filterRes: Array<number> =
prelude.filter(x => x < 3, [1, 2, 3, 4, 5]); //=> [1, 2]
prelude.filter(prelude.even, [3, 4, 0]); //=> [4, 0]
prelude.reject(prelude.odd, [1, 2, 3, 4, 5]); //=> [2, 4]
var rejectRes: Array<number> =
prelude.reject(prelude.odd, [1, 2, 3, 4, 5]); //=> [2, 4]
prelude.partition(x => x > 60, [49, 58, 76, 43, 88, 77, 90]); //=> [[76, 88, 77, 90], [49, 58, 43]]
var partitionRes: Array<Array<number>> =
prelude.partition(x => x > 60, [49, 58, 76, 43, 88, 77, 90]);
//=> [[76, 88, 77, 90], [49, 58, 43]]
prelude.find(prelude.odd, [2, 4, 6, 7, 8, 9, 10]); //=> 7
var findRes: number = prelude.find(prelude.odd, [2, 4, 6, 7, 8, 9, 10]); //=> 7
prelude.head([1, 2, 3, 4, 5]); //=> 1
var headRes: number = prelude.head([1, 2, 3, 4, 5]); //=> 1
prelude.tail([1, 2, 3, 4, 5]); //=> [2, 3, 4, 5]
var tailRes: Array<number> = prelude.tail([1, 2, 3, 4, 5]); //=> [2, 3, 4, 5]
prelude.last([1, 2, 3, 4, 5]); //=> 5
var lastRes: number = prelude.last([1, 2, 3, 4, 5]); //=> 5
prelude.initial([1, 2, 3, 4, 5]); //=> [1, 2, 3, 4]
var initialRes: Array<number> =
prelude.initial([1, 2, 3, 4, 5]); //=> [1, 2, 3, 4]
prelude.empty([]); //=> true
prelude-ls/prelude-ls.d.ts
Vendored
+4 -4
View File
@@ -27,11 +27,11 @@ declare module "prelude-ls" {
export function reject<A>(f: (x: A) => boolean, xs: A[]): A[];
export function partition<A>(f: (x: A) => Boolean): (xs: A[]) => [A[], A[]];
export function partition<A>(f: (x: A) => Boolean, xs: A[]): [A[], A[]];
export function find<A>(f: (x: A) => Boolean): (xs: A[]) => (A | void);
export function find<A>(f: (x: A) => Boolean, xs: A[]): (A | void);
export function head<A>(xs: A[]): (A | void);
export function find<A>(f: (x: A) => Boolean): (xs: A[]) => A;
export function find<A>(f: (x: A) => Boolean, xs: A[]): A;
export function head<A>(xs: A[]): A;
export function tail<A>(xs: A[]): A[];
export function last<A>(xs: A[]): (A | void);
export function last<A>(xs: A[]): A;
export function initial<A>(xs: A[]): A[];
export function empty<A>(xs: A[]): boolean;
export function reverse<A>(xs: A[]): A[];