/** * Gets all the active labels in the current system. */ public Set<Label> getLabels() { Set<Label> r = new TreeSet<Label>(); for (Label l : labels.values()) { if(!l.isEmpty()) r.add(l); } return r; }
public Set<LabelAtom> getLabelAtoms() { Set<LabelAtom> r = new TreeSet<LabelAtom>(); for (Label l : labels.values()) { if(!l.isEmpty() && l instanceof LabelAtom) r.add((LabelAtom)l); } return r; }
/** * Resets all labels and remove invalid ones. * * This should be called when the assumptions behind label cache computation changes, * but we also call this periodically to self-heal any data out-of-sync issue. */ /*package*/ void trimLabels() { for (Iterator<Label> itr = labels.values().iterator(); itr.hasNext();) { Label l = itr.next(); resetLabel(l); if(l.isEmpty()) itr.remove(); } }
public String getShortDescription() { if (label.isEmpty()) { return Messages.Queue_LabelHasNoNodes(label.getName()); } else { return Messages.Queue_AllNodesOffline(label.getName()); } } }
if (l.isEmpty()) { for (LabelAtom a : l.listAtoms()) { if (a.isEmpty()) {
public Set<LabelAtom> getLabelAtoms() { Set<LabelAtom> r = new TreeSet<LabelAtom>(); for (Label l : labels.values()) { if (!l.isEmpty() && l instanceof LabelAtom) { r.add((LabelAtom) l); } } return r; }
/** * Gets all the active labels in the current system. */ public Set<Label> getLabels() { Set<Label> r = new TreeSet<Label>(); for (Label l : labels.values()) { if(!l.isEmpty()) r.add(l); } return r; }
public Set<LabelAtom> getLabelAtoms() { Set<LabelAtom> r = new TreeSet<LabelAtom>(); for (Label l : labels.values()) { if (!l.isEmpty() && l instanceof LabelAtom) { r.add((LabelAtom) l); } } return r; }
/** * Gets all the active labels in the current system. */ public Set<Label> getLabels() { Set<Label> r = new TreeSet<Label>(); for (Label l : labels.values()) { if (!l.isEmpty()) { r.add(l); } } return r; }
/** * Gets all the active labels in the current system. */ public Set<Label> getLabels() { Set<Label> r = new TreeSet<Label>(); for (Label l : labels.values()) { if (!l.isEmpty()) { r.add(l); } } return r; }
public Set<LabelAtom> getLabelAtoms() { Set<LabelAtom> r = new TreeSet<LabelAtom>(); for (Label l : labels.values()) { if(!l.isEmpty() && l instanceof LabelAtom) r.add((LabelAtom)l); } return r; }
/** * Gets all the active labels in the current system. */ public Set<Label> getLabels() { Set<Label> r = new TreeSet<Label>(); for (Label l : labels.values()) { if (!l.isEmpty()) { r.add(l); } } return r; }
public Set<LabelAtom> getLabelAtoms() { Set<LabelAtom> r = new TreeSet<LabelAtom>(); for (Label l : labels.values()) { if (!l.isEmpty() && l instanceof LabelAtom) { r.add((LabelAtom) l); } } return r; }
/** * Gets all the active labels in the current system. */ public Set<Label> getLabels() { Set<Label> r = new TreeSet<Label>(); for (Label l : labels.values()) { if (!l.isEmpty()) { r.add(l); } } return r; }
public Set<LabelAtom> getLabelAtoms() { Set<LabelAtom> r = new TreeSet<LabelAtom>(); for (Label l : labels.values()) { if (!l.isEmpty() && l instanceof LabelAtom) { r.add((LabelAtom) l); } } return r; }
/** * Resets all labels and remove invalid ones. */ private void trimLabels() { for (Iterator<Label> itr = labels.values().iterator(); itr.hasNext();) { Label l = itr.next(); l.reset(); if (l.isEmpty()) { itr.remove(); } } }
/** * Resets all labels and remove invalid ones. */ private void trimLabels() { for (Iterator<Label> itr = labels.values().iterator(); itr.hasNext();) { Label l = itr.next(); l.reset(); if (l.isEmpty()) { itr.remove(); } } }
/** * Resets all labels and remove invalid ones. */ private void trimLabels() { for (Iterator<Label> itr = labels.values().iterator(); itr.hasNext();) { Label l = itr.next(); l.reset(); if (l.isEmpty()) { itr.remove(); } } }
/** * Resets all labels and remove invalid ones. */ private void trimLabels() { for (Iterator<Label> itr = labels.values().iterator(); itr.hasNext();) { Label l = itr.next(); l.reset(); if (l.isEmpty()) { itr.remove(); } } }
public String getShortDescription() { if (label.isEmpty()) { return Messages.Queue_LabelHasNoNodes(label.getName()); } else { return Messages.Queue_AllNodesOffline(label.getName()); } } }