jaraco/itertools.py
def get_first_n_queues(self, n):
		"""
		Run through the sequence until n queues are created and return
		them. If fewer are created, return those plus empty iterables to
		compensate.
		"""
		try:
			while len(self.queues) < n:
				self.__fetch__()
		except StopIteration:
			pass
		values = list(self.queues.values())
		missing = n - len(values)
		values.extend(iter([]) for n in range(missing))
		return values
def get_first_n_queues(self, n):
		try:
			while len(self.queues) < n:
				self.__fetch__()
		except StopIteration:
			pass
		values = list(self.queues.values())
		missing = n - len(values)
		values.extend(iter([]) for n in range(missing))
		return values
def get_first_n_queues ( self , n ) : try : while len ( self . queues ) < n : self . __fetch__ ( ) except StopIteration : pass values = list ( self . queues . values ( ) ) missing = n - len ( values ) values . extend ( iter ( [ ] ) for n in range ( missing ) ) return values
Run through the sequence until n queues are created and return
		them. If fewer are created, return those plus empty iterables to
		compensate.
Run through the sequence until n queues are created and return them . If fewer are created return those plus empty iterables to compensate .