SortNode< ValueType, CompareFunction, SortAlgorithm, Stable > Member List

This is the complete list of members for SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >, including all inherited members.

AddChild(DIABase *node, const Callback &callback=Callback(), size_t parent_index=0)	DIANode< ValueType >	inlinevirtual
Callback typedef	DIANode< ValueType >
children() const override	DIANode< ValueType >	inlinevirtual
children_	DIANode< ValueType >	protected
compare_function_	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	private
consume_counter() const	DIABase	inlinevirtual
consume_counter_	DIABase	protected
context()	DIABase	inline
context_	DIABase	protected
debug	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	privatestatic
dec_reference() const noexcept	ReferenceCounter	inline
DecConsumeCounter(size_t counter)	DIABase	inlinevirtual
desired_imbalance_	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	privatestatic
dia_id() const	DIABase	inline
dia_id_	DIABase	protected
DIABase(Context &ctx, const char *label, const std::initializer_list< size_t > &parent_ids, const std::initializer_list< DIABasePtr > &parents)	DIABase	inline
DIABase(Context &ctx, const char *label, std::vector< size_t > &&parent_ids, std::vector< DIABasePtr > &&parents)	DIABase	inline
DIABase(const DIABase &)=delete	DIABase
DIABase(DIABase &&)=default	DIABase
DIABasePtr typedef	DIABase
DIANode(Context &ctx, const char *label, const std::initializer_list< size_t > &parent_ids, const std::initializer_list< DIABasePtr > &parents)	DIANode< ValueType >	inline
DIANode(Context &ctx, const char *label, std::vector< size_t > &&parent_ids, std::vector< DIABasePtr > &&parents)	DIANode< ValueType >	inline
Dispose() final	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	inlinevirtual
DOpNode(Context &ctx, const char *label, const std::initializer_list< size_t > &parent_ids, const std::initializer_list< DIABasePtr > &parents)	DOpNode< ValueType >	inline
DOpNode(Context &ctx, const char *label, std::vector< size_t > &&parent_ids, std::vector< DIABasePtr > &&parents)	DOpNode< ValueType >	inline
EqualSampleGreaterIndex(const SampleIndexPair &a, const SampleIndexPair &b)	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	inlineprivate
Execute() final	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	inlinevirtual
ExecuteMemUse() final	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	inlinevirtual
files_	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	private
FindAndSendSplitters(std::vector< SampleIndexPair > &splitters, size_t sample_size, data::MixStreamPtr &sample_stream, data::MixStream::Writers &sample_writers)	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	inlineprivate
ForwardDataOnly() const	DIABase	inlinevirtual
inc_reference() const noexcept	ReferenceCounter	inline
IncConsumeCounter(size_t counter)	DIABase	inlinevirtual
kNeverConsume	DIABase	static
label() const	DIABase	inline
label_	DIABase	protected
LessSampleIndex(const SampleIndexPair &a, const SampleIndexPair &b)	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	inlineprivate
local_items_	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	private
local_out_size_	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	private
logger_	DIABase
MainOp()	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	inlineprivate
MakeMultiwayMergeTree typedef	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	private
mem_limit_	DIABase	protected
mem_manager()	DIABase	inline
OnPreOpFile(const data::File &file, size_t) final	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	inlinevirtual
operator=(const DIABase &)=delete	DIABase
operator=(DIABase &&)=default	DIABase
tlx::ReferenceCounter::operator=(const ReferenceCounter &) noexcept	ReferenceCounter	inline
parent_ids() const	DIABase	inline
parent_stack_empty_	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	private
parents() const	DIABase	inline
parents_	DIABase	protected
PartialMultiwayMerge(size_t merge_degree, size_t prefetch)	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	inlineprivate
PreOp(const ValueType &input)	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	inline
PreOpMemUse()	DIABase	inlinevirtual
PushData(bool consume) final	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	inlinevirtual
PushDataMemUse() final	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	inlinevirtual
PushFile(data::File &file, bool consume) const	DIANode< ValueType >	inline
PushItem(const ValueType &item) const	DIANode< ValueType >	inline
ReceiveItems(TranmissionStreamPtr &data_stream)	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	inlineprivate
reference_count() const noexcept	ReferenceCounter	inline
ReferenceCounter() noexcept	ReferenceCounter	inline
ReferenceCounter(const ReferenceCounter &) noexcept	ReferenceCounter	inline
RemoveAllChildren() override	DIANode< ValueType >	inlinevirtual
RemoveChild(DIABase *node) override	DIANode< ValueType >	inlinevirtual
RemoveParent(DIABase *p)	DIABase	inline
RequireParentPushData(size_t) const	DIABase	inlinevirtual
res_sampler_	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	private
RoundDown(Integral n, Integral k)	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	inlineprivatestatic
RunPushData() override	DIANode< ValueType >	inlinevirtual
RunScope()	DIABase
RunTimer typedef	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	private
SampleIndexPair typedef	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	private
samples_	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	private
set_mem_limit(const DIAMemUse &mem_limit)	DIABase	inline
set_state(const DIAState &state)	DIABase	inline
SetConsumeCounter(size_t counter)	DIABase	inlinevirtual
sort_algorithm_	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	private
SortAndWriteToFile(std::vector< ValueType > &vec)	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	inlineprivate
SortNode(const ParentDIA &parent, const CompareFunction &compare_function, const SortAlgorithm &sort_algorithm=SortAlgorithm())	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	inline
StartPreOp(size_t) final	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	inlinevirtual
state() const	DIABase	inline
state_	DIABase	protected
stats_enabled	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	privatestatic
StopPreOp(size_t) final	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	inlinevirtual
Super typedef	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	private
Timer typedef	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	private
timer_execute_	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	private
timer_preop_	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	private
timer_sort_	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	private
TranmissionStreamPtr typedef	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	private
TranmissionStreamType typedef	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	private
TransmitItems(const ValueType *const tree, size_t k, size_t log_k, size_t actual_k, const SampleIndexPair *const sorted_splitters, size_t prefix_items, TranmissionStreamPtr &data_stream)	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	inlineprivate
unique() const noexcept	ReferenceCounter	inline
unsorted_file_	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	private
unsorted_writer_	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	private
use_background_thread_	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	privatestatic
wanted_sample_size() const	SortNode< ValueType, CompareFunction, SortAlgorithm, Stable >	inlineprivate
~DIABase()	DIABase	inlinevirtual
~ReferenceCounter()	ReferenceCounter	inline