code: def peek_many(self, n):
          
          if n == 0:
              return []
          elif n == 1:
              return [self.peek()]
          else:
              items = list(self.pop_many(n))
              self.update(items)
              return items
docs: Actually this can be quite inefficient
  
          Example:
              >>> # DISABLE_DOCTEST
              >>> import utool as ut
              >>> items = list(zip(range(256), range(256)))
              >>> n = 32
              >>> ut.shuffle(items)
              >>> self = ut.PriorityQueue(items, ascending=False)
              >>> self.peek_many(56)