85 		v->adjEntries.~GraphObjectContainer<AdjElement>();  in ~Graph()
144 		eC->m_adjSrc = new AdjElement(eC,m_edgeIdCount<<1);  in copy()
145 		(eC->m_adjTgt = new AdjElement(eC,(m_edgeIdCount<<1)|1))  in copy()
153 		internal::GraphList<AdjElement> &adjEdges = vG->adjEntries;  in copy()
154 		for (AdjElement *adjG = adjEdges.head(); adjG; adjG = adjG->succ()) {  in copy()
186 		v->adjEntries.~GraphObjectContainer<AdjElement>();  in constructInitByCC()
219 		adjEntry adjSrc = new AdjElement(eC,  m_edgeIdCount<<1   );  in constructInitByCC()
220 		adjEntry adjTgt = new AdjElement(eC, (m_edgeIdCount<<1)|1);  in constructInitByCC()
261 		v->adjEntries.~GraphObjectContainer<AdjElement>();  in constructInitByNodes()
299 		eC->m_adjSrc = new AdjElement(eC, m_edgeIdCount<<1);  in constructInitByNodes()
300 		(eC->m_adjTgt = new AdjElement(eC, (m_edgeIdCount<<1)|1))  in constructInitByNodes()
349 		v->adjEntries.~GraphObjectContainer<AdjElement>();  in constructInitByActiveNodes()
394 		AdjElement *adjSrc = new AdjElement(v);  in constructInitByActiveNodes()
398 		AdjElement *adjTgt = new AdjElement(w);  in constructInitByActiveNodes()
529 	AdjElement *adjSrc = new AdjElement(v);  in newEdge()
534 	AdjElement *adjTgt = new AdjElement(w);  in newEdge()
575 	AdjElement *adjSrc = new AdjElement(v);  in newEdge()
580 	AdjElement *adjTgt = new AdjElement(w);  in newEdge()
603 	AdjElement *adjTgt = new AdjElement(w);  in newEdge()
604 	AdjElement *adjSrc = new AdjElement(v);  in newEdge()
634 	AdjElement *adjTgt = new AdjElement(w);  in newEdge()
639 	AdjElement *adjSrc = new AdjElement(v);  in newEdge()
662 	AdjElement *adjSrc = new AdjElement(w);  in newEdge()
667 	AdjElement *adjTgt = new AdjElement(v);  in newEdge()
775 	adjEntry adjTgt = new AdjElement(u);  in split()
785 	adjEntry adjSrc = new AdjElement(u);  in split()
887 	internal::GraphList<AdjElement> &adjEdges = v->adjEntries;  in delNode()
888 	AdjElement *adj;  in delNode()
923 		v->adjEntries.~GraphObjectContainer<AdjElement>();  in clear()