Add missing since tags.
git-svn-id: https://svn.apache.org/repos/asf/commons/proper/collections/trunk@1479406 13f79535-47bb-0310-9956-ffa450edef68
This commit is contained in:
parent
9d32f4bbfd
commit
fc502e2479
|
@ -72,7 +72,7 @@ public class ListOrderedSet<E>
|
||||||
* @return a new ordered set
|
* @return a new ordered set
|
||||||
* @throws IllegalArgumentException if set or list is null
|
* @throws IllegalArgumentException if set or list is null
|
||||||
* @throws IllegalArgumentException if either the set or list is not empty
|
* @throws IllegalArgumentException if either the set or list is not empty
|
||||||
* @since 3.1
|
* @since 4.0
|
||||||
*/
|
*/
|
||||||
public static <E> ListOrderedSet<E> listOrderedSet(final Set<E> set, final List<E> list) {
|
public static <E> ListOrderedSet<E> listOrderedSet(final Set<E> set, final List<E> list) {
|
||||||
if (set == null) {
|
if (set == null) {
|
||||||
|
@ -96,6 +96,7 @@ public class ListOrderedSet<E>
|
||||||
* @param set the set to decorate, must not be null
|
* @param set the set to decorate, must not be null
|
||||||
* @return a new ordered set
|
* @return a new ordered set
|
||||||
* @throws IllegalArgumentException if set is null
|
* @throws IllegalArgumentException if set is null
|
||||||
|
* @since 4.0
|
||||||
*/
|
*/
|
||||||
public static <E> ListOrderedSet<E> listOrderedSet(final Set<E> set) {
|
public static <E> ListOrderedSet<E> listOrderedSet(final Set<E> set) {
|
||||||
return new ListOrderedSet<E>(set);
|
return new ListOrderedSet<E>(set);
|
||||||
|
@ -114,6 +115,7 @@ public class ListOrderedSet<E>
|
||||||
* @param list the list to decorate, must not be null
|
* @param list the list to decorate, must not be null
|
||||||
* @return a new ordered set
|
* @return a new ordered set
|
||||||
* @throws IllegalArgumentException if list is null
|
* @throws IllegalArgumentException if list is null
|
||||||
|
* @since 4.0
|
||||||
*/
|
*/
|
||||||
public static <E> ListOrderedSet<E> listOrderedSet(final List<E> list) {
|
public static <E> ListOrderedSet<E> listOrderedSet(final List<E> list) {
|
||||||
if (list == null) {
|
if (list == null) {
|
||||||
|
|
|
@ -54,6 +54,7 @@ public final class MapBackedSet<E, V> implements Set<E>, Serializable {
|
||||||
* @param map the map to decorate, must not be null
|
* @param map the map to decorate, must not be null
|
||||||
* @return a new map backed set
|
* @return a new map backed set
|
||||||
* @throws IllegalArgumentException if set is null
|
* @throws IllegalArgumentException if set is null
|
||||||
|
* @since 4.0
|
||||||
*/
|
*/
|
||||||
public static <E, V> MapBackedSet<E, V> mapBackedSet(final Map<E, ? super V> map) {
|
public static <E, V> MapBackedSet<E, V> mapBackedSet(final Map<E, ? super V> map) {
|
||||||
return mapBackedSet(map, null);
|
return mapBackedSet(map, null);
|
||||||
|
@ -68,6 +69,7 @@ public final class MapBackedSet<E, V> implements Set<E>, Serializable {
|
||||||
* @param dummyValue the dummy value to use
|
* @param dummyValue the dummy value to use
|
||||||
* @return a new map backed set
|
* @return a new map backed set
|
||||||
* @throws IllegalArgumentException if map is null
|
* @throws IllegalArgumentException if map is null
|
||||||
|
* @since 4.0
|
||||||
*/
|
*/
|
||||||
public static <E, V> MapBackedSet<E, V> mapBackedSet(final Map<E, ? super V> map, final V dummyValue) {
|
public static <E, V> MapBackedSet<E, V> mapBackedSet(final Map<E, ? super V> map, final V dummyValue) {
|
||||||
if (map == null) {
|
if (map == null) {
|
||||||
|
|
|
@ -54,6 +54,7 @@ public class PredicatedSet<E> extends PredicatedCollection<E> implements Set<E>
|
||||||
* @return a decorated set
|
* @return a decorated set
|
||||||
* @throws IllegalArgumentException if set or predicate is null
|
* @throws IllegalArgumentException if set or predicate is null
|
||||||
* @throws IllegalArgumentException if the set contains invalid elements
|
* @throws IllegalArgumentException if the set contains invalid elements
|
||||||
|
* @since 4.0
|
||||||
*/
|
*/
|
||||||
public static <E> PredicatedSet<E> predicatedSet(final Set<E> set, final Predicate<? super E> predicate) {
|
public static <E> PredicatedSet<E> predicatedSet(final Set<E> set, final Predicate<? super E> predicate) {
|
||||||
return new PredicatedSet<E>(set, predicate);
|
return new PredicatedSet<E>(set, predicate);
|
||||||
|
|
|
@ -54,6 +54,7 @@ public class PredicatedSortedSet<E> extends PredicatedSet<E> implements SortedSe
|
||||||
* @return a new predicated sorted set.
|
* @return a new predicated sorted set.
|
||||||
* @throws IllegalArgumentException if set or predicate is null
|
* @throws IllegalArgumentException if set or predicate is null
|
||||||
* @throws IllegalArgumentException if the set contains invalid elements
|
* @throws IllegalArgumentException if the set contains invalid elements
|
||||||
|
* @since 4.0
|
||||||
*/
|
*/
|
||||||
public static <E> PredicatedSortedSet<E> predicatedSortedSet(final SortedSet<E> set,
|
public static <E> PredicatedSortedSet<E> predicatedSortedSet(final SortedSet<E> set,
|
||||||
final Predicate<? super E> predicate) {
|
final Predicate<? super E> predicate) {
|
||||||
|
|
|
@ -51,6 +51,7 @@ public class TransformedSet<E> extends TransformedCollection<E> implements Set<E
|
||||||
* @param transformer the transformer to use for conversion, must not be null
|
* @param transformer the transformer to use for conversion, must not be null
|
||||||
* @return a new transformed set
|
* @return a new transformed set
|
||||||
* @throws IllegalArgumentException if set or transformer is null
|
* @throws IllegalArgumentException if set or transformer is null
|
||||||
|
* @since 4.0
|
||||||
*/
|
*/
|
||||||
public static <E> TransformedSet<E> transformingSet(final Set<E> set,
|
public static <E> TransformedSet<E> transformingSet(final Set<E> set,
|
||||||
final Transformer<? super E, ? extends E> transformer) {
|
final Transformer<? super E, ? extends E> transformer) {
|
||||||
|
|
|
@ -51,6 +51,7 @@ public class TransformedSortedSet<E> extends TransformedSet<E> implements Sorted
|
||||||
* @param transformer the transformer to use for conversion, must not be null
|
* @param transformer the transformer to use for conversion, must not be null
|
||||||
* @return a new transformed {@link SortedSet}
|
* @return a new transformed {@link SortedSet}
|
||||||
* @throws IllegalArgumentException if set or transformer is null
|
* @throws IllegalArgumentException if set or transformer is null
|
||||||
|
* @since 4.0
|
||||||
*/
|
*/
|
||||||
public static <E> TransformedSortedSet<E> transformingSortedSet(final SortedSet<E> set,
|
public static <E> TransformedSortedSet<E> transformingSortedSet(final SortedSet<E> set,
|
||||||
final Transformer<? super E, ? extends E> transformer) {
|
final Transformer<? super E, ? extends E> transformer) {
|
||||||
|
|
|
@ -47,6 +47,7 @@ public final class UnmodifiableSet<E>
|
||||||
* @param set the set to decorate, must not be null
|
* @param set the set to decorate, must not be null
|
||||||
* @return a new unmodifiable set
|
* @return a new unmodifiable set
|
||||||
* @throws IllegalArgumentException if set is null
|
* @throws IllegalArgumentException if set is null
|
||||||
|
* @since 4.0
|
||||||
*/
|
*/
|
||||||
public static <E> Set<E> unmodifiableSet(final Set<E> set) {
|
public static <E> Set<E> unmodifiableSet(final Set<E> set) {
|
||||||
if (set instanceof Unmodifiable) {
|
if (set instanceof Unmodifiable) {
|
||||||
|
|
|
@ -51,6 +51,7 @@ public final class UnmodifiableSortedSet<E>
|
||||||
* @param set the set to decorate, must not be null
|
* @param set the set to decorate, must not be null
|
||||||
* @return a new unmodifiable {@link SortedSet}
|
* @return a new unmodifiable {@link SortedSet}
|
||||||
* @throws IllegalArgumentException if set is null
|
* @throws IllegalArgumentException if set is null
|
||||||
|
* @since 4.0
|
||||||
*/
|
*/
|
||||||
public static <E> SortedSet<E> unmodifiableSortedSet(final SortedSet<E> set) {
|
public static <E> SortedSet<E> unmodifiableSortedSet(final SortedSet<E> set) {
|
||||||
if (set instanceof Unmodifiable) {
|
if (set instanceof Unmodifiable) {
|
||||||
|
|
Loading…
Reference in New Issue