Lines Matching +full:ts +full:- +full:node
2 * Copyright (c) 2018-2020 Arm Limited.
4 * SPDX-License-Identifier: MIT
51 * Represents a multiple source - multiple sink directed graph
71 /** Adds a node to the graph
73 * @note Models a single output node
75 * @tparam NT Node operation
76 * @tparam Ts Arguments to operation
78 * @param[in] args Node arguments
80 * @return ID of the node
82 template <typename NT, typename... Ts>
83 NodeID add_node(Ts &&... args);
84 /** Remove the node with the given ID
86 * @param[in] nid ID of the node to remove
93 * @param[in] source ID of the source node
94 * @param[in] source_idx Output index of the source node
95 * @param[in] sink ID of the sink node
96 * @param[in] sink_idx Input index of the sink node
122 * @return vector containing the graph node of given type
160 /** Get node object given its id
162 * @warning Can be nullptr if node was removed during the mutation steps of the graph
164 * @param[in] id Node ID
166 * @return The actual node object
168 const INode *node(NodeID id) const;
169 /** Get node object given its id
171 * @warning Can be nullptr if node was removed during the mutation steps of the graph
173 * @param[in] id Node ID
175 * @return The actual node object
177 INode *node(NodeID id);
180 * @warning Can be nullptr if node was removed during the mutation steps of the graph
189 * @warning Can be nullptr if node was removed during the mutation steps of the graph
230 …std::map<NodeType, std::vector<NodeID>> _tagged_nodes = {}; /**< Graph nodes map with the node typ…
234 template <typename NT, typename... Ts>
235 inline NodeID Graph::add_node(Ts &&... args) in add_node()
239 // Create node in add_node()
241 auto node = std::make_unique<NT>(std::forward<Ts>(args)...); in add_node() local
242 node->set_graph(this); in add_node()
243 node->set_id(nid); in add_node()
246 _tagged_nodes[node->type()].push_back(nid); in add_node()
249 for(auto &output : node->_outputs) in add_node()
254 // Propagate node shape if possible in add_node()
255 node->forward_descriptors(); in add_node()
257 // Add node to the graph nodes in add_node()
258 _nodes.push_back(std::move(node)); in add_node()