/dports/archivers/draco/draco-1.4.3/docs/spec/ |
H A D | corner.md | 189 first_c = vertex_corners_[vert]; 190 if (first_c < 0) 192 act_c = SwingLeft(0, first_c); 193 c = first_c; 194 while (act_c >= 0 && act_c != first_c) { 198 if (act_c != first_c) {
|
H A D | attributes.decoder.md | 94 first_c = c; 96 act_c = SwingLeft(curr_att_dec, first_c); 98 first_c = act_c; 102 corner_to_vertex_map_[curr_att_dec][first_c] = first_vert_id; 103 vertex_to_left_most_corner_map_[attr].push_back(first_c); 104 act_c = SwingRight(0, first_c); 105 while (act_c >= 0 && act_c != first_c) {
|
/dports/graphics/blender/blender-2.91.0/extern/draco/dracoenc/src/draco/mesh/ |
H A D | mesh_attribute_corner_table.cc | 151 CornerIndex first_c = c; in RecomputeVerticesInternal() local 158 act_c = SwingLeft(first_c); in RecomputeVerticesInternal() 160 first_c = act_c; in RecomputeVerticesInternal() 164 corner_to_vertex_map_[first_c.value()] = VertexIndex(first_vert_id.value()); in RecomputeVerticesInternal() 165 vertex_to_left_most_corner_map_.push_back(first_c); in RecomputeVerticesInternal() 166 act_c = corner_table_->SwingRight(first_c); in RecomputeVerticesInternal() 167 while (act_c != kInvalidCornerIndex && act_c != first_c) { in RecomputeVerticesInternal()
|
H A D | corner_table.h | 275 const CornerIndex first_c = vertex_corners_[vert]; in UpdateVertexToCornerMap() local 276 if (first_c == kInvalidCornerIndex) in UpdateVertexToCornerMap() 278 CornerIndex act_c = SwingLeft(first_c); in UpdateVertexToCornerMap() 279 CornerIndex c = first_c; in UpdateVertexToCornerMap() 280 while (act_c != kInvalidCornerIndex && act_c != first_c) { in UpdateVertexToCornerMap() 284 if (act_c != first_c) { in UpdateVertexToCornerMap()
|
H A D | corner_table.cc | 226 CornerIndex first_c = c; in BreakNonManifoldEdges() local 230 next_c != first_c && next_c != kInvalidCornerIndex && in BreakNonManifoldEdges() 235 first_c = current_c; in BreakNonManifoldEdges() 297 } while (current_c != first_c && current_c != kInvalidCornerIndex); in BreakNonManifoldEdges()
|
/dports/archivers/draco/draco-1.4.3/src/draco/mesh/ |
H A D | mesh_attribute_corner_table.cc | 159 CornerIndex first_c = c; in RecomputeVerticesInternal() local 166 act_c = SwingLeft(first_c); in RecomputeVerticesInternal() 168 first_c = act_c; in RecomputeVerticesInternal() 172 corner_to_vertex_map_[first_c.value()] = VertexIndex(first_vert_id.value()); in RecomputeVerticesInternal() 173 vertex_to_left_most_corner_map_.push_back(first_c); in RecomputeVerticesInternal() 174 act_c = corner_table_->SwingRight(first_c); in RecomputeVerticesInternal() 175 while (act_c != kInvalidCornerIndex && act_c != first_c) { in RecomputeVerticesInternal()
|
H A D | corner_table.h | 303 const CornerIndex first_c = vertex_corners_[vert]; in UpdateVertexToCornerMap() local 304 if (first_c == kInvalidCornerIndex) { in UpdateVertexToCornerMap() 307 CornerIndex act_c = SwingLeft(first_c); in UpdateVertexToCornerMap() 308 CornerIndex c = first_c; in UpdateVertexToCornerMap() 309 while (act_c != kInvalidCornerIndex && act_c != first_c) { in UpdateVertexToCornerMap() 313 if (act_c != first_c) { in UpdateVertexToCornerMap()
|
H A D | corner_table.cc | 239 CornerIndex first_c = c; in BreakNonManifoldEdges() local 243 next_c != first_c && next_c != kInvalidCornerIndex && in BreakNonManifoldEdges() 248 first_c = current_c; in BreakNonManifoldEdges() 312 } while (current_c != first_c && current_c != kInvalidCornerIndex); in BreakNonManifoldEdges()
|
/dports/multimedia/assimp/assimp-5.1.3/contrib/draco/src/draco/mesh/ |
H A D | mesh_attribute_corner_table.cc | 159 CornerIndex first_c = c; in RecomputeVerticesInternal() local 166 act_c = SwingLeft(first_c); in RecomputeVerticesInternal() 168 first_c = act_c; in RecomputeVerticesInternal() 172 corner_to_vertex_map_[first_c.value()] = VertexIndex(first_vert_id.value()); in RecomputeVerticesInternal() 173 vertex_to_left_most_corner_map_.push_back(first_c); in RecomputeVerticesInternal() 174 act_c = corner_table_->SwingRight(first_c); in RecomputeVerticesInternal() 175 while (act_c != kInvalidCornerIndex && act_c != first_c) { in RecomputeVerticesInternal()
|
H A D | corner_table.h | 303 const CornerIndex first_c = vertex_corners_[vert]; in UpdateVertexToCornerMap() local 304 if (first_c == kInvalidCornerIndex) { in UpdateVertexToCornerMap() 307 CornerIndex act_c = SwingLeft(first_c); in UpdateVertexToCornerMap() 308 CornerIndex c = first_c; in UpdateVertexToCornerMap() 309 while (act_c != kInvalidCornerIndex && act_c != first_c) { in UpdateVertexToCornerMap() 313 if (act_c != first_c) { in UpdateVertexToCornerMap()
|
H A D | corner_table.cc | 239 CornerIndex first_c = c; in BreakNonManifoldEdges() local 243 next_c != first_c && next_c != kInvalidCornerIndex && in BreakNonManifoldEdges() 248 first_c = current_c; in BreakNonManifoldEdges() 312 } while (current_c != first_c && current_c != kInvalidCornerIndex); in BreakNonManifoldEdges()
|
/dports/misc/mxnet/incubator-mxnet-1.9.0/example/image-classification/symbols/ |
H A D | mobilenetv2.py | 160 first_c = int(round(self.config_map['firstconv_filter_num']*self.multiplier)) 163 num_filter=first_c, 171 in_c = first_c
|
/dports/misc/py-mxnet/incubator-mxnet-1.9.0/example/image-classification/symbols/ |
H A D | mobilenetv2.py | 160 first_c = int(round(self.config_map['firstconv_filter_num']*self.multiplier)) 163 num_filter=first_c, 171 in_c = first_c
|
/dports/cad/PrusaSlicer/PrusaSlicer-version_2.3.3/src/libigl/igl/ |
H A D | flip_edge.cpp | 132 const size_t first_c = adj_faces[0] / num_faces; in flip_edge() local 135 const size_t vertex_0 = F(first_f, (first_c+1) % 3); in flip_edge() 136 const size_t vertex_1 = F(first_f, (first_c+2) % 3); in flip_edge()
|
/dports/devel/aws-c-http/aws-c-http-0.6.8/source/ |
H A D | strutil.c | 211 const uint8_t first_c = cursor.ptr[0]; in aws_strutil_is_http_field_value() local 213 if (s_http_whitespace_table[first_c] || s_http_whitespace_table[last_c]) { in aws_strutil_is_http_field_value()
|
/dports/www/firefox/firefox-99.0/third_party/jpeg-xl/lib/jxl/render_pipeline/ |
H A D | stage_noise.cc | 142 const ColorCorrelationMap& cmap, size_t first_c) in AddNoiseStage() argument 147 first_c_(first_c) {} in AddNoiseStage() 223 explicit ConvolveNoiseStage(size_t first_c) in ConvolveNoiseStage() argument 226 first_c_(first_c) {} in ConvolveNoiseStage()
|
/dports/graphics/wings/libigl-2.1.0/include/igl/ |
H A D | flip_edge.cpp | 140 const size_t first_c = adj_faces[0] / num_faces; in flip_edge() local 143 const size_t vertex_0 = F(first_f, (first_c+1) % 3); in flip_edge() 144 const size_t vertex_1 = F(first_f, (first_c+2) % 3); in flip_edge()
|
/dports/biology/py-ete3/ete3-3.1.2/ete3/treeview/ |
H A D | qt4_circular_render.py | 220 first_c = n2i[node.children[0]] 274 first_c = n2i[node.children[0]] 276 rot_start = first_c.rotation 279 item.full_start = first_c.full_start
|
/dports/textproc/zorba/zorba-2.7.0/src/util/ |
H A D | json_parser.cpp | 313 token::type lexer::parse_literal( char first_c, token::value_type *value ) { in parse_literal() argument 319 switch ( first_c ) { in parse_literal() 337 void lexer::parse_number( char first_c, token::value_type *value ) { in parse_number() argument 341 char c = first_c; in parse_number()
|
/dports/devel/grex/grex-1.3.0/src/ast/ |
H A D | format.rs | 105 for ((first_c, first_pos), (second_c, second_pos)) in in format_character_class() 109 subset.push(first_c); in format_character_class()
|
/dports/x11/xnee/xnee-3.19/libxnee/src/ |
H A D | xnee_expr.c | 875 char first_c ; in xnee_is_replayable() local 877 first_c = tmp[0]; in xnee_is_replayable() 881 if ( ( first_c >= '0' ) && ( first_c<='3' ) ) in xnee_is_replayable()
|
/dports/math/geogram/geogram-1.7.7/src/lib/geogram/voronoi/ |
H A D | generic_RVD_cell.cpp | 371 Corner first_c( in convert_to_mesh() local 374 Corner c = first_c; in convert_to_mesh() 378 } while(c != first_c); in convert_to_mesh()
|
/dports/games/xmahjongg/xmahjongg-3.7/liblcdf/ |
H A D | string.cc | 351 int first_c = (unsigned char)s[0]; in find_left() local 353 for (pos = find_left(first_c, pos); pos >= 0 && pos <= max_pos; in find_left() 354 pos = find_left(first_c, pos + 1)) in find_left()
|
/dports/math/cgal/CGAL-5.3/include/CGAL/Partition_2/ |
H A D | partition_approx_convex_2.h | 144 Circulator first_c(polygon.begin(), polygon.end(), polygon.begin()); in partition_approx_convex_2() 155 } while (++c != first_c); in partition_approx_convex_2()
|
/dports/emulators/xbraitenberg/xbraitenberg-0.9/ |
H A D | string.cc | 417 int first_c = (unsigned char)s[0]; in find_left() local 419 for (pos = find_left(first_c, pos); pos >= 0 && pos <= max_pos; in find_left() 420 pos = find_left(first_c, pos + 1)) in find_left()
|