InputOutput.SeverityLevel severityLevel
int stackIndex
ConsoleHandler consoleHandler
ConsoleHandler
.LogHandler logHandler
LogHandler
.List<E> handlers
IOPrinter printer
IOPrinter
containing the List
of IOHandler
(containing the
ConsoleHandler
and LogHandler
by default).InputOutput.Type type
InputOutput.Type
.InputOutput.SeverityLevel severityLevel
String prefix
String
.String content
String
.Exception exception
Exception
.int length
boolean isError
int progress
File file
File
to handle.Charset charset
int lineCount
ExtendedLinkedList<E> readers
BufferedWriter writer
BufferedWriter
of the File
to handle.boolean append
File logDir
File
.FileHandler outputLogHandler
FileHandler
.Lock outputLogLock
FileHandler errorLogHandler
FileHandler
.Lock errorLogLock
Comparable<T> value
T
value.boolean isInclusive
this
is inclusive.LowerBound<T extends Comparable<? super T>> lowerBound
LowerBound
of T
type.UpperBound<T extends Comparable<? super T>> upperBound
UpperBound
of T
type.long value
long
value.Object[] array
int minGallop
MIN_GALLOP
. The
methods ComparableSort.mergeLo(int, int, int, int)
and ComparableSort.mergeHi(int, int, int, int)
nudge it higher for random data and lower for
highly structured data.Object[] temp
int tempBase
int tempLength
int stackSize
i
starts at address base[i]
and
extends for length[i]
elements. It is always true (so long as the indices are in
bounds) that:
runBase[i] + runLength[i] == runBase[i + 1]
so we could cut the storage for this, but it is a minor amount and keeping all the info explicit simplifies the code.
int[] runBase
int[] runLength
int index
T
token.Object token
T
token.Object[] array
Comparator<T> comparator
Comparator
of T
supertype to determine the order.int minGallop
MIN_GALLOP
. The
methods Sort.mergeLo(int, int, int, int)
and Sort.mergeHi(int, int, int, int)
nudge it higher for random data and lower for
highly structured data.Object[] temp
int tempBase
int tempLength
int stackSize
i
starts at address base[i]
and
extends for length[i]
elements. It is always true (so long as the indices are in
bounds) that:
runBase[i] + runLength[i] == runBase[i + 1]
so we could cut the storage for this, but it is a minor amount and keeping all the info explicit simplifies the code.
int[] runBase
int[] runLength
Collection<E> DEFAULT_MODEL
Collection
of E
element type.boolean DEFAULT_REMOVE_EMPTY
Collection
of E
element
type.Collection<E> model
Collection
of E
element type.boolean removeEmpty
Collection
of E
element type.Collection<E> DEFAULT_MODEL
Collection
of E
element type.boolean DEFAULT_REMOVE_EMPTY
Collection
of E
element
type.Collection<E> model
Collection
of E
element type.boolean removeEmpty
Collection
of E
element type.boolean update
AvlTreeNode
.AvlTreeMap<K,V> tree
int height
int balance
boolean isLeft
BinaryTreeNode<K,V,N extends BinaryTreeNode<K,V,N>> parent
BinaryTreeNode<K,V,N extends BinaryTreeNode<K,V,N>> left
BinaryTreeNode<K,V,N extends BinaryTreeNode<K,V,N>> right
Collection<E> DEFAULT_MODEL
Collection
of E
element type.boolean DEFAULT_REMOVE_EMPTY
Collection
of E
element
type.Collection<E> model
Collection
of E
element type.boolean removeEmpty
Collection
of E
element type.boolean update
ComparableAvlTreeNode
.ComparableAvlTreeMap<K extends Comparable<? super K>,V> tree
int height
int balance
boolean isLeft
ComparableBinaryTreeNode<K extends Comparable<? super K>,V,N extends ComparableBinaryTreeNode<K,V,N>> parent
ComparableBinaryTreeNode<K extends Comparable<? super K>,V,N extends ComparableBinaryTreeNode<K,V,N>> left
ComparableBinaryTreeNode<K extends Comparable<? super K>,V,N extends ComparableBinaryTreeNode<K,V,N>> right
boolean isBlack
ComparableTreeNode<K extends Comparable<? super K>,V> root
int size
Comparable<T> key
K
key.Object value
V
value.boolean isBlack
Collection<E> DEFAULT_MODEL
Collection
of E
element type.boolean DEFAULT_REMOVE_EMPTY
Collection
of E
element
type.Collection<E> model
Collection
of E
element type.boolean removeEmpty
Collection
of E
element type.TreeNode<K,V> root
int size
Class<T> c
Class
of K
type.Comparator<T> keyComparator
Comparator
of K
supertype to use.Object key
K
key.Object value
V
value.Comparator<T> keyComparator
Comparator
of K
supertype to use.boolean isFair
this
is fair.Lock workersLock
Lock
of the workers.Condition workersLockCondition
Lock tasksLock
Lock
of the tasks.Condition tasksLockCondition
Lock resultsLock
Lock
of the results.Condition resultsLockCondition
long id
Object input
I
input.int minThreadCount
Worker
to handle.int maxThreadCount
Worker
to handle.boolean isRunning
this
is running.Worker<I,O> model
Class<T> c
Stack<E> workers
int workerCount
Worker
.int availableWorkerCount
Worker
.int reservedWorkerCount
Worker
.ExtendedLinkedList<E> tasks
long currentTaskId
Task
identifier.ExtendedHashMap<K,V> results
O
results associated to their identifiers.long[] time
double[] timeByUnit
long begin
long end
long difference
String representation
Copyright © 2013–2022. All rights reserved.