aud.adt.AbstractPriorityQueue< T > Class Template Reference

Interface for an ADT priority queue. More...

Inheritance diagram for aud.adt.AbstractPriorityQueue< T >:

Collaboration diagram for aud.adt.AbstractPriorityQueue< T >:

Public Member Functions
abstract boolean	is_empty ()
	Is PQ empty? More...
abstract T	front ()
	Get minimal element. More...
abstract T	pop ()
	Pop minimal element from PQ. More...
abstract void	push (T x)
	Push x into PQ. More...

Protected Member Functions
	AbstractPriorityQueue (java.util.Comparator< T > cmp)
	create empty PQ and use cmp_ for comparison of priorities More...
	AbstractPriorityQueue ()
	create empty PQ More...
boolean	less (T a, T b)
	test for a<b, uses Comparator if one was provided or Comparable else. More...

Protected Attributes
Comparator< T >	cmp_ = null

Detailed Description

Interface for an ADT priority queue.

front provdes the smallest entry (w.r.t. to a user defined Comparator)

Definition at line 10 of file AbstractPriorityQueue.java.

Constructor & Destructor Documentation

AbstractPriorityQueue() [1/2]

aud.adt.AbstractPriorityQueue< T >.AbstractPriorityQueue ( java.util.Comparator< T >  cmp )

protected

create empty PQ and use cmp_ for comparison of priorities

Definition at line 15 of file AbstractPriorityQueue.java.

                                                               {
    this();
    cmp_=cmp;
  }

References aud.adt.AbstractPriorityQueue< T >.cmp_.

AbstractPriorityQueue() [2/2]

aud.adt.AbstractPriorityQueue< T >.AbstractPriorityQueue ( )

protected

create empty PQ

Definition at line 20 of file AbstractPriorityQueue.java.

{}

Member Function Documentation

front()

abstract T aud.adt.AbstractPriorityQueue< T >.front ( )

abstract

Get minimal element.

Requires !is_empty().

Exceptions

NoSuchElementException

Returns

top

Reimplemented in aud.PriorityQueue< T >.

is_empty()

abstract boolean aud.adt.AbstractPriorityQueue< T >.is_empty ( )

abstract

Is PQ empty?

Reimplemented in aud.PriorityQueue< T >.

less()

boolean aud.adt.AbstractPriorityQueue< T >.less ( T  a, T  b  )

protected

test for a<b, uses Comparator if one was provided or Comparable else.

Definition at line 26 of file AbstractPriorityQueue.java.

                                  {
    return (cmp_!=null) ?
        (cmp_.compare(a,b)<0) : (((Comparable<T>) a).compareTo(b)<0);
  }

References aud.adt.AbstractPriorityQueue< T >.cmp_.

pop()

abstract T aud.adt.AbstractPriorityQueue< T >.pop ( )

abstract

Pop minimal element from PQ.

Requires !is_empty().

Exceptions

NoSuchElementException

Returns

removed (minimal) element

Reimplemented in aud.PriorityQueue< T >.

push()

abstract void aud.adt.AbstractPriorityQueue< T >.push ( T  x )

abstract

Push x into PQ.

Parameters

x	new element

Reimplemented in aud.PriorityQueue< T >.

Member Data Documentation

cmp_

Comparator<T> aud.adt.AbstractPriorityQueue< T >.cmp_ = null

protected

Definition at line 12 of file AbstractPriorityQueue.java.

Referenced by aud.adt.AbstractPriorityQueue< T >.AbstractPriorityQueue(), and aud.adt.AbstractPriorityQueue< T >.less().

---

The documentation for this class was generated from the following file:

• AbstractPriorityQueue.java