Home
last modified time | relevance | path

Searched refs:intersection_count (Results 1 – 17 of 17) sorted by relevance

/dports/cad/cura/Cura-58bae31/resources/shaders/
H A Dxray_composite.shader73 …float intersection_count = texture2D(u_layer2, v_uvs).r * 51.0; // (1 / .02) + 1 (+1 magically fix…
74 float rest = mod(intersection_count + .01, 2.0);
75 if (rest > 1.0 && rest < 1.5 && intersection_count < 49.0)
167 …float intersection_count = texture(u_layer2, v_uvs).r * 51; // (1 / .02) + 1 (+1 magically fixes i…
168 float rest = mod(intersection_count + .01, 2.0);
169 if (rest > 1.0 && rest < 1.5 && intersection_count < 49)
/dports/games/cave9/cave9-e6896eb/src/
H A Dgame.c354 int intersection_count[4]; in collision() local
355 memset(intersection_count, 0, sizeof(intersection_count)); in collision()
398 ++intersection_count[0]; in collision()
401 ++intersection_count[1]; in collision()
404 ++intersection_count[2]; in collision()
407 ++intersection_count[3]; in collision()
417 if(intersection_count[i] % 2 == 0) { in collision()
/dports/graphics/gegl/gegl-0.4.34/subprojects/poly2tri-c/poly2tri-c/refine/
H A Dvisibility.c285 gint intersection_count = 0, inside_count = 0; in LineIsOutsidePolygon() local
291 if (++intersection_count > 2) in LineIsOutsidePolygon()
303 if (intersection_count == 2) in LineIsOutsidePolygon()
308 else if (intersection_count == 1) in LineIsOutsidePolygon()
/dports/x11/xscreensaver/xscreensaver-5.44/hacks/
H A Dinteraggregate.c209 int intersection_count; member
244 f->intersection_count = 0; in init_field()
755 ++f->intersection_count; in drawIntersections()
936 f->intersection_count, f->possible_intersections, in interaggregate_draw()
937 ((double)f->intersection_count) / in interaggregate_draw()
941 ((double)frames) / f->intersection_count ); in interaggregate_draw()
947 f->intersection_count = f->possible_intersections = 0; in interaggregate_draw()
/dports/science/py-geometer/geometer-0.2.3/geometer/
H A Dshapes.py368 intersection_count = 0
383 intersection_count += 1
385 return intersection_count % 2 == 1
/dports/games/abstreet/abstreet-0.2.9-49-g74aca40c0/cargo-crates/lyon_geom-0.15.3/src/
H A Dcubic_bezier_intersections.rs756 intersection_count: i32, in do_test()
758 do_test_once(curve1, curve2, intersection_count); in do_test()
759 do_test_once(curve2, curve1, intersection_count); in do_test()
766 intersection_count: i32, in do_test_once()
775 assert_eq!(intersections.len() as i32, intersection_count); in do_test_once()
/dports/textproc/cast2gif/cast2gif-0.1.0/cargo-crates/lyon_geom-0.15.2/src/
H A Dcubic_bezier_intersections.rs756 intersection_count: i32, in do_test()
758 do_test_once(curve1, curve2, intersection_count); in do_test()
759 do_test_once(curve2, curve1, intersection_count); in do_test()
766 intersection_count: i32, in do_test_once()
775 assert_eq!(intersections.len() as i32, intersection_count); in do_test_once()
/dports/science/rdkit/rdkit-Release_2021_03_5/External/RingFamilies/RingDecomposerLib/src/RingDecomposerLib/
H A DRDLtesting.c235 unsigned i, j, k, ring1_count, ring2_count, intersection_count, in RDL_calculate_pairwise_family() local
281 intersection_count = 0; in RDL_calculate_pairwise_family()
284 ++intersection_count; in RDL_calculate_pairwise_family()
287 if (intersection_count == 0) { in RDL_calculate_pairwise_family()
/dports/graphics/cairo/cairo-1.17.4/src/
H A Dcairo-bentley-ottmann.c1280 int intersection_count = 0; in _cairo_bentley_ottmann_tessellate_bo_edges() local
1422 intersection_count++; in _cairo_bentley_ottmann_tessellate_bo_edges()
1447 *num_intersections = intersection_count; in _cairo_bentley_ottmann_tessellate_bo_edges()
/dports/www/firefox-esr/firefox-91.8.0/gfx/cairo/cairo/src/
H A Dcairo-bentley-ottmann.c1280 int intersection_count = 0; in _cairo_bentley_ottmann_tessellate_bo_edges() local
1422 intersection_count++; in _cairo_bentley_ottmann_tessellate_bo_edges()
1447 *num_intersections = intersection_count; in _cairo_bentley_ottmann_tessellate_bo_edges()
/dports/www/firefox/firefox-99.0/gfx/cairo/cairo/src/
H A Dcairo-bentley-ottmann.c1280 int intersection_count = 0; in _cairo_bentley_ottmann_tessellate_bo_edges() local
1422 intersection_count++; in _cairo_bentley_ottmann_tessellate_bo_edges()
1447 *num_intersections = intersection_count; in _cairo_bentley_ottmann_tessellate_bo_edges()
/dports/mail/thunderbird/thunderbird-91.8.0/gfx/cairo/cairo/src/
H A Dcairo-bentley-ottmann.c1280 int intersection_count = 0; in _cairo_bentley_ottmann_tessellate_bo_edges() local
1422 intersection_count++; in _cairo_bentley_ottmann_tessellate_bo_edges()
1447 *num_intersections = intersection_count; in _cairo_bentley_ottmann_tessellate_bo_edges()
/dports/games/libretro-2048/libretro-2048-35a299c/cairo/src/
H A Dcairo-bentley-ottmann.c1534 int intersection_count = 0; in _cairo_bentley_ottmann_tessellate_bo_edges() local
1676 intersection_count++; in _cairo_bentley_ottmann_tessellate_bo_edges()
1701 *num_intersections = intersection_count; in _cairo_bentley_ottmann_tessellate_bo_edges()
/dports/lang/spidermonkey78/firefox-78.9.0/gfx/cairo/cairo/src/
H A Dcairo-bentley-ottmann.c1534 int intersection_count = 0; in _cairo_bentley_ottmann_tessellate_bo_edges() local
1676 intersection_count++; in _cairo_bentley_ottmann_tessellate_bo_edges()
1701 *num_intersections = intersection_count; in _cairo_bentley_ottmann_tessellate_bo_edges()
/dports/lang/spidermonkey60/firefox-60.9.0/gfx/cairo/cairo/src/
H A Dcairo-bentley-ottmann.c1534 int intersection_count = 0; in _cairo_bentley_ottmann_tessellate_bo_edges() local
1676 intersection_count++; in _cairo_bentley_ottmann_tessellate_bo_edges()
1701 *num_intersections = intersection_count; in _cairo_bentley_ottmann_tessellate_bo_edges()
/dports/www/firefox-legacy/firefox-52.8.0esr/gfx/cairo/cairo/src/
H A Dcairo-bentley-ottmann.c1534 int intersection_count = 0; in _cairo_bentley_ottmann_tessellate_bo_edges() local
1676 intersection_count++; in _cairo_bentley_ottmann_tessellate_bo_edges()
1701 *num_intersections = intersection_count; in _cairo_bentley_ottmann_tessellate_bo_edges()
/dports/cad/PrusaSlicer/PrusaSlicer-version_2.3.3/src/libslic3r/GCode/
H A DAvoidCrossingPerimeters.cpp454 const size_t intersection_count) in need_wipe() argument
463 if (intersection_count > 0) { in need_wipe()