de.weltraumschaf.commons.guava

Class Sets

java.lang.Object

de.weltraumschaf.commons.guava.Sets

public final class Sets
extends Object

Minimal set of com.google.common.collect.Sets.

Since:

2.0 (imported from Google Collections Library)

Author:

Kevin Bourrillion, Jared Levy, Chris Povirk

Field Summary

Fields

Modifier and Type	Field and Description
private static int	THIRD Capacity ratio.

Constructor Summary

Constructors

Modifier	Constructor and Description
private	Sets() Hidden for pure static factory.

Method Summary

Methods

Modifier and Type	Method and Description
(package private) static int	capacity(int expectedSize) Returns a capacity that is sufficient to keep the map from being resized as long as it grows no larger than expectedSize and the load factor is >= its default (0.75).
static <E> Set<E>	newHashSet(E... elements) Creates a mutable HashSet instance containing the given elements in unspecified order.
static <E> Set<E>	newHashSetWithExpectedSize(int expectedSize) Creates a HashSet instance, with a high enough "initial capacity" that it should hold expectedSize elements without growth.
static <E> SortedSet<E>	newTreeSet()

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

THIRD

private static final int THIRD

Capacity ratio.

See Also:

Constant Field Values

Constructor Detail

Sets

private Sets()

Hidden for pure static factory.

Method Detail

capacity

static int capacity(int expectedSize)

Returns a capacity that is sufficient to keep the map from being resized as long as it grows no larger than expectedSize and the load factor is >= its default (0.75).

Parameters:

expectedSize - must not be negative

Returns:

not negative

newHashSet

public static <E> Set<E> newHashSet(E... elements)

Creates a mutable HashSet instance containing the given elements in unspecified order.

Type Parameters:

E - type of elements

Parameters:

elements - the elements that the set should contain

Returns:

a new HashSet containing those elements (minus duplicates)

newHashSetWithExpectedSize

public static <E> Set<E> newHashSetWithExpectedSize(int expectedSize)

Creates a HashSet instance, with a high enough "initial capacity" that it should hold expectedSize elements without growth.

This behavior cannot be broadly guaranteed, but it is observed to be true for OpenJDK 1.6. It also can't be guaranteed that the method isn't inadvertently oversizing the returned set.

Type Parameters:

E - type of elements

Parameters:

expectedSize - the number of elements you expect to add to the returned set

Returns:

a new, empty HashSet with enough capacity to hold expectedSize elements without resizing //CHECKSTYLE:OFF

Throws:

IllegalArgumentException - if expectedSize is negative //CHECKSTYLE:ON

newTreeSet

public static <E> SortedSet<E> newTreeSet()