Home
last modified time | relevance | path

Searched refs:y_intersect (Results 1 – 5 of 5) sorted by relevance

/dports/games/openrct2/OpenRCT2-0.3.5.1/src/openrct2-ui/drawing/engines/opengl/
H A DTransparencyDepth.cpp87 auto top_in = y_intersect.insert({ top, { 1, 0 } }); in InsertTopEndpoint()
92 if (top_next != y_intersect.end()) in InsertTopEndpoint()
111 auto bottom_in = y_intersect.insert({ bottom, { 1, 1 } }); in InsertBottomEndpoint()
116 if (bottom_next != y_intersect.end()) in InsertBottomEndpoint()
136 y_intersect.erase(top_it); in RemoveTopEndpoint()
151 y_intersect.erase(bottom_it); in RemoveBottomEndpoint()
169 IntervalTree y_intersect{}; in MaxTransparencyDepth() local
189 IntervalTree::iterator top_it = y_intersect.find(x.top); in MaxTransparencyDepth()
190 IntervalTree::iterator bottom_it = y_intersect.find(x.bottom); in MaxTransparencyDepth()
200 RemoveTopEndpoint(y_intersect, top_it); in MaxTransparencyDepth()
[all …]
/dports/math/wfmath/wfmath-1.0.2/wfmath/
H A Dpolygon_intersect.cpp629 if(Equal(b.m_low[1], y_intersect) || Equal(b.m_high[1], y_intersect)) in Intersect()
631 if(b.m_low[1] < y_intersect && b.m_high[1] > y_intersect) in Intersect()
649 if(Equal(b.m_low[1], y_intersect) || Equal(b.m_high[1], y_intersect)) in Intersect()
651 if(b.m_low[1] < y_intersect && b.m_high[1] > y_intersect) in Intersect()
710 if(!on_corner && b.m_low[1] < y_intersect && b.m_high[1] > y_intersect) in Contains()
986 if(Equal(m_low[1], y_intersect) || Equal(m_high[1], y_intersect)) in Intersect()
988 if(m_low[1] < y_intersect && m_high[1] > y_intersect) in Intersect()
1006 if(Equal(m_low[1], y_intersect) || Equal(m_high[1], y_intersect)) in Intersect()
1008 if(m_low[1] < y_intersect && m_high[1] > y_intersect) in Intersect()
1091 if(!on_corner && m_low[1] < y_intersect && m_high[1] > y_intersect) in Contains()
[all …]
/dports/net/mpich/mpich-3.4.3/modules/ucx/test/gtest/ucs/
H A Dtest_math.cc239 double y_intersect[2]; in UCS_TEST_F() local
241 y_intersect[i] = ucs_linear_func_apply(func[i], x_intersect); in UCS_TEST_F()
243 EXPECT_NEAR(y_intersect[0], y_intersect[1], 1e-6); in UCS_TEST_F()
/dports/graphics/tgif/tgif-QPL-4.2.5/
H A Dimgproc.c6469 double m, b, x_intersect, y_intersect; local
6475 y_intersect = m * ((double)(topSel->obj->obbox.ltx)) + b;
6476 if (y_intersect < topSel->obj->obbox.lty) {
6478 } else if (y_intersect > topSel->obj->obbox.rby-1) {
6484 y_intersect = m * ((double)(topSel->obj->obbox.rbx-1)) + b;
6485 if (y_intersect < topSel->obj->obbox.lty) {
6487 } else if (y_intersect > topSel->obj->obbox.rby-1) {
6519 y_intersect = (m * ((double)(to_pt.x))) + b;
6520 to_pt.y = round(y_intersect);
6530 y_intersect = (m * ((double)(to_pt.x))) + b;
[all …]
/dports/multimedia/opentoonz/opentoonz-1.5.0/toonz/sources/toonzlib/
H A DtcenterlinevectorizerOld.cpp1508 bool y_intersect(const double y0, const TPointD p1, const TPointD p2, in y_intersect() function
1534 if (y_intersect(point.y, p1, p2, x) && x >= point.x) ++intersectionsNumber; in isContained()