内容表

• 关于
• 创建
• 排序
• Searching
• 延伸阅读

关于

maxon::BaseSort is a class template that allows to sort data in arrays and to search in sorted arrays. For a default implementation handling simple data types see maxon::SimpleSort .

注意

另请参阅 SortedArray .

创建

A new sorting class is created by implementing a custom class based on maxon::BaseSort . This custom class may implement:

• LessThan (): For sorting elements in an array.
• IsEqual (): For finding elements in an array.

Further flags that can be set are:

• maxon::BASESORTFLAGS::NONE : Always use constructor/destructor or move operator, never memcpy , memmove or realloc .
• maxon::BASESORTFLAGS::MOVEANDCOPYOBJECTS : Elements are PODs and can be moved and copied using memcpy and moved using memmove .

排序

An instance of the custom sorting class can be used to sort the elements stored in a maxon::BaseArray .

• maxon::BaseSort::Sort() : Sorts the elements of the given iterateable.

// This example defines a BaseSort class for a simple data type // and applies it to a BaseArray.

// custom BaseSort based class to sort integer values class IntegerSort : public maxon::BaseSort <IntegerSort, maxon::BASESORTFLAGS::MOVEANDCOPYOBJECTS> { public : static inline Bool LessThan ( maxon::Int a, maxon::Int b) { return a < b; } };

// prepare array maxon::BaseArray<maxon::Int> numbers; numbers. Resize (count) iferr_return ;

// custom function to fill the array with random values FillWithRandomNumbers(numbers);

// sort the elements stored in the array IntegerSort sort; sort.Sort(numbers);

// check result for ( const maxon::Int & number : numbers) DiagnosticOutput ( "Number: @" , number);