deleteRequireds count arg

Signed-off-by: James Cherry <[email protected]>

include/sta/ArrayTable.hh

@@ -34,6 +34,7 @@ public:
   void make(uint32_t count,
 	    TYPE *&array,
 	    ObjectId &id);
+  void deleteArray(uint32_t count);
   // Grow as necessary and return pointer for id.
   TYPE *ensureId(ObjectId id);
   TYPE *pointer(ObjectId id) const;
@@ -144,6 +145,12 @@ ArrayTable<TYPE>::pushBlock(ArrayBlock<TYPE> *block)
   }
 }
 
+template <class TYPE>
+void
+ArrayTable<TYPE>::deleteArray(uint32_t)
+{
+}
+
 template <class TYPE>
 TYPE *
 ArrayTable<TYPE>::pointer(ObjectId id) const

include/sta/Graph.hh

@@ -101,9 +101,13 @@ public:
   Arrival *makeArrivals(Vertex *vertex,
 			uint32_t count);
   Arrival *arrivals(Vertex *vertex);
+  void deleteArrivals(Vertex *vertex,
+                      uint32_t count);
   Required *makeRequireds(Vertex *vertex,
                           uint32_t count);
   Required *requireds(Vertex *vertex);
+  void deleteRequireds(Vertex *vertex,
+                       uint32_t count);
   void clearArrivals();
   size_t arrivalCount() const { return arrivals_.size(); }
   PathVertexRep *makePrevPaths(Vertex *vertex,
@@ -284,7 +288,6 @@ public:
   ArrivalId arrivals() { return arrivals_; }
   ArrivalId requireds() { return requireds_; }
   bool hasRequireds() const { return requireds_ != arrival_null; }
-  void deleteRequireds();
   PrevPathId prevPaths() const { return prev_paths_; }
   void setPrevPaths(PrevPathId id);
   TagGroupIndex tagGroupIndex() const;

include/sta/PathVertex.hh

@@ -84,8 +84,6 @@ public:
 		// Return values.
 		PathVertex &prev_path,
 		TimingArc *&prev_arc) const;
-  static void deleteRequireds(Vertex *vertex,
-			      const StaState *sta);
   static bool equal(const PathVertex *path1,
 		    const PathVertex *path2);