Skip to main content
Deno 2 is finally here 🎉️
Learn more
Module

x/masx200_leetcode_test/kth-largest-element-in-a-stream/PriorityQueue.ts>PriorityQueue

leetcode测试
masx200/leetcode-test
Go to Latest
interface PriorityQueue
import { type PriorityQueue } from "https://deno.land/x/masx200_leetcode_test@7.7.0/kth-largest-element-in-a-stream/PriorityQueue.ts";

Type Parameters

optional
T = any

Properties

clear: () => void

clear all elements

length: () => number

get length of elements

comparator: (a: T, b: T) => number

comparator Function used to determine the order of the elements. It is expected to return a negative value if the head argument is less than the second argument, zero if they're equal, and a positive value otherwise.

offer: (value: T) => void

add one element

head: () => T | undefined

get min element

tail: () => T | undefined

get max element

pop: () => T | undefined

get and delete max element

shift: () => T | undefined

get and delete min element

Methods

at(index: number): T | undefined
isEmpty(): boolean
toArray(): T[]
function PriorityQueue
import { PriorityQueue } from "https://deno.land/x/masx200_leetcode_test@7.7.0/kth-largest-element-in-a-stream/PriorityQueue.ts";

comparator Function used to determine the order of the elements. It is expected to return a negative value if the head argument is less than the second argument, zero if they're equal, and a positive value otherwise.

Type Parameters

optional
T = any

Parameters

comparator: (a: T, b: T) => number
optional
values: T[]