Home
last modified time | relevance | path

Searched refs:TopologyInfo (Results 1 – 25 of 65) sorted by relevance

123

/dports/math/moab/fathomteam-moab-7bde9dfb84a8/test/mesquite/unit/
H A DTopologyInfoTest.cpp344 CPPUNIT_ASSERT (3 == TopologyInfo::sides( TRIANGLE )); in tri()
345 CPPUNIT_ASSERT (3 == TopologyInfo::corners( TRIANGLE )); in tri()
346 CPPUNIT_ASSERT (3 == TopologyInfo::edges( TRIANGLE )); in tri()
347 CPPUNIT_ASSERT (1 == TopologyInfo::faces( TRIANGLE )); in tri()
1009 CPPUNIT_ASSERT (3 == TopologyInfo::dimension( PRISM )); in wedge()
1114 CPPUNIT_ASSERT( TopologyInfo::sides(topo) == 0 ); in test_poly()
1115 CPPUNIT_ASSERT( TopologyInfo::corners(topo) == 0 ); in test_poly()
1116 CPPUNIT_ASSERT( TopologyInfo::edges(topo) == 0 ); in test_poly()
1117 CPPUNIT_ASSERT( TopologyInfo::faces(topo) == 0 ); in test_poly()
1244 unsigned n = TopologyInfo::corners( type ); in test_adj()
[all …]
H A DPatchDataInstances.hpp607 std::vector<Vector3D> coords( corners, corners+TopologyInfo::corners(type) ); in create_ideal_element_patch()
609 TopologyInfo::higher_order( type, num_nodes, mids[1], mids[2], mids[3], err ); in create_ideal_element_patch()
615 for (unsigned dim = 1; dim <= TopologyInfo::dimension(type); ++dim) { in create_ideal_element_patch()
620 if (dim == TopologyInfo::dimension(type)) in create_ideal_element_patch()
623 num_side = TopologyInfo::adjacent( type, dim ); in create_ideal_element_patch()
626 unsigned idx = TopologyInfo::higher_order_from_side( type, num_nodes, dim, s, err ); in create_ideal_element_patch()
631 const unsigned* side = TopologyInfo::side_vertices( type, dim, s, n, err ); in create_ideal_element_patch()
648 if (TopologyInfo::dimension(type) == 2) in create_ideal_element_patch()
H A DNodeSetTest.cpp191 for (unsigned i = 0; i < TopologyInfo::corners(type); ++i) { in test_clear_node()
197 for (unsigned i = 0; i < TopologyInfo::edges(type); ++i) { in test_clear_node()
203 for (unsigned i = 0; i < TopologyInfo::faces(type); ++i) { in test_clear_node()
301 unsigned count = TopologyInfo::adjacent( type, dim ); in check_all()
325 for (unsigned i = TopologyInfo::adjacent( type, dim ); i < max_count[dim]; ++i) in check_range_set()
330 for (unsigned i = 0; i < TopologyInfo::adjacent( type, dim ); ++i) in check_range_set()
405 CPPUNIT_ASSERT_EQUAL( TopologyInfo::corners(type), set.num_before_mid_edge(0) ); in test_num_before()
406 …CPPUNIT_ASSERT_EQUAL( TopologyInfo::corners(type)-1, set.num_before_corner(TopologyInfo::corners(t… in test_num_before()
H A DMsqMeshEntityTest.cpp243 pd.fill( TopologyInfo::corners( type ), coords, 1, type, conn, fixed, err ); in test_unsigned_area_common()
353 TopologyInfo::higher_order( type, num_nodes, mid_edge, mid_face, mid_reg, err ); in test_all_nodes()
403 test_check_element_orientation( types[i], TopologyInfo::corners(types[i]) ); in test_check_element_orientation_linear()
449 TopologyInfo::higher_order( type, nodes, mids[1], mids[2], mids[3], err ); in test_check_element_orientation()
458 TopologyInfo::side_from_higher_order( type, nodes, i, dim, num, err ); in test_check_element_orientation()
462 if (dim == TopologyInfo::dimension(type)) { in test_check_element_orientation()
495 str << TopologyInfo::short_name(type) << nodes in test_check_element_orientation()
H A DTargetReadWriteTest.cpp179 …CPPUNIT_ASSERT_EQUAL( 3u, TopologyInfo::dimension( pd.element_by_index(elem).get_element_type() ) … in get_3D_target()
194 …CPPUNIT_ASSERT_EQUAL( 2u, TopologyInfo::dimension( pd.element_by_index(elem).get_element_type() ) … in get_surface_target()
205 …CPPUNIT_ASSERT_EQUAL( 2u, TopologyInfo::dimension( pd.element_by_index(elem).get_element_type() ) … in get_2D_target()
247 const unsigned d = TopologyInfo::dimension( myPatch.element_by_index(i).get_element_type() ); in read_write_3D_targets()
284 const unsigned d = TopologyInfo::dimension( myPatch.element_by_index(i).get_element_type() ); in read_write_surface_targets()
321 const unsigned d = TopologyInfo::dimension( myPatch.element_by_index(i).get_element_type() ); in read_write_2D_targets()
H A DLinearMappingFunctionTest.cpp303 unsigned d = TopologyInfo::dimension( type ); in xi_at_corners()
304 unsigned c = TopologyInfo::corners( type ); in xi_at_corners()
312 unsigned d = TopologyInfo::dimension( type ); in xi_at_edges()
313 unsigned e = TopologyInfo::edges( type ); in xi_at_edges()
316 const unsigned* vtx = TopologyInfo::edge_vertices( type, i, err ); in xi_at_edges()
327 unsigned d = TopologyInfo::dimension( type ); in xi_at_faces()
328 unsigned f = TopologyInfo::faces( type ); in xi_at_faces()
921 const unsigned n = TopologyInfo::corners( mf.element_topology() ); in do_coeff_test()
922 const unsigned d = TopologyInfo::dimension( mf.element_topology() ); in do_coeff_test()
977 const unsigned n = TopologyInfo::corners( mf.element_topology() ); in do_deriv_test()
[all …]
H A DIdealTargetTest.cpp146 const int elem_dim = TopologyInfo::dimension(type); in get_calc_target()
170 const unsigned elem_dim = TopologyInfo::dimension(type); in get_ideal_target()
219 if (TopologyInfo::dimension(type) == 2) { in do_test()
/dports/sysutils/kubectl/kubernetes-1.22.2/pkg/kubelet/apis/podresources/
H A Dserver_v1_test.go187 Topology: &podresourcesapi.TopologyInfo{
198 Topology: &podresourcesapi.TopologyInfo{
213 Topology: &podresourcesapi.TopologyInfo{
224 Topology: &podresourcesapi.TopologyInfo{
243 Topology: &podresourcesapi.TopologyInfo{
254 Topology: &podresourcesapi.TopologyInfo{
265 Topology: &podresourcesapi.TopologyInfo{
276 Topology: &podresourcesapi.TopologyInfo{
326 Topology: &podresourcesapi.TopologyInfo{
337 Topology: &podresourcesapi.TopologyInfo{
[all …]
/dports/math/moab/fathomteam-moab-7bde9dfb84a8/src/mesquite/TargetCalculator/
H A DCachingTargetCalculator.cpp72 size_t& count = (TopologyInfo::dimension( type ) == 2) ? count_2D : count_3D; in notify_sub_patch()
92 if (TopologyInfo::dimension( type ) == 3) in notify_sub_patch()
115 size_t& count = (TopologyInfo::dimension( type ) == 3) ? count_3d : count_2d; in populate_data()
130 if (TopologyInfo::dimension( type ) == 3) { in populate_data()
132 for (j = 0; j < TopologyInfo::corners(type); ++j) { in populate_data()
139 for (j = 0; j < TopologyInfo::edges(type); ++j) { in populate_data()
146 for (j = 0; j < TopologyInfo::faces(type); ++j) { in populate_data()
161 for (j = 0; j < TopologyInfo::corners(type); ++j) { in populate_data()
168 for (j = 0; j < TopologyInfo::edges(type); ++j) { in populate_data()
183 for (j = 0; j < TopologyInfo::corners(type); ++j) { in populate_data()
[all …]
/dports/math/moab/fathomteam-moab-7bde9dfb84a8/src/mesquite/Mesh/
H A DTopologyInfo.cpp35 TopologyInfo TopologyInfo::instance;
56 TopologyInfo::TopologyInfo() in TopologyInfo() function in MBMesquite::TopologyInfo
352 void TopologyInfo::higher_order( EntityTopology topo, in higher_order()
366 int TopologyInfo::higher_order( EntityTopology topo, in higher_order()
417 int TopologyInfo::higher_order_from_side( EntityTopology topo, in higher_order_from_side()
449 void TopologyInfo::side_from_higher_order( EntityTopology topo, in side_from_higher_order()
616 void TopologyInfo::side_number( EntityTopology topo, in side_number()
707 bool TopologyInfo::compare_sides( const size_t* verts1, in compare_sides()
756 unsigned TopologyInfo::find_edge( EntityTopology topo, in find_edge()
787 unsigned TopologyInfo::find_face( EntityTopology topo, in find_face()
[all …]
H A DMeshImplData.cpp64 unsigned from_topo = TopologyInfo::corners( iter->topology ); in num_vertex_uses()
178 numvert = TopologyInfo::corners( elementList[index].topology ); in element_topology()
185 numvert = TopologyInfo::corners( elementList[index].topology ); in element_topology()
309 unsigned numvert = TopologyInfo::corners( elementList[index].topology ); in clear_element()
378 unsigned numvert = TopologyInfo::corners( elementList[index].topology ); in set_element()
492 cl = TopologyInfo::corners( elem.topology ); in copy_mesh()
564 TopologyInfo::side_number( elem.topology, elem.connectivity.size(), in copy_higher_order()
575 const unsigned* corner_indices = TopologyInfo::side_vertices( in copy_higher_order()
682 TopologyInfo::dimension( elementList[*iter].topology ) == dim ) in has_adjacent_elements()
707 unsigned num = TopologyInfo::sides( topo ); in skin()
[all …]
H A DPatchData.cpp594 const unsigned dim = TopologyInfo::dimension( type ); in get_vertex_element_indices()
1265 const int mid_node = TopologyInfo::higher_order_from_side( in get_domain_normal_at_element()
1293 const int mid_node = TopologyInfo::higher_order_from_side( in get_domain_normal_at_mid_edge()
1766 std::ptr_fun(TopologyInfo::corners) ); in fill()
2024 num_edge = TopologyInfo::edges(type); in non_slave_node_set()
2025 if (TopologyInfo::dimension(type) == 2) in non_slave_node_set()
2028 num_face = TopologyInfo::faces(type); in non_slave_node_set()
2058 for (j = 0; j < TopologyInfo::corners(type); ++j) in get_samples()
2061 for (j = 0; j < TopologyInfo::edges(type); ++j) in get_samples()
2064 if (TopologyInfo::dimension(type) == 3) { in get_samples()
[all …]
H A DMsqMeshEntity.cpp299 const unsigned* indices = TopologyInfo::adjacent_vertices( mType, index, n ); in get_connected_vertices()
531 if (TopologyInfo::dimension(mType) == 2) { in check_element_orientation()
549 for (i = 0; i < TopologyInfo::corners(mType); ++i) in check_element_orientation()
554 for (i = 0; i < TopologyInfo::edges(mType); ++i) in check_element_orientation()
573 for (i = 0; i < TopologyInfo::corners(mType); ++i) in check_element_orientation()
578 for (i = 0; i < TopologyInfo::edges(mType); ++i) in check_element_orientation()
583 for (i = 0; i < TopologyInfo::faces(mType); ++i) in check_element_orientation()
646 TopologyInfo::higher_order( mType, node_count(), mid_edge, mid_face, mid_vol, err ); in all_nodes()
746 adj_idx = TopologyInfo::adjacent_vertices( mType, j, num_adj ); in check_element_orientation_corners()
H A DTopologyInfo.hpp40 class MESQUITE_EXPORT TopologyInfo class
416 TopologyInfo();
418 static TopologyInfo instance;
/dports/math/moab/fathomteam-moab-7bde9dfb84a8/src/mesquite/MappingFunction/
H A DMappingFunction.cpp59 TopologyInfo::higher_order( topo, input_type, in_edges, in_faces, in convert_connectivity_indices_impl()
61 TopologyInfo::higher_order( topo, output_type, out_edges, out_faces, in convert_connectivity_indices_impl()
79 const unsigned corners = TopologyInfo::corners(topo); in convert_connectivity_indices_impl()
80 const unsigned edges = TopologyInfo::edges(topo); in convert_connectivity_indices_impl()
81 const unsigned faces = TopologyInfo::faces(topo); in convert_connectivity_indices_impl()
109 assert( TopologyInfo::dimension(topo) == 3 || index_list[i] == (unsigned)input_type - 1 ); in convert_connectivity_indices_impl()
120 assert( TopologyInfo::dimension(topo) == 3 && index_list[i] == (unsigned)input_type - 1 ); in convert_connectivity_indices_impl()
H A DNodeSet.hpp302 { set_bits( CORNER_OFFSET, TopologyInfo::corners(p_type) ); } in set_all_corner_nodes()
305 { set_bits( EDGE_OFFSET, TopologyInfo::edges(p_type) ); } in set_all_mid_edge_nodes()
308 { set_bits( FACE_OFFSET, TopologyInfo::faces(p_type) ); } in set_all_mid_face_nodes()
315 switch (TopologyInfo::dimension(p_type)) { in set_all_nodes()
/dports/math/moab/fathomteam-moab-7bde9dfb84a8/src/mesquite/Misc/
H A DEdgeIterator.cpp72 size_t num_edges = TopologyInfo::edges( type ); in get_adjacent_vertices()
75 TopologyInfo::higher_order( type, elem.node_count(), mid_edge, mid_face, mid_vol, err ); in get_adjacent_vertices()
81 const unsigned* edge = TopologyInfo::edge_vertices( type, d, err ); in get_adjacent_vertices()
88 int p = TopologyInfo::higher_order_from_side( type, elem.node_count(), 1, d, err ); in get_adjacent_vertices()
H A DDomainClassifier.cpp205 const unsigned dim = TopologyInfo::dimension( type ); in find_skin()
206 const unsigned nsides = TopologyInfo::sides( type ); in find_skin()
222 if (TopologyInfo::dimension(adj_type) == dim) { in find_skin()
223 unsigned nsides2= TopologyInfo::sides( adj_type ); in find_skin()
235 if (TopologyInfo::corners(adj_type) == num_side_vtx) in find_skin()
255 const unsigned nedges = TopologyInfo::edges( type ); in find_skin()
491 if (TopologyInfo::dimension(types[r]) == 2) { in classify_geometrically()
740 unsigned nedges = TopologyInfo::edges( elem_types[j] ); in next_vertex()
986 if (TopologyInfo::dimension(type) != 2) in test_valid_classification()
1032 if (TopologyInfo::dimension(type) != 3) in test_valid_classification()
[all …]
/dports/math/moab/fathomteam-moab-7bde9dfb84a8/src/mesquite/QualityMetric/
H A DAveragingQM.cpp57 const unsigned num_vertex = TopologyInfo::corners( type ); in average_corner_gradients()
58 const unsigned dim = TopologyInfo::dimension(type); in average_corner_gradients()
158 adj_list = TopologyInfo::adjacent_vertices( type, i, n ); in sum_corner_diagonals()
198 adj_list = TopologyInfo::adjacent_vertices( type, i, n ); in sum_sqr_corner_diagonals()
230 const unsigned N = TopologyInfo::corners( type ); in pmean_corner_diagonals()
253 adj_list = TopologyInfo::adjacent_vertices( type, i, n ); in pmean_corner_diagonals()
301 const unsigned num_vertex = TopologyInfo::corners( type ); in average_corner_diagonals()
402 const unsigned N = TopologyInfo::corners( type ); in sum_corner_hessians()
448 const unsigned N = TopologyInfo::corners( type ); in sum_sqr_corner_hessians()
500 const unsigned N = TopologyInfo::corners( type ); in pmean_corner_hessians()
[all …]
H A DEdgeQM.cpp98 unsigned n_edges = TopologyInfo::edges( elem.get_element_type() ); in get_edge_evaluations()
100 const unsigned* edge = TopologyInfo::edge_vertices( elem.get_element_type(), k, err ); in get_edge_evaluations()
145 const unsigned* verts = TopologyInfo::edge_vertices( type, edge(p_handle) ); in evaluate_with_indices()
/dports/math/moab/fathomteam-moab-7bde9dfb84a8/src/mesquite/QualityMetric/TMP/
H A DTargetMetricUtil.cpp122 for (unsigned j = 0; j < TopologyInfo::corners(type); ++j) in append_elem_samples()
125 for (unsigned j = 0; j < TopologyInfo::edges(type); ++j) in append_elem_samples()
128 for (unsigned j = 0; j < TopologyInfo::faces(type); ++j) in append_elem_samples()
131 if (TopologyInfo::dimension(type) == 3 && samples.mid_region_node()) in append_elem_samples()
H A DAffineMapMetric.cpp102 unsigned edim = TopologyInfo::dimension( type ); in evaluate()
122 const unsigned* adj = TopologyInfo::adjacent_vertices( type, s.number, n ); in evaluate()
140 const unsigned* adj = TopologyInfo::adjacent_vertices( type, s.number, n ); in evaluate()
191 const unsigned* adj = TopologyInfo::adjacent_vertices( type, s.number, n ); in evaluate_with_indices()
/dports/sysutils/kubectl/kubernetes-1.22.2/staging/src/k8s.io/kubelet/pkg/apis/podresources/v1/
H A Dapi.proto60 TopologyInfo topology = 3;
67 TopologyInfo topology = 3;
71 message TopologyInfo { message
H A Dapi.pb.go488 type TopologyInfo struct { struct
494 func (m *TopologyInfo) Reset() { *m = TopologyInfo{} } argument
495 func (*TopologyInfo) ProtoMessage() {} argument
517 func (m *TopologyInfo) XXX_Size() int { argument
520 func (m *TopologyInfo) XXX_DiscardUnknown() { argument
526 func (m *TopologyInfo) GetNodes() []*NUMANode { argument
1362 func (m *TopologyInfo) Size() (n int) { argument
1514 func (this *TopologyInfo) String() string { argument
1523 s := strings.Join([]string{`&TopologyInfo{`,
2409 m.Topology = &TopologyInfo{}
[all …]
/dports/math/moab/fathomteam-moab-7bde9dfb84a8/src/mesquite/QualityMetric/Volume/
H A DEdgeLengthMetric.cpp58 vert_nums = TopologyInfo::edge_vertices( e.get_element_type(), edge(p_handle), err ); in evaluate()
81 vert_nums = TopologyInfo::edge_vertices( e.get_element_type(), edge(p_handle), err ); in evaluate_with_gradient()

123