foedus::snapshot::MergeSort::AdjustComparatorMasstree Struct Reference

Used in batch_sort_adjust_sort if the storage is a masstree storage. More...

Detailed Description

Used in batch_sort_adjust_sort if the storage is a masstree storage.

This comparator is actually a valid comparator for any case. But, it's slower, so used only where we need to.

Definition at line 258 of file merge_sort.hpp.

#include <merge_sort.hpp>

Collaboration diagram for foedus::snapshot::MergeSort::AdjustComparatorMasstree:

Public Member Functions
	AdjustComparatorMasstree (PositionEntry *position_entries, InputStatus *inputs_status)
bool	operator() (const SortEntry &left, const SortEntry &right) const __attribute__((always_inline))

Public Attributes
PositionEntry *	position_entries_
InputStatus *	inputs_status_

Constructor & Destructor Documentation

foedus::snapshot::MergeSort::AdjustComparatorMasstree::AdjustComparatorMasstree ( PositionEntry *  position_entries, InputStatus *  inputs_status  )

inline

Definition at line 259 of file merge_sort.hpp.

      : position_entries_(position_entries), inputs_status_(inputs_status) {}

Member Function Documentation

bool foedus::snapshot::MergeSort::AdjustComparatorMasstree::operator() ( const SortEntry &  left, const SortEntry &  right  ) const

inline

Definition at line 261 of file merge_sort.hpp.

References ASSERT_ND, foedus::storage::masstree::MasstreeCommonLogType::compare_logs(), foedus::snapshot::MergeSort::InputStatus::from_compact_pos(), foedus::snapshot::MergeSort::PositionEntry::input_index_, foedus::snapshot::MergeSort::PositionEntry::input_position_, inputs_status_, and position_entries_.

                                                                                               {
      ASSERT_ND(left.get_key() <= right.get_key());
      if (left.get_key() < right.get_key()) {
        return true;
      }
      MergedPosition left_index = left.get_position();
      MergedPosition right_index = right.get_position();
      const PositionEntry& left_pos = position_entries_[left_index];
      const PositionEntry& right_pos = position_entries_[right_index];
      const storage::masstree::MasstreeCommonLogType* left_casted
        = reinterpret_cast<const storage::masstree::MasstreeCommonLogType*>(
          inputs_status_[left_pos.input_index_].from_compact_pos(left_pos.input_position_));
      const storage::masstree::MasstreeCommonLogType* right_casted
        = reinterpret_cast<const storage::masstree::MasstreeCommonLogType*>(
          inputs_status_[right_pos.input_index_].from_compact_pos(right_pos.input_position_));
      int cmp = storage::masstree::MasstreeCommonLogType::compare_logs(left_casted, right_casted);
      return cmp < 0 || (cmp == 0 && left_index < right_index);
    }

Here is the call graph for this function:

Member Data Documentation

InputStatus* foedus::snapshot::MergeSort::AdjustComparatorMasstree::inputs_status_

Definition at line 280 of file merge_sort.hpp.

Referenced by operator()().

PositionEntry* foedus::snapshot::MergeSort::AdjustComparatorMasstree::position_entries_

Definition at line 279 of file merge_sort.hpp.

Referenced by operator()().

---

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

• /home/shino/foedus_code/foedus-core/include/foedus/snapshot/merge_sort.hpp