/dports/databases/percona57-server/boost_1_59_0/libs/geometry/test/strategies/ |
H A D | crossings_multiply.cpp | 25 std::string const triangle = "POLYGON((0 0,0 4,6 0,0 0))"; in test_all() local 47 test_geometry<Point, polygon>("t1", "POINT(1 1)", triangle, s, true); in test_all() 48 test_geometry<Point, polygon>("t2", "POINT(3 3)", triangle, s, false); in test_all() 50 test_geometry<Point, polygon>("t3a", "POINT(0 0)", triangle, s, false); in test_all() 51 test_geometry<Point, polygon>("t3b", "POINT(0 4)", triangle, s, true); // diff in test_all() 52 test_geometry<Point, polygon>("t3c", "POINT(5 0)", triangle, s, false); in test_all() 54 test_geometry<Point, polygon>("t4a", "POINT(0 2)", triangle, s, false); in test_all() 55 test_geometry<Point, polygon>("t4b", "POINT(3 2)", triangle, s, false); in test_all() 56 test_geometry<Point, polygon>("t4c", "POINT(2 0)", triangle, s, false); in test_all()
|
H A D | franklin.cpp | 25 std::string const triangle = "POLYGON((0 0,0 4,6 0,0 0))"; in test_all() local 46 test_geometry<Point, polygon>("t1", "POINT(1 1)", triangle, s, true); in test_all() 47 test_geometry<Point, polygon>("t2", "POINT(3 3)", triangle, s, false); in test_all() 49 test_geometry<Point, polygon>("t3a", "POINT(0 0)", triangle, s, true); // diff in test_all() 50 test_geometry<Point, polygon>("t3b", "POINT(0 4)", triangle, s, false); in test_all() 51 test_geometry<Point, polygon>("t3c", "POINT(5 0)", triangle, s, true); // diff in test_all() 53 test_geometry<Point, polygon>("t4a", "POINT(0 2)", triangle, s, true); // diff in test_all() 54 test_geometry<Point, polygon>("t4b", "POINT(3 2)", triangle, s, false); in test_all() 55 test_geometry<Point, polygon>("t4c", "POINT(2 0)", triangle, s, true); // diff in test_all()
|
/dports/databases/xtrabackup/boost_1_59_0/libs/geometry/test/strategies/ |
H A D | franklin.cpp | 25 std::string const triangle = "POLYGON((0 0,0 4,6 0,0 0))"; in test_all() local 46 test_geometry<Point, polygon>("t1", "POINT(1 1)", triangle, s, true); in test_all() 47 test_geometry<Point, polygon>("t2", "POINT(3 3)", triangle, s, false); in test_all() 49 test_geometry<Point, polygon>("t3a", "POINT(0 0)", triangle, s, true); // diff in test_all() 50 test_geometry<Point, polygon>("t3b", "POINT(0 4)", triangle, s, false); in test_all() 51 test_geometry<Point, polygon>("t3c", "POINT(5 0)", triangle, s, true); // diff in test_all() 53 test_geometry<Point, polygon>("t4a", "POINT(0 2)", triangle, s, true); // diff in test_all() 54 test_geometry<Point, polygon>("t4b", "POINT(3 2)", triangle, s, false); in test_all() 55 test_geometry<Point, polygon>("t4c", "POINT(2 0)", triangle, s, true); // diff in test_all()
|
H A D | crossings_multiply.cpp | 25 std::string const triangle = "POLYGON((0 0,0 4,6 0,0 0))"; in test_all() local 47 test_geometry<Point, polygon>("t1", "POINT(1 1)", triangle, s, true); in test_all() 48 test_geometry<Point, polygon>("t2", "POINT(3 3)", triangle, s, false); in test_all() 50 test_geometry<Point, polygon>("t3a", "POINT(0 0)", triangle, s, false); in test_all() 51 test_geometry<Point, polygon>("t3b", "POINT(0 4)", triangle, s, true); // diff in test_all() 52 test_geometry<Point, polygon>("t3c", "POINT(5 0)", triangle, s, false); in test_all() 54 test_geometry<Point, polygon>("t4a", "POINT(0 2)", triangle, s, false); in test_all() 55 test_geometry<Point, polygon>("t4b", "POINT(3 2)", triangle, s, false); in test_all() 56 test_geometry<Point, polygon>("t4c", "POINT(2 0)", triangle, s, false); in test_all()
|
/dports/databases/percona57-client/boost_1_59_0/libs/geometry/test/strategies/ |
H A D | crossings_multiply.cpp | 25 std::string const triangle = "POLYGON((0 0,0 4,6 0,0 0))"; in test_all() local 47 test_geometry<Point, polygon>("t1", "POINT(1 1)", triangle, s, true); in test_all() 48 test_geometry<Point, polygon>("t2", "POINT(3 3)", triangle, s, false); in test_all() 50 test_geometry<Point, polygon>("t3a", "POINT(0 0)", triangle, s, false); in test_all() 51 test_geometry<Point, polygon>("t3b", "POINT(0 4)", triangle, s, true); // diff in test_all() 52 test_geometry<Point, polygon>("t3c", "POINT(5 0)", triangle, s, false); in test_all() 54 test_geometry<Point, polygon>("t4a", "POINT(0 2)", triangle, s, false); in test_all() 55 test_geometry<Point, polygon>("t4b", "POINT(3 2)", triangle, s, false); in test_all() 56 test_geometry<Point, polygon>("t4c", "POINT(2 0)", triangle, s, false); in test_all()
|
H A D | franklin.cpp | 25 std::string const triangle = "POLYGON((0 0,0 4,6 0,0 0))"; in test_all() local 46 test_geometry<Point, polygon>("t1", "POINT(1 1)", triangle, s, true); in test_all() 47 test_geometry<Point, polygon>("t2", "POINT(3 3)", triangle, s, false); in test_all() 49 test_geometry<Point, polygon>("t3a", "POINT(0 0)", triangle, s, true); // diff in test_all() 50 test_geometry<Point, polygon>("t3b", "POINT(0 4)", triangle, s, false); in test_all() 51 test_geometry<Point, polygon>("t3c", "POINT(5 0)", triangle, s, true); // diff in test_all() 53 test_geometry<Point, polygon>("t4a", "POINT(0 2)", triangle, s, true); // diff in test_all() 54 test_geometry<Point, polygon>("t4b", "POINT(3 2)", triangle, s, false); in test_all() 55 test_geometry<Point, polygon>("t4c", "POINT(2 0)", triangle, s, true); // diff in test_all()
|
/dports/devel/boost-libs/boost_1_72_0/libs/geometry/test/strategies/ |
H A D | franklin.cpp | 25 std::string const triangle = "POLYGON((0 0,0 4,6 0,0 0))"; in test_all() local 46 test_geometry<Point, polygon>("t1", "POINT(1 1)", triangle, s, true); in test_all() 47 test_geometry<Point, polygon>("t2", "POINT(3 3)", triangle, s, false); in test_all() 49 test_geometry<Point, polygon>("t3a", "POINT(0 0)", triangle, s, true); // diff in test_all() 50 test_geometry<Point, polygon>("t3b", "POINT(0 4)", triangle, s, false); in test_all() 51 test_geometry<Point, polygon>("t3c", "POINT(5 0)", triangle, s, true); // diff in test_all() 53 test_geometry<Point, polygon>("t4a", "POINT(0 2)", triangle, s, true); // diff in test_all() 54 test_geometry<Point, polygon>("t4b", "POINT(3 2)", triangle, s, false); in test_all() 55 test_geometry<Point, polygon>("t4c", "POINT(2 0)", triangle, s, true); // diff in test_all()
|
H A D | crossings_multiply.cpp | 25 std::string const triangle = "POLYGON((0 0,0 4,6 0,0 0))"; in test_all() local 47 test_geometry<Point, polygon>("t1", "POINT(1 1)", triangle, s, true); in test_all() 48 test_geometry<Point, polygon>("t2", "POINT(3 3)", triangle, s, false); in test_all() 50 test_geometry<Point, polygon>("t3a", "POINT(0 0)", triangle, s, false); in test_all() 51 test_geometry<Point, polygon>("t3b", "POINT(0 4)", triangle, s, true); // diff in test_all() 52 test_geometry<Point, polygon>("t3c", "POINT(5 0)", triangle, s, false); in test_all() 54 test_geometry<Point, polygon>("t4a", "POINT(0 2)", triangle, s, false); in test_all() 55 test_geometry<Point, polygon>("t4b", "POINT(3 2)", triangle, s, false); in test_all() 56 test_geometry<Point, polygon>("t4c", "POINT(2 0)", triangle, s, false); in test_all()
|
/dports/devel/hyperscan/boost_1_75_0/libs/geometry/test/strategies/ |
H A D | franklin.cpp | 25 std::string const triangle = "POLYGON((0 0,0 4,6 0,0 0))"; in test_all() local 46 test_geometry<Point, polygon>("t1", "POINT(1 1)", triangle, s, true); in test_all() 47 test_geometry<Point, polygon>("t2", "POINT(3 3)", triangle, s, false); in test_all() 49 test_geometry<Point, polygon>("t3a", "POINT(0 0)", triangle, s, true); // diff in test_all() 50 test_geometry<Point, polygon>("t3b", "POINT(0 4)", triangle, s, false); in test_all() 51 test_geometry<Point, polygon>("t3c", "POINT(5 0)", triangle, s, true); // diff in test_all() 53 test_geometry<Point, polygon>("t4a", "POINT(0 2)", triangle, s, true); // diff in test_all() 54 test_geometry<Point, polygon>("t4b", "POINT(3 2)", triangle, s, false); in test_all() 55 test_geometry<Point, polygon>("t4c", "POINT(2 0)", triangle, s, true); // diff in test_all()
|
H A D | crossings_multiply.cpp | 25 std::string const triangle = "POLYGON((0 0,0 4,6 0,0 0))"; in test_all() local 47 test_geometry<Point, polygon>("t1", "POINT(1 1)", triangle, s, true); in test_all() 48 test_geometry<Point, polygon>("t2", "POINT(3 3)", triangle, s, false); in test_all() 50 test_geometry<Point, polygon>("t3a", "POINT(0 0)", triangle, s, false); in test_all() 51 test_geometry<Point, polygon>("t3b", "POINT(0 4)", triangle, s, true); // diff in test_all() 52 test_geometry<Point, polygon>("t3c", "POINT(5 0)", triangle, s, false); in test_all() 54 test_geometry<Point, polygon>("t4a", "POINT(0 2)", triangle, s, false); in test_all() 55 test_geometry<Point, polygon>("t4b", "POINT(3 2)", triangle, s, false); in test_all() 56 test_geometry<Point, polygon>("t4c", "POINT(2 0)", triangle, s, false); in test_all()
|
/dports/deskutils/genius/genius-1.0.27/gtkextra/ |
H A D | gtkplotcsurface.c | 991 GtkPlotDTtriangle *triangle; in gtk_plot_csurface_real_draw_polygons() local 1020 triangle = polygon->t; in gtk_plot_csurface_real_draw_polygons() 1239 polygon->t = triangle; in sides_cut_level() 1248 polygon->t = triangle; in sides_cut_level() 1266 if(!triangle || !triangle->na || !triangle->nb || !triangle->nc) return NULL; in triangle_cuts_level() 1267 points[0].x = triangle->na->x; in triangle_cuts_level() 1320 if(!triangle || !triangle->na || !triangle->nb || !triangle->nc) in gtk_plot_csurface_build_polygons() 1505 triangle->visited = FALSE; in gtk_plot_csurface_build_contours() 1517 if(!triangle->visited){ in gtk_plot_csurface_build_contours() 1548 if(!triangle->visited){ in gtk_plot_csurface_build_contours() [all …]
|
/dports/audio/lenticular-lv2/lenticular_lv2-0.5.0-14-g14d8075/parasites/warps/test/ |
H A D | warps_test.cc | 124 float triangle = wav_writer.triangle(); in TestModulator() local 133 p->modulation_parameter = 0.0f + 1.0f * triangle; in TestModulator() 181 p->raw_algorithm_pot = 1.0f + 0.0f * triangle + 0.0f * square; in TestEasterEgg() 235 float triangle = wav_writer.triangle(); in TestOscillators() local 236 p->note = 20 + triangle * 0; in TestOscillators() 303 float triangle = wav_writer.triangle(); in TestSineTransition() local 307 p->modulation_algorithm = 0.0f + 0.125f * triangle; in TestSineTransition() 335 float triangle = wav_writer.triangle(); in TestGain() local 338 p->channel_drive[0] = triangle * 1.0f; in TestGain() 367 float triangle = wav_writer.triangle(); in TestQuadratureOscillator() local [all …]
|
/dports/audio/lenticular-lv2/lenticular_lv2-0.5.0-14-g14d8075/parasites/braids/ |
H A D | analog_oscillator.cc | 434 int16_t triangle; in RenderTriangle() local 444 triangle += 32768; in RenderTriangle() 445 *buffer = triangle >> 1; in RenderTriangle() 450 triangle += 32768; in RenderTriangle() 491 int16_t triangle; in RenderTriangleFold() local 502 triangle += 32768; in RenderTriangleFold() 503 triangle = triangle * gain >> 15; in RenderTriangleFold() 504 triangle = Interpolate88(ws_tri_fold, triangle + 32768); in RenderTriangleFold() 510 triangle += 32768; in RenderTriangleFold() 511 triangle = triangle * gain >> 15; in RenderTriangleFold() [all …]
|
/dports/audio/lenticular-lv2/lenticular_lv2-0.5.0-14-g14d8075/eurorack/braids/ |
H A D | analog_oscillator.cc | 434 int16_t triangle; in RenderTriangle() local 444 triangle += 32768; in RenderTriangle() 445 *buffer = triangle >> 1; in RenderTriangle() 450 triangle += 32768; in RenderTriangle() 491 int16_t triangle; in RenderTriangleFold() local 502 triangle += 32768; in RenderTriangleFold() 503 triangle = triangle * gain >> 15; in RenderTriangleFold() 504 triangle = Interpolate88(ws_tri_fold, triangle + 32768); in RenderTriangleFold() 510 triangle += 32768; in RenderTriangleFold() 511 triangle = triangle * gain >> 15; in RenderTriangleFold() [all …]
|
/dports/lang/fpc-source/fpc-3.2.2/packages/libndsfpc/examples/input/Touch_Pad/touch_look/ |
H A D | touchLook.pp | 38 triangle: PTRIANGLE; 80 x_m := sector1.triangle[loop_m].vertex[0].x; 81 y_m := sector1.triangle[loop_m].vertex[0].y; 82 z_m := sector1.triangle[loop_m].vertex[0].z; 83 u_m := sector1.triangle[loop_m].vertex[0].u; 84 v_m := sector1.triangle[loop_m].vertex[0].v; 87 x_m := sector1.triangle[loop_m].vertex[1].x; 88 y_m := sector1.triangle[loop_m].vertex[1].y; 89 z_m := sector1.triangle[loop_m].vertex[1].z; 90 u_m := sector1.triangle[loop_m].vertex[1].u; [all …]
|
/dports/math/poly2tri/poly2tri-e6e63dd29ef0805b3e40fe1832c2f1fe2307943a/poly2tri/sweep/ |
H A D | sweep.cc | 123 triangle = &triangle->NeighborAcross(point); in EdgeEvent() 140 triangle = &triangle->NeighborAcross(point); in EdgeEvent() 153 triangle = triangle->NeighborCCW(point); in EdgeEvent() 155 triangle = triangle->NeighborCW(point); in EdgeEvent() 183 triangle->MarkNeighbor(*node.triangle); in NewFrontTriangle() 184 tcx.AddToMap(triangle); in NewFrontTriangle() 194 if (!Legalize(tcx, *triangle)) { in NewFrontTriangle() 207 triangle->MarkNeighbor(*node.prev->triangle); in Fill() 208 triangle->MarkNeighbor(*node.triangle); in Fill() 210 tcx.AddToMap(triangle); in Fill() [all …]
|
/dports/cad/repsnapper/repsnapper-2.5a4/libraries/poly2tri/poly2tri/poly2tri/sweep/ |
H A D | sweep.cc | 121 triangle = &triangle->NeighborAcross(point); in EdgeEvent() 138 triangle = &triangle->NeighborAcross(point); in EdgeEvent() 151 triangle = triangle->NeighborCCW(point); in EdgeEvent() 153 triangle = triangle->NeighborCW(point); in EdgeEvent() 181 triangle->MarkNeighbor(*node.triangle); in NewFrontTriangle() 182 tcx.AddToMap(triangle); in NewFrontTriangle() 192 if (!Legalize(tcx, *triangle)) { in NewFrontTriangle() 205 triangle->MarkNeighbor(*node.prev->triangle); in Fill() 206 triangle->MarkNeighbor(*node.triangle); in Fill() 208 tcx.AddToMap(triangle); in Fill() [all …]
|
/dports/devel/upp/upp/bazaar/plugin/assimp/contrib/poly2tri/poly2tri/sweep/ |
H A D | sweep.cc | 123 triangle = &triangle->NeighborAcross(point); in EdgeEvent() 143 triangle = &triangle->NeighborAcross(point); in EdgeEvent() 156 triangle = triangle->NeighborCCW(point); in EdgeEvent() 158 triangle = triangle->NeighborCW(point); in EdgeEvent() 186 triangle->MarkNeighbor(*node.triangle); in NewFrontTriangle() 187 tcx.AddToMap(triangle); in NewFrontTriangle() 197 if (!Legalize(tcx, *triangle)) { in NewFrontTriangle() 210 triangle->MarkNeighbor(*node.prev->triangle); in Fill() 211 triangle->MarkNeighbor(*node.triangle); in Fill() 213 tcx.AddToMap(triangle); in Fill() [all …]
|
/dports/graphics/wdune/wdune-1.926/src/ |
H A D | sweep.cpp | 121 triangle = &triangle->NeighborAcross(point); in EdgeEvent() 138 triangle = &triangle->NeighborAcross(point); in EdgeEvent() 151 triangle = triangle->NeighborCCW(point); in EdgeEvent() 153 triangle = triangle->NeighborCW(point); in EdgeEvent() 181 triangle->MarkNeighbor(*node.triangle); in NewFrontTriangle() 182 tcx.AddToMap(triangle); in NewFrontTriangle() 192 if (!Legalize(tcx, *triangle)) { in NewFrontTriangle() 205 triangle->MarkNeighbor(*node.prev->triangle); in Fill() 206 triangle->MarkNeighbor(*node.triangle); in Fill() 208 tcx.AddToMap(triangle); in Fill() [all …]
|
/dports/multimedia/assimp/assimp-5.1.3/contrib/poly2tri/poly2tri/sweep/ |
H A D | sweep.cc | 128 triangle = &triangle->NeighborAcross(point); in EdgeEvent() 148 triangle = &triangle->NeighborAcross(point); in EdgeEvent() 161 triangle = triangle->NeighborCCW(point); in EdgeEvent() 163 triangle = triangle->NeighborCW(point); in EdgeEvent() 191 triangle->MarkNeighbor(*node.triangle); in NewFrontTriangle() 192 tcx.AddToMap(triangle); in NewFrontTriangle() 202 if (!Legalize(tcx, *triangle)) { in NewFrontTriangle() 215 triangle->MarkNeighbor(*node.prev->triangle); in Fill() 216 triangle->MarkNeighbor(*node.triangle); in Fill() 218 tcx.AddToMap(triangle); in Fill() [all …]
|
/dports/cad/PrusaSlicer/PrusaSlicer-version_2.3.3/src/poly2tri/sweep/ |
H A D | sweep.cc | 123 triangle = &triangle->NeighborAcross(point); in EdgeEvent() 140 triangle = &triangle->NeighborAcross(point); in EdgeEvent() 153 triangle = triangle->NeighborCCW(point); in EdgeEvent() 155 triangle = triangle->NeighborCW(point); in EdgeEvent() 183 triangle->MarkNeighbor(*node.triangle); in NewFrontTriangle() 184 tcx.AddToMap(triangle); in NewFrontTriangle() 194 if (!Legalize(tcx, *triangle)) { in NewFrontTriangle() 207 triangle->MarkNeighbor(*node.prev->triangle); in Fill() 208 triangle->MarkNeighbor(*node.triangle); in Fill() 210 tcx.AddToMap(triangle); in Fill() [all …]
|
/dports/devel/qt5-location/kde-qtlocation-5.15.2p6/src/3rdparty/poly2tri/sweep/ |
H A D | sweep.cpp | 122 triangle = &triangle->NeighborAcross(point); in EdgeEvent() 139 triangle = &triangle->NeighborAcross(point); in EdgeEvent() 152 triangle = triangle->NeighborCCW(point); in EdgeEvent() 154 triangle = triangle->NeighborCW(point); in EdgeEvent() 182 triangle->MarkNeighbor(*node.triangle); in NewFrontTriangle() 183 tcx.AddToMap(triangle); in NewFrontTriangle() 193 if (!Legalize(tcx, *triangle)) { in NewFrontTriangle() 206 triangle->MarkNeighbor(*node.prev->triangle); in Fill() 207 triangle->MarkNeighbor(*node.triangle); in Fill() 209 tcx.AddToMap(triangle); in Fill() [all …]
|
/dports/graphics/qgis-ltr/qgis-3.16.16/external/poly2tri/sweep/ |
H A D | sweep.cc | 123 triangle = &triangle->NeighborAcross(point); in EdgeEvent() 140 triangle = &triangle->NeighborAcross(point); in EdgeEvent() 153 triangle = triangle->NeighborCCW(point); in EdgeEvent() 155 triangle = triangle->NeighborCW(point); in EdgeEvent() 183 triangle->MarkNeighbor(*node.triangle); in NewFrontTriangle() 184 tcx.AddToMap(triangle); in NewFrontTriangle() 194 if (!Legalize(tcx, *triangle)) { in NewFrontTriangle() 207 triangle->MarkNeighbor(*node.prev->triangle); in Fill() 208 triangle->MarkNeighbor(*node.triangle); in Fill() 210 tcx.AddToMap(triangle); in Fill() [all …]
|
/dports/graphics/qt5-3d/kde-qt3d-5.15.2p39/src/3rdparty/assimp/contrib/poly2tri/poly2tri/sweep/ |
H A D | sweep.cc | 123 triangle = &triangle->NeighborAcross(point); in EdgeEvent() 143 triangle = &triangle->NeighborAcross(point); in EdgeEvent() 156 triangle = triangle->NeighborCCW(point); in EdgeEvent() 158 triangle = triangle->NeighborCW(point); in EdgeEvent() 186 triangle->MarkNeighbor(*node.triangle); in NewFrontTriangle() 187 tcx.AddToMap(triangle); in NewFrontTriangle() 197 if (!Legalize(tcx, *triangle)) { in NewFrontTriangle() 210 triangle->MarkNeighbor(*node.prev->triangle); in Fill() 211 triangle->MarkNeighbor(*node.triangle); in Fill() 213 tcx.AddToMap(triangle); in Fill() [all …]
|
/dports/math/poly2tri/poly2tri-e6e63dd29ef0805b3e40fe1832c2f1fe2307943a/unittest/ |
H A D | TriangleTest.cpp | 9 p2t::Triangle triangle(a, b, c); 10 BOOST_CHECK(triangle.Contains(&a)); 11 BOOST_CHECK(triangle.Contains(&b)); 12 BOOST_CHECK(triangle.Contains(&c)); 13 BOOST_CHECK(triangle.CircumcicleContains(p2t::Point(0.5, 0.1))); 14 BOOST_CHECK(!triangle.CircumcicleContains(p2t::Point(1, 0.4)));
|