PageRenderTime 163ms CodeModel.GetById 17ms RepoModel.GetById 0ms app.codeStats 0ms

/uppdev/ScanLine/ScanLineFiller.cpp

http://upp-mirror.googlecode.com/
C++ | 78 lines | 55 code | 5 blank | 18 comment | 8 complexity | ed72189b2d20577cfe66bf0360e6cd27 MD5 | raw file
Possible License(s): LGPL-2.1, GPL-2.0, BSD-2-Clause, BSD-3-Clause, LGPL-3.0, GPL-3.0 
    

  1. #include "ScanLine.h"

    2. 

  2. 

    3. 

  3. struct RecScan : Rasterizer::Target {

    4. 

  4. 	ScanLine sl;

    5. 

  5. 	byte    *t;

    6. 

  6. 	int      x;

    7. 

  7. 	

    8. 

  8. 	virtual void Render(int val);

    9. 

  9. 	virtual void Render(int val, int len);

    10. 

  10. 	virtual void Start(int x, int len);

    11. 

  11. 	void Finish();

    12. 

  12. };

    13. 

  13. 

    14. 

  14. void RecScan::Start(int xmin, int xmax)

    15. 

  15. {

    16. 

  16. 	sl.data.Alloc((xmax - xmin + 1) * 2);

    17. 

  17. 	t = ~sl.data;

    18. 

  18. 	sl.xmin = 0;

    19. 

  19. }

    20. 

  20. 

    21. 

  21. void RecScan::Render(int val)

    22. 

  22. {

    23. 

  23. 	if(val == 0) {

    24. 

  24. 		*t++ = 0;

    25. 

  25. 		*t++ = 0;

    26. 

  26. 	}

    27. 

  27. 	else

    28. 

  28. 	if(val == 256) {

    29. 

  29. 		*t++ = 0;

    30. 

  30. 		*t++ = 0;

    31. 

  31. 	}

    32. 

  32. 	else

    33. 

  33. 		*t++ = val;

    34. 

  34. 	x++;

    35. 

  35. }

    36. 

  36. 

    37. 

  37. void RecScan::Render(int val, int len)

    38. 

  38. {

    39. 

  39. 	x += len;

    40. 

  40. 	if(val == 256) {

    41. 

  41. 		while(len > 0) {

    42. 

  42. 			int n = min(len, 128);

    43. 

  43. 			*t++ = 0;

    44. 

  44. 			*t++ = 128 + n - 1;

    45. 

  45. 			len -= n;

    46. 

  46. 		}

    47. 

  47. 		return;

    48. 

  48. 	}

    49. 

  49. 	if(val == 0) {

    50. 

  50. 		while(len > 0) {

    51. 

  51. 			int n = min(len, 128);

    52. 

  52. 			*t++ = 0;

    53. 

  53. 			*t++ = n - 1;

    54. 

  54. 			len -= n;

    55. 

  55. 		}

    56. 

  56. 		return;

    57. 

  57. 	}

    58. 

  58. 	while(len--)

    59. 

  59. 		*t++ = val;

    60. 

  60. }

    61. 

  61. /*

    62. 

  62. void RecScan::Finish(int cx)

    63. 

  63. {

    64. 

  64. 	cx = cx - x;

    65. 

  65. 	while(cx > 0) {

    66. 

  66. 		int n = min(cx, 128);

    67. 

  67. 		*t++ = 0;

    68. 

  68. 		*t++ = n - 1;

    69. 

  69. 		cx -= n;

    70. 

  70. 	}

    71. 

  71. 	sl.datalen = t - ~sl.data;

    72. 

  72. }

    73. 

  73. 

    74. 

  74. void RecScan::Shrink()

    75. 

  75. {

    76. 

  76. 	if(sl.datalen + 30 < 

    77. 

  77. }

    78. 

  78. */
    79.