Public Member Functions | Private Member Functions | Private Attributes
RadixSort Class Reference

#include <IceRevisitedRadix.h>

List of all members.

Public Member Functions

inline_ udword GetNbHits () const
 Returns the number of eraly exits due to temporal coherence.
inline_ udword GetNbTotalCalls () const
 Returns the total number of calls to the radix sorter.
inline_ const udwordGetRanks () const
 Access to results. mRanks is a list of indices in sorted order, i.e. in the order you may further process your data.
inline_ udwordGetRecyclable () const
 mIndices2 gets trashed on calling the sort routine, but otherwise you can recycle it the way you want.
udword GetUsedRam () const
 RadixSort ()
RadixSortSort (const udword *input, udword nb, RadixHint hint=RADIX_SIGNED)
RadixSortSort (const float *input, udword nb)
 ~RadixSort ()

Private Member Functions

void CheckResize (udword nb)
bool Resize (udword nb)

Private Attributes

udword mCurrentSize
 Current size of the indices list.
udword mNbHits
 Number of early exits due to coherence.
udwordmRanks
 Two lists, swapped each pass.
udwordmRanks2
udword mTotalCalls
 Total number of calls to the sort routine.

Detailed Description

Revisited Radix Sort. This is my new radix routine:

History:

Author:
Pierre Terdiman
Version:
1.4
Date:
August, 15, 1998

Definition at line 26 of file IceRevisitedRadix.h.


Constructor & Destructor Documentation


Member Function Documentation

void RadixSort::CheckResize ( udword  nb) [private]
inline_ udword RadixSort::GetNbHits ( ) const [inline]

Returns the number of eraly exits due to temporal coherence.

Definition at line 47 of file IceRevisitedRadix.h.

Returns the total number of calls to the radix sorter.

Definition at line 45 of file IceRevisitedRadix.h.

inline_ const udword* RadixSort::GetRanks ( ) const [inline]

Access to results. mRanks is a list of indices in sorted order, i.e. in the order you may further process your data.

Definition at line 37 of file IceRevisitedRadix.h.

mIndices2 gets trashed on calling the sort routine, but otherwise you can recycle it the way you want.

Definition at line 40 of file IceRevisitedRadix.h.

bool RadixSort::Resize ( udword  nb) [private]
RadixSort& RadixSort::Sort ( const float *  input,
udword  nb 
)

Member Data Documentation

Current size of the indices list.

Definition at line 54 of file IceRevisitedRadix.h.

Number of early exits due to coherence.

Definition at line 59 of file IceRevisitedRadix.h.

Two lists, swapped each pass.

Definition at line 55 of file IceRevisitedRadix.h.

Definition at line 56 of file IceRevisitedRadix.h.

Total number of calls to the sort routine.

Definition at line 58 of file IceRevisitedRadix.h.


The documentation for this class was generated from the following file:


openhrp3
Author(s): AIST, General Robotix Inc., Nakamura Lab of Dept. of Mechano Informatics at University of Tokyo
autogenerated on Thu Apr 11 2019 03:30:21