Uses of Interface
org.htmlparser.util.sort.Ordered

Packages that use Ordered

org.htmlparser.lexer	The lexer package is the base level I/O subsystem.
org.htmlparser.util
org.htmlparser.util.sort	Provides generic sorting and searching.

Uses of Ordered in org.htmlparser.lexer

Classes in org.htmlparser.lexer that implement Ordered

class

Cursor A bookmark in a page.

Methods in org.htmlparser.lexer that return Ordered

Ordered

PageIndex.fetch(int index, Ordered reuse) Fetch the object at the given index.

Methods in org.htmlparser.lexer with parameters of type Ordered

Ordered

PageIndex.fetch(int index, Ordered reuse) Fetch the object at the given index.

Uses of Ordered in org.htmlparser.util

Classes in org.htmlparser.util that implement Ordered

class

CharacterReference Structure to hold a character and it's equivalent entity reference kernel.

Uses of Ordered in org.htmlparser.util.sort

Methods in org.htmlparser.util.sort that return Ordered

Ordered

Sortable.fetch(int index, Ordered reuse) Fetch the object at the given index.

Methods in org.htmlparser.util.sort with parameters of type Ordered

static int	Sort.bsearch(Ordered[] array, Ordered ref) Binary search for an object
static int	Sort.bsearch(Ordered[] array, Ordered ref) Binary search for an object
static int	Sort.bsearch(Ordered[] array, Ordered ref, int lo, int hi) Binary search for an object
static int	Sort.bsearch(Ordered[] array, Ordered ref, int lo, int hi) Binary search for an object
static int	Sort.bsearch(Sortable set, Ordered ref) Binary search for an object
static int	Sort.bsearch(Sortable set, Ordered ref, int lo, int hi) Binary search for an object
static int	Sort.bsearch(Vector vector, Ordered ref) Binary search for an object
static int	Sort.bsearch(Vector vector, Ordered ref, int lo, int hi) Binary search for an object
Ordered	Sortable.fetch(int index, Ordered reuse) Fetch the object at the given index.
static void	Sort.QuickSort(Ordered[] a) This is a generic version of C.A.R Hoare's Quick Sort algorithm.
static void	Sort.QuickSort(Ordered[] a, int lo0, int hi0) This is a generic version of C.A.R Hoare's Quick Sort algorithm.