Expand description

This module provides the bisect function, which implements binary search.

Functions

  • This function searches for a tuple of given values (target) among the given rows (item_columns) using the bisection algorithm. It assumes that item_columns is sorted according to sort_options and returns the insertion index of target. Template argument SIDE being true/false means left/right insertion.
  • This function compares two tuples depending on the given sort options.
  • This function finds the partition points according to partition_columns. If there are no sort columns, then the result will be a single element vector containing one partition range spanning all data.
  • This function searches for a tuple of given values (target) among a slice of the given rows (item_columns) using the bisection algorithm. The slice starts at the index low and ends at the index high. The boolean-valued function compare_fn specifies whether we bisect on the left (by returning false), or on the right (by returning true) when we compare the target value with the current value as we iteratively bisect the input.
  • Construct a new Vec of ArrayRef from the rows of the arrays at the indices.
  • This function “takes” the elements at indices from the slice items.
  • Construct a new RecordBatch from the rows of the record_batch at the indices.
  • Given column vectors, returns row at idx.
  • This function searches for a tuple of given values (target) among the given rows (item_columns) via a linear scan. It assumes that item_columns is sorted according to sort_options and returns the insertion index of target. Template argument SIDE being true/false means left/right insertion.
  • This function finds the longest prefix of the form 0, 1, 2, … within the collection sequence. Examples:
  • Wraps identifier string in double quotes, escaping any double quotes in the identifier by replacing it with two double quotes
  • This function searches for a tuple of given values (target) among a slice of the given rows (item_columns) via a linear scan. The slice starts at the index low and ends at the index high. The boolean-valued function compare_fn specifies the stopping criterion.