#include <rtt/SingleList.hpp>
Harris. It will never work on 8bit computers as implemented here but 16, 32, 64,... computers are fine. You may not insert the same item more than once.
Definition at line 65 of file SingleList.hpp.
This is a safer version of apply() with respect to concurrent erasure/insertion.
First a copy of the data is made, then the node is checked if it is still present, if so the function is applied on the copied data, thus the data is for sure not corrupted.
Definition at line 340 of file SingleList.hpp.
Applies a function to all elements.
For example:
SingleList<CallBackInterface*> sl; // insert elements... // call the 'callback' function on each element: sl.apply( boost::bind(&CallBackInterface::callback, _1) );
Definition at line 309 of file SingleList.hpp.
Erase a node.
Definition at line 258 of file SingleList.hpp.
References RTT::OS::CAS(), and RTT::MemoryPool< T >::deallocate().
Check if a node is present.
Definition at line 283 of file SingleList.hpp.
Insert a new node.
Definition at line 235 of file SingleList.hpp.
References RTT::MemoryPool< T >::allocate(), RTT::OS::CAS(), and RTT::MemoryPool< T >::deallocate().