25 namespace sequential {
28 : engine_(parent->get_engine()),
29 id_(parent->get_storage_id()),
61 o <<
"<SequentialPartitioner>"
62 <<
"</SequentialPartitioner>";
uint32_t * written_count_
[OUT] how many logs written to output_buffer.
PartitionId * results_
[OUT] this method will set the partition of logs[i] to results[i].
uint32_t logs_count_
number of entries to process.
std::ostream & operator<<(std::ostream &o, const SequentialCursor &v)
SequentialPartitioner(Partitioner *parent)
Root package of FOEDUS (Fast Optimistic Engine for Data Unification Services).
uint32_t logs_count_
number of entries to process.
uint32_t BufferPosition
Represents a position in some buffer.
Brings error stacktrace information as return value of functions.
ErrorStack design_partition(const Partitioner::DesignPartitionArguments &args)
snapshot::BufferPosition * output_buffer_
sorted results are written to this variable.
void sort_batch(const Partitioner::SortBatchArguments &args) const
const snapshot::BufferPosition * log_positions_
positions of log records.
Partitioner for an sequential storage.
const ErrorStack kRetOk
Normal return value for no-error case.
Partitioning and sorting logic for one storage.
Arguments for sort_batch()
void partition_batch(const Partitioner::PartitionBatchArguments &args) const
Arguments for design_partition()
PartitionId local_partition_
The node the caller (mapper) resides in.
Arguments for partition_batch()