Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
strings::suffix_array::SortHelper< _Iterator > Class Template Reference

#include <sort_helper.h>

List of all members.

Public Member Functions

 SortHelper (const _Iterator first, const _Iterator last_)
bool operator() (const int &a, const int &b)

Private Attributes

_Iterator base
_Iterator last

Detailed Description

template<typename _Iterator>
class strings::suffix_array::SortHelper< _Iterator >

Helper for sorting Can compare two suffixes


Constructor & Destructor Documentation

template<typename _Iterator>
strings::suffix_array::SortHelper< _Iterator >::SortHelper ( const _Iterator  first,
const _Iterator  last_ 
) [inline]
Parameters:
inputwhole sequence
lengthlength of the sequence

Member Function Documentation

template<typename _Iterator>
bool strings::suffix_array::SortHelper< _Iterator >::operator() ( const int &  a,
const int &  b 
) [inline]

Returns which of the suffixes is lexicographically smaller. Note that end of sequence is less than any of the characters, i.e. "x" < "xa"

Returns:
true iff suffix[a] < suffix[b]

Member Data Documentation

template<typename _Iterator>
_Iterator strings::suffix_array::SortHelper< _Iterator >::base [private]
template<typename _Iterator>
_Iterator strings::suffix_array::SortHelper< _Iterator >::last [private]

The documentation for this class was generated from the following file:
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Defines