Sets powerSet() function | Guava | Java
Last Updated :
15 Nov, 2018
Guava’s Sets.powerSet() returns the set of all possible subsets of set.
Syntax:
public static <E>
Set<Set<E>>
powerSet(Set<E> set)
Here, set is the set of elements to construct a power set from.
Return Value: This method returns the power set, as an immutable set of immutable sets.
Exceptions:
- IllegalArgumentException: If set has more than 30 unique elements, because this causes the power set size to exceed the int range.
- NullPointerException: If set is or contains null.
Note: The power set of the empty set is not the empty set, but a one-element set containing the empty set.
Example 1:
import com.google.common.collect.Sets;
import java.util.Set;
class GFG {
public static void main(String[] args)
{
Set<Integer>
set = Sets.newHashSet( 1 , 2 , 3 );
Set<Set<Integer> >
powerSet = Sets.powerSet(set);
for (Set<Integer> s : powerSet)
System.out.println(s);
}
}
|
Output:
[]
[1]
[2]
[1, 2]
[3]
[1, 3]
[2, 3]
[1, 2, 3]
Example 2:
import com.google.common.collect.Sets;
import java.util.Set;
class GFG {
public static void main(String[] args)
{
Set<String>
set = Sets.newHashSet( "G" , "F" , "g" );
Set<Set<String> >
powerSet = Sets.powerSet(set);
for (Set<String> s : powerSet)
System.out.println(s);
}
}
|
Output:
[]
[F]
[G]
[F, G]
[g]
[F, g]
[G, g]
[F, G, g]
Note: While the power set of a set with size n is of size 2^n, its memory usage is only O(n). When the power set is constructed, the input set is merely copied. Only as the power set is iterated are the individual subsets created, and these subsets themselves occupy only a small constant amount of memory.
Share your thoughts in the comments
Please Login to comment...