search#

2026-03-11

20 min read time

Applies to Linux

pylibhipdf.search.contains(Column haystack, Column needles, Stream stream=None) Column#

Check whether needles are present in haystack.

For details, see contains().

Parameters#

haystackColumn

The search space.

needlesColumn

The values for which to search.

streamStream | None

CUDA stream on which to perform the operation.

Returns#

Column

Boolean indicator for each needle.

pylibhipdf.search.lower_bound(Table haystack, Table needles, list column_order, list null_precedence, Stream stream=None) Column#

Find smallest indices in haystack where needles may be inserted to retain order.

For details, see lower_bound().

Parameters#

haystackTable

The search space.

needlesTable

The values for which to find insertion points.

column_orderList[ColumnOrder]

Whether each column should be sorted in ascending or descending order.

null_precedenceList[NullOrder]

Whether nulls should come before or after non-nulls.

streamStream | None

CUDA stream on which to perform the operation.

Returns#

Column

The insertion points

pylibhipdf.search.upper_bound(Table haystack, Table needles, list column_order, list null_precedence, Stream stream=None) Column#

Find largest indices in haystack where needles may be inserted to retain order.

For details, see upper_bound().

Parameters#

haystackTable

The search space.

needlesTable

The values for which to find insertion points.

column_orderList[ColumnOrder]

Whether each column should be sorted in ascending or descending order.

null_precedenceList[NullOrder]

Whether nulls should come before or after non-nulls.

streamStream | None

CUDA stream on which to perform the operation.

Returns#

Column

The insertion points