mirror of
https://git.rwth-aachen.de/acs/public/villas/node/
synced 2025-03-30 00:00:11 +01:00
105f47d2d0
This is a workaround until we have a better heuristic (maybe shortest path?) to choose between multiple paths in the graph. Since the (abstract) graph has no idea about memory translations, getPath() may even yield paths that are no valid translation because a pair of inbound/outbound edges must not neccessarily share a common address window, but from the perspective of the abstract graph present a valid path. The callback function is used by the MemoryManager to verify if a path candidate represents a valid translation.
24 lines
342 B
C++
24 lines
342 B
C++
#pragma once
|
|
|
|
#include <string>
|
|
#include <vector>
|
|
#include <list>
|
|
|
|
namespace villas {
|
|
namespace utils {
|
|
|
|
std::vector<std::string>
|
|
tokenize(std::string s, std::string delimiter);
|
|
|
|
|
|
template<typename T>
|
|
void
|
|
assertExcept(bool condition, const T& exception)
|
|
{
|
|
if(not condition)
|
|
throw exception;
|
|
}
|
|
|
|
} // namespace utils
|
|
} // namespace villas
|
|
|