(super_set, bitstring)
return [super_set[i] for i, j in enumerate(bitstring)
            if bitstring[i] == '1']
Gets the subset defined by the bitstring.

    Examples
    ========

    >>> from sympy.combinatorics.graycode import get_subset_from_bitstring
    >>> get_subset_from_bitstring(['a','b','c','d'], '0011')
    ['c', 'd']
    >>> get_subset_from_bitstring(['c','a','c','c'], '1100')
    ['c', 'a']

    See Also
    ========
    graycode_subsets
Gets the subset defined by the bitstring.
Gets the subset defined by the bitstring .
def get_subset_from_bitstring(super_set, bitstring):
    """
    Gets the subset defined by the bitstring.

    Examples
    ========

    >>> from sympy.combinatorics.graycode import get_subset_from_bitstring
    >>> get_subset_from_bitstring(['a','b','c','d'], '0011')
    ['c', 'd']
    >>> get_subset_from_bitstring(['c','a','c','c'], '1100')
    ['c', 'a']

    See Also
    ========
    graycode_subsets
    """
    if len(super_set) != len(bitstring):
        raise ValueError("The sizes of the lists are not equal")
    return [super_set[i] for i, j in enumerate(bitstring)
            if bitstring[i] == '1']
def get_subset_from_bitstring ( super_set , bitstring ) : if len ( super_set ) != len ( bitstring ) : raise ValueError ( "The sizes of the lists are not equal" ) return [ super_set [ i ] for i , j in enumerate ( bitstring ) if bitstring [ i ] == '1' ]