'''<u>concurrent_queue</u>''' : This is the concurrent version of the STL container Queue. This container supports first-in-first-out data storage like its STL counterpart. Multiple threads may simultaneously push and pop elements from thequeue. This is defined within the header "'''tbb/concurrent_queue.h'''" and is coded as: <pre>#include <tbb/concurrent_queue.h>queue//.... //tbb:concurrent_queue<typename> name; </pre>

'''<u>concurrent_vector</u>''' : This is a container class for vectors with concurrent (parallel) support. These vectors do not support insertion or erase operations but supports concurrent support operationsdone by multiple threads. Note that when elements are inserted, they cannot be removed without calling the clear() member function on it, which removes every element in the array. This is defined within the header "'''tbb/concurrent_vector.h'''" and is coded as: <pre>

tbb:concurrent_vector<typetypename> name; </pre>