28 std::vector<std::set<linkEdge>> lazyAdd_;
42 lazyAdd_[a].emplace(std::make_pair(e0, e1));
46 const auto p = std::make_pair(e0, e1);
47 auto it = lazyAdd_[a].find(p);
48 if(it != lazyAdd_[a].
end()) {
49 lazyAdd_[a].erase(it);
56 if(lazyAdd_[a].empty()) {
60 lazyAdd_[a].erase(lazyAdd_[a].
begin());
66 return lazyAdd_[a].empty();
idVertex nbElmt_
Allocation may depends on the number of vertices.
TTK DynamicGraph laziness.
bool isEmpty(const idSuperArc a)
linkEdge addGetNext(const idSuperArc a)
void delEmplace(const idEdge e0, const idEdge e1, const idSuperArc a)
void addEmplace(const idEdge e0, const idEdge e1, const idSuperArc a)
long unsigned int idSuperArc
SuperArc index in vect_superArcs_.
SimplexId idEdge
Edge index in vect_edgeList_.
std::pair< idEdge, idEdge > linkEdge
T end(std::pair< T, T > &p)
T begin(std::pair< T, T > &p)