Lines Matching full:nodeset
53 typedef std::set<GepNode*> NodeSet;
282 in_set(const NodeSet &S) : NS(S) {}
287 const NodeSet &NS;
428 void nodes_for_root(GepNode *Root, NodeChildrenMap &NCM, NodeSet &Nodes) {
448 typedef std::set<NodeSet> NodeSymRel;
452 const NodeSet *node_class(GepNode *N, NodeSymRel &Rel) {
518 typedef std::map<unsigned,NodeSet> NodeSetMap;
533 NodeSet &S = I->second;
534 for (NodeSet::iterator NI = S.begin(), NE = S.end(); NI != NE; ++NI) {
543 NodeSet C;
544 for (NodeSet::iterator NJ = std::next(NI); NJ != NE; ++NJ)
566 const NodeSet &S = *I;
567 for (NodeSet::const_iterator J = S.begin(), F = S.end(); J != F; ++J) {
577 // Create a projection from a NodeSet to the minimal element in it.
578 typedef std::map<const NodeSet*,GepNode*> ProjMap;
581 const NodeSet &S = *I;
590 for (NodeSet::iterator J = S.begin(), F = S.end(); J != F; ++J) {
615 const NodeSet *PC = node_class(N->Parent, EqRel);
629 NodeSet Erase;
632 const NodeSet *PC = node_class(N, EqRel);
999 NodeSet Ns;
1006 for (NodeSet::iterator I = Ns.begin(), E = Ns.end(); I != E; ++I) {
