28 #ifndef GUM_CONCRETE_LEAF_H 29 #define GUM_CONCRETE_LEAF_H 54 template < TESTNAME AttributeSelection,
bool isScalar >
83 void*
operator new(
size_t s) {
86 void operator delete(
void* p) {
104 return (
double)
__n1->effectif(moda);
118 std::stringstream ss;
119 ss <<
"{ Id : " << this->
id() <<
"}";
132 #endif // GUM_CONCRETE_LEAF_H Template trick for efficient development.
Priority queues in which the same element can appear several times.
Headers of the abstract Leaf class.
double __effectif(Idx moda, Int2Type< false >) const
Header file of gum::Sequence, a class for storing (ordered) sequences of objects. ...
The generic class for storing (ordered) sequences of objects.
<agrum/FMDP/learning/datastructure/leaves/abstractLeaf.h>
const Sequence< ValueType > * __valueDomain
gum is the global namespace for all aGrUM entities
ValueSelect< isScalar, double, Idx >::type ValueType
<agrum/FMDP/learning/datastructure/leaves/concreteLeaf.h>
~ConcreteLeaf()
Default destructor.
double __effectif(Idx moda, Int2Type< true >) const
ConcreteLeaf(NodeId leafId, NodeDatabase< AttributeSelection, isScalar > *n1, const Sequence< ValueType > *valueDomain)
Default constructor.
Headers of the NodeDatabase class.
virtual double total() const
Idx __nbModa(Int2Type< false >) const
Idx __nbModa(Int2Type< true >) const
void deallocate(void *pDeallocatedObject, const size_t &objectSize)
Deallocates an object.
virtual double effectif(Idx moda) const
Gaves the leaf effectif for given modality.
NodeDatabase< AttributeSelection, isScalar > * __n1
Size Idx
Type for indexes.
void * allocate(const size_t &objectSize)
Allocates a block.
static SmallObjectAllocator & instance()
Class hash tables iterators.
Size NodeId
Type for node ids.
some utils for topology : NodeId, Edge, Arc and consorts ...
<agrum/FMDP/learning/datastructure/nodeDatabase.h>