aGrUM  0.13.2
gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ > Struct Template Reference

Class to handle efficiently argMaxSet. More...

#include <agrum/multidim/patterns/argMaxSet.h>

+ Collaboration diagram for gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >:

Public Member Functions

Idx size () const
 Gives the size. More...
 
const GUM_SCALAR_VAL & value () const
 Returns the value on which comparison are made. More...
 
bool exists (const GUM_SCALAR_SEQ &elem) const
 
CNL
 ArgMaxSet ()
 Constructor. More...
 
 ArgMaxSet (const GUM_SCALAR_VAL &val, const GUM_SCALAR_SEQ &elem)
 Constructor. More...
 
 ArgMaxSet (const ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ > &src)
 Copy Constructor. More...
 
ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ > & operator= (const ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ > &src)
 Constructor. More...
 
 ~ArgMaxSet ()
 Destructor. More...
 
void * operator new (size_t s)
 Allocators and Deallocators redefinition. More...
 
void operator delete (void *p)
 Constructor. More...
 
Iterators
SequenceIteratorSafe< GUM_SCALAR_SEQ > beginSafe () const
 Iterator beginning. More...
 
SequenceIteratorSafe< GUM_SCALAR_SEQ > endSafe () const
 Iterator end. More...
 
Operators
ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ > & operator+= (const GUM_SCALAR_SEQ &elem)
 Ajout d'un élément. More...
 
ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ > & operator+= (const ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ > &src)
 Use to insert the content of another set inside this one. More...
 
const GUM_SCALAR_SEQ & operator[] (const Idx i) const
 Gives the ith element. More...
 
bool operator== (const ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ > &compared) const
 Compares two ArgMaxSet to check if they are equals. More...
 
bool operator!= (const ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ > &compared) const
 Ajout d'un élément. More...
 
bool operator< (const ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ > &compared) const
 Checks if val is lower or higher from the compared ArgMaxSet val. More...
 
bool operator> (const ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ > &compared) const
 Ajout d'un élément. More...
 
bool operator<= (const ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ > &compared) const
 Ajout d'un élément. More...
 
bool operator>= (const ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ > &compared) const
 Ajout d'un élément. More...
 

Friends

std::ostream & operator<< (std::ostream &streamy, const ArgMaxSet &objy)
 

Detailed Description

template<typename GUM_SCALAR_VAL, typename GUM_SCALAR_SEQ>
struct gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >

Class to handle efficiently argMaxSet.

A class containing the set of object assoicated to a maximum

This set contains the ids of the obj.

Definition at line 55 of file argMaxSet.h.

Constructor & Destructor Documentation

template<typename GUM_SCALAR_VAL , typename GUM_SCALAR_SEQ >
gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::ArgMaxSet ( )

Constructor.

Definition at line 39 of file argMaxSet_tpl.h.

39  {
40  GUM_CONSTRUCTOR(ArgMaxSet);
42  }
Sequence< GUM_SCALAR_SEQ > * __argMaxSeq
The very bone of the ArgMaxSet.
Definition: argMaxSet.h:191
ArgMaxSet()
Constructor.
Definition: argMaxSet_tpl.h:39
template<typename GUM_SCALAR_VAL , typename GUM_SCALAR_SEQ >
gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::ArgMaxSet ( const GUM_SCALAR_VAL &  val,
const GUM_SCALAR_SEQ &  elem 
)

Constructor.

Definition at line 48 of file argMaxSet_tpl.h.

References gum::SequenceImplementation< Key, Alloc, Gen >::insert().

49  {
50  GUM_CONSTRUCTOR(ArgMaxSet);
52  __argMaxSeq->insert(elem);
53  __val = val;
54  }
Sequence< GUM_SCALAR_SEQ > * __argMaxSeq
The very bone of the ArgMaxSet.
Definition: argMaxSet.h:191
GUM_SCALAR_VAL __val
Definition: argMaxSet.h:192
ArgMaxSet()
Constructor.
Definition: argMaxSet_tpl.h:39
void insert(const Key &k)
Insert an element at the end of the sequence.
Definition: sequence_tpl.h:405

+ Here is the call graph for this function:

template<typename GUM_SCALAR_VAL , typename GUM_SCALAR_SEQ >
gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::ArgMaxSet ( const ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ > &  src)

Copy Constructor.

Definition at line 60 of file argMaxSet_tpl.h.

References gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::operator=(), and gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::value().

61  {
62  GUM_CONS_CPY(ArgMaxSet);
64  this->operator+=(src);
65  __val = src.value();
66  }
Sequence< GUM_SCALAR_SEQ > * __argMaxSeq
The very bone of the ArgMaxSet.
Definition: argMaxSet.h:191
ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ > & operator+=(const GUM_SCALAR_SEQ &elem)
Ajout d&#39;un élément.
Definition: argMaxSet_tpl.h:97
GUM_SCALAR_VAL __val
Definition: argMaxSet.h:192
ArgMaxSet()
Constructor.
Definition: argMaxSet_tpl.h:39

+ Here is the call graph for this function:

template<typename GUM_SCALAR_VAL , typename GUM_SCALAR_SEQ >
gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::~ArgMaxSet ( )

Destructor.

Definition at line 82 of file argMaxSet_tpl.h.

References gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::operator+=().

82  {
83  GUM_DESTRUCTOR(ArgMaxSet)
84  delete __argMaxSeq;
85  }
Sequence< GUM_SCALAR_SEQ > * __argMaxSeq
The very bone of the ArgMaxSet.
Definition: argMaxSet.h:191
ArgMaxSet()
Constructor.
Definition: argMaxSet_tpl.h:39

+ Here is the call graph for this function:

Member Function Documentation

template<typename GUM_SCALAR_VAL, typename GUM_SCALAR_SEQ>
SequenceIteratorSafe< GUM_SCALAR_SEQ > gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::beginSafe ( ) const
inline

Iterator beginning.

Definition at line 106 of file argMaxSet.h.

References gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::__argMaxSeq, and gum::SequenceImplementation< Key, Alloc, Gen >::beginSafe().

Referenced by gum::StructuredPlaner< GUM_SCALAR >::__transferActionIds(), gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::operator+=(), and gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::operator==().

106  {
107  return __argMaxSeq->beginSafe();
108  }
iterator_safe beginSafe() const
Returns a safe begin iterator.
Definition: sequence_tpl.h:623
Sequence< GUM_SCALAR_SEQ > * __argMaxSeq
The very bone of the ArgMaxSet.
Definition: argMaxSet.h:191

+ Here is the call graph for this function:

+ Here is the caller graph for this function:

template<typename GUM_SCALAR_VAL, typename GUM_SCALAR_SEQ>
SequenceIteratorSafe< GUM_SCALAR_SEQ > gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::endSafe ( ) const
inline

Iterator end.

Definition at line 113 of file argMaxSet.h.

References gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::__argMaxSeq, gum::SequenceImplementation< Key, Alloc, Gen >::endSafe(), and gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::operator+=().

Referenced by gum::StructuredPlaner< GUM_SCALAR >::__transferActionIds(), gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::operator+=(), and gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::operator==().

113  {
114  return __argMaxSeq->endSafe();
115  }
const iterator_safe & endSafe() const noexcept
Returns the safe end iterator.
Definition: sequence_tpl.h:630
Sequence< GUM_SCALAR_SEQ > * __argMaxSeq
The very bone of the ArgMaxSet.
Definition: argMaxSet.h:191

+ Here is the call graph for this function:

+ Here is the caller graph for this function:

template<typename GUM_SCALAR_VAL, typename GUM_SCALAR_SEQ>
bool gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::exists ( const GUM_SCALAR_SEQ &  elem) const
inline

Definition at line 185 of file argMaxSet.h.

References gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::__argMaxSeq, and gum::SequenceImplementation< Key, Alloc, Gen >::exists().

Referenced by gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::operator==().

185  {
186  return __argMaxSeq->exists(elem);
187  }
Sequence< GUM_SCALAR_SEQ > * __argMaxSeq
The very bone of the ArgMaxSet.
Definition: argMaxSet.h:191
bool exists(const Key &k) const
Check the existence of k in the sequence.
Definition: sequence_tpl.h:399

+ Here is the call graph for this function:

+ Here is the caller graph for this function:

template<typename GUM_SCALAR_VAL, typename GUM_SCALAR_SEQ>
void gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::operator delete ( void *  p)
inline

Constructor.

Definition at line 91 of file argMaxSet.h.

References gum::SmallObjectAllocator::deallocate(), and gum::SmallObjectAllocator::instance().

91  {
93  p, sizeof(ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >));
94  }
void deallocate(void *pDeallocatedObject, const size_t &objectSize)
Deallocates an object.
static SmallObjectAllocator & instance()

+ Here is the call graph for this function:

template<typename GUM_SCALAR_VAL, typename GUM_SCALAR_SEQ>
void* gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::operator new ( size_t  s)
inline

Allocators and Deallocators redefinition.

Definition at line 88 of file argMaxSet.h.

References gum::SmallObjectAllocator::allocate(), and gum::SmallObjectAllocator::instance().

88  {
90  }
void * allocate(const size_t &objectSize)
Allocates a block.
static SmallObjectAllocator & instance()

+ Here is the call graph for this function:

template<typename GUM_SCALAR_VAL, typename GUM_SCALAR_SEQ>
bool gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::operator!= ( const ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ > &  compared) const
inline

Ajout d'un élément.

Definition at line 148 of file argMaxSet.h.

149  {
150  return !(*this == compared);
151  }
template<typename GUM_SCALAR_VAL , typename GUM_SCALAR_SEQ >
ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ > & gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::operator+= ( const GUM_SCALAR_SEQ &  elem)

Ajout d'un élément.

Definition at line 97 of file argMaxSet_tpl.h.

Referenced by gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::endSafe(), and gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::~ArgMaxSet().

97  {
98  __argMaxSeq->insert(elem);
99  return *this;
100  }
Sequence< GUM_SCALAR_SEQ > * __argMaxSeq
The very bone of the ArgMaxSet.
Definition: argMaxSet.h:191
void insert(const Key &k)
Insert an element at the end of the sequence.
Definition: sequence_tpl.h:405

+ Here is the caller graph for this function:

template<typename GUM_SCALAR_VAL , typename GUM_SCALAR_SEQ >
ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ > & gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::operator+= ( const ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ > &  src)

Use to insert the content of another set inside this one.

Definition at line 108 of file argMaxSet_tpl.h.

References gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::beginSafe(), gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::endSafe(), and gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::operator==().

108  {
109  for (auto iter = src.beginSafe(); iter != src.endSafe(); ++iter)
110  if (!__argMaxSeq->exists(*iter)) __argMaxSeq->insert(*iter);
111  return *this;
112  }
Sequence< GUM_SCALAR_SEQ > * __argMaxSeq
The very bone of the ArgMaxSet.
Definition: argMaxSet.h:191
bool exists(const Key &k) const
Check the existence of k in the sequence.
Definition: sequence_tpl.h:399
void insert(const Key &k)
Insert an element at the end of the sequence.
Definition: sequence_tpl.h:405

+ Here is the call graph for this function:

template<typename GUM_SCALAR_VAL, typename GUM_SCALAR_SEQ>
bool gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::operator< ( const ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ > &  compared) const
inline

Checks if val is lower or higher from the compared ArgMaxSet val.

Definition at line 156 of file argMaxSet.h.

References gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::__val, and gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::value().

157  {
158  return __val < compared.value() ? true : false;
159  }
GUM_SCALAR_VAL __val
Definition: argMaxSet.h:192

+ Here is the call graph for this function:

template<typename GUM_SCALAR_VAL, typename GUM_SCALAR_SEQ>
bool gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::operator<= ( const ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ > &  compared) const
inline

Ajout d'un élément.

Definition at line 164 of file argMaxSet.h.

165  {
166  return !(*this > compared);
167  }
template<typename GUM_SCALAR_VAL , typename GUM_SCALAR_SEQ >
ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ > & gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::operator= ( const ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ > &  src)

Constructor.

Definition at line 71 of file argMaxSet_tpl.h.

References gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::value().

Referenced by gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::ArgMaxSet().

71  {
72  this->__argMaxSeq->clear();
73  this->operator+=(src);
74  __val = src.value();
75  return *this;
76  }
void clear()
Clear the sequence.
Definition: sequence_tpl.h:268
Sequence< GUM_SCALAR_SEQ > * __argMaxSeq
The very bone of the ArgMaxSet.
Definition: argMaxSet.h:191
ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ > & operator+=(const GUM_SCALAR_SEQ &elem)
Ajout d&#39;un élément.
Definition: argMaxSet_tpl.h:97
GUM_SCALAR_VAL __val
Definition: argMaxSet.h:192

+ Here is the call graph for this function:

+ Here is the caller graph for this function:

template<typename GUM_SCALAR_VAL , typename GUM_SCALAR_SEQ >
bool gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::operator== ( const ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ > &  compared) const

Compares two ArgMaxSet to check if they are equals.

Definition at line 119 of file argMaxSet_tpl.h.

References gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::beginSafe(), gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::endSafe(), gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::exists(), and gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::value().

Referenced by gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::operator+=(), and gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::operator[]().

119  {
120  if (__val != compared.value()) return false;
121  for (auto iter = compared.beginSafe(); iter != compared.endSafe(); ++iter)
122  if (!__argMaxSeq->exists(*iter)) return false;
123  for (auto iter = this->beginSafe(); iter != this->endSafe(); ++iter)
124  if (!compared.exists(*iter)) return false;
125  return true;
126  }
SequenceIteratorSafe< GUM_SCALAR_SEQ > beginSafe() const
Iterator beginning.
Definition: argMaxSet.h:106
Sequence< GUM_SCALAR_SEQ > * __argMaxSeq
The very bone of the ArgMaxSet.
Definition: argMaxSet.h:191
bool exists(const Key &k) const
Check the existence of k in the sequence.
Definition: sequence_tpl.h:399
GUM_SCALAR_VAL __val
Definition: argMaxSet.h:192
SequenceIteratorSafe< GUM_SCALAR_SEQ > endSafe() const
Iterator end.
Definition: argMaxSet.h:113

+ Here is the call graph for this function:

+ Here is the caller graph for this function:

template<typename GUM_SCALAR_VAL, typename GUM_SCALAR_SEQ>
bool gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::operator> ( const ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ > &  compared) const
inline

Ajout d'un élément.

Definition at line 160 of file argMaxSet.h.

161  {
162  return compared < *this;
163  }
template<typename GUM_SCALAR_VAL, typename GUM_SCALAR_SEQ>
bool gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::operator>= ( const ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ > &  compared) const
inline

Ajout d'un élément.

Definition at line 168 of file argMaxSet.h.

169  {
170  return !(*this < compared);
171  }
template<typename GUM_SCALAR_VAL, typename GUM_SCALAR_SEQ>
const GUM_SCALAR_SEQ& gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::operator[] ( const Idx  i) const
inline

Gives the ith element.

Definition at line 139 of file argMaxSet.h.

References gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::__argMaxSeq, gum::SequenceImplementation< Key, Alloc, Gen >::atPos(), and gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::operator==().

139  {
140  return __argMaxSeq->atPos(i);
141  }
const Key & atPos(Idx i) const
Returns the object at the pos i.
Definition: sequence_tpl.h:497
Sequence< GUM_SCALAR_SEQ > * __argMaxSeq
The very bone of the ArgMaxSet.
Definition: argMaxSet.h:191

+ Here is the call graph for this function:

template<typename GUM_SCALAR_VAL, typename GUM_SCALAR_SEQ>
Idx gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::size ( ) const
inline

Gives the size.

Definition at line 178 of file argMaxSet.h.

References gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::__argMaxSeq, and gum::SequenceImplementation< Key, Alloc, Gen >::size().

178 { return __argMaxSeq->size(); }
Size size() const noexcept
Returns the size of the sequence.
Definition: sequence_tpl.h:35
Sequence< GUM_SCALAR_SEQ > * __argMaxSeq
The very bone of the ArgMaxSet.
Definition: argMaxSet.h:191

+ Here is the call graph for this function:

template<typename GUM_SCALAR_VAL, typename GUM_SCALAR_SEQ>
const GUM_SCALAR_VAL& gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::value ( ) const
inline

Returns the value on which comparison are made.

Definition at line 183 of file argMaxSet.h.

References gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::__val.

Referenced by gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::ArgMaxSet(), gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::operator<(), gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::operator=(), and gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::operator==().

183 { return __val; }
GUM_SCALAR_VAL __val
Definition: argMaxSet.h:192

+ Here is the caller graph for this function:

Friends And Related Function Documentation

template<typename GUM_SCALAR_VAL, typename GUM_SCALAR_SEQ>
std::ostream& operator<< ( std::ostream &  streamy,
const ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ > &  objy 
)
friend

Definition at line 195 of file argMaxSet.h.

195  {
196  streamy << "Value : " << objy.value()
197  << " - Set : " << objy.__argMaxSeq->toString();
198  return streamy;
199  }

Member Data Documentation

template<typename GUM_SCALAR_VAL, typename GUM_SCALAR_SEQ>
GUM_SCALAR_VAL gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::__val
private

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