| /dports/science/InsightToolkit/ITK-5.0.1/Modules/ThirdParty/MINC/src/libminc/libsrc2/ |
| H A D | volprops.c | 56 handle->edge_count = 0; in minew_volume_props()
129 if (handle->edge_count < 0) { in miget_volume_props()
138 for (i = 0; i < handle->edge_count; i++) { in miget_volume_props()
173 handle->edge_count = 0; in miget_volume_props()
421 if (props == NULL || edge_count > MI2_MAX_VAR_DIMS) { in miset_props_blocking()
430 props->edge_count = edge_count; in miset_props_blocking()
431 if (edge_count != 0) { in miset_props_blocking()
436 for (i=0; i< edge_count; i++){ in miset_props_blocking()
459 *edge_count = props->edge_count; in miget_props_blocking()
463 if (max_lengths > props->edge_count) { in miget_props_blocking()
[all …]
|
| /dports/science/minc2/minc-release-2.2.00/libsrc2/ |
| H A D | volprops.c | 52 handle->edge_count = 0; in minew_volume_props()
126 if (handle->edge_count < 0) { in miget_volume_props()
133 for (i = 0; i < handle->edge_count; i++) { in miget_volume_props()
165 handle->edge_count = 0; in miget_volume_props()
411 if (props == NULL || edge_count > MI2_MAX_VAR_DIMS) { in miset_props_blocking()
420 props->edge_count = edge_count; in miset_props_blocking()
421 if (edge_count != 0) { in miset_props_blocking()
426 for (i=0; i< edge_count; i++){ in miset_props_blocking()
450 *edge_count = props->edge_count; in miget_props_blocking()
454 if (max_lengths > props->edge_count) { in miget_props_blocking()
[all …]
|
| /dports/math/vtk9/VTK-9.1.0/IO/Legacy/ |
| H A D | vtkTreeReader.cxx | 134 vtkIdType edge_count = 0; in ReadMeshSimple() local
135 if (!this->Read(&edge_count)) in ReadMeshSimple()
143 for (vtkIdType edge = 0; edge <= edge_count; ++edge) in ReadMeshSimple()
151 for (vtkIdType edge = 0; edge != edge_count; ++edge) in ReadMeshSimple()
189 vtkIdType edge_count = 0; in ReadMeshSimple() local
190 if (!this->Read(&edge_count)) in ReadMeshSimple()
197 this->ReadEdgeData(output, edge_count); in ReadMeshSimple()
|
| /dports/math/vtk8/VTK-8.2.0/IO/Legacy/ |
| H A D | vtkTreeReader.cxx | 135 vtkIdType edge_count = 0; in ReadMeshSimple() local
136 if(!this->Read(&edge_count)) in ReadMeshSimple()
144 for(vtkIdType edge = 0; edge <= edge_count; ++edge) in ReadMeshSimple()
152 for(vtkIdType edge = 0; edge != edge_count; ++edge) in ReadMeshSimple()
190 vtkIdType edge_count = 0; in ReadMeshSimple() local
191 if(!this->Read(&edge_count)) in ReadMeshSimple()
198 this->ReadEdgeData(output, edge_count); in ReadMeshSimple()
|
| H A D | vtkGraphReader.cxx | 172 vtkIdType edge_count = 0; in ReadMeshSimple() local
173 if(!this->Read(&edge_count)) in ReadMeshSimple()
181 for(vtkIdType edge = 0; edge != edge_count; ++edge) in ReadMeshSimple()
225 vtkIdType edge_count = 0; in ReadMeshSimple() local
226 if(!this->Read(&edge_count)) in ReadMeshSimple()
233 this->ReadEdgeData(builder, edge_count); in ReadMeshSimple()
|
| /dports/databases/grass7/grass-7.8.6/lib/python/temporal/ |
| H A D | spatial_extent.py | 807 edge_count = 0
809 edge_count += 1
811 edge_count += 1
813 edge_count += 1
815 edge_count += 1
817 if edge_count == 0:
889 edge_count = 0
891 edge_count += 1
893 edge_count += 1
1137 edge_count = 0
[all …]
|
| /dports/math/vtk6/VTK-6.2.0/IO/Legacy/ |
| H A D | vtkTreeReader.cxx | 179 int edge_count = 0; in RequestData() local
180 if(!this->Read(&edge_count)) in RequestData()
188 for(int edge = 0; edge <= edge_count; ++edge) in RequestData()
196 for(int edge = 0; edge != edge_count; ++edge) in RequestData()
234 int edge_count = 0; in RequestData() local
235 if(!this->Read(&edge_count)) in RequestData()
242 this->ReadEdgeData(output, edge_count); in RequestData()
|
| H A D | vtkGraphReader.cxx | 189 int edge_count = 0; in RequestData() local
190 if(!this->Read(&edge_count)) in RequestData()
198 for(int edge = 0; edge != edge_count; ++edge) in RequestData()
236 int edge_count = 0; in RequestData() local
237 if(!this->Read(&edge_count)) in RequestData()
244 this->ReadEdgeData(builder, edge_count); in RequestData()
|
| /dports/devel/boost-docs/boost_1_72_0/libs/graph/example/ |
| H A D | make_maximal_planar.cpp | 75 graph_traits<graph>::edges_size_type edge_count = 0; in main() local
78 put(e_index, *ei, edge_count++); in main()
96 edge_count = 0; in main()
98 put(e_index, *ei, edge_count++); in main()
118 edge_count = 0; in main()
120 put(e_index, *ei, edge_count++); in main()
|
| /dports/devel/boost-python-libs/boost_1_72_0/libs/graph/example/ |
| H A D | make_maximal_planar.cpp | 75 graph_traits<graph>::edges_size_type edge_count = 0; in main() local
78 put(e_index, *ei, edge_count++); in main()
96 edge_count = 0; in main()
98 put(e_index, *ei, edge_count++); in main()
118 edge_count = 0; in main()
120 put(e_index, *ei, edge_count++); in main()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/graph/example/ |
| H A D | make_maximal_planar.cpp | 75 graph_traits<graph>::edges_size_type edge_count = 0; in main() local
78 put(e_index, *ei, edge_count++); in main()
96 edge_count = 0; in main()
98 put(e_index, *ei, edge_count++); in main()
118 edge_count = 0; in main()
120 put(e_index, *ei, edge_count++); in main()
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/graph/example/ |
| H A D | make_maximal_planar.cpp | 75 graph_traits<graph>::edges_size_type edge_count = 0; in main() local
78 put(e_index, *ei, edge_count++); in main()
96 edge_count = 0; in main()
98 put(e_index, *ei, edge_count++); in main()
118 edge_count = 0; in main()
120 put(e_index, *ei, edge_count++); in main()
|
| /dports/databases/percona57-server/boost_1_59_0/libs/graph/example/ |
| H A D | make_maximal_planar.cpp | 75 graph_traits<graph>::edges_size_type edge_count = 0; in main() local
78 put(e_index, *ei, edge_count++); in main()
96 edge_count = 0; in main()
98 put(e_index, *ei, edge_count++); in main()
118 edge_count = 0; in main()
120 put(e_index, *ei, edge_count++); in main()
|
| /dports/databases/xtrabackup/boost_1_59_0/libs/graph/example/ |
| H A D | make_maximal_planar.cpp | 75 graph_traits<graph>::edges_size_type edge_count = 0; in main() local
78 put(e_index, *ei, edge_count++); in main()
96 edge_count = 0; in main()
98 put(e_index, *ei, edge_count++); in main()
118 edge_count = 0; in main()
120 put(e_index, *ei, edge_count++); in main()
|
| /dports/databases/percona57-client/boost_1_59_0/libs/graph/example/ |
| H A D | make_maximal_planar.cpp | 75 graph_traits<graph>::edges_size_type edge_count = 0; in main() local
78 put(e_index, *ei, edge_count++); in main()
96 edge_count = 0; in main()
98 put(e_index, *ei, edge_count++); in main()
118 edge_count = 0; in main()
120 put(e_index, *ei, edge_count++); in main()
|
| /dports/devel/boost-libs/boost_1_72_0/libs/graph/example/ |
| H A D | make_maximal_planar.cpp | 75 graph_traits<graph>::edges_size_type edge_count = 0; in main() local
78 put(e_index, *ei, edge_count++); in main()
96 edge_count = 0; in main()
98 put(e_index, *ei, edge_count++); in main()
118 edge_count = 0; in main()
120 put(e_index, *ei, edge_count++); in main()
|
| /dports/devel/hyperscan/boost_1_75_0/libs/graph/example/ |
| H A D | make_maximal_planar.cpp | 64 graph_traits< graph >::edges_size_type edge_count = 0; in main() local
67 put(e_index, *ei, edge_count++); in main()
81 edge_count = 0; in main()
83 put(e_index, *ei, edge_count++); in main()
97 edge_count = 0; in main()
99 put(e_index, *ei, edge_count++); in main()
|
| /dports/devel/libsigrokdecode/libsigrokdecode-0.5.3/decoders/ook/ |
| H A D | pd.py | 104 self.edge_count = 0
163 self.edge_count += 1
187 self.edge_count += 1
193 self.edge_count = 0
209 self.edge_count = 0
228 self.edge_count = 0
264 if self.edge_count == 0:
312 self.edge_count += 1
318 if self.edge_count == 0:
380 self.edge_count += 1
[all …]
|
| /dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/testunits/module_PRM/ |
| H A D | InterfaceGraphTestSuite.h | 148 int edge_count = 0; in testSmallTopologie()
150 for (int i = 0; i < 2; ++i, ++edge_count) { in testSmallTopologie()
156 ++edge_count; in testSmallTopologie()
158 for (int i = 0; i < 4; ++i, ++edge_count) { in testSmallTopologie()
164 ++edge_count; in testSmallTopologie()
167 for (int i = 0; i < 2; ++i, ++edge_count) { in testSmallTopologie()
185 ++edge_count; in testSmallTopologie()
207 int edge_count = 0; in testSmallLabelsOnEdges() local
210 edge_count += 3; in testSmallLabelsOnEdges()
214 edge_count += 5; in testSmallLabelsOnEdges()
[all …]
|
| /dports/cad/sumo/sumo-1.2.0/tools/net/ |
| H A D | netcheck.py | 170 edge_count = len(comp) variable
171 total += edge_count
172 if edge_count > max:
173 max = edge_count
176 if edge_count not in edge_count_dist:
177 edge_count_dist[edge_count] = 0
178 edge_count_dist[edge_count] += 1
180 idx, edge_count, " ".join(comp))
|
| /dports/devel/libsigrokdecode/libsigrokdecode-0.5.3/decoders/counter/ |
| H A D | pd.py | 95 edge_count = int(self.options['edge_off'])
110 edge_count = int(self.options['edge_off'])
137 edge_count += 1
138 self.putc(ROW_EDGE, edge_start, ["{:d}".format(edge_count)])
141 word_edge_count = edge_count - int(self.options['edge_off'])
|
| /dports/databases/pgrouting/pgrouting-3.2.0/src/trsp/ |
| H A D | GraphDefinition.cpp | 211 edge_t *edges, size_t edge_count, in my_dijkstra1() argument
251 edge_count++; in my_dijkstra1()
259 edge_count++; in my_dijkstra1()
284 edge_count++; in my_dijkstra1()
291 edge_count++; in my_dijkstra1()
296 edges, edge_count, in my_dijkstra1()
308 edge_t *edges, size_t edge_count, in my_dijkstra2() argument
361 edges, edge_count, in my_dijkstra2()
369 edge_t *edges, size_t edge_count, in my_dijkstra3() argument
381 parent = new PARENT_PATH[edge_count + 1]; in my_dijkstra3()
[all …]
|
| /dports/lang/rust/rustc-1.58.1-src/compiler/rustc_query_system/src/dep_graph/ |
| H A D | serialized.rs | 112 let edge_count = IntEncodedWithFixedSize::decode(d)?.0 as usize; in decode() localVariable
113 debug!(?node_count, ?edge_count); in decode()
122 let mut edge_list_data = Vec::with_capacity(edge_count); in decode()
199 let edge_count = node.edges.len(); in encode_node() localVariable
200 self.total_edge_count += edge_count; in encode_node()
214 stat.edge_counter += edge_count as u64; in encode_node()
230 let edge_count = total_edge_count.try_into().unwrap(); in finish() localVariable
232 debug!(?node_count, ?edge_count); in finish()
235 IntEncodedWithFixedSize(edge_count).encode(&mut encoder)?; in finish()
|
| /dports/science/minc2/minc-release-2.2.00/libsrc2/test/ |
| H A D | volprops-test.c | 21 int edge_count; in main() local
87 r = miget_props_blocking(props, &edge_count, edge_lengths, in main()
92 printf("edge_count %d\n", edge_count); in main()
93 for (i = 0; i < edge_count; i++) { in main()
|
| /dports/devel/godot-tools/godot-3.2.3-stable/scene/3d/ |
| H A D | navigation.cpp | 150 int edge_count = p.edges.size(); in _navmesh_unlink() local
153 for (int i = 0; i < edge_count; i++) { in _navmesh_unlink()
155 int next = (i + 1) % edge_count; in _navmesh_unlink()
255 int next = (pe + 1) % edge_count; in _clip_path()
391 int edge_count = p->edges.size(); in get_simple_path() local
392 for (int i = 0; i < edge_count; i++) { in get_simple_path()
400 int next = (i + 1) % edge_count; in get_simple_path()
465 int edge_count = p->edges.size(); in get_simple_path() local
540 int edge_count = p->edges.size(); in get_simple_path() local
595 int edge_count = p.edges.size(); in get_closest_point_to_segment() local
[all …]
|