/** * Returns the names of the root directories in this tree. */ public ImmutableSortedSet<Name> getRootDirectoryNames() { return roots.keySet(); }
/** Returns the properties name. */ public Set<String> getNames() { return properties.keySet(); }
/** * Returns the comparator that orders the keys, which is {@link Ordering#natural()} when the * natural ordering of the keys is used. Note that its behavior is not consistent with {@link * TreeMap#comparator()}, which returns {@code null} to indicate natural ordering. */ @Override public Comparator<? super K> comparator() { return keySet().comparator(); }
@Override public K firstKey() { return keySet().first(); }
@Override public K lastKey() { return keySet().last(); }
/** * Returns the comparator that orders the keys, which is {@link Ordering#natural()} when the * natural ordering of the keys is used. Note that its behavior is not consistent with {@link * TreeMap#comparator()}, which returns {@code null} to indicate natural ordering. */ @Override public Comparator<? super K> comparator() { return keySet().comparator(); }
@Override public K firstKey() { return keySet().first(); }
@Override public K lastKey() { return keySet().last(); }
@Override protected List<String> create(String[] elements) { ImmutableSortedMap.Builder<String, Integer> builder = ImmutableSortedMap.naturalOrder(); for (int i = 0; i < elements.length; i++) { builder.put(elements[i], i); } return builder.build().keySet().asList(); }
for (Integer oldInputPos : frame.oldToNewOutputs.keySet()) { combinedMap.put(oldInputPos, mapNewInputToProjOutputs.get(
for (Integer oldInputPos : frame.oldToNewOutputs.keySet()) { combinedMap.put(oldInputPos, mapNewInputToProjOutputs.get(
<= rightFrame.corDefOutputs.keySet().size();
m.setType(dataPoint.getDataStoreDataType()); for (String name : tags.keySet())
public Set<Cell> getCellSet() { Set<Cell> cells = Sets.newHashSetWithExpectedSize(columns.size()); for (byte[] column : columns.keySet()) { cells.add(Cell.create(row, column)); } return cells; }
/** * Gets the set of tenors. * * @return the set of tenors */ public ImmutableSet<Tenor> getTenors() { return data.keySet(); }
/** * Gets the set of currencies for which this object contains values. * * @return the set of currencies for which this object contains values */ public Set<Currency> getCurrencies() { return values.keySet(); }
/** * Returns the comparator that orders the keys, which is * {@link Ordering#natural()} when the natural ordering of the keys is used. * Note that its behavior is not consistent with {@link TreeMap#comparator()}, * which returns {@code null} to indicate natural ordering. */ @Override public Comparator<? super K> comparator() { return keySet().comparator(); }
public Set<Cell> getCellSet() { Set<Cell> cells = Sets.newHashSetWithExpectedSize(columns.size()); for (byte[] column : columns.keySet()) { cells.add(Cell.create(row, column)); } return cells; }
/** * Gets the amount at the specified index. * * @param index the zero-based index to retrieve * @return the amount at the specified index */ public MultiCurrencyAmount get(int index) { List<CurrencyAmount> currencyAmounts = values.keySet().stream() .map(ccy -> CurrencyAmount.of(ccy, values.get(ccy).get(index))) .collect(toList()); return MultiCurrencyAmount.of(currencyAmounts); }
@Override protected List<String> create(String[] elements) { ImmutableSortedMap.Builder<String, Integer> builder = ImmutableSortedMap.naturalOrder(); for (int i = 0; i < elements.length; i++) { builder.put(elements[i], i); } return builder.build().keySet().asList(); }