A B C D G H I L M N P Q R S T W

A

AbstractSort - Class in net.sf.jsort.sort

This is the base for all comparison based sorting algorithms.

AbstractSort() - Constructor for class net.sf.jsort.sort.AbstractSort

AlgorithmPath - Interface in net.sf.jsort.graph

This interface is the interface of all algorithm that deals with path calculation.

B

BaseLinearSort - Class in net.sf.jsort.linear

BaseLinearSort() - Constructor for class net.sf.jsort.linear.BaseLinearSort

buildMaxHeap(Object[], Comparator, int, int) - Method in class net.sf.jsort.sort.HeapSort

build the heap

C

ClassCastIndexResolver - Class in net.sf.jsort.util

A implementation of IndexResolver based on IndexResolver class.

ClassCastIndexResolver() - Constructor for class net.sf.jsort.util.ClassCastIndexResolver

compare(Object, Object) - Method in class net.sf.jsort.util.NaturalComparator

compare(Object, Object) - Method in class net.sf.jsort.util.ReverseComparator

CompareSort - Interface in net.sf.jsort.sort

Represents a Comparison-based Sort Algorithm.

computeShortestPathGraph(Graph, Set, Object, WeightResolver, Object, AlgorithmPath) - Method in class net.sf.jsort.graph.DistanceGraphConverter

CountingSort - Class in net.sf.jsort.linear

This class implements the counting sort algorithm.

CountingSort() - Constructor for class net.sf.jsort.linear.CountingSort

D

DijkstraPath - Class in net.sf.jsort.graph

This class implements a edge "sort" algorithm.

DijkstraPath() - Constructor for class net.sf.jsort.graph.DijkstraPath

DistanceGraphConverter - Class in net.sf.jsort.graph

This class compute a directed graph from another directed graph.

DistanceGraphConverter() - Constructor for class net.sf.jsort.graph.DistanceGraphConverter

DoubleWeightResolver - Class in net.sf.jsort.util

DoubleWeightResolver(Object) - Constructor for class net.sf.jsort.util.DoubleWeightResolver

G

getEdges() - Method in class net.sf.jsort.graph.Path

getIndex() - Method in interface net.sf.jsort.linear.Indexable

getInstance() - Static method in class net.sf.jsort.util.ClassCastIndexResolver

getInstance() - Static method in class net.sf.jsort.util.NaturalComparator

getInstance() - Static method in class net.sf.jsort.util.ReverseComparator

getPath(Graph, Vertex, Vertex, WeightResolver) - Method in interface net.sf.jsort.graph.AlgorithmPath

getPath(Graph, Vertex, Collection, WeightResolver) - Method in interface net.sf.jsort.graph.AlgorithmPath

getPath(Graph, Vertex, Vertex, WeightResolver) - Method in class net.sf.jsort.graph.DijkstraPath

getPath(Graph, Vertex, Collection, WeightResolver) - Method in class net.sf.jsort.graph.DijkstraPath

getSource() - Method in class net.sf.jsort.graph.Path

getTarget() - Method in class net.sf.jsort.graph.Path

getTotalCost() - Method in class net.sf.jsort.graph.Path

H

HeapSort - Class in net.sf.jsort.sort

This is a implemention of the Heap Sort algorithm.

HeapSort() - Constructor for class net.sf.jsort.sort.HeapSort

heapsort(Object[], Comparator, int, int) - Method in class net.sf.jsort.sort.HeapSort

I

Indexable - Interface in net.sf.jsort.linear

The interface to be implemented by elements that has a natural order attribute.

IndexResolver - Interface in net.sf.jsort.linear

This interface represents the element that extract the index of a element.

initialWeight() - Method in interface net.sf.jsort.graph.WeightResolver

initialWeight() - Method in class net.sf.jsort.util.DoubleWeightResolver

insert(Object) - Method in class net.sf.jsort.queue.PriorityQueue

insert(Object) - Method in interface net.sf.jsort.queue.Queue

Insert the new element at queue.

InsertSort - Class in net.sf.jsort.sort

Implementation of the Insert sort algorithm.

InsertSort() - Constructor for class net.sf.jsort.sort.InsertSort

isEmpty() - Method in class net.sf.jsort.queue.PriorityQueue

isEmpty() - Method in interface net.sf.jsort.queue.Queue

isGreater(Number, Number) - Method in interface net.sf.jsort.graph.WeightResolver

Compare two numbers

isGreater(Number, Number) - Method in class net.sf.jsort.util.DoubleWeightResolver

L

LinearSort - Interface in net.sf.jsort.linear

Represents a Linear Sort Algorithm.

M

MergeInsertSort - Class in net.sf.jsort.sort

This is a modified version of Merge sort algorithm, that change the sorting algorithm when sorting small pieces arrays.

MergeInsertSort() - Constructor for class net.sf.jsort.sort.MergeInsertSort

mergeSort(Object[], Comparator, int, int) - Method in class net.sf.jsort.sort.MergeInsertSort

MergeSort - Class in net.sf.jsort.sort

This is a implementation of Merge sort algorithm.

MergeSort() - Constructor for class net.sf.jsort.sort.MergeSort

mergeSort(Object[], Comparator, int, int) - Method in class net.sf.jsort.sort.MergeSort

This is the main function of the algorithm.

N

NaturalComparator - Class in net.sf.jsort.util

Implementation of a natural comparator.

net.sf.jsort - package net.sf.jsort

net.sf.jsort.graph - package net.sf.jsort.graph

net.sf.jsort.linear - package net.sf.jsort.linear

net.sf.jsort.queue - package net.sf.jsort.queue

net.sf.jsort.sort - package net.sf.jsort.sort

net.sf.jsort.util - package net.sf.jsort.util

P

partition(Object[], Comparator, int, int) - Method in class net.sf.jsort.sort.QuickSort

It method is the main part of the algorithm.

partition(Object[], Comparator, int, int) - Method in class net.sf.jsort.sort.RandomizedQuickSort

This implementation of partion uses a random generator to select the pivot, interchange it with the last element and call the original partition method of quicksort.

Path - Class in net.sf.jsort.graph

This class represents a path in a graph.

Path(Path, Vertex, Edge, Number) - Constructor for class net.sf.jsort.graph.Path

Path(Vertex, Number) - Constructor for class net.sf.jsort.graph.Path

PriorityQueue - Class in net.sf.jsort.queue

The priority queue keeps the queue ordered by the "priority" of its elements.

PriorityQueue() - Constructor for class net.sf.jsort.queue.PriorityQueue

Create a PriorityQueue that its elements will be instances of Comparable.

PriorityQueue(Collection) - Constructor for class net.sf.jsort.queue.PriorityQueue

Create a PriorityQueue that its elements will be instances of Comparable.

PriorityQueue(Comparator) - Constructor for class net.sf.jsort.queue.PriorityQueue

Create an empty PriorityQueue.

PriorityQueue(Comparator, Collection) - Constructor for class net.sf.jsort.queue.PriorityQueue

Create an already populated PriorityQueue.

Q

Queue - Interface in net.sf.jsort.queue

Interface for all queue implementations.

QuickSort - Class in net.sf.jsort.sort

This is a implementation of QuickSort algorithm.

QuickSort() - Constructor for class net.sf.jsort.sort.QuickSort

R

RadixSort - Class in net.sf.jsort.linear

This class implements a sorting algorithm based on each digit of each entry.

RadixSort() - Constructor for class net.sf.jsort.linear.RadixSort

RadixSort.RadixIndexResolver - Class in net.sf.jsort.linear

A proxy implementation of IndexResolver that stripe a digit from index.

RadixSort.RadixIndexResolver(IndexResolver, int) - Constructor for class net.sf.jsort.linear.RadixSort.RadixIndexResolver

RandomizedQuickSort - Class in net.sf.jsort.sort

This is a alternative implementation of QuickSort, that tries to eliminate the poor performance (n ^2) in worst case of QuickSort.

RandomizedQuickSort() - Constructor for class net.sf.jsort.sort.RandomizedQuickSort

remove() - Method in class net.sf.jsort.queue.PriorityQueue

remove() - Method in interface net.sf.jsort.queue.Queue

Take a element from queue.

resolveIndex(Object) - Method in interface net.sf.jsort.linear.IndexResolver

resolveIndex(Object) - Method in class net.sf.jsort.linear.RadixSort.RadixIndexResolver

resolveIndex(Object) - Method in class net.sf.jsort.util.ClassCastIndexResolver

resolveWeight(Edge) - Method in interface net.sf.jsort.graph.WeightResolver

Resolve the weight of the edge.

resolveWeight(Edge) - Method in class net.sf.jsort.util.DoubleWeightResolver

ReverseComparator - Class in net.sf.jsort.util

Implementation of a natural comparator.

S

sort(DirectedGraph) - Method in class net.sf.jsort.graph.TopologicalSort

Equivalent as sort(graph,true).

sort(DirectedGraph, boolean) - Method in class net.sf.jsort.graph.TopologicalSort

sort(List) - Method in class net.sf.jsort.linear.BaseLinearSort

sort(List, IndexResolver) - Method in class net.sf.jsort.linear.BaseLinearSort

sort(List, int, int) - Method in class net.sf.jsort.linear.BaseLinearSort

sort(List, IndexResolver, int, int) - Method in class net.sf.jsort.linear.BaseLinearSort

sort(Object[]) - Method in class net.sf.jsort.linear.BaseLinearSort

sort(Object[], IndexResolver) - Method in class net.sf.jsort.linear.BaseLinearSort

sort(Object[], int, int) - Method in class net.sf.jsort.linear.BaseLinearSort

sort(Object[], IndexResolver, int, int) - Method in class net.sf.jsort.linear.BaseLinearSort

sort(Object[], IndexResolver, int, int, int) - Method in class net.sf.jsort.linear.BaseLinearSort

sort(Object[], IndexResolver, int, int, int) - Method in class net.sf.jsort.linear.CountingSort

sort(List, IndexResolver) - Method in interface net.sf.jsort.linear.LinearSort

Sort the list using the specified IndexResolver

sort(List, IndexResolver, int, int) - Method in interface net.sf.jsort.linear.LinearSort

Sort a specific range of the list using the IndexResolver

sort(Object[], IndexResolver) - Method in interface net.sf.jsort.linear.LinearSort

Sort the list using the specified IndexResolver

sort(Object[], IndexResolver, int, int) - Method in interface net.sf.jsort.linear.LinearSort

Sort a specific range of the list, using the specified resolver.

sort(Object[], IndexResolver, int, int, int) - Method in class net.sf.jsort.linear.RadixSort

sort(List) - Method in class net.sf.jsort.sort.AbstractSort

sort(List, Comparator) - Method in class net.sf.jsort.sort.AbstractSort

sort(List, int, int) - Method in class net.sf.jsort.sort.AbstractSort

sort(List, Comparator, int, int) - Method in class net.sf.jsort.sort.AbstractSort

sort(Object[]) - Method in class net.sf.jsort.sort.AbstractSort

sort(Object[], Comparator) - Method in class net.sf.jsort.sort.AbstractSort

sort(Object[], int, int) - Method in class net.sf.jsort.sort.AbstractSort

sort(Object[], Comparator, int, int) - Method in class net.sf.jsort.sort.AbstractSort

sort(List, Comparator) - Method in interface net.sf.jsort.sort.CompareSort

Sort the list using the specified Comparator

sort(List, Comparator, int, int) - Method in interface net.sf.jsort.sort.CompareSort

Sort a specific range of the list using the comparator

sort(Object[], Comparator) - Method in interface net.sf.jsort.sort.CompareSort

Sort the list using the specified Comparator

sort(Object[], Comparator, int, int) - Method in interface net.sf.jsort.sort.CompareSort

Sort a specific range of the list, using the specified comparator.

sort(Object[], Comparator, int, int) - Method in class net.sf.jsort.sort.HeapSort

sort(Object[], Comparator, int, int) - Method in class net.sf.jsort.sort.InsertSort

sort(Object[], Comparator, int, int) - Method in class net.sf.jsort.sort.MergeSort

sort(Object[], Comparator, int, int) - Method in class net.sf.jsort.sort.QuickSort

sort(List) - Method in interface net.sf.jsort.SortAlgorithm

Sort the list using it's natural order (i.e.

sort(List, int, int) - Method in interface net.sf.jsort.SortAlgorithm

Sort a specific range of the list.

sort(Object[]) - Method in interface net.sf.jsort.SortAlgorithm

Sort the list using it's natural order (i.e.

sort(Object[], int, int) - Method in interface net.sf.jsort.SortAlgorithm

Sort a specific range of the list.

SortAlgorithm - Interface in net.sf.jsort

This interface represents most part of the sorting algorithms.

sum(Number, Number) - Method in interface net.sf.jsort.graph.WeightResolver

Return the sum of numbers.

sum(Number, Number) - Method in class net.sf.jsort.util.DoubleWeightResolver

T

TopologicalSort - Class in net.sf.jsort.graph

This class implements a topological sort of vertices of a directed acyclic graph (DAG), based on the direction of the edges connecting them.

TopologicalSort() - Constructor for class net.sf.jsort.graph.TopologicalSort

W

WeightResolver - Interface in net.sf.jsort.graph

interface for classes that provide operation over weight to path algorithm.

A B C D G H I L M N P Q R S T W