Typedefs
using	EdgeToPathMap = std::map< SimpleEdge, std::vector< unsigned int > >

using	SimpleEdge = std::pair< unsigned int, unsigned int >

Functions
void	throwIfImproperDependencies (EdgeToPathMap const &, std::vector< std::vector< unsigned int >> const &iPathIndexToModuleIndexOrder, std::vector< std::string > const &iPathNames, std::unordered_map< unsigned int, std::string > const &iModuleIndexToNames)

Variables
constexpr auto	kDataDependencyIndex = std::numeric_limits<unsigned int>::max()

constexpr auto	kInvalidIndex = std::numeric_limits<unsigned int>::max()

Typedef Documentation

◆ EdgeToPathMap

using edm::graph::EdgeToPathMap = typedef std::map<SimpleEdge, std::vector<unsigned int> >

Definition at line 40 of file throwIfImproperDependencies.h.

◆ SimpleEdge

using edm::graph::SimpleEdge = typedef std::pair<unsigned int, unsigned int>

Definition at line 39 of file throwIfImproperDependencies.h.

Function Documentation

◆ throwIfImproperDependencies()

void edm::graph::throwIfImproperDependencies	(	EdgeToPathMap const &	iEdgeToPathMap,
		std::vector< std::vector< unsigned int >> const &	iPathIndexToModuleIndexOrder,
		std::vector< std::string > const &	iPathNames,
		std::unordered_map< unsigned int, std::string > const &	iModuleIndexToNames
	)

Definition at line 502 of file throwIfImproperDependencies.cc.

                                                                                                                    {
   //Now use boost graph library to find cycles in the dependencies
   std::vector<SimpleEdge> outList;
   outList.reserve(iEdgeToPathMap.size());
   for (auto const& edgeInfo : iEdgeToPathMap) {
     outList.push_back(edgeInfo.first);
   }
  
   Graph g(outList.begin(), outList.end(), iModuleIndexToNames.size());
  
   cycle_detector detector(iEdgeToPathMap, iPathIndexToModuleIndexOrder, iPathNames, iModuleIndexToNames);
   boost::depth_first_search(g, boost::visitor(detector));
 }