41 return data.back().get();
46 data.push_back(std::move(value));
51 data[i] = std::move(value);
56 data.resize(new_size);
88 for (
size_t i = 0; i <
size; i++) {
89 if (
data[i].get() == value) {
103 for (
size_t i = 0; i <
size; i++) {
104 if (
data[i].get() == value) {
115 size_t new_size =
data.size();
117 for (
size_t i = 0; i < new_size; i++) {
118 T *value =
data[i].get();
119 if (values.find(value) != values.end()) {
126 data.resize(new_size);
132 while (!
data.empty() && !
data.back()) {
204 template<
typename UniqueVectorU,
typename U>
struct EnumerateT {
229 return Iterator{0,
vec};
233 return Iterator{
vec.size(),
vec};
262 return compare(a.get(),
b.get());
265 std::stable_sort(
data.begin(),
data.end(), compare_unique_ptr);
ConstIterator begin() const
void push_back(unique_ptr< T > &&value)
void erase_by_swap(const size_t index)
vector< unique_ptr< T > > data
void erase(const T *value)
ConstIterator end() const
EnumerateT< const unique_ptr_vector< T >, const T > ConstEnumerate
unique_ptr< T > steal(const size_t i)
T * operator[](const size_t i) const
EnumerateT< unique_ptr_vector< T >, T > Enumerate
ConstEnumerate enumerate() const
void replace(const size_t i, unique_ptr< T > &&value)
void stable_sort(Compare compare)
void erase_in_set(const set< T * > &values)
void erase_by_swap(const T *value)
void resize(const size_t new_size)
#define CCL_NAMESPACE_END
#define assert(assertion)
const It & iter_prop() const
const T * operator*() const
bool operator!=(const Iterator &other) const
std::pair< size_t, U * > operator*() const
unique_ptr_vector< T > & vec
const It & iter_prop() const