docs: def sortedIndex(self, obj, iterator=lambda x: x):
          """
          Use a comparator function to figure out the smallest index at which
          an object should be inserted so as to maintain order.
          Uses binary search.
          """
          array = self.obj
          value = iterator(obj)
          low = 0
          high = len(array)
          while low < high:
              mid = (low + high) >> 1
              if iterator(array[mid]) < value:
                  low = mid + 1
              else:
                  high = mid
          return self._wrap(low)