iRoCS Toolbox  1.1.0
Public Member Functions
atb::TinyVectorLessThan< DataT, Dim > Struct Template Reference

The TinyVectorLessThan struct provides an operator for comparing TinyVectors defining a strict weak ordering between them. More...

#include "libArrayToolbox/Neighborhood.hh"

Collaboration diagram for atb::TinyVectorLessThan< DataT, Dim >:

Public Member Functions

bool operator() (blitz::TinyVector< DataT, Dim > const &v1, blitz::TinyVector< DataT, Dim > const &v2) const
 Strict weak ordering function for TinyVectors. More...
 

Detailed Description

template<typename DataT, int Dim>
struct atb::TinyVectorLessThan< DataT, Dim >

The TinyVectorLessThan struct provides an operator for comparing TinyVectors defining a strict weak ordering between them.

This is especially useful for the STL containers set and map and their multi-variants, which require a strict weak ordering on their stored keys.

Definition at line 57 of file Neighborhood.hh.

Member Function Documentation

◆ operator()()

template<typename DataT , int Dim>
bool atb::TinyVectorLessThan< DataT, Dim >::operator() ( blitz::TinyVector< DataT, Dim > const &  v1,
blitz::TinyVector< DataT, Dim > const &  v2 
) const

Strict weak ordering function for TinyVectors.

Parameters
v1The first vector
v2The second vector
Returns
$\exists D \in \left\{ 1, \ldots, \mathrm{Dim} \right\}, \forall d < D: v_1(d) = v_2(d) \wedge v_1(D) < v_2(D)$

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