2222namespace cudf {
2323namespace detail {
2424
25- /* *
26- * @brief Sort indices of a single column.
27- *
28- * This API offers fast sorting for primitive types. It cannot handle nested types and will not
29- * consider `NaN` as equivalent to other `NaN`.
30- *
31- * @tparam method Whether to use stable sort
32- * @param input Column to sort. The column data is not modified.
33- * @param column_order Ascending or descending sort order
34- * @param null_precedence How null rows are to be ordered
35- * @param stream CUDA stream used for device memory operations and kernel launches
36- * @param mr Device memory resource used to allocate the returned column's device memory
37- * @return Sorted indices for the input column.
38- */
39- template <sort_method method>
40- std::unique_ptr<column> sorted_order (column_view const & input,
41- order column_order,
42- null_order null_precedence,
43- rmm::cuda_stream_view stream,
44- rmm::device_async_resource_ref mr);
45-
4625/* *
4726 * @brief Comparator functor needed for single column sort.
4827 *
@@ -61,16 +40,16 @@ struct simple_comparator {
6140 }
6241 }
6342
64- auto left_elememt = d_column.type ().id () == type_id::DICTIONARY32
43+ auto left_element = d_column.type ().id () == type_id::DICTIONARY32
6544 ? d_column.child (dictionary_column_view::keys_column_index)
6645 .element <T>(d_column.element <dictionary32>(lhs).value ())
6746 : d_column.element <T>(lhs);
68- auto right_elememt = d_column.type ().id () == type_id::DICTIONARY32
47+ auto right_element = d_column.type ().id () == type_id::DICTIONARY32
6948 ? d_column.child (dictionary_column_view::keys_column_index)
7049 .element <T>(d_column.element <dictionary32>(rhs).value ())
7150 : d_column.element <T>(rhs);
7251
73- return relational_compare (left_elememt, right_elememt ) ==
52+ return relational_compare (left_element, right_element ) ==
7453 (ascending ? weak_ordering::LESS : weak_ordering::GREATER);
7554 }
7655 column_device_view const d_column;
0 commit comments