Classes | |
class | OrderedPair |
OrderedPair holds two objects of the same arbitrary type. More... | |
struct | Triplet |
Triplet holds three objects of arbitrary type. More... | |
class | Array |
A multi-array of type T in N dimensions. More... | |
class | Array< 1, T, A > |
A 1-D array of type T. More... | |
class | ArrayContainer |
The interface to the container representation of arrays. More... | |
class | ArrayIndexing |
The indexing interface to N-D arrays. More... | |
class | ArrayIndexing< 1, T > |
The indexing interface to 1-D arrays. More... | |
class | ArrayIndexingBase |
The indexing interface to N-D arrays that is independent of the value type. More... | |
class | ArrayIndexingBase< 1 > |
The indexing interface to 1-D arrays. Independent of the value type. More... | |
class | ArrayIndexIterator |
An index iterator for an array. More... | |
class | ArrayTypes |
Defines types for arrays. More... | |
class | ArrayWithNullHoles |
A 1-D array with holes. More... | |
class | FixedArray |
A fixed size array with size N and type T. More... | |
class | FixedArray< 0, T > |
Partial template specialization for N = 0. More... | |
class | FixedArray< 1, T > |
Partial template specialization for N = 1. More... | |
class | FixedArray< 2, T > |
Partial template specialization for N = 2. More... | |
class | FixedArray< 3, T > |
Partial template specialization for N = 3. More... | |
class | IndexIterator |
An index iterator. More... | |
class | IndexRange |
An N-D index range class. More... | |
class | SparseArray< 1, T > |
A sparse array of type T in 1 dimension. More... | |
class | SparseArray< 2, T > |
A sparse array of type T in 2-D. More... | |
class | SparseArraySigned< 1, T > |
A sparse array of type T in 1 dimension. More... | |
class | StaticArrayOfArrays |
A static array of arrays. More... | |
struct | Address |
A functor for taking the address of an object. More... | |
struct | EqualToByHandle |
Functor for equality comparison of objects by their handles. More... | |
struct | NotEqualToByHandle |
Functor for inequality comparison of objects by their handles. More... | |
struct | GreaterByHandle |
Functor for greater than comparison of objects by their handles. More... | |
struct | LessByHandle |
Functor for less than comparison of objects by their handles. More... | |
struct | GreaterEqualByHandle |
Functor for greater than or equal to comparison of objects by their handles. More... | |
struct | LessEqualByHandle |
Functor for less than or equal to comparison of objects by their handles. More... | |
struct | EqualToByHandleHandle |
Functor for equality comparison of objects by handles to their handles. More... | |
struct | NotEqualToByHandleHandle |
Functor for inequality comparison of objects by handles to their handles. More... | |
struct | GreaterByHandleHandle |
Functor for greater than comparison of objects by handles to their handles. More... | |
struct | LessByHandleHandle |
Functor for less than comparison of objects by handles to their handles. More... | |
struct | GreaterEqualByHandleHandle |
Functor for greater than or equal to comparison of objects by handles to their handles. More... | |
struct | LessEqualByHandleHandle |
Functor for less than or equal to comparison of objects by handles to their handles. More... | |
class | unary_compose_unary_unary |
Unary function composition of two unary functions: f(g(x)). More... | |
class | binary_compose_unary_binary |
Binary function composition of a unary and binary function: f(g(x,y)). More... | |
class | unary_compose_binary_unary |
Unary function composition of a binary and unary functions: f(g(x),h(x)). More... | |
class | binary_compose_binary_unary |
Binary function composition of a binary and unary functions: f(g(x),h(y)). More... | |
class | less_composite |
Composite comparison of points. More... | |
struct | xless_composite |
Compare x coordinate using the composite number (x,y,z). More... | |
struct | yless_composite |
Compare y coordinate using the composite number (y,z,x). More... | |
struct | zless_composite |
Compare z coordinate using the composite number (z,x,y). More... | |
class | GeneratorConstant |
Generator that returns a constant. More... | |
class | GeneratorConstant< void > |
Generator that returns void. More... | |
class | UnaryConstant |
Unary functor that returns a constant. More... | |
class | BinaryConstant |
Binary functor that returns a constant. More... | |
class | LessThanCompareCoordinate |
Less than comparison in a specified coordinate. More... | |
struct | Dereference |
A functor for dereferencing a handle. More... | |
struct | HandleToPointer |
A functor for converting handles to pointers. More... | |
struct | Identity |
The identity functor. More... | |
class | IndexIteratorFunctor |
Index the iterator. More... | |
class | IndexIterUnary |
Unary function for indexing an iterator. More... | |
class | IndexObject |
Index the object. More... | |
class | IndexConstObject |
Index a const object. More... | |
class | UnaryLinear |
Linear functor. More... | |
struct | Select1st |
Functor for selecting the first element of a pair. More... | |
struct | Select2nd |
Functor for selecting the second element of a pair. More... | |
struct | SelectElement |
Functor for selecting an element of a sequence. More... | |
class | UniformRandom |
Uniformly distributed random numbers. More... | |
class | SubtractiveRNG |
Subtractive random number generator. More... | |
class | UniformRandomBase |
The base class manages the subtractive random number generator. More... | |
class | UniformRandomInteger |
Implementation for integer types. More... | |
class | UniformRandomReal |
Implementation for real (floating point) number types. More... | |
class | UniformRandom< char > |
Uniform random number generator for char. More... | |
class | UniformRandom< signed char > |
Uniform random number generator for signed char. More... | |
class | UniformRandom< unsigned char > |
Uniform random number generator for unsigned char. More... | |
class | UniformRandom< short > |
Uniform random number generator for short. More... | |
class | UniformRandom< unsigned short > |
Uniform random number generator for usigned short. More... | |
class | UniformRandom< int > |
Uniform random number generator for int. More... | |
class | UniformRandom< unsigned int > |
Uniform random number generator for unsigned int. More... | |
class | UniformRandom< float > |
Uniform random number generator for float. More... | |
class | UniformRandom< double > |
Uniform random number generator for double. More... | |
class | UniformRandom< long double > |
Uniform random number generator for long double. More... | |
class | UniformRandomPoint |
Uniform random points in N-D. More... | |
class | Face_Halfedge_circ |
Halfedge circulator for the halfedges around a face. More... | |
class | HalfedgeDS |
A halfedge data structure. More... | |
class | HDSFace |
A face in a halfedge data structure. More... | |
class | HDSHalfedge |
A halfedge in a halfedge data structure. More... | |
class | HDSNode |
A node in a halfedge data structure. More... | |
class | HDSVertex |
A vertex in a halfedge data structure. More... | |
class | AdaptedIterator |
A base class for all adapted iterators. More... | |
class | IndirectIterator |
An iterator that performs two dereferences in operator*() . More... | |
class | IndirectIterator2 |
An iterator that performs three dereferences in operator*() . More... | |
class | IntIterator |
A random access iterator over an integer type. More... | |
class | MemFunIterator |
An iterator that calls a member function in operator*() . More... | |
class | TransformIterator |
A transform iterator. More... | |
class | TrivialAssignable |
A trivial assignable object. More... | |
class | TrivialOutputIterator |
A trivial output iterator. More... | |
class | TrivialOutputIteratorCount |
A trivial output iterator that counts assignments. More... | |
class | HeapHandleArray |
A functor for getting handles into a heap. More... | |
class | PriorityQueue |
A base class for priority queues. More... | |
class | PriorityQueueBinaryHeap |
A priority queue implemented with a binary heap. More... | |
class | PriorityQueueBinaryHeapArray |
A binary heap priority queue for the data in an array. More... | |
class | PriorityQueueBinaryHeapDynamicKeys |
A priority queue with dynamic keys implemented with a binary heap. More... | |
class | PriorityQueueBinaryHeapStoreKeys |
A priority queue implemented with a binary heap that stores the keys. More... | |
class | PriorityQueueCellArray |
A priority queue utilizing a cell array. More... | |
class | IntSetSparse |
A set of integers. More... | |
class | SquareMatrix |
An NxN matrix. More... | |
class | SquareMatrix< 1, T > |
A 1x1 matrix. More... | |
class | SquareMatrix< 2, T > |
A 2x2 matrix. More... | |
class | SquareMatrix< 3, T > |
A 3x3 matrix. More... | |
class | TensorTypes |
A base class that defines types for all tensors. More... | |
class | Timer |
A timer that measures ellapsed time in seconds. More... | |
class | ObjectAndBlankSpace |
Useful for avoiding false sharing. More... | |
class | ParseOptionsArguments |
Class for parsing command line options and arguments. More... | |
Functions | |
template<typename _RandomAccessIterator> | |
_RandomAccessIterator | findMinimumElementUnrolledEven (_RandomAccessIterator begin, _RandomAccessIterator end) |
Return the minimum element in a range of even length. | |
template<typename _RandomAccessIterator> | |
_RandomAccessIterator | findMinimumElementUnrolledOdd (_RandomAccessIterator begin, _RandomAccessIterator end) |
Return the minimum element in a range of even length. | |
template<typename _RandomAccessIterator> | |
_RandomAccessIterator | findMinimumElementUnrolled (_RandomAccessIterator begin, _RandomAccessIterator end) |
Return the minimum element in a range. | |
template<typename _RandomAccessIterator> | |
_RandomAccessIterator | findMaximumElementUnrolledEven (_RandomAccessIterator begin, _RandomAccessIterator end) |
Return the maximum element in a range of even length. | |
template<typename _RandomAccessIterator> | |
_RandomAccessIterator | findMaximumElementUnrolledOdd (_RandomAccessIterator begin, _RandomAccessIterator end) |
Return the maximum element in a range of even length. | |
template<typename _RandomAccessIterator> | |
_RandomAccessIterator | findMaximumElementUnrolled (_RandomAccessIterator begin, _RandomAccessIterator end) |
Return the maximum element in a range. | |
template<typename _RandomAccessIterator, typename _BinaryPredicate> | |
_RandomAccessIterator | findExtremeElementUnrolledEven (_RandomAccessIterator begin, _RandomAccessIterator end, _BinaryPredicate compare) |
Return the extreme element in a range of even length. | |
template<typename _RandomAccessIterator, typename _BinaryPredicate> | |
_RandomAccessIterator | findExtremeElementUnrolledOdd (_RandomAccessIterator begin, _RandomAccessIterator end, _BinaryPredicate compare) |
Return the extreme element in a range of even length. | |
template<typename _RandomAccessIterator, typename _BinaryPredicate> | |
_RandomAccessIterator | findExtremeElementUnrolled (_RandomAccessIterator begin, _RandomAccessIterator end, _BinaryPredicate compare) |
Return the extreme element in a range. | |
template<typename RandomAccessIterator> | |
void | insertion_sort (RandomAccessIterator first, RandomAccessIterator last) |
Insertion sort. | |
template<typename RandomAccessIterator, typename Compare> | |
void | insertion_sort (RandomAccessIterator first, RandomAccessIterator last, Compare comp) |
Insertion sort with a comparison function. | |
template<typename ForwardIterator> | |
bool | is_sorted (ForwardIterator first, ForwardIterator last) |
Return true if the range is in sorted order. | |
template<typename ForwardIterator, typename StrictWeakOrdering> | |
bool | is_sorted (ForwardIterator first, ForwardIterator last, StrictWeakOrdering comp) |
Return true if the range is in sorted order. | |
template<typename T> | |
const T & | min (const T &a, const T &b, const T &c) |
This does what you think it does. | |
template<typename T> | |
const T & | min (const T &a, const T &b, const T &c, const T &d) |
This does what you think it does. | |
template<typename T> | |
const T & | min (const T &a, const T &b, const T &c, const T &d, const T &e) |
This does what you think it does. | |
template<typename T> | |
const T & | max (const T &a, const T &b, const T &c) |
This does what you think it does. | |
template<typename T> | |
const T & | max (const T &a, const T &b, const T &c, const T &d) |
This does what you think it does. | |
template<typename T> | |
const T & | max (const T &a, const T &b, const T &c, const T &d, const T &e) |
This does what you think it does. | |
template<typename T, typename Compare> | |
const T & | min (const T &a, const T &b, const T &c, Compare comp) |
This does what you think it does. | |
template<typename T, typename Compare> | |
const T & | min (const T &a, const T &b, const T &c, const T &d, Compare comp) |
This does what you think it does. comp is a comparison functor. | |
template<typename T, typename Compare> | |
const T & | min (const T &a, const T &b, const T &c, const T &d, const T &e, Compare comp) |
This does what you think it does. comp is a comparison functor. | |
template<typename T, typename Compare> | |
const T & | max (const T &a, const T &b, const T &c, Compare comp) |
This does what you think it does. | |
template<typename T, typename Compare> | |
const T & | max (const T &a, const T &b, const T &c, const T &d, Compare comp) |
This does what you think it does. comp is a comparison functor. | |
template<typename T, typename Compare> | |
const T & | max (const T &a, const T &b, const T &c, const T &d, const T &e, Compare comp) |
This does what you think it does. comp is a comparison functor. | |
template<typename T> | |
OrderedPair< T > | makeOrderedPair (const T &x, const T &y) |
A convenience wrapper for creating a OrderedPair. | |
template<typename T> | |
int | sign (const T x) |
This does what you think it does. The number type must be less than and greater than comparable. | |
template<typename ForwardIterator1, typename ForwardIterator2> | |
ForwardIterator1 | skipElementsUsingIteration (ForwardIterator1 iterator, ForwardIterator2 beginning, ForwardIterator2 end) |
Advance the iterator while it's value is equal to any of the elements in the range. Return the advanced iterator. | |
template<typename ForwardIterator, typename IteratorForwardIterator> | |
ForwardIterator | skipIteratorsUsingIteration (ForwardIterator iterator, IteratorForwardIterator beginning, IteratorForwardIterator end) |
Advance the iterator while it is equal to any of the elements in the range. Return the advanced iterator. | |
template<typename RandomAccessIterator1, typename RandomAccessIterator2, typename Compare> | |
void | sortTogether (RandomAccessIterator1 begin1, RandomAccessIterator1 end1, RandomAccessIterator2 begin2, RandomAccessIterator2 end2, Compare compare1) |
Sort the two ranges together, using the first for comparisons. | |
template<typename RandomAccessIterator1, typename RandomAccessIterator2> | |
void | sortTogether (RandomAccessIterator1 begin1, RandomAccessIterator1 end1, RandomAccessIterator2 begin2, RandomAccessIterator2 end2) |
Sort the two ranges together, using the first for comparisons. | |
template<typename RandomAccessIterator1, typename RandomAccessIterator2, typename RandomAccessIterator3, typename Compare> | |
void | sortTogether (RandomAccessIterator1 begin1, RandomAccessIterator1 end1, RandomAccessIterator2 begin2, RandomAccessIterator2 end2, RandomAccessIterator3 begin3, RandomAccessIterator3 end3, Compare compare1) |
Sort the three ranges together, using the first for comparisons. | |
template<typename RandomAccessIterator1, typename RandomAccessIterator2, typename RandomAccessIterator3> | |
void | sortTogether (RandomAccessIterator1 begin1, RandomAccessIterator1 end1, RandomAccessIterator2 begin2, RandomAccessIterator2 end2, RandomAccessIterator3 begin3, RandomAccessIterator3 end3) |
Sort the two ranges together, using the first for comparisons. | |
template<typename RandomAccessIterator, typename IntInputIterator> | |
void | orderByRank (RandomAccessIterator begin, RandomAccessIterator end, IntInputIterator ranks) |
Order the elements by rank. | |
template<typename InputIterator> | |
std::iterator_traits< InputIterator >::value_type | computeMinimum (InputIterator beginning, InputIterator end) |
Compute the minimum value for the elements in the range. | |
template<typename InputIterator> | |
std::iterator_traits< InputIterator >::value_type | computeMaximum (InputIterator beginning, InputIterator end) |
Compute the maximum value for the elements in the range. | |
template<typename InputIterator, typename T> | |
void | computeMinimumAndMaximum (InputIterator beginning, InputIterator end, T *minimum, T *maximum) |
Compute the minimum and maximum values for the elements in the range. | |
template<typename InputIterator> | |
std::iterator_traits< InputIterator >::value_type | computeMean (InputIterator beginning, InputIterator end) |
Compute the mean value for the elements in the range. | |
template<typename InputIterator, typename T> | |
void | computeMinimumMaximumAndMean (InputIterator beginning, InputIterator end, T *minimum, T *maximum, T *mean) |
Compute the minimum, maximum, and mean for the elements in the range. | |
template<typename ForwardIterator, typename T> | |
void | computeMeanAndVariance (ForwardIterator beginning, ForwardIterator end, T *mean, T *variance) |
Compute the mean and variance for the elements in the range. | |
template<typename ForwardIterator> | |
std::iterator_traits< ForwardIterator >::value_type | computeVariance (ForwardIterator beginning, ForwardIterator end) |
Compute the variance for the elements in the range. | |
template<typename ForwardIterator, typename T> | |
void | computeMeanAbsoluteDeviationVarianceSkewAndCurtosis (ForwardIterator beginning, ForwardIterator end, T *mean, T *absoluteDeviation, T *variance, T *skew, T *curtosis) |
Compute the mean, absolute deviation, variance, skew and curtosis for the elements in the range. | |
template<typename T1, typename T2, typename T3> | |
bool | operator== (const Triplet< T1, T2, T3 > &x, const Triplet< T1, T2, T3 > &y) |
Two Triplets of the same type are equal iff their members are equal. | |
template<typename T1, typename T2, typename T3> | |
bool | operator< (const Triplet< T1, T2, T3 > &x, const Triplet< T1, T2, T3 > &y) |
Treat the triplet as a composite number. | |
template<typename T1, typename T2, typename T3> | |
bool | operator!= (const Triplet< T1, T2, T3 > &x, const Triplet< T1, T2, T3 > &y) |
Return true if the members are not all equal. | |
template<typename T1, typename T2, typename T3> | |
bool | operator> (const Triplet< T1, T2, T3 > &x, const Triplet< T1, T2, T3 > &y) |
Use operator< to find the result. | |
template<typename T1, typename T2, typename T3> | |
bool | operator<= (const Triplet< T1, T2, T3 > &x, const Triplet< T1, T2, T3 > &y) |
Use operator< to find the result. | |
template<typename T1, typename T2, typename T3> | |
bool | operator>= (const Triplet< T1, T2, T3 > &x, const Triplet< T1, T2, T3 > &y) |
Use operator< to find the result. | |
template<typename T1, typename T2, typename T3> | |
Triplet< T1, T2, T3 > | makeTriplet (const T1 &x, const T2 &y, const T3 &z) |
A convenience wrapper for creating a Triplet from three objects. | |
template<typename InputIterator> | |
bool | areElementsUnique (InputIterator first, InputIterator last) |
Return true if the elements are unique. | |
template<typename InputIterator, typename StrictWeakOrdering, typename BinaryPredicate> | |
bool | areElementsUnique (InputIterator first, InputIterator last, StrictWeakOrdering ordering, BinaryPredicate pred) |
Return true if the elements are unique. | |
template<typename T, bool A> | |
ArrayContainer< T, A > & | operator+= (ArrayContainer< T, A > &array, typename ArrayContainer< T, A >::parameter_type x) |
To be used for arithmetic types. | |
template<typename T, bool A> | |
ArrayContainer< T, A > & | operator-= (ArrayContainer< T, A > &array, typename ArrayContainer< T, A >::parameter_type x) |
To be used for arithmetic types. | |
template<typename T, bool A> | |
ArrayContainer< T, A > & | operator *= (ArrayContainer< T, A > &array, typename ArrayContainer< T, A >::parameter_type x) |
To be used for arithmetic types. | |
template<typename T, bool A> | |
ArrayContainer< T, A > & | operator/= (ArrayContainer< T, A > &array, typename ArrayContainer< T, A >::parameter_type x) |
To be used for arithmetic types. | |
template<typename T, bool A> | |
ArrayContainer< T, A > & | operator%= (ArrayContainer< T, A > &array, typename ArrayContainer< T, A >::parameter_type x) |
To be used for arithmetic types. | |
template<typename T, bool A> | |
ArrayContainer< T *, A > & | operator+= (ArrayContainer< T *, A > &array, typename ArrayContainer< T *, A >::difference_type x) |
To be used for pointer types. | |
template<typename T, bool A> | |
ArrayContainer< T *, A > & | operator-= (ArrayContainer< T *, A > &array, typename ArrayContainer< T *, A >::difference_type x) |
To be used for pointer types. | |
template<typename T1, bool A1, typename T2, bool A2> | |
ArrayContainer< T1, A1 > & | operator+= (ArrayContainer< T1, A1 > &x, const ArrayContainer< T2, A2 > &y) |
Component-wise addition. | |
template<typename T1, bool A1, typename T2, bool A2> | |
ArrayContainer< T1, A1 > & | operator-= (ArrayContainer< T1, A1 > &x, const ArrayContainer< T2, A2 > &y) |
Component-wise subtraction. | |
template<typename T1, bool A1, typename T2, bool A2> | |
ArrayContainer< T1, A1 > & | operator *= (ArrayContainer< T1, A1 > &x, const ArrayContainer< T2, A2 > &y) |
Component-wise multiplication. | |
template<typename T1, bool A1, typename T2, bool A2> | |
ArrayContainer< T1, A1 > & | operator/= (ArrayContainer< T1, A1 > &x, const ArrayContainer< T2, A2 > &y) |
Component-wise division. | |
template<typename T1, bool A1, typename T2, bool A2> | |
ArrayContainer< T1, A1 > & | operator%= (ArrayContainer< T1, A1 > &x, const ArrayContainer< T2, A2 > &y) |
Component-wise modulus. | |
template<int N> | |
bool | operator== (const ArrayIndexIterator< N > &x, const ArrayIndexIterator< N > &y) |
Return true if the iterators have a handle to the same index. | |
template<int N> | |
bool | operator!= (const ArrayIndexIterator< N > &x, const ArrayIndexIterator< N > &y) |
Return true if the iterators do not have a handle to the same index. | |
template<int N> | |
bool | operator< (const ArrayIndexIterator< N > &x, const ArrayIndexIterator< N > &y) |
Return true if the index of x precedes that of y . | |
template<int N> | |
bool | operator> (const ArrayIndexIterator< N > &x, const ArrayIndexIterator< N > &y) |
Return true if the index of x follows that of y . | |
template<int N> | |
bool | operator<= (const ArrayIndexIterator< N > &x, const ArrayIndexIterator< N > &y) |
Return true if the index of x precedes or is equal to that of y . | |
template<int N> | |
bool | operator>= (const ArrayIndexIterator< N > &x, const ArrayIndexIterator< N > &y) |
Return true if the index of x follows or is equal to that of y . | |
template<int N> | |
ArrayIndexIterator< N >::difference_type | operator- (const ArrayIndexIterator< N > &x, const ArrayIndexIterator< N > &y) |
The difference of two iterators. | |
template<int N> | |
ArrayIndexIterator< N > | operator+ (typename ArrayIndexIterator< N >::difference_type n, const ArrayIndexIterator< N > &i) |
Iterator advance. | |
template<int N, typename T> | |
std::ostream & | operator<< (std::ostream &out, const SparseArray< N, T > &x) |
Write a SparseArray in ascii format. | |
template<int N, typename T> | |
std::istream & | operator>> (std::istream &in, SparseArray< N, T > &x) |
Read a SparseArray in ascii format. | |
template<typename T> | |
int | countNonNullElementsInUnion (const SparseArray< 1, T > &a, const SparseArray< 1, T > &b) |
Count the number of non-null elements in the union of the arrays. | |
template<typename T> | |
void | computeSum (const SparseArray< 1, T > &x, const SparseArray< 1, T > &y, SparseArray< 1, T > *result) |
Compute the sum of the two arrays. | |
template<typename T> | |
void | computeDifference (const SparseArray< 1, T > &x, const SparseArray< 1, T > &y, SparseArray< 1, T > *result) |
Compute the difference of the two arrays. | |
template<typename T> | |
void | computeProduct (const SparseArray< 1, T > &x, const SparseArray< 1, T > &y, SparseArray< 1, T > *result) |
Compute the product of the two arrays. | |
template<typename T, typename BinaryFunction> | |
void | computeBinaryOperation (const SparseArray< 1, T > &x, const SparseArray< 1, T > &y, SparseArray< 1, T > *result, const BinaryFunction &function) |
Use the binary function to compute the result. | |
template<typename T1, bool A, typename T2> | |
Array< 1, T1, A > & | operator+= (Array< 1, T1, A > &x, const SparseArray< 1, T2 > &y) |
+= on the non-null elements. | |
template<typename T1, bool A, typename T2> | |
Array< 1, T1, A > & | operator-= (Array< 1, T1, A > &x, const SparseArray< 1, T2 > &y) |
-= on the non-null elements. | |
template<typename T1, bool A, typename T2> | |
Array< 1, T1, A > & | operator *= (Array< 1, T1, A > &x, const SparseArray< 1, T2 > &y) |
*= on the non-null elements. | |
template<typename T1, bool A, typename T2> | |
Array< 1, T1, A > & | operator/= (Array< 1, T1, A > &x, const SparseArray< 1, T2 > &y) |
/= on the non-null elements. | |
template<typename T1, bool A, typename T2> | |
Array< 1, T1, A > & | operator%= (Array< 1, T1, A > &x, const SparseArray< 1, T2 > &y) |
= on the non-null elements. | |
template<typename T1, bool A, typename T2, typename T3> | |
void | scaleAdd (Array< 1, T1, A > *x, const T2 a, const SparseArray< 1, T3 > &y) |
Perform x += a * y on the non-null elements. | |
template<int _N, typename _T1, typename _T2> | |
FixedArray< _N, _T1 > & | operator+= (FixedArray< _N, _T1 > &x, const SparseArray< 1, _T2 > &y) |
+= on the non-null elements. | |
template<int _N, typename _T1, typename _T2> | |
FixedArray< _N, _T1 > & | operator-= (FixedArray< _N, _T1 > &x, const SparseArray< 1, _T2 > &y) |
-= on the non-null elements. | |
template<int _N, typename _T1, typename _T2> | |
FixedArray< _N, _T1 > & | operator *= (FixedArray< _N, _T1 > &x, const SparseArray< 1, _T2 > &y) |
*= on the non-null elements. | |
template<int _N, typename _T1, typename _T2> | |
FixedArray< _N, _T1 > & | operator/= (FixedArray< _N, _T1 > &x, const SparseArray< 1, _T2 > &y) |
/= on the non-null elements. | |
template<int _N, typename _T1, typename _T2> | |
FixedArray< _N, _T1 > & | operator%= (FixedArray< _N, _T1 > &x, const SparseArray< 1, _T2 > &y) |
= on the non-null elements. | |
template<int _N, typename _T1, typename _T2, typename _T3> | |
void | scaleAdd (FixedArray< _N, _T1 > *x, const _T2 a, const SparseArray< 1, _T3 > &y) |
Perform x += a * y on the non-null elements. | |
template<typename T> | |
void | merge (const SparseArraySigned< 1, T > &a, const SparseArraySigned< 1, T > &b, SparseArraySigned< 1, T > &c) |
Merge the arrays. | |
template<typename T> | |
void | remove_unecessary_elements (SparseArraySigned< 1, T > &a) |
Remove the unecessary elements. | |
template<typename T> | |
void | compute_union (const SparseArraySigned< 1, T > &a, const SparseArraySigned< 1, T > &b, SparseArraySigned< 1, T > &c) |
Compute the union of the arrays. | |
template<typename T> | |
void | compute_intersection (const SparseArraySigned< 1, T > &a, const SparseArraySigned< 1, T > &b, SparseArraySigned< 1, T > &c) |
Compute the intersection of the arrays. | |
template<int N, typename T> | |
bool | operator== (const SparseArraySigned< N, T > &x, const SparseArraySigned< N, T > &y) |
Return true if the arrays are equal. | |
template<int N, typename T> | |
bool | operator!= (const SparseArraySigned< N, T > &x, const SparseArraySigned< N, T > &y) |
Return true if the arrays are not equal. | |
template<int N, typename T> | |
std::ostream & | operator<< (std::ostream &out, const SparseArraySigned< N, T > &x) |
Write a SparseArraySigned in ascii format. | |
template<int N, typename T> | |
std::istream & | operator>> (std::istream &in, SparseArraySigned< N, T > &x) |
Read a SparseArraySigned in ascii format. | |
template<typename Object> | |
Address< Object > | address () |
Return an Address<Object> . | |
template<int N, typename PointType> | |
bool | less_composite_fcn (const int n, const PointType &a, const PointType &b) |
Compare the n coordinate of an N-dimensional composite number. | |
template<typename Pt3D> | |
bool | xless_composite_compare (const Pt3D &a, const Pt3D &b) |
Compare x coordinate using the composite number (x,y,z). | |
template<typename Pt3D> | |
bool | yless_composite_compare (const Pt3D &a, const Pt3D &b) |
Compare y coordinate using the composite number (y,z,x). | |
template<typename Pt3D> | |
bool | zless_composite_compare (const Pt3D &a, const Pt3D &b) |
Compare z coordinate using the composite number (z,x,y). | |
template<typename Pt3D> | |
bool | less_composite_compare (int i, const Pt3D &a, const Pt3D &b) |
Compare the i coordinate. | |
template<typename Point> | |
LessThanCompareCoordinate< Point > | constructLessThanCompareCoordinate (const int n=-1) |
Convenience function for constructing a LessThanCompareCoordinate functor. | |
template<typename Handle> | |
Dereference< Handle > | dereference () |
Return a Dereference<Handle> . | |
template<typename Handle> | |
HandleToPointer< Handle > | handle_to_pointer () |
Return a HandleToPointer<Handle> . | |
template<typename T> | |
Identity< T > | identity () |
Convenience function for constructing an Identity . | |
template<typename RAIter> | |
IndexIteratorFunctor< RAIter > | index_iterator_functor () |
Convenience function for constructing an IndexIterator . | |
template<typename RAIter> | |
IndexIterUnary< RAIter > | index_iter_unary (RAIter i) |
Convenience function for constructing an IndexIterator . | |
template<typename Object> | |
IndexObject< Object > | index_object () |
Convenience function for constructing an IndexObject . | |
template<typename Object> | |
IndexConstObject< Object > | index_const_object () |
Convenience function for constructing an IndexConstObject . | |
template<typename T> | |
UnaryLinear< T > | unary_linear (const T a, const T b) |
Convenience function for constructing a UnaryLinear . | |
template<typename T> | |
UnaryLinear< T > | unary_linear () |
Convenience function for constructing a UnaryLinear . | |
template<class Pair> | |
Select1st< Pair > | select_1st () |
Convenience function for constructing a Select1st . | |
template<class Pair> | |
Select2nd< Pair > | select_2nd () |
Convenience function for constructing a Select2nd . | |
template<class Sequence, int N> | |
SelectElement< Sequence, N > | select_element () |
Convenience function for constructing a SelectElement . | |
template<class Iterator> | |
bool | operator== (const Face_Halfedge_circ< Iterator > &x, const Face_Halfedge_circ< Iterator > &y) |
Return true if the circulators point to the same object. | |
template<class Iterator> | |
bool | operator!= (const Face_Halfedge_circ< Iterator > &x, const Face_Halfedge_circ< Iterator > &y) |
Return true if the circulators don't point to the same object. | |
template<template< class > class Vertex, template< class > class Halfedge, template< class > class Face> | |
bool | operator== (const HalfedgeDS< Vertex, Halfedge, Face > &a, const HalfedgeDS< Vertex, Halfedge, Face > &b) |
Return true if the half-edge data structures are equal. | |
template<template< class > class Vertex, template< class > class Halfedge, template< class > class Face> | |
bool | operator!= (const HalfedgeDS< Vertex, Halfedge, Face > &a, const HalfedgeDS< Vertex, Halfedge, Face > &b) |
Return true if the half-edge data structures are not equal. | |
template<template< class > class Vertex, template< class > class Halfedge, template< class > class Face> | |
std::ostream & | operator<< (std::ostream &out, const HalfedgeDS< Vertex, Halfedge, Face > &x) |
Write to a stream using the put() member function. | |
template<template< class > class Vertex, template< class > class Halfedge, template< class > class Face> | |
std::istream & | operator>> (std::istream &in, HalfedgeDS< Vertex, Halfedge, Face > &x) |
Read from a stream using the get() member function. | |
template<typename T> | |
bool | operator>= (const IntIterator< T > &x, const IntIterator< T > &y) |
Return true if the index of x follows or is equal to that of y . | |
TrivialOutputIterator | constructTrivialOutputIterator () |
Convenience function for instantiating a TrivialOutputIterator. | |
TrivialOutputIteratorCount | constructTrivialOutputIteratorCount (int &count) |
Convenience function for instantiating a TrivialOutputIteratorCount. | |
template<typename T, int N> | |
SquareMatrix< N, T > | operator+ (const SquareMatrix< N, T > &m, const T x) |
SquareMatrix-scalar addition. | |
template<typename T, int N> | |
SquareMatrix< N, T > | operator+ (const T x, const SquareMatrix< N, T > &m) |
Scalar-SquareMatrix addition. | |
template<typename T, int N> | |
SquareMatrix< N, T > | operator+ (const SquareMatrix< N, T > &x, const SquareMatrix< N, T > &y) |
SquareMatrix-SquareMatrix addition. | |
template<typename T, int N> | |
SquareMatrix< N, T > | operator- (const SquareMatrix< N, T > &m, const T x) |
SquareMatrix-scalar subtraction. | |
template<typename T, int N> | |
SquareMatrix< N, T > | operator- (const T x, const SquareMatrix< N, T > &m) |
Scalar-SquareMatrix subtraction. | |
template<typename T, int N> | |
SquareMatrix< N, T > | operator- (const SquareMatrix< N, T > &x, const SquareMatrix< N, T > &y) |
SquareMatrix-SquareMatrix subtraction. | |
template<int N, typename T> | |
SquareMatrix< N, T > | operator * (const SquareMatrix< N, T > &m, const T x) |
SquareMatrix-scalar product. | |
template<int N, typename T> | |
SquareMatrix< N, T > | operator * (const T x, const SquareMatrix< N, T > &m) |
Scalar-SquareMatrix product. | |
template<int N, typename T> | |
SquareMatrix< N, T > | operator * (const SquareMatrix< N, T > &x, const SquareMatrix< N, T > &y) |
SquareMatrix-SquareMatrix product. | |
template<int N, typename T> | |
SquareMatrix< N, T > | operator/ (const SquareMatrix< N, T > &m, const T x) |
SquareMatrix-scalar division. | |
template<int N, typename T> | |
SquareMatrix< N, T > | operator/ (const T x, const SquareMatrix< N, T > &m) |
Scalar-SquareMatrix division. | |
template<int N, typename T> | |
T | computeSum (const SquareMatrix< N, T > &x) |
Return the sum of the elements. | |
template<int N, typename T> | |
T | computeProduct (const SquareMatrix< N, T > &x) |
Return the product of the elements. | |
template<int N, typename T> | |
T | computeMinimum (const SquareMatrix< N, T > &x) |
Return the minimum element. Use < for comparison. | |
template<int N, typename T> | |
T | computeMaximum (const SquareMatrix< N, T > &x) |
Return the maximum element. Use > for comparison. | |
template<int N, typename T> | |
T | computeDeterminant (const SquareMatrix< N, T > &x) |
Return the determinant of the matrix. | |
template<int N, typename T> | |
T | computeTrace (const SquareMatrix< N, T > &x) |
Return the trace of the matrix. | |
template<int N, typename T> | |
SquareMatrix< N, T > | computeTranspose (const SquareMatrix< N, T > &x) |
Return the transpose of the matrix. | |
template<int N, typename T> | |
SquareMatrix< N, T > | computeInverse (const SquareMatrix< N, T > &x) |
Return the inverse of the matrix. | |
template<int N, typename T> | |
void | computeInverse (const SquareMatrix< N, T > &x, SquareMatrix< N, T > *y) |
Compute the inverse of the matrix. | |
template<int N, typename T> | |
void | computeScaledInverse (const SquareMatrix< N, T > &x, SquareMatrix< N, T > *si) |
Calculate the scaled inverse of the matrix: determinant * inverse. | |
template<int N, typename T> | |
SquareMatrix< N, T > | computeScaledInverse (const SquareMatrix< N, T > &x) |
Return the scaled inverse of the matrix: determinant * inverse. | |
template<int N, typename T> | |
T | computeFrobeniusNormSquared (const SquareMatrix< N, T > &x) |
Return the frobenius norm of the matrix. | |
template<int N, typename T> | |
T | computeFrobeniusNorm (const SquareMatrix< N, T > &x) |
Return the frobenius norm of the matrix. | |
template<int N, typename T> | |
T | computeInnerProduct (const SquareMatrix< N, T > &x, const SquareMatrix< N, T > &y) |
Return the inner product of the matrices. computeTrace(transpose(x) * y). | |
template<int N, typename T> | |
void | computeProduct (const SquareMatrix< N, T > &m, const FixedArray< N, T > &v, FixedArray< N, T > *x) |
Compute the matrix-vector product. x = m * v . | |
template<int N, typename T1, typename T2> | |
bool | operator== (const SquareMatrix< N, T1 > &a, const SquareMatrix< N, T2 > &b) |
Return true if the matrices are equal. | |
template<int N, typename T1, typename T2> | |
bool | operator!= (const SquareMatrix< N, T1 > &a, const SquareMatrix< N, T2 > &b) |
Return true if the tensors are not equal. | |
template<int N, typename T> | |
std::ostream & | operator<< (std::ostream &out, const SquareMatrix< N, T > &x) |
Write a matrix as rows with space-separated numbers. | |
template<int N, typename T> | |
std::istream & | operator>> (std::istream &in, SquareMatrix< N, T > &x) |
Read white space-separated numbers into a matrix. | |
template<typename T> | |
SquareMatrix< 1, T > | operator+ (const SquareMatrix< 1, T > &m, const T x) |
SquareMatrix-scalar addition. | |
template<typename T> | |
SquareMatrix< 1, T > | operator+ (const T x, const SquareMatrix< 1, T > &m) |
Scalar-SquareMatrix addition. | |
template<typename T> | |
SquareMatrix< 1, T > | operator+ (const SquareMatrix< 1, T > &x, const SquareMatrix< 1, T > &y) |
SquareMatrix-SquareMatrix addition. | |
template<typename T> | |
SquareMatrix< 1, T > | operator- (const SquareMatrix< 1, T > &m, const T x) |
SquareMatrix-scalar subtraction. | |
template<typename T> | |
SquareMatrix< 1, T > | operator- (const T x, const SquareMatrix< 1, T > &m) |
Scalar-SquareMatrix subtraction. | |
template<typename T> | |
SquareMatrix< 1, T > | operator- (const SquareMatrix< 1, T > &x, const SquareMatrix< 1, T > &y) |
SquareMatrix-SquareMatrix subtraction. | |
template<typename T> | |
SquareMatrix< 1, T > | operator * (const SquareMatrix< 1, T > &m, const T x) |
SquareMatrix-scalar product. | |
template<typename T> | |
SquareMatrix< 1, T > | operator * (const T x, const SquareMatrix< 1, T > &m) |
Scalar-SquareMatrix product. | |
template<typename T> | |
SquareMatrix< 1, T > | operator * (const SquareMatrix< 1, T > &x, const SquareMatrix< 1, T > &y) |
SquareMatrix-SquareMatrix product. | |
template<typename T> | |
SquareMatrix< 1, T > | operator/ (const SquareMatrix< 1, T > &m, const T x) |
SquareMatrix-scalar division. | |
template<typename T> | |
SquareMatrix< 1, T > | operator/ (const T x, const SquareMatrix< 1, T > &m) |
Scalar-SquareMatrix division. | |
template<typename T> | |
T | computeSum (const SquareMatrix< 1, T > &x) |
Return the sum of the elements. | |
template<typename T> | |
T | computeProduct (const SquareMatrix< 1, T > &x) |
Return the product of the elements. | |
template<typename T> | |
T | computeMinimum (const SquareMatrix< 1, T > &x) |
Return the minimum element. Use < for comparison. | |
template<typename T> | |
T | computeMaximum (const SquareMatrix< 1, T > &x) |
Return the maximum element. Use > for comparison. | |
template<typename T> | |
T | computeDeterminant (const SquareMatrix< 1, T > &x) |
Return the determinant of the matrix. | |
template<typename T> | |
T | computeTrace (const SquareMatrix< 1, T > &x) |
Return the trace of the matrix. | |
template<typename T> | |
SquareMatrix< 1, T > | computeTranspose (const SquareMatrix< 1, T > &x) |
Return the transpose of the matrix. | |
template<typename T> | |
SquareMatrix< 1, T > | computeInverse (const SquareMatrix< 1, T > &x) |
Return the inverse of the matrix. | |
template<typename T> | |
void | computeInverse (const SquareMatrix< 1, T > &x, SquareMatrix< 1, T > *y) |
Compute the inverse of the matrix. | |
template<typename T> | |
void | computeScaledInverse (const SquareMatrix< 1, T > &x, SquareMatrix< 1, T > *si) |
Calculate the scaled inverse of the matrix: determinant * inverse. | |
template<typename T> | |
SquareMatrix< 1, T > | computeScaledInverse (const SquareMatrix< 1, T > &x) |
Return the scaled inverse of the matrix: determinant * inverse. | |
template<typename T> | |
T | computeFrobeniusNorm (const SquareMatrix< 1, T > &x) |
Return the frobenius norm of the matrix. | |
template<typename T> | |
T | computeFrobeniusNormSquared (const SquareMatrix< 1, T > &x) |
Return the frobenius norm of the matrix. | |
template<typename T> | |
T | computeInnerProduct (const SquareMatrix< 1, T > &x, const SquareMatrix< 1, T > &y) |
Return the inner product of the matrices. computeTrace(transpose(x) * y). | |
template<typename T> | |
void | computeProduct (const SquareMatrix< 1, T > &m, const FixedArray< 1, T > &v, FixedArray< 1, T > *x) |
Compute the matrix-vector product. x = m * v . | |
template<typename T1, typename T2> | |
bool | operator== (const SquareMatrix< 1, T1 > &a, const SquareMatrix< 1, T2 > &b) |
Return true if the matrices are equal. | |
template<typename T1, typename T2> | |
bool | operator!= (const SquareMatrix< 1, T1 > &a, const SquareMatrix< 1, T2 > &b) |
Return true if the tensors are not equal. | |
template<typename T> | |
std::ostream & | operator<< (std::ostream &out, const SquareMatrix< 1, T > &x) |
Write a matrix as rows with space-separated numbers. | |
template<typename T> | |
std::istream & | operator>> (std::istream &in, SquareMatrix< 1, T > &x) |
Read white space-separated numbers into a matrix. | |
template<typename T> | |
SquareMatrix< 2, T > | operator+ (const SquareMatrix< 2, T > &m, const T x) |
SquareMatrix-scalar addition. | |
template<typename T> | |
SquareMatrix< 2, T > | operator+ (const T x, const SquareMatrix< 2, T > &m) |
Scalar-SquareMatrix addition. | |
template<typename T> | |
SquareMatrix< 2, T > | operator+ (const SquareMatrix< 2, T > &x, const SquareMatrix< 2, T > &y) |
SquareMatrix-SquareMatrix addition. | |
template<typename T> | |
SquareMatrix< 2, T > | operator- (const SquareMatrix< 2, T > &m, const T x) |
SquareMatrix-scalar subtraction. | |
template<typename T> | |
SquareMatrix< 2, T > | operator- (const T x, const SquareMatrix< 2, T > &m) |
Scalar-SquareMatrix subtraction. | |
template<typename T> | |
SquareMatrix< 2, T > | operator- (const SquareMatrix< 2, T > &x, const SquareMatrix< 2, T > &y) |
SquareMatrix-SquareMatrix subtraction. | |
template<typename T> | |
SquareMatrix< 2, T > | operator * (const SquareMatrix< 2, T > &m, const T x) |
SquareMatrix-scalar product. | |
template<typename T> | |
SquareMatrix< 2, T > | operator * (const T x, const SquareMatrix< 2, T > &m) |
Scalar-SquareMatrix product. | |
template<typename T> | |
SquareMatrix< 2, T > | operator * (const SquareMatrix< 2, T > &x, const SquareMatrix< 2, T > &y) |
SquareMatrix-SquareMatrix product. | |
template<typename T> | |
SquareMatrix< 2, T > | operator/ (const SquareMatrix< 2, T > &m, const T x) |
SquareMatrix-scalar division. | |
template<typename T> | |
SquareMatrix< 2, T > | operator/ (const T x, const SquareMatrix< 2, T > &m) |
Scalar-SquareMatrix division. | |
template<typename T> | |
T | computeSum (const SquareMatrix< 2, T > &x) |
Return the sum of the elements. | |
template<typename T> | |
T | computeProduct (const SquareMatrix< 2, T > &x) |
Return the product of the elements. | |
template<typename T> | |
T | computeMinimum (const SquareMatrix< 2, T > &x) |
Return the minimum element. Use < for comparison. | |
template<typename T> | |
T | computeMaximum (const SquareMatrix< 2, T > &x) |
Return the maximum element. Use > for comparison. | |
template<typename T> | |
T | computeDeterminant (const SquareMatrix< 2, T > &x) |
Return the determinant of the matrix. | |
template<typename T> | |
T | computeTrace (const SquareMatrix< 2, T > &x) |
Return the trace of the matrix. | |
template<typename T> | |
SquareMatrix< 2, T > | computeTranspose (const SquareMatrix< 2, T > &x) |
Return the transpose of the matrix. | |
template<typename T> | |
SquareMatrix< 2, T > | computeInverse (const SquareMatrix< 2, T > &x) |
Return the inverse of the matrix. | |
template<typename T> | |
SquareMatrix< 2, T > | computeInverse (const SquareMatrix< 2, T > &x, const T det) |
Return the inverse of the matrix given the matrix and its determinant. | |
template<typename T> | |
void | computeInverse (const SquareMatrix< 2, T > &x, SquareMatrix< 2, T > *y) |
Compute the inverse of the matrix. | |
template<typename T> | |
void | computeInverse (const SquareMatrix< 2, T > &x, const T det, SquareMatrix< 2, T > *y) |
Compute the inverse of the matrix given its determinant. | |
template<typename T> | |
void | computeScaledInverse (const SquareMatrix< 2, T > &x, SquareMatrix< 2, T > *si) |
Calculate the scaled inverse of the matrix: determinant * inverse. | |
template<typename T> | |
SquareMatrix< 2, T > | computeScaledInverse (const SquareMatrix< 2, T > &x) |
Return the scaled inverse of the matrix: determinant * inverse. | |
template<typename T> | |
T | computeFrobeniusNorm (const SquareMatrix< 2, T > &x) |
Return the frobenius norm of the matrix. | |
template<typename T> | |
T | computeFrobeniusNormSquared (const SquareMatrix< 2, T > &x) |
Return the frobenius norm of the matrix. | |
template<typename T> | |
T | computeInnerProduct (const SquareMatrix< 2, T > &x, const SquareMatrix< 2, T > &y) |
Return the inner product of the matrices. computeTrace(transpose(x) * y). | |
template<typename T> | |
void | computeProduct (const SquareMatrix< 2, T > &m, const FixedArray< 2, T > &v, FixedArray< 2, T > *x) |
Compute the matrix-vector product. x = m * v . | |
template<typename T1, typename T2> | |
bool | operator== (const SquareMatrix< 2, T1 > &a, const SquareMatrix< 2, T2 > &b) |
Return true if the matrices are equal. | |
template<typename T1, typename T2> | |
bool | operator!= (const SquareMatrix< 2, T1 > &a, const SquareMatrix< 2, T2 > &b) |
Return true if the tensors are not equal. | |
template<typename T> | |
std::ostream & | operator<< (std::ostream &out, const SquareMatrix< 2, T > &x) |
Write a matrix as rows with space-separated numbers. | |
template<typename T> | |
std::istream & | operator>> (std::istream &in, SquareMatrix< 2, T > &x) |
Read white space-separated numbers into a matrix. | |
template<typename T> | |
SquareMatrix< 3, T > | operator+ (const SquareMatrix< 3, T > &m, const T x) |
SquareMatrix-scalar addition. | |
template<typename T> | |
SquareMatrix< 3, T > | operator+ (const T x, const SquareMatrix< 3, T > &m) |
Scalar-SquareMatrix addition. | |
template<typename T> | |
SquareMatrix< 3, T > | operator+ (const SquareMatrix< 3, T > &x, const SquareMatrix< 3, T > &y) |
SquareMatrix-SquareMatrix addition. | |
template<typename T> | |
SquareMatrix< 3, T > | operator- (const SquareMatrix< 3, T > &m, const T x) |
SquareMatrix-scalar subtraction. | |
template<typename T> | |
SquareMatrix< 3, T > | operator- (const T x, const SquareMatrix< 3, T > &m) |
Scalar-SquareMatrix subtraction. | |
template<typename T> | |
SquareMatrix< 3, T > | operator- (const SquareMatrix< 3, T > &x, const SquareMatrix< 3, T > &y) |
SquareMatrix-SquareMatrix subtraction. | |
template<typename T> | |
SquareMatrix< 3, T > | operator * (const SquareMatrix< 3, T > &m, const T x) |
SquareMatrix-scalar product. | |
template<typename T> | |
SquareMatrix< 3, T > | operator * (const T x, const SquareMatrix< 3, T > &m) |
Scalar-SquareMatrix product. | |
template<typename T> | |
SquareMatrix< 3, T > | operator * (const SquareMatrix< 3, T > &x, const SquareMatrix< 3, T > &y) |
SquareMatrix-SquareMatrix product. | |
template<typename T> | |
SquareMatrix< 3, T > | operator/ (const SquareMatrix< 3, T > &m, const T x) |
SquareMatrix-scalar division. | |
template<typename T> | |
SquareMatrix< 3, T > | operator/ (const T x, const SquareMatrix< 3, T > &m) |
Scalar-SquareMatrix division. | |
template<typename T> | |
T | computeSum (const SquareMatrix< 3, T > &x) |
Return the sum of the elements. | |
template<typename T> | |
T | computeProduct (const SquareMatrix< 3, T > &x) |
Return the product of the elements. | |
template<typename T> | |
T | computeMinimum (const SquareMatrix< 3, T > &x) |
Return the minimum element. Use < for comparison. | |
template<typename T> | |
T | computeMaximum (const SquareMatrix< 3, T > &x) |
Return the maximum element. Use > for comparison. | |
template<typename T> | |
T | computeDeterminant (const SquareMatrix< 3, T > &x) |
Return the determinant of the matrix. | |
template<typename T> | |
T | computeTrace (const SquareMatrix< 3, T > &x) |
Return the trace of the matrix. | |
template<typename T> | |
SquareMatrix< 3, T > | computeTranspose (const SquareMatrix< 3, T > &x) |
Return the transpose of the matrix. | |
template<typename T> | |
SquareMatrix< 3, T > | computeInverse (const SquareMatrix< 3, T > &x) |
Return the inverse of the matrix. | |
template<typename T> | |
SquareMatrix< 3, T > | computeInverse (const SquareMatrix< 3, T > &x, const T det) |
Return the inverse of the matrix given the matrix and its determinant. | |
template<typename T> | |
void | computeInverse (const SquareMatrix< 3, T > &x, SquareMatrix< 3, T > *y) |
Compute the inverse of the matrix. | |
template<typename T> | |
void | computeInverse (const SquareMatrix< 3, T > &x, const T det, SquareMatrix< 3, T > *y) |
Compute the inverse of the matrix given its determinant. | |
template<typename T> | |
void | computeScaledInverse (const SquareMatrix< 3, T > &x, SquareMatrix< 3, T > *si) |
Calculate the scaled inverse of the matrix: determinant * inverse. | |
template<typename T> | |
SquareMatrix< 3, T > | computeScaledInverse (const SquareMatrix< 3, T > &x) |
Return the scaled inverse of the matrix: determinant * inverse. | |
template<typename T> | |
T | computeFrobeniusNorm (const SquareMatrix< 3, T > &x) |
Return the frobenius norm of the matrix. | |
template<typename T> | |
T | computeFrobeniusNormSquared (const SquareMatrix< 3, T > &x) |
Return the frobenius norm of the matrix. | |
template<typename T> | |
T | computeInnerProduct (const SquareMatrix< 3, T > &x, const SquareMatrix< 3, T > &y) |
Return the inner product of the matrices. computeTrace(transpose(x) * y). | |
template<typename T> | |
void | computeProduct (const SquareMatrix< 3, T > &m, const FixedArray< 3, T > &v, FixedArray< 3, T > *x) |
Compute the matrix-vector product. x = m * v . | |
template<typename T1, typename T2> | |
bool | operator== (const SquareMatrix< 3, T1 > &a, const SquareMatrix< 3, T2 > &b) |
Return true if the matrices are equal. | |
template<typename T1, typename T2> | |
bool | operator!= (const SquareMatrix< 3, T1 > &a, const SquareMatrix< 3, T2 > &b) |
Return true if the tensors are not equal. | |
template<typename T> | |
std::ostream & | operator<< (std::ostream &out, const SquareMatrix< 3, T > &x) |
Write a matrix as rows with space-separated numbers. | |
template<typename T> | |
std::istream & | operator>> (std::istream &in, SquareMatrix< 3, T > &x) |
Read white space-separated numbers into a matrix. | |
template<typename StringOutputIterator> | |
int | split (const std::string &string, const std::string &separator, StringOutputIterator output) |
Split the string. Return the number of words. | |
void | makeZeroPaddedExtension (const int n, int maximumNumber, std::string *ext) |
Make a zero-padded numerical extension. Useful for constructing file names. |
OrderedPair<T> ads::makeOrderedPair | ( | const T & | x, | |
const T & | y | |||
) | [inline] |
A convenience wrapper for creating a OrderedPair.
x | The first object. | |
y | The second object. |
Triplet<T1,T2,T3> ads::makeTriplet | ( | const T1 & | x, | |
const T2 & | y, | |||
const T3 & | z | |||
) | [inline] |
A convenience wrapper for creating a Triplet from three objects.
x | The first object. | |
y | The second object. | |
z | The third object. |