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

Added tests for Disposable, Enumerator, Dictionary, Lookup

Browse Source 
- added tests for all functions defined in l2o.d.ts in Disposable,
Enumerator, Dictionary, Lookup
- removed workaround definitions for spec#3.5.2 (it produced more
problems)
- fixed Lookup.toEnumerable
This commit is contained in:
Igor Oleinikov
2013-10-26 17:10:50 +04:00
parent 2b99487a28
commit 68427a3c83
2 changed files with 68 additions and 26 deletions
Download Patch File Download Diff File Expand all files Collapse all files
ix.js/l2o-tests.ts
+67 -6
View File
@@ -96,14 +96,14 @@ ax.singleOrDefault();
ax.forEach(a => console.log(a));
ax.forEach(a => console.log(a), cx);
bx.groupBy<number, string>(b => b.length);
//bx.groupBy(b => b.length); // spec 3.5.2, waiting for restriction on generative recursion removal
bx.groupBy(b => b.length, b => "[" + b + "]");
bx.groupBy(b => b.length, b => "[" + b + "]", (l, values) => l + values.count());
bx.groupBy(b => b.length, false, (l, values) => l + values.count());
bx.groupBy(b => b.length, b => "[" + b + "]", (l, values) => l + values.count(), ec_nn);
bx.groupBy(b => b.length, b => "[" + b + "]", false, (x, y) => x == y);
bx.groupBy(b => b.length, false, (l, values) => l + values.count(), ec_nn);
bx.groupBy<number, number>(b => b.length, false, false, ec_nn);
//bx.groupBy(b => b.length, false, false, ec_nn); // spec 3.5.2, waiting for restriction on generative recursion removal
ax.groupJoin(bx, a => a, b => b, (a, b) => [a, b], ec_ns);
ax.groupJoin(bx, a => a, b => b.length, (a, b) => [a, b]);
@@ -142,14 +142,14 @@ ax.takeWhile(a => a > 10);
ax.toArray();
bx.toDictionary(b => b.length, b => 10, ec_nn);
bx.toDictionary<number, string>(b => b.length, false, ec_nn);
//bx.toDictionary(b => b.length, false, ec_nn); // spec 3.5.2, waiting for restriction on generative recursion removal
bx.toDictionary(b => b.length, b => 10);
bx.toDictionary<number, string>(b => b.length);
//bx.toDictionary(b => b.length); // spec 3.5.2, waiting for restriction on generative recursion removal
bx.toLookup(b => b.length, b => 10, ec_nn);
bx.toLookup<number, string>(b => b.length, false, ec_nn);
//bx.toLookup(b => b.length, false, ec_nn); // spec 3.5.2, waiting for restriction on generative recursion removal
bx.toLookup(b => b.length, b => 10);
bx.toLookup<number, string>(b => b.length);
//bx.toLookup(b => b.length); // spec 3.5.2, waiting for restriction on generative recursion removal
ax.where(a=> a > 10, {});
ax.where(a=> a > 10);
@@ -158,3 +158,64 @@ ax.filter(a=> a > 10);
ax.zip(bx, (a: number, b: string) => [a, b]);
ax.zip(bx, (a, b) => [a, b]);
// Disposable
{
var d: Ix.Disposable;
d.dispose();
}
// Enumerator
{
var e: Ix.Enumerator<number>;
try {
while (e.moveNext()) { var c = e.getCurrent(); }
}
finally {
e.dispose();
}
}
// Dictionary
{
var dic = new Ix.Dictionary<number, string>(0, ec_nn);
var key = dic.toEnumerable().first().key;
var value = dic.toEnumerable().first().value;
dic.add(1, "1");
dic.remove(1);
dic.clear();
dic.length();
dic.tryGetValue(1);
dic.get(1);
dic.set(1, "1");
dic.getValues();
dic.has(1);
}
// KeyValuePair
{
var kv: Ix.KeyValuePair<number, string>;
var key = kv.key;
var value = kv.value;
}
// Lookup
{
var lookup: Ix.Lookup<number, string>;
var key = lookup.toEnumerable().first().key;
lookup.toEnumerable().first().first();
lookup.has(1);
lookup.length();
lookup.get(1).first();
}
ix.js/l2o.d.ts
Vendored
+1 -20
View File
@@ -94,8 +94,6 @@ declare module Ix {
// spec 3.5.2, waiting for restriction on generative recursion removal
/*groupBy<TKey>(
keySelector: (item: T) => TKey): Grouping<TKey, T>;*/
groupBy<TKey, _T extends T>(
keySelector: (item: T) => TKey): Grouping<TKey, _T>;
// if need to set comparer without resultSelector
groupBy<TKey, TElement>(
@@ -116,11 +114,6 @@ declare module Ix {
_: boolean,
__: boolean,
comparer: EqualityComparer<TKey, TKey>): Grouping<TKey, T>;*/
groupBy<TKey, _T extends T>(
keySelector: (item: T) => TKey,
_: boolean,
__: boolean,
comparer: EqualityComparer<TKey, TKey>): Grouping<TKey, _T>;
groupJoin<TInner, TOuterKey, TInnerKey, TResult>(
inner: Enumerable<TInner>,
@@ -179,18 +172,12 @@ declare module Ix {
// spec 3.5.2, waiting for restriction on generative recursion removal
/*toDictionary<TKey>(
keySelector: (item: T) => TKey): Dictionary<TKey, T>;*/
toDictionary<TKey, _T extends T>(
keySelector: (item: T) => TKey): Dictionary<TKey, _T>;
// if need to set comparer without elementSelector
// spec 3.5.2, waiting for restriction on generative recursion removal
/*toDictionary<TKey>(
keySelector: (item: T) => TKey,
_: boolean,
comparer: EqualityComparer<TKey, TKey>): Dictionary<TKey, T>;*/
toDictionary<TKey, _T extends T>(
keySelector: (item: T) => TKey,
_: boolean,
comparer: EqualityComparer<TKey, TKey>): Dictionary<TKey, _T>;
toLookup<TKey, TValue>(
keySelector: (item: T) => TKey,
@@ -199,18 +186,12 @@ declare module Ix {
// spec 3.5.2, waiting for restriction on generative recursion removal
/*toLookup<TKey>(
keySelector: (item: T) => TKey): Lookup<TKey, T>;*/
toLookup<TKey, _T extends T>(
keySelector: (item: T) => TKey): Lookup<TKey, _T>;
// if need to set comparer without elementSelector
// spec 3.5.2, waiting for restriction on generative recursion removal
/*toLookup<TKey>(
keySelector: (item: T) => TKey,
_: boolean,
comparer: EqualityComparer<TKey, TKey>): Lookup<TKey, T>;*/
toLookup<TKey, _T extends T>(
keySelector: (item: T) => TKey,
_: boolean,
comparer: EqualityComparer<TKey, TKey>): Lookup<TKey, _T>;
where(selector: EnumerablePredicate<T>, thisArg?: any): Enumerable<T>;
filter(selector: EnumerablePredicate<T>, thisArg?: any): Enumerable<T>;
@@ -249,7 +230,7 @@ declare module Ix {
}
export interface Lookup<TKey, TValue> {
toEnumerable(): Enumerable<Grouping<TKey, any>>;
toEnumerable(): Enumerable<Grouping<TKey, TValue>>;
has(key: TKey): boolean;
length(): number;
get(key: TKey): Enumerable<TValue>;