Capture null returns in type definitions (#69)

Author: sderrow

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[];

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[];

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[];