Go to the documentation of this file.
52 std::vector<order>
const& column_order = {},
53 std::vector<null_order>
const& null_precedence = {},
66 std::vector<order>
const& column_order = {},
67 std::vector<null_order>
const& null_precedence = {},
87 std::vector<order>
const& column_order,
88 std::vector<null_order>
const& null_precedence);
106 std::vector<order>
const& column_order = {},
107 std::vector<null_order>
const& null_precedence = {},
134 std::vector<order>
const& column_order = {},
135 std::vector<null_order>
const& null_precedence = {},
164 std::vector<order>
const& column_order = {},
165 std::vector<null_order>
const& null_precedence = {},
251 std::vector<order>
const& column_order = {},
252 std::vector<null_order>
const& null_precedence = {},
263 std::vector<order>
const& column_order = {},
264 std::vector<null_order>
const& null_precedence = {},
317 std::vector<order>
const& column_order = {},
318 std::vector<null_order>
const& null_precedence = {},
330 std::vector<order>
const& column_order = {},
331 std::vector<null_order>
const& null_precedence = {},
rank_method
Tie-breaker method to use for ranking the column.
null_policy
Enum to specify whether to include nulls or exclude nulls.
std::unique_ptr< table > sort_by_key(table_view const &values, table_view const &keys, std::vector< order > const &column_order={}, std::vector< null_order > const &null_precedence={}, rmm::mr::device_memory_resource *mr=rmm::mr::get_current_device_resource())
Performs a key-value sort.
A non-owning, immutable view of device data as a column of elements, some of which may be null as ind...
Type declarations for libcudf.
A set of cudf::column's of the same size.
std::unique_ptr< column > rank(column_view const &input, rank_method method, order column_order, null_policy null_handling, null_order null_precedence, bool percentage, rmm::mr::device_memory_resource *mr=rmm::mr::get_current_device_resource())
Computes the ranks of input column in sorted order.
std::unique_ptr< column > stable_sorted_order(table_view const &input, std::vector< order > const &column_order={}, std::vector< null_order > const &null_precedence={}, rmm::mr::device_memory_resource *mr=rmm::mr::get_current_device_resource())
Computes the row indices that would produce input in a stable lexicographical sorted order.
std::unique_ptr< table > segmented_sort_by_key(table_view const &values, table_view const &keys, column_view const &segment_offsets, std::vector< order > const &column_order={}, std::vector< null_order > const &null_precedence={}, rmm::mr::device_memory_resource *mr=rmm::mr::get_current_device_resource())
Performs a lexicographic segmented sort of a table.
std::unique_ptr< table > stable_sort_by_key(table_view const &values, table_view const &keys, std::vector< order > const &column_order={}, std::vector< null_order > const &null_precedence={}, rmm::mr::device_memory_resource *mr=rmm::mr::get_current_device_resource())
Performs a key-value stable sort.
null_order
Indicates how null values compare against all other values.
bool is_sorted(cudf::table_view const &table, std::vector< order > const &column_order, std::vector< null_order > const &null_precedence)
Checks whether the rows of a table are sorted in a lexicographical order.
std::unique_ptr< column > stable_segmented_sorted_order(table_view const &keys, column_view const &segment_offsets, std::vector< order > const &column_order={}, std::vector< null_order > const &null_precedence={}, rmm::mr::device_memory_resource *mr=rmm::mr::get_current_device_resource())
Returns sorted order after stably sorting each segment in the table.
A set of cudf::column_view's of the same size.
std::unique_ptr< column > segmented_sorted_order(table_view const &keys, column_view const &segment_offsets, std::vector< order > const &column_order={}, std::vector< null_order > const &null_precedence={}, rmm::mr::device_memory_resource *mr=rmm::mr::get_current_device_resource())
Returns sorted order after sorting each segment in the table.
std::unique_ptr< column > sorted_order(table_view const &input, std::vector< order > const &column_order={}, std::vector< null_order > const &null_precedence={}, rmm::mr::device_memory_resource *mr=rmm::mr::get_current_device_resource())
Computes the row indices that would produce input in a lexicographical sorted order.
std::unique_ptr< table > stable_segmented_sort_by_key(table_view const &values, table_view const &keys, column_view const &segment_offsets, std::vector< order > const &column_order={}, std::vector< null_order > const &null_precedence={}, rmm::mr::device_memory_resource *mr=rmm::mr::get_current_device_resource())
Performs a stably lexicographic segmented sort of a table.
Representation for specifying desired aggregations from aggregation-based APIs, e....
std::unique_ptr< table > sort(table_view const &input, std::vector< order > const &column_order={}, std::vector< null_order > const &null_precedence={}, rmm::mr::device_memory_resource *mr=rmm::mr::get_current_device_resource())
Performs a lexicographic sort of the rows of a table.
order
Indicates the order in which elements should be sorted.