14 BASSERT_EQ(to_collect_.size(), 0,
"to_collect size is not 0");
15 to_collect_.swap(alive_);
38 auto it = to_collect_.begin();
39 while (
it != to_collect_.end()) {
43 it = to_collect_.begin();
57 for (
auto it = to_collect_.begin();
it != to_collect_.end();) {
58 if (
it->HasDestructor()) {
62 allocator_->
Dispose(
const_cast<void*
>(
it->Pointer()));
63 it = to_collect_.erase(
it);
static constexpr const int kFrontMetadataSize
virtual void Dispose(void *definitely_uintptr)=0
static bool IsPinnedBasePointer(const void *pointer)
void IterateStackAndVisitRoots()
virtual void Visit(const void *pointer)
#define BASSERT_EQ(lhs, rhs, m,...)
std::queue< T, broom::deque< T > > queue