Unaligned
Unaligned<off_t>* values = node->Values();
Unaligned<off_t>* values = node->Values();
Unaligned<off_t>* values = node->Values();
Unaligned<off_t>* values = node->Values();
Unaligned<uint16>* keyLengths = node->KeyLengths();
Unaligned<off_t>* newValues = node->Values();
Unaligned<uint16>* newKeyLengths = node->KeyLengths();
Unaligned<uint16>* inKeyLengths = node->KeyLengths();
Unaligned<off_t>* inKeyValues = node->Values();
Unaligned<uint16>* outKeyLengths = other->KeyLengths();
Unaligned<off_t>* outKeyValues = other->Values();
Unaligned<off_t>* values = node->Values();
Unaligned<off_t>* values = node->Values();
Unaligned<uint16>* keyLengths = node->KeyLengths();
Unaligned<off_t>* newValues = node->Values();
Unaligned<uint16>* newKeyLengths = node->KeyLengths();
Unaligned<off_t>* values = parent->Values();
Unaligned<uint16>* keyLengths = KeyLengths();
inline Unaligned<uint16>* KeyLengths() const;
inline Unaligned<off_t>* Values() const;
inline Unaligned<uint16>*
return (Unaligned<uint16>*)(((char*)this) + key_align(sizeof(bplustree_node)
inline Unaligned<off_t>*
return (Unaligned<off_t>*)(
Unaligned<T>& operator=(const T& newValue)
Unaligned<off_t>* value = node->Values() + i;