Java SortedSet asSortedSet(T... elements)

Here you can find the source of asSortedSet(T... elements)

Description

Converts the given array of elements to a sortedset.

License

Apache License

Parameter

Parameter Description
elements The elements

Return

The elements as a set, empty if elements was null

Declaration

public static <T> SortedSet<T> asSortedSet(T... elements) 

Method Source Code

//package com.java2s;
/*/* www.  j  a va  2 s .c  o m*/
 * Copyright DbMaintain.org
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

import java.util.SortedSet;
import java.util.TreeSet;
import static java.util.Arrays.asList;

public class Main {
    /**
     * Converts the given array of elements to a sortedset.
     *
     * @param elements The elements
     * @return The elements as a set, empty if elements was null
     */
    public static <T> SortedSet<T> asSortedSet(T... elements) {
        SortedSet<T> result = new TreeSet<T>();
        if (elements == null) {
            return result;
        }
        result.addAll(asList(elements));
        return result;
    }
}

Related

  1. addMapEntry(Map> map, T1 keyEntry, T2 setEntry)
  2. arrayToSortedStringSet(Collection strings)
  3. asSortedSet(T... args)
  4. computeGraphCauselessFromGraphLmms( List>>> causesByDepByNameList)
  5. computeGraphCauselessFromGraphMms( SortedMap>> causesByDepByName)
  6. copyAndClearSet(SortedSet sourceSet)
  7. doubleForDescreteStartAndEnds(SortedSet hours)