|
|
|
|
|
|
|
|
|
|
|
#pragma once |
|
|
#include <QMutex> |
|
|
#include <list> |
|
|
using std::list; |
|
|
|
|
|
template< typename T > |
|
|
class concurrent_list |
|
|
{ |
|
|
QMutex mutex{}; |
|
|
std::list< T > list; |
|
|
|
|
|
public: |
|
|
|
|
|
void push_back( const T & v ) |
|
|
{ |
|
|
QMutexLocker locker( &mutex ); |
|
|
list.push_back( v ); |
|
|
} |
|
|
|
|
|
void remove( const T & v ) |
|
|
{ |
|
|
QMutexLocker locker( &mutex ); |
|
|
list.remove( v ); |
|
|
} |
|
|
|
|
|
void clear() |
|
|
{ |
|
|
QMutexLocker locker( &mutex ); |
|
|
list.clear(); |
|
|
} |
|
|
|
|
|
bool empty() |
|
|
{ |
|
|
QMutexLocker locker( &mutex ); |
|
|
return list.empty(); |
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
std::list< T > snapshot() |
|
|
{ |
|
|
QMutexLocker locker( &mutex ); |
|
|
return list; |
|
|
} |
|
|
}; |
|
|
|