anonymous_namespace{HashTable.cpp}::keyed_hash Namespace Reference

Functions
template<typename T >
void	to_set_one_to_one (const int8_t *ptr1, size_t entry_count, size_t key_component_count, DecodedJoinHashBufferSet &s)
template<typename T >
void	to_set_one_to_many (const int8_t *ptr1, const int32_t *const ptr2, const int32_t *const ptr3, const int32_t *const ptr4, size_t entry_count, size_t key_component_count, DecodedJoinHashBufferSet &s)

Function Documentation

template<typename T >

void anonymous_namespace{HashTable.cpp}::keyed_hash::to_set_one_to_many	(	const int8_t *	ptr1,
		const int32_t *const	ptr2,
		const int32_t *const	ptr3,
		const int32_t *const	ptr4,
		size_t	entry_count,
		size_t	key_component_count,
		DecodedJoinHashBufferSet &	s
	)

Definition at line 101 of file HashTable.cpp.

References DecodedJoinHashBufferEntry::payload, and heavydb.dtypes::T.

                                                     {
  auto empty = get_empty_key<T>();
  auto ptr = reinterpret_cast<const T*>(ptr1);
  for (size_t e = 0; e < entry_count; ++e, ptr += key_component_count) {
    if (*ptr == empty) {
      continue;
    }

    std::vector<int64_t> key;
    size_t j = 0;
    for (; j < key_component_count - 1; ++j) {
      key.push_back(ptr[j]);
    }

    int32_t offset = ptr2[e];

    int32_t count = ptr3[e];

    decltype(DecodedJoinHashBufferEntry::payload) payload;
    for (size_t j = 0; j < static_cast<size_t>(count); ++j) {
      payload.insert(ptr4[offset + j]);
    }

    s.insert({std::move(key), std::move(payload)});
  }
}

template<typename T >

void anonymous_namespace{HashTable.cpp}::keyed_hash::to_set_one_to_one	(	const int8_t *	ptr1,
		size_t	entry_count,
		size_t	key_component_count,
		DecodedJoinHashBufferSet &	s
	)

Definition at line 76 of file HashTable.cpp.

References heavydb.dtypes::T.

                                                    {
  auto empty = get_empty_key<T>();
  auto ptr = reinterpret_cast<const T*>(ptr1);
  for (size_t e = 0; e < entry_count; ++e, ptr += key_component_count) {
    if (*ptr == empty) {
      continue;
    }

    std::vector<int64_t> key;
    size_t j = 0;
    for (; j < key_component_count - 1; ++j) {
      key.push_back(ptr[j]);
    }

    std::set<int32_t> payload;
    payload.insert(ptr[j]);

    s.insert({std::move(key), std::move(payload)});
  }
}