Collaboration diagram for impala::OldHashTable::Node:

Public Attributes
bool	matched

uint32_t	hash

Node *	next

void *	data

Detailed Description

TODO: bit pack this struct. The default alignment makes this struct have a lot of wasted bytes.

Definition at line 328 of file old-hash-table.h.

Member Data Documentation

void* impala::OldHashTable::Node::data

Definition at line 338 of file old-hash-table.h.

Referenced by impala::OldHashTable::DebugString(), impala::OldHashTable::Iterator::GetRow(), impala::OldHashTable::GetRow(), impala::OldHashTable::Iterator::GetTuple(), and impala::OldHashTable::InsertImpl().

uint32_t impala::OldHashTable::Node::hash

Definition at line 336 of file old-hash-table.h.

Referenced by impala::OldHashTable::Find(), impala::OldHashTable::InsertImpl(), impala::OldHashTable::Iterator::Next(), and impala::OldHashTable::ResizeBuckets().

bool impala::OldHashTable::Node::matched

Only used for full/right outer hash join to indicate if this row has been matched. From an abstraction point of view, this is an awkward place to store this information but it is very efficient here. This space is otherwise unused (and we can bitpack this more in the future).

Definition at line 334 of file old-hash-table.h.

Referenced by impala::OldHashTable::DebugString(), impala::OldHashTable::FirstUnmatched(), impala::OldHashTable::InsertImpl(), impala::OldHashTable::Iterator::matched(), and impala::OldHashTable::Iterator::set_matched().

Node* impala::OldHashTable::Node::next

Definition at line 337 of file old-hash-table.h.

Referenced by impala::OldHashTable::AddToBucket(), impala::OldHashTable::DebugString(), impala::OldHashTable::Find(), impala::OldHashTable::FirstUnmatched(), impala::OldHashTable::MoveNode(), impala::OldHashTable::Iterator::Next(), and impala::OldHashTable::ResizeBuckets().

The documentation for this struct was generated from the following file:

be/src/exec/old-hash-table.h

Public Attributes

Detailed Description

Member Data Documentation