Implementation of PSRS parallel sorting routine. More...
#include <OpenFOAM/ParSortableList.H>
Implementation of PSRS parallel sorting routine.
From "On the Versatility of Parallel Sorting by Regular Sampling" Xiaobo Li et. all.
Construct from list of things to sort (uses SortableList, 'thing' should implement >, ==).
Will contain sorted data and in
Can also be constructed from size, filled at ease and then sort()'ed.
Definition at line 70 of file ParSortableList.H.
Classes | |
class | taggedValue |
Private class for sorting. Sorts on value_. |
Public Member Functions | |
ParSortableList (const UList< Type > &) | |
Construct from List, sorting the elements. | |
ParSortableList (const label size) | |
Construct given size. Sort later on. | |
void | sort () |
(stable) sort the list (if changed after construction time) | |
const labelList & | indices () const |
Return the list of sorted point indices. | |
const labelList & | procs () const |
Return the list of processor number. | |
![]() | |
label | size () const |
Return the number of elements in the UList. | |
List () | |
Null constructor. | |
List (const label) | |
Construct with given size. | |
List (const label, const Type &) | |
Construct with given size and value for all elements. | |
List (const List< Type > &) | |
Copy constructor. | |
List (const Xfer< List< Type > > &) | |
Construct by transferring the parameter contents. | |
List (List< Type > &, bool reUse) | |
Construct as copy or re-use as specified. | |
List (const UList< Type > &, const unallocLabelList &mapAddressing) | |
Construct as subset. | |
List (InputIterator first, InputIterator last) | |
Construct given start and end iterators. | |
List (const FixedList< Type, Size > &) | |
Construct as copy of FixedList<T, Size> | |
List (const PtrList< Type > &) | |
Construct as copy of PtrList<T> | |
List (const SLList< Type > &) | |
Construct as copy of SLList<T> | |
List (const IndirectList< Type > &) | |
Construct as copy of IndirectList<T> | |
List (const UIndirectList< Type > &) | |
Construct as copy of UIndirectList<T> | |
List (const BiIndirectList< Type > &) | |
Construct as copy of BiIndirectList<T> | |
List (Istream &) | |
Construct from Istream. | |
autoPtr< List< Type > > | clone () const |
Clone. | |
~List () | |
void | resize (const label) |
Reset size of List. | |
void | resize (const label, const Type &) |
Reset size of List and value for new elements. | |
void | setSize (const label) |
Reset size of List. | |
void | setSize (const label, const Type &) |
Reset size of List and value for new elements. | |
void | clear () |
Clear the list, i.e. set size to zero. | |
void | append (const UList< Type > &) |
Append a List at the end of this list. | |
void | append (const UIndirectList< Type > &) |
Append a UIndirectList at the end of this list. | |
void | transfer (List< Type > &) |
Transfer the contents of the argument List into this list. | |
void | transfer (DynamicList< Type, SizeInc, SizeMult, SizeDiv > &) |
Transfer the contents of the argument List into this list. | |
void | transfer (SortableList< Type > &) |
Transfer the contents of the argument List into this list. | |
Xfer< List< Type > > | xfer () |
Transfer contents to the Xfer container. | |
Type & | newElmt (const label) |
Return subscript-checked element of UList. | |
void | operator= (const UList< Type > &) |
Assignment from UList operator. Takes linear time. | |
void | operator= (const List< Type > &) |
Assignment operator. Takes linear time. | |
void | operator= (const SLList< Type > &) |
Assignment from SLList operator. Takes linear time. | |
void | operator= (const IndirectList< Type > &) |
Assignment from IndirectList operator. Takes linear time. | |
void | operator= (const UIndirectList< Type > &) |
Assignment from UIndirectList operator. Takes linear time. | |
void | operator= (const BiIndirectList< Type > &) |
Assignment from BiIndirectList operator. Takes linear time. | |
void | operator= (const Type &) |
Assignment of all entries to the given value. | |
![]() | |
UList () | |
Null constructor. | |
UList (Type *__restrict__ v, label size) | |
Construct from components. | |
label | fcIndex (const label i) const |
Return the forward circular index, i.e. the next index. | |
label | rcIndex (const label i) const |
Return the reverse circular index, i.e. the previous index. | |
label | byteSize () const |
Return the binary size in number of characters of the UList. | |
const Type * | cdata () const |
Return a const pointer to the first data element,. | |
Type * | data () |
Return a pointer to the first data element,. | |
void | checkStart (const label start) const |
Check start is within valid range (0 ... size-1). | |
void | checkSize (const label size) const |
Check size is within valid range (0 ... size). | |
void | checkIndex (const label i) const |
Check index i is within valid range (0 ... size-1). | |
void | writeEntry (Ostream &) const |
Write the UList as a dictionary entry. | |
void | writeEntry (const word &keyword, Ostream &) const |
Write the UList as a dictionary entry with keyword. | |
void | assign (const UList< Type > &) |
Assign elements to those from UList. | |
Type & | operator[] (const label) |
Return element of UList. | |
const Type & | operator[] (const label) const |
Return element of constant UList. | |
operator const Foam::List< Type > & () const | |
Allow cast to a const List<T>&. | |
iterator | begin () |
Return an iterator to begin traversing the UList. | |
const_iterator | begin () const |
Return const_iterator to begin traversing the constant UList. | |
iterator | end () |
Return an iterator to end traversing the UList. | |
const_iterator | end () const |
Return const_iterator to end traversing the constant UList. | |
const_iterator | cbegin () const |
Return const_iterator to begin traversing the constant UList. | |
const_iterator | cend () const |
Return const_iterator to end traversing the constant UList. | |
reverse_iterator | rbegin () |
Return reverse_iterator to begin reverse traversing the UList. | |
const_reverse_iterator | rbegin () const |
Return const_reverse_iterator to begin reverse traversing the UList. | |
reverse_iterator | rend () |
Return reverse_iterator to end reverse traversing the UList. | |
const_reverse_iterator | rend () const |
Return const_reverse_iterator to end reverse traversing the UList. | |
const_reverse_iterator | crbegin () const |
Return const_reverse_iterator to begin reverse traversing the UList. | |
const_reverse_iterator | crend () const |
Return const_reverse_iterator to end reverse traversing the UList. | |
label | max_size () const |
Return size of the largest possible UList. | |
bool | empty () const |
Return true if the UList is empty (ie, size() is zero). | |
void | swap (UList< Type > &) |
Swap two ULists of the same type in constant time. | |
bool | operator== (const UList< Type > &) const |
Equality operation on ULists of the same type. | |
bool | operator!= (const UList< Type > &) const |
The opposite of the equality operation. Takes linear time. | |
bool | operator< (const UList< Type > &) const |
Compare two ULists lexicographically. Takes linear time. | |
bool | operator> (const UList< Type > &) const |
Compare two ULists lexicographically. Takes linear time. | |
bool | operator<= (const UList< Type > &) const |
Return true if !(a > b). Takes linear time. | |
bool | operator>= (const UList< Type > &) const |
Return true if !(a < b). Takes linear time. |
Additional Inherited Members | |
![]() | |
typedef SubList< Type > | subList |
Declare type of subList. | |
![]() | |
typedef Type | value_type |
Type of values the UList contains. | |
typedef Type & | reference |
Type that can be used for storing into. | |
typedef const Type & | const_reference |
Type that can be used for storing into. | |
typedef label | difference_type |
The type that can represent the difference between any two. | |
typedef label | size_type |
The type that can represent the size of a UList. | |
typedef Type * | iterator |
Random access iterator for traversing UList. | |
typedef const Type * | const_iterator |
Random access iterator for traversing UList. | |
typedef Type * | reverse_iterator |
Reverse iterator for reverse traversal of UList. | |
typedef const Type * | const_reverse_iterator |
Reverse iterator for reverse traversal of constant UList. | |
![]() | |
static const List< Type > & | null () |
Return a null List. | |
![]() | |
void | size (const label) |
Override size to be inconsistent with allocated storage. |
ParSortableList | ( | const UList< Type > & | values | ) |
Construct from List, sorting the elements.
Definition at line 127 of file ParSortableList.C.
References ParSortableList< Type >::sort().
ParSortableList | ( | const label | size | ) |
Construct given size. Sort later on.
Definition at line 139 of file ParSortableList.C.
void sort | ( | ) |
(stable) sort the list (if changed after construction time)
Definition at line 151 of file ParSortableList.C.
References PstreamBase::blocking, Foam::endl(), forAll, Pstream::gatherList(), SortableList< T >::indices(), Pstream::master(), Pstream::myProcNo(), Pstream::nProcs(), Foam::Pout, Foam::reduce(), Pstream::scatter(), setSize(), List< T >::setSize(), List< T >::size(), and Foam::sort().
Referenced by ParSortableList< Type >::ParSortableList().
|
inline |
Return the list of sorted point indices.
Definition at line 187 of file ParSortableList.H.
|
inline |
Return the list of processor number.
Definition at line 193 of file ParSortableList.H.