template <class T>
class vector;

MultiThread_Containers.h

Multi-Thread safe vector container, can be used instead of std::vector.

T& operator [](size_t pos);

const T& operator [](size_t pos) const;

vector& operator =(const vector & rOther);

template <class Iter> void append(const Iter & startRange, const Iter & endRange);

T& back();

const T& back() const;

size_t capacity() const;

void clear();

bool empty() const;

std::vector interface

template <typename FindFunction,typename KeyType> bool find_and_copy(FindFunction findFunc, const KeyType & key, T & foundValue) const;

void free_memory();

const T& front() const;

CryCriticalSection& get_lock() const;

void pop_back();

void push_back(const T& x);

void reserve(int sz);

void resize(int sz);

int size() const;

template <class Func> void sort(const Func & compare_less);

void swap(std::vector & vec);

bool try_pop_back(T& returnValue);

bool try_pop_front(T& returnValue);

bool try_remove(const T& value);

bool try_remove_at(size_t idx);

bool try_remove_unordered(const T& value);

Fast remove - just move last elem over deleted element - order is not preserved

vector();

vector(const vector & rOther);

typedef CryAutoCriticalSection AutoLock;

typedef T value_type;