-
Notifications
You must be signed in to change notification settings - Fork 86
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
1. list_reverse_sort(list) Sorts the elements of the list in reverse order. 2. list_distinct(list) Removes all duplicates and NULLs from a list. Does not preserve the original order. 3. list_unique(list) Counts the unique elements of a list. 4. list_any_value(list) Returns the first non-null value in the list.
- Loading branch information
1 parent
4f75391
commit c9ddb83
Showing
11 changed files
with
653 additions
and
95 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
106 changes: 106 additions & 0 deletions
106
src/include/function/list/operations/base_list_sort_operation.h
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,106 @@ | ||
| #pragma once | ||
|
|
||
| #include "common/vector/value_vector.h" | ||
|
|
||
| namespace kuzu { | ||
| namespace function { | ||
| namespace operation { | ||
|
|
||
| struct BaseListSortOperation { | ||
| public: | ||
| static inline bool isAscOrder(const std::string& sortOrder) { | ||
| if (sortOrder == "ASC") { | ||
| return true; | ||
| } else if (sortOrder == "DESC") { | ||
| return false; | ||
| } else { | ||
| throw common::RuntimeException("Invalid sortOrder"); | ||
| } | ||
| } | ||
|
|
||
| static inline bool isNullFirst(const std::string& nullOrder) { | ||
| if (nullOrder == "NULLS FIRST") { | ||
| return true; | ||
| } else if (nullOrder == "NULLS LAST") { | ||
| return false; | ||
| } else { | ||
| throw common::RuntimeException("Invalid nullOrder"); | ||
| } | ||
| } | ||
|
|
||
| template<typename T> | ||
| static void sortValues(common::list_entry_t& input, common::list_entry_t& result, | ||
| common::ValueVector& inputVector, common::ValueVector& resultVector, bool ascOrder, | ||
| bool nullFirst) { | ||
| // TODO(Ziyi) - Replace this sort implementation with radix_sort implementation: | ||
| // https://github.com/kuzudb/kuzu/issues/1536. | ||
| auto inputValues = common::ListVector::getListValues(&inputVector, input); | ||
| auto inputDataVector = common::ListVector::getDataVector(&inputVector); | ||
|
|
||
| // Calculate null count. | ||
| auto nullCount = 0; | ||
| for (auto i = 0; i < input.size; i++) { | ||
| if (inputDataVector->isNull(input.offset + i)) { | ||
| nullCount += 1; | ||
| } | ||
| } | ||
|
|
||
| result = common::ListVector::addList(&resultVector, input.size); | ||
| auto resultValues = common::ListVector::getListValues(&resultVector, result); | ||
| auto resultDataVector = common::ListVector::getDataVector(&resultVector); | ||
| auto numBytesPerValue = resultDataVector->getNumBytesPerValue(); | ||
|
|
||
| // Add nulls first. | ||
| if (nullFirst) { | ||
| setVectorRangeToNull(*resultDataVector, result.offset, 0, nullCount); | ||
| resultValues += numBytesPerValue * nullCount; | ||
| } | ||
|
|
||
| // Add actual data. | ||
| for (auto i = 0; i < input.size; i++) { | ||
| if (inputDataVector->isNull(input.offset + i)) { | ||
| inputValues += numBytesPerValue; | ||
| continue; | ||
| } | ||
| common::ValueVectorUtils::copyValue( | ||
| resultValues, *resultDataVector, inputValues, *inputDataVector); | ||
| resultValues += numBytesPerValue; | ||
| inputValues += numBytesPerValue; | ||
| } | ||
|
|
||
| // Add nulls in the end. | ||
| if (!nullFirst) { | ||
| setVectorRangeToNull( | ||
| *resultDataVector, result.offset, input.size - nullCount, input.size); | ||
| resultValues += numBytesPerValue * nullCount; | ||
| } | ||
|
|
||
| // Determine the starting and ending position of the data to be sorted. | ||
| auto sortStart = nullCount; | ||
| auto sortEnd = input.size; | ||
| if (!nullFirst) { | ||
| sortStart = 0; | ||
| sortEnd = input.size - nullCount; | ||
| } | ||
|
|
||
| // Sort the data based on order. | ||
| auto sortingValues = | ||
| reinterpret_cast<T*>(common::ListVector::getListValues(&resultVector, result)); | ||
| if (ascOrder) { | ||
| std::sort(sortingValues + sortStart, sortingValues + sortEnd, std::less{}); | ||
| } else { | ||
| std::sort(sortingValues + sortStart, sortingValues + sortEnd, std::greater{}); | ||
| } | ||
| } | ||
|
|
||
| static void setVectorRangeToNull( | ||
| common::ValueVector& vector, uint64_t offset, uint64_t startPos, uint64_t endPos) { | ||
| for (auto i = startPos; i < endPos; i++) { | ||
| vector.setNull(offset + i, true); | ||
| } | ||
| } | ||
| }; | ||
|
|
||
| } // namespace operation | ||
| } // namespace function | ||
| } // namespace kuzu |
Oops, something went wrong.