A B C D E G H I L M O P Q R S T

I

insert(T) - Method in class edu.cornell.cs.cs2110.AbstractBag

Inserts an element into the data structure.

insert(T) - Method in class edu.cornell.cs.cs2110.AdjustablePriorityQueue

Inserts an item with the default priority: Double.POSITIVE_INFINITY for a min queue, Double.NEGATIVE_INFINITY for a max queue.

insert(T, double) - Method in class edu.cornell.cs.cs2110.AdjustablePriorityQueue

Inserts an item with the given priority.

insert(T) - Method in interface edu.cornell.cs.cs2110.Bag

Inserts an element into the data structure.

insert(T) - Method in class edu.cornell.cs.cs2110.PriorityQueue

Inserts an element into the data structure.

insert(T) - Method in class edu.cornell.cs.cs2110.Queue

Inserts an element into the data structure.

insert(T) - Method in class edu.cornell.cs.cs2110.RandomBag

Inserts an element into the data structure.

insert(T) - Method in class edu.cornell.cs.cs2110.Stack

Inserts an element into the data structure.

is - Variable in class edu.cornell.cs.cs2110.TextResourceFile

isEmpty() - Method in class edu.cornell.cs.cs2110.AbstractBag

Tests whether the data structure is empty.

isEmpty() - Method in interface edu.cornell.cs.cs2110.Bag

Tests whether the data structure is empty.

item - Variable in class edu.cornell.cs.cs2110.AdjustablePriorityQueue.PQElement

item - Variable in class edu.cornell.cs.cs2110.PriorityQueue.Oriented

item - Variable in class edu.cornell.cs.cs2110.RandomBag.Ordered

iterator() - Method in class edu.cornell.cs.cs2110.AbstractBag

The Iterator, unless it is overridden in the concrete subclass, produces elements in the same order that repeated execution of extract() would.

iterator() - Method in class edu.cornell.cs.cs2110.TextResourceFile

This implementation does not support Iterator.remove().