Lines Matching defs:NodeSet
53 typedef std::set<GepNode*> NodeSet;
281 in_set(const NodeSet &S) : NS(S) {}
286 const NodeSet &NS;
427 void nodes_for_root(GepNode *Root, NodeChildrenMap &NCM, NodeSet &Nodes) {
447 typedef std::set<NodeSet> NodeSymRel;
451 const NodeSet *node_class(GepNode *N, NodeSymRel &Rel) {
517 typedef std::map<unsigned,NodeSet> NodeSetMap;
532 NodeSet &S = I->second;
533 for (NodeSet::iterator NI = S.begin(), NE = S.end(); NI != NE; ++NI) {
542 NodeSet C;
543 for (NodeSet::iterator NJ = std::next(NI); NJ != NE; ++NJ)
565 const NodeSet &S = *I;
566 for (NodeSet::const_iterator J = S.begin(), F = S.end(); J != F; ++J) {
576 // Create a projection from a NodeSet to the minimal element in it.
577 typedef std::map<const NodeSet*,GepNode*> ProjMap;
580 const NodeSet &S = *I;
589 for (NodeSet::iterator J = S.begin(), F = S.end(); J != F; ++J) {
614 const NodeSet *PC = node_class(N->Parent, EqRel);
628 NodeSet Erase;
631 const NodeSet *PC = node_class(N, EqRel);
998 NodeSet Ns;
1005 for (NodeSet::iterator I = Ns.begin(), E = Ns.end(); I != E; ++I) {
