All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.google.android.collect.Sets Maven / Gradle / Ivy

Go to download

A library jar that provides APIs for Applications written for the Google Android Platform.

There is a newer version: 14-robolectric-10818077
Show newest version
/*
 * Copyright (C) 2007 The Android Open Source Project
 *
 * 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.
 */

package com.google.android.collect;

import android.util.ArraySet;

import java.util.Collections;
import java.util.EnumSet;
import java.util.HashSet;
import java.util.SortedSet;
import java.util.TreeSet;

/**
 * Provides static methods for creating mutable {@code Set} instances easily and
 * other static methods for working with Sets.
 *
 */
public class Sets {
    
    /**
     * Creates an empty {@code HashSet} instance.
     *
     * 

Note: if {@code E} is an {@link Enum} type, use {@link * EnumSet#noneOf} instead. * *

Note: if you only need an immutable empty Set, * use {@link Collections#emptySet} instead. * * @return a newly-created, initially-empty {@code HashSet} */ public static HashSet newHashSet() { return new HashSet(); } /** * Creates a {@code HashSet} instance containing the given elements. * *

Note: due to a bug in javac 1.5.0_06, we cannot support the * following: * *

{@code Set set = Sets.newHashSet(sub1, sub2);} * *

where {@code sub1} and {@code sub2} are references to subtypes of {@code * Base}, not of {@code Base} itself. To get around this, you must use: * *

{@code Set set = Sets.newHashSet(sub1, sub2);} * * @param elements the elements that the set should contain * @return a newly-created {@code HashSet} containing those elements (minus * duplicates) */ public static HashSet newHashSet(E... elements) { int capacity = elements.length * 4 / 3 + 1; HashSet set = new HashSet(capacity); Collections.addAll(set, elements); return set; } /** * Creates an empty {@code SortedSet} instance. * * @return a newly-created, initially-empty {@code SortedSet}. */ public static SortedSet newSortedSet() { return new TreeSet(); } /** * Creates a {@code SortedSet} instance containing the given elements. * * @param elements the elements that the set should contain * @return a newly-created {@code SortedSet} containing those elements (minus * duplicates) */ public static SortedSet newSortedSet(E... elements) { SortedSet set = new TreeSet(); Collections.addAll(set, elements); return set; } /** * Creates a {@code ArraySet} instance. */ public static ArraySet newArraySet() { return new ArraySet(); } /** * Creates a {@code ArraySet} instance containing the given elements. */ public static ArraySet newArraySet(E... elements) { int capacity = elements.length * 4 / 3 + 1; ArraySet set = new ArraySet(capacity); Collections.addAll(set, elements); return set; } }





© 2015 - 2024 Weber Informatics LLC | Privacy Policy