Lines Matching refs:objects_
53 if (objects_.empty()) return pc;
72 if (pc < objects_[0].min_location_) {
73 int32_t padding = objects_[0].min_location_ - pc;
82 for (objects_iter iter = objects_.begin(); iter != objects_.end();) {
207 if (objects_.empty()) {
243 const PoolObject<T>& last = objects_.back();
255 // Check (conservatively) if we can fit it into the objects_ array, without
261 // Will temp be the last object in objects_?
268 for (int i = static_cast<int>(objects_.size()) - 1; i >= 0; --i) {
269 const PoolObject<T>& current = objects_[i];
304 if (objects_.empty()) {
311 std::sort(objects_.begin(), objects_.end(), PoolObjectLessThan);
319 int last_object_index = static_cast<int>(objects_.size()) - 1;
323 PoolObject<T>& current = objects_[i];
337 // pass of the objects_ vector, increasing the checkpoint as needed, while
382 if (objects_.size() != 1) {
384 ptrdiff_t distance = std::distance(objects_.data(), object);
385 objects_.erase(objects_.begin() + distance);
397 for (objects_iter iter = objects_objects_.end(); ++iter) {
400 objects_.insert(iter, new_object);
406 objects_.push_back(new_object);
412 for (objects_iter iter = objects_.begin(); iter != objects_.end(); ++iter) {
437 return objects_.erase(iter);
493 for (objects_iter iter = objects_.begin(); iter != objects_.end(); ++iter) {
514 for (const_objects_iter iter = objects_.begin(); iter != objects_.end();
