57 INLINE
void* LeafPair::operator
new(
size_t s) {
61 INLINE
void LeafPair::operator
delete(
void* p) {
70 return _l1_->contains(testedId) ||
_l2_->contains(testedId);
<agrum/FMDP/learning/datastructure/leaves/abstractLeaf.h>
<agrum/FMDP/learning/datastructure/leaves/composedLeaf.h>
AbstractLeaf * secondLeaf()
LeafPair(AbstractLeaf *l1, AbstractLeaf *l2)
Default constructor.
AbstractLeaf * firstLeaf()
bool contains(NodeId testedId)
Returns true if pair has leaf in it.
AbstractLeaf * otherLeaf(AbstractLeaf *l) const
~LeafPair()
Default destructor.
AbstractLeaf * convert2Leaf(NodeId leafId) const
Returns a leaf matching data and having given id as id.
static SmallObjectAllocator & instance()
void * allocate(const size_t &objectSize)
Allocates a block.
void deallocate(void *pDeallocatedObject, const size_t &objectSize)
Deallocates an object.
Size NodeId
Type for node ids.
Headers of the leaf pair class.
gum is the global namespace for all aGrUM entities