DependencyResolverInterface Class Reference

Interface for sorting dependent vectors of objects. More...

#include <DependencyResolverInterface.h>

Inheritance diagram for DependencyResolverInterface:

Public Member Functions
	DependencyResolverInterface ()
	Constructor. More...
virtual const std::set< std::string > &	getRequestedItems ()=0
	Return a set containing the names of items requested by the object. More...
virtual const std::set< std::string > &	getSuppliedItems ()=0
	Return a set containing the names of items owned by the object. More...

Static Public Member Functions
template<typename T >
static void	sort (typename std::vector< T > &vector)
	Given a vector, sort using the getRequested/SuppliedItems sets. More...
template<typename T >
static void	sortDFS (typename std::vector< T > &vector)
	Given a vector, sort using the depth-first search. More...
template<typename T , typename T2 >
static void	cyclicDependencyError (CyclicDependencyException< T2 > &e, const std::string &header)
	A helper method for cyclic errors. More...

Detailed Description

Interface for sorting dependent vectors of objects.

Definition at line 25 of file DependencyResolverInterface.h.

Constructor & Destructor Documentation

DependencyResolverInterface()

DependencyResolverInterface::DependencyResolverInterface ( )

inline

Constructor.

Definition at line 31 of file DependencyResolverInterface.h.

{}

Member Function Documentation

cyclicDependencyError()

template<typename T , typename T2 >

void DependencyResolverInterface::cyclicDependencyError ( CyclicDependencyException< T2 > &  e, const std::string &  header  )

static

A helper method for cyclic errors.

Definition at line 119 of file DependencyResolverInterface.h.

{
  std::ostringstream oss;

  oss << header << ":\n";
  const auto cycle = e.getCyclicDependencies();
  std::vector<std::string> names(cycle.size());
  for (const auto i : index_range(cycle))
    names[i] = static_cast<T>(cycle[i])->name();
  oss << MooseUtils::join(names, " <- ");
  mooseError(oss.str());
}

getRequestedItems()

virtual const std::set<std::string>& DependencyResolverInterface::getRequestedItems ( )

pure virtual

Return a set containing the names of items requested by the object.

Implemented in UserObject, MaterialBase, AuxKernelTempl< ComputeValueType >, AuxKernelTempl< RT >, AuxKernelTempl< RealVectorValue >, AuxKernelTempl< Real >, InitialConditionBase, Marker, ScalarInitialCondition, FVInitialConditionBase, and AuxScalarKernel.

getSuppliedItems()

virtual const std::set<std::string>& DependencyResolverInterface::getSuppliedItems ( )

pure virtual

Return a set containing the names of items owned by the object.

Implemented in MaterialBase, UserObject, AuxKernelTempl< ComputeValueType >, AuxKernelTempl< RT >, AuxKernelTempl< RealVectorValue >, AuxKernelTempl< Real >, InitialConditionBase, Marker, ScalarInitialCondition, FVInitialConditionBase, and AuxScalarKernel.

sort()

template<typename T >

void DependencyResolverInterface::sort ( typename std::vector< T > &  vector )

static

Given a vector, sort using the getRequested/SuppliedItems sets.

Definition at line 64 of file DependencyResolverInterface.h.

Referenced by TheWarehouse::prepare().

{
  sortDFS(vector);
}

sortDFS()

template<typename T >

void DependencyResolverInterface::sortDFS ( typename std::vector< T > &  vector )

static

Given a vector, sort using the depth-first search.

Class that represents the dependency as a graph

Definition at line 71 of file DependencyResolverInterface.h.

Referenced by sort().

{
  if (vector.size() <= 1)
    return;

  DependencyResolver<T> graph;

  // Map of suppliers: what is supplied -> by what object
  std::multimap<std::string, T> suppliers_map;
  for (auto & v : vector)
  {
    // Whether or not this object supplies something, we will always
    // add it as a node because we want to make sure that it gets returned
    graph.addNode(v);

    for (const auto & supplied_item : v->getSuppliedItems())
      suppliers_map.emplace(supplied_item, v);
  }

  // build the dependency graph
  for (auto & v : vector)
    for (const auto & requested_item : v->getRequestedItems())
    {
      const auto & [begin_it, end_it] = suppliers_map.equal_range(requested_item);
      for (const auto & [supplier_name, supplier_object] : as_range(begin_it, end_it))
      {
        libmesh_ignore(supplier_name);

        // We allow an object to have a circular dependency within itself; e.g. we choose to
        // trust a developer knows what they are doing within a single object
        if (supplier_object != v)
          graph.addEdge(supplier_object, v);
      }
    }

  const auto & sorted = graph.dfs();

  // The set here gets unique objects, as it's valid to pass in duplicates
  mooseAssert(sorted.size() == std::set<T>(vector.begin(), vector.end()).size(), "Size mismatch");

  vector = sorted;
}

---

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

• include/interfaces/DependencyResolverInterface.h