Thrill  0.1
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
+ Collaboration diagram for Sorting Algorithms:

String Sorting Algorithms

void sort_strings (char **strings, size_t size, size_t memory=0)
 Sort a set of strings represented by C-style char* in place. More...
 
void sort_strings (unsigned char **strings, size_t size, size_t memory=0)
 Sort a set of strings represented by C-style uint8_t* in place. More...
 
void sort_strings (const char **strings, size_t size, size_t memory=0)
 Sort a set of strings represented by C-style char* in place. More...
 
void sort_strings (const unsigned char **strings, size_t size, size_t memory=0)
 Sort a set of strings represented by C-style uint8_t* in place. More...
 
void sort_strings (std::vector< char * > &strings, size_t memory=0)
 Sort a set of strings represented by C-style char* in place. More...
 
void sort_strings (std::vector< unsigned char > &strings, size_t memory=0)
 Sort a set of strings represented by C-style uint8_t* in place. More...
 
void sort_strings (std::vector< const char * > &strings, size_t memory=0)
 Sort a set of strings represented by C-style char* in place. More...
 
void sort_strings (std::vector< const unsigned char * > &strings, size_t memory=0)
 Sort a set of strings represented by C-style uint8_t* in place. More...
 
void sort_strings (std::string *strings, size_t size, size_t memory=0)
 Sort a set of std::strings in place. More...
 
void sort_strings (std::vector< std::string > &strings, size_t memory=0)
 Sort a vector of std::strings in place. More...
 

Detailed Description

Specialized Sorting Algorithms

Function Documentation

void sort_strings ( char **  strings,
size_t  size,
size_t  memory = 0 
)

Sort a set of strings represented by C-style char* in place.

The strings are sorted as unsigned 8-bit characters, not signed characters! If the memory limit is non zero, possibly slower algorithms will be selected to stay within the memory limit.

Definition at line 20 of file strings1.cpp.

Referenced by tlx::sort_strings().

void sort_strings ( unsigned char **  strings,
size_t  size,
size_t  memory = 0 
)

Sort a set of strings represented by C-style uint8_t* in place.

If the memory limit is non zero, possibly slower algorithms will be selected to stay within the memory limit.

Definition at line 25 of file strings1.cpp.

References tlx::sort_strings_detail::radixsort_CE3().

void sort_strings ( const char **  strings,
size_t  size,
size_t  memory = 0 
)

Sort a set of strings represented by C-style char* in place.

The strings are sorted as unsigned 8-bit characters, not signed characters! If the memory limit is non zero, possibly slower algorithms will be selected to stay within the memory limit.

Definition at line 20 of file strings2.cpp.

References tlx::sort_strings().

void sort_strings ( const unsigned char **  strings,
size_t  size,
size_t  memory = 0 
)

Sort a set of strings represented by C-style uint8_t* in place.

If the memory limit is non zero, possibly slower algorithms will be selected to stay within the memory limit.

Definition at line 25 of file strings2.cpp.

References tlx::sort_strings_detail::radixsort_CE3().

void sort_strings ( std::vector< char * > &  strings,
size_t  memory = 0 
)

Sort a set of strings represented by C-style char* in place.

The strings are sorted as unsigned 8-bit characters, not signed characters! If the memory limit is non zero, possibly slower algorithms will be selected to stay within the memory limit.

Definition at line 30 of file strings1.cpp.

References tlx::sort_strings().

void tlx::sort_strings ( std::vector< unsigned char > &  strings,
size_t  memory = 0 
)

Sort a set of strings represented by C-style uint8_t* in place.

If the memory limit is non zero, possibly slower algorithms will be selected to stay within the memory limit.

void sort_strings ( std::vector< const char * > &  strings,
size_t  memory = 0 
)

Sort a set of strings represented by C-style char* in place.

The strings are sorted as unsigned 8-bit characters, not signed characters! If the memory limit is non zero, possibly slower algorithms will be selected to stay within the memory limit.

Definition at line 30 of file strings2.cpp.

References tlx::sort_strings().

void sort_strings ( std::vector< const unsigned char * > &  strings,
size_t  memory = 0 
)

Sort a set of strings represented by C-style uint8_t* in place.

If the memory limit is non zero, possibly slower algorithms will be selected to stay within the memory limit.

Definition at line 34 of file strings2.cpp.

References tlx::sort_strings().

void sort_strings ( std::string *  strings,
size_t  size,
size_t  memory = 0 
)

Sort a set of std::strings in place.

The strings are sorted as unsigned 8-bit characters, not signed characters! If the memory limit is non zero, possibly slower algorithms will be selected to stay within the memory limit.

Definition at line 20 of file strings3.cpp.

References tlx::sort_strings_detail::radixsort_CE3().

void sort_strings ( std::vector< std::string > &  strings,
size_t  memory = 0 
)

Sort a vector of std::strings in place.

The strings are sorted as unsigned 8-bit characters, not signed characters! If the memory limit is non zero, possibly slower algorithms will be selected to stay within the memory limit.

Definition at line 25 of file strings3.cpp.

References tlx::sort_strings().