-
Notifications
You must be signed in to change notification settings - Fork 0
/
index.ts
129 lines (120 loc) · 3.37 KB
/
index.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
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
// deno-lint-ignore no-explicit-any
export default interface MyCircularDeque<T = any> {
isEmpty: () => boolean;
getFront: () => T | number;
deleteFront: () => boolean;
insertLast: (value: T) => boolean;
insertFront: (value: T) => boolean;
deleteLast: () => boolean;
getRear: () => T | number;
isFull: () => boolean;
max_size: number;
}
// deno-lint-ignore no-explicit-any
export default function MyCircularDeque<T = any>(
k = Infinity,
): MyCircularDeque<T> {
// console.log('MyCircularDeque', k)
if (k < 1) throw Error("k greater than or equal one");
const storage = new Map<bigint, T>();
let min = BigInt(0);
let max = BigInt(0);
const initial = 0n;
// function storage.size { return storage.size }
function insertLast(value: T): boolean {
if (isFull()) return false;
if (storage.size) {
storage.set(max + 1n, value);
max++;
} else {
storage.set(initial, value);
max = initial;
}
// console.log('insertLast', value, storage)
return true;
}
function deleteFront(): boolean {
if (isEmpty()) return false;
else {
storage.delete(min);
min++;
// console.log('deleteFront', storage)
if (storage.size === 0) {
min = initial;
}
return true;
}
// if (storage.has(min)) {
// // const r = storage.get(min);
// storage.delete(min);
// min++;
// max--
// console.log('deleteFront', storage)
// return true
// } else { return false }
// return r as T;
}
function getFront(): T | number {
// console.log('getFront', storage)
if (isEmpty()) return -1;
const r = storage.get(min);
return r as T;
}
function isEmpty(): boolean {
return 0 === storage.size;
}
function insertFront(value: T): boolean {
if (isFull()) return false;
if (storage.size) {
storage.set(min - 1n, value);
min--;
} else {
storage.set(initial, value);
min = initial;
}
// storage.set(min - 1n, value);
// min--;
// max++
// console.log('insertFront', value, storage)
return true;
}
function deleteLast(): boolean {
if (isEmpty()) return false;
else {
storage.delete(max);
max--;
// console.log('deleteLast', storage)
if (storage.size === 0) {
max = initial;
}
return true;
}
// if (storage.has(max - 1n + min)) {
// // const r = storage.get(min);
// storage.delete(max - 1n + min);
// max--;
// console.log('deleteLast', storage)
// return true
// } else { return false }
}
function getRear(): T | number {
// console.log('getRear', storage)
if (isEmpty()) return -1;
const r = storage.get(max);
return r as T;
}
function isFull(): boolean {
return storage.size >= k;
}
return {
isEmpty,
getFront,
deleteFront,
insertLast,
insertFront,
deleteLast,
getRear,
isFull,
max_size: k,
};
}