Home
last modified time | relevance | path

Searched refs:index_t (Results 1 – 25 of 1963) sorted by relevance

12345678910>>...79

/dports/science/conduit/conduit-0.8.0/src/libs/conduit/
H A Dconduit_data_type.hpp168 static DataType index_t(conduit::index_t num_elements=1,
323 explicit DataType(conduit::index_t id,
329 conduit::index_t offset,
330 conduit::index_t stride,
332 conduit::index_t endianness);
335 DataType(conduit::index_t dtype_id,
337 conduit::index_t offset,
338 conduit::index_t stride,
340 conduit::index_t endianness);
392 conduit::index_t element_index(conduit::index_t idx) const;
[all …]
H A Dconduit_node.hpp250 index_t allocator();
671 index_t offset = 0,
686 index_t offset = 0,
701 index_t offset = 0,
717 index_t offset = 0,
734 index_t offset = 0,
749 index_t offset = 0,
764 index_t offset = 0,
779 index_t offset = 0,
4688 index_t m_data_size;
[all …]
H A Dconduit_data_type.cpp89 conduit::index_t offset, in int8()
217 DataType::index_t(conduit::index_t num_elements, in index_t() function in conduit::DataType
515 DataType::DataType(conduit::index_t id, conduit::index_t num_elements) in DataType()
629 conduit::index_t
638 conduit::index_t
645 conduit::index_t
1026 conduit::index_t
1046 conduit::index_t
1103 conduit::index_t
1207 conduit::index_t
[all …]
/dports/math/gismo/gismo-21.12.0/src/gsCore/
H A DgsDofMapper.h210 void matchDof( index_t u, index_t i, index_t v, index_t j, index_t comp = 0);
219 void markCoupled(index_t i, index_t k, index_t comp = 0);
222 void markTagged(index_t i, index_t k, index_t comp = 0);
232 void eliminateDof(index_t i, index_t k, index_t comp = 0);
303 inline index_t freeIndex(index_t i, index_t k = 0, index_t c = 0) const
328 inline index_t index(index_t i, index_t k = 0, index_t c = 0) const
337 inline index_t bindex(index_t i, index_t k = 0, index_t c = 0) const
350 inline index_t cindex(index_t i, index_t k = 0, index_t c = 0) const
358 inline index_t tindex(index_t i, index_t k = 0, index_t c = 0) const
495 std::map<index_t,index_t> inverseOnPatch(const index_t k) const;
[all …]
H A DgsDofMapper.cpp96 void gsDofMapper::matchDof(index_t u, index_t i, in matchDof()
97 index_t v, index_t j, index_t comp) in matchDof()
159 void gsDofMapper::markCoupled(index_t i, index_t k, index_t comp) in markCoupled()
164 void gsDofMapper::markTagged( index_t i, index_t k, index_t comp) in markTagged()
203 void gsDofMapper::eliminateDof( index_t i, index_t k, index_t comp) in eliminateDof()
260 std::map<index_t,index_t> elimDofs; in finalizeComp()
431 void gsDofMapper::replaceDofGlobally(index_t oldIdx, index_t newIdx, index_t comp) in replaceDofGlobally()
449 void gsDofMapper::mergeDofsGlobally(index_t dof1, index_t dof2, index_t comp) in mergeDofsGlobally()
491 std::map<index_t,index_t>
497 std::map<index_t,index_t> inv; in inverseOnPatch()
[all …]
/dports/math/geogram/geogram-1.7.7/src/lib/geogram/mesh/
H A Dmesh.h1208 index_t create_triangle(index_t v1, index_t v2, index_t v3) { in create_triangle()
1226 index_t create_quad(index_t v1, index_t v2, index_t v3, index_t v4) { in create_quad()
1949 index_t facet_vertex(index_t c, index_t lf, index_t lv) const { in facet_vertex()
1976 index_t edge_vertex(index_t c, index_t le, index_t lv) const { in edge_vertex()
2122 index_t v1, index_t v2, index_t v3, index_t v4,
2154 index_t v1, index_t v2, index_t v3, index_t v4,
2234 index_t v1, index_t v2, index_t v3, index_t v4, index_t v5,
2271 index_t v1, index_t v2, index_t v3, index_t v4,
2401 index_t t, index_t lf, index_t lv in tet_facet_vertex()
2426 index_t t, index_t v1, index_t v2, index_t v3 in find_tet_facet()
[all …]
H A Dmesh_AABB.h103 index_t node, index_t b, index_t e in bbox_intersect_recursive()
150 index_t node1, index_t b1, index_t e1, in self_intersect_recursive()
151 index_t node2, index_t b2, index_t e2 in self_intersect_recursive()
219 index_t node1, index_t b1, index_t e1, in other_intersect_recursive()
221 index_t node2, index_t b2, index_t e2 in other_intersect_recursive()
368 i(index_t(-1)), j(index_t(-1)), k(index_t(-1)) in Intersection()
626 index_t n, index_t b, index_t e
646 index_t n, index_t b, index_t e
667 index_t n, index_t b, index_t e, index_t coord
814 index_t n, index_t b, index_t e
[all …]
H A Dmesh_repair.cpp140 index_t* vertices = (index_t*)alloca(nb_vertices*sizeof(index_t)); in facet_is_degenerate()
219 bool is_before(index_t f1, index_t f2) const { in is_before()
250 bool is_same(index_t f1, index_t f2) const { in is_same()
276 bool operator() (index_t f1, index_t f2) const { in operator ()()
297 const Mesh& M, index_t f, vector<index_t>& new_polygon in find_facet_non_duplicated_vertices()
299 index_t first_corner = index_t(-1); in find_facet_non_duplicated_vertices()
318 index_t cur_v = index_t(-1); in find_facet_non_duplicated_vertices()
522 const index_t NON_MANIFOLD=index_t(-2); in repair_connect_facets()
632 Mesh& M, index_t f1, index_t c11, index_t f2 in repair_relative_orientation()
658 Mesh& M, index_t f1, index_t f2 in repair_dissociate()
[all …]
/dports/math/geogram/geogram-1.7.7/src/lib/exploragram/hexdom/
H A Dextra_connectivity.h56 index_t org(index_t corner_id);
57 index_t dest(index_t corner_id);
58 index_t opposite(index_t corner_id);
60 index_t facet(index_t corner_id);
63 index_t next(index_t corner_id);
64 index_t prev(index_t corner_id);
81 index_t org(index_t corner_id);
82 index_t dest(index_t corner_id);
85 index_t facet(index_t corner_id);
91 index_t next(index_t corner_id);
[all …]
/dports/math/geogram/geogram-1.7.7/src/lib/geogram/delaunay/
H A Ddelaunay_3d.h166 index_t& iv0, index_t& iv1, index_t& iv2, index_t& iv3
223 index_t insert(index_t v, index_t hint = NO_TETRAHEDRON);
285 index_t stellate_cavity(index_t v);
308 index_t prev_f=index_t(-1)
712 static index_t tet_facet_vertex(index_t f, index_t v) { in tet_facet_vertex()
753 index_t finite_tet_vertex(index_t t, index_t lv) const { in finite_tet_vertex()
792 void set_tet_adjacent(index_t t1, index_t lf1, index_t t2) { in set_tet_adjacent()
847 index_t a0, index_t a1, index_t a2, index_t a3 in set_tet()
1163 void push(index_t t1, index_t t1fbord, index_t t1fprev) { in push()
1193 index_t& t1, index_t& t1fbord, index_t& t1fprev in get_parameters()
[all …]
H A Ddelaunay_2d.h164 index_t& iv0, index_t& iv1, index_t& iv2
221 index_t insert(index_t v, index_t hint = NO_TRIANGLE);
250 index_t& first, index_t& last
271 index_t& first, index_t& last
398 void add_triangle_to_list(index_t t, index_t& first, index_t& last) { in add_triangle_to_list()
615 static index_t triangle_edge_vertex(index_t e, index_t v) { in triangle_edge_vertex()
656 index_t finite_triangle_vertex(index_t t, index_t lv) const { in finite_triangle_vertex()
695 void set_triangle_adjacent(index_t t1, index_t le1, index_t t2) { in set_triangle_adjacent()
712 index_t t1, index_t t2_in in find_triangle_adjacent()
748 index_t a0, index_t a1, index_t a2 in set_tet()
[all …]
H A Dperiodic_delaunay_3d.cpp218 index_t pool_begin, index_t pool_end, index_t max_used_t = 1 in set_pool()
1161 Sign orient_3d(index_t i, index_t j, index_t k, index_t l) const { in orient_3d()
1177 index_t i, index_t j, index_t k, index_t l in in_circle_3dlifted_SOS()
1223 index_t i, index_t j, index_t k, index_t l, index_t m in orient_3dlifted_SOS()
1788 static index_t tet_facet_vertex(index_t f, index_t v) { in tet_facet_vertex()
2292 index_t& t1, index_t& t1fbord, index_t& t1fprev in get_parameters()
2308 index_t& new_t, index_t& t1ft2, index_t& t2ft1 in get_locals()
2394 index_t v_in, index_t t1, index_t t1fbord, in stellate_conflict_zone_iterative()
3538 index_t t = index_t(-1); in get_incident_tets()
3750 index_t hint = index_t(-1); in insert_vertices()
[all …]
/dports/math/geogram/geogram-1.7.7/src/lib/geogram/points/
H A Dkd_tree.h302 index_t node_index, index_t b, index_t e,
368 index_t n, index_t b, index_t e,
391 index_t node_index, index_t b, index_t e,
475 index_t node_id, index_t b, index_t e in max_node_index()
504 index_t node_index, index_t b, index_t e in create_kd_tree_recursive()
525 index_t node_index, index_t b, index_t e
533 index_t n, index_t b, index_t e,
590 index_t n, index_t b, index_t e,
609 index_t b, index_t e,
629 index_t b, index_t e,
[all …]
/dports/math/geogram/geogram-1.7.7/src/lib/geogram/voronoi/
H A Dgeneric_RVD_cell.h118 index_t v0, index_t v1, index_t v2, in Triangle()
119 index_t f0, index_t f1, index_t f2 in Triangle()
460 index_t t, index_t e, index_t t2 in set_triangle_adjacent()
747 index_t create_triangle(index_t v0, index_t v1, index_t v2) { in create_triangle()
768 index_t v0, index_t v1, index_t v2, in create_triangle()
769 index_t t0, index_t t1, index_t t2 in create_triangle()
793 index_t v0, index_t v1, index_t v2, in set_triangle()
794 index_t t0, index_t t1, index_t t2 in set_triangle()
826 index_t v0, index_t v1, index_t v2, in create_triangle()
827 index_t t0, index_t t1, index_t t2 in create_triangle()
[all …]
/dports/biology/hisat2/hisat2-2.2.1/
H A Drepeat.h50 RepeatCoord(index_t l_tid, index_t l_toff, index_t l_joinedOff, bool l_fw, index_t l_alleleID) : in RepeatCoord()
116 …bool operator()(const pair<RepeatCoord<index_t>, index_t>& a, const pair<RepeatCoord<index_t>, ind… in operator()
123 …bool operator()(const pair<RepeatCoord<index_t>, index_t>& a, const pair<RepeatCoord<index_t>, ind… in operator()
359 bool repeatExist(index_t repID, index_t left, index_t right) const { in repeatExist()
365 pair<index_t, index_t> repeat(left, numeric_limits<index_t>::max()); in repeatExist()
387 pair<index_t, index_t> repeat(left, numeric_limits<index_t>::max());
447 pair<index_t, index_t> repeat(left, numeric_limits<index_t>::max());
520 pair<index_t, index_t> repeat(left, numeric_limits<index_t>::max());
537 pair<index_t, index_t> repeat2(left2, numeric_limits<index_t>::max());
608 pair<index_t, index_t> get_alt_range(const ALTDB<index_t>& altdb, in get_alt_range()
[all …]
H A Dgroup_walk.h154 EList<pair<index_t, index_t> > node_iedge_count;
237 index_t r, in init()
238 index_t e, in init()
239 index_t l) in init()
553 index_t bwrow = (index_t)(top + i + num_iedges); in init()
581 index_t tidx = (index_t)OFF_MASK, tof, tlen; in init()
630 if(off((index_t)i, sa) != (index_t)OFF_MASK) { in init()
633 index_t toff = off((index_t)i, sa); in init()
636 index_t origBwRow = sa.topf + map((index_t)i); in init()
665 index_t bmap = map((index_t)i); in init()
[all …]
/dports/science/conduit/conduit-0.8.0/src/libs/blueprint/
H A Dconduit_blueprint_mesh_utils.hpp130 index_t id, dim, indices;
145 index_t get_num_embedded(const index_t level) const;
149 index_t dim;
205 …void add_entity_assoc(IndexType type, index_t e0_id, index_t e0_dim, index_t e1_id, index_t e1_dim…
207 …const std::vector<index_t> &get_entity_assocs(IndexType type, index_t entity_id, index_t entity_di…
212 index_t get_length(index_t dim = -1) const;
213 index_t get_embed_length(index_t entity_dim, index_t embed_dim) const;
225 std::vector< std::map< std::set<index_t>, index_t > > dim_geid_maps;
258 typedef std::map< index_t, std::vector<index_t> > SubelemMap;
334 void logical_dims(const conduit::Node &n, index_t *d, index_t maxdims);
[all …]
/dports/math/gismo/gismo-21.12.0/extensions/gsKLShell/
H A DgsMaterialMatrix.h409 T _Cijkl (const index_t i, const index_t j, const index_t k, const index_t l) const;
479 _Cijkl_impl(const index_t i, const index_t j, const index_t k, const index_t l) const;
484 _Cijkl_impl(const index_t i, const index_t j, const index_t k, const index_t l) const;
489 _Cijkl_impl(const index_t i, const index_t j, const index_t k, const index_t l) const;
494 _Cijkl_impl(const index_t i, const index_t j, const index_t k, const index_t l) const
500 _Cijkl_impl(const index_t i, const index_t j, const index_t k, const index_t l) const
506 _Cijkl_impl(const index_t i, const index_t j, const index_t k, const index_t l) const;
511 _Cijkl_impl(const index_t i, const index_t j, const index_t k, const index_t l) const;
684 T _d2Psi (const index_t i, const index_t j, const index_t k, const index_t l) const;
877 T _Cabcd (const index_t a, const index_t b, const index_t c, const index_t d) const;
[all …]
/dports/math/geogram/geogram-1.7.7/src/lib/geogram_gfx/GLUP/
H A DGLUP_marching_cells.h118 index_t edge_vertex(index_t e, index_t lv) const { in edge_vertex()
131 index_t config_size(index_t config) const { in config_size()
152 const index_t* config_edges(index_t config) const { in config_edges()
227 void move_to_next(index_t& f, index_t& lv) { in move_to_next()
239 index_t origin_vertex(index_t f, index_t lv) { in origin_vertex()
251 index_t destination_vertex(index_t f, index_t lv) { in destination_vertex()
264 index_t edge(index_t f, index_t lv) { in edge()
279 void move_to_opposite(index_t& f, index_t& lv);
293 bool edge_is_intersected(index_t f, index_t lv, index_t config) { in edge_is_intersected()
326 bool get_first_edge(index_t& f, index_t& lv, index_t config);
[all …]
/dports/misc/py-mxnet/incubator-mxnet-1.9.0/src/operator/contrib/nn/
H A Ddeformable_im2col.h81 index_t h_high; in im2col_bilinear_cpu()
82 index_t w_high; in im2col_bilinear_cpu()
114 const index_t h, const index_t w, in get_gradient_weight_cpu()
124 index_t argmax_h_low = static_cast<index_t>(argmax_h); in get_gradient_weight_cpu()
125 index_t argmax_w_low = static_cast<index_t>(argmax_w); in get_gradient_weight_cpu()
171 index_t argmax_h_low = static_cast<index_t>(argmax_h); in get_coordinate_weight_cpu()
172 index_t argmax_w_low = static_cast<index_t>(argmax_w); in get_coordinate_weight_cpu()
220 const index_t pad_h, const index_t pad_w, in deformable_im2col_cpu()
341 const index_t cur_h = static_cast<index_t>(cur_inv_h_data); in deformable_col2im_cpu()
342 const index_t cur_w = static_cast<index_t>(cur_inv_w_data); in deformable_col2im_cpu()
[all …]
H A Ddeformable_im2col.cuh85 index_t h_high; in deformable_im2col_bilinear()
86 index_t w_high; in deformable_im2col_bilinear()
118 const index_t h, const index_t w, in get_gradient_weight()
128 index_t argmax_h_low = static_cast<index_t>(argmax_h); in get_gradient_weight()
129 index_t argmax_w_low = static_cast<index_t>(argmax_w); in get_gradient_weight()
130 index_t argmax_h_high; in get_gradient_weight()
178 index_t argmax_h_low = static_cast<index_t>(argmax_h); in get_coordinate_weight()
179 index_t argmax_w_low = static_cast<index_t>(argmax_w); in get_coordinate_weight()
364 const index_t cur_h = static_cast<index_t>(cur_inv_h_data); in deformable_col2im_gpu_kernel()
365 const index_t cur_w = static_cast<index_t>(cur_inv_w_data); in deformable_col2im_gpu_kernel()
[all …]
/dports/misc/mxnet/incubator-mxnet-1.9.0/src/operator/contrib/nn/
H A Ddeformable_im2col.h81 index_t h_high; in im2col_bilinear_cpu()
82 index_t w_high; in im2col_bilinear_cpu()
114 const index_t h, const index_t w, in get_gradient_weight_cpu()
124 index_t argmax_h_low = static_cast<index_t>(argmax_h); in get_gradient_weight_cpu()
125 index_t argmax_w_low = static_cast<index_t>(argmax_w); in get_gradient_weight_cpu()
171 index_t argmax_h_low = static_cast<index_t>(argmax_h); in get_coordinate_weight_cpu()
172 index_t argmax_w_low = static_cast<index_t>(argmax_w); in get_coordinate_weight_cpu()
220 const index_t pad_h, const index_t pad_w, in deformable_im2col_cpu()
341 const index_t cur_h = static_cast<index_t>(cur_inv_h_data); in deformable_col2im_cpu()
342 const index_t cur_w = static_cast<index_t>(cur_inv_w_data); in deformable_col2im_cpu()
[all …]
H A Ddeformable_im2col.cuh85 index_t h_high; in deformable_im2col_bilinear()
86 index_t w_high; in deformable_im2col_bilinear()
118 const index_t h, const index_t w, in get_gradient_weight()
128 index_t argmax_h_low = static_cast<index_t>(argmax_h); in get_gradient_weight()
129 index_t argmax_w_low = static_cast<index_t>(argmax_w); in get_gradient_weight()
130 index_t argmax_h_high; in get_gradient_weight()
178 index_t argmax_h_low = static_cast<index_t>(argmax_h); in get_coordinate_weight()
179 index_t argmax_w_low = static_cast<index_t>(argmax_w); in get_coordinate_weight()
364 const index_t cur_h = static_cast<index_t>(cur_inv_h_data); in deformable_col2im_gpu_kernel()
365 const index_t cur_w = static_cast<index_t>(cur_inv_w_data); in deformable_col2im_gpu_kernel()
[all …]
/dports/misc/py-mxnet/incubator-mxnet-1.9.0/src/operator/
H A Dpad.cc47 index_t iStartX = std::max(index_t{0}, -pad_l); in single_image_edge()
48 index_t iStartY = std::max(index_t{0}, -pad_t); in single_image_edge()
49 index_t oStartX = std::max(index_t{0}, pad_l); in single_image_edge()
50 index_t oStartY = std::max(index_t{0}, pad_t); in single_image_edge()
96 index_t iStartX = std::max(index_t{0}, -pad_l); in single_image_edge_grad()
97 index_t iStartY = std::max(index_t{0}, -pad_t); in single_image_edge_grad()
98 index_t oStartX = std::max(index_t{0}, pad_l); in single_image_edge_grad()
99 index_t oStartY = std::max(index_t{0}, pad_t); in single_image_edge_grad()
199 index_t oStartX = std::max(index_t{0}, pad_l); in single_image_reflect()
200 index_t oStartY = std::max(index_t{0}, pad_t); in single_image_reflect()
[all …]
/dports/misc/mxnet/incubator-mxnet-1.9.0/src/operator/
H A Dpad.cc47 index_t iStartX = std::max(index_t{0}, -pad_l); in single_image_edge()
48 index_t iStartY = std::max(index_t{0}, -pad_t); in single_image_edge()
49 index_t oStartX = std::max(index_t{0}, pad_l); in single_image_edge()
50 index_t oStartY = std::max(index_t{0}, pad_t); in single_image_edge()
96 index_t iStartX = std::max(index_t{0}, -pad_l); in single_image_edge_grad()
97 index_t iStartY = std::max(index_t{0}, -pad_t); in single_image_edge_grad()
98 index_t oStartX = std::max(index_t{0}, pad_l); in single_image_edge_grad()
99 index_t oStartY = std::max(index_t{0}, pad_t); in single_image_edge_grad()
199 index_t oStartX = std::max(index_t{0}, pad_l); in single_image_reflect()
200 index_t oStartY = std::max(index_t{0}, pad_t); in single_image_reflect()
[all …]

12345678910>>...79