diff options
Diffstat (limited to 'src/armnnUtils/GraphTopologicalSort.hpp')
| -rw-r--r-- | src/armnnUtils/GraphTopologicalSort.hpp | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/src/armnnUtils/GraphTopologicalSort.hpp b/src/armnnUtils/GraphTopologicalSort.hpp index 81a37ac4e5..11314590a0 100644 --- a/src/armnnUtils/GraphTopologicalSort.hpp +++ b/src/armnnUtils/GraphTopologicalSort.hpp @@ -4,8 +4,8 @@ // #pragma once +#include <armnn/Optional.hpp> #include <boost/assert.hpp> -#include <boost/optional.hpp> #include <functional> #include <map> @@ -27,7 +27,7 @@ enum class NodeState template <typename TNodeId> -boost::optional<TNodeId> GetNextChild(TNodeId node, +armnn::Optional<TNodeId> GetNextChild(TNodeId node, std::function<std::vector<TNodeId>(TNodeId)> getIncomingEdges, std::map<TNodeId, NodeState>& nodeStates) { @@ -70,11 +70,11 @@ bool TopologicallySort( nodeStates[current] = NodeState::Visiting; - boost::optional<TNodeId> nextChildOfCurrent = GetNextChild(current, getIncomingEdges, nodeStates); + auto nextChildOfCurrent = GetNextChild(current, getIncomingEdges, nodeStates); if (nextChildOfCurrent) { - TNodeId nextChild = nextChildOfCurrent.get(); + TNodeId nextChild = nextChildOfCurrent.value(); // If the child has not been searched, add to the stack and iterate over this node if (nodeStates.find(nextChild) == nodeStates.end()) |