![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to gif.C CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [parser3project] / parser3 / src / classes / gd|
Return to gif.C CVS log | Up to [parser3project] / parser3 / src / classes / gd |
1.3 paf 1: /** @file
2: Parser: image manipulations impl1.
3:
1.9 parser 4: Copyright (c) 2001 ArtLebedev Group (http://www.artlebedev.com)
1.3 paf 5: Author: Alexander Petrosyan <paf@design.ru> (http://design.ru/paf)
1.8 parser 6:
1.18 ! parser 7: $Id: gif.C,v 1.17 2001/10/16 07:53:31 parser Exp $
1.9 parser 8:
9: based on: gd
10:
11: Written by Tom Boutell, 5/94.
12: Copyright 1994, Cold Spring Harbor Labs.
13: Permission granted to use this code in any fashion provided
14: that this notice is retained and any alterations are
15: labeled as such. It is requested, but not required, that
16: you share extensions to this module with us so that we
17: can incorporate them into new versions.
1.3 paf 18: */
19:
1.1 paf 20: #include "gif.h"
21:
1.11 parser 22: #include "mtables.h"
23:
1.2 paf 24: //static void BrushApply(int x, int y);
25: //static void TileApply(int x, int y);
1.1 paf 26:
1.2 paf 27: void gdImage::Create(int asx, int asy) {
28: sx = asx;
29: sy = asy;
30:
31: int i;
32: pixels = (unsigned char **) malloc(sizeof(unsigned char *) * sx);
33: polyInts = 0;
34: polyAllocated = 0;
1.6 parser 35: lineWidth = 1; lineStyle=0;
1.2 paf 36: for (i=0; (i<asx); i++)
37: pixels[i] = (unsigned char *) calloc(asy);
38: colorsTotal = 0;
39: transparent = (-1);
40: interlace = 0;
1.1 paf 41: }
42:
1.18 ! parser 43: int gdImage::ColorClosest(int r, int g, int b, int tolerance)
1.1 paf 44: {
45: int i;
46: long rd, gd, bd;
47: int ct = (-1);
48: long mindist = 0;
1.2 paf 49: for (i=0; (i<(colorsTotal)); i++) {
1.1 paf 50: long dist;
1.2 paf 51: if (open[i]) {
1.1 paf 52: continue;
53: }
1.2 paf 54: rd = (red[i] - r);
55: gd = (green[i] - g);
56: bd = (blue[i] - b);
1.1 paf 57: dist = rd * rd + gd * gd + bd * bd;
1.18 ! parser 58: if ((i == 0) || (dist < mindist+tolerance)) {
1.1 paf 59: mindist = dist;
60: ct = i;
61: }
62: }
1.18 ! parser 63: return mindist<tolerance?ct:-1;
1.1 paf 64: }
65:
1.2 paf 66: int gdImage::ColorExact(int r, int g, int b)
1.1 paf 67: {
68: int i;
1.2 paf 69: for (i=0; (i<(colorsTotal)); i++) {
70: if (open[i]) {
1.1 paf 71: continue;
72: }
1.2 paf 73: if ((red[i] == r) &&
74: (green[i] == g) &&
75: (blue[i] == b)) {
1.1 paf 76: return i;
77: }
78: }
79: return -1;
80: }
81:
1.2 paf 82: int gdImage::ColorAllocate(int r, int g, int b)
1.1 paf 83: {
84: int i;
85: int ct = (-1);
1.2 paf 86: for (i=0; (i<(colorsTotal)); i++) {
87: if (open[i]) {
1.1 paf 88: ct = i;
89: break;
90: }
91: }
92: if (ct == (-1)) {
1.2 paf 93: ct = colorsTotal;
1.1 paf 94: if (ct == gdMaxColors) {
95: return -1;
96: }
1.2 paf 97: colorsTotal++;
1.1 paf 98: }
1.2 paf 99: red[ct] = r;
100: green[ct] = g;
101: blue[ct] = b;
102: open[ct] = 0;
1.1 paf 103: return ct;
104: }
105:
1.2 paf 106: int gdImage::ColorRGB(int r, int g, int b){
107: int idx=ColorExact(r,g,b);
108: return idx<0 ? ColorAllocate(r,g,b) : idx;
1.1 paf 109: }
110:
1.2 paf 111: int gdImage::Color(unsigned int rgb){
1.1 paf 112: unsigned int b=rgb, g=b>>8, r=g>>8;
1.2 paf 113: return ColorRGB(r & 0xFF,g & 0xFF,b & 0xFF);
1.1 paf 114: }
115:
1.2 paf 116: void gdImage::ColorDeallocate(int color)
1.1 paf 117: {
118: /* Mark it open. */
1.2 paf 119: open[color] = 1;
1.1 paf 120: }
121:
1.2 paf 122: void gdImage::SetColorTransparent(int color)
1.1 paf 123: {
1.2 paf 124: transparent = color;
1.1 paf 125: }
126:
127:
1.2 paf 128: void gdImage::SetPixel(int x, int y, int color)
1.1 paf 129: {
130: //paf int p;
131:
1.6 parser 132: switch (lineWidth){
1.1 paf 133: case 1: {
1.2 paf 134: DoSetPixel(x, y,color);
1.1 paf 135: return;
136: }
137: case 2: {
1.2 paf 138: DoSetPixel(x, y-1,color);
139: DoSetPixel(x-1, y,color);
140: DoSetPixel(x, y,color);
141: DoSetPixel(x+1, y,color);
142: DoSetPixel(x, y+1,color);
1.1 paf 143: return;
144: }
145: default:{
146: int i,j;
1.2 paf 147: for (i=-1;i<=1;i++) DoSetPixel(x+i, y-2,color);
148: for (j=-1;j<=1;j++) for (i=-2;i<=2;i++) DoSetPixel(x+i, y+j,color);
149: for (i=-1;i<=1;i++) DoSetPixel(x+i, y+2,color);
1.1 paf 150: return;
151: }
152: }
153: }
154:
1.2 paf 155: int gdImage::GetPixel(int x, int y)
1.1 paf 156: {
1.2 paf 157: return BoundsSafe(x, y) ? pixels[x][y]:0;
1.1 paf 158: }
159:
160: /* Bresenham as presented in Foley & Van Dam */
161:
162: /* As above, plus dashing */
163:
1.6 parser 164: #define styledSet \
1.1 paf 165: { \
1.6 parser 166: if (lineStyle) { \
167: if(!lineStyle[styleStep]) \
168: styleStep = 0; \
169: on=lineStyle[styleStep++]!=' '; \
1.1 paf 170: } \
171: if (on) { \
1.2 paf 172: SetPixel(x, y, color); \
1.1 paf 173: } \
174: }
175:
1.6 parser 176: void gdImage::Line(int x1, int y1, int x2, int y2, int color)
1.1 paf 177: {
178: int dx, dy, incr1, incr2, d, x, y, xend, yend, xdirflag, ydirflag;
1.6 parser 179: int styleStep = 0;
1.1 paf 180: int on = 1;
181: dx = abs(x2-x1);
182: dy = abs(y2-y1);
183: if (dy <= dx) {
184: d = 2*dy - dx;
185: incr1 = 2*dy;
186: incr2 = 2 * (dy - dx);
187: if (x1 > x2) {
188: x = x2;
189: y = y2;
190: ydirflag = (-1);
191: xend = x1;
192: } else {
193: x = x1;
194: y = y1;
195: ydirflag = 1;
196: xend = x2;
197: }
1.6 parser 198: styledSet;
1.1 paf 199: if (((y2 - y1) * ydirflag) > 0) {
200: while (x < xend) {
201: x++;
202: if (d <0) {
203: d+=incr1;
204: } else {
205: y++;
206: d+=incr2;
207: }
1.6 parser 208: styledSet;
1.1 paf 209: }
210: } else {
211: while (x < xend) {
212: x++;
213: if (d <0) {
214: d+=incr1;
215: } else {
216: y--;
217: d+=incr2;
218: }
1.6 parser 219: styledSet;
1.1 paf 220: }
221: }
222: } else {
223: d = 2*dx - dy;
224: incr1 = 2*dx;
225: incr2 = 2 * (dx - dy);
226: if (y1 > y2) {
227: y = y2;
228: x = x2;
229: yend = y1;
230: xdirflag = (-1);
231: } else {
232: y = y1;
233: x = x1;
234: yend = y2;
235: xdirflag = 1;
236: }
1.6 parser 237: styledSet;
1.1 paf 238: if (((x2 - x1) * xdirflag) > 0) {
239: while (y < yend) {
240: y++;
241: if (d <0) {
242: d+=incr1;
243: } else {
244: x++;
245: d+=incr2;
246: }
1.6 parser 247: styledSet;
1.1 paf 248: }
249: } else {
250: while (y < yend) {
251: y++;
252: if (d <0) {
253: d+=incr1;
254: } else {
255: x--;
256: d+=incr2;
257: }
1.6 parser 258: styledSet;
1.1 paf 259: }
260: }
261: }
262: }
263:
264: /* s and e are integers modulo 360 (degrees), with 0 degrees
265: being the rightmost extreme and degrees changing clockwise.
266: cx and cy are the center in pixels; w and h are the horizontal
267: and vertical diameter in pixels. Nice interface, but slow, since
268: I don't yet use Bresenham (I'm using an inefficient but
269: simple solution with too much work going on in it; generalizing
270: Bresenham to ellipses and partial arcs of ellipses is non-trivial,
271: at least for me) and there are other inefficiencies (small circles
272: do far too much work). */
1.11 parser 273:
274: void gdImage::Arc(int cx, int cy, int w, int h, int s, int e, int color)
275: {
1.15 parser 276: #if 0
1.14 parser 277: if(s==0 && e==360) { // full
278: if(w==h) { // circle?
279: /* Bresenham octant code, which I should use eventually */
280: int x, y, d;
281: x = 0;
282: y = w/2;
283: d = 3-w;
284: while (x <= y) {
285: SetPixel(cx+x, cy+y, color);
286: SetPixel(cx+x, cy-y, color);
287: SetPixel(cx-x, cy+y, color);
288: SetPixel(cx-x, cy-y, color);
289: SetPixel(cx+y, cy+x, color);
290: SetPixel(cx+y, cy-x, color);
291: SetPixel(cx-y, cy+x, color);
292: SetPixel(cx-y, cy-x, color);
293: if (d < 0) {
294: d += 4 * x + 6;
295: } else {
296: d += 4 * (x - y) + 10;
297: y--;
298: }
299: x++;
300: }
301: } else { // full ellipse
302: w/=2;
303: h/=2;
304: int elx, ely;
305: long aa, aa2, bb, bb2, d, dx, dy;
306:
307: elx = 0; ely = h; aa = (long)w * w; aa2 = 2 * aa;
308: bb = (long)h * h; bb2 = 2 * bb;
309: d = bb - aa * h + aa/4; dx = 0; dy = aa2 * h;
310: SetPixel(cx, cy - ely, color); SetPixel(cx, cy + ely, color);
311: SetPixel(cx - w, cy, color); SetPixel(cx + w, cy, color);
312:
313: while (dx < dy)
314: {
315: if (d > 0) { ely--; dy-=aa2; d-=dy;}
316: elx++; dx+=bb2; d+=bb+dx;
317: SetPixel(cx + elx, cy + ely, color);
318: SetPixel(cx - elx, cy + ely, color);
319: SetPixel(cx + elx, cy - ely, color);
320: SetPixel(cx - elx, cy - ely, color);
321: };
322: d+=(3 * (aa - bb)/2 - (dx + dy))/2;
323: while (ely > 0)
324: {
325: if (d < 0) {elx++; dx+=bb2; d+=bb + dx;}
326: ely--; dy-=aa2; d+=aa - dy;
327: SetPixel(cx + elx, cy + ely, color);
328: SetPixel(cx - elx, cy + ely, color);
329: SetPixel(cx + elx, cy - ely, color);
330: SetPixel(cx - elx, cy - ely, color);
331: };
332: }
333: } else {
1.15 parser 334: #endif
1.13 parser 335: int i;
336: int lx = 0, ly = 0;
337: int w2, h2;
338: w2 = w/2;
339: h2 = h/2;
340: while (e < s) {
341: e += 360;
342: }
343: for (i=s; (i <= e); i++) {
344: int x, y;
345: x = ((long)cost[i % 360] * (long)w2 / costScale) + cx;
346: y = ((long)sint[i % 360] * (long)h2 / sintScale) + cy;
347: if (i != s) {
348: Line(lx, ly, x, y, color);
349: }
350: lx = x;
351: ly = y;
352: }
1.15 parser 353: #if 0
1.11 parser 354: }
1.15 parser 355: #endif
1.11 parser 356: }
1.14 parser 357:
358: /*
359:
360: // http://firststeps.narod.ru/cgi/18.html
361:
362: int CGIScreen::Ellipse(int exc, int eyc, int ea, int eb , unsigned char Color)
363: {
364: int elx, ely;
365: long aa, aa2, bb, bb2, d, dx, dy;
366:
367: elx = 0; ely = eb; aa = (long)ea * ea; aa2 = 2 * aa;
368: bb = (long)eb * eb; bb2 = 2 * bb;
369: d = bb - aa * eb + aa/4; dx = 0; dy = aa2 * eb;
370: PutPixel(exc, eyc - ely, Color); PutPixel(exc, eyc + ely, Color);
371: PutPixel(exc - ea, eyc, Color); PutPixel(exc + ea, eyc, Color);
372:
373: while (dx < dy)
374: {
375: if (d > 0) { ely--; dy-=aa2; d-=dy;}
376: elx++; dx+=bb2; d+=bb+dx;
377: PutPixel(exc + elx, eyc + ely, Color);
378: PutPixel(exc - elx, eyc + ely, Color);
379: PutPixel(exc + elx, eyc - ely, Color);
380: PutPixel(exc - elx, eyc - ely, Color);
381: };
382: d+=(3 * (aa - bb)/2 - (dx + dy))/2;
383: while (ely > 0)
384: {
385: if (d < 0) {elx++; dx+=bb2; d+=bb + dx;}
386: ely--; dy-=aa2; d+=aa - dy;
387: PutPixel(exc + elx, eyc + ely, Color);
388: PutPixel(exc - elx, eyc + ely, Color);
389: PutPixel(exc + elx, eyc - ely, Color);
390: PutPixel(exc - elx, eyc - ely, Color);
391: };
392: return 0;
393: };
394:
395: */
1.11 parser 396:
1.12 parser 397:
398: void gdImage::Sector(int cx, int cy, int w, int h, int s, int e, int color)
399: {
400: int i;
401: int lx = 0, ly = 0;
402: int w2, h2;
403: w2 = w/2;
404: h2 = h/2;
405: while (e < s) {
406: e += 360;
407: }
408: for (i=s; (i <= e); i++) {
409: int x, y;
410: x = ((long)cost[i % 360] * (long)w2 / costScale) + cx;
411: y = ((long)sint[i % 360] * (long)h2 / sintScale) + cy;
412: if(i==s || i==e)
413: Line(cx, cy, x, y, color);
414: if (i != s) {
415: Line(lx, ly, x, y, color);
416: }
417: lx = x;
418: ly = y;
419: }
420: }
1.11 parser 421:
422:
1.1 paf 423:
1.2 paf 424: void gdImage::FillToBorder(int x, int y, int border, int color)
1.1 paf 425: {
1.4 paf 426: if(!BoundsSafe(x, y)) //PAF
427: return;
428:
1.1 paf 429: int lastBorder;
430: /* Seek left */
431: int leftLimit, rightLimit;
432: int i;
433: leftLimit = (-1);
434: if (border < 0) {
435: /* Refuse to fill to a non-solid border */
436: return;
437: }
438: for (i = x; (i >= 0); i--) {
1.2 paf 439: if (GetPixel(i, y) == border) {
1.1 paf 440: break;
441: }
1.2 paf 442: SetPixel(i, y, color);
1.1 paf 443: leftLimit = i;
444: }
445: if (leftLimit == (-1)) {
446: return;
447: }
448: /* Seek right */
449: rightLimit = x;
1.2 paf 450: for (i = (x+1); (i < sx); i++) {
451: if (GetPixel(i, y) == border) {
1.1 paf 452: break;
453: }
1.2 paf 454: SetPixel(i, y, color);
1.1 paf 455: rightLimit = i;
456: }
457: /* Look at lines above and below and start paints */
458: /* Above */
459: if (y > 0) {
460: lastBorder = 1;
461: for (i = leftLimit; (i <= rightLimit); i++) {
462: int c;
1.2 paf 463: c = GetPixel(i, y-1);
1.1 paf 464: if (lastBorder) {
465: if ((c != border) && (c != color)) {
1.2 paf 466: FillToBorder(i, y-1,
1.1 paf 467: border, color);
468: lastBorder = 0;
469: }
470: } else if ((c == border) || (c == color)) {
471: lastBorder = 1;
472: }
473: }
474: }
475: /* Below */
1.2 paf 476: if (y < ((sy) - 1)) {
1.1 paf 477: lastBorder = 1;
478: for (i = leftLimit; (i <= rightLimit); i++) {
479: int c;
1.2 paf 480: c = GetPixel(i, y+1);
1.1 paf 481: if (lastBorder) {
482: if ((c != border) && (c != color)) {
1.2 paf 483: FillToBorder(i, y+1,
1.1 paf 484: border, color);
485: lastBorder = 0;
486: }
487: } else if ((c == border) || (c == color)) {
488: lastBorder = 1;
489: }
490: }
491: }
492: }
493:
1.2 paf 494: void gdImage::Fill(int x, int y, int color)
1.1 paf 495: {
1.4 paf 496: if(!BoundsSafe(x, y)) //PAF
497: return;
498:
1.1 paf 499: int lastBorder;
500: int old;
501: int leftLimit, rightLimit;
502: int i;
1.2 paf 503: old = GetPixel(x, y);
1.1 paf 504: if (old == color) {
505: /* Nothing to be done */
506: return;
507: }
508: /* Seek left */
509: leftLimit = (-1);
510: for (i = x; (i >= 0); i--) {
1.2 paf 511: if (GetPixel(i, y) != old) {
1.1 paf 512: break;
513: }
1.2 paf 514: SetPixel(i, y, color);
1.1 paf 515: leftLimit = i;
516: }
517: if (leftLimit == (-1)) {
518: return;
519: }
520: /* Seek right */
521: rightLimit = x;
1.2 paf 522: for (i = (x+1); (i < sx); i++) {
523: if (GetPixel(i, y) != old) {
1.1 paf 524: break;
525: }
1.2 paf 526: SetPixel(i, y, color);
1.1 paf 527: rightLimit = i;
528: }
529: /* Look at lines above and below and start paints */
530: /* Above */
531: if (y > 0) {
532: lastBorder = 1;
533: for (i = leftLimit; (i <= rightLimit); i++) {
534: int c;
1.2 paf 535: c = GetPixel(i, y-1);
1.1 paf 536: if (lastBorder) {
537: if (c == old) {
1.2 paf 538: Fill(i, y-1, color);
1.1 paf 539: lastBorder = 0;
540: }
541: } else if (c != old) {
542: lastBorder = 1;
543: }
544: }
545: }
546: /* Below */
1.2 paf 547: if (y < ((sy) - 1)) {
1.1 paf 548: lastBorder = 1;
549: for (i = leftLimit; (i <= rightLimit); i++) {
550: int c;
1.2 paf 551: c = GetPixel(i, y+1);
1.1 paf 552: if (lastBorder) {
553: if (c == old) {
1.2 paf 554: Fill(i, y+1, color);
1.1 paf 555: lastBorder = 0;
556: }
557: } else if (c != old) {
558: lastBorder = 1;
559: }
560: }
561: }
562: }
563:
1.2 paf 564: void gdImage::Rectangle(int x1, int y1, int x2, int y2, int color)
1.1 paf 565: {
1.2 paf 566: Line(x1, y1, x2, y1, color);
567: Line(x1, y2, x2, y2, color);
568: Line(x1, y1, x1, y2, color);
569: Line(x2, y1, x2, y2, color);
1.1 paf 570: }
571:
1.2 paf 572: void gdImage::FilledRectangle(int x1, int y1, int x2, int y2, int color)
1.1 paf 573: {
1.10 parser 574: if(x1>x2) {
575: int t=x1;
576: x1=x2;
577: x2=t;
578: }
579: if(y1>y2) {
580: int t=y1;
581: y1=y2;
582: y2=t;
583: }
1.1 paf 584: int x, y;
1.10 parser 585:
1.2 paf 586: for (y=y1; (y<=y2); y++)
587: for (x=x1; (x<=x2); x++)
588: SetPixel(x, y, color);
1.1 paf 589: }
590:
1.2 paf 591: void gdImage::Copy(gdImage& dst, int dstX, int dstY, int srcX, int srcY, int w, int h)
1.1 paf 592: {
593: int c;
594: int x, y;
595: int tox, toy;
596: int i;
597: int colorMap[gdMaxColors];
598: for (i=0; (i<gdMaxColors); i++) {
599: colorMap[i] = (-1);
600: }
601: toy = dstY;
602: for (y=srcY; (y < (srcY + h)); y++) {
603: tox = dstX;
604: for (x=srcX; (x < (srcX + w)); x++) {
605: int nc;
1.2 paf 606: c = GetPixel(x, y);
1.1 paf 607: /* Added 7/24/95: support transparent copies */
1.2 paf 608: if (GetTransparent() == c) {
1.1 paf 609: tox++;
610: continue;
611: }
612: /* Have we established a mapping for this color? */
613: if (colorMap[c] == (-1)) {
614: /* If it's the same image, mapping is trivial */
1.2 paf 615: if (&dst == this) {
1.1 paf 616: nc = c;
617: } else {
618: /* First look for an exact match */
1.2 paf 619: nc = dst.ColorExact(
620: red[c], green[c],
621: blue[c]);
1.1 paf 622: }
623: if (nc == (-1)) {
624: /* No, so try to allocate it */
1.2 paf 625: nc = dst.ColorAllocate(
626: red[c], green[c],
627: blue[c]);
1.1 paf 628: /* If we're out of colors, go for the
629: closest color */
630: if (nc == (-1)) {
1.2 paf 631: nc = dst.ColorClosest(
632: red[c], green[c],
633: blue[c]);
1.1 paf 634: }
635: }
636: colorMap[c] = nc;
637: }
1.2 paf 638: dst.SetPixel(tox, toy, colorMap[c]);
1.1 paf 639: tox++;
640: }
641: toy++;
642: }
643: }
1.16 parser 644:
1.18 ! parser 645: static double round(double param) { return floor(param+0.5); }
! 646: void gdImage::CopyResampled(gdImage& dst,
! 647: int dstX, int dstY,
! 648: int srcX, int srcY,
! 649: int dstW, int dstH,
! 650: int srcW, int srcH)
1.16 parser 651: {
652: gdImage& src=*this;
653: int x, y;
1.18 ! parser 654: for (y = dstY; (y < dstY + dstH); y++) {
! 655: for (x = dstX; (x < dstX + dstW); x++) {
! 656: int pd = dst.GetPixel (x, y);
! 657: /* Added 7/24/95: support transparent copies */
! 658: if (src.GetTransparent() == pd)
! 659: continue;
! 660:
! 661: float sy1, sy2, sx1, sx2;
! 662: float sx, sy;
! 663: float spixels = 0;
! 664: float red = 0.0, green = 0.0, blue = 0.0;
! 665: sy1 = ((float) y - (float) dstY) * (float) srcH /
! 666: (float) dstH;
! 667: sy2 = ((float) (y + 1) - (float) dstY) * (float) srcH /
! 668: (float) dstH;
! 669: sy = sy1;
! 670: do
! 671: {
! 672: float yportion;
! 673: if (floor (sy) == floor (sy1))
! 674: {
! 675: yportion = 1.0 - (sy - floor (sy));
! 676: if (yportion > sy2 - sy1)
! 677: {
! 678: yportion = sy2 - sy1;
! 679: }
! 680: sy = floor (sy);
! 681: }
! 682: else if (sy == floor (sy2))
! 683: {
! 684: yportion = sy2 - floor (sy2);
! 685: }
! 686: else
! 687: {
! 688: yportion = 1.0;
! 689: }
! 690: sx1 = ((float) x - (float) dstX) * (float) srcW /
! 691: dstW;
! 692: sx2 = ((float) (x + 1) - (float) dstX) * (float) srcW /
! 693: dstW;
! 694: sx = sx1;
! 695: do
! 696: {
! 697: float xportion;
! 698: float pcontribution;
! 699: int p;
! 700: if (floor (sx) == floor (sx1))
! 701: {
! 702: xportion = 1.0 - (sx - floor (sx));
! 703: if (xportion > sx2 - sx1)
! 704: {
! 705: xportion = sx2 - sx1;
1.16 parser 706: }
1.18 ! parser 707: sx = floor (sx);
! 708: }
! 709: else if (sx == floor (sx2))
! 710: {
! 711: xportion = sx2 - floor (sx2);
1.16 parser 712: }
1.18 ! parser 713: else
! 714: {
! 715: xportion = 1.0;
! 716: }
! 717: pcontribution = xportion * yportion;
! 718: p = src.GetPixel (
! 719: (int) sx,
! 720: (int) sy);
! 721: red += Red (p) * pcontribution;
! 722: green += Green (p) * pcontribution;
! 723: blue += Blue (p) * pcontribution;
! 724: spixels += xportion * yportion;
! 725: sx += 1.0;
! 726: } while (sx < sx2);
! 727: sy += 1.0;
! 728: } while (sy < sy2);
! 729: if (spixels != 0.0) {
! 730: red /= spixels;
! 731: green /= spixels;
! 732: blue /= spixels;
! 733: }
! 734: /* Clamping to allow for rounding errors above */
! 735: if (red > 255.0)
! 736: red = 255.0;
! 737: if (green > 255.0)
! 738: green = 255.0;
! 739: if (blue > 255.0)
! 740: blue = 255.0;
! 741:
! 742: red=round(red);
! 743: green=round(green);
! 744: blue=round(blue);
! 745: /* First look for an exact match */
! 746: int nc = dst.ColorExact(red, green, blue);
! 747: if (nc == (-1)) {
! 748: /* No, so go for the closest color with high tolerance */
! 749: nc = dst.ColorClosest(red, green, blue, 100);
! 750: if (nc == (-1)) {
! 751: /* Not found with even high tolerance, so try to allocate it */
! 752: nc = dst.ColorAllocate(red, green,blue);
! 753:
! 754: /* If we're out of colors, go for the closest color */
! 755: if (nc == (-1))
! 756: nc = dst.ColorClosest(red, green, blue);
1.16 parser 757: }
758: }
1.18 ! parser 759: dst.SetPixel(x, y, nc);
1.16 parser 760: }
1.18 ! parser 761: }
1.16 parser 762: }
1.1 paf 763:
1.2 paf 764: static int gdGetWord(int *result, FILE *in)
1.1 paf 765: {
766: int r;
767: r = getc(in);
768: if (r == EOF) {
769: return 0;
770: }
771: *result = r << 8;
772: r = getc(in);
773: if (r == EOF) {
774: return 0;
775: }
776: *result += r;
777: return 1;
778: }
779:
1.2 paf 780: static void gdPutWord(int w, FILE *out)
1.1 paf 781: {
782: putc((unsigned char)(w >> 8), out);
783: putc((unsigned char)(w & 0xFF), out);
784: }
785:
1.2 paf 786: static int gdGetByte(int *result, FILE *in)
1.1 paf 787: {
788: int r;
789: r = getc(in);
790: if (r == EOF) {
791: return 0;
792: }
793: *result = r;
794: return 1;
795: }
796:
1.6 parser 797: void gdImage::Polygon(Point *p, int n, int c, bool closed)
1.1 paf 798: {
799: int i;
800: int lx, ly;
801: if (!n) {
802: return;
803: }
804: lx = p->x;
805: ly = p->y;
1.6 parser 806: if(closed)
807: Line(lx, ly, p[n-1].x, p[n-1].y, c);
1.1 paf 808: for (i=1; (i < n); i++) {
809: p++;
1.2 paf 810: Line(lx, ly, p->x, p->y, c);
1.1 paf 811: lx = p->x;
812: ly = p->y;
813: }
814: }
815:
1.5 paf 816: static int gdCompareInt(const void *a, const void *b)
817: {
818: return (*(const int *)a) - (*(const int *)b);
819: }
820:
821:
1.1 paf 822:
1.2 paf 823: void gdImage::FilledPolygon(Point *p, int n, int c)
1.1 paf 824: {
825: int i;
826: int y;
827: int y1, y2;
828: int ints;
829: if (!n) {
830: return;
831: }
1.2 paf 832: if (!polyAllocated) {
833: polyInts = (int *) malloc(sizeof(int) * n);
834: polyAllocated = n;
1.1 paf 835: }
1.2 paf 836: if (polyAllocated < n) {
837: while (polyAllocated < n) {
838: polyAllocated *= 2;
1.1 paf 839: }
1.2 paf 840: polyInts = (int *) realloc(polyInts,
841: sizeof(int) * polyAllocated);
1.1 paf 842: }
843: y1 = p[0].y;
844: y2 = p[0].y;
845: for (i=1; (i < n); i++) {
846: if (p[i].y < y1) {
847: y1 = p[i].y;
848: }
849: if (p[i].y > y2) {
850: y2 = p[i].y;
851: }
852: }
853: for (y=y1; (y <= y2); y++) {
854: int interLast = 0;
855: int dirLast = 0;
856: int interFirst = 1;
857: ints = 0;
858: for (i=0; (i <= n); i++) {
859: int x1, x2;
860: int y1, y2;
861: int dir;
862: int ind1, ind2;
863: int lastInd1 = 0;
864: if ((i == n) || (!i)) {
865: ind1 = n-1;
866: ind2 = 0;
867: } else {
868: ind1 = i-1;
869: ind2 = i;
870: }
871: y1 = p[ind1].y;
872: y2 = p[ind2].y;
873: if (y1 < y2) {
874: y1 = p[ind1].y;
875: y2 = p[ind2].y;
876: x1 = p[ind1].x;
877: x2 = p[ind2].x;
878: dir = -1;
879: } else if (y1 > y2) {
880: y2 = p[ind1].y;
881: y1 = p[ind2].y;
882: x2 = p[ind1].x;
883: x1 = p[ind2].x;
884: dir = 1;
885: } else {
886: /* Horizontal; just draw it */
1.2 paf 887: Line(
1.1 paf 888: p[ind1].x, y1,
889: p[ind2].x, y1,
890: c);
891: continue;
892: }
893: if ((y >= y1) && (y <= y2)) {
894: int inter =
895: (y-y1) * (x2-x1) / (y2-y1) + x1;
896: /* Only count intersections once
897: except at maxima and minima. Also,
898: if two consecutive intersections are
899: endpoints of the same horizontal line
900: that is not at a maxima or minima,
901: discard the leftmost of the two. */
902: if (!interFirst) {
903: if ((p[ind1].y == p[lastInd1].y) &&
904: (p[ind1].x != p[lastInd1].x)) {
905: if (dir == dirLast) {
906: if (inter > interLast) {
907: /* Replace the old one */
1.2 paf 908: polyInts[ints] = inter;
1.1 paf 909: } else {
910: /* Discard this one */
911: }
912: continue;
913: }
914: }
915: if (inter == interLast) {
916: if (dir == dirLast) {
917: continue;
918: }
919: }
920: }
921: if (i > 0) {
1.2 paf 922: polyInts[ints++] = inter;
1.1 paf 923: }
924: lastInd1 = i;
925: dirLast = dir;
926: interLast = inter;
927: interFirst = 0;
928: }
929: }
1.2 paf 930: qsort(polyInts, ints, sizeof(int), gdCompareInt);
931: for (i=0; (i < (ints-1)); i+=2)
932: Line(polyInts[i], y, polyInts[i+1], y, c);
1.1 paf 933: }
934: }
935:
1.2 paf 936: //001005paf this used in drawing straight lines in gdImage::FilledPolygonReplaceColor
937: void gdImage::LineReplaceColor(int x1, int y1, int x2, int y2, int a, int b) {
1.1 paf 938: if(y1!=y2)
939: return;
940:
941: for(int x=x1; x<=x2; x++) {
1.2 paf 942: unsigned char *pixel=&pixels[x][y1];
1.1 paf 943: if(*pixel==a)
944: *pixel=b;
945: }
946: }
947:
1.2 paf 948: void gdImage::FilledPolygonReplaceColor(Point *p, int n, int a, int b)
1.1 paf 949: {
950: int i;
951: int y;
952: int y1, y2;
953: int ints;
954: if (!n) {
955: return;
956: }
1.2 paf 957: if (!polyAllocated) {
958: polyInts = (int *) malloc(sizeof(int) * n);
959: polyAllocated = n;
1.1 paf 960: }
1.2 paf 961: if (polyAllocated < n) {
962: while (polyAllocated < n) {
963: polyAllocated *= 2;
1.1 paf 964: }
1.2 paf 965: polyInts = (int *) realloc(polyInts,
966: sizeof(int) * polyAllocated);
1.1 paf 967: }
968: y1 = p[0].y;
969: y2 = p[0].y;
970: for (i=1; (i < n); i++) {
971: if (p[i].y < y1) {
972: y1 = p[i].y;
973: }
974: if (p[i].y > y2) {
975: y2 = p[i].y;
976: }
977: }
978: for (y=y1; (y <= y2); y++) {
979: int interLast = 0;
980: int dirLast = 0;
981: int interFirst = 1;
982: ints = 0;
983: for (i=0; (i <= n); i++) {
984: int x1, x2;
985: int y1, y2;
986: int dir;
987: int ind1, ind2;
988: int lastInd1 = 0;
989: if ((i == n) || (!i)) {
990: ind1 = n-1;
991: ind2 = 0;
992: } else {
993: ind1 = i-1;
994: ind2 = i;
995: }
996: y1 = p[ind1].y;
997: y2 = p[ind2].y;
998: if (y1 < y2) {
999: y1 = p[ind1].y;
1000: y2 = p[ind2].y;
1001: x1 = p[ind1].x;
1002: x2 = p[ind2].x;
1003: dir = -1;
1004: } else if (y1 > y2) {
1005: y2 = p[ind1].y;
1006: y1 = p[ind2].y;
1007: x2 = p[ind1].x;
1008: x1 = p[ind2].x;
1009: dir = 1;
1010: } else {
1011: /* Horizontal; just draw it */
1.2 paf 1012: LineReplaceColor(
1.1 paf 1013: p[ind1].x, y1,
1014: p[ind2].x, y1,
1015: a,b);
1016: continue;
1017: }
1018: if ((y >= y1) && (y <= y2)) {
1019: int inter =
1020: (y-y1) * (x2-x1) / (y2-y1) + x1;
1021: /* Only count intersections once
1022: except at maxima and minima. Also,
1023: if two consecutive intersections are
1024: endpoints of the same horizontal line
1025: that is not at a maxima or minima,
1026: discard the leftmost of the two. */
1027: if (!interFirst) {
1028: if ((p[ind1].y == p[lastInd1].y) &&
1029: (p[ind1].x != p[lastInd1].x)) {
1030: if (dir == dirLast) {
1031: if (inter > interLast) {
1032: /* Replace the old one */
1.2 paf 1033: polyInts[ints] = inter;
1.1 paf 1034: } else {
1035: /* Discard this one */
1036: }
1037: continue;
1038: }
1039: }
1040: if (inter == interLast) {
1041: if (dir == dirLast) {
1042: continue;
1043: }
1044: }
1045: }
1046: if (i > 0) {
1.2 paf 1047: polyInts[ints++] = inter;
1.1 paf 1048: }
1049: lastInd1 = i;
1050: dirLast = dir;
1051: interLast = inter;
1052: interFirst = 0;
1053: }
1054: }
1.2 paf 1055: qsort(polyInts, ints, sizeof(int), gdCompareInt);
1.1 paf 1056: for (i=0; (i < (ints-1)); i+=2) {
1.2 paf 1057: LineReplaceColor(polyInts[i], y,
1058: polyInts[i+1], y, a,b);
1.1 paf 1059: }
1060: }
1061: }
1062:
1.2 paf 1063: void gdImage::SetInterlace(int interlaceArg)
1.1 paf 1064: {
1.2 paf 1065: interlace = interlaceArg;
1.1 paf 1066: }
1067:
1.6 parser 1068: void gdImage::SetLineWidth(int width)
1069: {
1070: lineWidth=width;
1071: }
1072:
1073: void gdImage::SetLineStyle(const char *alineStyle)
1.1 paf 1074: {
1.6 parser 1075: lineStyle=alineStyle;
1.1 paf 1076: }
1077: