@optimystic/db-core 1.5.0 → 1.5.1
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/README.md +336 -336
- package/dist/src/collection/collection.d.ts +44 -4
- package/dist/src/collection/collection.d.ts.map +1 -1
- package/dist/src/collection/collection.js +95 -14
- package/dist/src/collection/collection.js.map +1 -1
- package/dist/src/log/log.d.ts +41 -8
- package/dist/src/log/log.d.ts.map +1 -1
- package/dist/src/log/log.js +15 -10
- package/dist/src/log/log.js.map +1 -1
- package/dist/src/testing/test-transactor.d.ts +36 -0
- package/dist/src/testing/test-transactor.d.ts.map +1 -1
- package/dist/src/testing/test-transactor.js +49 -0
- package/dist/src/testing/test-transactor.js.map +1 -1
- package/dist/src/transaction/coordinator.d.ts.map +1 -1
- package/dist/src/transaction/coordinator.js +26 -9
- package/dist/src/transaction/coordinator.js.map +1 -1
- package/package.json +1 -1
- package/src/blocks/block-store.ts +31 -31
- package/src/blocks/block-types.ts +11 -11
- package/src/blocks/index.ts +5 -5
- package/src/blocks/structs.ts +17 -17
- package/src/btree/btree.ts +872 -872
- package/src/btree/independent-trunk.ts +53 -53
- package/src/btree/index.ts +5 -5
- package/src/btree/key-range.ts +15 -15
- package/src/btree/keyset.ts +6 -6
- package/src/btree/nodes.ts +25 -25
- package/src/btree/path.ts +37 -37
- package/src/btree/tree-block.ts +11 -11
- package/src/btree/trunk.ts +14 -14
- package/src/chain/chain-nodes.ts +26 -26
- package/src/chain/chain.ts +349 -349
- package/src/chain/index.ts +3 -3
- package/src/cluster/i-cluster.ts +6 -6
- package/src/cluster/index.ts +3 -3
- package/src/cohort-topic/addressing.ts +120 -120
- package/src/cohort-topic/antidos/bootstrap-evidence.ts +106 -106
- package/src/cohort-topic/antidos/index.ts +5 -5
- package/src/cohort-topic/antidos/rate-limiter.ts +210 -210
- package/src/cohort-topic/antidos/replay-guard.ts +146 -146
- package/src/cohort-topic/antidos/topic-budget.ts +160 -160
- package/src/cohort-topic/antiflood/index.ts +2 -2
- package/src/cohort-topic/antiflood/invariants.ts +108 -108
- package/src/cohort-topic/antiflood/jitter.ts +117 -117
- package/src/cohort-topic/coldstart.ts +237 -237
- package/src/cohort-topic/dmax.ts +88 -88
- package/src/cohort-topic/gossip/bus.ts +254 -254
- package/src/cohort-topic/gossip/index.ts +3 -3
- package/src/cohort-topic/gossip/records.ts +45 -45
- package/src/cohort-topic/gossip/view.ts +91 -91
- package/src/cohort-topic/index.ts +20 -20
- package/src/cohort-topic/load/barometer.ts +134 -134
- package/src/cohort-topic/load/index.ts +1 -1
- package/src/cohort-topic/member-engine.ts +430 -430
- package/src/cohort-topic/membership/index.ts +3 -3
- package/src/cohort-topic/membership/publisher.ts +163 -163
- package/src/cohort-topic/membership/source.ts +41 -41
- package/src/cohort-topic/ports.ts +157 -157
- package/src/cohort-topic/promotion.ts +477 -477
- package/src/cohort-topic/registration/bytes.ts +37 -37
- package/src/cohort-topic/registration/handoff.ts +154 -154
- package/src/cohort-topic/registration/index.ts +6 -6
- package/src/cohort-topic/registration/renewal.ts +495 -495
- package/src/cohort-topic/registration/sharding.ts +61 -61
- package/src/cohort-topic/registration/store.ts +81 -81
- package/src/cohort-topic/registration/types.ts +91 -91
- package/src/cohort-topic/ring-hash.ts +50 -50
- package/src/cohort-topic/service.ts +416 -416
- package/src/cohort-topic/sig/index.ts +2 -2
- package/src/cohort-topic/sig/payloads.ts +59 -59
- package/src/cohort-topic/sig/threshold.ts +64 -64
- package/src/cohort-topic/tiers.ts +74 -74
- package/src/cohort-topic/traffic.ts +233 -233
- package/src/cohort-topic/walk.ts +326 -326
- package/src/cohort-topic/willingness.ts +237 -237
- package/src/cohort-topic/wire/index.ts +18 -18
- package/src/cohort-topic/wire/payloads.ts +126 -126
- package/src/collection/action.ts +48 -48
- package/src/collection/collection-type-registry.ts +37 -37
- package/src/collection/collection.ts +2203 -2118
- package/src/collection/index.ts +4 -4
- package/src/collections/diary/index.ts +2 -2
- package/src/collections/diary/struct.ts +3 -3
- package/src/collections/index.ts +2 -2
- package/src/collections/tree/collection-trunk.ts +25 -25
- package/src/collections/tree/index.ts +2 -2
- package/src/collections/tree/readme.md +55 -55
- package/src/log/index.ts +2 -2
- package/src/log/log.ts +304 -268
- package/src/log/struct.ts +165 -165
- package/src/matchmaking/capability-filter.ts +45 -45
- package/src/matchmaking/config.ts +98 -98
- package/src/matchmaking/index.ts +21 -21
- package/src/matchmaking/multi-cohort-seeker.ts +234 -234
- package/src/matchmaking/provider.ts +123 -123
- package/src/matchmaking/query-eval.ts +105 -105
- package/src/matchmaking/seeker-walk.ts +127 -127
- package/src/matchmaking/seeker.ts +86 -86
- package/src/matchmaking/topic-anchor.ts +90 -90
- package/src/matchmaking/voting-quorum.ts +394 -394
- package/src/network/i-peer-network.ts +25 -25
- package/src/network/repo-protocol.ts +13 -13
- package/src/network/types.ts +37 -37
- package/src/reactivity/backfill.ts +220 -220
- package/src/reactivity/backpressure.ts +191 -191
- package/src/reactivity/checkpoint.ts +308 -308
- package/src/reactivity/config.ts +172 -172
- package/src/reactivity/dedupe.ts +132 -132
- package/src/reactivity/forwarder.ts +87 -87
- package/src/reactivity/index.ts +34 -34
- package/src/reactivity/notification.ts +123 -123
- package/src/reactivity/policy.ts +79 -79
- package/src/reactivity/push-state.ts +310 -310
- package/src/reactivity/recover.ts +153 -153
- package/src/reactivity/replay-buffer.ts +141 -141
- package/src/reactivity/resume.ts +549 -549
- package/src/reactivity/rotation.ts +415 -415
- package/src/reactivity/subscriber.ts +132 -132
- package/src/reactivity/subscription.ts +66 -66
- package/src/reactivity/topic-anchor.ts +71 -71
- package/src/reactivity/verify.ts +73 -73
- package/src/reactivity/wire-validate.ts +13 -13
- package/src/testing/async-wait.ts +65 -65
- package/src/testing/index.ts +2 -2
- package/src/testing/test-transactor.ts +62 -0
- package/src/transaction/actions-engine.ts +68 -68
- package/src/transaction/coordinator.ts +28 -11
- package/src/transaction/index.ts +52 -52
- package/src/transaction/operations-hash.ts +196 -196
- package/src/transaction/read-dependency-collector.ts +78 -78
- package/src/transaction/session.ts +238 -238
- package/src/transaction/transaction.ts +442 -442
- package/src/transaction/validator.ts +197 -197
- package/src/transactor/block-floors.ts +126 -126
- package/src/transactor/index.ts +6 -6
- package/src/transactor/network-transactor.ts +1545 -1545
- package/src/transform/atomic-proxy.ts +92 -92
- package/src/transform/cache-source.ts +370 -370
- package/src/transform/helpers.ts +164 -164
- package/src/transform/index.ts +7 -7
- package/src/transform/struct.ts +21 -21
- package/src/utility/actor.ts +62 -62
- package/src/utility/backoff.ts +95 -95
- package/src/utility/batch-coordinator.ts +191 -191
- package/src/utility/ensured.ts +32 -32
- package/src/utility/groupby.ts +18 -18
- package/src/utility/hash-string.ts +14 -14
- package/src/utility/is-record-empty.ts +5 -5
- package/src/utility/latches.ts +42 -42
- package/src/utility/lru-map.ts +60 -60
- package/src/utility/nameof.ts +7 -7
- package/src/utility/pending.ts +43 -43
package/src/utility/groupby.ts
CHANGED
|
@@ -1,18 +1,18 @@
|
|
|
1
|
-
// TODO: replace the usage of this with Object.groupBy in newer ES once more pervasive
|
|
2
|
-
|
|
3
|
-
/**
|
|
4
|
-
* Groups an array of items by a key selector function.
|
|
5
|
-
* @param array - The array of items to group.
|
|
6
|
-
* @param keySelector - The function that selects the key for each item.
|
|
7
|
-
* @returns An object where each key is a unique value from the key selector function, and each value is an array of items that have that key.
|
|
8
|
-
*/
|
|
9
|
-
export function groupBy<T, K extends string | number | symbol>(
|
|
10
|
-
array: T[],
|
|
11
|
-
keySelector: (item: T) => K
|
|
12
|
-
): Record<K, T[]> {
|
|
13
|
-
return array.reduce((acc, item) => {
|
|
14
|
-
const key = keySelector(item);
|
|
15
|
-
(acc[key] ??= []).push(item);
|
|
16
|
-
return acc;
|
|
17
|
-
}, {} as Record<K, T[]>);
|
|
18
|
-
}
|
|
1
|
+
// TODO: replace the usage of this with Object.groupBy in newer ES once more pervasive
|
|
2
|
+
|
|
3
|
+
/**
|
|
4
|
+
* Groups an array of items by a key selector function.
|
|
5
|
+
* @param array - The array of items to group.
|
|
6
|
+
* @param keySelector - The function that selects the key for each item.
|
|
7
|
+
* @returns An object where each key is a unique value from the key selector function, and each value is an array of items that have that key.
|
|
8
|
+
*/
|
|
9
|
+
export function groupBy<T, K extends string | number | symbol>(
|
|
10
|
+
array: T[],
|
|
11
|
+
keySelector: (item: T) => K
|
|
12
|
+
): Record<K, T[]> {
|
|
13
|
+
return array.reduce((acc, item) => {
|
|
14
|
+
const key = keySelector(item);
|
|
15
|
+
(acc[key] ??= []).push(item);
|
|
16
|
+
return acc;
|
|
17
|
+
}, {} as Record<K, T[]>);
|
|
18
|
+
}
|
|
@@ -1,14 +1,14 @@
|
|
|
1
|
-
import { sha256 } from 'multiformats/hashes/sha2';
|
|
2
|
-
import { toString } from 'uint8arrays/to-string';
|
|
3
|
-
|
|
4
|
-
/**
|
|
5
|
-
* SHA-256 string hash function.
|
|
6
|
-
*
|
|
7
|
-
* @param str - The string to hash
|
|
8
|
-
* @returns A base64url-encoded SHA-256 hash string
|
|
9
|
-
*/
|
|
10
|
-
export async function hashString(str: string): Promise<string> {
|
|
11
|
-
const input = new TextEncoder().encode(str);
|
|
12
|
-
const mh = await sha256.digest(input);
|
|
13
|
-
return toString(mh.digest, 'base64url');
|
|
14
|
-
}
|
|
1
|
+
import { sha256 } from 'multiformats/hashes/sha2';
|
|
2
|
+
import { toString } from 'uint8arrays/to-string';
|
|
3
|
+
|
|
4
|
+
/**
|
|
5
|
+
* SHA-256 string hash function.
|
|
6
|
+
*
|
|
7
|
+
* @param str - The string to hash
|
|
8
|
+
* @returns A base64url-encoded SHA-256 hash string
|
|
9
|
+
*/
|
|
10
|
+
export async function hashString(str: string): Promise<string> {
|
|
11
|
+
const input = new TextEncoder().encode(str);
|
|
12
|
+
const mh = await sha256.digest(input);
|
|
13
|
+
return toString(mh.digest, 'base64url');
|
|
14
|
+
}
|
|
@@ -1,5 +1,5 @@
|
|
|
1
|
-
/** True if the given object has no keys. This should not be used for classes or objects with proto fields. */
|
|
2
|
-
export function isRecordEmpty<T>(record: Record<string, T>): boolean {
|
|
3
|
-
for (const _key in record) return false;
|
|
4
|
-
return true;
|
|
5
|
-
}
|
|
1
|
+
/** True if the given object has no keys. This should not be used for classes or objects with proto fields. */
|
|
2
|
+
export function isRecordEmpty<T>(record: Record<string, T>): boolean {
|
|
3
|
+
for (const _key in record) return false;
|
|
4
|
+
return true;
|
|
5
|
+
}
|
package/src/utility/latches.ts
CHANGED
|
@@ -1,42 +1,42 @@
|
|
|
1
|
-
/** Lightweight implementation of a mutex lock queue. */
|
|
2
|
-
export class Latches {
|
|
3
|
-
// Stores the promise representing the completion of the last queued operation for a key.
|
|
4
|
-
private static lockQueues = new Map<string, Promise<void>>();
|
|
5
|
-
|
|
6
|
-
/**
|
|
7
|
-
* Acquires a lock for the given key. Waits if another operation holds the lock.
|
|
8
|
-
* Returns a release function that must be called to release the lock.
|
|
9
|
-
* WARNING: The key scope is global to the entire process, so follow the convention of using `ClassName.methodName:${id}` to avoid conflicts.
|
|
10
|
-
*/
|
|
11
|
-
static async acquire(key: string): Promise<() => void> {
|
|
12
|
-
// Get the promise the current operation needs to wait for (if any)
|
|
13
|
-
const currentTail = this.lockQueues.get(key) ?? Promise.resolve();
|
|
14
|
-
|
|
15
|
-
let resolveNewTail: () => void;
|
|
16
|
-
// Create the promise that the *next* operation will wait for
|
|
17
|
-
const newTail = new Promise<void>(resolve => {
|
|
18
|
-
resolveNewTail = resolve;
|
|
19
|
-
});
|
|
20
|
-
|
|
21
|
-
// Immediately set the new promise as the tail for this key
|
|
22
|
-
this.lockQueues.set(key, newTail);
|
|
23
|
-
|
|
24
|
-
// Wait for the previous operation (if any) to complete
|
|
25
|
-
await currentTail;
|
|
26
|
-
|
|
27
|
-
// Lock acquired. Return the function to release *this* lock.
|
|
28
|
-
const release = () => {
|
|
29
|
-
// Signal that this operation is complete, allowing the next awaiter (if any)
|
|
30
|
-
resolveNewTail();
|
|
31
|
-
|
|
32
|
-
// Optimization: If this promise is still the current tail in the map,
|
|
33
|
-
// it means no other operation queued up behind this one while it was running.
|
|
34
|
-
// We can safely remove the entry from the map to prevent unbounded growth.
|
|
35
|
-
if (this.lockQueues.get(key) === newTail) {
|
|
36
|
-
this.lockQueues.delete(key);
|
|
37
|
-
}
|
|
38
|
-
};
|
|
39
|
-
|
|
40
|
-
return release;
|
|
41
|
-
}
|
|
42
|
-
}
|
|
1
|
+
/** Lightweight implementation of a mutex lock queue. */
|
|
2
|
+
export class Latches {
|
|
3
|
+
// Stores the promise representing the completion of the last queued operation for a key.
|
|
4
|
+
private static lockQueues = new Map<string, Promise<void>>();
|
|
5
|
+
|
|
6
|
+
/**
|
|
7
|
+
* Acquires a lock for the given key. Waits if another operation holds the lock.
|
|
8
|
+
* Returns a release function that must be called to release the lock.
|
|
9
|
+
* WARNING: The key scope is global to the entire process, so follow the convention of using `ClassName.methodName:${id}` to avoid conflicts.
|
|
10
|
+
*/
|
|
11
|
+
static async acquire(key: string): Promise<() => void> {
|
|
12
|
+
// Get the promise the current operation needs to wait for (if any)
|
|
13
|
+
const currentTail = this.lockQueues.get(key) ?? Promise.resolve();
|
|
14
|
+
|
|
15
|
+
let resolveNewTail: () => void;
|
|
16
|
+
// Create the promise that the *next* operation will wait for
|
|
17
|
+
const newTail = new Promise<void>(resolve => {
|
|
18
|
+
resolveNewTail = resolve;
|
|
19
|
+
});
|
|
20
|
+
|
|
21
|
+
// Immediately set the new promise as the tail for this key
|
|
22
|
+
this.lockQueues.set(key, newTail);
|
|
23
|
+
|
|
24
|
+
// Wait for the previous operation (if any) to complete
|
|
25
|
+
await currentTail;
|
|
26
|
+
|
|
27
|
+
// Lock acquired. Return the function to release *this* lock.
|
|
28
|
+
const release = () => {
|
|
29
|
+
// Signal that this operation is complete, allowing the next awaiter (if any)
|
|
30
|
+
resolveNewTail();
|
|
31
|
+
|
|
32
|
+
// Optimization: If this promise is still the current tail in the map,
|
|
33
|
+
// it means no other operation queued up behind this one while it was running.
|
|
34
|
+
// We can safely remove the entry from the map to prevent unbounded growth.
|
|
35
|
+
if (this.lockQueues.get(key) === newTail) {
|
|
36
|
+
this.lockQueues.delete(key);
|
|
37
|
+
}
|
|
38
|
+
};
|
|
39
|
+
|
|
40
|
+
return release;
|
|
41
|
+
}
|
|
42
|
+
}
|
package/src/utility/lru-map.ts
CHANGED
|
@@ -1,60 +1,60 @@
|
|
|
1
|
-
/**
|
|
2
|
-
* A simple LRU (Least Recently Used) map backed by JavaScript's Map insertion order.
|
|
3
|
-
* Accessing or setting an entry refreshes it to the most-recently-used position.
|
|
4
|
-
* When the map exceeds maxSize, the least-recently-used entry is evicted.
|
|
5
|
-
*/
|
|
6
|
-
export class LruMap<K, V> {
|
|
7
|
-
private readonly map = new Map<K, V>();
|
|
8
|
-
|
|
9
|
-
constructor(private readonly maxSize: number) {
|
|
10
|
-
if (maxSize < 1) throw new Error('LruMap maxSize must be >= 1');
|
|
11
|
-
}
|
|
12
|
-
|
|
13
|
-
get(key: K): V | undefined {
|
|
14
|
-
const value = this.map.get(key);
|
|
15
|
-
if (value !== undefined) {
|
|
16
|
-
// Refresh: delete and re-insert to move to end (most recent)
|
|
17
|
-
this.map.delete(key);
|
|
18
|
-
this.map.set(key, value);
|
|
19
|
-
}
|
|
20
|
-
return value;
|
|
21
|
-
}
|
|
22
|
-
|
|
23
|
-
/** Read without refreshing recency — for observation passes that must not reshape eviction order. */
|
|
24
|
-
peek(key: K): V | undefined {
|
|
25
|
-
return this.map.get(key);
|
|
26
|
-
}
|
|
27
|
-
|
|
28
|
-
set(key: K, value: V): this {
|
|
29
|
-
// If already present, delete first to refresh position
|
|
30
|
-
if (this.map.has(key)) {
|
|
31
|
-
this.map.delete(key);
|
|
32
|
-
} else if (this.map.size >= this.maxSize) {
|
|
33
|
-
// Evict the oldest (first) entry
|
|
34
|
-
const oldest = this.map.keys().next().value!;
|
|
35
|
-
this.map.delete(oldest);
|
|
36
|
-
}
|
|
37
|
-
this.map.set(key, value);
|
|
38
|
-
return this;
|
|
39
|
-
}
|
|
40
|
-
|
|
41
|
-
has(key: K): boolean {
|
|
42
|
-
return this.map.has(key);
|
|
43
|
-
}
|
|
44
|
-
|
|
45
|
-
delete(key: K): boolean {
|
|
46
|
-
return this.map.delete(key);
|
|
47
|
-
}
|
|
48
|
-
|
|
49
|
-
clear(): void {
|
|
50
|
-
this.map.clear();
|
|
51
|
-
}
|
|
52
|
-
|
|
53
|
-
get size(): number {
|
|
54
|
-
return this.map.size;
|
|
55
|
-
}
|
|
56
|
-
|
|
57
|
-
[Symbol.iterator](): IterableIterator<[K, V]> {
|
|
58
|
-
return this.map[Symbol.iterator]();
|
|
59
|
-
}
|
|
60
|
-
}
|
|
1
|
+
/**
|
|
2
|
+
* A simple LRU (Least Recently Used) map backed by JavaScript's Map insertion order.
|
|
3
|
+
* Accessing or setting an entry refreshes it to the most-recently-used position.
|
|
4
|
+
* When the map exceeds maxSize, the least-recently-used entry is evicted.
|
|
5
|
+
*/
|
|
6
|
+
export class LruMap<K, V> {
|
|
7
|
+
private readonly map = new Map<K, V>();
|
|
8
|
+
|
|
9
|
+
constructor(private readonly maxSize: number) {
|
|
10
|
+
if (maxSize < 1) throw new Error('LruMap maxSize must be >= 1');
|
|
11
|
+
}
|
|
12
|
+
|
|
13
|
+
get(key: K): V | undefined {
|
|
14
|
+
const value = this.map.get(key);
|
|
15
|
+
if (value !== undefined) {
|
|
16
|
+
// Refresh: delete and re-insert to move to end (most recent)
|
|
17
|
+
this.map.delete(key);
|
|
18
|
+
this.map.set(key, value);
|
|
19
|
+
}
|
|
20
|
+
return value;
|
|
21
|
+
}
|
|
22
|
+
|
|
23
|
+
/** Read without refreshing recency — for observation passes that must not reshape eviction order. */
|
|
24
|
+
peek(key: K): V | undefined {
|
|
25
|
+
return this.map.get(key);
|
|
26
|
+
}
|
|
27
|
+
|
|
28
|
+
set(key: K, value: V): this {
|
|
29
|
+
// If already present, delete first to refresh position
|
|
30
|
+
if (this.map.has(key)) {
|
|
31
|
+
this.map.delete(key);
|
|
32
|
+
} else if (this.map.size >= this.maxSize) {
|
|
33
|
+
// Evict the oldest (first) entry
|
|
34
|
+
const oldest = this.map.keys().next().value!;
|
|
35
|
+
this.map.delete(oldest);
|
|
36
|
+
}
|
|
37
|
+
this.map.set(key, value);
|
|
38
|
+
return this;
|
|
39
|
+
}
|
|
40
|
+
|
|
41
|
+
has(key: K): boolean {
|
|
42
|
+
return this.map.has(key);
|
|
43
|
+
}
|
|
44
|
+
|
|
45
|
+
delete(key: K): boolean {
|
|
46
|
+
return this.map.delete(key);
|
|
47
|
+
}
|
|
48
|
+
|
|
49
|
+
clear(): void {
|
|
50
|
+
this.map.clear();
|
|
51
|
+
}
|
|
52
|
+
|
|
53
|
+
get size(): number {
|
|
54
|
+
return this.map.size;
|
|
55
|
+
}
|
|
56
|
+
|
|
57
|
+
[Symbol.iterator](): IterableIterator<[K, V]> {
|
|
58
|
+
return this.map[Symbol.iterator]();
|
|
59
|
+
}
|
|
60
|
+
}
|
package/src/utility/nameof.ts
CHANGED
|
@@ -1,7 +1,7 @@
|
|
|
1
|
-
/* eslint-disable no-redeclare, @typescript-eslint/explicit-module-boundary-types, @typescript-eslint/no-explicit-any */
|
|
2
|
-
export function nameof<TObject>(obj: TObject, key: keyof TObject): string;
|
|
3
|
-
export function nameof<TObject>(key: keyof TObject): string;
|
|
4
|
-
export function nameof(key1: any, key2?: any): any {
|
|
5
|
-
return key2 ?? key1;
|
|
6
|
-
}
|
|
7
|
-
/* eslint-enable */
|
|
1
|
+
/* eslint-disable no-redeclare, @typescript-eslint/explicit-module-boundary-types, @typescript-eslint/no-explicit-any */
|
|
2
|
+
export function nameof<TObject>(obj: TObject, key: keyof TObject): string;
|
|
3
|
+
export function nameof<TObject>(key: keyof TObject): string;
|
|
4
|
+
export function nameof(key1: any, key2?: any): any {
|
|
5
|
+
return key2 ?? key1;
|
|
6
|
+
}
|
|
7
|
+
/* eslint-enable */
|
package/src/utility/pending.ts
CHANGED
|
@@ -1,43 +1,43 @@
|
|
|
1
|
-
export class Pending<T> {
|
|
2
|
-
response?: T;
|
|
3
|
-
error?: unknown;
|
|
4
|
-
private _responded = false;
|
|
5
|
-
t1 = Date.now();
|
|
6
|
-
duration?: number;
|
|
7
|
-
|
|
8
|
-
get isResponse(): boolean {
|
|
9
|
-
return this._responded;
|
|
10
|
-
}
|
|
11
|
-
|
|
12
|
-
get isError(): boolean {
|
|
13
|
-
return this.error !== undefined;
|
|
14
|
-
}
|
|
15
|
-
|
|
16
|
-
get isComplete(): boolean {
|
|
17
|
-
return this.isResponse || this.isError;
|
|
18
|
-
}
|
|
19
|
-
|
|
20
|
-
async result(): Promise<T> {
|
|
21
|
-
if (this.isResponse) {
|
|
22
|
-
return this.response!;
|
|
23
|
-
}
|
|
24
|
-
if (this.isError) {
|
|
25
|
-
throw this.error!;
|
|
26
|
-
}
|
|
27
|
-
return await this.promise;
|
|
28
|
-
}
|
|
29
|
-
|
|
30
|
-
constructor(
|
|
31
|
-
public promise: Promise<T>
|
|
32
|
-
) {
|
|
33
|
-
promise.then(response => {
|
|
34
|
-
this.duration = Date.now() - this.t1;
|
|
35
|
-
this.response = response;
|
|
36
|
-
this._responded = true;
|
|
37
|
-
return response;
|
|
38
|
-
}, error => {
|
|
39
|
-
this.duration = Date.now() - this.t1;
|
|
40
|
-
this.error = error;
|
|
41
|
-
});
|
|
42
|
-
}
|
|
43
|
-
}
|
|
1
|
+
export class Pending<T> {
|
|
2
|
+
response?: T;
|
|
3
|
+
error?: unknown;
|
|
4
|
+
private _responded = false;
|
|
5
|
+
t1 = Date.now();
|
|
6
|
+
duration?: number;
|
|
7
|
+
|
|
8
|
+
get isResponse(): boolean {
|
|
9
|
+
return this._responded;
|
|
10
|
+
}
|
|
11
|
+
|
|
12
|
+
get isError(): boolean {
|
|
13
|
+
return this.error !== undefined;
|
|
14
|
+
}
|
|
15
|
+
|
|
16
|
+
get isComplete(): boolean {
|
|
17
|
+
return this.isResponse || this.isError;
|
|
18
|
+
}
|
|
19
|
+
|
|
20
|
+
async result(): Promise<T> {
|
|
21
|
+
if (this.isResponse) {
|
|
22
|
+
return this.response!;
|
|
23
|
+
}
|
|
24
|
+
if (this.isError) {
|
|
25
|
+
throw this.error!;
|
|
26
|
+
}
|
|
27
|
+
return await this.promise;
|
|
28
|
+
}
|
|
29
|
+
|
|
30
|
+
constructor(
|
|
31
|
+
public promise: Promise<T>
|
|
32
|
+
) {
|
|
33
|
+
promise.then(response => {
|
|
34
|
+
this.duration = Date.now() - this.t1;
|
|
35
|
+
this.response = response;
|
|
36
|
+
this._responded = true;
|
|
37
|
+
return response;
|
|
38
|
+
}, error => {
|
|
39
|
+
this.duration = Date.now() - this.t1;
|
|
40
|
+
this.error = error;
|
|
41
|
+
});
|
|
42
|
+
}
|
|
43
|
+
}
|