Home
last modified time | relevance | path

Searched refs:node_range (Results 1 – 25 of 54) sorted by relevance

123

/dports/graphics/blender/blender-2.91.0/source/blender/compositor/intern/
H A DCOM_NodeGraph.cpp115 NodeRange node_range(m_nodes.begin() + nodes_start, m_nodes.end()); in add_bNodeTree() local
118 add_bNodeLink(node_range, nodelink); in add_bNodeTree()
156 NodeGraph::NodeInputs NodeGraph::find_inputs(const NodeRange &node_range, bNodeSocket *b_socket) in find_inputs() argument
159 for (NodeGraph::NodeIterator it = node_range.first; it != node_range.second; ++it) { in find_inputs()
171 NodeOutput *NodeGraph::find_output(const NodeRange &node_range, bNodeSocket *b_socket) in find_output() argument
173 for (NodeGraph::NodeIterator it = node_range.first; it != node_range.second; ++it) { in find_output()
185 void NodeGraph::add_bNodeLink(const NodeRange &node_range, bNodeLink *b_nodelink) in add_bNodeLink() argument
199 NodeOutput *output = find_output(node_range, b_nodelink->fromsock); in add_bNodeLink()
204 NodeInputs inputs = find_inputs(node_range, b_nodelink->tosock); in add_bNodeLink()
H A DCOM_NodeGraph.h106 NodeInputs find_inputs(const NodeRange &node_range, bNodeSocket *b_socket);
107 NodeOutput *find_output(const NodeRange &node_range, bNodeSocket *b_socket);
108 void add_bNodeLink(const NodeRange &node_range, bNodeLink *b_nodelink);
/dports/math/jags/JAGS-4.3.0/src/modules/base/monitors/
H A DMeanMonitorFactory.cc35 Range node_range = range; in getMonitor() local
39 node_range = array->range(); in getMonitor()
42 if (node_range.length() > 1) { in getMonitor()
43 for (RangeIterator i(node_range); !i.atEnd(); i.nextLeft()) { in getMonitor()
H A DVarianceMonitorFactory.cc35 Range node_range = range; in getMonitor() local
39 node_range = array->range(); in getMonitor()
42 if (node_range.length() > 1) { in getMonitor()
43 for (RangeIterator i(node_range); !i.atEnd(); i.nextLeft()) { in getMonitor()
H A DTraceMonitorFactory.cc35 Range node_range = range; in getMonitor() local
39 node_range = array->range(); in getMonitor()
42 if (node_range.length() > 1) { in getMonitor()
43 for (RangeIterator i(node_range); !i.atEnd(); i.nextLeft()) { in getMonitor()
/dports/misc/py-mxnet/incubator-mxnet-1.9.0/src/imperative/
H A Dimperative_utils.h669 if (node_range.second > node_range.first) {
670 g.attrs["node_range"] = std::make_shared<dmlc::any>(node_range);
672 if (node_range.second > node_range.first) {
673 g.attrs["node_range"] = std::make_shared<dmlc::any>(node_range);
716 if (node_range.second > node_range.first) {
717 g.attrs["node_range"] = std::make_shared<dmlc::any>(node_range);
719 if (node_range.second > node_range.first) {
720 g.attrs["node_range"] = std::make_shared<dmlc::any>(node_range);
766 if (node_range.second > node_range.first) {
839 const std::pair<uint32_t, uint32_t>& node_range = {0, 0},
[all …]
/dports/misc/mxnet/incubator-mxnet-1.9.0/src/imperative/
H A Dimperative_utils.h669 if (node_range.second > node_range.first) {
670 g.attrs["node_range"] = std::make_shared<dmlc::any>(node_range);
672 if (node_range.second > node_range.first) {
673 g.attrs["node_range"] = std::make_shared<dmlc::any>(node_range);
716 if (node_range.second > node_range.first) {
717 g.attrs["node_range"] = std::make_shared<dmlc::any>(node_range);
719 if (node_range.second > node_range.first) {
720 g.attrs["node_range"] = std::make_shared<dmlc::any>(node_range);
766 if (node_range.second > node_range.first) {
839 const std::pair<uint32_t, uint32_t>& node_range = {0, 0},
[all …]
/dports/biology/hisat2/hisat2-2.2.1/
H A Dgroup_walk.h703 index_t node_range = node_bot - node_top; in init() local
1124 new_node_top = node_range.first; in advance()
1125 new_node_bot = node_range.second; in advance()
1202 … assert_geq(range.second - range.first, node_range.second - node_range.first); in advance()
1212 assert_lt(node_range.first, node_range.second); in advance()
1213 if(node_range.second - node_range.first < st.back().map_.size()) { in advance()
1255 assert_eq(node_range.second - node_range.first, st.back().map_.size()); in advance()
1268 node_range.first, in advance()
1305 pair<index_t, index_t> node_range(0, 0); in advance()
1310 node_top = node_range.first; in advance()
[all …]
/dports/devel/rust-analyzer/rust-analyzer-2021-12-20/crates/ide/src/
H A Dsyntax_tree.rs55 let node_range = node.text_range(); in syntax_tree_for_token() localVariable
61 let start = text_range.start() - node_range.start(); in syntax_tree_for_token()
66 let node_len = node_range.len(); in syntax_tree_for_token()
H A Dfile_structure.rs13 pub node_range: TextRange, field
105 node_range: node.syntax().text_range(), in structure_node()
171 node_range: it.syntax().text_range(), in structure_node()
193 node_range: comment.syntax().text_range(), in structure_token()
/dports/lang/rust/rustc-1.58.1-src/src/tools/rust-analyzer/crates/ide/src/
H A Dsyntax_tree.rs55 let node_range = node.text_range(); in syntax_tree_for_token() localVariable
61 let start = text_range.start() - node_range.start(); in syntax_tree_for_token()
66 let node_len = node_range.len(); in syntax_tree_for_token()
H A Dfile_structure.rs13 pub node_range: TextRange, field
105 node_range: node.syntax().text_range(), in structure_node()
171 node_range: it.syntax().text_range(), in structure_node()
193 node_range: comment.syntax().text_range(), in structure_token()
/dports/devel/caf/actor-framework-0.18.5/tools/
H A Dcaf-vec.cpp289 class node_range : public entity_set_range { class
291 node_range(const entity_set& xs, const node_id& y) { in node_range() function in node_range
298 node_range(const node_range&) = default;
299 node_range& operator=(const node_range&) = default;
312 thread_range(const node_range& xs) : node_(xs.node()) { in thread_range()
344 const entity* get(const node_range& xs, const thread_id& y) { in get()
350 const entity* get(const node_range& xs, actor_id y) { in get()
361 const entity* get(const node_range& xs, const logger_id& y) { in get()
596 node_range local_entities{entities, nid}; in second_pass()
/dports/misc/tvm/incubator-tvm-0.6.1/nnvm/src/pass/
H A Dplan_memory.cc190 const std::pair<uint32_t, uint32_t>& node_range, in AllocMemory() argument
214 for (uint32_t nid = node_range.first; nid < node_range.second; ++nid) { in AllocMemory()
329 std::pair<uint32_t, uint32_t> node_range = {0, idx.num_nodes()}; in PlanMemory() local
331 node_range = ret.MoveCopyAttr<std::pair<uint32_t, uint32_t> >("node_range"); in PlanMemory()
382 AllocMemory(ret, idx, node_range, &storage_vec, &storage_inplace_index, in PlanMemory()
/dports/misc/mxnet/incubator-mxnet-1.9.0/3rdparty/tvm/nnvm/src/pass/
H A Dplan_memory.cc191 const std::pair<uint32_t, uint32_t>& node_range, StorageVector* storage_ptr, in AllocMemory() argument
213 for (uint32_t nid = node_range.first; nid < node_range.second; ++nid) { in AllocMemory()
324 std::pair<uint32_t, uint32_t> node_range = {0, idx.num_nodes()}; in PlanMemory() local
326 node_range = ret.MoveCopyAttr<std::pair<uint32_t, uint32_t> >("node_range"); in PlanMemory()
376 size_t storage_num_not_allocated = AllocMemory(ret, idx, node_range, &storage_vec, in PlanMemory()
/dports/misc/py-mxnet/incubator-mxnet-1.9.0/src/nnvm/
H A Dplan_memory.cc193 const std::pair<uint32_t, uint32_t>& node_range, in MXAllocMemory() argument
217 for (uint32_t nid = node_range.first; nid < node_range.second; ++nid) { in MXAllocMemory()
333 std::pair<uint32_t, uint32_t> node_range = {0, idx.num_nodes()}; in MXPlanMemory() local
335 node_range = ret.MoveCopyAttr<std::pair<uint32_t, uint32_t> >("node_range"); in MXPlanMemory()
386 MXAllocMemory(ret, idx, node_range, &storage_vec, &storage_inplace_index, in MXPlanMemory()
/dports/misc/py-tvm/incubator-tvm-0.6.1/nnvm/src/pass/
H A Dplan_memory.cc190 const std::pair<uint32_t, uint32_t>& node_range, in AllocMemory() argument
214 for (uint32_t nid = node_range.first; nid < node_range.second; ++nid) { in AllocMemory()
329 std::pair<uint32_t, uint32_t> node_range = {0, idx.num_nodes()}; in PlanMemory() local
331 node_range = ret.MoveCopyAttr<std::pair<uint32_t, uint32_t> >("node_range"); in PlanMemory()
382 AllocMemory(ret, idx, node_range, &storage_vec, &storage_inplace_index, in PlanMemory()
/dports/misc/mxnet/incubator-mxnet-1.9.0/src/nnvm/
H A Dplan_memory.cc193 const std::pair<uint32_t, uint32_t>& node_range, in MXAllocMemory() argument
217 for (uint32_t nid = node_range.first; nid < node_range.second; ++nid) { in MXAllocMemory()
333 std::pair<uint32_t, uint32_t> node_range = {0, idx.num_nodes()}; in MXPlanMemory() local
335 node_range = ret.MoveCopyAttr<std::pair<uint32_t, uint32_t> >("node_range"); in MXPlanMemory()
386 MXAllocMemory(ret, idx, node_range, &storage_vec, &storage_inplace_index, in MXPlanMemory()
/dports/math/jags/JAGS-4.3.0/src/lib/model/
H A DSymTab.cc156 Range node_range = array->getRange(node); in getName() local
157 if (!isNULL(node_range)) { in getName()
158 if (node_range == array->range()) { in getName()
/dports/devel/rust-analyzer/rust-analyzer-2021-12-20/crates/ide_ssr/src/
H A Dlib.rs251 let node_range = self.sema.original_range(&node); in output_debug_for_nodes_at_range() localVariable
252 if node_range.file_id != range.file_id || !node_range.range.contains_range(range.range) in output_debug_for_nodes_at_range()
256 if node_range.range == range.range { in output_debug_for_nodes_at_range()
H A Dsearch.rs230 let node_range = self.sema.original_range(code); in within_range_restrictions() localVariable
232 if range.file_id == node_range.file_id && range.range.contains_range(node_range.range) { in within_range_restrictions()
/dports/lang/rust/rustc-1.58.1-src/src/tools/rust-analyzer/crates/ide_ssr/src/
H A Dlib.rs251 let node_range = self.sema.original_range(&node); in output_debug_for_nodes_at_range() localVariable
252 if node_range.file_id != range.file_id || !node_range.range.contains_range(range.range) in output_debug_for_nodes_at_range()
256 if node_range.range == range.range { in output_debug_for_nodes_at_range()
H A Dsearch.rs230 let node_range = self.sema.original_range(code); in within_range_restrictions() localVariable
232 if range.file_id == node_range.file_id && range.range.contains_range(node_range.range) { in within_range_restrictions()
/dports/math/moab/fathomteam-moab-7bde9dfb84a8/src/io/
H A DReadABAQUS.cpp891 Range node_range; in read_node_set() local
977 node_range.merge(tmp_node_range); in read_node_set()
993 node_range.merge(tmp_node_range); in read_node_set()
1001 status = mdbImpl->add_entities(node_set, node_range); in read_node_set()
1312 Range node_range(start_node, start_node + num_nodes - 1); in read_node_list() local
1318 status = mdbImpl->add_entities(parent_set, node_range); in read_node_list()
1343 status = mdbImpl->add_entities(node_set, node_range); in read_node_list()
1385 Range &node_range) in get_nodes_by_id() argument
1404 node_range.insert(nodeIdMap[*node]); in get_nodes_by_id()
1489 Range &node_range) in get_set_nodes() argument
[all …]
/dports/audio/rhvoice/RHVoice-1.2.4/src/third-party/rapidxml/rapidxml/
H A Drapidxml_iterators.hpp201 using node_range = iterator_range<node_iterator<Ch>>; typedef
209 node_range<Ch> nodes(const xml_node<Ch> *parent) noexcept in nodes()

123