Mark Welch Bezoar

## round_robin_zip.py
def round_robin_zip(*args):
    """
    Make an iterator that aggregates elements from each of the iterables.
    If the iterables are of uneven length, shorter iterables are re-iterated.
    Iteration continues until the longest iterable is exhausted.

    Derived from itertools.zip_longest().
    """
    iterators =	[iter(it) for it in args]
    orig_iterators = set(iterators)

## keybase.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                Bezoar
                / keybase.md
            
            
              Created
              April 11, 2017 23:27
            
              
                Keybase proof
              
          
    Keybase proof

I hereby claim:

I am bezoar on github.
I am bezoar (https://keybase.io/bezoar) on keybase.
I have a public key ASDPI7L4xK8EWl-CClB3ijRvoD9AQGphlZPrdhRQvrMmywo

To claim this, I am signing this object:

  
## gist:b192cdf43621cb750d46
Verifying that +bezoar is my openname (Bitcoin username). https://onename.io/bezoar
	def round_robin_zip(*args):
	"""
	Make an iterator that aggregates elements from each of the iterables.
	If the iterables are of uneven length, shorter iterables are re-iterated.
	Iteration continues until the longest iterable is exhausted.

	Derived from itertools.zip_longest().
	"""
	iterators = [iter(it) for it in args]
	orig_iterators = set(iterators)