linqx 0.1.8
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/LICENSE +21 -0
- package/README.md +151 -0
- package/dist/index.d.ts +4 -0
- package/dist/index.js +4 -0
- package/dist/linq.d.ts +256 -0
- package/dist/linq.js +3085 -0
- package/dist/linqx.d.ts +36 -0
- package/dist/linqx.js +153 -0
- package/package.json +48 -0
package/LICENSE
ADDED
|
@@ -0,0 +1,21 @@
|
|
|
1
|
+
The MIT License (MIT)
|
|
2
|
+
|
|
3
|
+
Copyright (c) 2012 Yoshifumi Kawai, Mihai Ciuraru
|
|
4
|
+
|
|
5
|
+
Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
6
|
+
of this software and associated documentation files (the "Software"), to deal
|
|
7
|
+
in the Software without restriction, including without limitation the rights
|
|
8
|
+
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
9
|
+
copies of the Software, and to permit persons to whom the Software is
|
|
10
|
+
furnished to do so, subject to the following conditions:
|
|
11
|
+
|
|
12
|
+
The above copyright notice and this permission notice shall be included in
|
|
13
|
+
all copies or substantial portions of the Software.
|
|
14
|
+
|
|
15
|
+
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
16
|
+
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
17
|
+
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
18
|
+
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
19
|
+
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
20
|
+
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
|
21
|
+
THE SOFTWARE.
|
package/README.md
ADDED
|
@@ -0,0 +1,151 @@
|
|
|
1
|
+
# linqx
|
|
2
|
+
|
|
3
|
+
Fork of the original [linq](https://github.com/mihaifm/linq) for JavaScript, updated with modern improvements and API changes.
|
|
4
|
+
|
|
5
|
+
It contains all the original .NET methods plus a few additions.
|
|
6
|
+
|
|
7
|
+
Written in pure JavaScript with no dependencies.
|
|
8
|
+
|
|
9
|
+
## Examples
|
|
10
|
+
|
|
11
|
+
```js
|
|
12
|
+
// C# LINQ - delegate
|
|
13
|
+
Enumerable.Range(1, 10)
|
|
14
|
+
.Where(delegate(int i) { return i % 3 == 0; })
|
|
15
|
+
.Select(delegate(int i) { return i * 10; });
|
|
16
|
+
|
|
17
|
+
// linq.js - anonymous function
|
|
18
|
+
Enumerable.range(1, 10)
|
|
19
|
+
.where(function(i) { return i % 3 == 0; })
|
|
20
|
+
.select(function(i) { return i * 10; });
|
|
21
|
+
```
|
|
22
|
+
|
|
23
|
+
```js
|
|
24
|
+
// C# LINQ - lambda
|
|
25
|
+
Enumerable.Range(1, 10).Where((i) => i % 3 == 0).Select((i) => i * 10);
|
|
26
|
+
|
|
27
|
+
// linq.js - arrow function
|
|
28
|
+
Enumerable.range(1, 10).where((i) => i % 3 == 0).select((i) => i * 10);
|
|
29
|
+
```
|
|
30
|
+
|
|
31
|
+
```js
|
|
32
|
+
// C# LINQ - anonymous type
|
|
33
|
+
array.Select((val, i) => new { Value: val, Index: i }());
|
|
34
|
+
|
|
35
|
+
// linq.js - object literal
|
|
36
|
+
Enumerable.from(array).select((val, i) => ({ value: val, index: i }));
|
|
37
|
+
```
|
|
38
|
+
|
|
39
|
+
See [sample/tutorial.js](https://github.com/mihaifm/linq/blob/master/sample/tutorial.js) and the [test](https://github.com/mihaifm/linq/tree/master/test) folder for more examples.
|
|
40
|
+
|
|
41
|
+
# Usage
|
|
42
|
+
|
|
43
|
+
## Node.js (ES modules)
|
|
44
|
+
|
|
45
|
+
Install the latest version of the library with npm:
|
|
46
|
+
|
|
47
|
+
npm install linq
|
|
48
|
+
|
|
49
|
+
Load it in your code with the `import` syntax:
|
|
50
|
+
|
|
51
|
+
```js
|
|
52
|
+
import Enumerable from 'linq'
|
|
53
|
+
|
|
54
|
+
let result = Enumerable.range(1, 10).where(i => i % 3 == 0).select(i => i * 10)
|
|
55
|
+
console.log(result.toArray()) // [ 30, 60, 90 ]
|
|
56
|
+
```
|
|
57
|
+
|
|
58
|
+
Because the library is an ES module, this code will only work if your project is also configured as an ES module. Add the following line in your `package.json` to make it an ES module:
|
|
59
|
+
|
|
60
|
+
```json
|
|
61
|
+
"type": "module"
|
|
62
|
+
```
|
|
63
|
+
|
|
64
|
+
If you're not planning to use ES modules, check the CommonJS section below.
|
|
65
|
+
|
|
66
|
+
## Node.js (CommonJS modules)
|
|
67
|
+
|
|
68
|
+
Install version 3 of this library:
|
|
69
|
+
|
|
70
|
+
npm install linq@3
|
|
71
|
+
|
|
72
|
+
Load it with the `require` syntax:
|
|
73
|
+
|
|
74
|
+
```js
|
|
75
|
+
const Enumerable = require('linq')
|
|
76
|
+
|
|
77
|
+
let count = Enumerable.range(1, 10).count(i => i < 5)
|
|
78
|
+
console.log(count) // 4
|
|
79
|
+
```
|
|
80
|
+
|
|
81
|
+
The [cjs](https://github.com/mihaifm/linq/tree/cjs) branch contains the source code for the CommonJS version of the library.
|
|
82
|
+
|
|
83
|
+
## TypeScript
|
|
84
|
+
|
|
85
|
+
Install the latest version of the library with npm.
|
|
86
|
+
|
|
87
|
+
Configure your compiler options in `tsconfig.json`
|
|
88
|
+
|
|
89
|
+
```json
|
|
90
|
+
"compilerOptions": {
|
|
91
|
+
"target": "ES2020",
|
|
92
|
+
"moduleResolution": "node"
|
|
93
|
+
}
|
|
94
|
+
```
|
|
95
|
+
|
|
96
|
+
The library comes with a `d.ts` file containing type definitions for all the objects and methods, feel free to use them in your code:
|
|
97
|
+
|
|
98
|
+
```ts
|
|
99
|
+
import Enumerable from 'linq';
|
|
100
|
+
|
|
101
|
+
type tnum = Enumerable.IEnumerable<number>;
|
|
102
|
+
let x: tnum = Enumerable.from([1, 2, 3]);
|
|
103
|
+
```
|
|
104
|
+
|
|
105
|
+
## Deno
|
|
106
|
+
|
|
107
|
+
Import the library from deno.land. Use the `@deno-types` annotation to load type definitions:
|
|
108
|
+
|
|
109
|
+
```ts
|
|
110
|
+
// @deno-types="https://deno.land/x/linq@4.0.0/linq.d.ts"
|
|
111
|
+
import Enumerable from 'https://deno.land/x/linq@4.0.0/linq.js'
|
|
112
|
+
|
|
113
|
+
let radius = Enumerable.toInfinity(1).where(r => r * r * Math.PI > 10000).first()
|
|
114
|
+
```
|
|
115
|
+
|
|
116
|
+
You can also install locally with npm. Use the full file path when importing the library:
|
|
117
|
+
|
|
118
|
+
```ts
|
|
119
|
+
// @deno-types="./node_modules/linq/linq.d.ts"
|
|
120
|
+
import Enumerable from './node_modules/linq/linq.js'
|
|
121
|
+
```
|
|
122
|
+
|
|
123
|
+
## Browser
|
|
124
|
+
|
|
125
|
+
The minified version of the library is available in the [release](https://github.com/mihaifm/linq/releases/latest) archive.
|
|
126
|
+
|
|
127
|
+
Load it via `<script type="module">`:
|
|
128
|
+
|
|
129
|
+
```html
|
|
130
|
+
<script type="module" src="./linq.min.js"></script>
|
|
131
|
+
<script type="module">
|
|
132
|
+
import Enumerable from './linq.min.js'
|
|
133
|
+
Enumerable.from([1, 2, 3]).forEach(x => console.log(x))
|
|
134
|
+
</script>
|
|
135
|
+
```
|
|
136
|
+
|
|
137
|
+
You can also load the library via a CDN:
|
|
138
|
+
|
|
139
|
+
| CDN | URL |
|
|
140
|
+
| ---------: | :----------------------------------------- |
|
|
141
|
+
| unpkg | <https://unpkg.com/linq/> |
|
|
142
|
+
| jsDelivr | <https://jsdelivr.com/package/npm/linq> |
|
|
143
|
+
| packd | <https://bundle.run/linq@latest?name=linq> |
|
|
144
|
+
|
|
145
|
+
# Credits
|
|
146
|
+
|
|
147
|
+
[Yoshifumi Kawai](https://github.com/neuecc) developed the [original version](https://github.com/neuecc/linq.js/) of this library.
|
|
148
|
+
|
|
149
|
+
# License
|
|
150
|
+
|
|
151
|
+
[MIT License](https://github.com/mihaifm/linq/blob/master/LICENSE)
|
package/dist/index.d.ts
ADDED
package/dist/index.js
ADDED
package/dist/linq.d.ts
ADDED
|
@@ -0,0 +1,256 @@
|
|
|
1
|
+
declare namespace Enumerable {
|
|
2
|
+
export let Utils: {
|
|
3
|
+
createLambda(expression: null): (x: unknown) => unknown;
|
|
4
|
+
createLambda(expression: string): ((...params: unknown[]) => unknown);
|
|
5
|
+
createLambda<T>(expression?: T): T;
|
|
6
|
+
createEnumerable<T>(getEnumerator: () => IEnumerator<T>): IEnumerable<T>;
|
|
7
|
+
createEnumerator<T>(initialize: () => void, tryGetNext: () => boolean, dispose: () => void): IEnumerator<T>;
|
|
8
|
+
extendTo(type: unknown): void;
|
|
9
|
+
recallFrom(type: unknown): void;
|
|
10
|
+
hasNativeIteratorSupport(): boolean;
|
|
11
|
+
}
|
|
12
|
+
|
|
13
|
+
export function choice<T>(...params: T[]): IEnumerable<T>;
|
|
14
|
+
export function cycle<T>(...params: T[]): IEnumerable<T>;
|
|
15
|
+
export function empty<T>(): IEnumerable<T>;
|
|
16
|
+
export function from(): IEnumerable<unknown>;
|
|
17
|
+
export function from<T>(obj: IEnumerable<T>): IEnumerable<T>;
|
|
18
|
+
export function from(obj: number): IEnumerable<number>;
|
|
19
|
+
export function from(obj: boolean): IEnumerable<boolean>;
|
|
20
|
+
export function from(obj: string): IEnumerable<string>;
|
|
21
|
+
export function from<T>(obj: T[]): IEnumerable<T>;
|
|
22
|
+
export function from<T>(obj: Iterator<T>): IEnumerable<T>;
|
|
23
|
+
export function from<T>(obj: Iterable<T>): IEnumerable<T>;
|
|
24
|
+
export function from<T>(obj: { length: number;[x: number]: T; }): IEnumerable<T>;
|
|
25
|
+
export function from<K extends PropertyKey, T>(obj: Record<K, T>): IEnumerable<{ key: K; value: T }>;
|
|
26
|
+
export function make<T>(element: T): IEnumerable<T>;
|
|
27
|
+
export function matches<T>(input: string, pattern: RegExp): IEnumerable<T>;
|
|
28
|
+
export function matches<T>(input: string, pattern: string, flags?: string): IEnumerable<T>;
|
|
29
|
+
export function range(start: number, count: number, step?: number): IEnumerable<number>;
|
|
30
|
+
export function rangeDown(start: number, count: number, step?: number): IEnumerable<number>;
|
|
31
|
+
export function rangeTo(start: number, to: number, step?: number): IEnumerable<number>;
|
|
32
|
+
export function repeat<T>(element: T, count?: number): IEnumerable<T>;
|
|
33
|
+
export function repeatWithFinalize<T>(initializer: () => T, finalizer: (element: T) => void): IEnumerable<T>;
|
|
34
|
+
export function generate<T>(func: () => T, count?: number): IEnumerable<T>;
|
|
35
|
+
export function toInfinity(start?: number, step?: number): IEnumerable<number>;
|
|
36
|
+
export function toNegativeInfinity(start?: number, step?: number): IEnumerable<number>;
|
|
37
|
+
export function unfold<T>(seed: T, func: (value: T) => T): IEnumerable<T>;
|
|
38
|
+
export function defer<T>(enumerableFactory: () => IEnumerable<T>): IEnumerable<T>;
|
|
39
|
+
|
|
40
|
+
export interface IEnumerable<T> {
|
|
41
|
+
(getEnumerator: () => IEnumerator<T>): void;
|
|
42
|
+
getEnumerator(): IEnumerator<T>;
|
|
43
|
+
[Symbol.iterator](): Iterator<T>;
|
|
44
|
+
|
|
45
|
+
// Extension Methods
|
|
46
|
+
traverseBreadthFirst(childrenSelector: (element: T) => IEnumerable<T>): IEnumerable<T>;
|
|
47
|
+
traverseBreadthFirst<TResult>(childrenSelector: (element: T) => IEnumerable<T>, resultSelector: (element: T, nestLevel: number) => TResult): IEnumerable<TResult>;
|
|
48
|
+
traverseDepthFirst<TResult>(childrenSelector: (element: T) => IEnumerable<T>, resultSelector?: (element: T, nestLevel: number) => TResult): IEnumerable<TResult>;
|
|
49
|
+
flatten(): IEnumerable<unknown>;
|
|
50
|
+
pairwise<TResult>(selector: (prev: T, current: T) => TResult): IEnumerable<TResult>;
|
|
51
|
+
scan(func: (prev: T, current: T) => T): IEnumerable<T>;
|
|
52
|
+
scan<TAccumulate>(seed: TAccumulate, func: (prev: TAccumulate, current: T) => TAccumulate): IEnumerable<TAccumulate>;
|
|
53
|
+
select<TResult>(selector: (element: T, index: number) => TResult): IEnumerable<TResult>;
|
|
54
|
+
selectMany<TOther>(collectionSelector: (element: T, index: number) => IEnumerable<TOther>): IEnumerable<TOther>;
|
|
55
|
+
selectMany<TCollection, TResult>(collectionSelector: (element: T, index: number) => IEnumerable<TCollection>, resultSelector: (outer: T, inner: TCollection) => TResult): IEnumerable<TResult>;
|
|
56
|
+
selectMany<TOther>(collectionSelector: (element: T, index: number) => TOther[]): IEnumerable<TOther>;
|
|
57
|
+
selectMany<TCollection, TResult>(collectionSelector: (element: T, index: number) => TCollection[], resultSelector: (outer: T, inner: TCollection) => TResult): IEnumerable<TResult>;
|
|
58
|
+
selectMany<TOther>(collectionSelector: (element: T, index: number) => { length: number;[x: number]: TOther; }): IEnumerable<TOther>;
|
|
59
|
+
selectMany<TCollection, TResult>(collectionSelector: (element: T, index: number) => { length: number;[x: number]: TCollection; }, resultSelector: (outer: T, inner: TCollection) => TResult): IEnumerable<TResult>;
|
|
60
|
+
where<TOther extends T>(predicate: (element: T, index: number) => element is TOther): IEnumerable<TOther>;
|
|
61
|
+
where(predicate: (element: T, index: number) => boolean): IEnumerable<T>;
|
|
62
|
+
choose(selector: (element: T, index: number) => T): IEnumerable<T>;
|
|
63
|
+
ofType<TResult>(type: unknown): IEnumerable<TResult>;
|
|
64
|
+
zip<U, TResult>(second: IEnumerable<U>, resultSelector: (first: T, second: U, index: number) => TResult): IEnumerable<TResult>;
|
|
65
|
+
zip<U, TResult>(second: { length: number;[x: number]: U; }, resultSelector: (first: T, second: U, index: number) => TResult): IEnumerable<TResult>;
|
|
66
|
+
zip<U, TResult>(second: U[], resultSelector: (first: T, second: U, index: number) => TResult): IEnumerable<TResult>;
|
|
67
|
+
zip<TResult>(...params: unknown[]): IEnumerable<TResult>; // last one is selector
|
|
68
|
+
merge(...params: (T[] | IEnumerable<T> | { length: number;[x: number]: T; })[]): IEnumerable<T>;
|
|
69
|
+
join<TInner, TKey, TResult>(inner: IEnumerable<TInner>, outerKeySelector: (outer: T) => TKey, innerKeySelector: (inner: TInner) => TKey, resultSelector: (outer: T, inner: TInner) => TResult, compareSelector?: (obj: T) => TKey): IEnumerable<TResult>;
|
|
70
|
+
join<TInner, TKey, TResult>(inner: { length: number;[x: number]: TInner; }, outerKeySelector: (outer: T) => TKey, innerKeySelector: (inner: TInner) => TKey, resultSelector: (outer: T, inner: TInner) => TResult, compareSelector?: (obj: T) => TKey): IEnumerable<TResult>;
|
|
71
|
+
join<TInner, TKey, TResult>(inner: TInner[], outerKeySelector: (outer: T) => TKey, innerKeySelector: (inner: TInner) => TKey, resultSelector: (outer: T, inner: TInner) => TResult, compareSelector?: (obj: T) => TKey): IEnumerable<TResult>;
|
|
72
|
+
leftJoin<TInner, TKey, TResult>(inner: IEnumerable<TInner>, outerKeySelector: (outer: T) => TKey, innerKeySelector: (inner: TInner) => TKey, resultSelector: (outer: T, inner: TInner) => TResult, compareSelector?: (obj: T) => TKey): IEnumerable<TResult>;
|
|
73
|
+
leftJoin<TInner, TKey, TResult>(inner: { length: number;[x: number]: TInner; }, outerKeySelector: (outer: T) => TKey, innerKeySelector: (inner: TInner) => TKey, resultSelector: (outer: T, inner: TInner) => TResult, compareSelector?: (obj: T) => TKey): IEnumerable<TResult>;
|
|
74
|
+
leftJoin<TInner, TKey, TResult>(inner: TInner[], outerKeySelector: (outer: T) => TKey, innerKeySelector: (inner: TInner) => TKey, resultSelector: (outer: T, inner: TInner) => TResult, compareSelector?: (obj: T) => TKey): IEnumerable<TResult>;
|
|
75
|
+
groupJoin<TInner, TKey, TResult>(inner: IEnumerable<TInner>, outerKeySelector: (outer: T) => TKey, innerKeySelector: (inner: TInner) => TKey, resultSelector: (outer: T, inner: IEnumerable<TInner>) => TResult, compareSelector?: (obj: T) => TKey): IEnumerable<TResult>;
|
|
76
|
+
groupJoin<TInner, TKey, TResult>(inner: { length: number;[x: number]: TInner; }, outerKeySelector: (outer: T) => TKey, innerKeySelector: (inner: TInner) => TKey, resultSelector: (outer: T, inner: IEnumerable<TInner>) => TResult, compareSelector?: (obj: T) => TKey): IEnumerable<TResult>;
|
|
77
|
+
groupJoin<TInner, TKey, TResult>(inner: TInner[], outerKeySelector: (outer: T) => TKey, innerKeySelector: (inner: TInner) => TKey, resultSelector: (outer: T, inner: IEnumerable<TInner>) => TResult, compareSelector?: (obj: T) => TKey): IEnumerable<TResult>;
|
|
78
|
+
all(predicate: (element: T) => boolean): boolean;
|
|
79
|
+
any(predicate?: (element: T) => boolean): boolean;
|
|
80
|
+
isEmpty(): boolean;
|
|
81
|
+
concat(...sequences: (T[] | IEnumerable<T> | { length: number;[x: number]: T; })[]): IEnumerable<T>;
|
|
82
|
+
insert(index: number, second: IEnumerable<T>): IEnumerable<T>;
|
|
83
|
+
insert(index: number, second: { length: number;[x: number]: T; }): IEnumerable<T>;
|
|
84
|
+
alternate(alternateValue: T): IEnumerable<T>;
|
|
85
|
+
alternate(alternateSequence: { length: number;[x: number]: T; }): IEnumerable<T>;
|
|
86
|
+
alternate(alternateSequence: IEnumerable<T>): IEnumerable<T>;
|
|
87
|
+
alternate(alternateSequence: T[]): IEnumerable<T>;
|
|
88
|
+
contains(value: T): boolean;
|
|
89
|
+
contains<TCompare>(value: T, compareSelector?: (element: T) => TCompare): boolean;
|
|
90
|
+
defaultIfEmpty(defaultValue?: T): IEnumerable<T>;
|
|
91
|
+
distinct(): IEnumerable<T>;
|
|
92
|
+
distinct<TCompare>(compareSelector: (element: T) => TCompare): IEnumerable<T>;
|
|
93
|
+
distinctUntilChanged(): IEnumerable<T>;
|
|
94
|
+
distinctUntilChanged<TCompare>(compareSelector: (element: T) => TCompare): IEnumerable<T>;
|
|
95
|
+
except(second: { length: number;[x: number]: T; }): IEnumerable<T>;
|
|
96
|
+
except<TCompare>(second: { length: number;[x: number]: T; }, compareSelector: (element: T) => TCompare): IEnumerable<T>;
|
|
97
|
+
except(second: IEnumerable<T>): IEnumerable<T>;
|
|
98
|
+
except<TCompare>(second: IEnumerable<T>, compareSelector: (element: T) => TCompare): IEnumerable<T>;
|
|
99
|
+
except(second: T[]): IEnumerable<T>;
|
|
100
|
+
except<TCompare>(second: T[], compareSelector: (element: T) => TCompare): IEnumerable<T>;
|
|
101
|
+
intersect(second: { length: number;[x: number]: T; }): IEnumerable<T>;
|
|
102
|
+
intersect<TCompare>(second: { length: number;[x: number]: T; }, compareSelector: (element: T) => TCompare): IEnumerable<T>;
|
|
103
|
+
intersect(second: IEnumerable<T>): IEnumerable<T>;
|
|
104
|
+
intersect<TCompare>(second: IEnumerable<T>, compareSelector: (element: T) => TCompare): IEnumerable<T>;
|
|
105
|
+
intersect(second: T[]): IEnumerable<T>;
|
|
106
|
+
intersect<TCompare>(second: T[], compareSelector: (element: T) => TCompare): IEnumerable<T>;
|
|
107
|
+
union(second: { length: number;[x: number]: T; }): IEnumerable<T>;
|
|
108
|
+
union<TCompare>(second: { length: number;[x: number]: T; }, compareSelector: (element: T) => TCompare): IEnumerable<T>;
|
|
109
|
+
union(second: IEnumerable<T>): IEnumerable<T>;
|
|
110
|
+
union<TCompare>(second: IEnumerable<T>, compareSelector: (element: T) => TCompare): IEnumerable<T>;
|
|
111
|
+
union(second: T[]): IEnumerable<T>;
|
|
112
|
+
union<TCompare>(second: T[], compareSelector: (element: T) => TCompare): IEnumerable<T>;
|
|
113
|
+
sequenceEqual(second: { length: number;[x: number]: T; }): boolean;
|
|
114
|
+
sequenceEqual<TCompare>(second: { length: number;[x: number]: T; }, compareSelector: (element: T) => TCompare): boolean;
|
|
115
|
+
sequenceEqual(second: IEnumerable<T>): boolean;
|
|
116
|
+
sequenceEqual<TCompare>(second: IEnumerable<T>, compareSelector: (element: T) => TCompare): boolean;
|
|
117
|
+
sequenceEqual(second: T[]): boolean;
|
|
118
|
+
sequenceEqual<TCompare>(second: T[], compareSelector: (element: T) => TCompare): boolean;
|
|
119
|
+
orderBy<TKey>(keySelector: (element: T) => TKey): IOrderedEnumerable<T>;
|
|
120
|
+
orderBy<TKey>(keySelector: (element: T) => TKey, comparer: (first: TKey, second: TKey) => number): IOrderedEnumerable<T>;
|
|
121
|
+
orderByDescending<TKey>(keySelector: (element: T) => TKey): IOrderedEnumerable<T>;
|
|
122
|
+
orderByDescending<TKey>(keySelector: (element: T) => TKey, comparer: (first: TKey, second: TKey) => number): IOrderedEnumerable<T>;
|
|
123
|
+
reverse(): IEnumerable<T>;
|
|
124
|
+
shuffle(): IEnumerable<T>;
|
|
125
|
+
weightedSample(weightSelector: (element: T) => number): IEnumerable<T>;
|
|
126
|
+
groupBy<TKey>(keySelector: (element: T) => TKey): IEnumerable<IGrouping<TKey, T>>;
|
|
127
|
+
groupBy<TKey, TElement>(keySelector: (element: T) => TKey, elementSelector: (element: T) => TElement): IEnumerable<IGrouping<TKey, TElement>>;
|
|
128
|
+
groupBy<TKey, TElement, TResult>(keySelector: (element: T) => TKey, elementSelector: (element: T) => TElement, resultSelector: (key: TKey, element: IEnumerable<TElement>) => TResult): IEnumerable<TResult>;
|
|
129
|
+
groupBy<TKey, TElement, TResult, TCompare>(keySelector: (element: T) => TKey, elementSelector: (element: T) => TElement, resultSelector: (key: TKey, element: IEnumerable<TElement>) => TResult, compareSelector: (element: TKey) => TCompare): IEnumerable<TResult>;
|
|
130
|
+
partitionBy<TKey>(keySelector: (element: T) => TKey): IEnumerable<IGrouping<TKey, unknown>>;
|
|
131
|
+
partitionBy<TKey, TElement>(keySelector: (element: T) => TKey, elementSelector: (element: T) => TElement): IEnumerable<IGrouping<TKey, TElement>>;
|
|
132
|
+
partitionBy<TKey, TElement, TResult>(keySelector: (element: T) => TKey, elementSelector: (element: T) => TElement, resultSelector: (key: TKey, element: IEnumerable<TElement>) => TResult): IEnumerable<TResult>;
|
|
133
|
+
partitionBy<TKey, TElement, TResult, TCompare>(keySelector: (element: T) => TKey, elementSelector: (element: T) => TElement, resultSelector: (key: TKey, element: IEnumerable<TElement>) => TResult, compareSelector: (element: TKey) => TCompare): IEnumerable<TResult>;
|
|
134
|
+
buffer(count: number): IEnumerable<T[]>;
|
|
135
|
+
aggregate(func: (prev: T, current: T) => T): T;
|
|
136
|
+
aggregate<TAccumulate>(seed: TAccumulate, func: (prev: TAccumulate, current: T) => TAccumulate): TAccumulate;
|
|
137
|
+
aggregate<TAccumulate, TResult>(seed: TAccumulate, func: (prev: TAccumulate, current: T) => TAccumulate, resultSelector: (last: TAccumulate) => TResult): TResult;
|
|
138
|
+
average(selector?: (element: T) => number): number;
|
|
139
|
+
count(predicate?: (element: T, index: number) => boolean): number;
|
|
140
|
+
max(selector?: (element: T) => number): number;
|
|
141
|
+
min(selector?: (element: T) => number): number;
|
|
142
|
+
maxBy<TKey>(keySelector: (element: T) => TKey): T;
|
|
143
|
+
minBy<TKey>(keySelector: (element: T) => TKey): T;
|
|
144
|
+
sum(selector?: (element: T) => number): number;
|
|
145
|
+
elementAt(index: number): T;
|
|
146
|
+
elementAtOrDefault(index: number, defaultValue?: T): T | undefined;
|
|
147
|
+
first<TOther extends T>(predicate: (element: T, index: number) => element is TOther): TOther;
|
|
148
|
+
first(predicate?: (element: T, index: number) => boolean): T;
|
|
149
|
+
firstOrDefault<TOther extends T, TDefault>(predicate: (element: T, index: number) => element is TOther, defaultValue: TDefault): TOther | TDefault;
|
|
150
|
+
firstOrDefault<TDefault>(predicate: (element: T, index: number) => boolean, defaultValue: TDefault): T | TDefault;
|
|
151
|
+
firstOrDefault<TOther extends T>(predicate: (element: T, index: number) => element is TOther): TOther | undefined;
|
|
152
|
+
firstOrDefault(predicate: (element: T, index: number) => boolean): T | undefined;
|
|
153
|
+
firstOrDefault<TDefault>(defaultValue: TDefault): T | TDefault;
|
|
154
|
+
firstOrDefault(): T | undefined;
|
|
155
|
+
last<TOther extends T>(predicate: (element: T, index: number) => element is TOther): TOther;
|
|
156
|
+
last(predicate?: (element: T, index: number) => boolean): T;
|
|
157
|
+
lastOrDefault<TOther extends T, TDefault>(predicate: (element: T, index: number) => element is TOther, defaultValue: TDefault): TOther | TDefault;
|
|
158
|
+
lastOrDefault<TDefault>(predicate: (element: T, index: number) => boolean, defaultValue: TDefault): T | TDefault;
|
|
159
|
+
lastOrDefault<TOther extends T>(predicate: (element: T, index: number) => element is TOther): TOther | undefined;
|
|
160
|
+
lastOrDefault(predicate: (element: T, index: number) => boolean): T | undefined;
|
|
161
|
+
lastOrDefault<TDefault>(defaultValue: TDefault): T | TDefault;
|
|
162
|
+
lastOrDefault(): T | undefined;
|
|
163
|
+
single<TOther extends T>(predicate: (element: T, index: number) => element is TOther): TOther;
|
|
164
|
+
single(predicate?: (element: T, index: number) => boolean): T;
|
|
165
|
+
singleOrDefault<TOther extends T, TDefault>(predicate: (element: T, index: number) => element is TOther, defaultValue: TDefault): TOther | TDefault;
|
|
166
|
+
singleOrDefault<TDefault>(predicate: (element: T, index: number) => boolean, defaultValue: TDefault): T | TDefault;
|
|
167
|
+
singleOrDefault<TOther extends T>(predicate: (element: T, index: number) => element is TOther): TOther | undefined;
|
|
168
|
+
singleOrDefault(predicate: (element: T, index: number) => boolean): T | undefined;
|
|
169
|
+
singleOrDefault<TDefault>(defaultValue: TDefault): T | TDefault;
|
|
170
|
+
singleOrDefault(): T | undefined;
|
|
171
|
+
skip(count: number): IEnumerable<T>;
|
|
172
|
+
skipWhile(predicate: (element: T, index: number) => boolean): IEnumerable<T>;
|
|
173
|
+
take(count: number): IEnumerable<T>;
|
|
174
|
+
takeWhile(predicate: (element: T, index: number) => boolean): IEnumerable<T>;
|
|
175
|
+
takeExceptLast(count?: number): IEnumerable<T>;
|
|
176
|
+
takeFromLast(count: number): IEnumerable<T>;
|
|
177
|
+
indexOf(item: T): number;
|
|
178
|
+
indexOf(predicate: (element: T, index: number) => boolean): number;
|
|
179
|
+
lastIndexOf(item: T): number;
|
|
180
|
+
lastIndexOf(predicate: (element: T, index: number) => boolean): number;
|
|
181
|
+
asEnumerable(): IEnumerable<T>;
|
|
182
|
+
cast<TResult>(): IEnumerable<TResult>;
|
|
183
|
+
toArray(): T[];
|
|
184
|
+
toLookup<TKey>(keySelector: (element: T) => TKey): ILookup<TKey, T>;
|
|
185
|
+
toLookup<TKey, TElement>(keySelector: (element: T) => TKey, elementSelector: (element: T) => TElement): ILookup<TKey, TElement>;
|
|
186
|
+
toLookup<TKey, TElement, TCompare>(keySelector: (element: T) => TKey, elementSelector: (element: T) => TElement, compareSelector: (key: TKey) => TCompare): ILookup<TKey, TElement>;
|
|
187
|
+
toObject<TKey extends PropertyKey, TElement>(keySelector: (element: T) => TKey, elementSelector?: (element: T) => TElement): Record<TKey, TElement>;
|
|
188
|
+
toDictionary<TKey>(keySelector: (element: T) => TKey): IDictionary<TKey, T>;
|
|
189
|
+
toDictionary<TKey, TValue>(keySelector: (element: T) => TKey, elementSelector: (element: T) => TValue): IDictionary<TKey, TValue>;
|
|
190
|
+
toDictionary<TKey, TValue, TCompare>(keySelector: (element: T) => TKey, elementSelector: (element: T) => TValue, compareSelector: (key: TKey) => TCompare): IDictionary<TKey, TValue>;
|
|
191
|
+
toJSONString(replacer?: (key: string, value: unknown) => unknown, space?: string | number): string;
|
|
192
|
+
toJSONString(replacer?: (string | number)[], space?: string | number): string;
|
|
193
|
+
toJoinedString(separator?: string): string;
|
|
194
|
+
toJoinedString<TResult>(separator: string, selector: (element: T, index: number) => TResult): string;
|
|
195
|
+
doAction(action: (element: T, index: number) => void): IEnumerable<T>;
|
|
196
|
+
doAction(action: (element: T, index: number) => boolean): IEnumerable<T>;
|
|
197
|
+
forEach(action: (element: T, index: number) => void): void;
|
|
198
|
+
forEach(action: (element: T, index: number) => boolean): void;
|
|
199
|
+
force(): void;
|
|
200
|
+
letBind<TResult>(func: (source: IEnumerable<T>) => { length: number;[x: number]: TResult; }): IEnumerable<TResult>;
|
|
201
|
+
letBind<TResult>(func: (source: IEnumerable<T>) => TResult[]): IEnumerable<TResult>;
|
|
202
|
+
letBind<TResult>(func: (source: IEnumerable<T>) => IEnumerable<TResult>): IEnumerable<TResult>;
|
|
203
|
+
share(): IDisposableEnumerable<T>;
|
|
204
|
+
memoize(): IDisposableEnumerable<T>;
|
|
205
|
+
catchError(handler: string | ((exception: unknown) => void)): IEnumerable<T>;
|
|
206
|
+
finallyAction(finallyAction: () => void): IEnumerable<T>;
|
|
207
|
+
log(): IEnumerable<T>;
|
|
208
|
+
log<TValue>(selector: (element: T) => TValue): IEnumerable<T>;
|
|
209
|
+
trace(message?: string): IEnumerable<T>;
|
|
210
|
+
trace<TValue>(message: string, selector: (element: T) => TValue): IEnumerable<T>;
|
|
211
|
+
}
|
|
212
|
+
|
|
213
|
+
export interface IEnumerator<T> {
|
|
214
|
+
current(): T;
|
|
215
|
+
moveNext(): boolean;
|
|
216
|
+
dispose(): void;
|
|
217
|
+
}
|
|
218
|
+
|
|
219
|
+
export interface IOrderedEnumerable<T> extends IEnumerable<T> {
|
|
220
|
+
createOrderedEnumerable<TKey>(keySelector: (element: T) => TKey, comparer?: (first: TKey, second: TKey) => number, descending?: boolean): IOrderedEnumerable<T>;
|
|
221
|
+
thenBy<TKey>(keySelector: (element: T) => TKey): IOrderedEnumerable<T>;
|
|
222
|
+
thenBy<TKey>(keySelector: (element: T) => TKey, comparer: (first: TKey, second: TKey) => number): IOrderedEnumerable<T>;
|
|
223
|
+
thenByDescending<TKey>(keySelector: (element: T) => TKey): IOrderedEnumerable<T>;
|
|
224
|
+
thenByDescending<TKey>(keySelector: (element: T) => TKey, comparer: (first: TKey, second: TKey) => number): IOrderedEnumerable<T>;
|
|
225
|
+
}
|
|
226
|
+
|
|
227
|
+
export interface IDisposableEnumerable<T> extends IEnumerable<T> {
|
|
228
|
+
dispose(): void;
|
|
229
|
+
}
|
|
230
|
+
|
|
231
|
+
export interface IDictionary<TKey, TValue> {
|
|
232
|
+
add(key: TKey, value: TValue): void;
|
|
233
|
+
get(key: TKey): TValue;
|
|
234
|
+
set(key: TKey, value: TValue): boolean;
|
|
235
|
+
contains(key: TKey): boolean;
|
|
236
|
+
clear(): void;
|
|
237
|
+
remove(key: TKey): void;
|
|
238
|
+
count(): number;
|
|
239
|
+
toEnumerable(): IEnumerable<{ key: TKey; value: TValue }>;
|
|
240
|
+
}
|
|
241
|
+
|
|
242
|
+
export interface ILookup<TKey, TElement> {
|
|
243
|
+
count(): number;
|
|
244
|
+
get(key: TKey): IEnumerable<TElement>;
|
|
245
|
+
contains(key: TKey): boolean;
|
|
246
|
+
toEnumerable(): IEnumerable<IGrouping<TKey, TElement>>;
|
|
247
|
+
}
|
|
248
|
+
|
|
249
|
+
export interface IGrouping<TKey, TElement> extends IEnumerable<TElement> {
|
|
250
|
+
key(): TKey;
|
|
251
|
+
getSource(): TElement[];
|
|
252
|
+
}
|
|
253
|
+
}
|
|
254
|
+
|
|
255
|
+
export default Enumerable;
|
|
256
|
+
export { Enumerable };
|