/** * {@inheritDoc} */ @Override public Set<ComputeMetadata> listNodes() { logger.trace(">> listing nodes"); Set<ComputeMetadata> set = newLinkedHashSet(listNodesStrategy.listNodes()); logger.trace("<< list(%d)", set.size()); return set; }
/** * {@inheritDoc} */ @Override public Set<? extends ComputeMetadata> listNodes() { logger.trace(">> listing nodes"); Set<? extends ComputeMetadata> set = newLinkedHashSet(listNodesStrategy.listNodes()); logger.trace("<< list(%d)", set.size()); return set; }
/** * {@inheritDoc} */ @Override public Set<? extends ComputeMetadata> listNodes() { logger.trace(">> listing nodes"); Set<? extends ComputeMetadata> set = newLinkedHashSet(listNodesStrategy.listNodes()); logger.trace("<< list(%d)", set.size()); return set; }
/** * {@inheritDoc} */ @Override public Set<ComputeMetadata> listNodes() { logger.trace(">> listing nodes"); Set<ComputeMetadata> set = newLinkedHashSet(listNodesStrategy.listNodes()); logger.trace("<< list(%d)", set.size()); return set; }
/** * Find the next node names that can be used. These will be derived from the group and the * template. We will pre-allocate a specified quantity, and attempt to verify that there is no * name conflict with the current service. * * @param group * @param count * @param template * @return */ protected Set<String> getNextNames(final String group, final Template template, int count) { Set<String> names = newLinkedHashSet(); Iterable<? extends ComputeMetadata> currentNodes = listNodesStrategy.listNodes(); int maxTries = 100; int currentTries = 0; while (names.size() < count && currentTries++ < maxTries) { final String name = namingConvention.createWithoutPrefix().uniqueNameForGroup(group); if (!any(currentNodes, new Predicate<ComputeMetadata>() { @Override public boolean apply(ComputeMetadata input) { return name.equals(input.getName()); } })) { names.add(name); } } return names; }
names.addAll(nodeNames); Iterable<? extends ComputeMetadata> currentNodes = listNodesStrategy.listNodes(); int maxTries = 100; int currentTries = 0;
names.addAll(nodeNames); Iterable<? extends ComputeMetadata> currentNodes = listNodesStrategy.listNodes(); int maxTries = 100; int currentTries = 0;
names.addAll(nodeNames); Iterable<? extends ComputeMetadata> currentNodes = listNodesStrategy.listNodes(); int maxTries = 100; int currentTries = 0;