/**
* Copyright (C) 2007 Google Inc.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
* This library 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 General Public License for more details.
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
*/
import java.util.Collections;
import java.util.HashSet;
import java.util.Set;
/**
* Helper methods related to {@link Set}s.
*
* @author maxr@google.com (Max Ross)
*/
public class Sets {
private Sets() {}
/**
* Construct a new {@link HashSet}, taking advantage of type inference to
* avoid specifying the type on the rhs.
*/
public static <E> HashSet<E> newHashSet() {
return new HashSet<E>();
}
/**
* Construct a new {@link HashSet} with the provided elements, taking advantage of type inference to
* avoid specifying the type on the rhs.
*/
public static <E> HashSet<E> newHashSet(E... elements) {
HashSet<E> set = newHashSet();
Collections.addAll(set, elements);
return set;
}
/**
* Construct a new {@link HashSet} with the contents of the provided {@link Iterable}, taking advantage of type inference to
* avoid specifying the type on the rhs.
*/
public static <E> HashSet<E> newHashSet(Iterable<? extends E> elements) {
HashSet<E> set = newHashSet();
for(E e : elements) {
set.add(e);
}
return set;
}
}
9.18.Set |
| 9.18.1. | Convert a List to a Set |
| 9.18.2. | Convert an ArrayList to HashSet |
| 9.18.3. | Creating a Sorted Set |
| 9.18.4. | Create new sets from Iterable, var argv |
| 9.18.5. | Create an array containing the elements in a set |
| 9.18.6. | Comparable with a sorted collection. |
| 9.18.7. | Duplicate elements are discarded |
| 9.18.8. | Creating a Set That Retains Order-of-Insertion |
| 9.18.9. | Convert Set into array |
| 9.18.10. | Convert Set into List |
| 9.18.11. | Copy all the elements from set2 to set1 (set1 += set2), set1 becomes the union of set1 and set2 |
| 9.18.12. | Remove all the elements in set1 from set2 (set1 -= set2), set1 becomes the asymmetric difference of set1 and set2 |
| 9.18.13. | Get the intersection of set1 and set2, set1 becomes the intersection of set1 and set2 |
| 9.18.14. | Set operations: union, intersection, difference, symmetric difference, is subset, is superset |
| 9.18.15. | Remove all elements from a set |
| 9.18.16. | List Set |
| 9.18.17. | Set implementation that use == instead of equals() |
| 9.18.18. | Set union and intersection |
| 9.18.19. | Set with values iterated in insertion order. |
| 9.18.20. | Implements the Set interface, backed by a ConcurrentHashMap instance |
| 9.18.21. | A weak HashSet: element stored in the WeakHashSet might be garbage collected |
| 9.18.22. | An IdentitySet that uses reference-equality instead of object-equality |
| 9.18.23. | A thin wrapper around a List transforming it into a modifiable Set. |
| 9.18.24. | Concurrent set |
| 9.18.25. | Set that compares object by identity rather than equality |