75 class Vec {  class
77   Vec() { Init(); }  in Vec()  function in absl::synchronization_internal::__anonf7c977ba0111::Vec
78   ~Vec() { Discard(); }  in ~Vec()
113   void MoveFrom(Vec<T>* src) {  in MoveFrom()
156   Vec(const Vec&) = delete;
157   Vec& operator=(const Vec&) = delete;
210   Vec<int32_t> table_;
244     Vec<int32_t> copy;  in Grow()
294   explicit PointerMap(const Vec<Node*>* nodes) : nodes_(nodes) {  in PointerMap()
335   const Vec<Node*>* nodes_;
346   Vec<Node*> nodes_;
347   Vec<int32_t> free_nodes_;  // Indices for unused entries in nodes_
351   Vec<int32_t> deltaf_;  // Results of forward DFS
352   Vec<int32_t> deltab_;  // Results of backward DFS
353   Vec<int32_t> list_;    // All nodes to reprocess
354   Vec<int32_t> merged_;  // Rank values to assign to list_ entries
355   Vec<int32_t> stack_;   // Emulates recursion stack for depth-first searches
489 static void Sort(const Vec<Node*>&, Vec<int32_t>* delta);
491     GraphCycles::Rep* r, Vec<int32_t>* src, Vec<int32_t>* dst);
603 static void Sort(const Vec<Node*>& nodes, Vec<int32_t>* delta) {  in Sort()
605     const Vec<Node*>* nodes;  in Sort()
616     GraphCycles::Rep* r, Vec<int32_t>* src, Vec<int32_t>* dst) {  in MoveToList()