Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

GH-38372: [C++] replace memo table with a swiss table like implementation #40915

Draft
wants to merge 8 commits into
base: main
Choose a base branch
from
Draft
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 2 additions & 4 deletions cpp/src/arrow/compute/kernels/scalar_set_lookup.cc
Original file line number Diff line number Diff line change
Expand Up @@ -49,15 +49,13 @@ struct SetLookupState : public SetLookupStateBase {
const ArrayData& value_set = *options.value_set.array();
memo_index_to_value_index.reserve(value_set.length);
lookup_table =
MemoTable(memory_pool,
::arrow::internal::HashTable<char>::kLoadFactor * value_set.length);
MemoTable(memory_pool, value_set.length);
RETURN_NOT_OK(AddArrayValueSet(options, *options.value_set.array()));
} else if (options.value_set.kind() == Datum::CHUNKED_ARRAY) {
const ChunkedArray& value_set = *options.value_set.chunked_array();
memo_index_to_value_index.reserve(value_set.length());
lookup_table =
MemoTable(memory_pool,
::arrow::internal::HashTable<char>::kLoadFactor * value_set.length());
MemoTable(memory_pool, value_set.length());

int64_t offset = 0;
for (const std::shared_ptr<Array>& chunk : value_set.chunks()) {
Expand Down
Loading
Loading