28 #ifndef GUM_ABSTRACT_LEAF_H 29 #define GUM_ABSTRACT_LEAF_H 72 void*
operator new(
size_t s) {
75 void operator delete(
void* p) {
85 virtual double total()
const = 0;
106 #endif // GUM_ABSTRACT_LEAF_H virtual bool contains(NodeId testedId) const
Returns true if abstractleaf has leaf in it.
Priority queues in which the same element can appear several times.
virtual double effectif(Idx) const =0
Gaves the leaf effectif for given modality.
Headers of gum::SmallObjectAllocator.
Header file of gum::Sequence, a class for storing (ordered) sequences of objects. ...
<agrum/FMDP/learning/datastructure/leaves/abstractLeaf.h>
gum is the global namespace for all aGrUM entities
virtual std::string toString()=0
virtual Idx nbModa() const =0
void deallocate(void *pDeallocatedObject, const size_t &objectSize)
Deallocates an object.
Size Idx
Type for indexes.
void * allocate(const size_t &objectSize)
Allocates a block.
static SmallObjectAllocator & instance()
virtual double total() const =0
Class hash tables iterators.
virtual ~AbstractLeaf()
Default destructor.
Size NodeId
Type for node ids.
AbstractLeaf(NodeId leafId)
Default constructor.
some utils for topology : NodeId, Edge, Arc and consorts ...