Re-add old code in a comment block

Fraser J. Gordon · Fraser J. Gordon · commit 7f0e1fd8e5e7 · 2013-11-05T15:59:55.000Z
diff --git a/libgraphics/src/spread.cpp b/libgraphics/src/spread.cpp
@@ -58,6 +58,146 @@ static int dilateMask(const uint8_t *src, int src_y_stride, uint8_t *dst, int ra
 // radii is 254 pixels.
 void dilateDistanceXY(const uint8_t *src, uint8_t *dst, int xradius, int yradius, int width, int height, int& r_new_width, int& r_new_height)
 {
+/*
+    int new_width = width + 2 * xradius;
+	int new_height = height + 2 * yradius;
+    
+	// Compute the x distance of each pixel from the nearest set pixel.
+	uint8_t *xd;
+	xd = new uint8_t[new_width * height];
+	for(int y = 0; y < height; y++)
+	{
+		uint8_t *xdptr;
+		xdptr = xd + new_width * y;
+		
+		const uint8_t *sptr;
+		sptr = src + width * y;
+		for(int x = 0; x < width; x++)
+		{
+			// If there is a value at x, take it
+			if (sptr[x] != 0)
+			{
+				xdptr[x + xradius] = 0;
+				continue;
+			}
+			
+			// Otherwise search back...
+			int db;
+			db = 255;
+			for(int z = x; z >= 0 && (x - z) < 255; z--)
+			{
+				if (sptr[z] != 0)
+				{
+					db = x - z;
+					break;
+				}
+			}
+			
+			// Now search forwards...
+			int df;
+			df = 255;
+			for(int z = x; (z < width) && (z - x) < 255; z++)
+			{
+				if (sptr[z] != 0)
+				{
+					df = z - x;
+					break;
+				}
+			}
+			
+			// Distance is the minimum.
+			int d;
+			d = SkMin32(db, df);
+			xdptr[x + xradius] = d;
+		}
+		
+		// Now expand the fringes.
+		for(int x = 0; x < xradius; x++)
+		{
+			if (xdptr[xradius] + (xradius - x) < 255)
+				xdptr[x] = ((xradius - x) + xdptr[xradius]);
+			else
+				xdptr[x] = 255;
+            
+			if (xdptr[width + xradius - 1] + x + 1 < 255)
+				xdptr[width + xradius + x] = xdptr[width + xradius - 1] + x + 1;
+			else
+				xdptr[width + xradius + x] = 255;
+		}
+	}
+	
+	unsigned int rf;
+	rf = xradius * xradius * yradius * yradius;
+	
+	memset(dst, 0, new_width * new_height);
+	
+	// Now use xd to compute the spread mask.
+	for(int x = 0; x < new_width; x++)
+	{
+		for(int y = 0; y < new_height; y++)
+		{
+			uint8_t *dptr = dst + y * new_width + x;
+			
+			// If the distance at x, y is 0 then we are done.
+			if (y >= yradius && y < (new_height - yradius) && xd[(y - yradius) * new_width + x] == 0)
+			{
+				*dptr = 255;
+				continue;
+			}
+			
+			// Otherwise, search up.
+			*dptr = 0;
+			for(int z = y; z >= 0; z--)
+			{
+				unsigned int yf;
+				yf = (y - z) * xradius;
+				yf *= yf;
+				if (yf >= rf)
+					break;
+				
+				unsigned int xf;
+				if (z >= yradius && z < (new_height - yradius))
+					xf = yradius * xd[(z - yradius) * new_width + x];
+				else
+					xf = yradius * 255;
+				xf *= xf;
+				if (xf < rf - yf)
+				{
+					*dptr = 255;
+					break;
+				}
+			}
+			
+			if (*dptr == 255)
+				continue;
+			
+			// Search downwards
+			for(int z = y; z < new_height; z++)
+			{
+				unsigned int yf;
+				yf = (z - y) * xradius;
+				yf *= yf;
+				if (yf >= rf)
+					break;
+				
+				unsigned int xf;
+				if (z >= yradius && z < (new_height - yradius))
+					xf = yradius * xd[(z - yradius) * new_width + x];
+				else
+					xf = yradius * 255;
+				xf *= xf;
+				if (xf < rf - yf)
+				{
+					*dptr = 255;
+					break;
+				}
+			}
+		}
+	}
+	
+	r_new_width = new_width;
+	r_new_height = new_height;
+*/
     int new_width = width + 2 * xradius;
 	int new_height = height + 2 * yradius;
 
