SubCircuit::SolverWorker::DiCache Struct Reference

Public Member Functions
void	add (const Graph &graph, adjMatrix_t &adjMatrix, const std::string &graphId, Solver *userSolver)
bool	compare (int needleEdge, int haystackEdge, const std::map< std::string, std::set< std::set< std::string >>> &swapPorts, const std::map< std::string, std::set< std::map< std::string, std::string >>> &swapPermutations)
bool	compare (int needleEdge, int haystackEdge, const std::map< std::string, std::string > &mapFromPorts, const std::map< std::string, std::set< std::set< std::string >>> &swapPorts, const std::map< std::string, std::set< std::map< std::string, std::string >>> &swapPermutations) const
bool	compare (int needleEdge, int haystackEdge, const std::map< std::string, std::string > &mapFromPorts, const std::map< std::string, std::string > &mapToPorts) const
void	printEdgeTypes () const

Data Fields
std::map< DiEdge, int >	edgeTypesMap
std::vector< DiEdge >	edgeTypes
std::map< std::pair< int, int > , bool >	compareCache

Detailed Description

Definition at line 656 of file subcircuit.cc.

Member Function Documentation

void SubCircuit::SolverWorker::DiCache::add ( const Graph &  graph, adjMatrix_t &  adjMatrix, const std::string &  graphId, Solver *  userSolver  )

inline

Definition at line 662 of file subcircuit.cc.

        {
            std::map<std::pair<int, int>, DiEdge> edges;
            DiEdge::findEdgesInGraph(graph, edges);

            adjMatrix.clear();
            adjMatrix.resize(graph.nodes.size());

            for (auto &it : edges) {
                const Graph::Node &fromNode = graph.nodes[it.first.first];
                const Graph::Node &toNode = graph.nodes[it.first.second];
                it.second.userAnnotation = userSolver->userAnnotateEdge(graphId, fromNode.nodeId, fromNode.userData, toNode.nodeId, toNode.userData);
            }

            for (const auto &it : edges) {
                if (edgeTypesMap.count(it.second) == 0) {
                    edgeTypesMap[it.second] = edgeTypes.size();
                    edgeTypes.push_back(it.second);
                }
                adjMatrix[it.first.first][it.first.second] = edgeTypesMap[it.second];
            }
        }

Here is the call graph for this function:

Here is the caller graph for this function:

bool SubCircuit::SolverWorker::DiCache::compare ( int  needleEdge, int  haystackEdge, const std::map< std::string, std::set< std::set< std::string >>> &  swapPorts, const std::map< std::string, std::set< std::map< std::string, std::string >>> &  swapPermutations  )

inline

Definition at line 685 of file subcircuit.cc.

        {
            std::pair<int, int> key(needleEdge, haystackEdge);
            if (!compareCache.count(key))
                compareCache[key] = edgeTypes.at(needleEdge).compare(edgeTypes.at(haystackEdge), swapPorts, swapPermutations);
            return compareCache[key];
        }

Here is the caller graph for this function:

bool SubCircuit::SolverWorker::DiCache::compare ( int  needleEdge, int  haystackEdge, const std::map< std::string, std::string > &  mapFromPorts, const std::map< std::string, std::set< std::set< std::string >>> &  swapPorts, const std::map< std::string, std::set< std::map< std::string, std::string >>> &  swapPermutations  ) const

inline

Definition at line 694 of file subcircuit.cc.

        {
            return edgeTypes.at(needleEdge).compare(edgeTypes.at(haystackEdge), mapFromPorts, swapPorts, swapPermutations);
        }

bool SubCircuit::SolverWorker::DiCache::compare ( int  needleEdge, int  haystackEdge, const std::map< std::string, std::string > &  mapFromPorts, const std::map< std::string, std::string > &  mapToPorts  ) const

inline

Definition at line 700 of file subcircuit.cc.

        {
            return edgeTypes.at(needleEdge).compare(edgeTypes.at(haystackEdge), mapFromPorts, mapToPorts);
        }

void SubCircuit::SolverWorker::DiCache::printEdgeTypes ( ) const

inline

Definition at line 705 of file subcircuit.cc.

        {
            for (int i = 0; i < int(edgeTypes.size()); i++)
                my_printf("%5d: %s\n", i, edgeTypes[i].toString().c_str());
        }

Here is the caller graph for this function:

Field Documentation

std::map<std::pair<int, int>, bool> SubCircuit::SolverWorker::DiCache::compareCache

Definition at line 660 of file subcircuit.cc.

std::vector<DiEdge> SubCircuit::SolverWorker::DiCache::edgeTypes

Definition at line 659 of file subcircuit.cc.

std::map<DiEdge, int> SubCircuit::SolverWorker::DiCache::edgeTypesMap

Definition at line 658 of file subcircuit.cc.

---

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

• subcircuit.cc