Uses of Interface
org.htmlparser.util.sort.Ordered
-
Packages that use Ordered Package Description org.htmlparser.lexer The lexer package is the base level I/O subsystem.org.htmlparser.util Code which can be reused by many classes, is located in this package.org.htmlparser.util.sort Provides generic sorting and searching. -
-
Uses of Ordered in org.htmlparser.lexer
Classes in org.htmlparser.lexer that implement Ordered Modifier and Type Class Description classCursorA bookmark in a page.Methods in org.htmlparser.lexer that return Ordered Modifier and Type Method Description OrderedPageIndex. fetch(int index, Ordered reuse)Fetch the object at the given index.Methods in org.htmlparser.lexer with parameters of type Ordered Modifier and Type Method Description OrderedPageIndex. 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 Modifier and Type Class Description classCharacterReferenceStructure 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 Modifier and Type Method Description OrderedSortable. fetch(int index, Ordered reuse)Fetch the object at the given index.Methods in org.htmlparser.util.sort with parameters of type Ordered Modifier and Type Method Description static intSort. bsearch(java.util.Vector vector, Ordered ref)Binary search for an objectstatic intSort. bsearch(java.util.Vector vector, Ordered ref, int lo, int hi)Binary search for an objectstatic intSort. bsearch(Ordered[] array, Ordered ref)Binary search for an objectstatic intSort. bsearch(Ordered[] array, Ordered ref, int lo, int hi)Binary search for an objectstatic intSort. bsearch(Sortable set, Ordered ref)Binary search for an objectstatic intSort. bsearch(Sortable set, Ordered ref, int lo, int hi)Binary search for an objectOrderedSortable. fetch(int index, Ordered reuse)Fetch the object at the given index.static voidSort. QuickSort(Ordered[] a)This is a generic version of C.A.R Hoare's Quick Sort algorithm.static voidSort. QuickSort(Ordered[] a, int lo0, int hi0)This is a generic version of C.A.R Hoare's Quick Sort algorithm.
-