Java NavigableSet.toArray方法代碼示例

import java.util.NavigableSet; //導入方法依賴的package包/類
/**
 * Get an ordered array of prices
 *
 * @param ascending when true, values are sorted in ascending order,
 * descending otherwise
 * @return n-th highest order or null if index out of bounds
 */
public Decimal[] getOrderedPrices(boolean ascending) {
    NavigableSet<Decimal> ns = ascending ? orders.navigableKeySet()
            : orders.descendingKeySet();
    Decimal[] prices = new Decimal[ns.size()];
    ns.toArray(prices);
    return prices;
}
 

import java.util.NavigableSet; //導入方法依賴的package包/類
/**
 * Factory method to create a transforming navigable set that will transform
 * existing contents of the specified navigable set.
 * <p>
 * If there are any elements already in the set being decorated, they
 * will be transformed by this method.
 * Contrast this with {@link #transformingNavigableSet(NavigableSet, Transformer)}.
 *
 * @param <E> the element type
 * @param set  the set to decorate, must not be null
 * @param transformer  the transformer to use for conversion, must not be null
 * @return a new transformed {@link NavigableSet}
 * @throws NullPointerException if set or transformer is null
 */
public static <E> TransformedNavigableSet<E> transformedNavigableSet(final NavigableSet<E> set,
        final Transformer<? super E, ? extends E> transformer) {

    final TransformedNavigableSet<E> decorated = new TransformedNavigableSet<E>(set, transformer);
    if (set.size() > 0) {
        @SuppressWarnings("unchecked") // set is type E
        final E[] values = (E[]) set.toArray(); // NOPMD - false positive for generics
        set.clear();
        for (final E value : values) {
            decorated.decorated().add(transformer.transform(value));
        }
    }
    return decorated;
}
 

import java.util.NavigableSet; //導入方法依賴的package包/類
/**
 * toArray contains all elements in sorted order
 */
public void testToArray() {
    NavigableSet q = populatedSet(SIZE);
    Object[] o = q.toArray();
    for (int i = 0; i < o.length; i++)
        assertSame(o[i], q.pollFirst());
}
 

import java.util.NavigableSet; //導入方法依賴的package包/類
/**
 * toArray(a) contains all elements in sorted order
 */
public void testToArray2() {
    NavigableSet<Integer> q = populatedSet(SIZE);
    Integer[] ints = new Integer[SIZE];
    Integer[] array = q.toArray(ints);
    assertSame(ints, array);
    for (int i = 0; i < ints.length; i++)
        assertSame(ints[i], q.pollFirst());
}
 

import java.util.NavigableSet; //導入方法依賴的package包/類
/**
 * toArray contains all elements
 */
public void testDescendingToArray() {
    NavigableSet q = populatedSet(SIZE);
    Object[] o = q.toArray();
    Arrays.sort(o);
    for (int i = 0; i < o.length; i++)
        assertEquals(o[i], q.pollFirst());
}
 

import java.util.NavigableSet; //導入方法依賴的package包/類
/**
 * Tests that the array has a size of 0.
 */
@Test(dataProvider = "NavigableSet<?>", dataProviderClass = EmptyNavigableSet.class)
public void testToArray(String description, NavigableSet<?> navigableSet) {
    Object[] emptyNavigableSetArray = navigableSet.toArray();

    assertTrue(emptyNavigableSetArray.length == 0, "Returned non-empty Array.");

    emptyNavigableSetArray = new Object[20];

    Object[] result = navigableSet.toArray(emptyNavigableSetArray);

    assertSame(emptyNavigableSetArray, result);

    assertTrue(result[0] == null);
}