251 |
} |
} |
252 |
|
|
253 |
/** |
/** |
254 |
|
* Returns true if no more element can be allocated from the pool. |
255 |
|
*/ |
256 |
|
inline bool pool_is_empty() { |
257 |
|
return pPool->pool_is_empty(); |
258 |
|
} |
259 |
|
|
260 |
|
/** |
261 |
* Allocate one element from the pool and append it to this list. |
* Allocate one element from the pool and append it to this list. |
262 |
* |
* |
263 |
* @returns allocated element |
* @returns allocated element |
440 |
} |
} |
441 |
|
|
442 |
/** |
/** |
443 |
|
* Returns true if no more element can be allocated. |
444 |
|
*/ |
445 |
|
inline bool pool_is_empty() { |
446 |
|
RTEList<T>::Node<T>* nextnode = firstnode.next; |
447 |
|
return (nextnode->next == nextnode); |
448 |
|
} |
449 |
|
|
450 |
|
/** |
451 |
* Allocate one element of the memory pool |
* Allocate one element of the memory pool |
452 |
* if no elements are free return NULL |
* if no elements are free return NULL |
453 |
* we find the first element of the list |
* we find the first element of the list |