/** * Gets a queue by name. */ public FSQueue getQueue(String name) { name = ensureRootPrefix(name); synchronized (queues) { return queues.get(name); } }
/** * Return whether a queue exists already. */ public boolean exists(String name) { name = ensureRootPrefix(name); synchronized (queues) { return queues.containsKey(name); } }
/** * Return whether a queue exists already. */ public boolean exists(String name) { name = ensureRootPrefix(name); synchronized (queues) { return queues.containsKey(name); } }
/** * Gets a queue by name. */ public FSQueue getQueue(String name) { name = ensureRootPrefix(name); synchronized (queues) { return queues.get(name); } }
/** * Gets a queue by name. */ public FSQueue getQueue(String name) { name = ensureRootPrefix(name); synchronized (queues) { return queues.get(name); } }
/** * Return whether a queue exists already. */ public boolean exists(String name) { name = ensureRootPrefix(name); synchronized (queues) { return queues.containsKey(name); } }
/** * Remove a leaf queue if empty * @param name name of the queue * @return true if queue was removed or false otherwise */ public boolean removeLeafQueue(String name) { name = ensureRootPrefix(name); return removeEmptyIncompatibleQueues(name, FSQueueType.PARENT); }
/** * Remove a leaf queue if empty * @param name name of the queue * @return true if queue was removed or false otherwise */ public boolean removeLeafQueue(String name) { name = ensureRootPrefix(name); return removeEmptyIncompatibleQueues(name, FSQueueType.PARENT); }
/** * Remove a leaf queue if empty. * @param name name of the queue * @return true if queue was removed or false otherwise */ public boolean removeLeafQueue(String name) { name = ensureRootPrefix(name); return !Boolean.FALSE.equals( removeEmptyIncompatibleQueues(name, FSQueueType.PARENT).orElse(null)); }
private FSQueue getQueue(String name, boolean create, FSQueueType queueType) { name = ensureRootPrefix(name); synchronized (queues) { FSQueue queue = queues.get(name); if (queue == null && create) { // if the queue doesn't exist,create it and return queue = createQueue(name, queueType); // Update steady fair share for all queues if (queue != null) { rootQueue.recomputeSteadyShares(); } } return queue; } }
private FSQueue getQueue(String name, boolean create, FSQueueType queueType) { name = ensureRootPrefix(name); synchronized (queues) { FSQueue queue = queues.get(name); if (queue == null && create) { // if the queue doesn't exist,create it and return queue = createQueue(name, queueType); // Update steady fair share for all queues if (queue != null) { rootQueue.recomputeSteadyShares(); } } return queue; } }
queueToCreate = ensureRootPrefix(queueToCreate);
queueToCreate = ensureRootPrefix(queueToCreate);
queueToCreate = ensureRootPrefix(queueToCreate);
private FSQueue getQueue(String name, boolean create, FSQueueType queueType, boolean recomputeSteadyShares, ApplicationId applicationId) { boolean recompute = recomputeSteadyShares; name = ensureRootPrefix(name); FSQueue queue; synchronized (queues) { queue = queues.get(name); if (queue == null && create) { // if the queue doesn't exist,create it and return queue = createQueue(name, queueType); } else { recompute = false; } // At this point the queue exists and we need to assign the app if to the // but only to a leaf queue if (applicationId != null && queue instanceof FSLeafQueue) { ((FSLeafQueue)queue).addAssignedApp(applicationId); } } // Don't recompute if it is an existing queue or no change was made if (recompute && queue != null) { rootQueue.recomputeSteadyShares(); } return queue; }