SubCircuit::SolverWorker::NodeSet Struct Reference

Public Member Functions
	NodeSet (std::string graphId, int node1, int node2)
	NodeSet (std::string graphId, const std::vector< int > &nodes)
void	extend (const NodeSet &other)
int	extendCandidate (const NodeSet &other) const
bool	operator< (const NodeSet &other) const
std::string	to_string () const

Data Fields
std::string	graphId
std::set< int >	nodes

Detailed Description

Definition at line 1217 of file subcircuit.cc.

Constructor & Destructor Documentation

SubCircuit::SolverWorker::NodeSet::NodeSet ( std::string  graphId, int  node1, int  node2  )

inline

Definition at line 1220 of file subcircuit.cc.

                                                         {
            this->graphId = graphId;
            nodes.insert(node1);
            nodes.insert(node2);
        }

SubCircuit::SolverWorker::NodeSet::NodeSet ( std::string  graphId, const std::vector< int > &  nodes  )

inline

Definition at line 1225 of file subcircuit.cc.

                                                                {
            this->graphId = graphId;
            for (int node : nodes)
                this->nodes.insert(node);
        }

Member Function Documentation

void SubCircuit::SolverWorker::NodeSet::extend ( const NodeSet &  other )

inline

Definition at line 1230 of file subcircuit.cc.

                                          {
            assert(this->graphId == other.graphId);
            for (int node : other.nodes)
                nodes.insert(node);
        }

Here is the caller graph for this function:

int SubCircuit::SolverWorker::NodeSet::extendCandidate ( const NodeSet &  other ) const

inline

Definition at line 1235 of file subcircuit.cc.

                                                        {
            if (graphId != other.graphId)
                return 0;
            int newNodes = 0;
            bool intersect = false;
            for (int node : other.nodes)
                if (nodes.count(node) > 0)
                    intersect = true;
                else
                    newNodes++;
            return intersect ? newNodes : 0;
        }

bool SubCircuit::SolverWorker::NodeSet::operator< ( const NodeSet &  other ) const

inline

Definition at line 1247 of file subcircuit.cc.

                                                    {
            if (graphId != other.graphId)
                return graphId < other.graphId;
            return nodes < other.nodes;
        }

std::string SubCircuit::SolverWorker::NodeSet::to_string ( ) const

inline

Definition at line 1252 of file subcircuit.cc.

                                    {
            std::string str = graphId + "(";
            bool first = true;
            for (int node : nodes) {
                str += my_stringf("%s%d", first ? "" : " ", node);
                first = false;
            }
            return str + ")";
        }

Here is the call graph for this function:

Field Documentation

std::string SubCircuit::SolverWorker::NodeSet::graphId

Definition at line 1218 of file subcircuit.cc.

std::set<int> SubCircuit::SolverWorker::NodeSet::nodes

Definition at line 1219 of file subcircuit.cc.

---

The documentation for this struct was generated from the following file:

• subcircuit.cc