Skip to content

Main NavigationHome

Appearance

Sidebar Navigation

Introduction

Installation

Data Structures

LinkedList<T>

Constructors

Properties

first

last

length

Methods

append

clear

delete

deleteFirst

deleteLast

find

get

includes

insertAfter

isEmpty

map

prepend

toArray

toArrayReverse

LinkedListNode<T>

Constructors

Properties

list

next

prev

Methods

attachNext

attachPrev

detach

hasEqualList

hasList

isEqual

BinaryHeap<T>

Constructors

Properties

size

Methods

clear

isEmpty

peek

pop

push

PriorityQueue<T>

Constructors

Properties

length

Methods

clear

dequeue

enqueue

includes

isEmpty

iterator

peek

toArray

Queue<T>

Constructors

Properties

length

Methods

clear

dequeue

enqueue

includes

isEmpty

iterator

peek

toArray

Stack<T>

Constructors

Properties

length

Methods

clear

includes

isEmpty

iterator

peek

pop

push

toArray

Tree<T>

Constructors

Properties

root

Methods

delete

deserialize

insert

toObject

traverseBFS

traverseDFS

TreeNode<T>

Constructors

Properties

tree

Methods

detach

displayConsole

hasEqualTree

hasList

isEqual

On this page

Table of Contents for current page

PriorityQueue<T>.isEmpty

This implementation returns length === 0.

Previous pageincludes

Next pageiterator