code: def get_sorted_graph(
              self,
              start=0,
              stop=100,
              slices=100,
              include_inf=False,
              exact=False):
          
  
          if not self.is_sorted:
              raise Exception("Not a sorted queue")
  
          with context.connections.redis.pipeline(transaction=exact) as pipe:
              interval = old_div(float(stop - start), slices)
              for i in range(0, slices):
                  pipe.zcount(self.redis_key,
                              (start + i * interval),
                              "(%s" % (start + (i + 1) * interval))
              if include_inf:
                  pipe.zcount(self.redis_key, stop, "+inf")
                  pipe.zcount(self.redis_key, "-inf", "(%s" % start)
              data = pipe.execute()
  
          if include_inf:
              return data[-1:] + data[:-1]
  
          return data
docs: Returns a graph of the distribution of jobs in a sorted set