#include <src/libigl/igl/SortableRow.h>

Collaboration diagram for igl::SortableRow< T >:

Public Member Functions
	SortableRow ()

	SortableRow (const T &data)

bool	operator< (const SortableRow &that) const

bool	operator== (const SortableRow &that) const

bool	operator!= (const SortableRow &that) const

Public Attributes
T	data

Detailed Description

template<typename T>
class igl::SortableRow< T >

Constructor & Destructor Documentation

◆ SortableRow() [1/2]

template<typename T >

igl::SortableRow< T >::SortableRow ( )

inline

25:data(){};

igl::SortableRow::data

T data

Definition SortableRow.h:23

◆ SortableRow() [2/2]

template<typename T >

igl::SortableRow< T >::SortableRow ( const T & data )

inline

26:data(data){};

Member Function Documentation

◆ operator!=()

template<typename T >

bool igl::SortableRow< T >::operator!= ( const SortableRow< T > & that ) const

inline

    {
        return !(*this == that);
    };

◆ operator<()

template<typename T >

bool igl::SortableRow< T >::operator< ( const SortableRow< T > & that ) const

inline

    {
        // Lexicographical
        int minc = (this->data.size() < that.data.size()?
                        this->data.size() : that.data.size());
        // loop over columns
        for(int i = 0;i<minc;i++)
        {
            if(this->data(i) == that.data(i))
            {
                continue;
            }
            return this->data(i) < that.data(i);
        }
        // All characters the same, comes done to length
        return this->data.size()<that.data.size();
    };

References igl::SortableRow< T >::data.

◆ operator==()

template<typename T >

bool igl::SortableRow< T >::operator== ( const SortableRow< T > & that ) const

inline

    {
        if(this->data.size() != that.data.size())
        {
            return false;
        }
        for(int i = 0;i<this->data.size();i++)
        {
            if(this->data(i) != that.data(i))
            {
                return false;
            }
        }
        return true;
    };