Main Page | Namespace List | Class Hierarchy | Alphabetical List | Class List | File List | Namespace Members | Class Members | File Members | Related Pages

ImplicitMapOperators< T, ID, ORD > Struct Template Reference

Template for implicit map ("index" into data). More...

#include <imaptable.h>

Inheritance diagram for ImplicitMapOperators< T, ID, ORD >:

Inheritance graph
[legend]
Collaboration diagram for ImplicitMapOperators< T, ID, ORD >:

Collaboration graph
[legend]
List of all members.

Static Public Member Functions

bool lt (T *const &a, T *const &b)
bool le (T *const &a, T *const &b)
bool gt (T *const &a, T *const &b)
bool ge (T *const &a, T *const &b)
bool eq (T *const &a, T *const &b)
bool ne (T *const &a, T *const &b)
bool lt (T *const &a, ID const &b)
bool le (T *const &a, ID const &b)
bool gt (T *const &a, ID const &b)
bool ge (T *const &a, ID const &b)
bool eq (T *const &a, ID const &b)
bool ne (T *const &a, ID const &b)

Detailed Description

template<typename T, typename ID, typename ORD>
struct ImplicitMapOperators< T, ID, ORD >

Template for implicit map ("index" into data).

Author:
Wolfgang Wieser ] wwieser (a) gmx <*> de [
Instead of using a full-featured comparison operator template, you can use this one in simple cases. You need to supply an "operator" template ORD which implements a function called "ord" returnig the order parameter used to sort the keys. (Must be static member.) The returned order parameter must be of type ID.

Definition at line 43 of file imaptable.h.

Member Function Documentation

template<typename T, typename ID, typename ORD>
bool ImplicitMapOperators< T, ID, ORD >::eq (  T *const &  a,
ID const &  b
)  [inline, static]
 

Definition at line 70 of file imaptable.h.

template<typename T, typename ID, typename ORD>
bool ImplicitMapOperators< T, ID, ORD >::eq (  T *const &  a,
T *const &  b
)  [inline, static]
 

Definition at line 56 of file imaptable.h.

template<typename T, typename ID, typename ORD>
bool ImplicitMapOperators< T, ID, ORD >::ge (  T *const &  a,
ID const &  b
)  [inline, static]
 

Definition at line 68 of file imaptable.h.

template<typename T, typename ID, typename ORD>
bool ImplicitMapOperators< T, ID, ORD >::ge (  T *const &  a,
T *const &  b
)  [inline, static]
 

Definition at line 54 of file imaptable.h.

template<typename T, typename ID, typename ORD>
bool ImplicitMapOperators< T, ID, ORD >::gt (  T *const &  a,
ID const &  b
)  [inline, static]
 

Definition at line 66 of file imaptable.h.

template<typename T, typename ID, typename ORD>
bool ImplicitMapOperators< T, ID, ORD >::gt (  T *const &  a,
T *const &  b
)  [inline, static]
 

Definition at line 52 of file imaptable.h.

template<typename T, typename ID, typename ORD>
bool ImplicitMapOperators< T, ID, ORD >::le (  T *const &  a,
ID const &  b
)  [inline, static]
 

Definition at line 64 of file imaptable.h.

template<typename T, typename ID, typename ORD>
bool ImplicitMapOperators< T, ID, ORD >::le (  T *const &  a,
T *const &  b
)  [inline, static]
 

Definition at line 50 of file imaptable.h.

template<typename T, typename ID, typename ORD>
bool ImplicitMapOperators< T, ID, ORD >::lt (  T *const &  a,
ID const &  b
)  [inline, static]
 

Definition at line 62 of file imaptable.h.

template<typename T, typename ID, typename ORD>
bool ImplicitMapOperators< T, ID, ORD >::lt (  T *const &  a,
T *const &  b
)  [inline, static]
 

Definition at line 48 of file imaptable.h.

template<typename T, typename ID, typename ORD>
bool ImplicitMapOperators< T, ID, ORD >::ne (  T *const &  a,
ID const &  b
)  [inline, static]
 

Definition at line 72 of file imaptable.h.

template<typename T, typename ID, typename ORD>
bool ImplicitMapOperators< T, ID, ORD >::ne (  T *const &  a,
T *const &  b
)  [inline, static]
 

Definition at line 58 of file imaptable.h.

The documentation for this struct was generated from the following file:
Generated on Sat Feb 19 22:35:26 2005 for Ray by doxygen 1.3.5