parameters: (self)
return_statement: return _chain.from_iterable(_starmap(_repeat, self.iteritems()))
docstring: Iterator over elements repeating each as many times as its count.
  
          >>> c = Counter('ABCABC')
          >>> sorted(c.elements())
          ['A', 'A', 'B', 'B', 'C', 'C']
  
          # Knuth's example for prime factors of 1836:  2**2 * 3**3 * 17**1
          >>> prime_factors = Counter({2: 2, 3: 3, 17: 1})
          >>> product = 1
          >>> for factor in prime_factors.elements():     # loop over factors
          ...     product *= factor                       # and multiply them
          >>> product
          1836
  
          Note, if an element's count has been set to zero or is a negative
          number, elements() will ignore it.
docstring_summary: Iterator over elements repeating each as many times as its count.
docstring_tokens: Iterator over elements repeating each as many times as its count .
function: def elements(self):
          '''Iterator over elements repeating each as many times as its count.
  
          >>> c = Counter('ABCABC')
          >>> sorted(c.elements())
          ['A', 'A', 'B', 'B', 'C', 'C']
  
          # Knuth's example for prime factors of 1836:  2**2 * 3**3 * 17**1
          >>> prime_factors = Counter({2: 2, 3: 3, 17: 1})
          >>> product = 1
          >>> for factor in prime_factors.elements():     # loop over factors
          ...     product *= factor                       # and multiply them
          >>> product
          1836
  
          Note, if an element's count has been set to zero or is a negative
          number, elements() will ignore it.
  
          '''
          # Emulate Bag.do from Smalltalk and Multiset.begin from C++.
          return _chain.from_iterable(_starmap(_repeat, self.iteritems()))
function_tokens: def elements ( self ) : # Emulate Bag.do from Smalltalk and Multiset.begin from C++. return _chain . from_iterable ( _starmap ( _repeat , self . iteritems ( ) ) )