This repository was archived by the owner on Oct 12, 2022. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 1.8k
/
Copy pathBase.ts
68 lines (59 loc) · 1.67 KB
/
Base.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
///<reference path="Driver.ts"/>
namespace Base {
export interface IList<T> {
isHead: boolean;
next: IList<T>;
prev: IList<T>;
data: T;
insertAfter(entry: IList<T>): IList<T>;
insertBefore(entry: IList<T>): IList<T>;
empty(): boolean;
}
export class List<T> implements IList<T> {
next: IList<T>;
prev: IList<T>;
constructor(public isHead: boolean, public data: T) { }
empty(): boolean {
return this.next == this;
}
insertAfter(entry: IList<T>): IList<T> {
entry.next = this.next;
entry.prev = this;
this.next = entry;
entry.next.prev = entry;
return (entry);
}
insertBefore(entry: IList<T>): IList<T> {
this.prev.next = entry;
entry.next = this;
entry.prev = this.prev;
this.prev = entry;
return entry;
}
}
export function listMakeEntry<T>(data: T): IList<T> {
var entry: List<T> = new List<T>(false, data);
entry.prev = entry;
entry.next = entry;
return entry;
}
export function listMakeHead<T>(): IList<T> {
var entry: List<T> = new List(true, null);
entry.prev = entry;
entry.next = entry;
return entry;
}
export function listRemove<T>(entry: IList<T>): IList<T> {
if (entry == null) {
return null;
}
else if (entry.isHead) {
return null;
}
else {
entry.next.prev = entry.prev;
entry.prev.next = entry.next;
}
return (entry);
}
}