aGrUM  0.15.0
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 57 of file argMaxSet.h.

Constructor & Destructor Documentation

◆ ArgMaxSet() [1/3]

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

Constructor.

Definition at line 42 of file argMaxSet_tpl.h.

42  {
43  GUM_CONSTRUCTOR(ArgMaxSet);
45  }
Sequence< GUM_SCALAR_SEQ > * __argMaxSeq
The very bone of the ArgMaxSet.
Definition: argMaxSet.h:193
ArgMaxSet()
Constructor.
Definition: argMaxSet_tpl.h:42

◆ ArgMaxSet() [2/3]

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 51 of file argMaxSet_tpl.h.

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

52  {
53  GUM_CONSTRUCTOR(ArgMaxSet);
55  __argMaxSeq->insert(elem);
56  __val = val;
57  }
Sequence< GUM_SCALAR_SEQ > * __argMaxSeq
The very bone of the ArgMaxSet.
Definition: argMaxSet.h:193
GUM_SCALAR_VAL __val
Definition: argMaxSet.h:194
ArgMaxSet()
Constructor.
Definition: argMaxSet_tpl.h:42
void insert(const Key &k)
Insert an element at the end of the sequence.
Definition: sequence_tpl.h:408
+ Here is the call graph for this function:

◆ ArgMaxSet() [3/3]

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 63 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().

64  {
65  GUM_CONS_CPY(ArgMaxSet);
67  this->operator+=(src);
68  __val = src.value();
69  }
Sequence< GUM_SCALAR_SEQ > * __argMaxSeq
The very bone of the ArgMaxSet.
Definition: argMaxSet.h:193
ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ > & operator+=(const GUM_SCALAR_SEQ &elem)
Ajout d&#39;un élément.
GUM_SCALAR_VAL __val
Definition: argMaxSet.h:194
ArgMaxSet()
Constructor.
Definition: argMaxSet_tpl.h:42
+ Here is the call graph for this function:

◆ ~ArgMaxSet()

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

Destructor.

Definition at line 85 of file argMaxSet_tpl.h.

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

85  {
86  GUM_DESTRUCTOR(ArgMaxSet);
87  delete __argMaxSeq;
88  }
Sequence< GUM_SCALAR_SEQ > * __argMaxSeq
The very bone of the ArgMaxSet.
Definition: argMaxSet.h:193
ArgMaxSet()
Constructor.
Definition: argMaxSet_tpl.h:42
+ Here is the call graph for this function:

Member Function Documentation

◆ beginSafe()

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 108 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< double >::__transferActionIds(), gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::operator+=(), and gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::operator==().

108  {
109  return __argMaxSeq->beginSafe();
110  }
iterator_safe beginSafe() const
Returns a safe begin iterator.
Definition: sequence_tpl.h:627
Sequence< GUM_SCALAR_SEQ > * __argMaxSeq
The very bone of the ArgMaxSet.
Definition: argMaxSet.h:193
+ Here is the call graph for this function:
+ Here is the caller graph for this function:

◆ endSafe()

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 115 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< double >::__transferActionIds(), gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::operator+=(), and gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::operator==().

115  {
116  return __argMaxSeq->endSafe();
117  }
const iterator_safe & endSafe() const noexcept
Returns the safe end iterator.
Definition: sequence_tpl.h:634
Sequence< GUM_SCALAR_SEQ > * __argMaxSeq
The very bone of the ArgMaxSet.
Definition: argMaxSet.h:193
+ Here is the call graph for this function:
+ Here is the caller graph for this function:

◆ exists()

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 187 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==().

187  {
188  return __argMaxSeq->exists(elem);
189  }
bool exists(const Key &k) const
Check the existence of k in the sequence.
Definition: sequence_tpl.h:402
Sequence< GUM_SCALAR_SEQ > * __argMaxSeq
The very bone of the ArgMaxSet.
Definition: argMaxSet.h:193
+ Here is the call graph for this function:
+ Here is the caller graph for this function:

◆ operator delete()

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 93 of file argMaxSet.h.

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

93  {
95  p, sizeof(ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >));
96  }
void deallocate(void *pDeallocatedObject, const size_t &objectSize)
Deallocates an object.
static SmallObjectAllocator & instance()
+ Here is the call graph for this function:

◆ operator new()

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 90 of file argMaxSet.h.

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

90  {
92  }
void * allocate(const size_t &objectSize)
Allocates a block.
static SmallObjectAllocator & instance()
+ Here is the call graph for this function:

◆ operator!=()

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 150 of file argMaxSet.h.

151  {
152  return !(*this == compared);
153  }

◆ operator+=() [1/2]

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 100 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().

100  {
101  __argMaxSeq->insert(elem);
102  return *this;
103  }
Sequence< GUM_SCALAR_SEQ > * __argMaxSeq
The very bone of the ArgMaxSet.
Definition: argMaxSet.h:193
void insert(const Key &k)
Insert an element at the end of the sequence.
Definition: sequence_tpl.h:408
+ Here is the caller graph for this function:

◆ operator+=() [2/2]

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 111 of file argMaxSet_tpl.h.

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

111  {
112  for (auto iter = src.beginSafe(); iter != src.endSafe(); ++iter)
113  if (!__argMaxSeq->exists(*iter)) __argMaxSeq->insert(*iter);
114  return *this;
115  }
bool exists(const Key &k) const
Check the existence of k in the sequence.
Definition: sequence_tpl.h:402
Sequence< GUM_SCALAR_SEQ > * __argMaxSeq
The very bone of the ArgMaxSet.
Definition: argMaxSet.h:193
void insert(const Key &k)
Insert an element at the end of the sequence.
Definition: sequence_tpl.h:408
+ Here is the call graph for this function:

◆ operator<()

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 158 of file argMaxSet.h.

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

159  {
160  return __val < compared.value() ? true : false;
161  }
GUM_SCALAR_VAL __val
Definition: argMaxSet.h:194
+ Here is the call graph for this function:

◆ operator<=()

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 166 of file argMaxSet.h.

167  {
168  return !(*this > compared);
169  }

◆ operator=()

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 74 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().

74  {
75  this->__argMaxSeq->clear();
76  this->operator+=(src);
77  __val = src.value();
78  return *this;
79  }
void clear()
Clear the sequence.
Definition: sequence_tpl.h:271
Sequence< GUM_SCALAR_SEQ > * __argMaxSeq
The very bone of the ArgMaxSet.
Definition: argMaxSet.h:193
ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ > & operator+=(const GUM_SCALAR_SEQ &elem)
Ajout d&#39;un élément.
GUM_SCALAR_VAL __val
Definition: argMaxSet.h:194
+ Here is the call graph for this function:
+ Here is the caller graph for this function:

◆ operator==()

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 121 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[]().

122  {
123  if (__val != compared.value()) return false;
124  for (auto iter = compared.beginSafe(); iter != compared.endSafe(); ++iter)
125  if (!__argMaxSeq->exists(*iter)) return false;
126  for (auto iter = this->beginSafe(); iter != this->endSafe(); ++iter)
127  if (!compared.exists(*iter)) return false;
128  return true;
129  }
SequenceIteratorSafe< GUM_SCALAR_SEQ > endSafe() const
Iterator end.
Definition: argMaxSet.h:115
bool exists(const Key &k) const
Check the existence of k in the sequence.
Definition: sequence_tpl.h:402
Sequence< GUM_SCALAR_SEQ > * __argMaxSeq
The very bone of the ArgMaxSet.
Definition: argMaxSet.h:193
SequenceIteratorSafe< GUM_SCALAR_SEQ > beginSafe() const
Iterator beginning.
Definition: argMaxSet.h:108
GUM_SCALAR_VAL __val
Definition: argMaxSet.h:194
+ Here is the call graph for this function:
+ Here is the caller graph for this function:

◆ operator>()

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 162 of file argMaxSet.h.

163  {
164  return compared < *this;
165  }

◆ operator>=()

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 170 of file argMaxSet.h.

171  {
172  return !(*this < compared);
173  }

◆ operator[]()

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 141 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==().

141  {
142  return __argMaxSeq->atPos(i);
143  }
Sequence< GUM_SCALAR_SEQ > * __argMaxSeq
The very bone of the ArgMaxSet.
Definition: argMaxSet.h:193
const Key & atPos(Idx i) const
Returns the object at the pos i.
Definition: sequence_tpl.h:500
+ Here is the call graph for this function:

◆ size()

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 180 of file argMaxSet.h.

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

180 { return __argMaxSeq->size(); }
Size size() const noexcept
Returns the size of the sequence.
Definition: sequence_tpl.h:38
Sequence< GUM_SCALAR_SEQ > * __argMaxSeq
The very bone of the ArgMaxSet.
Definition: argMaxSet.h:193
+ Here is the call graph for this function:

◆ value()

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 185 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==().

185 { return __val; }
GUM_SCALAR_VAL __val
Definition: argMaxSet.h:194
+ Here is the caller graph for this function:

Friends And Related Function Documentation

◆ operator<<

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 197 of file argMaxSet.h.

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

Member Data Documentation

◆ __argMaxSeq

◆ __val

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: