@fable-org/fable-library-js 2.0.0-beta.4 → 2.0.0-beta.5
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/Array.js +56 -52
- package/Async.js +8 -7
- package/AsyncBuilder.js +6 -6
- package/BigInt.js +3 -3
- package/Boolean.js +2 -1
- package/CHANGELOG.md +8 -0
- package/Char.js +64 -31
- package/CollectionUtil.js +3 -3
- package/Date.js +50 -46
- package/DateOffset.js +38 -48
- package/DateOnly.js +6 -6
- package/Decimal.js +4 -4
- package/Double.js +2 -1
- package/FSharp.Collections.js +28 -10
- package/FSharp.Core.js +23 -23
- package/Global.js +21 -0
- package/Guid.js +5 -4
- package/Int32.js +17 -17
- package/List.js +36 -35
- package/Long.js +3 -2
- package/MailboxProcessor.js +2 -1
- package/Map.js +29 -27
- package/MapUtil.js +4 -4
- package/MutableMap.js +22 -10
- package/MutableSet.js +3 -3
- package/Option.js +3 -3
- package/Random.js +12 -11
- package/Range.js +2 -2
- package/Reflection.js +16 -16
- package/RegExp.js +4 -3
- package/Seq.js +31 -29
- package/Set.js +34 -33
- package/String.js +44 -35
- package/System.Collections.Generic.js +20 -4
- package/System.Text.js +3 -3
- package/System.js +283 -0
- package/TimeOnly.js +6 -6
- package/TimeSpan.js +5 -5
- package/Types.js +1 -17
- package/Uri.js +25 -19
- package/Util.js +31 -17
- package/package.json +1 -1
- package/Array.d.ts +0 -123
- package/Async.d.ts +0 -26
- package/AsyncBuilder.d.ts +0 -59
- package/BigInt.d.ts +0 -129
- package/BitConverter.d.ts +0 -27
- package/Boolean.d.ts +0 -3
- package/Char.d.ts +0 -65
- package/Choice.d.ts +0 -121
- package/CollectionUtil.d.ts +0 -7
- package/ConditionalWeakTable.d.ts +0 -9
- package/Date.d.ts +0 -69
- package/DateOffset.d.ts +0 -64
- package/DateOnly.d.ts +0 -18
- package/Decimal.d.ts +0 -63
- package/Double.d.ts +0 -11
- package/Encoding.d.ts +0 -12
- package/Event.d.ts +0 -31
- package/FSharp.Collections.d.ts +0 -7
- package/FSharp.Core.CompilerServices.d.ts +0 -12
- package/FSharp.Core.d.ts +0 -30
- package/Global.d.ts +0 -24
- package/Guid.d.ts +0 -10
- package/Int32.d.ts +0 -28
- package/List.d.ts +0 -143
- package/Long.d.ts +0 -3
- package/MailboxProcessor.d.ts +0 -25
- package/Map.d.ts +0 -178
- package/MapUtil.d.ts +0 -12
- package/MutableMap.d.ts +0 -52
- package/MutableSet.d.ts +0 -39
- package/Native.d.ts +0 -3
- package/Numeric.d.ts +0 -20
- package/Observable.d.ts +0 -32
- package/Option.d.ts +0 -29
- package/Random.d.ts +0 -37
- package/Range.d.ts +0 -12
- package/Reflection.d.ts +0 -119
- package/RegExp.d.ts +0 -10
- package/Result.d.ts +0 -37
- package/Seq.d.ts +0 -164
- package/Seq2.d.ts +0 -18
- package/Set.d.ts +0 -190
- package/String.d.ts +0 -58
- package/System.Collections.Generic.d.ts +0 -79
- package/System.Text.d.ts +0 -40
- package/SystemException.d.ts +0 -5
- package/SystemException.js +0 -5
- package/TimeOnly.d.ts +0 -15
- package/TimeSpan.d.ts +0 -35
- package/Timer.d.ts +0 -19
- package/Types.d.ts +0 -58
- package/Unicode.13.0.0.d.ts +0 -2
- package/Uri.d.ts +0 -31
- package/Util.d.ts +0 -212
- package/lib/big.d.ts +0 -5
package/Random.d.ts
DELETED
|
@@ -1,37 +0,0 @@
|
|
|
1
|
-
import { uint8, int32, float64 } from "./Int32.js";
|
|
2
|
-
import { TypeInfo } from "./Reflection.js";
|
|
3
|
-
export interface IRandom {
|
|
4
|
-
Next0(): int32;
|
|
5
|
-
Next1(maxValue: int32): int32;
|
|
6
|
-
Next2(minValue: int32, maxValue: int32): int32;
|
|
7
|
-
NextBytes(buffer: uint8[]): void;
|
|
8
|
-
NextDouble(): float64;
|
|
9
|
-
}
|
|
10
|
-
export declare class NonSeeded implements IRandom {
|
|
11
|
-
constructor();
|
|
12
|
-
Next0(): int32;
|
|
13
|
-
Next1(maxValue: int32): int32;
|
|
14
|
-
Next2(minValue: int32, maxValue: int32): int32;
|
|
15
|
-
NextDouble(): float64;
|
|
16
|
-
NextBytes(buffer: uint8[]): void;
|
|
17
|
-
}
|
|
18
|
-
export declare function NonSeeded_$reflection(): TypeInfo;
|
|
19
|
-
export declare function NonSeeded_$ctor(): NonSeeded;
|
|
20
|
-
export declare class Seeded implements IRandom {
|
|
21
|
-
readonly MBIG: int32;
|
|
22
|
-
inext: int32;
|
|
23
|
-
inextp: int32;
|
|
24
|
-
seedArray: int32[];
|
|
25
|
-
constructor(seed: int32);
|
|
26
|
-
Next0(): int32;
|
|
27
|
-
Next1(maxValue: int32): int32;
|
|
28
|
-
Next2(minValue: int32, maxValue: int32): int32;
|
|
29
|
-
NextDouble(): float64;
|
|
30
|
-
NextBytes(buffer: uint8[]): void;
|
|
31
|
-
}
|
|
32
|
-
export declare function Seeded_$reflection(): TypeInfo;
|
|
33
|
-
export declare function Seeded_$ctor_Z524259A4(seed: int32): Seeded;
|
|
34
|
-
export declare function Seeded__Sample(this$: Seeded): float64;
|
|
35
|
-
export declare function Seeded__GetSampleForLargeRange(this$: Seeded): float64;
|
|
36
|
-
export declare function nonSeeded(): NonSeeded;
|
|
37
|
-
export declare function seeded(seed: int32): Seeded;
|
package/Range.d.ts
DELETED
|
@@ -1,12 +0,0 @@
|
|
|
1
|
-
import { float64 } from "./Int32.js";
|
|
2
|
-
import { Option } from "./Option.js";
|
|
3
|
-
import { uint64, int64 } from "./BigInt.js";
|
|
4
|
-
import { decimal } from "./Decimal.js";
|
|
5
|
-
export declare function makeRangeStepFunction<T>(step: T, stop: T, zero: T, add: ((arg0: T, arg1: T) => T)): ((arg0: T) => Option<[T, T]>);
|
|
6
|
-
export declare function integralRangeStep<T>(start: T, step: T, stop: T, zero: T, add: ((arg0: T, arg1: T) => T)): Iterable<T>;
|
|
7
|
-
export declare function rangeBigInt(start: bigint, step: bigint, stop: bigint): Iterable<bigint>;
|
|
8
|
-
export declare function rangeDecimal(start: decimal, step: decimal, stop: decimal): Iterable<decimal>;
|
|
9
|
-
export declare function rangeDouble(start: float64, step: float64, stop: float64): Iterable<float64>;
|
|
10
|
-
export declare function rangeInt64(start: int64, step: int64, stop: int64): Iterable<int64>;
|
|
11
|
-
export declare function rangeUInt64(start: uint64, step: uint64, stop: uint64): Iterable<uint64>;
|
|
12
|
-
export declare function rangeChar(start: string, stop: string): Iterable<string>;
|
package/Reflection.d.ts
DELETED
|
@@ -1,119 +0,0 @@
|
|
|
1
|
-
import { FSharpRef } from "./Types.js";
|
|
2
|
-
import { IEquatable } from "./Util.js";
|
|
3
|
-
export type FieldInfo = [string, TypeInfo];
|
|
4
|
-
export type PropertyInfo = FieldInfo;
|
|
5
|
-
export type ParameterInfo = FieldInfo;
|
|
6
|
-
export type Constructor = new (...args: any[]) => any;
|
|
7
|
-
export declare class CaseInfo {
|
|
8
|
-
declaringType: TypeInfo;
|
|
9
|
-
tag: number;
|
|
10
|
-
name: string;
|
|
11
|
-
fields?: FieldInfo[] | undefined;
|
|
12
|
-
constructor(declaringType: TypeInfo, tag: number, name: string, fields?: FieldInfo[] | undefined);
|
|
13
|
-
}
|
|
14
|
-
export type EnumCase = [string, number];
|
|
15
|
-
export declare class MethodInfo {
|
|
16
|
-
name: string;
|
|
17
|
-
parameters: ParameterInfo[];
|
|
18
|
-
returnType: TypeInfo;
|
|
19
|
-
constructor(name: string, parameters: ParameterInfo[], returnType: TypeInfo);
|
|
20
|
-
}
|
|
21
|
-
export declare class TypeInfo implements IEquatable<TypeInfo> {
|
|
22
|
-
fullname: string;
|
|
23
|
-
generics?: TypeInfo[] | undefined;
|
|
24
|
-
construct?: Constructor | undefined;
|
|
25
|
-
parent?: TypeInfo | undefined;
|
|
26
|
-
fields?: (() => FieldInfo[]) | undefined;
|
|
27
|
-
cases?: (() => CaseInfo[]) | undefined;
|
|
28
|
-
enumCases?: EnumCase[] | undefined;
|
|
29
|
-
constructor(fullname: string, generics?: TypeInfo[] | undefined, construct?: Constructor | undefined, parent?: TypeInfo | undefined, fields?: (() => FieldInfo[]) | undefined, cases?: (() => CaseInfo[]) | undefined, enumCases?: EnumCase[] | undefined);
|
|
30
|
-
toString(): string;
|
|
31
|
-
GetHashCode(): number;
|
|
32
|
-
Equals(other: TypeInfo): boolean;
|
|
33
|
-
}
|
|
34
|
-
export declare class GenericParameter extends TypeInfo {
|
|
35
|
-
constructor(name: string);
|
|
36
|
-
}
|
|
37
|
-
export declare function getGenerics(t: TypeInfo): TypeInfo[];
|
|
38
|
-
export declare function getHashCode(t: TypeInfo): number;
|
|
39
|
-
export declare function equals(t1: TypeInfo, t2: TypeInfo): boolean;
|
|
40
|
-
export declare function class_type(fullname: string, generics?: TypeInfo[], construct?: Constructor, parent?: TypeInfo): TypeInfo;
|
|
41
|
-
export declare function record_type(fullname: string, generics: TypeInfo[], construct: Constructor, fields: () => FieldInfo[]): TypeInfo;
|
|
42
|
-
export declare function anonRecord_type(...fields: FieldInfo[]): TypeInfo;
|
|
43
|
-
export declare function union_type(fullname: string, generics: TypeInfo[], construct: Constructor, cases: () => FieldInfo[][]): TypeInfo;
|
|
44
|
-
export declare function tuple_type(...generics: TypeInfo[]): TypeInfo;
|
|
45
|
-
export declare function delegate_type(...generics: TypeInfo[]): TypeInfo;
|
|
46
|
-
export declare function lambda_type(argType: TypeInfo, returnType: TypeInfo): TypeInfo;
|
|
47
|
-
export declare function option_type(generic: TypeInfo): TypeInfo;
|
|
48
|
-
export declare function list_type(generic: TypeInfo): TypeInfo;
|
|
49
|
-
export declare function array_type(generic: TypeInfo): TypeInfo;
|
|
50
|
-
export declare function enum_type(fullname: string, underlyingType: TypeInfo, enumCases: EnumCase[]): TypeInfo;
|
|
51
|
-
export declare function measure_type(fullname: string): TypeInfo;
|
|
52
|
-
export declare function generic_type(name: string): TypeInfo;
|
|
53
|
-
export declare const obj_type: TypeInfo;
|
|
54
|
-
export declare const unit_type: TypeInfo;
|
|
55
|
-
export declare const char_type: TypeInfo;
|
|
56
|
-
export declare const string_type: TypeInfo;
|
|
57
|
-
export declare const bool_type: TypeInfo;
|
|
58
|
-
export declare const int8_type: TypeInfo;
|
|
59
|
-
export declare const uint8_type: TypeInfo;
|
|
60
|
-
export declare const int16_type: TypeInfo;
|
|
61
|
-
export declare const uint16_type: TypeInfo;
|
|
62
|
-
export declare const int32_type: TypeInfo;
|
|
63
|
-
export declare const uint32_type: TypeInfo;
|
|
64
|
-
export declare const int64_type: TypeInfo;
|
|
65
|
-
export declare const uint64_type: TypeInfo;
|
|
66
|
-
export declare const int128_type: TypeInfo;
|
|
67
|
-
export declare const uint128_type: TypeInfo;
|
|
68
|
-
export declare const nativeint_type: TypeInfo;
|
|
69
|
-
export declare const unativeint_type: TypeInfo;
|
|
70
|
-
export declare const float16_type: TypeInfo;
|
|
71
|
-
export declare const float32_type: TypeInfo;
|
|
72
|
-
export declare const float64_type: TypeInfo;
|
|
73
|
-
export declare const decimal_type: TypeInfo;
|
|
74
|
-
export declare const bigint_type: TypeInfo;
|
|
75
|
-
export declare function name(info: FieldInfo | TypeInfo | CaseInfo | MethodInfo): string;
|
|
76
|
-
export declare function fullName(t: TypeInfo): string;
|
|
77
|
-
export declare function namespace(t: TypeInfo): string;
|
|
78
|
-
export declare function isArray(t: TypeInfo): boolean;
|
|
79
|
-
export declare function getElementType(t: TypeInfo): TypeInfo | undefined;
|
|
80
|
-
export declare function isGenericType(t: TypeInfo): boolean;
|
|
81
|
-
export declare function isGenericParameter(t: TypeInfo): t is GenericParameter;
|
|
82
|
-
export declare function isEnum(t: TypeInfo): boolean;
|
|
83
|
-
export declare function isSubclassOf(t1: TypeInfo, t2: TypeInfo): boolean;
|
|
84
|
-
export declare function isInstanceOfType(t: TypeInfo, o: any): boolean;
|
|
85
|
-
/**
|
|
86
|
-
* This doesn't replace types for fields (records) or cases (unions)
|
|
87
|
-
* but it should be enough for type comparison purposes
|
|
88
|
-
*/
|
|
89
|
-
export declare function getGenericTypeDefinition(t: TypeInfo): TypeInfo;
|
|
90
|
-
export declare function getEnumUnderlyingType(t: TypeInfo): TypeInfo | undefined;
|
|
91
|
-
export declare function getEnumValues(t: TypeInfo): number[];
|
|
92
|
-
export declare function getEnumNames(t: TypeInfo): string[];
|
|
93
|
-
export declare function parseEnum(t: TypeInfo, str: string): number;
|
|
94
|
-
export declare function tryParseEnum(t: TypeInfo, str: string, defValue: FSharpRef<number>): boolean;
|
|
95
|
-
export declare function getEnumName(t: TypeInfo, v: number): string;
|
|
96
|
-
export declare function isEnumDefined(t: TypeInfo, v: string | number): boolean;
|
|
97
|
-
export declare function getUnionCases(t: TypeInfo): CaseInfo[];
|
|
98
|
-
export declare function getRecordElements(t: TypeInfo): FieldInfo[];
|
|
99
|
-
export declare function getTupleElements(t: TypeInfo): TypeInfo[];
|
|
100
|
-
export declare function getFunctionElements(t: TypeInfo): [TypeInfo, TypeInfo];
|
|
101
|
-
export declare function isUnion(t: any): boolean;
|
|
102
|
-
export declare function isRecord(t: any): boolean;
|
|
103
|
-
export declare function isTuple(t: TypeInfo): boolean;
|
|
104
|
-
export declare function isFunction(t: TypeInfo): boolean;
|
|
105
|
-
export declare function getUnionFields(v: any, t: TypeInfo): [CaseInfo, any[]];
|
|
106
|
-
export declare function getUnionCaseFields(uci: CaseInfo): FieldInfo[];
|
|
107
|
-
export declare function getRecordFields(v: any): any[];
|
|
108
|
-
export declare function getRecordField(v: any, field: FieldInfo): any;
|
|
109
|
-
export declare function getTupleFields(v: any): any[];
|
|
110
|
-
export declare function getTupleField(v: any, i: number): any;
|
|
111
|
-
export declare function makeUnion(uci: CaseInfo, values: any[]): any;
|
|
112
|
-
export declare function makeRecord(t: TypeInfo, values: any[]): any;
|
|
113
|
-
export declare function makeTuple(values: any[], _t: TypeInfo): any;
|
|
114
|
-
export declare function makeGenericType(t: TypeInfo, generics: TypeInfo[]): TypeInfo;
|
|
115
|
-
export declare function createInstance(t: TypeInfo, consArgs?: any[]): any;
|
|
116
|
-
export declare function getValue(propertyInfo: PropertyInfo, v: any): any;
|
|
117
|
-
export declare function getCaseTag(x: any): number;
|
|
118
|
-
export declare function getCaseName(x: any): string;
|
|
119
|
-
export declare function getCaseFields(x: any): any[];
|
package/RegExp.d.ts
DELETED
|
@@ -1,10 +0,0 @@
|
|
|
1
|
-
export type MatchEvaluator = (match: any) => string;
|
|
2
|
-
export declare function create(pattern: string, options?: number): RegExp;
|
|
3
|
-
export declare function escape(str: string): string;
|
|
4
|
-
export declare function unescape(str: string): string;
|
|
5
|
-
export declare function isMatch(reg: RegExp, input: string, startAt?: number): boolean;
|
|
6
|
-
export declare function match(reg: RegExp, input: string, startAt?: number): RegExpExecArray | null;
|
|
7
|
-
export declare function matches(reg: RegExp, input: string, startAt?: number): RegExpExecArray[];
|
|
8
|
-
export declare function options(reg: RegExp): number;
|
|
9
|
-
export declare function replace(reg: string | RegExp, input: string, replacement: string | MatchEvaluator, limit?: number, offset?: number): string;
|
|
10
|
-
export declare function split(reg: string | RegExp, input: string, limit?: number, offset?: number): string[];
|
package/Result.d.ts
DELETED
|
@@ -1,37 +0,0 @@
|
|
|
1
|
-
import { Union } from "./Types.js";
|
|
2
|
-
import { TypeInfo } from "./Reflection.js";
|
|
3
|
-
import { int32 } from "./Int32.js";
|
|
4
|
-
import { FSharpList } from "./List.js";
|
|
5
|
-
import { Option } from "./Option.js";
|
|
6
|
-
export type FSharpResult$2_$union<T, TError> = FSharpResult$2<T, TError, 0> | FSharpResult$2<T, TError, 1>;
|
|
7
|
-
export type FSharpResult$2_$cases<T, TError> = {
|
|
8
|
-
0: ["Ok", [T]];
|
|
9
|
-
1: ["Error", [TError]];
|
|
10
|
-
};
|
|
11
|
-
export declare function FSharpResult$2_Ok<T, TError>(ResultValue: T): FSharpResult$2<T, TError, 0>;
|
|
12
|
-
export declare function FSharpResult$2_Error$<T, TError>(ErrorValue: TError): FSharpResult$2<T, TError, 1>;
|
|
13
|
-
export declare class FSharpResult$2<T, TError, Tag extends keyof FSharpResult$2_$cases<T, TError>> extends Union<Tag, FSharpResult$2_$cases<T, TError>[Tag][0]> {
|
|
14
|
-
readonly tag: Tag;
|
|
15
|
-
readonly fields: FSharpResult$2_$cases<T, TError>[Tag][1];
|
|
16
|
-
constructor(tag: Tag, fields: FSharpResult$2_$cases<T, TError>[Tag][1]);
|
|
17
|
-
cases(): string[];
|
|
18
|
-
}
|
|
19
|
-
export declare function FSharpResult$2_$reflection(gen0: TypeInfo, gen1: TypeInfo): TypeInfo;
|
|
20
|
-
export declare function Result_Map<a, b, c>(mapping: ((arg0: a) => b), result: FSharpResult$2_$union<a, c>): FSharpResult$2_$union<b, c>;
|
|
21
|
-
export declare function Result_MapError<a, b, c>(mapping: ((arg0: a) => b), result: FSharpResult$2_$union<c, a>): FSharpResult$2_$union<c, b>;
|
|
22
|
-
export declare function Result_Bind<a, b, c>(binder: ((arg0: a) => FSharpResult$2_$union<b, c>), result: FSharpResult$2_$union<a, c>): FSharpResult$2_$union<b, c>;
|
|
23
|
-
export declare function Result_IsOk<a, b>(result: FSharpResult$2_$union<a, b>): boolean;
|
|
24
|
-
export declare function Result_IsError<a, b>(result: FSharpResult$2_$union<a, b>): boolean;
|
|
25
|
-
export declare function Result_Contains<a, b>(value: a, result: FSharpResult$2_$union<a, b>): boolean;
|
|
26
|
-
export declare function Result_Count<a, b>(result: FSharpResult$2_$union<a, b>): int32;
|
|
27
|
-
export declare function Result_DefaultValue<a, b>(defaultValue: a, result: FSharpResult$2_$union<a, b>): a;
|
|
28
|
-
export declare function Result_DefaultWith<b, a>(defThunk: ((arg0: b) => a), result: FSharpResult$2_$union<a, b>): a;
|
|
29
|
-
export declare function Result_Exists<a, b>(predicate: ((arg0: a) => boolean), result: FSharpResult$2_$union<a, b>): boolean;
|
|
30
|
-
export declare function Result_Fold<a, b, s>(folder: ((arg0: s, arg1: a) => s), state: s, result: FSharpResult$2_$union<a, b>): s;
|
|
31
|
-
export declare function Result_FoldBack<a, b, s>(folder: ((arg0: a, arg1: s) => s), result: FSharpResult$2_$union<a, b>, state: s): s;
|
|
32
|
-
export declare function Result_ForAll<a, b>(predicate: ((arg0: a) => boolean), result: FSharpResult$2_$union<a, b>): boolean;
|
|
33
|
-
export declare function Result_Iterate<a, b>(action: ((arg0: a) => void), result: FSharpResult$2_$union<a, b>): void;
|
|
34
|
-
export declare function Result_ToArray<a, b>(result: FSharpResult$2_$union<a, b>): a[];
|
|
35
|
-
export declare function Result_ToList<a, b>(result: FSharpResult$2_$union<a, b>): FSharpList<a>;
|
|
36
|
-
export declare function Result_ToOption<a, b>(result: FSharpResult$2_$union<a, b>): Option<a>;
|
|
37
|
-
export declare function Result_ToValueOption<a, b>(result: FSharpResult$2_$union<a, b>): Option<a>;
|
package/Seq.d.ts
DELETED
|
@@ -1,164 +0,0 @@
|
|
|
1
|
-
import { IComparer, IEqualityComparer, Nullable, IDisposable, IEnumerator } from "./Util.js";
|
|
2
|
-
import { TypeInfo } from "./Reflection.js";
|
|
3
|
-
import { Option } from "./Option.js";
|
|
4
|
-
import { FSharpList } from "./List.js";
|
|
5
|
-
import { int32 } from "./Int32.js";
|
|
6
|
-
export declare const SR_enumerationAlreadyFinished = "Enumeration already finished.";
|
|
7
|
-
export declare const SR_enumerationNotStarted = "Enumeration has not started. Call MoveNext.";
|
|
8
|
-
export declare const SR_inputSequenceEmpty = "The input sequence was empty.";
|
|
9
|
-
export declare const SR_inputSequenceTooLong = "The input sequence contains more than one element.";
|
|
10
|
-
export declare const SR_keyNotFoundAlt = "An index satisfying the predicate was not found in the collection.";
|
|
11
|
-
export declare const SR_notEnoughElements = "The input sequence has an insufficient number of elements.";
|
|
12
|
-
export declare const SR_resetNotSupported = "Reset is not supported on this enumerator.";
|
|
13
|
-
export declare function Enumerator_noReset<$a>(): $a;
|
|
14
|
-
export declare function Enumerator_notStarted<$a>(): $a;
|
|
15
|
-
export declare function Enumerator_alreadyFinished<$a>(): $a;
|
|
16
|
-
export declare class Enumerator_Seq<T> implements Iterable<T> {
|
|
17
|
-
readonly f: (() => IEnumerator<T>);
|
|
18
|
-
constructor(f: (() => IEnumerator<T>));
|
|
19
|
-
toString(): string;
|
|
20
|
-
GetEnumerator(): IEnumerator<T>;
|
|
21
|
-
[Symbol.iterator](): Iterator<T>;
|
|
22
|
-
"System.Collections.IEnumerable.GetEnumerator"(): IEnumerator<any>;
|
|
23
|
-
}
|
|
24
|
-
export declare function Enumerator_Seq_$reflection(gen0: TypeInfo): TypeInfo;
|
|
25
|
-
export declare function Enumerator_Seq_$ctor_673A07F2<T>(f: (() => IEnumerator<T>)): Enumerator_Seq<T>;
|
|
26
|
-
export declare class Enumerator_FromFunctions$1<T> implements IEnumerator<T>, IDisposable {
|
|
27
|
-
readonly next: (() => boolean);
|
|
28
|
-
readonly dispose: (() => void);
|
|
29
|
-
readonly current: (() => T);
|
|
30
|
-
constructor(current: (() => T), next: (() => boolean), dispose: (() => void));
|
|
31
|
-
"System.Collections.Generic.IEnumerator`1.get_Current"(): T;
|
|
32
|
-
"System.Collections.IEnumerator.get_Current"(): Nullable<any>;
|
|
33
|
-
"System.Collections.IEnumerator.MoveNext"(): boolean;
|
|
34
|
-
"System.Collections.IEnumerator.Reset"(): void;
|
|
35
|
-
Dispose(): void;
|
|
36
|
-
}
|
|
37
|
-
export declare function Enumerator_FromFunctions$1_$reflection(gen0: TypeInfo): TypeInfo;
|
|
38
|
-
export declare function Enumerator_FromFunctions$1_$ctor_58C54629<T>(current: (() => T), next: (() => boolean), dispose: (() => void)): Enumerator_FromFunctions$1<T>;
|
|
39
|
-
export declare function Enumerator_cast<T>(e: IEnumerator<T>): IEnumerator<T>;
|
|
40
|
-
export declare function Enumerator_concat<T, U extends Iterable<T>>(sources: Iterable<U>): IEnumerator<T>;
|
|
41
|
-
export declare function Enumerator_enumerateThenFinally<T>(f: (() => void), e: IEnumerator<T>): IEnumerator<T>;
|
|
42
|
-
export declare function Enumerator_generateWhileSome<T, U>(openf: (() => T), compute: ((arg0: T) => Option<U>), closef: ((arg0: T) => void)): IEnumerator<U>;
|
|
43
|
-
export declare function Enumerator_unfold<State, T>(f: ((arg0: State) => Option<[T, State]>), state: State): IEnumerator<T>;
|
|
44
|
-
export declare function indexNotFound<$a>(): $a;
|
|
45
|
-
export declare function mkSeq<T>(f: (() => IEnumerator<T>)): Iterable<T>;
|
|
46
|
-
export declare function ofSeq<T>(xs: Iterable<T>): IEnumerator<T>;
|
|
47
|
-
export declare function delay<T>(generator: (() => Iterable<T>)): Iterable<T>;
|
|
48
|
-
export declare function concat<Collection extends Iterable<T>, T>(sources: Iterable<Collection>): Iterable<T>;
|
|
49
|
-
export declare function unfold<State, T>(generator: ((arg0: State) => Option<[T, State]>), state: State): Iterable<T>;
|
|
50
|
-
export declare function empty<T>(): Iterable<T>;
|
|
51
|
-
export declare function singleton<T>(x: T): Iterable<T>;
|
|
52
|
-
export declare function ofArray<T>(arr: T[]): Iterable<T>;
|
|
53
|
-
export declare function toArray<T>(xs: Iterable<T>): T[];
|
|
54
|
-
export declare function ofList<T>(xs: FSharpList<T>): Iterable<T>;
|
|
55
|
-
export declare function toList<T>(xs: Iterable<T>): FSharpList<T>;
|
|
56
|
-
export declare function generate<$a, $b>(create: (() => $a), compute: ((arg0: $a) => Option<$b>), dispose: ((arg0: $a) => void)): Iterable<$b>;
|
|
57
|
-
export declare function generateIndexed<$a, $b>(create: (() => $a), compute: ((arg0: int32, arg1: $a) => Option<$b>), dispose: ((arg0: $a) => void)): Iterable<$b>;
|
|
58
|
-
export declare function append<T>(xs: Iterable<T>, ys: Iterable<T>): Iterable<T>;
|
|
59
|
-
export declare function cast<T>(xs: Iterable<T>): Iterable<T>;
|
|
60
|
-
export declare function choose<T, U>(chooser: ((arg0: T) => Option<U>), xs: Iterable<T>): Iterable<U>;
|
|
61
|
-
export declare function compareWith<T>(comparer: ((arg0: T, arg1: T) => int32), xs: Iterable<T>, ys: Iterable<T>): int32;
|
|
62
|
-
export declare function contains<T>(value: T, xs: Iterable<T>, comparer: IEqualityComparer<T>): boolean;
|
|
63
|
-
export declare function enumerateFromFunctions<$a, $b>(create: (() => $a), moveNext: ((arg0: $a) => boolean), current: ((arg0: $a) => $b)): Iterable<$b>;
|
|
64
|
-
export declare function enumerateThenFinally<T>(source: Iterable<T>, compensation: (() => void)): Iterable<T>;
|
|
65
|
-
export declare function enumerateUsing<T extends IDisposable, $a extends Iterable<U>, U>(resource: T, source: ((arg0: T) => $a)): Iterable<U>;
|
|
66
|
-
export declare function enumerateWhile<T>(guard: (() => boolean), xs: Iterable<T>): Iterable<T>;
|
|
67
|
-
export declare function filter<T>(f: ((arg0: T) => boolean), xs: Iterable<T>): Iterable<T>;
|
|
68
|
-
export declare function exists<T>(predicate: ((arg0: T) => boolean), xs: Iterable<T>): boolean;
|
|
69
|
-
export declare function exists2<T1, T2>(predicate: ((arg0: T1, arg1: T2) => boolean), xs: Iterable<T1>, ys: Iterable<T2>): boolean;
|
|
70
|
-
export declare function exactlyOne<T>(xs: Iterable<T>): T;
|
|
71
|
-
export declare function tryExactlyOne<T>(xs: Iterable<T>): Option<T>;
|
|
72
|
-
export declare function tryFind<T>(predicate: ((arg0: T) => boolean), xs: Iterable<T>): Option<T>;
|
|
73
|
-
export declare function find<T>(predicate: ((arg0: T) => boolean), xs: Iterable<T>): T;
|
|
74
|
-
export declare function tryFindBack<T>(predicate: ((arg0: T) => boolean), xs: Iterable<T>): Option<T>;
|
|
75
|
-
export declare function findBack<T>(predicate: ((arg0: T) => boolean), xs: Iterable<T>): T;
|
|
76
|
-
export declare function tryFindIndex<T>(predicate: ((arg0: T) => boolean), xs: Iterable<T>): Option<int32>;
|
|
77
|
-
export declare function findIndex<T>(predicate: ((arg0: T) => boolean), xs: Iterable<T>): int32;
|
|
78
|
-
export declare function tryFindIndexBack<T>(predicate: ((arg0: T) => boolean), xs: Iterable<T>): Option<int32>;
|
|
79
|
-
export declare function findIndexBack<T>(predicate: ((arg0: T) => boolean), xs: Iterable<T>): int32;
|
|
80
|
-
export declare function fold<T, State>(folder: ((arg0: State, arg1: T) => State), state: State, xs: Iterable<T>): State;
|
|
81
|
-
export declare function foldBack<T, State>(folder: ((arg0: T, arg1: any) => any), xs: Iterable<T>, state: any): any;
|
|
82
|
-
export declare function fold2<T1, T2, State>(folder: ((arg0: State, arg1: T1, arg2: T2) => State), state: State, xs: Iterable<T1>, ys: Iterable<T2>): State;
|
|
83
|
-
export declare function foldBack2<T1, T2, State>(folder: ((arg0: T1, arg1: T2, arg2: State) => State), xs: Iterable<T1>, ys: Iterable<T2>, state: State): State;
|
|
84
|
-
export declare function forAll<$a>(predicate: ((arg0: $a) => boolean), xs: Iterable<$a>): boolean;
|
|
85
|
-
export declare function forAll2<$a, $b>(predicate: ((arg0: $a, arg1: $b) => boolean), xs: Iterable<$a>, ys: Iterable<$b>): boolean;
|
|
86
|
-
export declare function tryHead<T>(xs: Iterable<T>): Option<T>;
|
|
87
|
-
export declare function head<T>(xs: Iterable<T>): T;
|
|
88
|
-
export declare function initialize<$a>(count: int32, f: ((arg0: int32) => $a)): Iterable<$a>;
|
|
89
|
-
export declare function initializeInfinite<$a>(f: ((arg0: int32) => $a)): Iterable<$a>;
|
|
90
|
-
export declare function isEmpty<T>(xs: Iterable<T>): boolean;
|
|
91
|
-
export declare function tryItem<T>(index: int32, xs: Iterable<T>): Option<T>;
|
|
92
|
-
export declare function item<T>(index: int32, xs: Iterable<T>): T;
|
|
93
|
-
export declare function iterate<$a>(action: ((arg0: $a) => void), xs: Iterable<$a>): void;
|
|
94
|
-
export declare function iterate2<$a, $b>(action: ((arg0: $a, arg1: $b) => void), xs: Iterable<$a>, ys: Iterable<$b>): void;
|
|
95
|
-
export declare function iterateIndexed<$a>(action: ((arg0: int32, arg1: $a) => void), xs: Iterable<$a>): void;
|
|
96
|
-
export declare function iterateIndexed2<$a, $b>(action: ((arg0: int32, arg1: $a, arg2: $b) => void), xs: Iterable<$a>, ys: Iterable<$b>): void;
|
|
97
|
-
export declare function tryLast<T>(xs: Iterable<T>): Option<T>;
|
|
98
|
-
export declare function last<T>(xs: Iterable<T>): T;
|
|
99
|
-
export declare function length<T>(xs: Iterable<T>): int32;
|
|
100
|
-
export declare function map<T, U>(mapping: ((arg0: T) => U), xs: Iterable<T>): Iterable<U>;
|
|
101
|
-
export declare function mapIndexed<T, U>(mapping: ((arg0: int32, arg1: T) => U), xs: Iterable<T>): Iterable<U>;
|
|
102
|
-
export declare function indexed<T>(xs: Iterable<T>): Iterable<[int32, T]>;
|
|
103
|
-
export declare function map2<T1, T2, U>(mapping: ((arg0: T1, arg1: T2) => U), xs: Iterable<T1>, ys: Iterable<T2>): Iterable<U>;
|
|
104
|
-
export declare function mapIndexed2<T1, T2, U>(mapping: ((arg0: int32, arg1: T1, arg2: T2) => U), xs: Iterable<T1>, ys: Iterable<T2>): Iterable<U>;
|
|
105
|
-
export declare function map3<T1, T2, T3, U>(mapping: ((arg0: T1, arg1: T2, arg2: T3) => U), xs: Iterable<T1>, ys: Iterable<T2>, zs: Iterable<T3>): Iterable<U>;
|
|
106
|
-
export declare function readOnly<T>(xs: Iterable<T>): Iterable<T>;
|
|
107
|
-
export declare class CachedSeq$1<T> implements Iterable<T>, IDisposable {
|
|
108
|
-
readonly res: Iterable<T>;
|
|
109
|
-
readonly cleanup: (() => void);
|
|
110
|
-
constructor(cleanup: (() => void), res: Iterable<T>);
|
|
111
|
-
Dispose(): void;
|
|
112
|
-
GetEnumerator(): IEnumerator<T>;
|
|
113
|
-
[Symbol.iterator](): Iterator<T>;
|
|
114
|
-
"System.Collections.IEnumerable.GetEnumerator"(): IEnumerator<any>;
|
|
115
|
-
}
|
|
116
|
-
export declare function CachedSeq$1_$reflection(gen0: TypeInfo): TypeInfo;
|
|
117
|
-
export declare function CachedSeq$1_$ctor_Z7A8347D4<T>(cleanup: (() => void), res: Iterable<T>): CachedSeq$1<T>;
|
|
118
|
-
export declare function CachedSeq$1__Clear<T>(_: CachedSeq$1<T>): void;
|
|
119
|
-
export declare function cache<T>(source: Iterable<T>): Iterable<T>;
|
|
120
|
-
export declare function allPairs<T1, T2>(xs: Iterable<T1>, ys: Iterable<T2>): Iterable<[T1, T2]>;
|
|
121
|
-
export declare function mapFold<State, T, Result>(mapping: ((arg0: State, arg1: T) => [Result, State]), state: State, xs: Iterable<T>): [Iterable<Result>, State];
|
|
122
|
-
export declare function mapFoldBack<T, State, Result>(mapping: ((arg0: T, arg1: State) => [Result, State]), xs: Iterable<T>, state: State): [Iterable<Result>, State];
|
|
123
|
-
export declare function tryPick<T, $a>(chooser: ((arg0: T) => Option<$a>), xs: Iterable<T>): Option<$a>;
|
|
124
|
-
export declare function pick<T, $a>(chooser: ((arg0: T) => Option<$a>), xs: Iterable<T>): $a;
|
|
125
|
-
export declare function reduce<T>(folder: ((arg0: T, arg1: T) => T), xs: Iterable<T>): T;
|
|
126
|
-
export declare function reduceBack<T>(folder: ((arg0: T, arg1: T) => T), xs: Iterable<T>): T;
|
|
127
|
-
export declare function replicate<$a>(n: int32, x: $a): Iterable<$a>;
|
|
128
|
-
export declare function reverse<T>(xs: Iterable<T>): Iterable<T>;
|
|
129
|
-
export declare function scan<State, T>(folder: ((arg0: State, arg1: T) => State), state: State, xs: Iterable<T>): Iterable<State>;
|
|
130
|
-
export declare function scanBack<T, State>(folder: ((arg0: T, arg1: State) => State), xs: Iterable<T>, state: State): Iterable<State>;
|
|
131
|
-
export declare function skip<T>(count: int32, source: Iterable<T>): Iterable<T>;
|
|
132
|
-
export declare function skipWhile<T>(predicate: ((arg0: T) => boolean), xs: Iterable<T>): Iterable<T>;
|
|
133
|
-
export declare function tail<T>(xs: Iterable<T>): Iterable<T>;
|
|
134
|
-
export declare function take<T>(count: int32, xs: Iterable<T>): Iterable<T>;
|
|
135
|
-
export declare function takeWhile<T>(predicate: ((arg0: T) => boolean), xs: Iterable<T>): Iterable<T>;
|
|
136
|
-
export declare function truncate<T>(count: int32, xs: Iterable<T>): Iterable<T>;
|
|
137
|
-
export declare function zip<T1, T2>(xs: Iterable<T1>, ys: Iterable<T2>): Iterable<[T1, T2]>;
|
|
138
|
-
export declare function zip3<T1, T2, T3>(xs: Iterable<T1>, ys: Iterable<T2>, zs: Iterable<T3>): Iterable<[T1, T2, T3]>;
|
|
139
|
-
export declare function collect<T, Collection extends Iterable<U>, U>(mapping: ((arg0: T) => Collection), xs: Iterable<T>): Iterable<U>;
|
|
140
|
-
export declare function where<T>(predicate: ((arg0: T) => boolean), xs: Iterable<T>): Iterable<T>;
|
|
141
|
-
export declare function pairwise<T>(xs: Iterable<T>): Iterable<[T, T]>;
|
|
142
|
-
export declare function splitInto<T>(chunks: int32, xs: Iterable<T>): Iterable<T[]>;
|
|
143
|
-
export declare function windowed<T>(windowSize: int32, xs: Iterable<T>): Iterable<T[]>;
|
|
144
|
-
export declare function transpose<$a extends Iterable<T>, T>(xss: Iterable<$a>): Iterable<Iterable<T>>;
|
|
145
|
-
export declare function sortWith<T>(comparer: ((arg0: T, arg1: T) => int32), xs: Iterable<T>): Iterable<T>;
|
|
146
|
-
export declare function sort<T>(xs: Iterable<T>, comparer: IComparer<T>): Iterable<T>;
|
|
147
|
-
export declare function sortBy<T, U>(projection: ((arg0: T) => U), xs: Iterable<T>, comparer: IComparer<U>): Iterable<T>;
|
|
148
|
-
export declare function sortDescending<T>(xs: Iterable<T>, comparer: IComparer<T>): Iterable<T>;
|
|
149
|
-
export declare function sortByDescending<T, U>(projection: ((arg0: T) => U), xs: Iterable<T>, comparer: IComparer<U>): Iterable<T>;
|
|
150
|
-
export declare function sum<T>(xs: Iterable<T>, adder: any): T;
|
|
151
|
-
export declare function sumBy<T, U>(f: ((arg0: T) => U), xs: Iterable<T>, adder: any): U;
|
|
152
|
-
export declare function maxBy<T, U>(projection: ((arg0: T) => U), xs: Iterable<T>, comparer: IComparer<U>): T;
|
|
153
|
-
export declare function max<T>(xs: Iterable<T>, comparer: IComparer<T>): T;
|
|
154
|
-
export declare function minBy<T, U>(projection: ((arg0: T) => U), xs: Iterable<T>, comparer: IComparer<U>): T;
|
|
155
|
-
export declare function min<T>(xs: Iterable<T>, comparer: IComparer<T>): T;
|
|
156
|
-
export declare function average<T>(xs: Iterable<T>, averager: any): T;
|
|
157
|
-
export declare function averageBy<T, U>(f: ((arg0: T) => U), xs: Iterable<T>, averager: any): U;
|
|
158
|
-
export declare function permute<T>(f: ((arg0: int32) => int32), xs: Iterable<T>): Iterable<T>;
|
|
159
|
-
export declare function chunkBySize<T>(chunkSize: int32, xs: Iterable<T>): Iterable<T[]>;
|
|
160
|
-
export declare function insertAt<T>(index: int32, y: T, xs: Iterable<T>): Iterable<T>;
|
|
161
|
-
export declare function insertManyAt<T>(index: int32, ys: Iterable<T>, xs: Iterable<T>): Iterable<T>;
|
|
162
|
-
export declare function removeAt<T>(index: int32, xs: Iterable<T>): Iterable<T>;
|
|
163
|
-
export declare function removeManyAt<T>(index: int32, count: int32, xs: Iterable<T>): Iterable<T>;
|
|
164
|
-
export declare function updateAt<T>(index: int32, y: T, xs: Iterable<T>): Iterable<T>;
|
package/Seq2.d.ts
DELETED
|
@@ -1,18 +0,0 @@
|
|
|
1
|
-
import { IEqualityComparer } from "./Util.js";
|
|
2
|
-
import { int32 } from "./Int32.js";
|
|
3
|
-
import { FSharpList } from "./List.js";
|
|
4
|
-
export declare function distinct<T>(xs: Iterable<T>, comparer: IEqualityComparer<T>): Iterable<T>;
|
|
5
|
-
export declare function distinctBy<T, Key>(projection: ((arg0: T) => Key), xs: Iterable<T>, comparer: IEqualityComparer<Key>): Iterable<T>;
|
|
6
|
-
export declare function except<T>(itemsToExclude: Iterable<T>, xs: Iterable<T>, comparer: IEqualityComparer<T>): Iterable<T>;
|
|
7
|
-
export declare function countBy<T, Key>(projection: ((arg0: T) => Key), xs: Iterable<T>, comparer: IEqualityComparer<Key>): Iterable<[Key, int32]>;
|
|
8
|
-
export declare function groupBy<T, Key>(projection: ((arg0: T) => Key), xs: Iterable<T>, comparer: IEqualityComparer<Key>): Iterable<[Key, Iterable<T>]>;
|
|
9
|
-
export declare function Array_distinct<T>(xs: T[], comparer: IEqualityComparer<T>): T[];
|
|
10
|
-
export declare function Array_distinctBy<T, Key>(projection: ((arg0: T) => Key), xs: T[], comparer: IEqualityComparer<Key>): T[];
|
|
11
|
-
export declare function Array_except<T>(itemsToExclude: Iterable<T>, xs: T[], comparer: IEqualityComparer<T>): T[];
|
|
12
|
-
export declare function Array_countBy<T, Key>(projection: ((arg0: T) => Key), xs: T[], comparer: IEqualityComparer<Key>): [Key, int32][];
|
|
13
|
-
export declare function Array_groupBy<T, Key>(projection: ((arg0: T) => Key), xs: T[], comparer: IEqualityComparer<Key>): [Key, T[]][];
|
|
14
|
-
export declare function List_distinct<T>(xs: FSharpList<T>, comparer: IEqualityComparer<T>): FSharpList<T>;
|
|
15
|
-
export declare function List_distinctBy<T, Key>(projection: ((arg0: T) => Key), xs: FSharpList<T>, comparer: IEqualityComparer<Key>): FSharpList<T>;
|
|
16
|
-
export declare function List_except<T>(itemsToExclude: Iterable<T>, xs: FSharpList<T>, comparer: IEqualityComparer<T>): FSharpList<T>;
|
|
17
|
-
export declare function List_countBy<T, Key>(projection: ((arg0: T) => Key), xs: FSharpList<T>, comparer: IEqualityComparer<Key>): FSharpList<[Key, int32]>;
|
|
18
|
-
export declare function List_groupBy<T, Key>(projection: ((arg0: T) => Key), xs: FSharpList<T>, comparer: IEqualityComparer<Key>): FSharpList<[Key, FSharpList<T>]>;
|
package/Set.d.ts
DELETED
|
@@ -1,190 +0,0 @@
|
|
|
1
|
-
import { TypeInfo } from "./Reflection.js";
|
|
2
|
-
import { Option } from "./Option.js";
|
|
3
|
-
import { int32 } from "./Int32.js";
|
|
4
|
-
import { ISet, IEnumerator, IComparer, Nullable } from "./Util.js";
|
|
5
|
-
import { Record } from "./Types.js";
|
|
6
|
-
import { FSharpList } from "./List.js";
|
|
7
|
-
export declare class SetTreeLeaf$1<T> {
|
|
8
|
-
readonly k: T;
|
|
9
|
-
constructor(k: T);
|
|
10
|
-
}
|
|
11
|
-
export declare function SetTreeLeaf$1_$reflection(gen0: TypeInfo): TypeInfo;
|
|
12
|
-
export declare function SetTreeLeaf$1_$ctor_2B595<T>(k: T): SetTreeLeaf$1<T>;
|
|
13
|
-
export declare function SetTreeLeaf$1__get_Key<T>(_: SetTreeLeaf$1<T>): T;
|
|
14
|
-
export declare class SetTreeNode$1<T> extends SetTreeLeaf$1<T> {
|
|
15
|
-
readonly right: Option<SetTreeLeaf$1<T>>;
|
|
16
|
-
readonly left: Option<SetTreeLeaf$1<T>>;
|
|
17
|
-
readonly h: int32;
|
|
18
|
-
constructor(v: T, left: Option<SetTreeLeaf$1<T>>, right: Option<SetTreeLeaf$1<T>>, h: int32);
|
|
19
|
-
}
|
|
20
|
-
export declare function SetTreeNode$1_$reflection(gen0: TypeInfo): TypeInfo;
|
|
21
|
-
export declare function SetTreeNode$1_$ctor_5F465FC9<T>(v: T, left: Option<SetTreeLeaf$1<T>>, right: Option<SetTreeLeaf$1<T>>, h: int32): SetTreeNode$1<T>;
|
|
22
|
-
export declare function SetTreeNode$1__get_Left<T>(_: SetTreeNode$1<T>): Option<SetTreeLeaf$1<T>>;
|
|
23
|
-
export declare function SetTreeNode$1__get_Right<T>(_: SetTreeNode$1<T>): Option<SetTreeLeaf$1<T>>;
|
|
24
|
-
export declare function SetTreeNode$1__get_Height<T>(_: SetTreeNode$1<T>): int32;
|
|
25
|
-
export declare function SetTreeModule_empty<T>(): Option<SetTreeLeaf$1<T>>;
|
|
26
|
-
export declare function SetTreeModule_countAux<T>(t_mut: Option<SetTreeLeaf$1<T>>, acc_mut: int32): int32;
|
|
27
|
-
export declare function SetTreeModule_count<$a>(s: Option<SetTreeLeaf$1<$a>>): int32;
|
|
28
|
-
export declare function SetTreeModule_mk<T>(l: Option<SetTreeLeaf$1<T>>, k: T, r: Option<SetTreeLeaf$1<T>>): Option<SetTreeLeaf$1<T>>;
|
|
29
|
-
export declare function SetTreeModule_rebalance<T>(t1: Option<SetTreeLeaf$1<T>>, v: T, t2: Option<SetTreeLeaf$1<T>>): Option<SetTreeLeaf$1<T>>;
|
|
30
|
-
export declare function SetTreeModule_add<T>(comparer: IComparer<T>, k: T, t: Option<SetTreeLeaf$1<T>>): Option<SetTreeLeaf$1<T>>;
|
|
31
|
-
export declare function SetTreeModule_balance<T>(comparer: IComparer<T>, t1: Option<SetTreeLeaf$1<T>>, k: T, t2: Option<SetTreeLeaf$1<T>>): Option<SetTreeLeaf$1<T>>;
|
|
32
|
-
export declare function SetTreeModule_split<T>(comparer: IComparer<T>, pivot: Nullable<T>, t: Option<SetTreeLeaf$1<T>>): [Option<SetTreeLeaf$1<T>>, boolean, Option<SetTreeLeaf$1<T>>];
|
|
33
|
-
export declare function SetTreeModule_spliceOutSuccessor<T>(t: Option<SetTreeLeaf$1<T>>): [T, Option<SetTreeLeaf$1<T>>];
|
|
34
|
-
export declare function SetTreeModule_remove<T>(comparer: IComparer<T>, k: Nullable<T>, t: Option<SetTreeLeaf$1<T>>): Option<SetTreeLeaf$1<T>>;
|
|
35
|
-
export declare function SetTreeModule_mem<T>(comparer_mut: IComparer<T>, k_mut: Nullable<T>, t_mut: Option<SetTreeLeaf$1<T>>): boolean;
|
|
36
|
-
export declare function SetTreeModule_iter<T>(f_mut: ((arg0: T) => void), t_mut: Option<SetTreeLeaf$1<T>>): void;
|
|
37
|
-
export declare function SetTreeModule_foldBackOpt<T, $a>(f_mut: any, t_mut: Option<SetTreeLeaf$1<T>>, x_mut: $a): $a;
|
|
38
|
-
export declare function SetTreeModule_foldBack<$a, $b>(f: ((arg0: $a, arg1: $b) => $b), m: Option<SetTreeLeaf$1<$a>>, x: $b): $b;
|
|
39
|
-
export declare function SetTreeModule_foldOpt<$a, T>(f_mut: any, x_mut: $a, t_mut: Option<SetTreeLeaf$1<T>>): $a;
|
|
40
|
-
export declare function SetTreeModule_fold<$a, $b>(f: ((arg0: $a, arg1: $b) => $a), x: $a, m: Option<SetTreeLeaf$1<$b>>): $a;
|
|
41
|
-
export declare function SetTreeModule_forall<T>(f_mut: ((arg0: T) => boolean), t_mut: Option<SetTreeLeaf$1<T>>): boolean;
|
|
42
|
-
export declare function SetTreeModule_exists<T>(f_mut: ((arg0: T) => boolean), t_mut: Option<SetTreeLeaf$1<T>>): boolean;
|
|
43
|
-
export declare function SetTreeModule_subset<$a>(comparer: IComparer<$a>, a: Option<SetTreeLeaf$1<$a>>, b: Option<SetTreeLeaf$1<$a>>): boolean;
|
|
44
|
-
export declare function SetTreeModule_properSubset<T>(comparer: IComparer<T>, a: Option<SetTreeLeaf$1<T>>, b: Option<SetTreeLeaf$1<T>>): boolean;
|
|
45
|
-
export declare function SetTreeModule_filterAux<T>(comparer_mut: IComparer<T>, f_mut: ((arg0: T) => boolean), t_mut: Option<SetTreeLeaf$1<T>>, acc_mut: Option<SetTreeLeaf$1<T>>): Option<SetTreeLeaf$1<T>>;
|
|
46
|
-
export declare function SetTreeModule_filter<$a>(comparer: IComparer<$a>, f: ((arg0: $a) => boolean), s: Option<SetTreeLeaf$1<$a>>): Option<SetTreeLeaf$1<$a>>;
|
|
47
|
-
export declare function SetTreeModule_diffAux<T>(comparer_mut: IComparer<T>, t_mut: Option<SetTreeLeaf$1<T>>, acc_mut: Option<SetTreeLeaf$1<T>>): Option<SetTreeLeaf$1<T>>;
|
|
48
|
-
export declare function SetTreeModule_diff<$a>(comparer: IComparer<$a>, a: Option<SetTreeLeaf$1<$a>>, b: Option<SetTreeLeaf$1<$a>>): Option<SetTreeLeaf$1<$a>>;
|
|
49
|
-
export declare function SetTreeModule_union<T>(comparer: IComparer<T>, t1: Option<SetTreeLeaf$1<T>>, t2: Option<SetTreeLeaf$1<T>>): Option<SetTreeLeaf$1<T>>;
|
|
50
|
-
export declare function SetTreeModule_intersectionAux<T>(comparer_mut: IComparer<T>, b_mut: Option<SetTreeLeaf$1<T>>, t_mut: Option<SetTreeLeaf$1<T>>, acc_mut: Option<SetTreeLeaf$1<T>>): Option<SetTreeLeaf$1<T>>;
|
|
51
|
-
export declare function SetTreeModule_intersection<$a>(comparer: IComparer<$a>, a: Option<SetTreeLeaf$1<$a>>, b: Option<SetTreeLeaf$1<$a>>): Option<SetTreeLeaf$1<$a>>;
|
|
52
|
-
export declare function SetTreeModule_partition1<$a>(comparer: IComparer<$a>, f: ((arg0: $a) => boolean), k: $a, acc1: Option<SetTreeLeaf$1<$a>>, acc2: Option<SetTreeLeaf$1<$a>>): [Option<SetTreeLeaf$1<$a>>, Option<SetTreeLeaf$1<$a>>];
|
|
53
|
-
export declare function SetTreeModule_partitionAux<T>(comparer_mut: IComparer<T>, f_mut: ((arg0: T) => boolean), t_mut: Option<SetTreeLeaf$1<T>>, acc__mut: Option<SetTreeLeaf$1<T>>, acc__1_mut: Option<SetTreeLeaf$1<T>>): [Option<SetTreeLeaf$1<T>>, Option<SetTreeLeaf$1<T>>];
|
|
54
|
-
export declare function SetTreeModule_partition<$a>(comparer: IComparer<$a>, f: ((arg0: $a) => boolean), s: Option<SetTreeLeaf$1<$a>>): [Option<SetTreeLeaf$1<$a>>, Option<SetTreeLeaf$1<$a>>];
|
|
55
|
-
export declare function SetTreeModule_minimumElementAux<T>(t_mut: Option<SetTreeLeaf$1<T>>, n_mut: T): T;
|
|
56
|
-
export declare function SetTreeModule_minimumElementOpt<T>(t: Option<SetTreeLeaf$1<T>>): Option<T>;
|
|
57
|
-
export declare function SetTreeModule_maximumElementAux<T>(t_mut: Option<SetTreeLeaf$1<T>>, n_mut: T): T;
|
|
58
|
-
export declare function SetTreeModule_maximumElementOpt<T>(t: Option<SetTreeLeaf$1<T>>): Option<T>;
|
|
59
|
-
export declare function SetTreeModule_minimumElement<$a>(s: Option<SetTreeLeaf$1<$a>>): $a;
|
|
60
|
-
export declare function SetTreeModule_maximumElement<$a>(s: Option<SetTreeLeaf$1<$a>>): $a;
|
|
61
|
-
export declare class SetTreeModule_SetIterator$1<T> extends Record {
|
|
62
|
-
stack: FSharpList<Option<SetTreeLeaf$1<T>>>;
|
|
63
|
-
started: boolean;
|
|
64
|
-
constructor(stack: FSharpList<Option<SetTreeLeaf$1<T>>>, started: boolean);
|
|
65
|
-
}
|
|
66
|
-
export declare function SetTreeModule_SetIterator$1_$reflection(gen0: TypeInfo): TypeInfo;
|
|
67
|
-
export declare function SetTreeModule_collapseLHS<T>(stack_mut: FSharpList<Option<SetTreeLeaf$1<T>>>): FSharpList<Option<SetTreeLeaf$1<T>>>;
|
|
68
|
-
export declare function SetTreeModule_mkIterator<$a>(s: Option<SetTreeLeaf$1<$a>>): SetTreeModule_SetIterator$1<$a>;
|
|
69
|
-
export declare function SetTreeModule_notStarted<$a>(): $a;
|
|
70
|
-
export declare function SetTreeModule_alreadyFinished<$a>(): $a;
|
|
71
|
-
export declare function SetTreeModule_current<$a>(i: SetTreeModule_SetIterator$1<$a>): $a;
|
|
72
|
-
export declare function SetTreeModule_moveNext<T>(i: SetTreeModule_SetIterator$1<T>): boolean;
|
|
73
|
-
export declare function SetTreeModule_mkIEnumerator<a>(s: Option<SetTreeLeaf$1<a>>): IEnumerator<a>;
|
|
74
|
-
/**
|
|
75
|
-
* Set comparison. Note this can be expensive.
|
|
76
|
-
*/
|
|
77
|
-
export declare function SetTreeModule_compareStacks<T>(comparer_mut: IComparer<T>, l1_mut: FSharpList<Option<SetTreeLeaf$1<T>>>, l2_mut: FSharpList<Option<SetTreeLeaf$1<T>>>): int32;
|
|
78
|
-
export declare function SetTreeModule_compare<T>(comparer: IComparer<T>, t1: Option<SetTreeLeaf$1<T>>, t2: Option<SetTreeLeaf$1<T>>): int32;
|
|
79
|
-
export declare function SetTreeModule_choose<$a>(s: Option<SetTreeLeaf$1<$a>>): $a;
|
|
80
|
-
export declare function SetTreeModule_toList<T>(t: Option<SetTreeLeaf$1<T>>): FSharpList<T>;
|
|
81
|
-
export declare function SetTreeModule_copyToArray<$a>(s: Option<SetTreeLeaf$1<$a>>, arr: $a[], i: int32): void;
|
|
82
|
-
export declare function SetTreeModule_toArray<$a>(s: Option<SetTreeLeaf$1<$a>>): $a[];
|
|
83
|
-
export declare function SetTreeModule_mkFromEnumerator<$a>(comparer_mut: IComparer<$a>, acc_mut: Option<SetTreeLeaf$1<$a>>, e_mut: IEnumerator<$a>): Option<SetTreeLeaf$1<$a>>;
|
|
84
|
-
export declare function SetTreeModule_ofArray<$a>(comparer: IComparer<$a>, l: $a[]): Option<SetTreeLeaf$1<$a>>;
|
|
85
|
-
export declare function SetTreeModule_ofList<$a>(comparer: IComparer<$a>, l: FSharpList<$a>): Option<SetTreeLeaf$1<$a>>;
|
|
86
|
-
export declare function SetTreeModule_ofSeq<T>(comparer: IComparer<T>, c: Iterable<T>): Option<SetTreeLeaf$1<T>>;
|
|
87
|
-
export declare class FSharpSet<T> implements ISet<T>, Iterable<T>, Iterable<T> {
|
|
88
|
-
readonly tree: Option<SetTreeLeaf$1<T>>;
|
|
89
|
-
readonly comparer: IComparer<T>;
|
|
90
|
-
constructor(comparer: IComparer<T>, tree: Option<SetTreeLeaf$1<T>>);
|
|
91
|
-
GetHashCode(): int32;
|
|
92
|
-
Equals(other: Nullable<any>): boolean;
|
|
93
|
-
toString(): string;
|
|
94
|
-
get [Symbol.toStringTag](): string;
|
|
95
|
-
toJSON(): any;
|
|
96
|
-
CompareTo(other: Nullable<any>): int32;
|
|
97
|
-
"System.Collections.Generic.ICollection`1.Add2B595"(x: T): void;
|
|
98
|
-
"System.Collections.Generic.ICollection`1.Clear"(): void;
|
|
99
|
-
"System.Collections.Generic.ICollection`1.Remove2B595"(x: T): boolean;
|
|
100
|
-
"System.Collections.Generic.ICollection`1.Contains2B595"(x: T): boolean;
|
|
101
|
-
"System.Collections.Generic.ICollection`1.CopyToZ3B4C077E"(arr: T[], i: int32): void;
|
|
102
|
-
"System.Collections.Generic.ICollection`1.get_IsReadOnly"(): boolean;
|
|
103
|
-
"System.Collections.Generic.ICollection`1.get_Count"(): int32;
|
|
104
|
-
"System.Collections.Generic.IReadOnlyCollection`1.get_Count"(): int32;
|
|
105
|
-
GetEnumerator(): IEnumerator<T>;
|
|
106
|
-
[Symbol.iterator](): Iterator<T>;
|
|
107
|
-
"System.Collections.IEnumerable.GetEnumerator"(): IEnumerator<any>;
|
|
108
|
-
get size(): int32;
|
|
109
|
-
add(k: T): ISet<T>;
|
|
110
|
-
clear(): void;
|
|
111
|
-
delete(k: T): boolean;
|
|
112
|
-
has(k: T): boolean;
|
|
113
|
-
keys(): Iterable<T>;
|
|
114
|
-
values(): Iterable<T>;
|
|
115
|
-
entries(): Iterable<[T, T]>;
|
|
116
|
-
forEach(f: ((arg0: T, arg1: T, arg2: ISet<T>) => void), thisArg?: Option<any>): void;
|
|
117
|
-
}
|
|
118
|
-
export declare function FSharpSet_$reflection(gen0: TypeInfo): TypeInfo;
|
|
119
|
-
export declare function FSharpSet_$ctor<T>(comparer: IComparer<T>, tree: Option<SetTreeLeaf$1<T>>): FSharpSet<T>;
|
|
120
|
-
export declare function FSharpSet__get_Comparer<T>(set$: FSharpSet<T>): IComparer<T>;
|
|
121
|
-
export declare function FSharpSet__get_Tree<T>(set$: FSharpSet<T>): Option<SetTreeLeaf$1<T>>;
|
|
122
|
-
export declare function FSharpSet_Empty<T>(comparer: IComparer<T>): FSharpSet<T>;
|
|
123
|
-
export declare function FSharpSet__Add<T>(s: FSharpSet<T>, value: T): FSharpSet<T>;
|
|
124
|
-
export declare function FSharpSet__Remove<T>(s: FSharpSet<T>, value: Nullable<T>): FSharpSet<T>;
|
|
125
|
-
export declare function FSharpSet__get_Count<T>(s: FSharpSet<T>): int32;
|
|
126
|
-
export declare function FSharpSet__Contains<T>(s: FSharpSet<T>, value: Nullable<T>): boolean;
|
|
127
|
-
export declare function FSharpSet__Iterate<T>(s: FSharpSet<T>, x: ((arg0: T) => void)): void;
|
|
128
|
-
export declare function FSharpSet__Fold<T, $a>(s: FSharpSet<T>, f: ((arg0: T, arg1: $a) => $a), z: $a): $a;
|
|
129
|
-
export declare function FSharpSet__get_IsEmpty<T>(s: FSharpSet<T>): boolean;
|
|
130
|
-
export declare function FSharpSet__Partition<T>(s: FSharpSet<T>, f: ((arg0: T) => boolean)): [FSharpSet<T>, FSharpSet<T>];
|
|
131
|
-
export declare function FSharpSet__Filter<T>(s: FSharpSet<T>, f: ((arg0: T) => boolean)): FSharpSet<T>;
|
|
132
|
-
export declare function FSharpSet__Map<T, U>(s: FSharpSet<T>, f: ((arg0: T) => U), comparer: IComparer<U>): FSharpSet<U>;
|
|
133
|
-
export declare function FSharpSet__Exists<T>(s: FSharpSet<T>, f: ((arg0: T) => boolean)): boolean;
|
|
134
|
-
export declare function FSharpSet__ForAll<T>(s: FSharpSet<T>, f: ((arg0: T) => boolean)): boolean;
|
|
135
|
-
export declare function FSharpSet_op_Subtraction<T>(set1: FSharpSet<T>, set2: FSharpSet<T>): FSharpSet<T>;
|
|
136
|
-
export declare function FSharpSet_op_Addition<T>(set1: FSharpSet<T>, set2: FSharpSet<T>): FSharpSet<T>;
|
|
137
|
-
export declare function FSharpSet_Intersection<T>(a: FSharpSet<T>, b: FSharpSet<T>): FSharpSet<T>;
|
|
138
|
-
export declare function FSharpSet_IntersectionMany<T>(sets: Iterable<FSharpSet<T>>): FSharpSet<T>;
|
|
139
|
-
export declare function FSharpSet_Equality<T>(a: FSharpSet<T>, b: FSharpSet<T>): boolean;
|
|
140
|
-
export declare function FSharpSet_Compare<T>(a: FSharpSet<T>, b: FSharpSet<T>): int32;
|
|
141
|
-
export declare function FSharpSet__get_Choose<T>(x: FSharpSet<T>): T;
|
|
142
|
-
export declare function FSharpSet__get_MinimumElement<T>(x: FSharpSet<T>): T;
|
|
143
|
-
export declare function FSharpSet__get_MaximumElement<T>(x: FSharpSet<T>): T;
|
|
144
|
-
export declare function FSharpSet__IsSubsetOf<T>(x: FSharpSet<T>, otherSet: FSharpSet<T>): boolean;
|
|
145
|
-
export declare function FSharpSet__IsSupersetOf<T>(x: FSharpSet<T>, otherSet: FSharpSet<T>): boolean;
|
|
146
|
-
export declare function FSharpSet__IsProperSubsetOf<T>(x: FSharpSet<T>, otherSet: FSharpSet<T>): boolean;
|
|
147
|
-
export declare function FSharpSet__IsProperSupersetOf<T>(x: FSharpSet<T>, otherSet: FSharpSet<T>): boolean;
|
|
148
|
-
export declare function FSharpSet__ToList<T>(x: FSharpSet<T>): FSharpList<T>;
|
|
149
|
-
export declare function FSharpSet__ToArray<T>(x: FSharpSet<T>): T[];
|
|
150
|
-
export declare function FSharpSet__ComputeHashCode<T>(this$: FSharpSet<T>): int32;
|
|
151
|
-
export declare function isEmpty<T>(set$: FSharpSet<T>): boolean;
|
|
152
|
-
export declare function contains<T>(element: Nullable<T>, set$: FSharpSet<T>): boolean;
|
|
153
|
-
export declare function add<T>(value: T, set$: FSharpSet<T>): FSharpSet<T>;
|
|
154
|
-
export declare function singleton<T>(value: T, comparer: IComparer<T>): FSharpSet<T>;
|
|
155
|
-
export declare function remove<T>(value: Nullable<T>, set$: FSharpSet<T>): FSharpSet<T>;
|
|
156
|
-
export declare function union<T>(set1: FSharpSet<T>, set2: FSharpSet<T>): FSharpSet<T>;
|
|
157
|
-
export declare function unionMany<T>(sets: Iterable<FSharpSet<T>>, comparer: IComparer<T>): FSharpSet<T>;
|
|
158
|
-
export declare function intersect<T>(set1: FSharpSet<T>, set2: FSharpSet<T>): FSharpSet<T>;
|
|
159
|
-
export declare function intersectMany<T>(sets: Iterable<FSharpSet<T>>): FSharpSet<T>;
|
|
160
|
-
export declare function iterate<T>(action: ((arg0: T) => void), set$: FSharpSet<T>): void;
|
|
161
|
-
export declare function empty<T>(comparer: IComparer<T>): FSharpSet<T>;
|
|
162
|
-
export declare function forAll<T>(predicate: ((arg0: T) => boolean), set$: FSharpSet<T>): boolean;
|
|
163
|
-
export declare function exists<T>(predicate: ((arg0: T) => boolean), set$: FSharpSet<T>): boolean;
|
|
164
|
-
export declare function filter<T>(predicate: ((arg0: T) => boolean), set$: FSharpSet<T>): FSharpSet<T>;
|
|
165
|
-
export declare function partition<T>(predicate: ((arg0: T) => boolean), set$: FSharpSet<T>): [FSharpSet<T>, FSharpSet<T>];
|
|
166
|
-
export declare function fold<T, State>(folder: ((arg0: State, arg1: T) => State), state: State, set$: FSharpSet<T>): State;
|
|
167
|
-
export declare function foldBack<T, State>(folder: ((arg0: T, arg1: State) => State), set$: FSharpSet<T>, state: State): State;
|
|
168
|
-
export declare function map<T, U>(mapping: ((arg0: T) => U), set$: FSharpSet<T>, comparer: IComparer<U>): FSharpSet<U>;
|
|
169
|
-
export declare function count<T>(set$: FSharpSet<T>): int32;
|
|
170
|
-
export declare function ofList<T>(elements: Iterable<T>, comparer: IComparer<T>): FSharpSet<T>;
|
|
171
|
-
export declare function ofArray<T>(array: T[], comparer: IComparer<T>): FSharpSet<T>;
|
|
172
|
-
export declare function toList<T>(set$: FSharpSet<T>): FSharpList<T>;
|
|
173
|
-
export declare function toArray<T>(set$: FSharpSet<T>): T[];
|
|
174
|
-
export declare function toSeq<T>(set$: FSharpSet<T>): Iterable<T>;
|
|
175
|
-
export declare function ofSeq<T>(elements: Iterable<T>, comparer: IComparer<T>): FSharpSet<T>;
|
|
176
|
-
export declare function difference<T>(set1: FSharpSet<T>, set2: FSharpSet<T>): FSharpSet<T>;
|
|
177
|
-
export declare function isSubset<T>(set1: FSharpSet<T>, set2: FSharpSet<T>): boolean;
|
|
178
|
-
export declare function isSuperset<T>(set1: FSharpSet<T>, set2: FSharpSet<T>): boolean;
|
|
179
|
-
export declare function isProperSubset<T>(set1: FSharpSet<T>, set2: FSharpSet<T>): boolean;
|
|
180
|
-
export declare function isProperSuperset<T>(set1: FSharpSet<T>, set2: FSharpSet<T>): boolean;
|
|
181
|
-
export declare function minElement<T>(set$: FSharpSet<T>): T;
|
|
182
|
-
export declare function maxElement<T>(set$: FSharpSet<T>): T;
|
|
183
|
-
export declare function unionWith<T>(s1: ISet<T>, s2: Iterable<T>): ISet<T>;
|
|
184
|
-
export declare function newMutableSetWith<T>(s1: ISet<T>, s2: Iterable<T>): ISet<T>;
|
|
185
|
-
export declare function intersectWith<T>(s1: ISet<T>, s2: Iterable<T>): void;
|
|
186
|
-
export declare function exceptWith<T>(s1: ISet<T>, s2: Iterable<T>): void;
|
|
187
|
-
export declare function isSubsetOf<T>(s1: ISet<T>, s2: Iterable<T>): boolean;
|
|
188
|
-
export declare function isSupersetOf<T>(s1: ISet<T>, s2: Iterable<T>): boolean;
|
|
189
|
-
export declare function isProperSubsetOf<T>(s1: ISet<T>, s2: Iterable<T>): boolean;
|
|
190
|
-
export declare function isProperSupersetOf<T>(s1: ISet<T>, s2: Iterable<T>): boolean;
|