void |
MasterProcedureScheduler.FairQueue.add(MasterProcedureScheduler.Queue<T> queue) |
private <T extends Comparable<T>> void |
MasterProcedureScheduler.addToRunQueue(MasterProcedureScheduler.FairQueue<T> fairq,
MasterProcedureScheduler.Queue<T> queue) |
static <T extends Comparable<T>> MasterProcedureScheduler.Queue<T> |
MasterProcedureScheduler.IterableList.append(MasterProcedureScheduler.Queue<T> head,
MasterProcedureScheduler.Queue<T> node) |
static <T extends Comparable<T>> MasterProcedureScheduler.Queue<T> |
MasterProcedureScheduler.IterableList.append(MasterProcedureScheduler.Queue<T> head,
MasterProcedureScheduler.Queue<T> node) |
static <T extends Comparable<T>> MasterProcedureScheduler.Queue<T> |
MasterProcedureScheduler.IterableList.appendList(MasterProcedureScheduler.Queue<T> head,
MasterProcedureScheduler.Queue<T> otherHead) |
static <T extends Comparable<T>> MasterProcedureScheduler.Queue<T> |
MasterProcedureScheduler.IterableList.appendList(MasterProcedureScheduler.Queue<T> head,
MasterProcedureScheduler.Queue<T> otherHead) |
private static <T extends Comparable<T>> MasterProcedureScheduler.Queue<T> |
MasterProcedureScheduler.AvlTree.balance(MasterProcedureScheduler.Queue<T> p) |
private static <T extends Comparable<T>> int |
MasterProcedureScheduler.AvlTree.balanceFactor(MasterProcedureScheduler.Queue<T> node) |
private int |
MasterProcedureScheduler.FairQueue.calculateQuantum(MasterProcedureScheduler.Queue queue) |
private <T extends Comparable<T>> void |
MasterProcedureScheduler.clear(MasterProcedureScheduler.Queue<T> treeMap,
MasterProcedureScheduler.FairQueue<T> fairq) |
int |
MasterProcedureScheduler.Queue.compareTo(MasterProcedureScheduler.Queue<TKey> other) |
private <T extends Comparable<T>> void |
MasterProcedureScheduler.doAdd(MasterProcedureScheduler.FairQueue<T> fairq,
MasterProcedureScheduler.Queue<T> queue,
Procedure proc,
boolean addFront) |
private static <T extends Comparable<T>> void |
MasterProcedureScheduler.AvlTree.fixHeight(MasterProcedureScheduler.Queue<T> node) |
static <T extends Comparable<T>> MasterProcedureScheduler.Queue<T> |
MasterProcedureScheduler.AvlTree.get(MasterProcedureScheduler.Queue<T> root,
T key) |
static <T extends Comparable<T>> MasterProcedureScheduler.Queue<T> |
MasterProcedureScheduler.AvlTree.getFirst(MasterProcedureScheduler.Queue<T> root) |
static <T extends Comparable<T>> MasterProcedureScheduler.Queue<T> |
MasterProcedureScheduler.AvlTree.getLast(MasterProcedureScheduler.Queue<T> root) |
private static <T extends Comparable<T>> int |
MasterProcedureScheduler.AvlTree.height(MasterProcedureScheduler.Queue<T> node) |
static <T extends Comparable<T>> MasterProcedureScheduler.Queue<T> |
MasterProcedureScheduler.AvlTree.insert(MasterProcedureScheduler.Queue<T> root,
MasterProcedureScheduler.Queue<T> node) |
static <T extends Comparable<T>> MasterProcedureScheduler.Queue<T> |
MasterProcedureScheduler.AvlTree.insert(MasterProcedureScheduler.Queue<T> root,
MasterProcedureScheduler.Queue<T> node) |
private static <T extends Comparable<T>> boolean |
MasterProcedureScheduler.IterableList.isLinked(MasterProcedureScheduler.Queue<T> node) |
static <T extends Comparable<T>> MasterProcedureScheduler.Queue<T> |
MasterProcedureScheduler.IterableList.prepend(MasterProcedureScheduler.Queue<T> head,
MasterProcedureScheduler.Queue<T> node) |
static <T extends Comparable<T>> MasterProcedureScheduler.Queue<T> |
MasterProcedureScheduler.IterableList.prepend(MasterProcedureScheduler.Queue<T> head,
MasterProcedureScheduler.Queue<T> node) |
void |
MasterProcedureScheduler.FairQueue.remove(MasterProcedureScheduler.Queue<T> queue) |
private static <T extends Comparable<T>> MasterProcedureScheduler.Queue<T> |
MasterProcedureScheduler.IterableList.remove(MasterProcedureScheduler.Queue<T> head,
MasterProcedureScheduler.Queue<T> node) |
private static <T extends Comparable<T>> MasterProcedureScheduler.Queue<T> |
MasterProcedureScheduler.IterableList.remove(MasterProcedureScheduler.Queue<T> head,
MasterProcedureScheduler.Queue<T> node) |
static <T extends Comparable<T>> MasterProcedureScheduler.Queue<T> |
MasterProcedureScheduler.AvlTree.remove(MasterProcedureScheduler.Queue<T> root,
T key) |
private <T extends Comparable<T>> void |
MasterProcedureScheduler.removeFromRunQueue(MasterProcedureScheduler.FairQueue<T> fairq,
MasterProcedureScheduler.Queue<T> queue) |
private static <T extends Comparable<T>> MasterProcedureScheduler.Queue<T> |
MasterProcedureScheduler.AvlTree.removeMin(MasterProcedureScheduler.Queue<T> p) |
private static <T extends Comparable<T>> MasterProcedureScheduler.Queue<T> |
MasterProcedureScheduler.AvlTree.rotateLeft(MasterProcedureScheduler.Queue<T> q) |
private static <T extends Comparable<T>> MasterProcedureScheduler.Queue<T> |
MasterProcedureScheduler.AvlTree.rotateRight(MasterProcedureScheduler.Queue<T> p) |
private void |
MasterProcedureScheduler.FairQueue.setNextQueue(MasterProcedureScheduler.Queue<T> queue) |
private void |
MasterProcedureScheduler.ProcedureEvent.suspendServerQueue(MasterProcedureScheduler.Queue<ServerName> queue) |
private void |
MasterProcedureScheduler.ProcedureEvent.suspendTableQueue(MasterProcedureScheduler.Queue<TableName> queue) |