hunk.code_window:         # in descending order and we only need to count the number of items
           # *greater than* the boundary value instead.
           col, _ = key[0]
           comp_fn = pac.greater if descending else pac.less
           boundary_indices = [
               pac.sum(comp_fn(table[col], b)).as_py() for b in boundaries
           ]
  
hunk.labels: keep keep keep add keep keep keep
hunk.after_edit:         # TODO(ekl) this is O(n^2) but in practice it's much faster than the
           # O(n) algorithm, could be optimized.
  
hunk.file_path: python/ray/data/impl/arrow_block.py
hunk.type: add
file: :orphan:
  
  skopt_example
  ~~~~~~~~~~~~~
  
  .. literalinclude:: /../../python/ray/tune/examples/skopt_example.py
  