-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathglobal.d.ts
44 lines (37 loc) · 1.07 KB
/
global.d.ts
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
declare type Point = {
x: number;
y: number;
}
declare type ListNode<T> = {
value: T,
next?: ListNode<T>,
prev?: ListNode<T>,
}
declare interface List<T> {
get length(): number;
removeAt(index: number): T | undefined;
remove(item: T): T | undefined;
get(index: number): T | undefined;
prepend(item: T): void;
append(item: T): void;
insertAt(item: T, idx: number): void;
}
declare type CompleteGraphEdge = { from: number; to: number; weight: number };
declare type GraphEdge = { to: number; weight: number };
declare type WeightedAdjacencyList = GraphEdge[][];
declare type WeightedAdjacencyMatrix = number[][]; // A number means weight
declare type AdjacencyList = number[][];
declare type AdjacencyMatrix = number[][]; // A 1 means connected
declare type BinaryNode<T> = {
value: T;
left: BinaryNode<T> | null;
right: BinaryNode<T> | null;
};
declare type GeneralNode<T> = {
value: T;
children: GeneralNode<T>[];
};
declare interface ILRU<K, V> {
update(key: K, value: V): void;
get(key: K): V | undefined;
}