repositories
/
poolifier.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
build(deps-dev): apply updates
[poolifier.git]
/
src
/
deque.ts
diff --git
a/src/deque.ts
b/src/deque.ts
index fe82a79896a08757e3f261b66aa364b1407ab6e9..0d55f5b665115b3c5efc2580fcdb56562926b340 100644
(file)
--- a/
src/deque.ts
+++ b/
src/deque.ts
@@
-1,19
+1,15
@@
-// Copyright Jerome Benoit. 2023. All Rights Reserved.
+// Copyright Jerome Benoit. 2023
-2024
. All Rights Reserved.
/**
/**
- *
Nod
e.
+ *
Linked list node interfac
e.
*
*
- * @typeParam T - Type of node data.
+ * @typeParam T - Type of
linked list
node data.
* @internal
*/
* @internal
*/
-export class Node<T> {
- public data: T
- public next?: Node<T>
- public prev?: Node<T>
-
- public constructor (data: T) {
- this.data = data
- }
+export interface ILinkedListNode<T> {
+ data: T
+ next?: ILinkedListNode<T>
+ prev?: ILinkedListNode<T>
}
/**
}
/**
@@
-24,8
+20,8
@@
export class Node<T> {
* @internal
*/
export class Deque<T> {
* @internal
*/
export class Deque<T> {
- private head?: Node<T>
- private tail?: Node<T>
+ private head?:
ILinkedList
Node<T>
+ private tail?:
ILinkedList
Node<T>
/** The size of the deque. */
public size!: number
/** The maximum size of the deque. */
/** The size of the deque. */
public size!: number
/** The maximum size of the deque. */
@@
-42,7
+38,7
@@
export class Deque<T> {
* @returns The new size of the queue.
*/
public push (data: T): number {
* @returns The new size of the queue.
*/
public push (data: T): number {
- const node
= new Node(data)
+ const node
: ILinkedListNode<T> = { data }
if (this.tail == null) {
this.head = this.tail = node
} else {
if (this.tail == null) {
this.head = this.tail = node
} else {
@@
-59,7
+55,7
@@
export class Deque<T> {
* @returns The new size of the queue.
*/
public unshift (data: T): number {
* @returns The new size of the queue.
*/
public unshift (data: T): number {
- const node
= new Node(data)
+ const node
: ILinkedListNode<T> = { data }
if (this.head == null) {
this.head = this.tail = node
} else {
if (this.head == null) {
this.head = this.tail = node
} else {