def METHOD_NAME(self, hmap, count=None):
    if not count:
        count = self.SUBSET_SIZE
    values = (hmap.Leaf * count)()
    i = 0
    for _, v in sorted(hmap.items_lookup_batch(), key=lambda k:k[0].value):
        if i < count:
            values[i] = v.value * v.value
            i += 1
        else:
            break
    return values