366   rep_ = new (base_internal::LowLevelAlloc::AllocWithArena(sizeof(Rep), arena))  in GraphCycles()
371   for (auto* node : rep_->nodes_) {  in ~GraphCycles()
375   rep_->Rep::~Rep();  in ~GraphCycles()
376   base_internal::LowLevelAlloc::Free(rep_);  in ~GraphCycles()
380   Rep* r = rep_;  in CheckInvariants()
406   int32_t i = rep_->ptrmap_.Find(ptr);  in GetId()
408     return MakeId(i, rep_->nodes_[i]->version);  in GetId()
409   } else if (rep_->free_nodes_.empty()) {  in GetId()
415     n->rank = rep_->nodes_.size();  in GetId()
419     rep_->nodes_.push_back(n);  in GetId()
420     rep_->ptrmap_.Add(ptr, n->rank);  in GetId()
425     int32_t r = rep_->free_nodes_.back();  in GetId()
426     rep_->free_nodes_.pop_back();  in GetId()
427     Node* n = rep_->nodes_[r];  in GetId()
431     rep_->ptrmap_.Add(ptr, r);  in GetId()
437   int32_t i = rep_->ptrmap_.Remove(ptr);  in RemoveNode()
441   Node* x = rep_->nodes_[i];  in RemoveNode()
443     rep_->nodes_[y]->in.erase(i);  in RemoveNode()
446     rep_->nodes_[y]->out.erase(i);  in RemoveNode()
455     rep_->free_nodes_.push_back(i);  in RemoveNode()
460   Node* n = FindNode(rep_, id);  in Ptr()
466   return FindNode(rep_, node) != nullptr;  in HasNode()
470   Node* xn = FindNode(rep_, x);  in HasEdge()
471   return xn && FindNode(rep_, y) && xn->out.contains(NodeIndex(y));  in HasEdge()
475   Node* xn = FindNode(rep_, x);  in RemoveEdge()
476   Node* yn = FindNode(rep_, y);  in RemoveEdge()
493   Rep* r = rep_;  in InsertEdge()
626   Rep* r = rep_;  in FindPath()
649       path[path_len] = MakeId(n, rep_->nodes_[n]->version);  in FindPath()
674   Node* n = FindNode(rep_, id);  in UpdateStackTrace()
683   Node* n = FindNode(rep_, id);  in GetStackTrace()