Skip to content
Projects
Groups
Snippets
Help
This project
Loading...
Sign in / Register
Toggle navigation
W
wine-winehq
Project
Project
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Registry
Registry
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
wine
wine-winehq
Commits
22edaaef
Commit
22edaaef
authored
Jan 16, 2008
by
Francois Gouget
Committed by
Alexandre Julliard
Jan 16, 2008
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
gdi32: Small wording tweaks in comments.
parent
87fefc7e
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
2 additions
and
2 deletions
+2
-2
painting.c
dlls/gdi32/painting.c
+2
-2
No files found.
dlls/gdi32/painting.c
View file @
22edaaef
...
@@ -1041,7 +1041,7 @@ BOOL WINAPI LineDDA(INT nXStart, INT nYStart, INT nXEnd, INT nYEnd,
...
@@ -1041,7 +1041,7 @@ BOOL WINAPI LineDDA(INT nXStart, INT nYStart, INT nXEnd, INT nYEnd,
* *Very* simple bezier drawing code,
* *Very* simple bezier drawing code,
*
*
* It uses a recursive algorithm to divide the curve in a series
* It uses a recursive algorithm to divide the curve in a series
* of straight line segments. Not ideal but
for me sufficient
.
* of straight line segments. Not ideal but
sufficient for me
.
* If you are in need for something better look for some incremental
* If you are in need for something better look for some incremental
* algorithm.
* algorithm.
*
*
...
@@ -1203,7 +1203,7 @@ static void GDI_InternalBezier( POINT *Points, POINT **PtsOut, INT *dwOut,
...
@@ -1203,7 +1203,7 @@ static void GDI_InternalBezier( POINT *Points, POINT **PtsOut, INT *dwOut,
* Ptr to an array of POINTs that contain the lines that approximate the
* Ptr to an array of POINTs that contain the lines that approximate the
* Beziers. The array is allocated on the process heap and it is the caller's
* Beziers. The array is allocated on the process heap and it is the caller's
* responsibility to HeapFree it. [this is not a particularly nice interface
* responsibility to HeapFree it. [this is not a particularly nice interface
* but since we can't know in advance how many points will generate, the
* but since we can't know in advance how many points w
e w
ill generate, the
* alternative would be to call the function twice, once to determine the size
* alternative would be to call the function twice, once to determine the size
* and a second time to do the work - I decided this was too much of a pain].
* and a second time to do the work - I decided this was too much of a pain].
*/
*/
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment