From f6566479607fe0cf62346a6a45d369de44d79d27 Mon Sep 17 00:00:00 2001
From: Sean Derrow <sean.derrow@gmail.com>
Date: Sun, 22 Dec 2024 15:49:46 -0600
Subject: [PATCH] Capture null returns in type definitions

---
 src/maxPriorityQueue.d.ts | 8 ++++----
 src/minPriorityQueue.d.ts | 8 ++++----
 src/priorityQueue.d.ts    | 8 ++++----
 3 files changed, 12 insertions(+), 12 deletions(-)

diff --git a/src/maxPriorityQueue.d.ts b/src/maxPriorityQueue.d.ts
index 9052505..bce4f16 100644
--- a/src/maxPriorityQueue.d.ts
+++ b/src/maxPriorityQueue.d.ts
@@ -5,12 +5,12 @@ export class MaxPriorityQueue<T> {
   [Symbol.iterator](): Iterator<T, any, undefined>;
   size(): number;
   isEmpty(): boolean;
-  front(): T;
-  back(): T;
+  front(): T | null;
+  back(): T | null;
   enqueue(value: T): MaxPriorityQueue<T>;
   push(value: T): MaxPriorityQueue<T>;
-  dequeue(): T;
-  pop(): T;
+  dequeue(): T | null;
+  pop(): T | null;
   remove(cb: (value: T) => boolean): T[];
   contains(cb: (value: T) => boolean): boolean;
   toArray(): T[];
diff --git a/src/minPriorityQueue.d.ts b/src/minPriorityQueue.d.ts
index 523fd59..6770161 100644
--- a/src/minPriorityQueue.d.ts
+++ b/src/minPriorityQueue.d.ts
@@ -5,12 +5,12 @@ export class MinPriorityQueue<T> {
   [Symbol.iterator](): Iterator<T, any, undefined>;
   size(): number;
   isEmpty(): boolean;
-  front(): T;
-  back(): T;
+  front(): T | null;
+  back(): T | null;
   enqueue(value: T): MinPriorityQueue<T>;
   push(value: T): MinPriorityQueue<T>;
-  dequeue(): T;
-  pop(): T;
+  dequeue(): T | null;
+  pop(): T | null;
   remove(cb: (value: T) => boolean): T[];
   contains(cb: (value: T) => boolean): boolean;
   toArray(): T[];
diff --git a/src/priorityQueue.d.ts b/src/priorityQueue.d.ts
index 2c0382b..ba77684 100644
--- a/src/priorityQueue.d.ts
+++ b/src/priorityQueue.d.ts
@@ -5,12 +5,12 @@ export class PriorityQueue<T> {
   [Symbol.iterator](): Iterator<T, any, undefined>;
   size(): number;
   isEmpty(): boolean;
-  front(): T;
-  back(): T;
+  front(): T | null;
+  back(): T | null;
   enqueue(value: T): PriorityQueue<T>;
   push(value: T): PriorityQueue<T>;
-  dequeue(): T;
-  pop(): T;
+  dequeue(): T | null;
+  pop(): T | null;
   remove(cb: (value: T) => boolean): T[];
   contains(cb: (value: T) => boolean): boolean;
   toArray(): T[];