Home
last modified time | relevance | path

Searched refs:lPrev (Results 1 – 20 of 20) sorted by relevance

/dports/math/cgal/CGAL-5.3/include/CGAL/
H A Dcompute_outer_frame_margin.h57 ForwardPointIterator lPrev = ( lCurr == aBegin ? lLast : std::prev (lCurr) ) ; in compute_outer_frame_margin() local
60 if ( !equal(*lPrev,*lCurr) && !equal(*lCurr,*lNext) && !collinear(*lPrev,*lCurr,*lNext) ) in compute_outer_frame_margin()
62 Segment_2 lLEdge = construct_segment(*lPrev,*lCurr); in compute_outer_frame_margin()
H A DStraight_skeleton_builder_traits_2.h541 void ComputeFilteringBound(Vertex_handle lPrev, Vertex_handle aNode, Vertex_handle lNext, in ComputeFilteringBound() argument
555 Segment_2 s1(lPrev->point(), aNode->point()); in ComputeFilteringBound()
839 void ComputeFilteringBound(Vertex_handle lPrev, Vertex_handle aNode, Vertex_handle lNext, in ComputeFilteringBound() argument
859 Target_Segment_2 s1(to_FK(lPrev->point()), laP); in ComputeFilteringBound()
H A DStraight_skeleton_builder_2.h1309 …void ComputeUpperBoundForValidSplitEventsImpl(Vertex_handle lPrev, Vertex_handle aNode, Vertex_han… in ComputeUpperBoundForValidSplitEventsImpl() argument
1314 …return mTraits.ComputeFilteringBound(lPrev, aNode, lNext, contour_halfedges_begin, contour_halfedg… in ComputeUpperBoundForValidSplitEventsImpl()
1317 …void ComputeUpperBoundForValidSplitEvents(Vertex_handle lPrev, Vertex_handle aNode, Vertex_handle … in ComputeUpperBoundForValidSplitEvents() argument
1321 …return ComputeUpperBoundForValidSplitEventsImpl(lPrev, aNode, lNext, contour_halfedges_begin, cont… in ComputeUpperBoundForValidSplitEvents()
/dports/math/cgal/CGAL-5.3/include/CGAL/Straight_skeleton_2/
H A DPolygon_offset_builder_2_impl.h65 Halfedge_const_handle lPrev = aBisector->prev(); in LocateHook() local
69 CGAL_POLYOFFSET_TRACE(4, "Next: " << e2str(*lNext) << " - Prev: " << e2str(*lPrev) ) ; in LocateHook()
83 …Comparison_result lTimeWrtSrcTime = lPrev->is_bisector() ? Compare_offset_against_event_time(aTime… in LocateHook()
137 aBisector = lPrev ; in LocateHook()
H A DStraight_skeleton_builder_2_impl.h348 Vertex_handle lPrev = GetPrevInLAV(aNode) ; in CollectNewEvents() local
360 EventPtr lLEdgeEvent = FindEdgeEvent( lPrev , aNode, aPrevEventTriedge ) ; in CollectNewEvents()
504 Vertex_handle lPrev = GetPrevInLAV(aNode) ; in UpdatePQ() local
507 …CGAL_STSKEL_BUILDER_TRACE ( 3, "Updating PQ for N" << aNode->id() << " Prev N" << lPrev->id() << "… in UpdatePQ()
510 Halfedge_handle lOBisector_P = lPrev->primary_bisector() ; in UpdatePQ()
515 HandleSimultaneousEdgeEvent( aNode, lPrev ) ; in UpdatePQ()
545 Vertex_handle lPrev = GetPrevInLAV(v) ; in CreateContourBisectors() local
548 Orientation lOrientation = CGAL::orientation(lPrev->point(),v->point(),lNext->point()); in CreateContourBisectors()
824 Vertex_handle lPrev = GetPrevInLAV(lSeed) ; in ConstructSplitEventNodes() local
827 SetNextInLAV(lPrev , lNewNodeA ) ; in ConstructSplitEventNodes()
[all …]
/dports/graphics/geos/geos-3.9.1/include/geos/triangulate/quadedge/
H A DQuadEdge.h321 lPrev() const in lPrev() function
327 lPrev() in lPrev() function
/dports/textproc/fop/fop-2.6/fop-core/src/main/java/org/apache/fop/complexscripts/bidi/
H A DUnicodeBidiAlgorithm.java197 for (int i = 0, n = ea.length, lPrev = defaultLevel; i < n; ) { in resolveRuns()
200 int l = findNextNonRetainedFormattingLevel(wca, ea, s, lPrev); in resolveRuns()
212 lPrev = resolveRun(wca, defaultLevel, ea, la, s, e, l, lPrev); in resolveRuns()
218 … private static int findNextNonRetainedFormattingLevel(int[] wca, int[] ea, int start, int lPrev) { in findNextNonRetainedFormattingLevel() argument
231 return lPrev; in findNextNonRetainedFormattingLevel()
/dports/games/torcs/torcs-1.3.7/src/tools/trackgen/
H A Draceline.cpp227 double lPrev = (rlseg[i].t-rlseg[prev].t).len(); in Smooth() local
229 double TargetRInverse = (lNext * ri0 + lPrev * ri1) / (lNext + lPrev); in Smooth()
231 double Security = lPrev * lNext / (8 * SecurityR); in Smooth()
/dports/graphics/geos/geos-3.9.1/src/triangulate/
H A DIncrementalDelaunayTriangulator.cpp99 e = &e->oNext().lPrev(); in insertSite()
/dports/math/jts/jts-jts-1.18.1/modules/core/src/main/java/org/locationtech/jts/triangulate/
H A DIncrementalDelaunayTriangulator.java118 e = e.oNext().lPrev(); in insertSite()
/dports/math/jts/jts-jts-1.18.1/modules/core/src/main/java/org/locationtech/jts/triangulate/quadedge/
H A DQuadEdge.java293 public final QuadEdge lPrev() { in lPrev() method in QuadEdge
/dports/games/torcs/torcs-1.3.7/src/drivers/inferno/
H A Dpathfinder.cpp707 double lPrev = sqrt(dx*dx + dy*dy); in smooth() local
711 double TargetRInverse = (lNext * ir0 + lPrev * ir1) / (lNext + lPrev); in smooth()
713 double Security = lPrev * lNext / (8.0 * 100.0); in smooth()
/dports/games/torcs/torcs-1.3.7/src/drivers/tita/
H A Dpathfinder.cpp707 double lPrev = sqrt(dx*dx + dy*dy); in smooth() local
711 double TargetRInverse = (lNext * ir0 + lPrev * ir1) / (lNext + lPrev); in smooth()
713 double Security = lPrev * lNext / (8.0 * 100.0); in smooth()
/dports/games/torcs/torcs-1.3.7/src/drivers/lliaw/
H A Dpathfinder.cpp707 double lPrev = sqrt(dx*dx + dy*dy); in smooth() local
711 double TargetRInverse = (lNext * ir0 + lPrev * ir1) / (lNext + lPrev); in smooth()
713 double Security = lPrev * lNext / (8.0 * 100.0); in smooth()
/dports/textproc/zorba/zorba-2.7.0/src/store/naive/
H A Dnode_items.cpp4582 store::Item_t lPrev = lCurr; in isPrecedingSibling() local
4584 if (lPrev == this) in isPrecedingSibling()
4589 if (lPrev == aOther) in isPrecedingSibling()
4598 if (lPrev == aOther) in isPrecedingSibling()
4604 return lPrev->isPrecedingSibling(aOther); in isPrecedingSibling()
4609 lPrev = lCurr; // remember preceding sibling in isPrecedingSibling()
/dports/textproc/zorba/zorba-2.7.0/src/compiler/parsetree/
H A Dparsenodes.cpp3646 const DirElemContent* lPrev = 0; in accept() local
3654 if (lPrev != 0) { in accept()
3655 ACCEPT_CHK(lPrev); in accept()
3657 lPrev = e_p; in accept()
3660 if (lPrev != 0) { in accept()
3661 ACCEPT_CHK(lPrev); in accept()
/dports/games/torcs/torcs-1.3.7/src/drivers/berniw2/
H A Dpathfinder.cpp1107 double lPrev = sqrt(dx*dx + dy*dy); in smooth() local
1111 double TargetRInverse = (lNext * ir0 + lPrev * ir1) / (lNext + lPrev); in smooth()
1113 double Security = lPrev * lNext / (8.0 * 100.0); in smooth()
/dports/games/torcs/torcs-1.3.7/src/drivers/berniw3/
H A Dpathfinder.cpp1107 double lPrev = sqrt(dx*dx + dy*dy); in smooth() local
1111 double TargetRInverse = (lNext * ir0 + lPrev * ir1) / (lNext + lPrev); in smooth()
1113 double Security = lPrev * lNext / (8.0 * 100.0); in smooth()
/dports/games/torcs/torcs-1.3.7/src/drivers/berniw/
H A Dpathfinder.cpp1107 double lPrev = sqrt(dx*dx + dy*dy); in smooth() local
1111 double TargetRInverse = (lNext * ir0 + lPrev * ir1) / (lNext + lPrev); in smooth()
1113 double Security = lPrev * lNext / (8.0 * 100.0); in smooth()
/dports/textproc/zorba/zorba-2.7.0/src/compiler/translator/
H A Dtranslator.cpp11976 const DirElemContent* lPrev = translator_ns::peek_stack(thePossibleWSContentStack); in check_boundary_whitespace() local
11984 if (lPrev != 0) { in check_boundary_whitespace()
11985 lPrev->setIsStripped(true); in check_boundary_whitespace()
12023 const DirElemContent* lPrev = translator_ns::pop_stack (thePossibleWSContentStack); in end_check_boundary_whitespace() local
12024 if (lPrev != 0) in end_check_boundary_whitespace()
12026 lPrev->setIsStripped(true); in end_check_boundary_whitespace()