detail namespace gathers internal classes and functions. More...

Data Structures
struct	BoundedLatticePolytopeSpecializer
	Aim: It is just a helper class for BoundedLatticePolytope to add dimension specific static methods. More...
struct	BoundedLatticePolytopeSpecializer< 3, TInteger >
	Aim: 3D specialization for BoundedLatticePolytope to add dimension specific static methods. More...
struct	BoundedRationalPolytopeSpecializer
	Aim: It is just a helper class for BoundedRationalPolytope to add dimension specific static methods. More...
struct	BoundedRationalPolytopeSpecializer< 3, TInteger >
	Aim: 3D specialization for BoundedRationalPolytope to add dimension specific static methods. More...
struct	ComparatorAdapter
struct	ComparatorAdapter< Container, true, false, false >
	unordered set-like adapter. More...
struct	ComparatorAdapter< Container, true, false, true >
	unordered map-like adapter. More...
struct	ComparatorAdapter< Container, true, true, false >
	Set-like adapter. More...
struct	ComparatorAdapter< Container, true, true, true >
	Map-like adapter. More...
struct	ConvexityHelperInternalInteger
struct	ConvexityHelperInternalInteger< DGtal::BigInteger, safe >
struct	ConvexityHelperInternalInteger< DGtal::int32_t, false >
struct	ConvexityHelperInternalInteger< DGtal::int32_t, true >
struct	ConvexityHelperInternalInteger< DGtal::int64_t, false >
struct	ConvexityHelperInternalInteger< DGtal::int64_t, true >
struct	CurvatureFromDCA
struct	CurvatureFromDCA< false >
class	CurvatureFromDSSBaseEstimator
struct	CurvatureFromDSSLength
struct	CurvatureFromDSSLengthAndWidth
struct	DistanceFromDCA
class	DSSDecorator
	Aim: Abstract DSSDecorator for ArithmeticalDSSComputer. Has 2 virtual methods returning the first and last leaning point: More...
class	DSSDecorator4ConcavePart
	Aim: adapter for TDSS used by FP in CONCAVE parts. Has 2 methods: More...
class	DSSDecorator4ConvexPart
	Aim: adapter for TDSS used by FP in CONVEX parts. Has 2 methods: More...
struct	EqualPredicateFromLessThanComparator
struct	EuclideanDivisionHelper
	Aim: Small stucture that provides a static method returning the Euclidean division of two integers. More...
struct	EuclideanDivisionHelper< double >
struct	EuclideanDivisionHelper< float >
struct	EuclideanDivisionHelper< long double >
struct	FFTWComplexCast
	Facility to cast to the complex type used by fftw. More...
struct	FFTWWrapper
	Wrapper to fftw functions depending on value type. More...
struct	FFTWWrapper< double >
struct	FFTWWrapper< float >
struct	FFTWWrapper< long double >
class	GridPoint
	A grid point consists of a couple of nonnegative coordinates \( (x,y) \) and an integer index \( k \) that determines a point used as origin. For a triplet of vectors \( (m_k)_{0 \leq k \leq 2} \) and a point \( q \), a grid point is defined as: \( q - m_{k} + x m_{(k+1)\bmod 3} + y m_{(k+2)\bmod 3} \). \( q - m_{k} \), called base point, is used as origin. More...
class	GridPointOnProbingRay
	Aim: Represents a grid point along a discrete ray defined on a grid. More...
struct	HasNestedTypeCategory
	Aim: Checks whether type T has a nested type called 'Category' or not. NB: from en.wikipedia.org/wiki/Substitution_failure_is_not_an_error NB: to avoid various compiler issues, we use BOOST_STATIC_CONSTANT according to http://www.boost.org/development/int_const_guidelines.html. More...
struct	HasNestedTypeType
	Aim: Checks whether type IC has a nested type called 'Type' or not. NB: from en.wikipedia.org/wiki/Substitution_failure_is_not_an_error NB: to avoid various compiler issues, we use BOOST_STATIC_CONSTANT according to http://www.boost.org/development/int_const_guidelines.html. More...
struct	IsAssociativeContainerFromCategory
struct	IsCirculator
	Aim: Checks whether type IC is a circular or a classical iterator. Static value set to 'true' for a circulator, 'false' otherwise. 1) if type IC has no nested type 'Type', it is a classical iterator and 'false' is returned. 2) if type IC has a nested type 'Type', 'true' is returned is 'Type' is CirculatorType, 'false' otherwise. More...
struct	IsCirculator< IC, true >
struct	IsCirculatorFromType
	Aim: In order to check whether type IC is a circular or a classical iterator, the nested type called 'Type' is read. More...
struct	IsCirculatorFromType< IC, CirculatorType >
struct	IsContainerFromCategory
struct	IsMultipleAssociativeContainerFromCategory
struct	IsOrderedAssociativeContainerFromCategory
struct	IsPairAssociativeContainerFromCategory
struct	IsSequenceContainerFromCategory
struct	IsSimpleAssociativeContainerFromCategory
struct	IsUniqueAssociativeContainerFromCategory
struct	IsUnorderedAssociativeContainerFromCategory
struct	IteratorCirculatorTypeImpl
	Aim: Defines the Iterator or Circulator type as a nested type according to the value of b. More...
struct	IteratorCirculatorTypeImpl< true >
struct	KeyComparatorForPairKeyData
struct	LabelledMapMemFunctor
struct	monomial_node
struct	NormalizedTangentVectorFromDSS
struct	NormalVectorFromDCA
class	PointOnProbingRay
	A ray consists of a permutation \( \sigma \) and an integer index \( \lambda \) (position on the ray). For a triplet of vectors \( (m_k)_{0 \leq k \leq 2} \) and a point \( q \), a point on the ray is defined as: \( q - m_{\sigma(0)} + m_{\sigma(1)} + \lambda m_{\sigma(2)} \). \( q - m_{\sigma(0)} + m_{\sigma(1)} \) is called the base point. More...
class	PointValueCompare
	Aim: Small binary predicate to order candidates points according to their (absolute) distance value. More...
class	PosDepScaleDepSCEstimator
class	PosDepScaleIndepSCEstimator
class	PosIndepScaleDepSCEstimator
class	PosIndepScaleIndepSCEstimator
struct	power_node
struct	RecursivePConvexity
struct	RecursivePConvexity< 1, TInteger >
struct	SetFunctionsImpl
	Aim: Specialize set operations (union, intersection, difference, symmetric_difference) according to the given type of container. It uses standard algorithms when containers are ordered, otherwise it provides a default implementation. More...
struct	SetFunctionsImpl< Container, false, true >
struct	SetFunctionsImpl< Container, true, false >
struct	SetFunctionsImpl< Container, true, true >
struct	TangentAngleFromDSS
struct	TangentVectorFromDCA
struct	TangentVectorFromDSS
struct	toCoordinateImpl
	Aim: Define a simple functor that can cast a signed integer (possibly a DGtal::BigInteger) into another. More...
struct	toCoordinateImpl< DGtal::BigInteger, DGtal::BigInteger >
struct	toCoordinateImpl< DGtal::BigInteger, TOutput >
struct	top_node
struct	ValueConverter
	Generic definition of a class for converting type X toward type Y. More...
struct	ValueConverter< std::string, double >
	Specialized definitions of a class for converting type X toward type Y. More...
struct	ValueConverter< std::string, float >
	Specialized definitions of a class for converting type X toward type Y. More...
struct	ValueConverter< std::string, int >
	Specialized definitions of a class for converting type X toward type Y. More...
struct	ValueConverter< X, std::string >
	Specialized definitions of a class for converting type X toward type Y. More...

Typedefs
typedef boost::variant< boost::recursive_wrapper< top_node >, monomial_node >	expr_node

Functions
template<typename IC>
bool	isNotEmpty (const IC &itb, const IC &ite, IteratorType)
template<typename IC>
bool	isNotEmpty (const IC &c1, const IC &c2, CirculatorType)
template<typename IC>
void	advanceIterator (IC &ic, typename IteratorCirculatorTraits< IC >::Difference n, ForwardCategory)
template<typename IC>
void	advanceIterator (IC &ic, typename IteratorCirculatorTraits< IC >::Difference n, RandomAccessCategory)
template<typename I>
IteratorCirculatorTraits< I >::Difference	rangeSize (const I &itb, const I &ite, IteratorType, ForwardCategory)
template<typename C>
IteratorCirculatorTraits< C >::Difference	rangeSize (const C &cb, const C &ce, CirculatorType, ForwardCategory)
template<typename I>
IteratorCirculatorTraits< I >::Difference	rangeSize (const I &itb, const I &ite, IteratorType, RandomAccessCategory)
template<typename C>
IteratorCirculatorTraits< C >::Difference	rangeSize (const C &cb, const C &ce, CirculatorType, RandomAccessCategory)
template<typename I>
I	rangeMiddle (const I &itb, const I &ite, IteratorType, ForwardCategory)
template<typename C>
C	rangeMiddle (const C &cb, const C &ce, CirculatorType, ForwardCategory)
template<typename I>
I	rangeMiddle (const I &itb, const I &ite, IteratorType, BidirectionalCategory)
template<typename C>
C	rangeMiddle (const C &cb, const C &ce, CirculatorType, BidirectionalCategory)
template<typename I>
I	rangeMiddle (const I &itb, const I &ite, IteratorType, RandomAccessCategory)
template<typename C>
C	rangeMiddle (const C &cb, const C &ce, CirculatorType, RandomAccessCategory)
template<typename TData>
std::pair< unsigned int, unsigned int >	argminLabelledMapMemoryUsageForGeometricDistribution (unsigned int L, double prob_no_data, double prob_one_data)
template<typename Point>
Point::Coordinate	squaredNorm (Point const &aPoint)
template<int N, typename T>
T	determinant (const T aMatrix[N][N])
template<typename Point>
Point::Coordinate	distToSphere (std::array< Point, 5 > const &aPoints)
template<typename Point>
bool	isBasisReduced (Point const &aU, Point const &aV)
template<typename Integer, typename Index>
std::ostream &	operator<< (std::ostream &aOs, PointOnProbingRay< Integer, Index > const &aRay)
template<typename Integer, typename Index>
std::ostream &	operator<< (std::ostream &aOs, GridPoint< Integer, Index > const &aGridPoint)
template<typename Point>
Point	center (const std::vector< Point > &points)
template<typename OutputValue, typename ForwardIterator, typename ConversionFct>
void	transform (std::vector< OutputValue > &output_values, std::vector< std::size_t > &input2output, std::vector< std::size_t > &output2input, ForwardIterator itb, ForwardIterator ite, const ConversionFct &F, bool remove_duplicates)

Detailed Description

detail namespace gathers internal classes and functions.

Typedef Documentation

◆ expr_node

typedef boost::variant< boost::recursive_wrapper<top_node>, monomial_node > DGtal::detail::expr_node

Part of the polynomial tree structure. Either a top_node or a monomial.

Definition at line 87 of file MPolynomialReader.h.

Function Documentation

◆ advanceIterator() [1/2]

template<typename IC>

void DGtal::detail::advanceIterator	(	IC &	ic,
		typename IteratorCirculatorTraits< IC >::Difference	n,
		ForwardCategory	)

inline

Moves ic at position @ it + n

Parameters

ic	any (circular)iterator
n	any positive distance

Template Parameters

IC	any iterator or circulator

◆ advanceIterator() [2/2]

template<typename IC>

void DGtal::detail::advanceIterator	(	IC &	ic,
		typename IteratorCirculatorTraits< IC >::Difference	n,
		RandomAccessCategory	)

inline

Moves ic at position @ it + n

Parameters

ic	any (circular)iterator
n	any positive distance

Template Parameters

IC	any iterator or circulator

◆ argminLabelledMapMemoryUsageForGeometricDistribution()

template<typename TData>

std::pair< unsigned int, unsigned int > DGtal::detail::argminLabelledMapMemoryUsageForGeometricDistribution	(	unsigned int	L,
		double	prob_no_data,
		double	prob_one_data )

Tries to find the best values N and M which will minimized the memory usage of a LabelledMap, for the distribution specified by the parameters.

Template Parameters

TData the type of data that will be stored.

Parameters

L	the total number of labels.
prob_no_data	Probability that there is no data at this location.
prob_one_data	If there is a possibility to have a data, this probability is used to define a geometric distribution that defines the number of data (ie valid labels) at this place. The smaller, the higher is the expectation. 0.5 means E(X) = 1.

Returns: the pair (N,M) that minimizes the memory usage of a LabelledMap for the given distribution.

References DGtal::L.

Referenced by main().

◆ center()

template<typename Point>

Point DGtal::detail::center ( const std::vector< Point > & points )

Compute the center of the bounding box containing the given points.

Template Parameters

Point any type of points

Parameters

[in] points a range of points

Returns: the (approximate center of the given range.

Note: Complexity is O(n), if n is the size of points.

Definition at line 66 of file QuickHullKernels.h.

    {
      if ( points.empty() ) return Point::zero;
      Point l = points[ 0 ];
      Point u = l;
      for ( const auto& p : points ) {
        l = l.inf( p );
        u = u.sup( p );
      }
      return Point( ( l + u ) / 2 );
    }

◆ determinant()

template<int N, typename T>

T DGtal::detail::determinant ( const T aMatrix[N][N] )

Determinant of a NxN matrix represented by a two-dimensional static array.

Parameters

aMatrix the static array representing the matrix.

Returns: the determinant of the input matrix.

◆ distToSphere()

template<typename Point>

Point::Coordinate DGtal::detail::distToSphere ( std::array< Point, 5 > const & aPoints )

inline

Computes the distance of a point to a sphere passing through 4 given points.

Parameters

aPoints 5 points where the first 4 define the sphere and the last one is the point to which we want to compute the distance.

Returns: the distance of the last point to the sphere defined by the first 4 points.

◆ isBasisReduced()

template<typename Point>

bool DGtal::detail::isBasisReduced	(	Point const &	aU,
		Point const &	aV )

inline

Test if a pair of vectors form a reduced basis.

Parameters

aU	the first vector.
aV	the second vector.

Returns: 'true' if (aU, aV) is a reduced basis, 'false' otherwise.

◆ isNotEmpty() [1/2]

template<typename IC>

bool DGtal::detail::isNotEmpty	(	const IC &	c1,
		const IC &	c2,
		CirculatorType	)

inline

Checks if a circular range is not empty, ie. checks if the circulators are valid.

Parameters

c1	begin iterator of the range
c2	end iterator of the range

Template Parameters

IC	iterator or circulator

◆ isNotEmpty() [2/2]

template<typename IC>

bool DGtal::detail::isNotEmpty	(	const IC &	itb,
		const IC &	ite,
		IteratorType	)

inline

Checks if the range of classical iterators [ itb , ite ) is not empty, ie. checks if itb != ite

Parameters

itb	begin iterator of the range
ite	end iterator of the range

Template Parameters

IC	iterator or circulator

Referenced by DGtal::detail::CurvatureFromDSSBaseEstimator< DSSComputer, detail::CurvatureFromDSSLength >::eval(), DGtal::detail::CurvatureFromDSSBaseEstimator< DSSComputer, detail::CurvatureFromDSSLength >::eval(), DGtal::detail::PosDepScaleDepSCEstimator< DCAComputer, detail::DistanceFromDCA >::eval(), DGtal::detail::PosDepScaleIndepSCEstimator< DCAComputer, detail::NormalVectorFromDCA >::eval(), DGtal::detail::PosIndepScaleDepSCEstimator< DCAComputer, detail::CurvatureFromDCA< isCCW > >::eval(), and DGtal::detail::PosIndepScaleIndepSCEstimator< DSSComputer, detail::NormalizedTangentVectorFromDSS >::eval().

◆ operator<<() [1/2]

template<typename Integer, typename Index>

std::ostream & DGtal::detail::operator<<	(	std::ostream &	aOs,
		GridPoint< Integer, Index > const &	aGridPoint )

Display a grid point on the standard output.

Parameters

aOs	the output stream where the object is written.
aGridPoint	the grid point to display.

Returns: the output stream after the writing.

Definition at line 401 of file PlaneProbingEstimatorHelper.h.

                                                                                           {
        aOs << "GridPoint[k=" << aGridPoint.k()
            << ", a=" << aGridPoint.direction().first
            << ", b=" << aGridPoint.direction().second
            << "]";
        return aOs; 
      }

References DGtal::detail::GridPoint< Integer, Index >::direction(), and DGtal::detail::GridPoint< Integer, Index >::k().

◆ operator<<() [2/2]

template<typename Integer, typename Index>

std::ostream & DGtal::detail::operator<<	(	std::ostream &	aOs,
		PointOnProbingRay< Integer, Index > const &	aRay )

Display a probing ray on the standard output.

Parameters

aOs	the output stream where the object is written.
aRay	the probing ray to display.

Returns: the output stream after the writing.

◆ rangeMiddle() [1/6]

template<typename C>

C DGtal::detail::rangeMiddle	(	const C &	cb,
		const C &	ce,
		CirculatorType	,
		BidirectionalCategory	)

inline

Computes the middle of a given range [ cb, ce ). Note that if cb = ce then [ cb, ce ) is assumed to be a whole range.

Parameters

cb	begin iterator of the range
ce	end iterator of the range

Returns: the middle circulator of the range [ cb , ce ) NB: linear in the range size

Template Parameters

C	any circulator

◆ rangeMiddle() [2/6]

template<typename C>

C DGtal::detail::rangeMiddle	(	const C &	cb,
		const C &	ce,
		CirculatorType	,
		ForwardCategory	)

inline

Computes the middle of a given range [ cb, ce ). Note that if cb = ce then [ cb, ce ) is assumed to be a whole range.

Parameters

cb	begin iterator of the range
ce	end iterator of the range

Returns: the middle circulator of the range [ cb , ce ) NB: linear in the range size

Template Parameters

C	any circulator

◆ rangeMiddle() [3/6]

template<typename C>

C DGtal::detail::rangeMiddle	(	const C &	cb,
		const C &	ce,
		CirculatorType	,
		RandomAccessCategory	)

inline

Computes the middle of a given range [ cb, ce ). Note that if cb = ce then [ cb, ce ) is assumed to be a whole range.

Parameters

cb	begin iterator of the range
ce	end iterator of the range

Returns: the middle circulator of the range [ cb , ce ) NB: in O(1)

Template Parameters

C	any circulator

◆ rangeMiddle() [4/6]

template<typename I>

I DGtal::detail::rangeMiddle	(	const I &	itb,
		const I &	ite,
		IteratorType	,
		BidirectionalCategory	)

inline

Computes the middle of a given range [ itb , ite )

Parameters

itb	begin iterator of the range
ite	end iterator of the range

Returns: the middle iterator of the range [ itb , ite ) NB: in O(ite-itb)

Template Parameters

I	any iterator

◆ rangeMiddle() [5/6]

template<typename I>

I DGtal::detail::rangeMiddle	(	const I &	itb,
		const I &	ite,
		IteratorType	,
		ForwardCategory	)

inline

Computes the middle of a given range [ itb , ite ).

Parameters

itb	begin iterator of the range
ite	end iterator of the range

Returns: the middle iterator of the range [ itb , ite ) NB: in O(ite-itb)

Template Parameters

I	any iterator

◆ rangeMiddle() [6/6]

template<typename I>

I DGtal::detail::rangeMiddle	(	const I &	itb,
		const I &	ite,
		IteratorType	,
		RandomAccessCategory	)

inline

Computes the middle of a given range [ itb , ite )

Parameters

itb	begin iterator of the range
ite	end iterator of the range

Returns: the middle iterator of the range [ itb , ite ) NB: in O(1)

Template Parameters

I	any iterator

◆ rangeSize() [1/4]

template<typename C>

IteratorCirculatorTraits< C >::Difference DGtal::detail::rangeSize	(	const C &	cb,
		const C &	ce,
		CirculatorType	,
		ForwardCategory	)

inline

Computes the size of a given range [ cb, ce ). Note that if cb = ce then [ cb, ce ) is assumed to be a whole range.

Parameters

cb	begin iterator of the range
ce	end iterator of the range

Returns: the size NB: linear in the range size

Template Parameters

C	any circulator

◆ rangeSize() [2/4]

template<typename C>

IteratorCirculatorTraits< C >::Difference DGtal::detail::rangeSize	(	const C &	cb,
		const C &	ce,
		CirculatorType	,
		RandomAccessCategory	)

inline

Computes the size of a given range [ cb, ce ). Note that if cb = ce then [ cb, ce ) is assumed to be a whole range.

Parameters

cb	begin iterator of the range
ce	end iterator of the range

Returns: the size NB: in O(1)

Template Parameters

C	any circulator

◆ rangeSize() [3/4]

template<typename I>

IteratorCirculatorTraits< I >::Difference DGtal::detail::rangeSize	(	const I &	itb,
		const I &	ite,
		IteratorType	,
		ForwardCategory	)

inline

Computes the size of a given range [ itb , ite )

Parameters

itb	begin iterator of the range
ite	end iterator of the range

Returns: the size NB: in O(ite-itb)

Template Parameters

I	any iterator

◆ rangeSize() [4/4]

template<typename I>

IteratorCirculatorTraits< I >::Difference DGtal::detail::rangeSize	(	const I &	itb,
		const I &	ite,
		IteratorType	,
		RandomAccessCategory	)

inline

Computes the size of a given range [ itb , ite )

Parameters

itb	begin iterator of the range
ite	end iterator of the range

Returns: the size NB: in O(1)

Template Parameters

I	any iterator

◆ squaredNorm()

template<typename Point>

Point::Coordinate DGtal::detail::squaredNorm ( Point const & aPoint )

Version of DGtal::PointVector::squaredNorm with no conversion to double.

Parameters

aPoint an input digital point.

Returns: the squared norm of the input point.

References aPoint.

◆ transform()

template<typename OutputValue, typename ForwardIterator, typename ConversionFct>

void DGtal::detail::transform	(	std::vector< OutputValue > &	output_values,
		std::vector< std::size_t > &	input2output,
		std::vector< std::size_t > &	output2input,
		ForwardIterator	itb,
		ForwardIterator	ite,
		const ConversionFct &	F,
		bool	remove_duplicates )

Transform an input range of points into an output range with a conversion function, and possibly removes duplicates in the output range. Used as preprocessing of QuickHull algorithm.

Template Parameters

OutputValue	any value that is LessThanComparable, Assignable, CopyConstructible, DefaultConstructible.
ConversionFct	is a functor from input values to OutputValue.
ForwardIterator	is a forward iterator on some input values.

Parameters

[out]	output_values	a range of points converted from the input range, with duplicates possibly removed according to remove_duplicates
[out]	input2output	the surjective mapping between the input range and the output range used for computation.
[out]	output2input	the injective mapping between the output range and the input range.
[in]	itb,ite	a range of values.
[in]	F	a function that may transform input values to output values
[in]	remove_duplicates	when 'true' remove duplicate values, otherwise, output_values.size() is equal to the size of the range itb,ite.

Definition at line 109 of file QuickHullKernels.h.

    {
      typedef std::size_t Size;
      std::vector< OutputValue > input;
      while ( itb != ite ) {
        const auto ip = *itb++;
        input.push_back( F( ip ) );
      }
      if ( ! remove_duplicates ) {
        output_values.swap( input );
        input2output.resize( input.size() );
        output2input.resize( input.size() );
        for ( Size i = 0; i < input.size(); ++i )
          input2output[ i ] = output2input[ i ] = i;
      }
      else {
        output_values.clear();
        std::vector< std::size_t > i2c_sort( input.size() );
        input2output.resize( input.size() );
        for ( Size i = 0; i < input.size(); i++ ) i2c_sort[ i ] = i;
        // indirect sort
        std::sort( i2c_sort.begin(), i2c_sort.end(),
                   [&input] ( Size i, Size j ) { return input[ i ] < input[ j ]; } );
        output_values.resize( input.size() );
        output_values[ 0 ] = input[ i2c_sort[ 0 ] ];
        input2output[ i2c_sort[ 0 ] ] = 0;
        Size j = 0;
        for ( Size i = 1; i < input.size(); i++ ) {
          if ( input[ i2c_sort[ i-1 ] ] != input[ i2c_sort[ i ] ] )
            output_values[ ++j ] = input[ i2c_sort[ i ] ];
          input2output[ i2c_sort[ i ] ] = j;
        }
        output_values.resize( j+1 );
        output2input.resize( output_values.size() );
        for ( Size i = 0; i < input2output.size(); i++ )
          output2input[ input2output[ i ] ] = i;
      }      
    }

Referenced by DGtal::ConvexHullIntegralKernel< dim, Integer, InternalInteger >::makeInput(), DGtal::ConvexHullRationalKernel< dim, Integer, InternalInteger >::makeInput(), DGtal::DelaunayIntegralKernel< dim, Integer, InternalInteger >::makeInput(), and DGtal::DelaunayRationalKernel< dim, Integer, InternalInteger >::makeInput().

Data Structures

Typedefs

Functions

Detailed Description

Typedef Documentation

◆ expr_node

Function Documentation

◆ advanceIterator() [1/2]

◆ advanceIterator() [2/2]

◆ argminLabelledMapMemoryUsageForGeometricDistribution()

◆ center()

◆ determinant()

◆ distToSphere()

◆ isBasisReduced()

◆ isNotEmpty() [1/2]

◆ isNotEmpty() [2/2]

◆ operator<<() [1/2]

◆ operator<<() [2/2]

◆ rangeMiddle() [1/6]

◆ rangeMiddle() [2/6]

◆ rangeMiddle() [3/6]

◆ rangeMiddle() [4/6]

◆ rangeMiddle() [5/6]

◆ rangeMiddle() [6/6]

◆ rangeSize() [1/4]

◆ rangeSize() [2/4]

◆ rangeSize() [3/4]

◆ rangeSize() [4/4]

◆ squaredNorm()

◆ transform()