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: {
    "broadcast_time": 611.015479593,
    "object_size": 1073741824,
    "num_nodes": 50,
    "success": "1",
    "_runtime": 620.4363269805908,
    "_session_url": "https://beta.anyscale.com/o/anyscale-internal/projects/prj_2xR6uT6t7jJuu1aCwWMsle/clusters/ses_Chj4PHZqrEjbzc8Ni4RY1Fev",
    "_commit_url": "https://s3-us-west-2.amazonaws.com/ray-wheels/releases/1.7.0/2367a2cb9033913b68b1230316496ae273c25b54/ray-1.7.0-cp37-cp37m-manylinux2014_x86_64.whl",
    "_stable": true
  }
  