Home
last modified time | relevance | path

Searched refs:Intersect (Results 1 – 25 of 3143) sorted by relevance

12345678910>>...126

/dports/math/wfmath/wfmath-1.0.2/wfmath/
H A Dintersect.cpp70 if(!Intersect(b2, b, proper)) in Intersect()
78 return Intersect(b3, b4, proper); in Intersect()
119 if(!Intersect(b2, b, proper)) in Intersect()
128 if(!Intersect(b3, b4, proper)) in Intersect()
249 template bool Intersect<2>(const Point<2>&, const Point<2>&, bool);
250 template bool Intersect<3>(const Point<3>&, const Point<3>&, bool);
272 template bool Intersect<2>(const Ball<2>&, const Point<2>&, bool);
273 template bool Intersect<3>(const Ball<3>&, const Point<3>&, bool);
286 template bool Intersect<2>(const Ball<2>&, const Ball<2>&, bool);
287 template bool Intersect<3>(const Ball<3>&, const Ball<3>&, bool);
[all …]
H A Dshape_test.cpp72 assert(Intersect(box, p1, false)); in test_shape()
73 assert(!Intersect(box, p1, true)); in test_shape()
75 assert(Intersect(box, box, false)); in test_shape()
76 assert(Intersect(box, box, true)); in test_shape()
87 assert(Intersect(ball, p1, false)); in test_shape()
88 assert(Intersect(ball, p1, true)); in test_shape()
109 assert(Intersect(seg, p1, false)); in test_shape()
110 assert(!Intersect(seg, p1, true)); in test_shape()
113 assert(Intersect(seg, box, true)); in test_shape()
127 assert(Intersect(seg, seg, true)); in test_shape()
[all …]
H A Dintersect_decls.h56 bool Intersect(const AxisBox<dim>& b, const Point<dim>& p, bool proper);
61 bool Intersect(const Ball<dim>& b, const Point<dim>& p, bool proper);
66 bool Intersect(const Segment<dim>& s, const Point<dim>& p, bool proper);
71 bool Intersect(const RotBox<dim>& r, const Point<dim>& p, bool proper);
81 bool Intersect(const Ball<dim>& b, const AxisBox<dim>& a, bool proper);
95 bool Intersect(const RotBox<dim>& r, const AxisBox<dim>& b, bool proper);
102 bool Intersect(const Ball<dim>& b1, const Ball<dim>& b2, bool proper);
107 bool Intersect(const Segment<dim>& s, const Ball<dim>& b, bool proper);
114 bool Intersect(const RotBox<dim>& r, const Ball<dim>& b, bool proper);
138 bool Intersect(const Polygon<dim>& r, const Point<dim>& p, bool proper);
[all …]
/dports/lang/mono/mono-5.10.1.57/external/corefx/src/System.Linq/tests/
H A DIntersectTests.cs20 Assert.Equal(first.Intersect(second), first.Intersect(second)); in SameResultsRepeatCallsIntQuery()
31 Assert.Equal(first.Intersect(second), first.Intersect(second)); in SameResultsRepeatCallsStringQuery()
46 Assert.Equal(expected, first.Intersect(second)); in Int()
47 Assert.Equal(expected, first.Intersect(second, null)); in Int()
67 Assert.Equal(expected, first.Intersect(second)); in String()
69 Assert.Equal(expected, first.Intersect(second, comparer)); in String()
83 Assert.Equal(expected, first.Intersect(second)); in NullableInt()
84 Assert.Equal(expected, first.Intersect(second, null)); in NullableInt()
90 Assert.Equal(expected, first.RunOnce().Intersect(second.RunOnce())); in NullableIntRunOnce()
129 Assert.Equal(Enumerable.Empty<string>(), input1.Intersect(input2)); in HashSetWithBuiltInComparer_HashSetContainsNotUsed()
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/components/viz/service/display/
H A Dlayer_quad.cc27 gfx::PointF LayerQuad::Edge::Intersect(const LayerQuad::Edge& e) const { in Intersect() function in viz::LayerQuad::Edge
63 return gfx::QuadF(top_.Intersect(bottom_), top_.Intersect(right_), in ToQuadF()
64 right_.Intersect(bottom_), bottom_.Intersect(top_)); in ToQuadF()
67 return gfx::QuadF(left_.Intersect(top_), top_.Intersect(bottom_), in ToQuadF()
68 bottom_.Intersect(top_), bottom_.Intersect(left_)); in ToQuadF()
71 return gfx::QuadF(left_.Intersect(right_), right_.Intersect(left_), in ToQuadF()
72 right_.Intersect(bottom_), bottom_.Intersect(left_)); in ToQuadF()
75 return gfx::QuadF(left_.Intersect(top_), top_.Intersect(right_), in ToQuadF()
76 right_.Intersect(left_), left_.Intersect(right_)); in ToQuadF()
78 return gfx::QuadF(left_.Intersect(top_), top_.Intersect(right_), in ToQuadF()
[all …]
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/components/viz/service/display/
H A Dlayer_quad.cc27 gfx::PointF LayerQuad::Edge::Intersect(const LayerQuad::Edge& e) const { in Intersect() function in viz::LayerQuad::Edge
63 return gfx::QuadF(top_.Intersect(bottom_), top_.Intersect(right_), in ToQuadF()
64 right_.Intersect(bottom_), bottom_.Intersect(top_)); in ToQuadF()
67 return gfx::QuadF(left_.Intersect(top_), top_.Intersect(bottom_), in ToQuadF()
68 bottom_.Intersect(top_), bottom_.Intersect(left_)); in ToQuadF()
71 return gfx::QuadF(left_.Intersect(right_), right_.Intersect(left_), in ToQuadF()
72 right_.Intersect(bottom_), bottom_.Intersect(left_)); in ToQuadF()
75 return gfx::QuadF(left_.Intersect(top_), top_.Intersect(right_), in ToQuadF()
76 right_.Intersect(left_), left_.Intersect(right_)); in ToQuadF()
78 return gfx::QuadF(left_.Intersect(top_), top_.Intersect(right_), in ToQuadF()
[all …]
/dports/devel/dep/dep-0.5.4/gps/
H A Dconstraint_test.go29 if v1.Intersect(any) != v1 {
36 if v1.Intersect(none) != none {
48 if v1.Intersect(v2) != none {
69 if v2.Intersect(v3) != none {
72 if v3.Intersect(v2) != none {
92 if v4.Intersect(v3) != none {
95 if v3.Intersect(v4) != none {
138 if v1.Intersect(o1) != none {
150 if v1.Intersect(o2) != none {
162 if v1.Intersect(o3) != none {
[all …]
/dports/devel/google-cloud-cpp/google-cloud-cpp-1.21.0/google/cloud/bigtable/
H A Drow_range_test.cc316 auto tuple = R::RightOpen("c", "m").Intersect(R::Empty()); in TEST()
396 auto tuple = R::LeftOpen("c", "m").Intersect(R::Empty()); in TEST()
470 auto tuple = R::Open("c", "m").Intersect(R::Empty()); in TEST()
519 auto tuple = R::Open("c", "m").Intersect(R::Open("d", "k")); in TEST()
544 auto tuple = R::Closed("c", "m").Intersect(R::Empty()); in TEST()
618 auto tuple = R::StartingAt("c").Intersect(R::Empty()); in TEST()
657 auto tuple = R::StartingAt("c").Intersect(R::Open("d", "k")); in TEST()
682 auto tuple = R::EndingAt("m").Intersect(R::Empty()); in TEST()
709 auto tuple = R::EndingAt("m").Intersect(R::Open("d", "k")); in TEST()
715 auto tuple = R::EndingAt("m").Intersect(R::Closed("d", "k")); in TEST()
[all …]
/dports/devel/google-cloud-cpp117/google-cloud-cpp-1.17.0/google/cloud/bigtable/
H A Drow_range_test.cc311 auto tuple = R::RightOpen("c", "m").Intersect(R::Empty()); in TEST()
391 auto tuple = R::LeftOpen("c", "m").Intersect(R::Empty()); in TEST()
465 auto tuple = R::Open("c", "m").Intersect(R::Empty()); in TEST()
514 auto tuple = R::Open("c", "m").Intersect(R::Open("d", "k")); in TEST()
539 auto tuple = R::Closed("c", "m").Intersect(R::Empty()); in TEST()
613 auto tuple = R::StartingAt("c").Intersect(R::Empty()); in TEST()
652 auto tuple = R::StartingAt("c").Intersect(R::Open("d", "k")); in TEST()
677 auto tuple = R::EndingAt("m").Intersect(R::Empty()); in TEST()
704 auto tuple = R::EndingAt("m").Intersect(R::Open("d", "k")); in TEST()
710 auto tuple = R::EndingAt("m").Intersect(R::Closed("d", "k")); in TEST()
[all …]
/dports/misc/usd/USD-21.11/pxr/base/gf/testenv/
H A DtestGfRay.py148 r.Intersect(p1,p2,p3)
149 r.Intersect(p3,p1,p2)
150 r.Intersect(p2,p3,p1)
163 (hit, distance, frontFacing) = r.Intersect(p)
169 (hit, distance, frontFacing) = r.Intersect(p)
175 (hit, distance, frontFacing) = r.Intersect(p)
181 (hit, enterDistance, exitDistance) = r.Intersect(box)
187 (hit, enterDistance, exitDistance) = r.Intersect(box)
192 (hit, enterDistance, exitDistance) = r.Intersect(box)
233 (hit, enterDist, exitDist) = r.Intersect(box)
[all …]
/dports/devel/mercator/mercator-0.3.3/tests/
H A DIntersecttest.cpp34 if (Mercator::Intersect(terrain, highab)) { in main()
44 if (!Mercator::Intersect(terrain, lowab)) { in main()
56 if (Mercator::Intersect(terrain, highab)) { in main()
82 if (Mercator::Intersect(terrain, ab)) { in main()
91 if (!Mercator::Intersect(terrain, ab2)) { in main()
102 if (Mercator::Intersect(terrain, WFMath::Point<3>(20.1, 20.2, segmax + 3), in main()
108 if (!Mercator::Intersect(terrain, WFMath::Point<3>(20.1, 20.2, segmax + 3), in main()
115 if (!Mercator::Intersect(terrain, WFMath::Point<3>(20.1, 20.2, segmax + 3), in main()
121 if (!Mercator::Intersect(terrain, WFMath::Point<3>(20.1, 20.2, segmax + 3), in main()
127 if (!Mercator::Intersect(terrain, WFMath::Point<3>(20.1, 20.2, segmax + 3), in main()
[all …]
/dports/games/stuntrally/stuntrally-2.6.1/source/vdrift/
H A Daabb.cpp29 QT_CHECK(box1.Intersect(box2)); in QT_TEST()
36 QT_CHECK(!box1.Intersect(box3)); in QT_TEST()
46 QT_CHECK(box1.Intersect(AABB<float>::RAY(orig,dir,4))); in QT_TEST()
47 QT_CHECK(!box1.Intersect(AABB<float>::RAY(orig,dir*-1,4))); in QT_TEST()
48 QT_CHECK(!box1.Intersect(AABB<float>::RAY(orig,dir,1))); in QT_TEST()
57 QT_CHECK(box1.Intersect(AABB<float>::FRUSTUM(plane))); in QT_TEST()
66 QT_CHECK(box1.Intersect(AABB<float>::FRUSTUM(plane))); in QT_TEST()
75 QT_CHECK(!box1.Intersect(AABB<float>::FRUSTUM(plane))); in QT_TEST()
84 QT_CHECK(box1.Intersect(AABB<float>::FRUSTUM(plane))); in QT_TEST()
93 QT_CHECK(!box1.Intersect(AABB<float>::FRUSTUM(plane))); in QT_TEST()
/dports/lang/mono/mono-5.10.1.57/external/corefx/src/System.Linq.Queryable/tests/
H A DIntersectTests.cs17 Assert.Empty(first.AsQueryable().Intersect(second.AsQueryable())); in BothEmpty()
26 …= AssertExtensions.Throws<ArgumentNullException>("source1", () => first.Intersect(second.AsQueryab… in FirstNullCustomComparer()
35 …ions.Throws<ArgumentNullException>("source2", () => first.AsQueryable().Intersect(second, new Anag… in SecondNullCustomComparer()
44 …= AssertExtensions.Throws<ArgumentNullException>("source1", () => first.Intersect(second.AsQueryab… in FirstNullNoComparer()
53 …rtExtensions.Throws<ArgumentNullException>("source2", () => first.AsQueryable().Intersect(second)); in SecondNullNoComparer()
61 …Assert.Empty(first.AsQueryable().Intersect(second.AsQueryable(), EqualityComparer<string>.Default)… in SingleNullWithEmpty()
71 …Assert.Equal(expected, first.AsQueryable().Intersect(second.AsQueryable(), new AnagramEqualityComp… in CustomComparer()
77 …var count = (new int[] { 0, 1, 2 }).AsQueryable().Intersect((new int[] { 1, 2, 3 }).AsQueryable())… in Intersect1()
84 …var count = (new int[] { 0, 1, 2 }).AsQueryable().Intersect((new int[] { 1, 2, 3 }).AsQueryable(),… in Intersect2()
/dports/textproc/regex2dfa/regex2dfa-0.1.6/third_party/openfst/src/script/
H A Dintersect.cc24 void Intersect(const FstClass &ifst1, const FstClass &ifst2, in Intersect() function
33 void Intersect(const FstClass &ifst1, const FstClass &ifst2, in Intersect() function
42 REGISTER_FST_OPERATION(Intersect, StdArc, IntersectArgs1);
43 REGISTER_FST_OPERATION(Intersect, LogArc, IntersectArgs1);
44 REGISTER_FST_OPERATION(Intersect, Log64Arc, IntersectArgs1);
45 REGISTER_FST_OPERATION(Intersect, StdArc, IntersectArgs2);
46 REGISTER_FST_OPERATION(Intersect, LogArc, IntersectArgs2);
47 REGISTER_FST_OPERATION(Intersect, Log64Arc, IntersectArgs2);
/dports/net/ooni-probe-cli/probe-cli-3.10.1/vendor/github.com/ooni/psiphon/oopsi/github.com/redjack/marionette/third_party/openfst/src/script/
H A Dintersect.cc24 void Intersect(const FstClass &ifst1, const FstClass &ifst2, in Intersect() function
33 void Intersect(const FstClass &ifst1, const FstClass &ifst2, in Intersect() function
42 REGISTER_FST_OPERATION(Intersect, StdArc, IntersectArgs1);
43 REGISTER_FST_OPERATION(Intersect, LogArc, IntersectArgs1);
44 REGISTER_FST_OPERATION(Intersect, Log64Arc, IntersectArgs1);
45 REGISTER_FST_OPERATION(Intersect, StdArc, IntersectArgs2);
46 REGISTER_FST_OPERATION(Intersect, LogArc, IntersectArgs2);
47 REGISTER_FST_OPERATION(Intersect, Log64Arc, IntersectArgs2);
/dports/net/ooni-mini/probe-engine-0.23.0/vendor/github.com/ooni/psiphon/oopsi/github.com/redjack/marionette/third_party/openfst/src/script/
H A Dintersect.cc24 void Intersect(const FstClass &ifst1, const FstClass &ifst2, in Intersect() function
33 void Intersect(const FstClass &ifst1, const FstClass &ifst2, in Intersect() function
42 REGISTER_FST_OPERATION(Intersect, StdArc, IntersectArgs1);
43 REGISTER_FST_OPERATION(Intersect, LogArc, IntersectArgs1);
44 REGISTER_FST_OPERATION(Intersect, Log64Arc, IntersectArgs1);
45 REGISTER_FST_OPERATION(Intersect, StdArc, IntersectArgs2);
46 REGISTER_FST_OPERATION(Intersect, LogArc, IntersectArgs2);
47 REGISTER_FST_OPERATION(Intersect, Log64Arc, IntersectArgs2);
/dports/cad/kicad-devel/kicad-a17a58203b33e08b966075833b177dad5740c236/3d-viewer/3d_rendering/raytracing/accelerators/
H A Dbvh_packet_traversal.cpp52 if( aBBox.Intersect( aRayPacket.m_ray[ia], &hitT ) in getFirstHit()
56 if( !aRayPacket.m_Frustum.Intersect( aBBox ) ) in getFirstHit()
61 if( aBBox.Intersect( aRayPacket.m_ray[i], &hitT ) in getFirstHit()
79 if( aBBox.Intersect( aRayPacket.m_ray[ie], &hitT ) in getLastHit()
131 if( aRayPacket.m_Frustum.Intersect( obj->GetBBox() ) ) in Intersect()
135 const bool hit = obj->Intersect( aRayPacket.m_ray[i], in Intersect()
178 if( aBBox.Intersect( aRayPacket.m_ray[ aRayIndex[ie] ], &hitT ) in getLastHit()
192 if( !aRayPacket.m_Frustum.Intersect( aBBox ) ) in partRays()
201 if( aBBox.Intersect( aRayPacket.m_ray[ aRayIndex[i] ], &hitT ) in partRays()
247 if( aRayPacket.m_Frustum.Intersect( obj->GetBBox() ) ) in Intersect()
[all …]
/dports/graphics/povray36/povray-3.6.1/scenes/language/
H A Dtrace.pov44 #declare Intersect=trace(Ground, From,<0,-1,0>,Norm);
48 cylinder {From, Intersect+<0,0.5,0>, 0.025}
51 translate Intersect
58 Intersect, Intersect+(Norm/2), 0.025
61 Intersect+(Norm)/2,0.1,Intersect+Norm,0
69 concat("Intersection: <",vstr(3,Intersect,",",0,2),">")
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/ui/gfx/range/
H A Drange_unittest.cc26 EXPECT_EQ(T(10, 12), r1.Intersect(r1)); in TestContainsAndIntersects()
30 EXPECT_TRUE(r1.Intersect(r2).is_empty()); in TestContainsAndIntersects()
33 EXPECT_TRUE(r2.Intersect(r1).is_empty()); in TestContainsAndIntersects()
39 EXPECT_EQ(T(10, 12), r1.Intersect(r3)); in TestContainsAndIntersects()
40 EXPECT_EQ(T(10, 12), r3.Intersect(r1)); in TestContainsAndIntersects()
46 EXPECT_EQ(T(5, 8), r2.Intersect(r3)); in TestContainsAndIntersects()
47 EXPECT_EQ(T(5, 8), r3.Intersect(r2)); in TestContainsAndIntersects()
218 TypeParam invalid = r1.Intersect(r2); in TYPED_TEST()
295 EXPECT_EQ(range1.Intersect(range2) != invalid_range, in TEST()
352 EXPECT_EQ(range1.Intersect(range2) != invalid_range, in TEST()
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/ui/gfx/range/
H A Drange_unittest.cc26 EXPECT_EQ(T(10, 12), r1.Intersect(r1)); in TestContainsAndIntersects()
30 EXPECT_TRUE(r1.Intersect(r2).is_empty()); in TestContainsAndIntersects()
33 EXPECT_TRUE(r2.Intersect(r1).is_empty()); in TestContainsAndIntersects()
39 EXPECT_EQ(T(10, 12), r1.Intersect(r3)); in TestContainsAndIntersects()
40 EXPECT_EQ(T(10, 12), r3.Intersect(r1)); in TestContainsAndIntersects()
46 EXPECT_EQ(T(5, 8), r2.Intersect(r3)); in TestContainsAndIntersects()
47 EXPECT_EQ(T(5, 8), r3.Intersect(r2)); in TestContainsAndIntersects()
218 TypeParam invalid = r1.Intersect(r2); in TYPED_TEST()
265 EXPECT_EQ(range1.Intersect(range2) != invalid_range, in TEST()
322 EXPECT_EQ(range1.Intersect(range2) != invalid_range, in TEST()
[all …]
/dports/lang/mono/mono-5.10.1.57/external/corefx/src/System.Linq.Parallel/tests/QueryOperators/
H A DIntersectTests.cs70 foreach (int i in leftQuery.Intersect(rightQuery)) in Intersect_Unordered()
87 …public static void Intersect(Labeled<ParallelQuery<int>> left, int leftCount, ParallelQuery<int> r… in Intersect() method in System.Linq.Parallel.Tests.IntersectTests
91 foreach (int i in leftQuery.Intersect(rightQuery)) in Intersect()
103 Intersect(left, leftCount, right, rightCount, count); in Intersect_Longrunning()
113 Assert.All(leftQuery.Intersect(rightQuery).ToList(), x => seen.Add(x)); in Intersect_Unordered_NotPipelined()
131 Assert.All(leftQuery.Intersect(rightQuery).ToList(), x => Assert.Equal(seen++, x)); in Intersect_NotPipelined()
240 Assert.All(leftQuery.AsUnordered().Intersect(rightQuery), x => seen.Add(x)); in Intersect_Unordered_SourceMultiple()
257 Assert.All(leftQuery.Intersect(rightQuery), x => Assert.Equal(seen++, x)); in Intersect_SourceMultiple()
273 …Assert.Throws<NotSupportedException>(() => ParallelEnumerable.Range(0, 1).Intersect(Enumerable.Ran… in Intersect_NotSupportedException()
274 …Assert.Throws<NotSupportedException>(() => ParallelEnumerable.Range(0, 1).Intersect(Enumerable.Ran… in Intersect_NotSupportedException()
[all …]
/dports/graphics/povray38/povunix-v3.8.0-beta.2-src/source/core/material/
H A Dpigment.cpp420 Do_Average_Pigments(colour, Pigment, TPoint, Intersect, ray, Thread); in Compute_Pigment()
425 if (Intersect == nullptr) in Compute_Pigment()
428 Colour_Found = Pigment->Blend_Map->ComputeUVMapped(colour, Intersect, ray, Thread); in Compute_Pigment()
453 value = Evaluate_TPat (Pigment, TPoint, Intersect, ray, Thread); in Compute_Pigment()
455 return Pigment->Blend_Map->Compute (colour, value, TPoint, Intersect, ray, Thread); in Compute_Pigment()
545 if (Compute_Pigment(colour, Cur->Vals, TPoint, Intersect, ray, Thread)) in Compute()
550 if (Compute_Pigment(Temp_Colour, Prev->Vals, TPoint, Intersect, ray, Thread)) in Compute()
579 Compute_Pigment (tempColour, i->Vals, EPoint, Intersect, ray, Thread); in ComputeAverage()
600 Intersect->Object->UVCoord(UV_Coords, Intersect, Thread); in ComputeUVMapped()
605 return Compute_Pigment(colour, Cur->Vals, TPoint, Intersect, ray, Thread); in ComputeUVMapped()
[all …]
H A Dpigment.h75 …sColour& colour, DBL value, const Vector3d& IPoint, const Intersection *Intersect, const Ray *ray,…
76 …verage(TransColour& colour, const Vector3d& EPoint, const Intersection *Intersect, const Ray *ray,…
77 …virtual bool ComputeUVMapped(TransColour& colour, const Intersection *Intersect, const Ray *ray, T…
91 …sColour& colour, DBL value, const Vector3d& IPoint, const Intersection *Intersect, const Ray *ray,…
92 …verage(TransColour& colour, const Vector3d& EPoint, const Intersection *Intersect, const Ray *ray,…
93 …virtual bool ComputeUVMapped(TransColour& colour, const Intersection *Intersect, const Ray *ray, T…
105 …sColour& colour, DBL value, const Vector3d& IPoint, const Intersection *Intersect, const Ray *ray,…
106 …verage(TransColour& colour, const Vector3d& EPoint, const Intersection *Intersect, const Ray *ray,…
107 …virtual bool ComputeUVMapped(TransColour& colour, const Intersection *Intersect, const Ray *ray, T…
137 …ur, const PIGMENT *Pigment, const Vector3d& IPoint, const Intersection *Intersect, const Ray *ray,…
/dports/math/ignition-math/ignitionrobotics-ign-math-46f3dd24499c/src/
H A DLine2_TEST.cc149 EXPECT_FALSE(lineA.Intersect(ptLine)); in TEST()
164 EXPECT_FALSE(lineA.Intersect(ptLine)); in TEST()
180 TEST(Line2Test, Intersect) in TEST() argument
187 EXPECT_FALSE(lineA.Intersect(lineB, pt)); in TEST()
192 EXPECT_FALSE(lineA.Intersect(lineB, pt)); in TEST()
197 EXPECT_FALSE(lineA.Intersect(lineB, pt)); in TEST()
202 EXPECT_FALSE(lineA.Intersect(lineB, pt)); in TEST()
217 EXPECT_TRUE(lineA.Intersect(lineB, pt)); in TEST()
223 EXPECT_TRUE(lineA.Intersect(lineB, pt)); in TEST()
229 EXPECT_TRUE(lineA.Intersect(lineB, pt)); in TEST()
[all …]
/dports/graphics/povray38/povunix-v3.8.0-beta.2-src/scenes/language/
H A Dtrace.pov51 #declare Intersect=trace(Ground, From,<0,-1,0>,Norm);
55 cylinder {From, Intersect+<0,0.5,0>, 0.025}
58 translate Intersect
65 Intersect, Intersect+(Norm/2), 0.025
68 Intersect+(Norm)/2,0.1,Intersect+Norm,0
76 concat("Intersection: <",vstr(3,Intersect,",",0,2),">")

12345678910>>...126