diff --git a/actions/blend.js b/actions/blend.js deleted file mode 100755 index f08232b..0000000 --- a/actions/blend.js +++ /dev/null @@ -1,508 +0,0 @@ -/* - * Pixastic Lib - Blend - v0.1.1 - * Copyright (c) 2008 Jacob Seidelin, jseidelin@nihilogic.dk, http://blog.nihilogic.dk/ - * License: [http://www.pixastic.com/lib/license.txt] - */ - -Pixastic.Actions.blend = { - - process : function(params) { - var amount = parseFloat(params.options.amount); - var mode = (params.options.mode || "normal").toLowerCase(); - var image = params.options.image; - - amount = Math.max(0,Math.min(1,amount)); - - if (!image) return false; - - if (Pixastic.Client.hasCanvasImageData()) { - - var rect = params.options.rect; - var data = Pixastic.prepareData(params); - var w = rect.width; - var h = rect.height; - - params.useData = false; - - var otherCanvas = document.createElement("canvas"); - otherCanvas.width = params.canvas.width; - otherCanvas.height = params.canvas.height; - var otherCtx = otherCanvas.getContext("2d"); - otherCtx.drawImage(image,0,0); - - var params2 = {canvas:otherCanvas,options:params.options}; - var data2 = Pixastic.prepareData(params2); - var dataDesc2 = params2.canvasData; - - var p = w*h; - var pix = p*4; - var pix1, pix2; - var r1, g1, b1; - var r2, g2, b2; - var r3, g3, b3; - var r4, g4, b4; - - var dataChanged = false; - - switch (mode) { - case "normal" : - //while (p--) { - // data2[pix-=4] = data2[pix]; - // data2[pix1=pix+1] = data2[pix1]; - // data2[pix2=pix+2] = data2[pix2]; - //} - break; - - case "multiply" : - while (p--) { - data2[pix-=4] = data[pix] * data2[pix] / 255; - data2[pix1=pix+1] = data[pix1] * data2[pix1] / 255; - data2[pix2=pix+2] = data[pix2] * data2[pix2] / 255; - } - dataChanged = true; - break; - - case "lighten" : - while (p--) { - if ((r1 = data[pix-=4]) > data2[pix]) - data2[pix] = r1; - if ((g1 = data[pix1=pix+1]) > data2[pix1]) - data2[pix1] = g1; - if ((b1 = data[pix2=pix+2]) > data2[pix2]) - data2[pix2] = b1; - } - dataChanged = true; - break; - - case "darken" : - while (p--) { - if ((r1 = data[pix-=4]) < data2[pix]) - data2[pix] = r1; - if ((g1 = data[pix1=pix+1]) < data2[pix1]) - data2[pix1] = g1; - if ((b1 = data[pix2=pix+2]) < data2[pix2]) - data2[pix2] = b1; - - } - dataChanged = true; - break; - - case "darkercolor" : - while (p--) { - if (((r1 = data[pix-=4])*0.3+(g1 = data[pix1=pix+1])*0.59+(b1 = data[pix2=pix+2])*0.11) <= (data2[pix]*0.3+data2[pix1]*0.59+data2[pix2]*0.11)) { - data2[pix] = r1; - data2[pix1] = g1; - data2[pix2] = b1; - } - } - dataChanged = true; - break; - - case "lightercolor" : - while (p--) { - if (((r1 = data[pix-=4])*0.3+(g1 = data[pix1=pix+1])*0.59+(b1 = data[pix2=pix+2])*0.11) > (data2[pix]*0.3+data2[pix1]*0.59+data2[pix2]*0.11)) { - data2[pix] = r1; - data2[pix1] = g1; - data2[pix2] = b1; - } - } - dataChanged = true; - break; - - case "lineardodge" : - /* - otherCtx.globalCompositeOperation = "source-over"; - otherCtx.drawImage(params.canvas, 0, 0); - otherCtx.globalCompositeOperation = "lighter"; - otherCtx.drawImage(image, 0, 0); - */ - - while (p--) { - if ((r3 = data[pix-=4] + data2[pix]) > 255) - data2[pix] = 255; - else - data2[pix] = r3; - if ((g3 = data[pix1=pix+1] + data2[pix1]) > 255) - data2[pix1] = 255; - else - data2[pix1] = g3; - if ((b3 = data[pix2=pix+2] + data2[pix2]) > 255) - data2[pix2] = 255; - else - data2[pix2] = b3; - } - dataChanged = true; - - break; - - case "linearburn" : - while (p--) { - if ((r3 = data[pix-=4] + data2[pix]) < 255) - data2[pix] = 0; - else - data2[pix] = (r3 - 255); - if ((g3 = data[pix1=pix+1] + data2[pix1]) < 255) - data2[pix1] = 0; - else - data2[pix1] = (g3 - 255); - if ((b3 = data[pix2=pix+2] + data2[pix2]) < 255) - data2[pix2] = 0; - else - data2[pix2] = (b3 - 255); - } - dataChanged = true; - break; - - case "difference" : - while (p--) { - if ((r3 = data[pix-=4] - data2[pix]) < 0) - data2[pix] = -r3; - else - data2[pix] = r3; - if ((g3 = data[pix1=pix+1] - data2[pix1]) < 0) - data2[pix1] = -g3; - else - data2[pix1] = g3; - if ((b3 = data[pix2=pix+2] - data2[pix2]) < 0) - data2[pix2] = -b3; - else - data2[pix2] = b3; - } - dataChanged = true; - break; - - case "screen" : - while (p--) { - data2[pix-=4] = (255 - ( ((255-data2[pix])*(255-data[pix])) >> 8)); - data2[pix1=pix+1] = (255 - ( ((255-data2[pix1])*(255-data[pix1])) >> 8)); - data2[pix2=pix+2] = (255 - ( ((255-data2[pix2])*(255-data[pix2])) >> 8)); - } - dataChanged = true; - break; - - case "exclusion" : - var div_2_255 = 2 / 255; - while (p--) { - data2[pix-=4] = (r1 = data[pix]) - (r1 * div_2_255 - 1) * data2[pix]; - data2[pix1=pix+1] = (g1 = data[pix1]) - (g1 * div_2_255 - 1) * data2[pix1]; - data2[pix2=pix+2] = (b1 = data[pix2]) - (b1 * div_2_255 - 1) * data2[pix2]; - } - dataChanged = true; - break; - - case "overlay" : - var div_2_255 = 2 / 255; - while (p--) { - if ((r1 = data[pix-=4]) < 128) - data2[pix] = data2[pix]*r1*div_2_255; - else - data2[pix] = 255 - (255-data2[pix])*(255-r1)*div_2_255; - - if ((g1 = data[pix1=pix+1]) < 128) - data2[pix1] = data2[pix1]*g1*div_2_255; - else - data2[pix1] = 255 - (255-data2[pix1])*(255-g1)*div_2_255; - - if ((b1 = data[pix2=pix+2]) < 128) - data2[pix2] = data2[pix2]*b1*div_2_255; - else - data2[pix2] = 255 - (255-data2[pix2])*(255-b1)*div_2_255; - - } - dataChanged = true; - break; - - case "softlight" : - var div_2_255 = 2 / 255; - while (p--) { - if ((r1 = data[pix-=4]) < 128) - data2[pix] = ((data2[pix]>>1) + 64) * r1 * div_2_255; - else - data2[pix] = 255 - (191 - (data2[pix]>>1)) * (255-r1) * div_2_255; - - if ((g1 = data[pix1=pix+1]) < 128) - data2[pix1] = ((data2[pix1]>>1)+64) * g1 * div_2_255; - else - data2[pix1] = 255 - (191 - (data2[pix1]>>1)) * (255-g1) * div_2_255; - - if ((b1 = data[pix2=pix+2]) < 128) - data2[pix2] = ((data2[pix2]>>1)+64) * b1 * div_2_255; - else - data2[pix2] = 255 - (191 - (data2[pix2]>>1)) * (255-b1) * div_2_255; - - } - dataChanged = true; - break; - - case "hardlight" : - var div_2_255 = 2 / 255; - while (p--) { - if ((r2 = data2[pix-=4]) < 128) - data2[pix] = data[pix] * r2 * div_2_255; - else - data2[pix] = 255 - (255-data[pix]) * (255-r2) * div_2_255; - - if ((g2 = data2[pix1=pix+1]) < 128) - data2[pix1] = data[pix1] * g2 * div_2_255; - else - data2[pix1] = 255 - (255-data[pix1]) * (255-g2) * div_2_255; - - if ((b2 = data2[pix2=pix+2]) < 128) - data2[pix2] = data[pix2] * b2 * div_2_255; - else - data2[pix2] = 255 - (255-data[pix2]) * (255-b2) * div_2_255; - - } - dataChanged = true; - break; - - case "colordodge" : - while (p--) { - if ((r3 = (data[pix-=4]<<8)/(255-(r2 = data2[pix]))) > 255 || r2 == 255) - data2[pix] = 255; - else - data2[pix] = r3; - - if ((g3 = (data[pix1=pix+1]<<8)/(255-(g2 = data2[pix1]))) > 255 || g2 == 255) - data2[pix1] = 255; - else - data2[pix1] = g3; - - if ((b3 = (data[pix2=pix+2]<<8)/(255-(b2 = data2[pix2]))) > 255 || b2 == 255) - data2[pix2] = 255; - else - data2[pix2] = b3; - } - dataChanged = true; - break; - - case "colorburn" : - while (p--) { - if ((r3 = 255-((255-data[pix-=4])<<8)/data2[pix]) < 0 || data2[pix] == 0) - data2[pix] = 0; - else - data2[pix] = r3; - - if ((g3 = 255-((255-data[pix1=pix+1])<<8)/data2[pix1]) < 0 || data2[pix1] == 0) - data2[pix1] = 0; - else - data2[pix1] = g3; - - if ((b3 = 255-((255-data[pix2=pix+2])<<8)/data2[pix2]) < 0 || data2[pix2] == 0) - data2[pix2] = 0; - else - data2[pix2] = b3; - } - dataChanged = true; - break; - - case "linearlight" : - while (p--) { - if ( ((r3 = 2*(r2=data2[pix-=4])+data[pix]-256) < 0) || (r2 < 128 && r3 < 0)) { - data2[pix] = 0 - } else { - if (r3 > 255) - data2[pix] = 255; - else - data2[pix] = r3; - } - if ( ((g3 = 2*(g2=data2[pix1=pix+1])+data[pix1]-256) < 0) || (g2 < 128 && g3 < 0)) { - data2[pix1] = 0 - } else { - if (g3 > 255) - data2[pix1] = 255; - else - data2[pix1] = g3; - } - if ( ((b3 = 2*(b2=data2[pix2=pix+2])+data[pix2]-256) < 0) || (b2 < 128 && b3 < 0)) { - data2[pix2] = 0 - } else { - if (b3 > 255) - data2[pix2] = 255; - else - data2[pix2] = b3; - } - } - dataChanged = true; - break; - - case "vividlight" : - while (p--) { - if ((r2=data2[pix-=4]) < 128) { - if (r2) { - if ((r3 = 255 - ((255-data[pix])<<8) / (2*r2)) < 0) - data2[pix] = 0; - else - data2[pix] = r3 - } else { - data2[pix] = 0; - } - } else if ((r3 = (r4=2*r2-256)) < 255) { - if ((r3 = (data[pix]<<8)/(255-r4)) > 255) - data2[pix] = 255; - else - data2[pix] = r3; - } else { - if (r3 < 0) - data2[pix] = 0; - else - data2[pix] = r3 - } - - if ((g2=data2[pix1=pix+1]) < 128) { - if (g2) { - if ((g3 = 255 - ((255-data[pix1])<<8) / (2*g2)) < 0) - data2[pix1] = 0; - else - data2[pix1] = g3; - } else { - data2[pix1] = 0; - } - } else if ((g3 = (g4=2*g2-256)) < 255) { - if ((g3 = (data[pix1]<<8)/(255-g4)) > 255) - data2[pix1] = 255; - else - data2[pix1] = g3; - } else { - if (g3 < 0) - data2[pix1] = 0; - else - data2[pix1] = g3; - } - - if ((b2=data2[pix2=pix+2]) < 128) { - if (b2) { - if ((b3 = 255 - ((255-data[pix2])<<8) / (2*b2)) < 0) - data2[pix2] = 0; - else - data2[pix2] = b3; - } else { - data2[pix2] = 0; - } - } else if ((b3 = (b4=2*b2-256)) < 255) { - if ((b3 = (data[pix2]<<8)/(255-b4)) > 255) - data2[pix2] = 255; - else - data2[pix2] = b3; - } else { - if (b3 < 0) - data2[pix2] = 0; - else - data2[pix2] = b3; - } - } - dataChanged = true; - break; - - case "pinlight" : - while (p--) { - if ((r2=data2[pix-=4]) < 128) - if ((r1=data[pix]) < (r4=2*r2)) - data2[pix] = r1; - else - data2[pix] = r4; - else - if ((r1=data[pix]) > (r4=2*r2-256)) - data2[pix] = r1; - else - data2[pix] = r4; - - if ((g2=data2[pix1=pix+1]) < 128) - if ((g1=data[pix1]) < (g4=2*g2)) - data2[pix1] = g1; - else - data2[pix1] = g4; - else - if ((g1=data[pix1]) > (g4=2*g2-256)) - data2[pix1] = g1; - else - data2[pix1] = g4; - - if ((r2=data2[pix2=pix+2]) < 128) - if ((r1=data[pix2]) < (r4=2*r2)) - data2[pix2] = r1; - else - data2[pix2] = r4; - else - if ((r1=data[pix2]) > (r4=2*r2-256)) - data2[pix2] = r1; - else - data2[pix2] = r4; - } - dataChanged = true; - break; - - case "hardmix" : - while (p--) { - if ((r2 = data2[pix-=4]) < 128) - if (255 - ((255-data[pix])<<8)/(2*r2) < 128 || r2 == 0) - data2[pix] = 0; - else - data2[pix] = 255; - else if ((r4=2*r2-256) < 255 && (data[pix]<<8)/(255-r4) < 128) - data2[pix] = 0; - else - data2[pix] = 255; - - if ((g2 = data2[pix1=pix+1]) < 128) - if (255 - ((255-data[pix1])<<8)/(2*g2) < 128 || g2 == 0) - data2[pix1] = 0; - else - data2[pix1] = 255; - else if ((g4=2*g2-256) < 255 && (data[pix1]<<8)/(255-g4) < 128) - data2[pix1] = 0; - else - data2[pix1] = 255; - - if ((b2 = data2[pix2=pix+2]) < 128) - if (255 - ((255-data[pix2])<<8)/(2*b2) < 128 || b2 == 0) - data2[pix2] = 0; - else - data2[pix2] = 255; - else if ((b4=2*b2-256) < 255 && (data[pix2]<<8)/(255-b4) < 128) - data2[pix2] = 0; - else - data2[pix2] = 255; - } - dataChanged = true; - break; - } - - if (dataChanged) - otherCtx.putImageData(dataDesc2,0,0); - - if (amount != 1 && !Pixastic.Client.hasGlobalAlpha()) { - var p = w*h; - var amount2 = amount; - var amount1 = 1 - amount; - while (p--) { - var pix = p*4; - var r = (data[pix] * amount1 + data2[pix] * amount2)>>0; - var g = (data[pix+1] * amount1 + data2[pix+1] * amount2)>>0; - var b = (data[pix+2] * amount1 + data2[pix+2] * amount2)>>0; - - data[pix] = r; - data[pix+1] = g; - data[pix+2] = b; - } - params.useData = true; - } else { - var ctx = params.canvas.getContext("2d"); - ctx.save(); - ctx.globalAlpha = amount; - ctx.drawImage( - otherCanvas, - 0,0,rect.width,rect.height, - rect.left,rect.top,rect.width,rect.height - ); - ctx.globalAlpha = 1; - ctx.restore(); - } - - return true; - } - }, - checkSupport : function() { - return Pixastic.Client.hasCanvasImageData(); - } -} \ No newline at end of file diff --git a/actions/blur.js b/actions/blur.js deleted file mode 100755 index f53192c..0000000 --- a/actions/blur.js +++ /dev/null @@ -1,126 +0,0 @@ -/* - * Pixastic Lib - Blur filter - v0.1.0 - * Copyright (c) 2008 Jacob Seidelin, jseidelin@nihilogic.dk, http://blog.nihilogic.dk/ - * License: [http://www.pixastic.com/lib/license.txt] - */ - -Pixastic.Actions.blur = { - process : function(params) { - - if (typeof params.options.fixMargin == "undefined") - params.options.fixMargin = true; - - if (Pixastic.Client.hasCanvasImageData()) { - var data = Pixastic.prepareData(params); - var dataCopy = Pixastic.prepareData(params, true) - - /* - var kernel = [ - [0.5, 1, 0.5], - [1, 2, 1], - [0.5, 1, 0.5] - ]; - */ - - var kernel = [ - [0, 1, 0], - [1, 2, 1], - [0, 1, 0] - ]; - - var weight = 0; - for (var i=0;i<3;i++) { - for (var j=0;j<3;j++) { - weight += kernel[i][j]; - } - } - - weight = 1 / (weight*2); - - var rect = params.options.rect; - var w = rect.width; - var h = rect.height; - - var w4 = w*4; - var y = h; - do { - var offsetY = (y-1)*w4; - - var prevY = (y == 1) ? 0 : y-2; - var nextY = (y == h) ? y - 1 : y; - - var offsetYPrev = prevY*w*4; - var offsetYNext = nextY*w*4; - - var x = w; - do { - var offset = offsetY + (x*4-4); - - var offsetPrev = offsetYPrev + ((x == 1) ? 0 : x-2) * 4; - var offsetNext = offsetYNext + ((x == w) ? x-1 : x) * 4; - - data[offset] = ( - /* - dataCopy[offsetPrev - 4] - + dataCopy[offsetPrev+4] - + dataCopy[offsetNext - 4] - + dataCopy[offsetNext+4] - + - */ - (dataCopy[offsetPrev] - + dataCopy[offset-4] - + dataCopy[offset+4] - + dataCopy[offsetNext]) * 2 - + dataCopy[offset] * 4 - ) * weight; - - data[offset+1] = ( - /* - dataCopy[offsetPrev - 3] - + dataCopy[offsetPrev+5] - + dataCopy[offsetNext - 3] - + dataCopy[offsetNext+5] - + - */ - (dataCopy[offsetPrev+1] - + dataCopy[offset-3] - + dataCopy[offset+5] - + dataCopy[offsetNext+1]) * 2 - + dataCopy[offset+1] * 4 - ) * weight; - - data[offset+2] = ( - /* - dataCopy[offsetPrev - 2] - + dataCopy[offsetPrev+6] - + dataCopy[offsetNext - 2] - + dataCopy[offsetNext+6] - + - */ - (dataCopy[offsetPrev+2] - + dataCopy[offset-2] - + dataCopy[offset+6] - + dataCopy[offsetNext+2]) * 2 - + dataCopy[offset+2] * 4 - ) * weight; - - } while (--x); - } while (--y); - - return true; - - } else if (Pixastic.Client.isIE()) { - params.image.style.filter += " progid:DXImageTransform.Microsoft.Blur(pixelradius=1.5)"; - - if (params.options.fixMargin) { - params.image.style.marginLeft = (parseInt(params.image.style.marginLeft,10)||0) - 2 + "px"; - params.image.style.marginTop = (parseInt(params.image.style.marginTop,10)||0) - 2 + "px"; - } - - return true; - } - }, - checkSupport : function() { - return (Pixastic.Client.hasCanvasImageData() || Pixastic.Client.isIE()); - } -} \ No newline at end of file diff --git a/actions/blurfast.js b/actions/blurfast.js deleted file mode 100755 index 0fbcf7d..0000000 --- a/actions/blurfast.js +++ /dev/null @@ -1,77 +0,0 @@ -/* - * Pixastic Lib - Blur Fast - v0.1.1 - * Copyright (c) 2008 Jacob Seidelin, jseidelin@nihilogic.dk, http://blog.nihilogic.dk/ - * License: [http://www.pixastic.com/lib/license.txt] - */ - -Pixastic.Actions.blurfast = { - process : function(params) { - - var amount = parseFloat(params.options.amount)||0; - var clear = !!(params.options.clear && params.options.clear != "false"); - - amount = Math.max(0,Math.min(5,amount)); - - if (Pixastic.Client.hasCanvas()) { - var rect = params.options.rect; - - var ctx = params.canvas.getContext("2d"); - ctx.save(); - ctx.beginPath(); - ctx.rect(rect.left, rect.top, rect.width, rect.height); - ctx.clip(); - - var scale = 2; - var smallWidth = Math.round(params.width / scale); - var smallHeight = Math.round(params.height / scale); - - var copy = document.createElement("canvas"); - copy.width = smallWidth; - copy.height = smallHeight; - - var clear = false; - var steps = Math.round(amount * 20); - - var copyCtx = copy.getContext("2d"); - for (var i=0;i 255 ) - data[pix] = 255; - else if (r < 0) - data[pix] = 0; - else - data[pix] = r; - - if ((g = data[pix1=pix+1] * mul + add) > 255 ) - data[pix1] = 255; - else if (g < 0) - data[pix1] = 0; - else - data[pix1] = g; - - if ((b = data[pix2=pix+2] * mul + add) > 255 ) - data[pix2] = 255; - else if (b < 0) - data[pix2] = 0; - else - data[pix2] = b; - } - return true; - } - }, - checkSupport : function() { - return Pixastic.Client.hasCanvasImageData(); - } -} - diff --git a/actions/coloradjust.js b/actions/coloradjust.js deleted file mode 100755 index 30fb56b..0000000 --- a/actions/coloradjust.js +++ /dev/null @@ -1,62 +0,0 @@ -/* - * Pixastic Lib - Color adjust filter - v0.1.1 - * Copyright (c) 2008 Jacob Seidelin, jseidelin@nihilogic.dk, http://blog.nihilogic.dk/ - * License: [http://www.pixastic.com/lib/license.txt] - */ - -Pixastic.Actions.coloradjust = { - - process : function(params) { - var red = parseFloat(params.options.red) || 0; - var green = parseFloat(params.options.green) || 0; - var blue = parseFloat(params.options.blue) || 0; - - red = Math.round(red*255); - green = Math.round(green*255); - blue = Math.round(blue*255); - - if (Pixastic.Client.hasCanvasImageData()) { - var data = Pixastic.prepareData(params); - var rect = params.options.rect; - - var p = rect.width*rect.height; - var pix = p*4, pix1, pix2; - - var r, g, b; - while (p--) { - pix -= 4; - - if (red) { - if ((r = data[pix] + red) < 0 ) - data[pix] = 0; - else if (r > 255 ) - data[pix] = 255; - else - data[pix] = r; - } - - if (green) { - if ((g = data[pix1=pix+1] + green) < 0 ) - data[pix1] = 0; - else if (g > 255 ) - data[pix1] = 255; - else - data[pix1] = g; - } - - if (blue) { - if ((b = data[pix2=pix+2] + blue) < 0 ) - data[pix2] = 0; - else if (b > 255 ) - data[pix2] = 255; - else - data[pix2] = b; - } - } - return true; - } - }, - checkSupport : function() { - return (Pixastic.Client.hasCanvasImageData()); - } -} diff --git a/actions/colorhistogram.js b/actions/colorhistogram.js deleted file mode 100755 index 03402f8..0000000 --- a/actions/colorhistogram.js +++ /dev/null @@ -1,82 +0,0 @@ -/* - * Pixastic Lib - Histogram - v0.1.0 - * Copyright (c) 2008 Jacob Seidelin, jseidelin@nihilogic.dk, http://blog.nihilogic.dk/ - * License: [http://www.pixastic.com/lib/license.txt] - */ - - -Pixastic.Actions.colorhistogram = { - - array256 : function(default_value) { - arr = []; - for (var i=0; i<256; i++) { arr[i] = default_value; } - return arr - }, - - process : function(params) { - var values = []; - if (typeof params.options.returnValue != "object") { - params.options.returnValue = {rvals:[], gvals:[], bvals:[]}; - } - var paint = !!(params.options.paint); - - var returnValue = params.options.returnValue; - if (typeof returnValue.values != "array") { - returnValue.rvals = []; - returnValue.gvals = []; - returnValue.bvals = []; - } - - if (Pixastic.Client.hasCanvasImageData()) { - var data = Pixastic.prepareData(params); - params.useData = false; - - var rvals = this.array256(0); - var gvals = this.array256(0); - var bvals = this.array256(0); - - var rect = params.options.rect; - - var p = rect.width*rect.height; - var pix = p*4; - while (p--) { - rvals[data[pix-=4]]++; - gvals[data[pix+1]]++; - bvals[data[pix+2]]++; - } - - returnValue.rvals = rvals; - returnValue.gvals = gvals; - returnValue.bvals = bvals; - - if (paint) { - var ctx = params.canvas.getContext("2d"); - var vals = [rvals, gvals, bvals]; - for (var v=0;v<3;v++) { - var yoff = (v+1) * params.height / 3; - var maxValue = 0; - for (var i=0;i<256;i++) { - if (vals[v][i] > maxValue) - maxValue = vals[v][i]; - } - var heightScale = params.height / 3 / maxValue; - var widthScale = params.width / 256; - if (v==0) ctx.fillStyle = "rgba(255,0,0,0.5)"; - else if (v==1) ctx.fillStyle = "rgba(0,255,0,0.5)"; - else if (v==2) ctx.fillStyle = "rgba(0,0,255,0.5)"; - for (var i=0;i<256;i++) { - ctx.fillRect( - i * widthScale, params.height - heightScale * vals[v][i] - params.height + yoff, - widthScale, vals[v][i] * heightScale - ); - } - } - } - return true; - } - }, - - checkSupport : function() { - return Pixastic.Client.hasCanvasImageData(); - } -} \ No newline at end of file diff --git a/actions/crop.js b/actions/crop.js deleted file mode 100755 index bd1b522..0000000 --- a/actions/crop.js +++ /dev/null @@ -1,63 +0,0 @@ -/* - * Pixastic Lib - Crop - v0.1.1 - * Copyright (c) 2008-2009 Jacob Seidelin, jseidelin@nihilogic.dk, http://blog.nihilogic.dk/ - * License: [http://www.pixastic.com/lib/license.txt] - */ - -Pixastic.Actions.crop = { - process : function(params) { - if (Pixastic.Client.hasCanvas()) { - var rect = params.options.rect; - - var width = rect.width; - var height = rect.height; - var top = rect.top; - var left = rect.left; - - if (typeof params.options.left != "undefined") - left = parseInt(params.options.left,10); - if (typeof params.options.top != "undefined") - top = parseInt(params.options.top,10); - if (typeof params.options.height != "undefined") - width = parseInt(params.options.width,10); - if (typeof params.options.height != "undefined") - height = parseInt(params.options.height,10); - - if (left < 0) left = 0; - if (left > params.width-1) left = params.width-1; - - if (top < 0) top = 0; - if (top > params.height-1) top = params.height-1; - - if (width < 1) width = 1; - if (left + width > params.width) - width = params.width - left; - - if (height < 1) height = 1; - if (top + height > params.height) - height = params.height - top; - - var copy = document.createElement("canvas"); - copy.width = params.width; - copy.height = params.height; - copy.getContext("2d").drawImage(params.canvas,0,0); - - params.canvas.width = width; - params.canvas.height = height; - params.canvas.getContext("2d").clearRect(0,0,width,height); - - params.canvas.getContext("2d").drawImage(copy, - left,top,width,height, - 0,0,width,height - ); - - params.useData = false; - return true; - } - }, - checkSupport : function() { - return Pixastic.Client.hasCanvas(); - } -} - - diff --git a/actions/desaturate.js b/actions/desaturate.js deleted file mode 100755 index 0c346c1..0000000 --- a/actions/desaturate.js +++ /dev/null @@ -1,37 +0,0 @@ -/* - * Pixastic Lib - Desaturation filter - v0.1.1 - * Copyright (c) 2008 Jacob Seidelin, jseidelin@nihilogic.dk, http://blog.nihilogic.dk/ - * License: [http://www.pixastic.com/lib/license.txt] - */ - -Pixastic.Actions.desaturate = { - - process : function(params) { - var useAverage = !!(params.options.average && params.options.average != "false"); - - if (Pixastic.Client.hasCanvasImageData()) { - var data = Pixastic.prepareData(params); - var rect = params.options.rect; - var w = rect.width; - var h = rect.height; - - var p = w*h; - var pix = p*4, pix1, pix2; - - if (useAverage) { - while (p--) - data[pix-=4] = data[pix1=pix+1] = data[pix2=pix+2] = (data[pix]+data[pix1]+data[pix2])/3 - } else { - while (p--) - data[pix-=4] = data[pix1=pix+1] = data[pix2=pix+2] = (data[pix]*0.3 + data[pix1]*0.59 + data[pix2]*0.11); - } - return true; - } else if (Pixastic.Client.isIE()) { - params.image.style.filter += " gray"; - return true; - } - }, - checkSupport : function() { - return (Pixastic.Client.hasCanvasImageData() || Pixastic.Client.isIE()); - } -} \ No newline at end of file diff --git a/actions/edges.js b/actions/edges.js deleted file mode 100755 index a3002aa..0000000 --- a/actions/edges.js +++ /dev/null @@ -1,115 +0,0 @@ -/* - * Pixastic Lib - Edge detection filter - v0.1.1 - * Copyright (c) 2008 Jacob Seidelin, jseidelin@nihilogic.dk, http://blog.nihilogic.dk/ - * License: [http://www.pixastic.com/lib/license.txt] - */ - -Pixastic.Actions.edges = { - process : function(params) { - - var mono = !!(params.options.mono && params.options.mono != "false"); - var invert = !!(params.options.invert && params.options.invert != "false"); - - if (Pixastic.Client.hasCanvasImageData()) { - var data = Pixastic.prepareData(params); - var dataCopy = Pixastic.prepareData(params, true) - - var c = -1/8; - var kernel = [ - [c, c, c], - [c, 1, c], - [c, c, c] - ]; - - weight = 1/c; - - var rect = params.options.rect; - var w = rect.width; - var h = rect.height; - - var w4 = w*4; - var y = h; - do { - var offsetY = (y-1)*w4; - - var nextY = (y == h) ? y - 1 : y; - var prevY = (y == 1) ? 0 : y-2; - - var offsetYPrev = prevY*w*4; - var offsetYNext = nextY*w*4; - - var x = w; - do { - var offset = offsetY + (x*4-4); - - var offsetPrev = offsetYPrev + ((x == 1) ? 0 : x-2) * 4; - var offsetNext = offsetYNext + ((x == w) ? x-1 : x) * 4; - - var r = ((dataCopy[offsetPrev-4] - + dataCopy[offsetPrev] - + dataCopy[offsetPrev+4] - + dataCopy[offset-4] - + dataCopy[offset+4] - + dataCopy[offsetNext-4] - + dataCopy[offsetNext] - + dataCopy[offsetNext+4]) * c - + dataCopy[offset] - ) - * weight; - - var g = ((dataCopy[offsetPrev-3] - + dataCopy[offsetPrev+1] - + dataCopy[offsetPrev+5] - + dataCopy[offset-3] - + dataCopy[offset+5] - + dataCopy[offsetNext-3] - + dataCopy[offsetNext+1] - + dataCopy[offsetNext+5]) * c - + dataCopy[offset+1]) - * weight; - - var b = ((dataCopy[offsetPrev-2] - + dataCopy[offsetPrev+2] - + dataCopy[offsetPrev+6] - + dataCopy[offset-2] - + dataCopy[offset+6] - + dataCopy[offsetNext-2] - + dataCopy[offsetNext+2] - + dataCopy[offsetNext+6]) * c - + dataCopy[offset+2]) - * weight; - - if (mono) { - var brightness = (r*0.3 + g*0.59 + b*0.11)||0; - if (invert) brightness = 255 - brightness; - if (brightness < 0 ) brightness = 0; - if (brightness > 255 ) brightness = 255; - r = g = b = brightness; - } else { - if (invert) { - r = 255 - r; - g = 255 - g; - b = 255 - b; - } - if (r < 0 ) r = 0; - if (g < 0 ) g = 0; - if (b < 0 ) b = 0; - if (r > 255 ) r = 255; - if (g > 255 ) g = 255; - if (b > 255 ) b = 255; - } - - data[offset] = r; - data[offset+1] = g; - data[offset+2] = b; - - } while (--x); - } while (--y); - - return true; - } - }, - checkSupport : function() { - return Pixastic.Client.hasCanvasImageData(); - } -} \ No newline at end of file diff --git a/actions/edges2.js b/actions/edges2.js deleted file mode 100755 index 13a3b39..0000000 --- a/actions/edges2.js +++ /dev/null @@ -1,103 +0,0 @@ -/* - * Pixastic Lib - Edge detection 2 - v0.1.0 - * Copyright (c) 2008 Jacob Seidelin, jseidelin@nihilogic.dk, http://blog.nihilogic.dk/ - * License: [http://www.pixastic.com/lib/license.txt] - * - * Contribution by Oliver Hunt (http://nerget.com/, http://nerget.com/canvas/edgeDetection.js). Thanks Oliver! - * - */ - -Pixastic.Actions.edges2 = { - process : function(params) { - - if (Pixastic.Client.hasCanvasImageData()) { - var data = Pixastic.prepareData(params); - var dataCopy = Pixastic.prepareData(params, true) - - var rect = params.options.rect; - var w = rect.width; - var h = rect.height; - - var w4 = w * 4; - var pixel = w4 + 4; // Start at (1,1) - var hm1 = h - 1; - var wm1 = w - 1; - for (var y = 1; y < hm1; ++y) { - // Prepare initial cached values for current row - var centerRow = pixel - 4; - var priorRow = centerRow - w4; - var nextRow = centerRow + w4; - - var r1 = - dataCopy[priorRow] - dataCopy[centerRow] - dataCopy[nextRow]; - var g1 = - dataCopy[++priorRow] - dataCopy[++centerRow] - dataCopy[++nextRow]; - var b1 = - dataCopy[++priorRow] - dataCopy[++centerRow] - dataCopy[++nextRow]; - - var rp = dataCopy[priorRow += 2]; - var gp = dataCopy[++priorRow]; - var bp = dataCopy[++priorRow]; - - var rc = dataCopy[centerRow += 2]; - var gc = dataCopy[++centerRow]; - var bc = dataCopy[++centerRow]; - - var rn = dataCopy[nextRow += 2]; - var gn = dataCopy[++nextRow]; - var bn = dataCopy[++nextRow]; - - var r2 = - rp - rc - rn; - var g2 = - gp - gc - gn; - var b2 = - bp - bc - bn; - - // Main convolution loop - for (var x = 1; x < wm1; ++x) { - centerRow = pixel + 4; - priorRow = centerRow - w4; - nextRow = centerRow + w4; - - var r = 127 + r1 - rp - (rc * -8) - rn; - var g = 127 + g1 - gp - (gc * -8) - gn; - var b = 127 + b1 - bp - (bc * -8) - bn; - - r1 = r2; - g1 = g2; - b1 = b2; - - rp = dataCopy[ priorRow]; - gp = dataCopy[++priorRow]; - bp = dataCopy[++priorRow]; - - rc = dataCopy[ centerRow]; - gc = dataCopy[++centerRow]; - bc = dataCopy[++centerRow]; - - rn = dataCopy[ nextRow]; - gn = dataCopy[++nextRow]; - bn = dataCopy[++nextRow]; - - r += (r2 = - rp - rc - rn); - g += (g2 = - gp - gc - gn); - b += (b2 = - bp - bc - bn); - - if (r > 255) r = 255; - if (g > 255) g = 255; - if (b > 255) b = 255; - if (r < 0) r = 0; - if (g < 0) g = 0; - if (b < 0) b = 0; - - data[pixel] = r; - data[++pixel] = g; - data[++pixel] = b; - //data[++pixel] = 255; // alpha - - pixel+=2; - } - pixel += 8; - } - return true; - } - }, - checkSupport : function() { - return Pixastic.Client.hasCanvasImageData(); - } -} \ No newline at end of file diff --git a/actions/emboss.js b/actions/emboss.js deleted file mode 100755 index 0b8b065..0000000 --- a/actions/emboss.js +++ /dev/null @@ -1,134 +0,0 @@ -/* - * Pixastic Lib - Emboss filter - v0.1.0 - * Copyright (c) 2008 Jacob Seidelin, jseidelin@nihilogic.dk, http://blog.nihilogic.dk/ - * License: [http://www.pixastic.com/lib/license.txt] - */ - -Pixastic.Actions.emboss = { - process : function(params) { - - var strength = parseFloat(params.options.strength)||1; - var greyLevel = typeof params.options.greyLevel != "undefined" ? parseInt(params.options.greyLevel) : 180; - var direction = params.options.direction||"topleft"; - var blend = !!(params.options.blend && params.options.blend != "false"); - - var dirY = 0; - var dirX = 0; - - switch (direction) { - case "topleft": // top left - dirY = -1; - dirX = -1; - break; - case "top": // top - dirY = -1; - dirX = 0; - break; - case "topright": // top right - dirY = -1; - dirX = 1; - break; - case "right": // right - dirY = 0; - dirX = 1; - break; - case "bottomright": // bottom right - dirY = 1; - dirX = 1; - break; - case "bottom": // bottom - dirY = 1; - dirX = 0; - break; - case "bottomleft": // bottom left - dirY = 1; - dirX = -1; - break; - case "left": // left - dirY = 0; - dirX = -1; - break; - } - - if (Pixastic.Client.hasCanvasImageData()) { - var data = Pixastic.prepareData(params); - var dataCopy = Pixastic.prepareData(params, true) - - var invertAlpha = !!params.options.invertAlpha; - var rect = params.options.rect; - var w = rect.width; - var h = rect.height; - - var w4 = w*4; - var y = h; - do { - var offsetY = (y-1)*w4; - - var otherY = dirY; - if (y + otherY < 1) otherY = 0; - if (y + otherY > h) otherY = 0; - - var offsetYOther = (y-1+otherY)*w*4; - - var x = w; - do { - var offset = offsetY + (x-1)*4; - - var otherX = dirX; - if (x + otherX < 1) otherX = 0; - if (x + otherX > w) otherX = 0; - - var offsetOther = offsetYOther + (x-1+otherX)*4; - - var dR = dataCopy[offset] - dataCopy[offsetOther]; - var dG = dataCopy[offset+1] - dataCopy[offsetOther+1]; - var dB = dataCopy[offset+2] - dataCopy[offsetOther+2]; - - var dif = dR; - var absDif = dif > 0 ? dif : -dif; - - var absG = dG > 0 ? dG : -dG; - var absB = dB > 0 ? dB : -dB; - - if (absG > absDif) { - dif = dG; - } - if (absB > absDif) { - dif = dB; - } - - dif *= strength; - - if (blend) { - var r = data[offset] + dif; - var g = data[offset+1] + dif; - var b = data[offset+2] + dif; - - data[offset] = (r > 255) ? 255 : (r < 0 ? 0 : r); - data[offset+1] = (g > 255) ? 255 : (g < 0 ? 0 : g); - data[offset+2] = (b > 255) ? 255 : (b < 0 ? 0 : b); - } else { - var grey = greyLevel - dif; - if (grey < 0) { - grey = 0; - } else if (grey > 255) { - grey = 255; - } - - data[offset] = data[offset+1] = data[offset+2] = grey; - } - - } while (--x); - } while (--y); - return true; - - } else if (Pixastic.Client.isIE()) { - params.image.style.filter += " progid:DXImageTransform.Microsoft.emboss()"; - return true; - } - }, - checkSupport : function() { - return (Pixastic.Client.hasCanvasImageData() || Pixastic.Client.isIE()); - } - -} diff --git a/actions/flip.js b/actions/flip.js deleted file mode 100755 index 01e45ea..0000000 --- a/actions/flip.js +++ /dev/null @@ -1,34 +0,0 @@ -/* - * Pixastic Lib - Flip - v0.1.0 - * Copyright (c) 2008 Jacob Seidelin, jseidelin@nihilogic.dk, http://blog.nihilogic.dk/ - * License: [http://www.pixastic.com/lib/license.txt] - */ - -Pixastic.Actions.flip = { - process : function(params) { - var rect = params.options.rect; - var copyCanvas = document.createElement("canvas"); - copyCanvas.width = rect.width; - copyCanvas.height = rect.height; - copyCanvas.getContext("2d").drawImage(params.image, rect.left, rect.top, rect.width, rect.height, 0, 0, rect.width, rect.height); - - var ctx = params.canvas.getContext("2d"); - ctx.clearRect(rect.left, rect.top, rect.width, rect.height); - - if (params.options.axis == "horizontal") { - ctx.scale(-1,1); - ctx.drawImage(copyCanvas, -rect.left-rect.width, rect.top, rect.width, rect.height) - } else { - ctx.scale(1,-1); - ctx.drawImage(copyCanvas, rect.left, -rect.top-rect.height, rect.width, rect.height) - } - - params.useData = false; - - return true; - }, - checkSupport : function() { - return Pixastic.Client.hasCanvas(); - } -} - diff --git a/actions/fliph.js b/actions/fliph.js deleted file mode 100755 index 2d01841..0000000 --- a/actions/fliph.js +++ /dev/null @@ -1,33 +0,0 @@ -/* - * Pixastic Lib - Horizontal flip - v0.1.0 - * Copyright (c) 2008 Jacob Seidelin, jseidelin@nihilogic.dk, http://blog.nihilogic.dk/ - * License: [http://www.pixastic.com/lib/license.txt] - */ - -Pixastic.Actions.fliph = { - process : function(params) { - if (Pixastic.Client.hasCanvas()) { - var rect = params.options.rect; - var copyCanvas = document.createElement("canvas"); - copyCanvas.width = rect.width; - copyCanvas.height = rect.height; - copyCanvas.getContext("2d").drawImage(params.image, rect.left, rect.top, rect.width, rect.height, 0, 0, rect.width, rect.height); - - var ctx = params.canvas.getContext("2d"); - ctx.clearRect(rect.left, rect.top, rect.width, rect.height); - ctx.scale(-1,1); - ctx.drawImage(copyCanvas, -rect.left-rect.width, rect.top, rect.width, rect.height) - params.useData = false; - - return true; - - } else if (Pixastic.Client.isIE()) { - params.image.style.filter += " fliph"; - return true; - } - }, - checkSupport : function() { - return (Pixastic.Client.hasCanvas() || Pixastic.Client.isIE()); - } -} - diff --git a/actions/flipv.js b/actions/flipv.js deleted file mode 100755 index 66f5d5f..0000000 --- a/actions/flipv.js +++ /dev/null @@ -1,33 +0,0 @@ -/* - * Pixastic Lib - Vertical flip - v0.1.0 - * Copyright (c) 2008 Jacob Seidelin, jseidelin@nihilogic.dk, http://blog.nihilogic.dk/ - * License: [http://www.pixastic.com/lib/license.txt] - */ - -Pixastic.Actions.flipv = { - process : function(params) { - if (Pixastic.Client.hasCanvas()) { - var rect = params.options.rect; - var copyCanvas = document.createElement("canvas"); - copyCanvas.width = rect.width; - copyCanvas.height = rect.height; - copyCanvas.getContext("2d").drawImage(params.image, rect.left, rect.top, rect.width, rect.height, 0, 0, rect.width, rect.height); - - var ctx = params.canvas.getContext("2d"); - ctx.clearRect(rect.left, rect.top, rect.width, rect.height); - ctx.scale(1,-1); - ctx.drawImage(copyCanvas, rect.left, -rect.top-rect.height, rect.width, rect.height) - params.useData = false; - - return true; - - } else if (Pixastic.Client.isIE()) { - params.image.style.filter += " flipv"; - return true; - } - }, - checkSupport : function() { - return (Pixastic.Client.hasCanvas() || Pixastic.Client.isIE()); - } -} - diff --git a/actions/glow.js b/actions/glow.js deleted file mode 100755 index 6f7dbbc..0000000 --- a/actions/glow.js +++ /dev/null @@ -1,80 +0,0 @@ -/* - * Pixastic Lib - Glow - v0.1.0 - * Copyright (c) 2008 Jacob Seidelin, jseidelin@nihilogic.dk, http://blog.nihilogic.dk/ - * License: [http://www.pixastic.com/lib/license.txt] - */ - - -Pixastic.Actions.glow = { - process : function(params) { - - var amount = (parseFloat(params.options.amount)||0); - var blurAmount = parseFloat(params.options.radius)||0; - - amount = Math.min(1,Math.max(0,amount)); - blurAmount = Math.min(5,Math.max(0,blurAmount)); - - if (Pixastic.Client.hasCanvasImageData()) { - var rect = params.options.rect; - - var blurCanvas = document.createElement("canvas"); - blurCanvas.width = params.width; - blurCanvas.height = params.height; - var blurCtx = blurCanvas.getContext("2d"); - blurCtx.drawImage(params.canvas,0,0); - - var scale = 2; - var smallWidth = Math.round(params.width / scale); - var smallHeight = Math.round(params.height / scale); - - var copy = document.createElement("canvas"); - copy.width = smallWidth; - copy.height = smallHeight; - - var clear = true; - var steps = Math.round(blurAmount * 20); - - var copyCtx = copy.getContext("2d"); - for (var i=0;i 255) data[pix] = 255; - if ((data[pix1-=4] += amount * blurData[pix1]) > 255) data[pix1] = 255; - if ((data[pix2-=4] += amount * blurData[pix2]) > 255) data[pix2] = 255; - } - - return true; - } - }, - checkSupport : function() { - return Pixastic.Client.hasCanvasImageData(); - } -} - - - diff --git a/actions/histogram.js b/actions/histogram.js deleted file mode 100755 index c48ef01..0000000 --- a/actions/histogram.js +++ /dev/null @@ -1,74 +0,0 @@ -/* - * Pixastic Lib - Histogram - v0.1.1 - * Copyright (c) 2008 Jacob Seidelin, jseidelin@nihilogic.dk, http://blog.nihilogic.dk/ - * License: [http://www.pixastic.com/lib/license.txt] - */ - -Pixastic.Actions.histogram = { - process : function(params) { - - var average = !!(params.options.average && params.options.average != "false"); - var paint = !!(params.options.paint && params.options.paint != "false"); - var color = params.options.color || "rgba(255,255,255,0.5)"; - var values = []; - if (typeof params.options.returnValue != "object") { - params.options.returnValue = {values:[]}; - } - var returnValue = params.options.returnValue; - if (typeof returnValue.values != "array") { - returnValue.values = []; - } - values = returnValue.values; - - if (Pixastic.Client.hasCanvasImageData()) { - var data = Pixastic.prepareData(params); - params.useData = false; - - for (var i=0;i<256;i++) { - values[i] = 0; - } - - var rect = params.options.rect; - var p = rect.width * rect.height; - - var pix = p*4, pix1 = pix + 1, pix2 = pix + 2, pix3 = pix + 3; - var round = Math.round; - - if (average) { - while (p--) { - values[ round((data[pix-=4]+data[pix+1]+data[pix+2])/3) ]++; - } - } else { - while (p--) { - values[ round(data[pix-=4]*0.3 + data[pix+1]*0.59 + data[pix+2]*0.11) ]++; - } - } - - if (paint) { - var maxValue = 0; - for (var i=0;i<256;i++) { - if (values[i] > maxValue) { - maxValue = values[i]; - } - } - var heightScale = params.height / maxValue; - var widthScale = params.width / 256; - var ctx = params.canvas.getContext("2d"); - ctx.fillStyle = color; - for (var i=0;i<256;i++) { - ctx.fillRect( - i * widthScale, params.height - heightScale * values[i], - widthScale, values[i] * heightScale - ); - } - } - - returnValue.values = values; - - return true; - } - }, - checkSupport : function() { - return Pixastic.Client.hasCanvasImageData(); - } -} diff --git a/actions/hsl.js b/actions/hsl.js deleted file mode 100755 index d0b7d50..0000000 --- a/actions/hsl.js +++ /dev/null @@ -1,145 +0,0 @@ -/* - * Pixastic Lib - HSL Adjust - v0.1.1 - * Copyright (c) 2008 Jacob Seidelin, jseidelin@nihilogic.dk, http://blog.nihilogic.dk/ - * License: [http://www.pixastic.com/lib/license.txt] - */ - -Pixastic.Actions.hsl = { - process : function(params) { - - var hue = parseInt(params.options.hue,10)||0; - var saturation = (parseInt(params.options.saturation,10)||0) / 100; - var lightness = (parseInt(params.options.lightness,10)||0) / 100; - - - // this seems to give the same result as Photoshop - if (saturation < 0) { - var satMul = 1+saturation; - } else { - var satMul = 1+saturation*2; - } - - hue = (hue%360) / 360; - var hue6 = hue * 6; - - var rgbDiv = 1 / 255; - - var light255 = lightness * 255; - var lightp1 = 1 + lightness; - var lightm1 = 1 - lightness; - if (Pixastic.Client.hasCanvasImageData()) { - var data = Pixastic.prepareData(params); - - var rect = params.options.rect; - - var p = rect.width * rect.height; - - var pix = p*4, pix1 = pix + 1, pix2 = pix + 2, pix3 = pix + 3; - - while (p--) { - - var r = data[pix-=4]; - var g = data[pix1=pix+1]; - var b = data[pix2=pix+2]; - - if (hue != 0 || saturation != 0) { - // ok, here comes rgb to hsl + adjust + hsl to rgb, all in one jumbled mess. - // It's not so pretty, but it's been optimized to get somewhat decent performance. - // The transforms were originally adapted from the ones found in Graphics Gems, but have been heavily modified. - var vs = r; - if (g > vs) vs = g; - if (b > vs) vs = b; - var ms = r; - if (g < ms) ms = g; - if (b < ms) ms = b; - var vm = (vs-ms); - var l = (ms+vs)/510; - if (l > 0) { - if (vm > 0) { - if (l <= 0.5) { - var s = vm / (vs+ms) * satMul; - if (s > 1) s = 1; - var v = (l * (1+s)); - } else { - var s = vm / (510-vs-ms) * satMul; - if (s > 1) s = 1; - var v = (l+s - l*s); - } - if (r == vs) { - if (g == ms) - var h = 5 + ((vs-b)/vm) + hue6; - else - var h = 1 - ((vs-g)/vm) + hue6; - } else if (g == vs) { - if (b == ms) - var h = 1 + ((vs-r)/vm) + hue6; - else - var h = 3 - ((vs-b)/vm) + hue6; - } else { - if (r == ms) - var h = 3 + ((vs-g)/vm) + hue6; - else - var h = 5 - ((vs-r)/vm) + hue6; - } - if (h < 0) h+=6; - if (h >= 6) h-=6; - var m = (l+l-v); - var sextant = h>>0; - if (sextant == 0) { - r = v*255; g = (m+((v-m)*(h-sextant)))*255; b = m*255; - } else if (sextant == 1) { - r = (v-((v-m)*(h-sextant)))*255; g = v*255; b = m*255; - } else if (sextant == 2) { - r = m*255; g = v*255; b = (m+((v-m)*(h-sextant)))*255; - } else if (sextant == 3) { - r = m*255; g = (v-((v-m)*(h-sextant)))*255; b = v*255; - } else if (sextant == 4) { - r = (m+((v-m)*(h-sextant)))*255; g = m*255; b = v*255; - } else if (sextant == 5) { - r = v*255; g = m*255; b = (v-((v-m)*(h-sextant)))*255; - } - } - } - } - - if (lightness < 0) { - r *= lightp1; - g *= lightp1; - b *= lightp1; - } else if (lightness > 0) { - r = r * lightm1 + light255; - g = g * lightm1 + light255; - b = b * lightm1 + light255; - } - - if (r < 0) - data[pix] = 0 - else if (r > 255) - data[pix] = 255 - else - data[pix] = r; - - if (g < 0) - data[pix1] = 0 - else if (g > 255) - data[pix1] = 255 - else - data[pix1] = g; - - if (b < 0) - data[pix2] = 0 - else if (b > 255) - data[pix2] = 255 - else - data[pix2] = b; - - } - - return true; - } - }, - checkSupport : function() { - return Pixastic.Client.hasCanvasImageData(); - } - -} diff --git a/actions/invert.js b/actions/invert.js deleted file mode 100755 index 77cc94d..0000000 --- a/actions/invert.js +++ /dev/null @@ -1,36 +0,0 @@ -/* - * Pixastic Lib - Invert filter - v0.1.1 - * Copyright (c) 2008 Jacob Seidelin, jseidelin@nihilogic.dk, http://blog.nihilogic.dk/ - * License: [http://www.pixastic.com/lib/license.txt] - */ - -Pixastic.Actions.invert = { - process : function(params) { - if (Pixastic.Client.hasCanvasImageData()) { - var data = Pixastic.prepareData(params); - - var invertAlpha = !!params.options.invertAlpha; - var rect = params.options.rect; - - var p = rect.width * rect.height; - - var pix = p*4, pix1 = pix + 1, pix2 = pix + 2, pix3 = pix + 3; - - while (p--) { - data[pix-=4] = 255 - data[pix]; - data[pix1-=4] = 255 - data[pix1]; - data[pix2-=4] = 255 - data[pix2]; - if (invertAlpha) - data[pix3-=4] = 255 - data[pix3]; - } - - return true; - } else if (Pixastic.Client.isIE()) { - params.image.style.filter += " invert"; - return true; - } - }, - checkSupport : function() { - return (Pixastic.Client.hasCanvasImageData() || Pixastic.Client.isIE()); - } -} diff --git a/actions/laplace.js b/actions/laplace.js deleted file mode 100755 index abb099f..0000000 --- a/actions/laplace.js +++ /dev/null @@ -1,112 +0,0 @@ -/* - * Pixastic Lib - Laplace filter - v0.1.0 - * Copyright (c) 2008 Jacob Seidelin, jseidelin@nihilogic.dk, http://blog.nihilogic.dk/ - * License: [http://www.pixastic.com/lib/license.txt] - */ - -Pixastic.Actions.laplace = { - process : function(params) { - - var strength = 1.0; - var invert = !!(params.options.invert && params.options.invert != "false"); - var contrast = parseFloat(params.options.edgeStrength)||0; - - var greyLevel = parseInt(params.options.greyLevel)||0; - - contrast = -contrast; - - if (Pixastic.Client.hasCanvasImageData()) { - var data = Pixastic.prepareData(params); - var dataCopy = Pixastic.prepareData(params, true) - - var kernel = [ - [-1, -1, -1], - [-1, 8, -1], - [-1, -1, -1] - ]; - - var weight = 1/8; - - var rect = params.options.rect; - var w = rect.width; - var h = rect.height; - - var w4 = w*4; - var y = h; - do { - var offsetY = (y-1)*w4; - - var nextY = (y == h) ? y - 1 : y; - var prevY = (y == 1) ? 0 : y-2; - - var offsetYPrev = prevY*w*4; - var offsetYNext = nextY*w*4; - - var x = w; - do { - var offset = offsetY + (x*4-4); - - var offsetPrev = offsetYPrev + ((x == 1) ? 0 : x-2) * 4; - var offsetNext = offsetYNext + ((x == w) ? x-1 : x) * 4; - - var r = ((-dataCopy[offsetPrev-4] - - dataCopy[offsetPrev] - - dataCopy[offsetPrev+4] - - dataCopy[offset-4] - - dataCopy[offset+4] - - dataCopy[offsetNext-4] - - dataCopy[offsetNext] - - dataCopy[offsetNext+4]) - + dataCopy[offset] * 8) - * weight; - - var g = ((-dataCopy[offsetPrev-3] - - dataCopy[offsetPrev+1] - - dataCopy[offsetPrev+5] - - dataCopy[offset-3] - - dataCopy[offset+5] - - dataCopy[offsetNext-3] - - dataCopy[offsetNext+1] - - dataCopy[offsetNext+5]) - + dataCopy[offset+1] * 8) - * weight; - - var b = ((-dataCopy[offsetPrev-2] - - dataCopy[offsetPrev+2] - - dataCopy[offsetPrev+6] - - dataCopy[offset-2] - - dataCopy[offset+6] - - dataCopy[offsetNext-2] - - dataCopy[offsetNext+2] - - dataCopy[offsetNext+6]) - + dataCopy[offset+2] * 8) - * weight; - - var brightness = ((r + g + b)/3) + greyLevel; - - if (contrast != 0) { - if (brightness > 127) { - brightness += ((brightness + 1) - 128) * contrast; - } else if (brightness < 127) { - brightness -= (brightness + 1) * contrast; - } - } - if (invert) { - brightness = 255 - brightness; - } - if (brightness < 0 ) brightness = 0; - if (brightness > 255 ) brightness = 255; - - data[offset] = data[offset+1] = data[offset+2] = brightness; - - } while (--x); - } while (--y); - - return true; - } - }, - checkSupport : function() { - return Pixastic.Client.hasCanvasImageData(); - } -} - diff --git a/actions/lighten.js b/actions/lighten.js deleted file mode 100755 index 93c9093..0000000 --- a/actions/lighten.js +++ /dev/null @@ -1,61 +0,0 @@ -/* - * Pixastic Lib - Lighten filter - v0.1.1 - * Copyright (c) 2008 Jacob Seidelin, jseidelin@nihilogic.dk, http://blog.nihilogic.dk/ - * License: [http://www.pixastic.com/lib/license.txt] - */ - -Pixastic.Actions.lighten = { - - process : function(params) { - var amount = parseFloat(params.options.amount) || 0; - amount = Math.max(-1, Math.min(1, amount)); - - if (Pixastic.Client.hasCanvasImageData()) { - var data = Pixastic.prepareData(params); - var rect = params.options.rect; - - var p = rect.width * rect.height; - - var pix = p*4, pix1 = pix + 1, pix2 = pix + 2; - var mul = amount + 1; - - while (p--) { - if ((data[pix-=4] = data[pix] * mul) > 255) - data[pix] = 255; - - if ((data[pix1-=4] = data[pix1] * mul) > 255) - data[pix1] = 255; - - if ((data[pix2-=4] = data[pix2] * mul) > 255) - data[pix2] = 255; - - } - - return true; - - } else if (Pixastic.Client.isIE()) { - var img = params.image; - if (amount < 0) { - img.style.filter += " light()"; - img.filters[img.filters.length-1].addAmbient( - 255,255,255, - 100 * -amount - ); - } else if (amount > 0) { - img.style.filter += " light()"; - img.filters[img.filters.length-1].addAmbient( - 255,255,255, - 100 - ); - img.filters[img.filters.length-1].addAmbient( - 255,255,255, - 100 * amount - ); - } - return true; - } - }, - checkSupport : function() { - return (Pixastic.Client.hasCanvasImageData() || Pixastic.Client.isIE()); - } -} diff --git a/actions/mosaic.js b/actions/mosaic.js deleted file mode 100755 index 6b5754c..0000000 --- a/actions/mosaic.js +++ /dev/null @@ -1,55 +0,0 @@ -/* - * Pixastic Lib - Mosaic filter - v0.1.0 - * Copyright (c) 2008 Jacob Seidelin, jseidelin@nihilogic.dk, http://blog.nihilogic.dk/ - * License: [http://www.pixastic.com/lib/license.txt] - */ - -Pixastic.Actions.mosaic = { - - process : function(params) { - var blockSize = Math.max(1,parseInt(params.options.blockSize,10)); - - if (Pixastic.Client.hasCanvasImageData()) { - var rect = params.options.rect; - var w = rect.width; - var h = rect.height; - var w4 = w*4; - var y = h; - - var ctx = params.canvas.getContext("2d"); - - var pixel = document.createElement("canvas"); - pixel.width = pixel.height = 1; - var pixelCtx = pixel.getContext("2d"); - - var copy = document.createElement("canvas"); - copy.width = w; - copy.height = h; - var copyCtx = copy.getContext("2d"); - copyCtx.drawImage(params.canvas,rect.left,rect.top,w,h, 0,0,w,h); - - for (var y=0;y w) - blockSizeX = w - x; - if (blockSizeY + y > h) - blockSizeY = h - y; - - pixelCtx.drawImage(copy, x, y, blockSizeX, blockSizeY, 0, 0, 1, 1); - var data = pixelCtx.getImageData(0,0,1,1).data; - ctx.fillStyle = "rgb(" + data[0] + "," + data[1] + "," + data[2] + ")"; - ctx.fillRect(rect.left + x, rect.top + y, blockSize, blockSize); - } - } - params.useData = false; - - return true; - } - }, - checkSupport : function() { - return (Pixastic.Client.hasCanvasImageData()); - } -} \ No newline at end of file diff --git a/actions/noise.js b/actions/noise.js deleted file mode 100755 index 143bcc7..0000000 --- a/actions/noise.js +++ /dev/null @@ -1,73 +0,0 @@ -/* - * Pixastic Lib - Noise filter - v0.1.0 - * Copyright (c) 2008 Jacob Seidelin, jseidelin@nihilogic.dk, http://blog.nihilogic.dk/ - * License: [http://www.pixastic.com/lib/license.txt] - */ - -Pixastic.Actions.noise = { - - process : function(params) { - var amount = 0; - var strength = 0; - var mono = false; - - if (typeof params.options.amount != "undefined") - amount = parseFloat(params.options.amount)||0; - if (typeof params.options.strength != "undefined") - strength = parseFloat(params.options.strength)||0; - if (typeof params.options.mono != "undefined") - mono = !!(params.options.mono && params.options.mono != "false"); - - amount = Math.max(0,Math.min(1,amount)); - strength = Math.max(0,Math.min(1,strength)); - - var noise = 128 * strength; - var noise2 = noise / 2; - - if (Pixastic.Client.hasCanvasImageData()) { - var data = Pixastic.prepareData(params); - var rect = params.options.rect; - var w = rect.width; - var h = rect.height; - var w4 = w*4; - var y = h; - var random = Math.random; - - do { - var offsetY = (y-1)*w4; - var x = w; - do { - var offset = offsetY + (x-1)*4; - if (random() < amount) { - if (mono) { - var pixelNoise = - noise2 + random() * noise; - var r = data[offset] + pixelNoise; - var g = data[offset+1] + pixelNoise; - var b = data[offset+2] + pixelNoise; - } else { - var r = data[offset] - noise2 + (random() * noise); - var g = data[offset+1] - noise2 + (random() * noise); - var b = data[offset+2] - noise2 + (random() * noise); - } - - if (r < 0 ) r = 0; - if (g < 0 ) g = 0; - if (b < 0 ) b = 0; - if (r > 255 ) r = 255; - if (g > 255 ) g = 255; - if (b > 255 ) b = 255; - - data[offset] = r; - data[offset+1] = g; - data[offset+2] = b; - } - } while (--x); - } while (--y); - return true; - } - }, - checkSupport : function() { - return Pixastic.Client.hasCanvasImageData(); - } -} - diff --git a/actions/pointillize.js b/actions/pointillize.js deleted file mode 100755 index 42de579..0000000 --- a/actions/pointillize.js +++ /dev/null @@ -1,91 +0,0 @@ -/* - * Pixastic Lib - Pointillize filter - v0.1.0 - * Copyright (c) 2008 Jacob Seidelin, jseidelin@nihilogic.dk, http://blog.nihilogic.dk/ - * License: [http://www.pixastic.com/lib/license.txt] - */ - -Pixastic.Actions.pointillize = { - - process : function(params) { - var radius = Math.max(1,parseInt(params.options.radius,10)); - var density = Math.min(5,Math.max(0,parseFloat(params.options.density)||0)); - var noise = Math.max(0,parseFloat(params.options.noise)||0); - var transparent = !!(params.options.transparent && params.options.transparent != "false"); - - if (Pixastic.Client.hasCanvasImageData()) { - var rect = params.options.rect; - var w = rect.width; - var h = rect.height; - var w4 = w*4; - var y = h; - - var ctx = params.canvas.getContext("2d"); - var canvasWidth = params.canvas.width; - var canvasHeight = params.canvas.height; - - var pixel = document.createElement("canvas"); - pixel.width = pixel.height = 1; - var pixelCtx = pixel.getContext("2d"); - - var copy = document.createElement("canvas"); - copy.width = w; - copy.height = h; - var copyCtx = copy.getContext("2d"); - copyCtx.drawImage(params.canvas,rect.left,rect.top,w,h, 0,0,w,h); - - var diameter = radius * 2; - - if (transparent) - ctx.clearRect(rect.left, rect.top, rect.width, rect.height); - - var noiseRadius = radius * noise; - - var dist = 1 / density; - - for (var y=0;y>0 : x; - rndY = noise ? (y+((Math.random()*2-1) * noiseRadius))>>0 : y; - - var pixX = rndX - radius; - var pixY = rndY - radius; - if (pixX < 0) pixX = 0; - if (pixY < 0) pixY = 0; - - var cx = rndX + rect.left; - var cy = rndY + rect.top; - if (cx < 0) cx = 0; - if (cx > canvasWidth) cx = canvasWidth; - if (cy < 0) cy = 0; - if (cy > canvasHeight) cy = canvasHeight; - - var diameterX = diameter; - var diameterY = diameter; - - if (diameterX + pixX > w) - diameterX = w - pixX; - if (diameterY + pixY > h) - diameterY = h - pixY; - if (diameterX < 1) diameterX = 1; - if (diameterY < 1) diameterY = 1; - - pixelCtx.drawImage(copy, pixX, pixY, diameterX, diameterY, 0, 0, 1, 1); - var data = pixelCtx.getImageData(0,0,1,1).data; - - ctx.fillStyle = "rgb(" + data[0] + "," + data[1] + "," + data[2] + ")"; - ctx.beginPath(); - ctx.arc(cx, cy, radius, 0, Math.PI*2, true); - ctx.closePath(); - ctx.fill(); - } - } - - params.useData = false; - - return true; - } - }, - checkSupport : function() { - return (Pixastic.Client.hasCanvasImageData()); - } -} \ No newline at end of file diff --git a/actions/posterize.js b/actions/posterize.js deleted file mode 100755 index 1bee4b8..0000000 --- a/actions/posterize.js +++ /dev/null @@ -1,57 +0,0 @@ -/* - * Pixastic Lib - Posterize effect - v0.1.0 - * Copyright (c) 2008 Jacob Seidelin, jseidelin@nihilogic.dk, http://blog.nihilogic.dk/ - * License: [http://www.pixastic.com/lib/license.txt] - */ - -Pixastic.Actions.posterize = { - - process : function(params) { - - - var numLevels = 256; - if (typeof params.options.levels != "undefined") - numLevels = parseInt(params.options.levels,10)||1; - - if (Pixastic.Client.hasCanvasImageData()) { - var data = Pixastic.prepareData(params); - - numLevels = Math.max(2,Math.min(256,numLevels)); - - var numAreas = 256 / numLevels; - var numValues = 256 / (numLevels-1); - - var rect = params.options.rect; - var w = rect.width; - var h = rect.height; - var w4 = w*4; - var y = h; - do { - var offsetY = (y-1)*w4; - var x = w; - do { - var offset = offsetY + (x-1)*4; - - var r = numValues * ((data[offset] / numAreas)>>0); - var g = numValues * ((data[offset+1] / numAreas)>>0); - var b = numValues * ((data[offset+2] / numAreas)>>0); - - if (r > 255) r = 255; - if (g > 255) g = 255; - if (b > 255) b = 255; - - data[offset] = r; - data[offset+1] = g; - data[offset+2] = b; - - } while (--x); - } while (--y); - return true; - } - }, - checkSupport : function() { - return Pixastic.Client.hasCanvasImageData(); - } -} - - diff --git a/actions/removenoise.js b/actions/removenoise.js deleted file mode 100755 index c5eca83..0000000 --- a/actions/removenoise.js +++ /dev/null @@ -1,89 +0,0 @@ -/* - * Pixastic Lib - Remove noise - v0.1.0 - * Copyright (c) 2008 Jacob Seidelin, jseidelin@nihilogic.dk, http://blog.nihilogic.dk/ - * License: [http://www.pixastic.com/lib/license.txt] - */ - -Pixastic.Actions.removenoise = { - process : function(params) { - - if (Pixastic.Client.hasCanvasImageData()) { - var data = Pixastic.prepareData(params); - - var rect = params.options.rect; - var w = rect.width; - var h = rect.height; - - var w4 = w*4; - var y = h; - do { - var offsetY = (y-1)*w4; - - var nextY = (y == h) ? y - 1 : y; - var prevY = (y == 1) ? 0 : y-2; - - var offsetYPrev = prevY*w*4; - var offsetYNext = nextY*w*4; - - var x = w; - do { - var offset = offsetY + (x*4-4); - - var offsetPrev = offsetYPrev + ((x == 1) ? 0 : x-2) * 4; - var offsetNext = offsetYNext + ((x == w) ? x-1 : x) * 4; - - var minR, maxR, minG, maxG, minB, maxB; - - minR = maxR = data[offsetPrev]; - var r1 = data[offset-4], r2 = data[offset+4], r3 = data[offsetNext]; - if (r1 < minR) minR = r1; - if (r2 < minR) minR = r2; - if (r3 < minR) minR = r3; - if (r1 > maxR) maxR = r1; - if (r2 > maxR) maxR = r2; - if (r3 > maxR) maxR = r3; - - minG = maxG = data[offsetPrev+1]; - var g1 = data[offset-3], g2 = data[offset+5], g3 = data[offsetNext+1]; - if (g1 < minG) minG = g1; - if (g2 < minG) minG = g2; - if (g3 < minG) minG = g3; - if (g1 > maxG) maxG = g1; - if (g2 > maxG) maxG = g2; - if (g3 > maxG) maxG = g3; - - minB = maxB = data[offsetPrev+2]; - var b1 = data[offset-2], b2 = data[offset+6], b3 = data[offsetNext+2]; - if (b1 < minB) minB = b1; - if (b2 < minB) minB = b2; - if (b3 < minB) minB = b3; - if (b1 > maxB) maxB = b1; - if (b2 > maxB) maxB = b2; - if (b3 > maxB) maxB = b3; - - if (data[offset] > maxR) { - data[offset] = maxR; - } else if (data[offset] < minR) { - data[offset] = minR; - } - if (data[offset+1] > maxG) { - data[offset+1] = maxG; - } else if (data[offset+1] < minG) { - data[offset+1] = minG; - } - if (data[offset+2] > maxB) { - data[offset+2] = maxB; - } else if (data[offset+2] < minB) { - data[offset+2] = minB; - } - - } while (--x); - } while (--y); - - return true; - } - }, - checkSupport : function() { - return Pixastic.Client.hasCanvasImageData(); - } -} \ No newline at end of file diff --git a/actions/resize.js b/actions/resize.js deleted file mode 100755 index 6f87636..0000000 --- a/actions/resize.js +++ /dev/null @@ -1,36 +0,0 @@ -/* - * Pixastic Lib - Resize - v0.1.0 - * Copyright (c) 2009 Jacob Seidelin, jseidelin@nihilogic.dk, http://blog.nihilogic.dk/ - * License: [http://www.pixastic.com/lib/license.txt] - */ - -Pixastic.Actions.resize = { - process : function(params) { - if (Pixastic.Client.hasCanvas()) { - var width = parseInt(params.options.width,10); - var height = parseInt(params.options.height,10); - var canvas = params.canvas; - - if (width < 1) width = 1; - if (width < 2) width = 2; - - var copy = document.createElement("canvas"); - copy.width = width; - copy.height = height; - - copy.getContext("2d").drawImage(canvas,0,0,width,height); - canvas.width = width; - canvas.height = height; - - canvas.getContext("2d").drawImage(copy,0,0); - - params.useData = false; - return true; - } - }, - checkSupport : function() { - return Pixastic.Client.hasCanvas(); - } -} - - diff --git a/actions/rotate.js b/actions/rotate.js deleted file mode 100755 index 20d0170..0000000 --- a/actions/rotate.js +++ /dev/null @@ -1,53 +0,0 @@ -/* - * Pixastic Lib - Rotate - v0.1.0 - * Copyright (c) 2009 Jacob Seidelin, jseidelin@nihilogic.dk, http://blog.nihilogic.dk/ - * License: [http://www.pixastic.com/lib/license.txt] - */ - -Pixastic.Actions.rotate = { - process : function(params) { - if (Pixastic.Client.hasCanvas()) { - var canvas = params.canvas; - - var width = params.width; - var height = params.height; - - var copy = document.createElement("canvas"); - copy.width = width; - copy.height = height; - copy.getContext("2d").drawImage(canvas,0,0,width,height); - - var angle = -parseFloat(params.options.angle) * Math.PI / 180; - - var dimAngle = angle; - if (dimAngle > Math.PI*0.5) - dimAngle = Math.PI - dimAngle; - if (dimAngle < -Math.PI*0.5) - dimAngle = -Math.PI - dimAngle; - - var diag = Math.sqrt(width*width + height*height); - - var diagAngle1 = Math.abs(dimAngle) - Math.abs(Math.atan2(height, width)); - var diagAngle2 = Math.abs(dimAngle) + Math.abs(Math.atan2(height, width)); - - var newWidth = Math.abs(Math.cos(diagAngle1) * diag); - var newHeight = Math.abs(Math.sin(diagAngle2) * diag); - - canvas.width = newWidth; - canvas.height = newHeight; - - var ctx = canvas.getContext("2d"); - ctx.translate(newWidth/2, newHeight/2); - ctx.rotate(angle); - ctx.drawImage(copy,-width/2,-height/2); - - params.useData = false; - return true; - } - }, - checkSupport : function() { - return Pixastic.Client.hasCanvas(); - } -} - - diff --git a/actions/sepia.js b/actions/sepia.js deleted file mode 100755 index 5131f2d..0000000 --- a/actions/sepia.js +++ /dev/null @@ -1,60 +0,0 @@ -/* - * Pixastic Lib - Sepia filter - v0.1.0 - * Copyright (c) 2008 Jacob Seidelin, jseidelin@nihilogic.dk, http://blog.nihilogic.dk/ - * License: [http://www.pixastic.com/lib/license.txt] - */ - -Pixastic.Actions.sepia = { - - process : function(params) { - var mode = (parseInt(params.options.mode,10)||0); - if (mode < 0) mode = 0; - if (mode > 1) mode = 1; - - if (Pixastic.Client.hasCanvasImageData()) { - var data = Pixastic.prepareData(params); - var rect = params.options.rect; - var w = rect.width; - var h = rect.height; - var w4 = w*4; - var y = h; - do { - var offsetY = (y-1)*w4; - var x = w; - do { - var offset = offsetY + (x-1)*4; - - if (mode) { - // a bit faster, but not as good - var d = data[offset] * 0.299 + data[offset+1] * 0.587 + data[offset+2] * 0.114; - var r = (d + 39); - var g = (d + 14); - var b = (d - 36); - } else { - // Microsoft - var or = data[offset]; - var og = data[offset+1]; - var ob = data[offset+2]; - - var r = (or * 0.393 + og * 0.769 + ob * 0.189); - var g = (or * 0.349 + og * 0.686 + ob * 0.168); - var b = (or * 0.272 + og * 0.534 + ob * 0.131); - } - - if (r < 0) r = 0; if (r > 255) r = 255; - if (g < 0) g = 0; if (g > 255) g = 255; - if (b < 0) b = 0; if (b > 255) b = 255; - - data[offset] = r; - data[offset+1] = g; - data[offset+2] = b; - - } while (--x); - } while (--y); - return true; - } - }, - checkSupport : function() { - return Pixastic.Client.hasCanvasImageData(); - } -} \ No newline at end of file diff --git a/actions/sharpen.js b/actions/sharpen.js deleted file mode 100755 index cbf7ba9..0000000 --- a/actions/sharpen.js +++ /dev/null @@ -1,110 +0,0 @@ -/* - * Pixastic Lib - Sharpen filter - v0.1.0 - * Copyright (c) 2008 Jacob Seidelin, jseidelin@nihilogic.dk, http://blog.nihilogic.dk/ - * License: [http://www.pixastic.com/lib/license.txt] - */ - -Pixastic.Actions.sharpen = { - process : function(params) { - - var strength = 0; - if (typeof params.options.amount != "undefined") - strength = parseFloat(params.options.amount)||0; - - if (strength < 0) strength = 0; - if (strength > 1) strength = 1; - - if (Pixastic.Client.hasCanvasImageData()) { - var data = Pixastic.prepareData(params); - var dataCopy = Pixastic.prepareData(params, true) - - var mul = 15; - var mulOther = 1 + 3*strength; - - var kernel = [ - [0, -mulOther, 0], - [-mulOther, mul, -mulOther], - [0, -mulOther, 0] - ]; - - var weight = 0; - for (var i=0;i<3;i++) { - for (var j=0;j<3;j++) { - weight += kernel[i][j]; - } - } - - weight = 1 / weight; - - var rect = params.options.rect; - var w = rect.width; - var h = rect.height; - - mul *= weight; - mulOther *= weight; - - var w4 = w*4; - var y = h; - do { - var offsetY = (y-1)*w4; - - var nextY = (y == h) ? y - 1 : y; - var prevY = (y == 1) ? 0 : y-2; - - var offsetYPrev = prevY*w4; - var offsetYNext = nextY*w4; - - var x = w; - do { - var offset = offsetY + (x*4-4); - - var offsetPrev = offsetYPrev + ((x == 1) ? 0 : x-2) * 4; - var offsetNext = offsetYNext + ((x == w) ? x-1 : x) * 4; - - var r = (( - - dataCopy[offsetPrev] - - dataCopy[offset-4] - - dataCopy[offset+4] - - dataCopy[offsetNext]) * mulOther - + dataCopy[offset] * mul - ); - - var g = (( - - dataCopy[offsetPrev+1] - - dataCopy[offset-3] - - dataCopy[offset+5] - - dataCopy[offsetNext+1]) * mulOther - + dataCopy[offset+1] * mul - ); - - var b = (( - - dataCopy[offsetPrev+2] - - dataCopy[offset-2] - - dataCopy[offset+6] - - dataCopy[offsetNext+2]) * mulOther - + dataCopy[offset+2] * mul - ); - - - if (r < 0 ) r = 0; - if (g < 0 ) g = 0; - if (b < 0 ) b = 0; - if (r > 255 ) r = 255; - if (g > 255 ) g = 255; - if (b > 255 ) b = 255; - - data[offset] = r; - data[offset+1] = g; - data[offset+2] = b; - - } while (--x); - } while (--y); - - return true; - - } - }, - checkSupport : function() { - return Pixastic.Client.hasCanvasImageData(); - } -} diff --git a/actions/solarize.js b/actions/solarize.js deleted file mode 100755 index 634c4b7..0000000 --- a/actions/solarize.js +++ /dev/null @@ -1,45 +0,0 @@ -/* - * Pixastic Lib - Solarize filter - v0.1.0 - * Copyright (c) 2008 Jacob Seidelin, jseidelin@nihilogic.dk, http://blog.nihilogic.dk/ - * License: [http://www.pixastic.com/lib/license.txt] - */ - -Pixastic.Actions.solarize = { - - process : function(params) { - var useAverage = !!(params.options.average && params.options.average != "false"); - - if (Pixastic.Client.hasCanvasImageData()) { - var data = Pixastic.prepareData(params); - var rect = params.options.rect; - var w = rect.width; - var h = rect.height; - var w4 = w*4; - var y = h; - do { - var offsetY = (y-1)*w4; - var x = w; - do { - var offset = offsetY + (x-1)*4; - - var r = data[offset]; - var g = data[offset+1]; - var b = data[offset+2]; - - if (r > 127) r = 255 - r; - if (g > 127) g = 255 - g; - if (b > 127) b = 255 - b; - - data[offset] = r; - data[offset+1] = g; - data[offset+2] = b; - - } while (--x); - } while (--y); - return true; - } - }, - checkSupport : function() { - return (Pixastic.Client.hasCanvasImageData()); - } -} \ No newline at end of file diff --git a/actions/unsharpmask.js b/actions/unsharpmask.js deleted file mode 100755 index b26701d..0000000 --- a/actions/unsharpmask.js +++ /dev/null @@ -1,111 +0,0 @@ -/* - * Pixastic Lib - USM - v0.1.0 - * Copyright (c) 2008 Jacob Seidelin, jseidelin@nihilogic.dk, http://blog.nihilogic.dk/ - * License: [http://www.pixastic.com/lib/license.txt] - */ - - -Pixastic.Actions.unsharpmask = { - process : function(params) { - - var amount = (parseFloat(params.options.amount)||0); - var blurAmount = parseFloat(params.options.radius)||0; - var threshold = parseFloat(params.options.threshold)||0; - - amount = Math.min(500,Math.max(0,amount)) / 2; - blurAmount = Math.min(5,Math.max(0,blurAmount)) / 10; - threshold = Math.min(255,Math.max(0,threshold)); - - threshold--; - var thresholdNeg = -threshold; - - amount *= 0.016; - amount++; - - if (Pixastic.Client.hasCanvasImageData()) { - var rect = params.options.rect; - - var blurCanvas = document.createElement("canvas"); - blurCanvas.width = params.width; - blurCanvas.height = params.height; - var blurCtx = blurCanvas.getContext("2d"); - blurCtx.drawImage(params.canvas,0,0); - - var scale = 2; - var smallWidth = Math.round(params.width / scale); - var smallHeight = Math.round(params.height / scale); - - var copy = document.createElement("canvas"); - copy.width = smallWidth; - copy.height = smallHeight; - - var steps = Math.round(blurAmount * 20); - - var copyCtx = copy.getContext("2d"); - for (var i=0;i threshold || difR < thresholdNeg) { - var blurR = blurData[offset]; - blurR = amount * difR + blurR; - data[offset] = blurR > 255 ? 255 : (blurR < 0 ? 0 : blurR); - } - - var difG = data[offset+1] - blurData[offset+1]; - if (difG > threshold || difG < thresholdNeg) { - var blurG = blurData[offset+1]; - blurG = amount * difG + blurG; - data[offset+1] = blurG > 255 ? 255 : (blurG < 0 ? 0 : blurG); - } - - var difB = data[offset+2] - blurData[offset+2]; - if (difB > threshold || difB < thresholdNeg) { - var blurB = blurData[offset+2]; - blurB = amount * difB + blurB; - data[offset+2] = blurB > 255 ? 255 : (blurB < 0 ? 0 : blurB); - } - - } while (--x); - } while (--y); - - return true; - } - }, - checkSupport : function() { - return Pixastic.Client.hasCanvasImageData(); - } -} - - - diff --git a/index.html b/index.html new file mode 100644 index 0000000..b09efe3 --- /dev/null +++ b/index.html @@ -0,0 +1,185 @@ + + + + + Pixastic + + + + + + + + +
    + +
    + + + + + \ No newline at end of file diff --git a/license-gpl-3.0.txt b/license-gpl-3.0.txt new file mode 100644 index 0000000..94a9ed0 --- /dev/null +++ b/license-gpl-3.0.txt @@ -0,0 +1,674 @@ + GNU GENERAL PUBLIC LICENSE + Version 3, 29 June 2007 + + Copyright (C) 2007 Free Software Foundation, Inc. + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + + The GNU General Public License is a free, copyleft license for +software and other kinds of works. + + The licenses for most software and other practical works are designed +to take away your freedom to share and change the works. By contrast, +the GNU General Public License is intended to guarantee your freedom to +share and change all versions of a program--to make sure it remains free +software for all its users. We, the Free Software Foundation, use the +GNU General Public License for most of our software; it applies also to +any other work released this way by its authors. You can apply it to +your programs, too. + + When we speak of free software, we are referring to freedom, not +price. Our General Public Licenses are designed to make sure that you +have the freedom to distribute copies of free software (and charge for +them if you wish), that you receive source code or can get it if you +want it, that you can change the software or use pieces of it in new +free programs, and that you know you can do these things. + + To protect your rights, we need to prevent others from denying you +these rights or asking you to surrender the rights. Therefore, you have +certain responsibilities if you distribute copies of the software, or if +you modify it: responsibilities to respect the freedom of others. + + For example, if you distribute copies of such a program, whether +gratis or for a fee, you must pass on to the recipients the same +freedoms that you received. You must make sure that they, too, receive +or can get the source code. And you must show them these terms so they +know their rights. + + Developers that use the GNU GPL protect your rights with two steps: +(1) assert copyright on the software, and (2) offer you this License +giving you legal permission to copy, distribute and/or modify it. + + For the developers' and authors' protection, the GPL clearly explains +that there is no warranty for this free software. For both users' and +authors' sake, the GPL requires that modified versions be marked as +changed, so that their problems will not be attributed erroneously to +authors of previous versions. + + Some devices are designed to deny users access to install or run +modified versions of the software inside them, although the manufacturer +can do so. This is fundamentally incompatible with the aim of +protecting users' freedom to change the software. The systematic +pattern of such abuse occurs in the area of products for individuals to +use, which is precisely where it is most unacceptable. Therefore, we +have designed this version of the GPL to prohibit the practice for those +products. If such problems arise substantially in other domains, we +stand ready to extend this provision to those domains in future versions +of the GPL, as needed to protect the freedom of users. + + Finally, every program is threatened constantly by software patents. +States should not allow patents to restrict development and use of +software on general-purpose computers, but in those that do, we wish to +avoid the special danger that patents applied to a free program could +make it effectively proprietary. To prevent this, the GPL assures that +patents cannot be used to render the program non-free. + + The precise terms and conditions for copying, distribution and +modification follow. + + TERMS AND CONDITIONS + + 0. Definitions. + + "This License" refers to version 3 of the GNU General Public License. + + "Copyright" also means copyright-like laws that apply to other kinds of +works, such as semiconductor masks. + + "The Program" refers to any copyrightable work licensed under this +License. Each licensee is addressed as "you". "Licensees" and +"recipients" may be individuals or organizations. + + To "modify" a work means to copy from or adapt all or part of the work +in a fashion requiring copyright permission, other than the making of an +exact copy. The resulting work is called a "modified version" of the +earlier work or a work "based on" the earlier work. + + A "covered work" means either the unmodified Program or a work based +on the Program. + + To "propagate" a work means to do anything with it that, without +permission, would make you directly or secondarily liable for +infringement under applicable copyright law, except executing it on a +computer or modifying a private copy. Propagation includes copying, +distribution (with or without modification), making available to the +public, and in some countries other activities as well. + + To "convey" a work means any kind of propagation that enables other +parties to make or receive copies. Mere interaction with a user through +a computer network, with no transfer of a copy, is not conveying. + + An interactive user interface displays "Appropriate Legal Notices" +to the extent that it includes a convenient and prominently visible +feature that (1) displays an appropriate copyright notice, and (2) +tells the user that there is no warranty for the work (except to the +extent that warranties are provided), that licensees may convey the +work under this License, and how to view a copy of this License. If +the interface presents a list of user commands or options, such as a +menu, a prominent item in the list meets this criterion. + + 1. Source Code. + + The "source code" for a work means the preferred form of the work +for making modifications to it. "Object code" means any non-source +form of a work. + + A "Standard Interface" means an interface that either is an official +standard defined by a recognized standards body, or, in the case of +interfaces specified for a particular programming language, one that +is widely used among developers working in that language. + + The "System Libraries" of an executable work include anything, other +than the work as a whole, that (a) is included in the normal form of +packaging a Major Component, but which is not part of that Major +Component, and (b) serves only to enable use of the work with that +Major Component, or to implement a Standard Interface for which an +implementation is available to the public in source code form. A +"Major Component", in this context, means a major essential component +(kernel, window system, and so on) of the specific operating system +(if any) on which the executable work runs, or a compiler used to +produce the work, or an object code interpreter used to run it. + + The "Corresponding Source" for a work in object code form means all +the source code needed to generate, install, and (for an executable +work) run the object code and to modify the work, including scripts to +control those activities. However, it does not include the work's +System Libraries, or general-purpose tools or generally available free +programs which are used unmodified in performing those activities but +which are not part of the work. For example, Corresponding Source +includes interface definition files associated with source files for +the work, and the source code for shared libraries and dynamically +linked subprograms that the work is specifically designed to require, +such as by intimate data communication or control flow between those +subprograms and other parts of the work. + + The Corresponding Source need not include anything that users +can regenerate automatically from other parts of the Corresponding +Source. + + The Corresponding Source for a work in source code form is that +same work. + + 2. Basic Permissions. + + All rights granted under this License are granted for the term of +copyright on the Program, and are irrevocable provided the stated +conditions are met. This License explicitly affirms your unlimited +permission to run the unmodified Program. The output from running a +covered work is covered by this License only if the output, given its +content, constitutes a covered work. This License acknowledges your +rights of fair use or other equivalent, as provided by copyright law. + + You may make, run and propagate covered works that you do not +convey, without conditions so long as your license otherwise remains +in force. You may convey covered works to others for the sole purpose +of having them make modifications exclusively for you, or provide you +with facilities for running those works, provided that you comply with +the terms of this License in conveying all material for which you do +not control copyright. Those thus making or running the covered works +for you must do so exclusively on your behalf, under your direction +and control, on terms that prohibit them from making any copies of +your copyrighted material outside their relationship with you. + + Conveying under any other circumstances is permitted solely under +the conditions stated below. Sublicensing is not allowed; section 10 +makes it unnecessary. + + 3. Protecting Users' Legal Rights From Anti-Circumvention Law. + + No covered work shall be deemed part of an effective technological +measure under any applicable law fulfilling obligations under article +11 of the WIPO copyright treaty adopted on 20 December 1996, or +similar laws prohibiting or restricting circumvention of such +measures. + + When you convey a covered work, you waive any legal power to forbid +circumvention of technological measures to the extent such circumvention +is effected by exercising rights under this License with respect to +the covered work, and you disclaim any intention to limit operation or +modification of the work as a means of enforcing, against the work's +users, your or third parties' legal rights to forbid circumvention of +technological measures. + + 4. Conveying Verbatim Copies. + + You may convey verbatim copies of the Program's source code as you +receive it, in any medium, provided that you conspicuously and +appropriately publish on each copy an appropriate copyright notice; +keep intact all notices stating that this License and any +non-permissive terms added in accord with section 7 apply to the code; +keep intact all notices of the absence of any warranty; and give all +recipients a copy of this License along with the Program. + + You may charge any price or no price for each copy that you convey, +and you may offer support or warranty protection for a fee. + + 5. Conveying Modified Source Versions. + + You may convey a work based on the Program, or the modifications to +produce it from the Program, in the form of source code under the +terms of section 4, provided that you also meet all of these conditions: + + a) The work must carry prominent notices stating that you modified + it, and giving a relevant date. + + b) The work must carry prominent notices stating that it is + released under this License and any conditions added under section + 7. This requirement modifies the requirement in section 4 to + "keep intact all notices". + + c) You must license the entire work, as a whole, under this + License to anyone who comes into possession of a copy. This + License will therefore apply, along with any applicable section 7 + additional terms, to the whole of the work, and all its parts, + regardless of how they are packaged. This License gives no + permission to license the work in any other way, but it does not + invalidate such permission if you have separately received it. + + d) If the work has interactive user interfaces, each must display + Appropriate Legal Notices; however, if the Program has interactive + interfaces that do not display Appropriate Legal Notices, your + work need not make them do so. + + A compilation of a covered work with other separate and independent +works, which are not by their nature extensions of the covered work, +and which are not combined with it such as to form a larger program, +in or on a volume of a storage or distribution medium, is called an +"aggregate" if the compilation and its resulting copyright are not +used to limit the access or legal rights of the compilation's users +beyond what the individual works permit. Inclusion of a covered work +in an aggregate does not cause this License to apply to the other +parts of the aggregate. + + 6. Conveying Non-Source Forms. + + You may convey a covered work in object code form under the terms +of sections 4 and 5, provided that you also convey the +machine-readable Corresponding Source under the terms of this License, +in one of these ways: + + a) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by the + Corresponding Source fixed on a durable physical medium + customarily used for software interchange. + + b) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by a + written offer, valid for at least three years and valid for as + long as you offer spare parts or customer support for that product + model, to give anyone who possesses the object code either (1) a + copy of the Corresponding Source for all the software in the + product that is covered by this License, on a durable physical + medium customarily used for software interchange, for a price no + more than your reasonable cost of physically performing this + conveying of source, or (2) access to copy the + Corresponding Source from a network server at no charge. + + c) Convey individual copies of the object code with a copy of the + written offer to provide the Corresponding Source. This + alternative is allowed only occasionally and noncommercially, and + only if you received the object code with such an offer, in accord + with subsection 6b. + + d) Convey the object code by offering access from a designated + place (gratis or for a charge), and offer equivalent access to the + Corresponding Source in the same way through the same place at no + further charge. You need not require recipients to copy the + Corresponding Source along with the object code. If the place to + copy the object code is a network server, the Corresponding Source + may be on a different server (operated by you or a third party) + that supports equivalent copying facilities, provided you maintain + clear directions next to the object code saying where to find the + Corresponding Source. Regardless of what server hosts the + Corresponding Source, you remain obligated to ensure that it is + available for as long as needed to satisfy these requirements. + + e) Convey the object code using peer-to-peer transmission, provided + you inform other peers where the object code and Corresponding + Source of the work are being offered to the general public at no + charge under subsection 6d. + + A separable portion of the object code, whose source code is excluded +from the Corresponding Source as a System Library, need not be +included in conveying the object code work. + + A "User Product" is either (1) a "consumer product", which means any +tangible personal property which is normally used for personal, family, +or household purposes, or (2) anything designed or sold for incorporation +into a dwelling. In determining whether a product is a consumer product, +doubtful cases shall be resolved in favor of coverage. For a particular +product received by a particular user, "normally used" refers to a +typical or common use of that class of product, regardless of the status +of the particular user or of the way in which the particular user +actually uses, or expects or is expected to use, the product. A product +is a consumer product regardless of whether the product has substantial +commercial, industrial or non-consumer uses, unless such uses represent +the only significant mode of use of the product. + + "Installation Information" for a User Product means any methods, +procedures, authorization keys, or other information required to install +and execute modified versions of a covered work in that User Product from +a modified version of its Corresponding Source. The information must +suffice to ensure that the continued functioning of the modified object +code is in no case prevented or interfered with solely because +modification has been made. + + If you convey an object code work under this section in, or with, or +specifically for use in, a User Product, and the conveying occurs as +part of a transaction in which the right of possession and use of the +User Product is transferred to the recipient in perpetuity or for a +fixed term (regardless of how the transaction is characterized), the +Corresponding Source conveyed under this section must be accompanied +by the Installation Information. But this requirement does not apply +if neither you nor any third party retains the ability to install +modified object code on the User Product (for example, the work has +been installed in ROM). + + The requirement to provide Installation Information does not include a +requirement to continue to provide support service, warranty, or updates +for a work that has been modified or installed by the recipient, or for +the User Product in which it has been modified or installed. Access to a +network may be denied when the modification itself materially and +adversely affects the operation of the network or violates the rules and +protocols for communication across the network. + + Corresponding Source conveyed, and Installation Information provided, +in accord with this section must be in a format that is publicly +documented (and with an implementation available to the public in +source code form), and must require no special password or key for +unpacking, reading or copying. + + 7. Additional Terms. + + "Additional permissions" are terms that supplement the terms of this +License by making exceptions from one or more of its conditions. +Additional permissions that are applicable to the entire Program shall +be treated as though they were included in this License, to the extent +that they are valid under applicable law. If additional permissions +apply only to part of the Program, that part may be used separately +under those permissions, but the entire Program remains governed by +this License without regard to the additional permissions. + + When you convey a copy of a covered work, you may at your option +remove any additional permissions from that copy, or from any part of +it. (Additional permissions may be written to require their own +removal in certain cases when you modify the work.) You may place +additional permissions on material, added by you to a covered work, +for which you have or can give appropriate copyright permission. + + Notwithstanding any other provision of this License, for material you +add to a covered work, you may (if authorized by the copyright holders of +that material) supplement the terms of this License with terms: + + a) Disclaiming warranty or limiting liability differently from the + terms of sections 15 and 16 of this License; or + + b) Requiring preservation of specified reasonable legal notices or + author attributions in that material or in the Appropriate Legal + Notices displayed by works containing it; or + + c) Prohibiting misrepresentation of the origin of that material, or + requiring that modified versions of such material be marked in + reasonable ways as different from the original version; or + + d) Limiting the use for publicity purposes of names of licensors or + authors of the material; or + + e) Declining to grant rights under trademark law for use of some + trade names, trademarks, or service marks; or + + f) Requiring indemnification of licensors and authors of that + material by anyone who conveys the material (or modified versions of + it) with contractual assumptions of liability to the recipient, for + any liability that these contractual assumptions directly impose on + those licensors and authors. + + All other non-permissive additional terms are considered "further +restrictions" within the meaning of section 10. If the Program as you +received it, or any part of it, contains a notice stating that it is +governed by this License along with a term that is a further +restriction, you may remove that term. If a license document contains +a further restriction but permits relicensing or conveying under this +License, you may add to a covered work material governed by the terms +of that license document, provided that the further restriction does +not survive such relicensing or conveying. + + If you add terms to a covered work in accord with this section, you +must place, in the relevant source files, a statement of the +additional terms that apply to those files, or a notice indicating +where to find the applicable terms. + + Additional terms, permissive or non-permissive, may be stated in the +form of a separately written license, or stated as exceptions; +the above requirements apply either way. + + 8. Termination. + + You may not propagate or modify a covered work except as expressly +provided under this License. Any attempt otherwise to propagate or +modify it is void, and will automatically terminate your rights under +this License (including any patent licenses granted under the third +paragraph of section 11). + + However, if you cease all violation of this License, then your +license from a particular copyright holder is reinstated (a) +provisionally, unless and until the copyright holder explicitly and +finally terminates your license, and (b) permanently, if the copyright +holder fails to notify you of the violation by some reasonable means +prior to 60 days after the cessation. + + Moreover, your license from a particular copyright holder is +reinstated permanently if the copyright holder notifies you of the +violation by some reasonable means, this is the first time you have +received notice of violation of this License (for any work) from that +copyright holder, and you cure the violation prior to 30 days after +your receipt of the notice. + + Termination of your rights under this section does not terminate the +licenses of parties who have received copies or rights from you under +this License. If your rights have been terminated and not permanently +reinstated, you do not qualify to receive new licenses for the same +material under section 10. + + 9. Acceptance Not Required for Having Copies. + + You are not required to accept this License in order to receive or +run a copy of the Program. Ancillary propagation of a covered work +occurring solely as a consequence of using peer-to-peer transmission +to receive a copy likewise does not require acceptance. However, +nothing other than this License grants you permission to propagate or +modify any covered work. These actions infringe copyright if you do +not accept this License. Therefore, by modifying or propagating a +covered work, you indicate your acceptance of this License to do so. + + 10. Automatic Licensing of Downstream Recipients. + + Each time you convey a covered work, the recipient automatically +receives a license from the original licensors, to run, modify and +propagate that work, subject to this License. You are not responsible +for enforcing compliance by third parties with this License. + + An "entity transaction" is a transaction transferring control of an +organization, or substantially all assets of one, or subdividing an +organization, or merging organizations. If propagation of a covered +work results from an entity transaction, each party to that +transaction who receives a copy of the work also receives whatever +licenses to the work the party's predecessor in interest had or could +give under the previous paragraph, plus a right to possession of the +Corresponding Source of the work from the predecessor in interest, if +the predecessor has it or can get it with reasonable efforts. + + You may not impose any further restrictions on the exercise of the +rights granted or affirmed under this License. For example, you may +not impose a license fee, royalty, or other charge for exercise of +rights granted under this License, and you may not initiate litigation +(including a cross-claim or counterclaim in a lawsuit) alleging that +any patent claim is infringed by making, using, selling, offering for +sale, or importing the Program or any portion of it. + + 11. Patents. + + A "contributor" is a copyright holder who authorizes use under this +License of the Program or a work on which the Program is based. The +work thus licensed is called the contributor's "contributor version". + + A contributor's "essential patent claims" are all patent claims +owned or controlled by the contributor, whether already acquired or +hereafter acquired, that would be infringed by some manner, permitted +by this License, of making, using, or selling its contributor version, +but do not include claims that would be infringed only as a +consequence of further modification of the contributor version. For +purposes of this definition, "control" includes the right to grant +patent sublicenses in a manner consistent with the requirements of +this License. + + Each contributor grants you a non-exclusive, worldwide, royalty-free +patent license under the contributor's essential patent claims, to +make, use, sell, offer for sale, import and otherwise run, modify and +propagate the contents of its contributor version. + + In the following three paragraphs, a "patent license" is any express +agreement or commitment, however denominated, not to enforce a patent +(such as an express permission to practice a patent or covenant not to +sue for patent infringement). To "grant" such a patent license to a +party means to make such an agreement or commitment not to enforce a +patent against the party. + + If you convey a covered work, knowingly relying on a patent license, +and the Corresponding Source of the work is not available for anyone +to copy, free of charge and under the terms of this License, through a +publicly available network server or other readily accessible means, +then you must either (1) cause the Corresponding Source to be so +available, or (2) arrange to deprive yourself of the benefit of the +patent license for this particular work, or (3) arrange, in a manner +consistent with the requirements of this License, to extend the patent +license to downstream recipients. "Knowingly relying" means you have +actual knowledge that, but for the patent license, your conveying the +covered work in a country, or your recipient's use of the covered work +in a country, would infringe one or more identifiable patents in that +country that you have reason to believe are valid. + + If, pursuant to or in connection with a single transaction or +arrangement, you convey, or propagate by procuring conveyance of, a +covered work, and grant a patent license to some of the parties +receiving the covered work authorizing them to use, propagate, modify +or convey a specific copy of the covered work, then the patent license +you grant is automatically extended to all recipients of the covered +work and works based on it. + + A patent license is "discriminatory" if it does not include within +the scope of its coverage, prohibits the exercise of, or is +conditioned on the non-exercise of one or more of the rights that are +specifically granted under this License. You may not convey a covered +work if you are a party to an arrangement with a third party that is +in the business of distributing software, under which you make payment +to the third party based on the extent of your activity of conveying +the work, and under which the third party grants, to any of the +parties who would receive the covered work from you, a discriminatory +patent license (a) in connection with copies of the covered work +conveyed by you (or copies made from those copies), or (b) primarily +for and in connection with specific products or compilations that +contain the covered work, unless you entered into that arrangement, +or that patent license was granted, prior to 28 March 2007. + + Nothing in this License shall be construed as excluding or limiting +any implied license or other defenses to infringement that may +otherwise be available to you under applicable patent law. + + 12. No Surrender of Others' Freedom. + + If conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot convey a +covered work so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you may +not convey it at all. For example, if you agree to terms that obligate you +to collect a royalty for further conveying from those to whom you convey +the Program, the only way you could satisfy both those terms and this +License would be to refrain entirely from conveying the Program. + + 13. Use with the GNU Affero General Public License. + + Notwithstanding any other provision of this License, you have +permission to link or combine any covered work with a work licensed +under version 3 of the GNU Affero General Public License into a single +combined work, and to convey the resulting work. The terms of this +License will continue to apply to the part which is the covered work, +but the special requirements of the GNU Affero General Public License, +section 13, concerning interaction through a network will apply to the +combination as such. + + 14. Revised Versions of this License. + + The Free Software Foundation may publish revised and/or new versions of +the GNU General Public License from time to time. Such new versions will +be similar in spirit to the present version, but may differ in detail to +address new problems or concerns. + + Each version is given a distinguishing version number. If the +Program specifies that a certain numbered version of the GNU General +Public License "or any later version" applies to it, you have the +option of following the terms and conditions either of that numbered +version or of any later version published by the Free Software +Foundation. If the Program does not specify a version number of the +GNU General Public License, you may choose any version ever published +by the Free Software Foundation. + + If the Program specifies that a proxy can decide which future +versions of the GNU General Public License can be used, that proxy's +public statement of acceptance of a version permanently authorizes you +to choose that version for the Program. + + Later license versions may give you additional or different +permissions. However, no additional obligations are imposed on any +author or copyright holder as a result of your choosing to follow a +later version. + + 15. Disclaimer of Warranty. + + THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY +APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT +HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY +OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, +THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR +PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM +IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF +ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + + 16. Limitation of Liability. + + IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS +THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY +GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE +USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF +DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD +PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), +EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF +SUCH DAMAGES. + + 17. Interpretation of Sections 15 and 16. + + If the disclaimer of warranty and limitation of liability provided +above cannot be given local legal effect according to their terms, +reviewing courts shall apply local law that most closely approximates +an absolute waiver of all civil liability in connection with the +Program, unless a warranty or assumption of liability accompanies a +copy of the Program in return for a fee. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Programs + + If you develop a new program, and you want it to be of the greatest +possible use to the public, the best way to achieve this is to make it +free software which everyone can redistribute and change under these terms. + + To do so, attach the following notices to the program. It is safest +to attach them to the start of each source file to most effectively +state the exclusion of warranty; and each file should have at least +the "copyright" line and a pointer to where the full notice is found. + + + Copyright (C) + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see . + +Also add information on how to contact you by electronic and paper mail. + + If the program does terminal interaction, make it output a short +notice like this when it starts in an interactive mode: + + Copyright (C) + This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. + This is free software, and you are welcome to redistribute it + under certain conditions; type `show c' for details. + +The hypothetical commands `show w' and `show c' should show the appropriate +parts of the General Public License. Of course, your program's commands +might be different; for a GUI interface, you would use an "about box". + + You should also get your employer (if you work as a programmer) or school, +if any, to sign a "copyright disclaimer" for the program, if necessary. +For more information on this, and how to apply and follow the GNU GPL, see +. + + The GNU General Public License does not permit incorporating your program +into proprietary programs. If your program is a subroutine library, you +may consider it more useful to permit linking proprietary applications with +the library. If this is what you want to do, use the GNU Lesser General +Public License instead of this License. But first, please read +. diff --git a/license.txt b/license-mpl.txt old mode 100755 new mode 100644 similarity index 100% rename from license.txt rename to license-mpl.txt diff --git a/pixastic.core.js b/pixastic.core.js deleted file mode 100755 index f616e07..0000000 --- a/pixastic.core.js +++ /dev/null @@ -1,435 +0,0 @@ -/* - * Pixastic Lib - Core Functions - v0.1.3 - * Copyright (c) 2008 Jacob Seidelin, jseidelin@nihilogic.dk, http://blog.nihilogic.dk/ - * License: [http://www.pixastic.com/lib/license.txt] - */ - -var Pixastic = (function() { - - - function addEvent(el, event, handler) { - if (el.addEventListener) - el.addEventListener(event, handler, false); - else if (el.attachEvent) - el.attachEvent("on" + event, handler); - } - - function onready(handler) { - var handlerDone = false; - var execHandler = function() { - if (!handlerDone) { - handlerDone = true; - handler(); - } - } - document.write("<"+"script defer src=\"//:\" id=\"__onload_ie_pixastic__\">"); - var script = document.getElementById("__onload_ie_pixastic__"); - script.onreadystatechange = function() { - if (script.readyState == "complete") { - script.parentNode.removeChild(script); - execHandler(); - } - } - if (document.addEventListener) - document.addEventListener("DOMContentLoaded", execHandler, false); - addEvent(window, "load", execHandler); - } - - function init() { - var imgEls = getElementsByClass("pixastic", null, "img"); - var canvasEls = getElementsByClass("pixastic", null, "canvas"); - var elements = imgEls.concat(canvasEls); - for (var i=0;i -1) { - var tmp = actionName; - actionName = tmp.substr(0, tmp.indexOf("(")); - var arg = tmp.match(/\((.*?)\)/); - if (arg[1]) { - arg = arg[1].split(";"); - for (var a=0;a= width-1) pyn = pyc; + + for (x=0;x= width-1) pxn = pxc; + + p00 = pyp + pxp; p01 = pyp + pxc; p02 = pyp + pxn; + p10 = pyc + pxp; p11 = pyc + pxc; p12 = pyc + pxn; + p20 = pyn + pxp; p21 = pyn + pxc; p22 = pyn + pxn; + + r = inData[p00] * k00 + inData[p01] * k01 + inData[p02] * k02 + + inData[p10] * k10 + inData[p11] * k11 + inData[p12] * k12 + + inData[p20] * k20 + inData[p21] * k21 + inData[p22] * k22; + + g = inData[p00 + 1] * k00 + inData[p01 + 1] * k01 + inData[p02 + 1] * k02 + + inData[p10 + 1] * k10 + inData[p11 + 1] * k11 + inData[p12 + 1] * k12 + + inData[p20 + 1] * k20 + inData[p21 + 1] * k21 + inData[p22 + 1] * k22; + + b = inData[p00 + 2] * k00 + inData[p01 + 2] * k01 + inData[p02 + 2] * k02 + + inData[p10 + 2] * k10 + inData[p11 + 2] * k11 + inData[p12 + 2] * k12 + + inData[p20 + 2] * k20 + inData[p21 + 2] * k21 + inData[p22 + 2] * k22; + + if (alpha) { + a = inData[p00 + 3] * k00 + inData[p01 + 3] * k01 + inData[p02 + 3] * k02 + + inData[p10 + 3] * k10 + inData[p11 + 3] * k11 + inData[p12 + 3] * k12 + + inData[p20 + 3] * k20 + inData[p21 + 3] * k21 + inData[p22 + 3] * k22; + } else { + a = inData[idx+3]; + } + + if (mono) { + r = g = b = (r + g + b) / 3; + } + if (invert) { + r = 255 - r; + g = 255 - g; + b = 255 - b; + } + + outData[idx] = r; + outData[idx+1] = g; + outData[idx+2] = b; + outData[idx+3] = a; + + if (progress) { + prog = (idx/n*100 >> 0) / 100; + if (prog > lastProg) { + lastProg = progress(prog); + } + } + } + } + } + + function convolve5x5(inData, outData, width, height, kernel, progress, alpha, invert, mono) { + var idx, r, g, b, a, + pyc, pyp, pyn, pypp, pynn, + pxc, pxp, pxn, pxpp, pxnn, + x, y, + + prog, lastProg = 0, + n = width * height * 4, + + k00 = kernel[0][0], k01 = kernel[0][1], k02 = kernel[0][2], k03 = kernel[0][3], k04 = kernel[0][4], + k10 = kernel[1][0], k11 = kernel[1][1], k12 = kernel[1][2], k13 = kernel[1][3], k14 = kernel[1][4], + k20 = kernel[2][0], k21 = kernel[2][1], k22 = kernel[2][2], k23 = kernel[2][3], k24 = kernel[2][4], + k30 = kernel[3][0], k31 = kernel[3][1], k32 = kernel[3][2], k33 = kernel[3][3], k34 = kernel[3][4], + k40 = kernel[4][0], k41 = kernel[4][1], k42 = kernel[4][2], k43 = kernel[4][3], k44 = kernel[4][4], + + p00, p01, p02, p03, p04, + p10, p11, p12, p13, p14, + p20, p21, p22, p23, p24, + p30, p31, p32, p33, p34, + p40, p41, p42, p43, p44; + + for (y=0;y= width-1) pyn = pyc; + if (y < 2) pypp = pyp; + if (y >= width-2) pynn = pyn; + + for (x=0;x= width-1) pxn = pxc; + if (x < 2) pxpp = pxp; + if (x >= width-2) pxnn = pxn; + + p00 = pypp + pxpp; p01 = pypp + pxp; p02 = pypp + pxc; p03 = pypp + pxn; p04 = pypp + pxnn; + p10 = pyp + pxpp; p11 = pyp + pxp; p12 = pyp + pxc; p13 = pyp + pxn; p14 = pyp + pxnn; + p20 = pyc + pxpp; p21 = pyc + pxp; p22 = pyc + pxc; p23 = pyc + pxn; p24 = pyc + pxnn; + p30 = pyn + pxpp; p31 = pyn + pxp; p32 = pyn + pxc; p33 = pyn + pxn; p34 = pyn + pxnn; + p40 = pynn + pxpp; p41 = pynn + pxp; p42 = pynn + pxc; p43 = pynn + pxn; p44 = pynn + pxnn; + + r = inData[p00] * k00 + inData[p01] * k01 + inData[p02] * k02 + inData[p03] * k04 + inData[p02] * k04 + + inData[p10] * k10 + inData[p11] * k11 + inData[p12] * k12 + inData[p13] * k14 + inData[p12] * k14 + + inData[p20] * k20 + inData[p21] * k21 + inData[p22] * k22 + inData[p23] * k24 + inData[p22] * k24 + + inData[p30] * k30 + inData[p31] * k31 + inData[p32] * k32 + inData[p33] * k34 + inData[p32] * k34 + + inData[p40] * k40 + inData[p41] * k41 + inData[p42] * k42 + inData[p43] * k44 + inData[p42] * k44; + + g = inData[p00+1] * k00 + inData[p01+1] * k01 + inData[p02+1] * k02 + inData[p03+1] * k04 + inData[p02+1] * k04 + + inData[p10+1] * k10 + inData[p11+1] * k11 + inData[p12+1] * k12 + inData[p13+1] * k14 + inData[p12+1] * k14 + + inData[p20+1] * k20 + inData[p21+1] * k21 + inData[p22+1] * k22 + inData[p23+1] * k24 + inData[p22+1] * k24 + + inData[p30+1] * k30 + inData[p31+1] * k31 + inData[p32+1] * k32 + inData[p33+1] * k34 + inData[p32+1] * k34 + + inData[p40+1] * k40 + inData[p41+1] * k41 + inData[p42+1] * k42 + inData[p43+1] * k44 + inData[p42+1] * k44; + + b = inData[p00+2] * k00 + inData[p01+2] * k01 + inData[p02+2] * k02 + inData[p03+2] * k04 + inData[p02+2] * k04 + + inData[p10+2] * k10 + inData[p11+2] * k11 + inData[p12+2] * k12 + inData[p13+2] * k14 + inData[p12+2] * k14 + + inData[p20+2] * k20 + inData[p21+2] * k21 + inData[p22+2] * k22 + inData[p23+2] * k24 + inData[p22+2] * k24 + + inData[p30+2] * k30 + inData[p31+2] * k31 + inData[p32+2] * k32 + inData[p33+2] * k34 + inData[p32+2] * k34 + + inData[p40+2] * k40 + inData[p41+2] * k41 + inData[p42+2] * k42 + inData[p43+2] * k44 + inData[p42+2] * k44; + + if (alpha) { + a = inData[p00+3] * k00 + inData[p01+3] * k01 + inData[p02+3] * k02 + inData[p03+3] * k04 + inData[p02+3] * k04 + + inData[p10+3] * k10 + inData[p11+3] * k11 + inData[p12+3] * k12 + inData[p13+3] * k14 + inData[p12+3] * k14 + + inData[p20+3] * k20 + inData[p21+3] * k21 + inData[p22+3] * k22 + inData[p23+3] * k24 + inData[p22+3] * k24 + + inData[p30+3] * k30 + inData[p31+3] * k31 + inData[p32+3] * k32 + inData[p33+3] * k34 + inData[p32+3] * k34 + + inData[p40+3] * k40 + inData[p41+3] * k41 + inData[p42+3] * k42 + inData[p43+3] * k44 + inData[p42+3] * k44; + } else { + a = inData[idx+3]; + } + + if (mono) { + r = g = b = (r + g + b) / 3; + } + + if (invert) { + r = 255 - r; + g = 255 - g; + b = 255 - b; + } + + outData[idx] = r; + outData[idx+1] = g; + outData[idx+2] = b; + outData[idx+3] = a; + + if (progress) { + prog = (idx/n*100 >> 0) / 100; + if (prog > lastProg) { + lastProg = progress(prog); + } + } + } + } + } + + function gaussian(inData, outData, width, height, kernelSize, progress) { + var r, g, b, a, idx, + n = width * height * 4, + x, y, i, j, + inx, iny, w, + tmpData = [], + maxKernelSize = 13, + kernelSize = clamp(kernelSize, 3, maxKernelSize), + k1 = -kernelSize / 2 + (kernelSize % 2 ? 0.5 : 0), + k2 = kernelSize + k1, + weights, + kernels = [[1]], + prog, lastProg = 0; + + + for (i=1;i= width) { + inx = width - 1; + } + + idx = (iny * width + inx) * 4; + + r += inData[idx] * w; + g += inData[idx + 1] * w; + b += inData[idx + 2] * w; + a += inData[idx + 3] * w; + + } + + idx = (y * width + x) * 4; + + tmpData[idx] = r; + tmpData[idx+1] = g; + tmpData[idx+2] = b; + tmpData[idx+3] = a; + + if (progress) { + prog = (idx/n*50 >> 0) / 100; + if (prog > lastProg) { + lastProg = progress(prog); + } + } + } + } + + lastProg = 0; + + // pass 2 + for (y=0;y= height) { + iny = height - 1; + } + + idx = (iny * width + inx) * 4; + + r += tmpData[idx] * w; + g += tmpData[idx + 1] * w; + b += tmpData[idx + 2] * w; + a += tmpData[idx + 3] * w; + } + + idx = (y * width + x) * 4; + + outData[idx] = r; + outData[idx+1] = g; + outData[idx+2] = b; + outData[idx+3] = a; + + if (progress) { + prog = 0.5 + (idx/n*50 >> 0) / 100; + if (prog > lastProg) { + lastProg = progress(prog); + } + } + } + } + } + + + return { + + invert : function(inData, outData, width, height, options, progress) { + var n = width * height * 4, + prog, lastProg = 0; + + for (i=0;i> 0) / 100; + if (prog > lastProg) { + lastProg = progress(prog); + } + } + } + }, + + sepia : function(inData, outData, width, height, options, progress) { + var n = width * height * 4, + prog, lastProg = 0, + r, g, b; + + for (var i=0;i> 0) / 100; + if (prog > lastProg) { + lastProg = progress(prog); + } + } + } + }, + + solarize : function(inData, outData, width, height, options, progress) { + var n = width * height * 4, + prog, lastProg = 0, + r, g, b; + + for (i=0;i 127 ? 255 - r : r; + outData[i+1] = g > 127 ? 255 - g : g; + outData[i+2] = b > 127 ? 255 - b : b; + outData[i+3] = inData[i+3]; + + if (progress) { + prog = (i/n*100 >> 0) / 100; + if (prog > lastProg) { + lastProg = progress(prog); + } + } + } + }, + + brightness : function(inData, outData, width, height, options, progress) { + options = defaultOptions(options, { + brightness : 0, + contrast : 0 + }); + + var contrast = clamp(options.contrast, -1, 1) / 2, + brightness = 1 + clamp(options.brightness, -1, 1), + prog, lastProg = 0, + r, g, b, + n = width * height * 4; + + var brightMul = brightness < 0 ? - brightness : brightness; + var brightAdd = brightness < 0 ? 0 : brightness; + + contrast = 0.5 * Math.tan((contrast + 1) * Math.PI/4); + contrastAdd = - (contrast - 0.5) * 255; + + for (var i=0;i> 0) / 100; + if (prog > lastProg) { + lastProg = progress(prog); + } + } + } + }, + + desaturate : function(inData, outData, width, height, options, progress) { + var n = width * height * 4, + prog, lastProg = 0, + level; + + for (var i=0;i> 0) / 100; + if (prog > lastProg) { + lastProg = progress(prog); + } + } + } + }, + + lighten : function(inData, outData, width, height, options, progress) { + var n = width * height * 4, + prog, lastProg = 0, + mul = 1 + clamp(options.amount, 0, 1); + + for (var i=0;i> 0) / 100; + if (prog > lastProg) { + lastProg = progress(prog); + } + } + } + }, + + noise : function(inData, outData, width, height, options, progress) { + var n = width * height * 4, + prog, lastProg = 0, + amount = clamp(options.amount, 0, 1), + strength = clamp(options.strength, 0, 1), + mono = !!options.mono, + random = Math.random, + rnd, r, g, b; + + for (var i=0;i> 0) / 100; + if (prog > lastProg) { + lastProg = progress(prog); + } + } + } + }, + + flipv : function(inData, outData, width, height, options, progress) { + var inPix, outPix, + n = width * height * 4, + prog, lastProg = 0, + x, y; + for (y=0;y> 0) / 100; + if (prog > lastProg) { + lastProg = progress(prog); + } + } + } + } + }, + + fliph : function(inData, outData, width, height, options, progress) { + var inPix, outPix, + n = width * height * 4, + prog, lastProg = 0, + x, y; + for (y=0;y> 0) / 100; + if (prog > lastProg) { + lastProg = progress(prog); + } + } + } + } + }, + + blur : function(inData, outData, width, height, options, progress) { + gaussian(inData, outData, width, height, options.kernelSize, progress); + }, + + glow : function(inData, outData, width, height, options, progress) { + var n = width * height * 4, + i, r, g, b, + amount = options.amount, + tmpData = [], + gaussProgress, + prog, lastProg = 0; + + if (progress) { + gaussProgress = function(p) { + progress(p * 0.8); + return p; + } + } + + gaussian(inData, tmpData, width, height, options.kernelSize, gaussProgress); + + for (i=0;i 255) r = 255; + if (g > 255) g = 255; + if (b > 255) b = 255; + outData[i] = r; + outData[i+1] = g; + outData[i+2] = b; + outData[i+3] = inData[i+3]; + + if (progress) { + prog = 0.8 + (i/n*100 >> 0) / 100 * 0.2; + if (prog > lastProg) { + lastProg = progress(prog); + } + } + } + }, + + convolve3x3 : function(inData, outData, width, height, options, progress) { + convolve3x3(inData, outData, width, height, options.kernel, progress); + }, + + convolve5x5 : function(inData, outData, width, height, options, progress) { + convolve5x5(inData, outData, width, height, options.kernel, progress); + }, + + // A 3x3 high-pass filter + sharpen3x3 : function(inData, outData, width, height, options, progress) { + var a = - clamp(options.strength, 0, 1); + convolve3x3( + inData, outData, width, height, + [[a, a, a], + [a, 1-a*8, a], + [a, a, a]], + progress + ); + }, + + // A 5x5 high-pass filter + sharpen5x5 : function(inData, outData, width, height, options, progress) { + var a = - clamp(options.strength, 0, 1); + convolve5x5( + inData, outData, width, height, + [[a, a, a, a, a], + [a, a, a, a, a], + [a, a, 1-a*24, a, a], + [a, a, a, a, a], + [a, a, a, a, a]], + progress + ); + }, + + // A 3x3 low-pass mean filter + soften3x3 : function(inData, outData, width, height, options, progress) { + var c = 1/9; + convolve3x3( + inData, outData, width, height, + [[c, c, c], + [c, c, c], + [c, c, c]], + progress + ); + }, + + // A 5x5 low-pass mean filter + soften5x5 : function(inData, outData, width, height, options, progress) { + var c = 1/25; + convolve5x5( + inData, outData, width, height, + [[c, c, c, c, c], + [c, c, c, c, c], + [c, c, c, c, c], + [c, c, c, c, c], + [c, c, c, c, c]], + progress + ); + }, + + // A 3x3 Cross edge-detect + crossedges : function(inData, outData, width, height, options, progress) { + var a = clamp(options.strength, 0, 1) * 5 + convolve3x3( + inData, outData, width, height, + [[ 0, -a, 0], + [-a, 0, a], + [ 0, a, 0]], + progress, + false, true + ); + }, + + // 3x3 directional emboss + emboss : function(inData, outData, width, height, options, progress) { + var amount = options.amount, + angle = options.angle, + x = Math.cos(-angle) * amount, + y = Math.sin(-angle) * amount, + n = width * height * 4, + + a00 = -x - y, + a10 = -x, + a20 = y - x, + a01 = -y, + a21 = y, + a02 = -y + x, + a12 = x, + a22 = y + x, + + tmpData = [], + + prog, lastProg = 0, + convProgress; + + if (progress) { + convProgress = function(p) { + progress(p * 0.5) + return p; + }; + } + + convolve3x3( + inData, tmpData, width, height, + [[a00, a01, a02], + [a10, 0, a12], + [a20, a21, a22]] + ); + + for (var i=0;i> 0) / 100 * 0.5; + if (prog > lastProg) { + lastProg = progress(prog); + } + } + } + }, + + + // A 3x3 Sobel edge detect (similar to Photoshop's) + findedges : function(inData, outData, width, height, options, progress) { + var n = width * height * 4, + i, + data1 = [], + data2 = [], + gr1, gr2, gg1, gg2, gb1, gb2, + prog, lastProg = 0, + convProgress1, convProgress2; + + if (progress) { + convProgress1 = function(p) { + progress(p * 0.4); + return p; + }; + convProgress2 = function(p) { + progress(0.4 + p * 0.4); + return p; + }; + } + + convolve3x3(inData, data1, width, height, + [[-1, 0, 1], + [-2, 0, 2], + [-1, 0, 1]] + ); + convolve3x3(inData, data2, width, height, + [[-1, -2, -1], + [ 0, 0, 0], + [ 1, 2, 1]] + ); + + for (i=0;i> 0) / 100 * 0.2; + if (prog > lastProg) { + lastProg = progress(prog); + } + } + } + }, + + // A 3x3 edge enhance + edgeenhance3x3 : function(inData, outData, width, height, options, progress) { + convolve3x3( + inData, outData, width, height, + [[-1/9, -1/9, -1/9], + [-1/9, 17/9, -1/9], + [-1/9, -1/9, -1/9]], + progress + ); + }, + + // A 5x5 edge enhance + edgeenhance5x5 : function(inData, outData, width, height, options, progress) { + convolve5x5( + inData, outData, width, height, + [[-1/25, -1/25, -1/25, -1/25, -1/25], + [-1/25, -1/25, -1/25, -1/25, -1/25], + [-1/25, -1/25, 49/25, -1/25, -1/25], + [-1/25, -1/25, -1/25, -1/25, -1/25], + [-1/25, -1/25, -1/25, -1/25, -1/25]], + progress + ); + }, + + // A 3x3 Laplacian edge-detect + laplace3x3 : function(inData, outData, width, height, options, progress) { + convolve3x3( + inData, outData, width, height, + [[-1, -1, -1], + [-1, 8, -1], + [-1, -1, -1]], + progress, + false, true, true + ); + }, + + // A 5x5 Laplacian edge-detect + laplace5x5 : function(inData, outData, width, height, options, progress) { + convolve5x5( + inData, outData, width, height, + [[-1, -1, -1, -1, -1], + [-1, -1, -1, -1, -1], + [-1, -1, 24, -1, -1], + [-1, -1, -1, -1, -1], + [-1, -1, -1, -1, -1]], + progress, + false, true, true + ); + }, + + coloradjust : function(inData, outData, width, height, options, progress) { + var n = width * height * 4, + r, g, b, + prog, lastProg = 0, + ar = clamp(options.r, -1, 1) * 255, + ag = clamp(options.g, -1, 1) * 255, + ab = clamp(options.b, -1, 1) * 255; + + for (var i=0;i 255) r = 255; + if (g > 255) g = 255; + if (b > 255) b = 255; + outData[i] = r; + outData[i+1] = g; + outData[i+2] = b; + outData[i+3] = inData[i+3]; + + if (progress) { + prog = (i/n*100 >> 0) / 100; + if (prog > lastProg) { + lastProg = progress(prog); + } + } + } + }, + + colorfilter : function(inData, outData, width, height, options, progress) { + var n = width * height * 4, + i, r, g, b, + luminosity = !!options.luminosity, + prog, lastProg = 0, + min, max, h, l, h1, chroma, tmp, m, + ar = clamp(options.r, 0, 1), + ag = clamp(options.g, 0, 1), + ab = clamp(options.b, 0, 1); + + for (i=0;i max) max = g; + if (b > max) max = b; + if (g < min) min = g; + if (b < min) min = b; + chroma = (max - min); + + if (r == max) { + h = ((g - b) / chroma) % 6; + } else if (g == max) { + h = ((b - r) / chroma) + 2; + } else { + h = ((r - g) / chroma) + 4; + } + + h1 = h >> 0; + tmp = chroma * (h - h1); + r = g = b = l - (r * 0.3 + g * 0.59 + b * 0.11); + + if (h1 == 0) { + r += chroma; + g += tmp; + } else if (h1 == 1) { + r += chroma - tmp; + g += chroma; + } else if (h1 == 2) { + g += chroma; + b += tmp; + } else if (h1 == 3) { + g += chroma - tmp; + b += chroma; + } else if (h1 == 4) { + r += tmp; + b += chroma; + } else if (h1 == 5) { + r += chroma; + b += chroma - tmp; + } + } + + outData[i] = r * 255; + outData[i+1] = g * 255; + outData[i+2] = b * 255; + outData[i+3] = inData[i+3]; + + if (progress) { + prog = (i/n*100 >> 0) / 100; + if (prog > lastProg) { + lastProg = progress(prog); + } + } + } + }, + + hsl : function(inData, outData, width, height, options, progress) { + var n = width * height * 4, + hue = clamp(options.hue, -1, 1), + saturation = clamp(options.saturation, -1, 1), + lightness = clamp(options.lightness, -1, 1), + satMul = 1 + saturation * (saturation < 0 ? 1 : 2), + lightMul = lightness < 0 ? 1 + lightness : 1 - lightness, + lightAdd = lightness < 0 ? 0 : lightness * 255, + vs, ms, vm, h, s, l, v, m, vmh, sextant, + prog, lastProg = 0; + + hue = (hue * 6) % 6; + + for (var i=0;i vs) vs = g; + if (b > vs) vs = b; + ms = r; + if (g < ms) ms = g; + if (b < ms) ms = b; + vm = (vs-ms); + l = (ms+vs)/510; + + if (l > 0 && vm > 0) { + if (l <= 0.5) { + s = vm / (vs+ms) * satMul; + if (s > 1) s = 1; + v = (l * (1+s)); + } else { + s = vm / (510-vs-ms) * satMul; + if (s > 1) s = 1; + v = (l+s - l*s); + } + if (r == vs) { + if (g == ms) { + h = 5 + ((vs-b)/vm) + hue; + } else { + h = 1 - ((vs-g)/vm) + hue; + } + } else if (g == vs) { + if (b == ms) { + h = 1 + ((vs-r)/vm) + hue; + } else { + h = 3 - ((vs-b)/vm) + hue; + } + } else { + if (r == ms) { + h = 3 + ((vs-g)/vm) + hue; + } else { + h = 5 - ((vs-r)/vm) + hue; + } + } + if (h < 0) h += 6; + if (h >= 6) h -= 6; + m = (l + l - v); + sextant = h >> 0; + vmh = (v - m) * (h - sextant); + if (sextant == 0) { + r = v; + g = m + vmh; + b = m; + } else if (sextant == 1) { + r = v - vmh; + g = v; + b = m; + } else if (sextant == 2) { + r = m; + g = v; + b = m + vmh; + } else if (sextant == 3) { + r = m; + g = v - vmh; + b = v; + } else if (sextant == 4) { + r = m + vmh; + g = m; + b = v; + } else if (sextant == 5) { + r = v; + g = m; + b = v - vmh; + } + + r *= 255; + g *= 255; + b *= 255; + } + } + + r = r * lightMul + lightAdd; + g = g * lightMul + lightAdd; + b = b * lightMul + lightAdd; + + if (r < 0) r = 0; + if (g < 0) g = 0; + if (b < 0) b = 0; + if (r > 255) r = 255; + if (g > 255) g = 255; + if (b > 255) b = 255; + + outData[i] = r; + outData[i+1] = g; + outData[i+2] = b; + outData[i+3] = inData[i+3]; + + if (progress) { + prog = (i/n*100 >> 0) / 100; + if (prog > lastProg) { + lastProg = progress(prog); + } + } + } + }, + + posterize : function(inData, outData, width, height, options, progress) { + var numLevels = clamp(options.levels, 2, 256), + numAreas = 256 / numLevels, + numValues = 256 / (numLevels-1), + r, g, b, + n = width * height * 4, + prog, lastProg = 0; + + for (i=0;i>0); + outData[i+1] = numValues * ((inData[i+1] / numAreas)>>0); + outData[i+2] = numValues * ((inData[i+2] / numAreas)>>0); + + outData[i+3] = inData[i+3]; + + if (progress) { + prog = (i/n*100 >> 0) / 100; + if (prog > lastProg) { + lastProg = progress(prog); + } + } + } + + }, + + removenoise : function(inData, outData, width, height, options, progress) { + var r, g, b, c, y, x, idx, + pyc, pyp, pyn, + pxc, pxp, pxn, + minR, minG, minB, maxR, maxG, maxB, + n, prog, lastProg = 0; + + n = width * height * 4; + + for (y=0;y= width-1) pyn = pyc; + + for (x=0;x= width-1) pxn = pxc; + + minR = maxR = inData[pyc + pxp]; + c = inData[pyc + pxn]; + if (c < minR) minR = c; + if (c > maxR) maxR = c; + c = inData[pyp + pxc]; + if (c < minR) minR = c; + if (c > maxR) maxR = c; + c = inData[pyn + pxc]; + if (c < minR) minR = c; + if (c > maxR) maxR = c; + + minG = inData[pyc + pxp + 1]; + c = inData[pyc + pxn + 1]; + if (c < minG) minG = c; + c = inData[pyp + pxc + 1]; + if (c < minG) minG = c; + c = inData[pyn + pxc + 1]; + if (c < minG) minG = c; + + minB = inData[pyc + pxp + 2]; + c = inData[pyc + pxn + 2]; + if (c < minB) minB = c; + c = inData[pyp + pxc + 2]; + if (c < minB) minB = c; + c = inData[pyn + pxc + 2]; + if (c < minB) minB = c; + + r = inData[idx] + g = inData[idx + 1] + b = inData[idx + 2] + + if (r < minR) r = minR; + if (r > maxR) r = maxR; + if (g < minG) g = minG; + if (g > maxG) g = maxG; + if (b < minB) b = minB; + if (b > maxB) b = maxB; + + outData[idx] = r; + outData[idx+1] = g; + outData[idx+2] = b; + outData[idx+3] = inData[idx+3]; + + if (progress) { + prog = (idx/n*100 >> 0) / 100; + if (prog > lastProg) { + lastProg = progress(prog); + } + } + } + } + }, + + mosaic : function(inData, outData, width, height, options, progress) { + + var blockSize = clamp(options.blockSize, 1, Math.max(width, height)), + yBlocks = Math.ceil(height / blockSize), + xBlocks = Math.ceil(width / blockSize), + y0, y1, x0, x1, idx, pidx, + n = yBlocks * xBlocks, + prog, lastProg = 0; + + for (i=0, y0=0, bidx=0;i> 0) / 100; + if (prog > lastProg) { + lastProg = progress(prog); + } + } + } + y0 = y1; + } + }, + + equalize : function(inData, outData, width, height, options, progress) { + var n = width * height, p, i, level, ratio, + prog, lastProg; + var round = Math.round; + // build histogram + var pdf = new Array(256); + for (i=0;i<256;i++) { + pdf[i] = 0; + } + + for (i=0;i> 0) / 100; + if (prog > lastProg) { + lastProg = progress(prog); + } + } + } + } + }; + +})(); diff --git a/pixastic.jquery.js b/pixastic.jquery.js deleted file mode 100755 index c71bfcf..0000000 --- a/pixastic.jquery.js +++ /dev/null @@ -1,31 +0,0 @@ -/* - * Pixastic Lib - jQuery plugin - * Copyright (c) 2008 Jacob Seidelin, jseidelin@nihilogic.dk, http://blog.nihilogic.dk/ - * License: [http://www.pixastic.com/lib/license.txt] - */ - -if (typeof jQuery != "undefined" && jQuery && jQuery.fn) { - jQuery.fn.pixastic = function(action, options) { - var newElements = []; - this.each( - function () { - if (this.tagName.toLowerCase() == "img" && !this.complete) { - return; - } - if (action === "revert") { - var res = Pixastic.revert(this); - } else { - var res = Pixastic.process(this, action, options); - } - if (res) { - newElements.push(res); - } - } - ); - if (newElements.length > 0) - return jQuery(newElements); - else - return this; - }; - -}; diff --git a/pixastic.js b/pixastic.js new file mode 100644 index 0000000..c9fb188 --- /dev/null +++ b/pixastic.js @@ -0,0 +1,286 @@ +/*! + * Pixastic - JavaScript Image Processing + * http://pixastic.com/ + * Copyright 2012, Jacob Seidelin + * + * Dual licensed under the MPL 1.1 or GPLv3 licenses. + * http://pixastic.com/license-mpl.txt + * http://pixastic.com/license-gpl-3.0.txt + * + */ + + var Pixastic = (function() { + + var worker; + + function createImageData(ctx, width, height) { + if (ctx.createImageData) { + return ctx.createImageData(width, height); + } else { + return ctx.getImageData(0, 0, width, height); + } + } + + function Pixastic(ctx, workerControlPath) { + + var P = {}, + width = ctx.canvas.width, + height = ctx.canvas.height, + queue = [], + workerControlPath = workerControlPath || ""; + + if (!worker) { + if (typeof window.Worker != "undefined") { + try { + worker = new window.Worker(workerControlPath + "pixastic.worker.control.js"); + } catch(e) { + if (location.protocol == "file:") { + Pixastic.log("Could not create native worker, running from file://") + } else { + Pixastic.log("Could not create native worker.") + } + } + } + if (!worker) { + worker = new Pixastic.Worker(); + } + } + + for (var e in Pixastic.Effects) { + if (Pixastic.Effects.hasOwnProperty(e)) { + (function(e) { + P[e] = function(options) { + queue.push({ + effect : e, + options : options + }); + return P; + } + + P.done = function(callback, progress) { + var inData, outData; + + try { + inData = ctx.getImageData(0, 0, width, height); + } catch(e) { + if (location.protocol == "file:") { + throw new Error("Could not access image data, running from file://"); + } else { + throw new Error("Could not access image data, is canvas tainted by cross-origin data?"); + } + } + + outData = createImageData(ctx, width, height); + + worker.postMessage({ + queue : queue, + inData : inData, + outData : outData, + width : width, + height : height + }); + + worker.onmessage = function(message) { + var d = message.data; + switch (d.event) { + case "done" : + ctx.putImageData(d.data, 0, 0); + if (callback) { + callback(); + } + if (progress) { + progress(1); + } + break; + case "progress" : + if (progress) { + progress(d.data); + } + break; + case "error" : + break; + } + } + + if (progress) { + progress(0); + } + } + })(e); + } + } + return P; + } + + + Pixastic.Worker = function() { + var me = this; + function processMessage(data) { + var queue = data.queue, + inData = data.inData, + outData = data.outData, + width = data.width, + height = data.height, + tmpData; + + for (var i=0;i 0) { + tmpData = inData; + inData = outData; + outData = tmpData; + } + + if (typeof importScripts == "function") { + progressCallback = function(p) { + me.onmessage({ + data : { + event : "progress", + data : (i + p) / queue.length + } + }); + return p; + } + } + + Pixastic.Effects[e](inData.data, outData.data, width, height, options, progressCallback); + + me.onmessage({ + data : { + event : "progress", + data : (i+1) / queue.length + } + }); + } + + me.onmessage({ + data : { + event : "done", + data : outData + } + }); + } + + this.postMessage = function(data) { + setTimeout(function() { + processMessage(data) + }, 0); + }; + + this.onmessage = function() {}; + + } + + + + Pixastic.log = function(str) { + if (typeof console != "undefined" && console.log) { + console.log("Pixastic: " + str); + } + }; + + function toCanvas(o) { + var canvas; + if (typeof o == "object") { + if (typeof o.tagName == "string") { + if (o.tagName.toLowerCase() == "canvas" || o.tagName.toLowerCase() == "img") { + canvas = document.createElement("canvas"); + canvas.width = o.width; + canvas.height = o.height; + canvas.getContext("2d").drawImage(o, 0,0); + } + } else if ((window.ImageData && o instanceof window.ImageData) + || (typeof o.width == "number" && typeof o.height == "number" && typeof o.data == "object")) { + canvas = document.createElement("canvas"); + canvas.width = o.width; + canvas.height = o.height; + canvas.getContext("2d").putImageData(o, 0, 0); + } + } + return canvas; + }; + + function toImage(o) { + var canvas = toCanvas(o), + image = new Image(); + image.width = canvas.width; + image.height = canvas.height; + image.src = canvas.toDataURL(); + return image; + }; + + function toImageData(o) { + var canvas = toCanvas(o), + ctx = canvas.getContext("2d"); + return ctx.getImageData(0, 0, canvas.width, canvas.height); + }; + + function histogram(imageData) { + var values = [], + i, p, + data = imageData.data, + round = Math.round, + maxValue, + n = imageData.width * imageData.height; + + for (i=0;i<256;i++) { + values[i] = 0; + } + + for (i=0;i maxValue) { + maxValue = values[i]; + } + } + + return { + maxValue : maxValue, + values : values + }; + } + + Pixastic.toCanvas = toCanvas; + Pixastic.toImage = toImage; + Pixastic.toImageData = toImageData; + Pixastic.histogram = histogram; + + Pixastic.Color = { + rgb2hsl : function(r, g, b) { + if (r < 0) r = 0; + if (g < 0) g = 0; + if (b < 0) b = 0; + if (r > 255) r = 0; + if (g > 255) g = 0; + if (b > 255) b = 0; + }, + + rgb2hsv : function(r, g, b) { + }, + + rgb2hex : function(r, g, b) { + }, + + hsl2rgb : function(h, s, l) { + }, + + hsv2rgb : function(h, s, v) { + } + + } + + return Pixastic; + +})(); + + + + diff --git a/pixastic.worker.control.js b/pixastic.worker.control.js new file mode 100644 index 0000000..76a383a --- /dev/null +++ b/pixastic.worker.control.js @@ -0,0 +1,13 @@ +importScripts("pixastic.js"); +importScripts("pixastic.effects.js"); + +var worker = new Pixastic.Worker(); + +worker.onmessage = function(message) { + postMessage(message.data); +} + +onmessage = function(message) { + worker.postMessage(message.data); +} + diff --git a/pixastic.worker.js b/pixastic.worker.js new file mode 100644 index 0000000..733d79a --- /dev/null +++ b/pixastic.worker.js @@ -0,0 +1,47 @@ +Pixastic.Worker = function() { + var me = this; + function processMessage(data) { + var queue = data.queue, + inData = data.inData, + outData = data.outData, + width = data.width, + height = data.height, + tmpData; + + for (var i=0;i 0) { + tmpData = inData; + inData = outData; + outData = tmpData; + } + + Pixastic.Effects[e](inData.data, outData.data, width, height, options); + + me.onmessage({ + data : { + event : "progress", + data : (i+1) / queue.length + } + }); + } + + me.onmessage({ + data : { + event : "done", + data : outData + } + }); + } + + this.postMessage = function(data) { + setTimeout(function() { + processMessage(data) + }, 0); + } + + this.onmessage = function() {}; + +} diff --git a/sample-images/earth.png b/sample-images/earth.png new file mode 100644 index 0000000..46b0398 Binary files /dev/null and b/sample-images/earth.png differ diff --git a/sample-images/monalisa.jpg b/sample-images/monalisa.jpg new file mode 100644 index 0000000..8656d86 Binary files /dev/null and b/sample-images/monalisa.jpg differ diff --git a/styles.css b/styles.css new file mode 100644 index 0000000..b90abaf --- /dev/null +++ b/styles.css @@ -0,0 +1,45 @@ +#original-image, +#output-canvas { + display : block; + float : left; + margin : 10px; +} + +ul#testlist { + display : block; + float : left; + width : 300px; + list-style : none; + padding : 0; + margin : 10px; + max-height : 512px; + overflow : auto; +} + +ul#testlist li { + margin-bottom : 5px; + background-color : rgb(200,220,255); + padding : 4px; + font-family : sans-serif; + font-size : 14px; + cursor : pointer; +} + +ul#testlist li:hover { + background-color : rgb(200,240,255); +} + +div#progress { + float : left; + width : 20px; + height : 512px; + margin-top : 10px; + box-sizing : border-box; + border : 1px solid black; +} + +div#progress div { + width : 100%; + height : 0; + background-color : rgb(190,220,190); +}