(self, super_set, bitlist)
return Subset(ret_set, super_set)
Gets the subset defined by the bitlist.

        Examples
        ========

        >>> from sympy.combinatorics.subsets import Subset
        >>> Subset.subset_from_bitlist(['a','b','c','d'], '0011').subset
        ['c', 'd']

        See Also
        ========
        bitlist_from_subset
Gets the subset defined by the bitlist.
Gets the subset defined by the bitlist .
def subset_from_bitlist(self, super_set, bitlist):
        """
        Gets the subset defined by the bitlist.

        Examples
        ========

        >>> from sympy.combinatorics.subsets import Subset
        >>> Subset.subset_from_bitlist(['a','b','c','d'], '0011').subset
        ['c', 'd']

        See Also
        ========
        bitlist_from_subset
        """
        if len(super_set) != len(bitlist):
            raise ValueError("The sizes of the lists are not equal")
        ret_set = []
        for i in xrange(len(bitlist)):
            if bitlist[i] == '1':
                ret_set.append(super_set[i])
        return Subset(ret_set, super_set)
def subset_from_bitlist ( self , super_set , bitlist ) : if len ( super_set ) != len ( bitlist ) : raise ValueError ( "The sizes of the lists are not equal" ) ret_set = [ ] for i in xrange ( len ( bitlist ) ) : if bitlist [ i ] == '1' : ret_set . append ( super_set [ i ] ) return Subset ( ret_set , super_set )