class_docstr: Represents a basic subset object.
  
  Explanation
  ===========
  
  We generate subsets using essentially two techniques,
  binary enumeration and lexicographic enumeration.
  The Subset class takes two arguments, the first one
  describes the initial subset to consider and the second
  describes the superset.
  
  Examples
  ========
  
  >>> from sympy.combinatorics import Subset
  >>> a = Subset(['c', 'd'], ['a', 'b', 'c', 'd'])
  >>> a.next_binary().subset
  ['b']
  >>> a.prev_binary().subset
  ['c']
class_docstr_tok: ["Represents","a","basic","subset","object",".","Explanation","===========","We","generate","subsets","using","essentially","two","techniques",",","binary","enumeration","and","lexicographic","enumeration",".","The","Subset","class","takes","two","arguments",",","the","first","one","describes","the","initial","subset","to","consider","and","the","second","describes","the","superset",".","Examples","========",">",">",">","from","sympy.combinatorics","import","Subset",">",">",">","a","=","Subset","(","[","'","c","'",",","'d","'","]",",","[","'","a","'",",","'","b","'",",","'","c","'",",","'d","'","]",")",">",">",">","a.next_binary","(",")",".subset","[","'","b","'","]",">",">",">","a.prev_binary","(",")",".subset","[","'","c","'","]"]
docstr: Gets the subset defined by the bitlist.
  
  Examples
  ========
  
  >>> from sympy.combinatorics import Subset
  >>> Subset.subset_from_bitlist(['a', 'b', 'c', 'd'], '0011').subset
  ['c', 'd']
  
  See Also
  ========
  
  bitlist_from_subset
docstr_tok: ["Gets","the","subset","defined","by","the","bitlist",".","Examples","========",">",">",">","from","sympy.combinatorics","import","Subset",">",">",">","Subset.subset_from_bitlist","(","[","'","a","'",",","'","b","'",",","'","c","'",",","'d","'","]",",","'0011","'",")",".subset","[","'","c","'",",","'d","'","]","See","Also","========","bitlist_from_subset"]
code: def subset_from_bitlist(self, super_set, bitlist):
      """
      Gets the subset defined by the bitlist.
  
      Examples
      ========
  
      >>> from sympy.combinatorics 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 range(len(bitlist)):
          if bitlist[i] == "1":
              ret_set.append(super_set[i])
      return Subset(ret_set, super_set)
  
imports: from itertools import combinations
  from sympy.combinatorics.graycode import GrayCode
label_desc: Use image node_id 19 for calling the Subset obj's underlying member method code with example usage: obj.subset_from_bitlist(super_set, bitlist) and returns: Subset