Public Member Functions

glv::Interval< T > Class Template Reference

A closed interval [min, max]. More...

#include <glv_util.h>

List of all members.

Public Member Functions

center () const
 Returns center point.
bool contains (const T &v) const
 Test is point is contained exclusively within interval.
bool degenerate () const
 Returns true if diameter is zero.
diameter () const
 Returns absolute difference of endpoints.
const T & max () const
 Get maximum endpoint.
const T & min () const
 Get minimum endpoint.
bool proper () const
 Returns true if diameter is non-zero.
radius () const
 Returns one-half the diameter.
fromUnit (const T &v) const
 Linearly map point in unit interval to point in interval.
toUnit (const T &v) const
 Linearly map point in interval to point in the unit interval.
template<class U >
to (const T &v, const Interval< U > &i)
 Linearly map point from interval to argument interval.
template<class U >
bool operator== (const Interval< U > &v)
 Returns true if both endpoints are equal.
template<class U >
bool operator!= (const Interval< U > &v)
 Returns true if endpoints are not equal.
Intervalcenter (const T &v)
 Set center point preserving diameter.
Intervaldiameter (const T &v)
 Set diameter (width) preserving center.
IntervalcenterDiameter (const T &c, const T &d)
 Set center and diameter.
Intervalendpoints (const T &min, const T &max)
 Set the endpoints.
Intervaltranslate (const T &v)
 Translate interval by fixed amount.
Intervalmax (const T &v)
 Set maximum endpoint.
Intervalmin (const T &v)
 Set minimum endpoint.

Detailed Description

template<class T = double>
class glv::Interval< T >

A closed interval [min, max].

An interval is a connected region of the real line. Geometrically, it describes a 0-sphere. Order is strongly enforced so that the endpoints will always satisfy min <= max.


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