ReceiveTempSMS
/
Sweden-Number
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

glu32: Fix the spelling of some comments. 

Signed-off-by: Francois Gouget <fgouget@free.fr>
Signed-off-by: Alexandre Julliard <julliard@winehq.org>
This commit is contained in:
Francois Gouget 2019-09-16 15:59:06 +02:00 committed by Alexandre Julliard
parent bed4291336
commit bcd111dd5f
2 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
dlls/glu32/sweep.c
View File

@ -542,7 +542,7 @@ static void CallCombine( GLUtesselator *tess, GLUvertex *isect,
static void SpliceMergeVertices( GLUtesselator *tess, GLUhalfEdge *e1, static void SpliceMergeVertices( GLUtesselator *tess, GLUhalfEdge *e1,
GLUhalfEdge *e2 ) GLUhalfEdge *e2 )
/* /*
* Two vertices with idential coordinates are combined into one. * Two vertices with identical coordinates are combined into one.
* e1->Org is kept, while e2->Org is discarded. * e1->Org is kept, while e2->Org is discarded.
*/ */
{ {
@ -1045,7 +1045,7 @@ static void ConnectRightVertex( GLUtesselator *tess, ActiveRegion *regUp,
static void ConnectLeftDegenerate( GLUtesselator *tess, static void ConnectLeftDegenerate( GLUtesselator *tess,
ActiveRegion *regUp, GLUvertex *vEvent ) ActiveRegion *regUp, GLUvertex *vEvent )
/* /*
* The event vertex lies exacty on an already-processed edge or vertex. * The event vertex lies exactly on an already-processed edge or vertex.
* Adding the new vertex involves splicing it into the already-processed * Adding the new vertex involves splicing it into the already-processed
* part of the mesh. * part of the mesh.
*/ */

2
dlls/glu32/tess.c
View File

@ -192,7 +192,7 @@ static void CheckOrientation( GLUtesselator *tess )
/* The "feature merging" is not intended to be complete. There are /* The "feature merging" is not intended to be complete. There are
* special cases where edges are nearly parallel to the sweep line * special cases where edges are nearly parallel to the sweep line
* which are not implemented. The algorithm should still behave * which are not implemented. The algorithm should still behave
* robustly (ie. produce a reasonable tesselation) in the presence * robustly (ie. produce a reasonable tessellation) in the presence
* of such edges, however it may miss features which could have been * of such edges, however it may miss features which could have been
* merged. We could minimize this effect by choosing the sweep line * merged. We could minimize this effect by choosing the sweep line
* direction to be something unusual (ie. not parallel to one of the * direction to be something unusual (ie. not parallel to one of the