traverse.h

Go to the documentation of this file.

// ========================================================================= //
// This file is part of MyraMath, copyright (c) 2014-2019 by Ryan A Chilton  //
// and distributed by MyraCore, LLC. See LICENSE.txt for license terms.      //
// ========================================================================= //

#ifndef MYRAMATH_JOBGRAPH_TRAVERSE_H
#define MYRAMATH_JOBGRAPH_TRAVERSE_H

// Required components of return value.
#include <myramath/jobgraph/JobID.h>
#include <vector>
#include <map>

namespace myra {

// Forward declarations.
class Job;
class JobGraph;

// Note that Jobs are returned in a topologically sorted order, so a sequential forward for 
// loop will visit all the Jobs in an order that satisfies all parent/child relationships.
std::vector<Job*> traverse_ordered(const JobGraph& graph);

// Note that Jobs are returned in basically random order. 
// Caller needs to sequence them using parent/child dependencies. 
std::vector<Job*> traverse_unordered(const JobGraph& graph);

std::map<JobID,int> key2j(const std::vector<Job*> jobs);

class JobMap
{
  public:
    JobMap();
    JobMap(const std::vector<Job*> jobs);
    int at(JobID id) const;
    int size() const;
  private:
    typedef std::pair<JobID,int> Pair;
    typedef std::vector<Pair> Pairs;
    Pairs pairs;
};

std::vector<JobID> key2j3(std::vector<Job*> jobs);

} // namespace

#endif