Open Search
    Static Public Member Functions | List of all members
    SimpleParallelSort< COMPARE, FLAGS > Class Template Reference
    Data Structures

    #include <parallelsort.h>

    Inheritance diagram for SimpleParallelSort< COMPARE, FLAGS >:
    Inheritance graph
    [legend]

    Detailed Description

    template<typename COMPARE = DefaultCompare, BASESORTFLAGS FLAGS = BASESORTFLAGS::NONE>
    class maxon::SimpleParallelSort< COMPARE, FLAGS >

    Specialized BaseSort template for simple datatypes.

    Template Parameters
    COMPAREClass that offers the methods IsEqual and LessThan.
    FLAGSSee BASESORTFLAGS.

    Example:

    BaseArray<Int> array;
    SimpleParallelSort<> test;
    test.Sort(array);
    test
    #define test
    Definition: graminit.h:53

    or

    BaseArray<Int> array2;
    SimpleParallelSort<> test2;
    test2.Sort(&array2[0], array2.GetCount());

    Static Public Member Functions

    template<typename T1 , typename T2 >
    static Bool LessThan (const T1 &a, const T2 &b)
     
    template<typename T1 , typename T2 >
    static Bool IsEqual (const T1 &a, const T2 &b)
     

    Additional Inherited Members

    - Public Types inherited from ParallelSort< SimpleParallelSort< DefaultCompare, BASESORTFLAGS::NONE >, BASESORTFLAGS::NONE >
    using Super = BaseSort< SimpleParallelSort< DefaultCompare, BASESORTFLAGS::NONE >, FLAGS >
     
    - Public Member Functions inherited from ParallelSort< SimpleParallelSort< DefaultCompare, BASESORTFLAGS::NONE >, BASESORTFLAGS::NONE >
    void Sort (ITERATOR start, ITERATOR end, JobQueueInterface *queue=JOBQUEUE_CURRENT) const
     
    void Sort (ITERATOR start, Int count, JobQueueInterface *queue=JOBQUEUE_CURRENT) const
     
    void Sort (ARRAY &arr, JobQueueInterface *queue=JOBQUEUE_CURRENT) const
     
    - Public Member Functions inherited from BaseSort< SORTCLASS, FLAGS >
    template<typename ITERATOR >
    void Sort (ITERATOR start, ITERATOR end) const
     
    template<typename ITERATOR >
    void Sort (ITERATOR start, Int count) const
     
    template<typename ARRAY >
    void Sort (ARRAY &arr) const
     
    template<typename SEARCHTYPE , typename ITERATOR >
    Int FindIndex (const SEARCHTYPE &key, ITERATOR arr, Int count) const
     
    template<typename SEARCHTYPE , typename ITERATOR >
    ITERATOR Find (const SEARCHTYPE &key, ITERATOR arr, Int count) const
     
    template<typename ARRAY , typename SEARCHTYPE >
    ARRAY::ValueType * Find (const SEARCHTYPE &key, const ARRAY &arr) const
     
    template<typename SEARCHTYPE , typename ITERATOR >
    ITERATOR FindInsertionIndex (const SEARCHTYPE &key, ITERATOR arr, Int count, Int &insertionIndex) const
     
    template<typename ARRAY , typename SEARCHTYPE >
    ARRAY::ValueType * FindInsertionIndex (const SEARCHTYPE &key, const ARRAY &arr, Int &insertionIndex) const
     

    Member Function Documentation

    ◆ LessThan()

    static Bool LessThan ( const T1 &  a,
    const T2 &  b 
    )
    		static

    ◆ IsEqual()

    static Bool IsEqual ( const T1 &  a,
    const T2 &  b 
    )
    		static