Java tutorial
//package com.java2s; /* * This file is part of McIDAS-V * * Copyright 2007-2015 * Space Science and Engineering Center (SSEC) * University of Wisconsin - Madison * 1225 W. Dayton Street, Madison, WI 53706, USA * http://www.ssec.wisc.edu/mcidas * * All Rights Reserved * * McIDAS-V is built on Unidata's IDV and SSEC's VisAD libraries, and * some McIDAS-V source code is based on IDV and VisAD source code. * * McIDAS-V is free software; you can redistribute it and/or modify * it under the terms of the GNU Lesser Public License as published by * the Free Software Foundation; either version 3 of the License, or * (at your option) any later version. * * McIDAS-V is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser Public License for more details. * * You should have received a copy of the GNU Lesser Public License * along with this program. If not, see http://www.gnu.org/licenses. */ import java.util.Collections; import java.util.LinkedHashSet; import java.util.Set; public class Main { /** * Creates a {@link Set} from incoming {@literal "varargs"}. Currently uses * {@link LinkedHashSet} as the {@code Set} implementation (to preserve * ordering). * * <p>Used like so:<pre> * for (String s : set("beep", "boop", "blorp")) { ... }</pre> * * @param elements Items that will appear within the returned {@code Set}. * Cannot be {@code null}, and (for now) the items should be of the * <i>same</i> type. * * @return A {@code Set} containing the items in {@code elements}. Remember * that {@code Set}s only contain <i>unique</i> elements! */ public static <E> Set<E> set(E... elements) { Set<E> newSet = new LinkedHashSet<>(elements.length); Collections.addAll(newSet, elements); return newSet; } }