Merge lp:~dpm/qreator/touch-scanner into lp:qreator/touch

[David Planella]

This branch implements the initial scanning support for Qreator

# Choice of decoding backend

I've tried hard to use the JavaScript backend, but due to either the camera, JavaScript limitations, or my own limitations in JavaScript knowledge, I've not managed to get it working in a way that it offers acceptable performance on a device.

In any case, I've abstracted the decoding backend in a Decoder component, and I'll leave the JavaScript backend in the source tree for a few revisions for testing purposes and in case we need to review the decision. Switching backends is as easy as setting the useJsbackend boolean property of the Decoder component.

The main issue is that for the decoding to be fast (as in less than 30 seconds) on a device, the picture taken needs to be downscaled to about 640px width. The C++ backend does that without trouble, but I've not found a way to do it with JavaScript. Downscaling the resolution at the camera level before passing the image to the decoding backend was something else I tried, but first the camera needs to be queried for supported resolutions (otherwise if I just set its resolution to 640x480 it might or might not work), and there seems to be no way to do that in QML.

Therefore, given the fact that it's working already, I've chosen to use the C++ plugin. This means that for either developing or running Qreator the qtdeclarative5-qzxing-plugin package [1] will need to be installed.

I want to consider the decoding backend as a library (i.e. a black box with interfaces) and it not be the focus of development. It just needs a bit of polish right now, but I hope to have it done in a couple of days.

# Caveats

• Decoding is not yet automated (e.g. with a timer), in the sense that the user has to take the picture himself/herself by revealing the toolbar on the scan page and press the "Decode" action. A further iteration of the scanner will implement automatic decoding.
• The camera is always active when Qreator is running. In a further iteration we'll need to deactivate it when a) the app loses focus and b) when we switch away from the Scanner tab to another one
• The "Open" action on the dialog shown upon successful decoding does nothing yet
• There is an issue whereby the root page of the PageStack in the Create tab allows a toolbar to be revealed, when in fact there should not be any toolbar there. It seems to happen only the first time the root page is shown. Perhaps an SDK bug?

# Camera caveats

For all its awesomeness and plug-and-play feel, the QML camera component has also been a source of headaches:

• When using camera.imageCapture.captureToLocation(captureLocation); pictures don't get overwritten on the device as expected. This works on the desktop, but inexplicably, it crashes the camera on a device whenever you take a second picture that should overwrite the picture at captureLocation
• There is no way to tell the camera not to store the pictures on the filesystem, and e.g. simply pass the in-memory preview to the decoder. It's nice to be able to store the pictures taken, but we cannot do it when scanning for codes automatically, as we'd be filling the filesystem with pictures taken every half a second or so. An option might be
just to delete the files from the filesystem via the C++ plugin.
• Cannot query device resolutions from the camera, thus there is no guarantee a given resolution will be set. I.e. we cannot use a low resolution to scan images, they need to be downscaled afterwards

[1] https://launchpad.net/~qreator-hackers/+archive/qreator-experimental

[Schwarzburg (stefan-schwarzburg)]

Hi David,

First of all: Really great work!

I played with it on the desktop and it worked quite well (except for the camera..., now I have also pictures that are half bright, half dark :-) but thats another topic...).

I'm not surprised about the increase of performance with C++, and I think we should keep that in mind as advice for others and ourselves in the future: QML/JS for the interface, C++ for intensive tasks. On mobile devices, snappy applications are important!

I do have a few minor questions:

- you wrote "qt5declarative-qzxing-plugin", but you meant "qtdeclarative5-qzxing-plugin", right?

- Did you remove the history tab since it is still empty, or did you change your mind about including it as a tab, or do you want it removed in general?

- I guess that the debug tab is just there temporary? Do you want to remove it for every release but keep it there in-between releases?

As I said, great work!

review: Approve

[David Planella (dpm)]

On Sun, Jun 16, 2013 at 4:18 PM, Schwarzburg <
<email address hidden>> wrote:

> Review: Approve
>
> Hi David,
>
> First of all: Really great work!
>
> I played with it on the desktop and it worked quite well

Cool, thanks!

> (except for the camera..., now I have also pictures that are half bright,
> half dark :-) but thats another topic...).
>
>
Yeah, the Camera QML module (and perhaps also the desktop GStreamer
backend) is proving to be a bit of a pain :/

> I'm not surprised about the increase of performance with C++, and I think
> we should keep that in mind as advice for others and ourselves in the
> future: QML/JS for the interface, C++ for intensive tasks. On mobile
> devices, snappy applications are important!
>
>
Indeed. Still, I haven't quite given up on it, as JS does offer advantages
for development (if performance would be on par), as it avoids the need to
do cross-compilation (or at least compile for ARM on the device itself):
I've tried to downscale the image before sending it to the JS decoder, but
so far I've been unsuccessful:

https://code.launchpad.net/~dpm/qreator/touch-decoder-improvements

In any case, I've now created a project for the C++ plugin and I'm going to
get the daily package builds from there:

https://launchpad.net/qzxing

>
> I do have a few minor questions:
>
> - you wrote "qt5declarative-qzxing-plugin", but you meant
> "qtdeclarative5-qzxing-plugin", right?
>
>
You're right, fixed it on the description.

> - Did you remove the history tab since it is still empty, or did you
> change your mind about including it as a tab, or do you want it removed in
> general?
>
>
I still want history as a tab. If I removed any content there was in it, it
was unintentional, but I didn't recall it containing anything yet.

> - I guess that the debug tab is just there temporary? Do you want to
> remove it for every release but keep it there in-between releases?
>
>
Yeah, the debug tab is temporary. You might have seen the comment where I
tried to make it "hideable" via a property, but it turns out it is not
possible at the moment (
https://bugs.launchpad.net/ubuntu-ui-toolkit/+bug/1190972).

Yes, until Qt Creator gains support for debugging code on devices it might
be worth keeping for in between releases, and comment it out for releases.

>
> As I said, great work!
>

Thanks for the review!

> --
> https://code.launchpad.net/~dpm/qreator/touch-scanner/+merge/169683
> You are the owner of lp:~dpm/qreator/touch-scanner.
>

=== modified file '.bzrignore'
--- .bzrignore	2013-02-16 14:27:12 +0000
+++ .bzrignore	2013-06-16 10:03:26 +0000
@@ -1,1 +1,3 @@
 qreator.qmlproject.user
+qreator-touch.qmlproject.user
+jsqrcode
 
=== removed file 'img/about.png'
 Binary files img/about.png	2013-02-09 16:41:45 +0000 and img/about.png	1970-01-01 00:00:00 +0000 differ
=== added file 'img/[e-mail]'
 Binary files img/[e-mail]	1970-01-01 00:00:00 +0000 and img/[e-mail]	2013-06-16 10:03:26 +0000 differ
=== added file 'img/[e-mail]'
 Binary files img/[e-mail]	1970-01-01 00:00:00 +0000 and img/[e-mail]	2013-06-16 10:03:26 +0000 differ
=== added file 'img/[e-mail]'
 Binary files img/[e-mail]	1970-01-01 00:00:00 +0000 and img/[e-mail]	2013-06-16 10:03:26 +0000 differ
=== removed file 'img/history.png'
 Binary files img/history.png	2013-02-09 16:41:45 +0000 and img/history.png	1970-01-01 00:00:00 +0000 differ
=== added file 'img/[e-mail]'
 Binary files img/[e-mail]	1970-01-01 00:00:00 +0000 and img/[e-mail]	2013-06-16 10:03:26 +0000 differ
=== removed file 'img/settings.png'
 Binary files img/settings.png	2013-02-09 16:41:45 +0000 and img/settings.png	1970-01-01 00:00:00 +0000 differ
=== added file 'img/[e-mail]'
 Binary files img/[e-mail]	1970-01-01 00:00:00 +0000 and img/[e-mail]	2013-06-16 10:03:26 +0000 differ
=== added file 'js/jsqrcode-combined.js'
--- js/jsqrcode-combined.js	1970-01-01 00:00:00 +0000
+++ js/jsqrcode-combined.js	2013-06-16 10:03:26 +0000
@@ -0,0 +1,3748 @@
+/*
+  Ported to JavaScript by Lazar Laszlo 2011
+
+  [e-mail], www.lazarsoft.info
+
+*/
+
+/*
+*
+* Copyright 2007 ZXing authors
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*      http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+
+var GridSampler = {};
+
+GridSampler.checkAndNudgePoints=function( image,  points)
+		{
+			var width = qrcode.width;
+			var height = qrcode.height;
+			// Check and nudge points from start until we see some that are OK:
+			var nudged = true;
+			for (var offset = 0; offset < points.Length && nudged; offset += 2)
+			{
+				var x = Math.floor (points[offset]);
+				var y = Math.floor( points[offset + 1]);
+				if (x < - 1 || x > width || y < - 1 || y > height)
+				{
+					throw "Error.checkAndNudgePoints ";
+				}
+				nudged = false;
+				if (x == - 1)
+				{
+					points[offset] = 0.0;
+					nudged = true;
+				}
+				else if (x == width)
+				{
+					points[offset] = width - 1;
+					nudged = true;
+				}
+				if (y == - 1)
+				{
+					points[offset + 1] = 0.0;
+					nudged = true;
+				}
+				else if (y == height)
+				{
+					points[offset + 1] = height - 1;
+					nudged = true;
+				}
+			}
+			// Check and nudge points from end:
+			nudged = true;
+			for (var offset = points.Length - 2; offset >= 0 && nudged; offset -= 2)
+			{
+				var x = Math.floor( points[offset]);
+				var y = Math.floor( points[offset + 1]);
+				if (x < - 1 || x > width || y < - 1 || y > height)
+				{
+					throw "Error.checkAndNudgePoints ";
+				}
+				nudged = false;
+				if (x == - 1)
+				{
+					points[offset] = 0.0;
+					nudged = true;
+				}
+				else if (x == width)
+				{
+					points[offset] = width - 1;
+					nudged = true;
+				}
+				if (y == - 1)
+				{
+					points[offset + 1] = 0.0;
+					nudged = true;
+				}
+				else if (y == height)
+				{
+					points[offset + 1] = height - 1;
+					nudged = true;
+				}
+			}
+		}
+
+
+
+GridSampler.sampleGrid3=function( image,  dimension,  transform)
+		{
+			var bits = new BitMatrix(dimension);
+			var points = new Array(dimension << 1);
+			for (var y = 0; y < dimension; y++)
+			{
+				var max = points.length;
+				var iValue =  y + 0.5;
+				for (var x = 0; x < max; x += 2)
+				{
+					points[x] =  (x >> 1) + 0.5;
+					points[x + 1] = iValue;
+				}
+				transform.transformPoints1(points);
+				// Quick check to see if points transformed to something inside the image;
+				// sufficient to check the endpoints
+				GridSampler.checkAndNudgePoints(image, points);
+				try
+				{
+					for (var x = 0; x < max; x += 2)
+					{
+						var xpoint = (Math.floor( points[x]) * 4) + (Math.floor( points[x + 1]) * qrcode.width * 4);
+                        var bit = image[Math.floor( points[x])+ qrcode.width* Math.floor( points[x + 1])];
+						qrcode.imagedata.data[xpoint] = bit?255:0;
+						qrcode.imagedata.data[xpoint+1] = bit?255:0;
+						qrcode.imagedata.data[xpoint+2] = 0;
+						qrcode.imagedata.data[xpoint+3] = 255;
+						//bits[x >> 1][ y]=bit;
+						if(bit)
+							bits.set_Renamed(x >> 1, y);
+					}
+				}
+				catch ( aioobe)
+				{
+					// This feels wrong, but, sometimes if the finder patterns are misidentified, the resulting
+					// transform gets "twisted" such that it maps a straight line of points to a set of points
+					// whose endpoints are in bounds, but others are not. There is probably some mathematical
+					// way to detect this about the transformation that I don't know yet.
+					// This results in an ugly runtime exception despite our clever checks above -- can't have
+					// that. We could check each point's coordinates but that feels duplicative. We settle for
+					// catching and wrapping ArrayIndexOutOfBoundsException.
+					throw "Error.checkAndNudgePoints";
+				}
+			}
+			return bits;
+		}
+
+GridSampler.sampleGridx=function( image,  dimension,  p1ToX,  p1ToY,  p2ToX,  p2ToY,  p3ToX,  p3ToY,  p4ToX,  p4ToY,  p1FromX,  p1FromY,  p2FromX,  p2FromY,  p3FromX,  p3FromY,  p4FromX,  p4FromY)
+{
+	var transform = PerspectiveTransform.quadrilateralToQuadrilateral(p1ToX, p1ToY, p2ToX, p2ToY, p3ToX, p3ToY, p4ToX, p4ToY, p1FromX, p1FromY, p2FromX, p2FromY, p3FromX, p3FromY, p4FromX, p4FromY);
+
+	return GridSampler.sampleGrid3(image, dimension, transform);
+}/*
+  Ported to JavaScript by Lazar Laszlo 2011 
+  
+  [e-mail], www.lazarsoft.info
+  
+*/
+
+/*
+*
+* Copyright 2007 ZXing authors
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*      http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+
+
+function ECB(count,  dataCodewords)
+{
+	this.count = count;
+	this.dataCodewords = dataCodewords;
+	
+	this.__defineGetter__("Count", function()
+	{
+		return this.count;
+	});
+	this.__defineGetter__("DataCodewords", function()
+	{
+		return this.dataCodewords;
+	});
+}
+
+function ECBlocks( ecCodewordsPerBlock,  ecBlocks1,  ecBlocks2)
+{
+	this.ecCodewordsPerBlock = ecCodewordsPerBlock;
+	if(ecBlocks2)
+		this.ecBlocks = new Array(ecBlocks1, ecBlocks2);
+	else
+		this.ecBlocks = new Array(ecBlocks1);
+	
+	this.__defineGetter__("ECCodewordsPerBlock", function()
+	{
+		return this.ecCodewordsPerBlock;
+	});
+	
+	this.__defineGetter__("TotalECCodewords", function()
+	{
+		return  this.ecCodewordsPerBlock * this.NumBlocks;
+	});
+	
+	this.__defineGetter__("NumBlocks", function()
+	{
+		var total = 0;
+		for (var i = 0; i < this.ecBlocks.length; i++)
+		{
+			total += this.ecBlocks[i].length;
+		}
+		return total;
+	});
+	
+	this.getECBlocks=function()
+			{
+				return this.ecBlocks;
+			}
+}
+
+function Version( versionNumber,  alignmentPatternCenters,  ecBlocks1,  ecBlocks2,  ecBlocks3,  ecBlocks4)
+{
+	this.versionNumber = versionNumber;
+	this.alignmentPatternCenters = alignmentPatternCenters;
+	this.ecBlocks = new Array(ecBlocks1, ecBlocks2, ecBlocks3, ecBlocks4);
+	
+	var total = 0;
+	var ecCodewords = ecBlocks1.ECCodewordsPerBlock;
+	var ecbArray = ecBlocks1.getECBlocks();
+	for (var i = 0; i < ecbArray.length; i++)
+	{
+		var ecBlock = ecbArray[i];
+		total += ecBlock.Count * (ecBlock.DataCodewords + ecCodewords);
+	}
+	this.totalCodewords = total;
+	
+	this.__defineGetter__("VersionNumber", function()
+	{
+		return  this.versionNumber;
+	});
+	
+	this.__defineGetter__("AlignmentPatternCenters", function()
+	{
+		return  this.alignmentPatternCenters;
+	});
+	this.__defineGetter__("TotalCodewords", function()
+	{
+		return  this.totalCodewords;
+	});
+	this.__defineGetter__("DimensionForVersion", function()
+	{
+		return  17 + 4 * this.versionNumber;
+	});
+	
+	this.buildFunctionPattern=function()
+		{
+			var dimension = this.DimensionForVersion;
+			var bitMatrix = new BitMatrix(dimension);
+			
+			// Top left finder pattern + separator + format
+			bitMatrix.setRegion(0, 0, 9, 9);
+			// Top right finder pattern + separator + format
+			bitMatrix.setRegion(dimension - 8, 0, 8, 9);
+			// Bottom left finder pattern + separator + format
+			bitMatrix.setRegion(0, dimension - 8, 9, 8);
+			
+			// Alignment patterns
+			var max = this.alignmentPatternCenters.length;
+			for (var x = 0; x < max; x++)
+			{
+				var i = this.alignmentPatternCenters[x] - 2;
+				for (var y = 0; y < max; y++)
+				{
+					if ((x == 0 && (y == 0 || y == max - 1)) || (x == max - 1 && y == 0))
+					{
+						// No alignment patterns near the three finder paterns
+						continue;
+					}
+					bitMatrix.setRegion(this.alignmentPatternCenters[y] - 2, i, 5, 5);
+				}
+			}
+			
+			// Vertical timing pattern
+			bitMatrix.setRegion(6, 9, 1, dimension - 17);
+			// Horizontal timing pattern
+			bitMatrix.setRegion(9, 6, dimension - 17, 1);
+			
+			if (this.versionNumber > 6)
+			{
+				// Version info, top right
+				bitMatrix.setRegion(dimension - 11, 0, 3, 6);
+				// Version info, bottom left
+				bitMatrix.setRegion(0, dimension - 11, 6, 3);
+			}
+			
+			return bitMatrix;
+		}
+	this.getECBlocksForLevel=function( ecLevel)
+	{
+		return this.ecBlocks[ecLevel.ordinal()];
+	}
+}
+
+Version.VERSION_DECODE_INFO = new Array(0x07C94, 0x085BC, 0x09A99, 0x0A4D3, 0x0BBF6, 0x0C762, 0x0D847, 0x0E60D, 0x0F928, 0x10B78, 0x1145D, 0x12A17, 0x13532, 0x149A6, 0x15683, 0x168C9, 0x177EC, 0x18EC4, 0x191E1, 0x1AFAB, 0x1B08E, 0x1CC1A, 0x1D33F, 0x1ED75, 0x1F250, 0x209D5, 0x216F0, 0x228BA, 0x2379F, 0x24B0B, 0x2542E, 0x26A64, 0x27541, 0x28C69);
+
+Version.VERSIONS = buildVersions();
+
+Version.getVersionForNumber=function( versionNumber)
+{
+	if (versionNumber < 1 || versionNumber > 40)
+	{
+		throw "ArgumentException";
+	}
+	return Version.VERSIONS[versionNumber - 1];
+}
+
+Version.getProvisionalVersionForDimension=function(dimension)
+{
+	if (dimension % 4 != 1)
+	{
+		throw "Error getProvisionalVersionForDimension";
+	}
+	try
+	{
+		return Version.getVersionForNumber((dimension - 17) >> 2);
+	}
+	catch ( iae)
+	{
+		throw "Error getVersionForNumber";
+	}
+}
+
+Version.decodeVersionInformation=function( versionBits)
+{
+	var bestDifference = 0xffffffff;
+	var bestVersion = 0;
+	for (var i = 0; i < Version.VERSION_DECODE_INFO.length; i++)
+	{
+		var targetVersion = Version.VERSION_DECODE_INFO[i];
+		// Do the version info bits match exactly? done.
+		if (targetVersion == versionBits)
+		{
+			return this.getVersionForNumber(i + 7);
+		}
+		// Otherwise see if this is the closest to a real version info bit string
+		// we have seen so far
+		var bitsDifference = FormatInformation.numBitsDiffering(versionBits, targetVersion);
+		if (bitsDifference < bestDifference)
+		{
+			bestVersion = i + 7;
+			bestDifference = bitsDifference;
+		}
+	}
+	// We can tolerate up to 3 bits of error since no two version info codewords will
+	// differ in less than 4 bits.
+	if (bestDifference <= 3)
+	{
+		return this.getVersionForNumber(bestVersion);
+	}
+	// If we didn't find a close enough match, fail
+	return null;
+}
+
+function buildVersions()
+{
+	return new Array(new Version(1, new Array(), new ECBlocks(7, new ECB(1, 19)), new ECBlocks(10, new ECB(1, 16)), new ECBlocks(13, new ECB(1, 13)), new ECBlocks(17, new ECB(1, 9))), 
+	new Version(2, new Array(6, 18), new ECBlocks(10, new ECB(1, 34)), new ECBlocks(16, new ECB(1, 28)), new ECBlocks(22, new ECB(1, 22)), new ECBlocks(28, new ECB(1, 16))), 
+	new Version(3, new Array(6, 22), new ECBlocks(15, new ECB(1, 55)), new ECBlocks(26, new ECB(1, 44)), new ECBlocks(18, new ECB(2, 17)), new ECBlocks(22, new ECB(2, 13))), 
+	new Version(4, new Array(6, 26), new ECBlocks(20, new ECB(1, 80)), new ECBlocks(18, new ECB(2, 32)), new ECBlocks(26, new ECB(2, 24)), new ECBlocks(16, new ECB(4, 9))), 
+	new Version(5, new Array(6, 30), new ECBlocks(26, new ECB(1, 108)), new ECBlocks(24, new ECB(2, 43)), new ECBlocks(18, new ECB(2, 15), new ECB(2, 16)), new ECBlocks(22, new ECB(2, 11), new ECB(2, 12))), 
+	new Version(6, new Array(6, 34), new ECBlocks(18, new ECB(2, 68)), new ECBlocks(16, new ECB(4, 27)), new ECBlocks(24, new ECB(4, 19)), new ECBlocks(28, new ECB(4, 15))), 
+	new Version(7, new Array(6, 22, 38), new ECBlocks(20, new ECB(2, 78)), new ECBlocks(18, new ECB(4, 31)), new ECBlocks(18, new ECB(2, 14), new ECB(4, 15)), new ECBlocks(26, new ECB(4, 13), new ECB(1, 14))), 
+	new Version(8, new Array(6, 24, 42), new ECBlocks(24, new ECB(2, 97)), new ECBlocks(22, new ECB(2, 38), new ECB(2, 39)), new ECBlocks(22, new ECB(4, 18), new ECB(2, 19)), new ECBlocks(26, new ECB(4, 14), new ECB(2, 15))), 
+	new Version(9, new Array(6, 26, 46), new ECBlocks(30, new ECB(2, 116)), new ECBlocks(22, new ECB(3, 36), new ECB(2, 37)), new ECBlocks(20, new ECB(4, 16), new ECB(4, 17)), new ECBlocks(24, new ECB(4, 12), new ECB(4, 13))), 
+	new Version(10, new Array(6, 28, 50), new ECBlocks(18, new ECB(2, 68), new ECB(2, 69)), new ECBlocks(26, new ECB(4, 43), new ECB(1, 44)), new ECBlocks(24, new ECB(6, 19), new ECB(2, 20)), new ECBlocks(28, new ECB(6, 15), new ECB(2, 16))), 
+	new Version(11, new Array(6, 30, 54), new ECBlocks(20, new ECB(4, 81)), new ECBlocks(30, new ECB(1, 50), new ECB(4, 51)), new ECBlocks(28, new ECB(4, 22), new ECB(4, 23)), new ECBlocks(24, new ECB(3, 12), new ECB(8, 13))), 
+	new Version(12, new Array(6, 32, 58), new ECBlocks(24, new ECB(2, 92), new ECB(2, 93)), new ECBlocks(22, new ECB(6, 36), new ECB(2, 37)), new ECBlocks(26, new ECB(4, 20), new ECB(6, 21)), new ECBlocks(28, new ECB(7, 14), new ECB(4, 15))), 
+	new Version(13, new Array(6, 34, 62), new ECBlocks(26, new ECB(4, 107)), new ECBlocks(22, new ECB(8, 37), new ECB(1, 38)), new ECBlocks(24, new ECB(8, 20), new ECB(4, 21)), new ECBlocks(22, new ECB(12, 11), new ECB(4, 12))), 
+	new Version(14, new Array(6, 26, 46, 66), new ECBlocks(30, new ECB(3, 115), new ECB(1, 116)), new ECBlocks(24, new ECB(4, 40), new ECB(5, 41)), new ECBlocks(20, new ECB(11, 16), new ECB(5, 17)), new ECBlocks(24, new ECB(11, 12), new ECB(5, 13))), 
+	new Version(15, new Array(6, 26, 48, 70), new ECBlocks(22, new ECB(5, 87), new ECB(1, 88)), new ECBlocks(24, new ECB(5, 41), new ECB(5, 42)), new ECBlocks(30, new ECB(5, 24), new ECB(7, 25)), new ECBlocks(24, new ECB(11, 12), new ECB(7, 13))), 
+	new Version(16, new Array(6, 26, 50, 74), new ECBlocks(24, new ECB(5, 98), new ECB(1, 99)), new ECBlocks(28, new ECB(7, 45), new ECB(3, 46)), new ECBlocks(24, new ECB(15, 19), new ECB(2, 20)), new ECBlocks(30, new ECB(3, 15), new ECB(13, 16))), 
+	new Version(17, new Array(6, 30, 54, 78), new ECBlocks(28, new ECB(1, 107), new ECB(5, 108)), new ECBlocks(28, new ECB(10, 46), new ECB(1, 47)), new ECBlocks(28, new ECB(1, 22), new ECB(15, 23)), new ECBlocks(28, new ECB(2, 14), new ECB(17, 15))), 
+	new Version(18, new Array(6, 30, 56, 82), new ECBlocks(30, new ECB(5, 120), new ECB(1, 121)), new ECBlocks(26, new ECB(9, 43), new ECB(4, 44)), new ECBlocks(28, new ECB(17, 22), new ECB(1, 23)), new ECBlocks(28, new ECB(2, 14), new ECB(19, 15))), 
+	new Version(19, new Array(6, 30, 58, 86), new ECBlocks(28, new ECB(3, 113), new ECB(4, 114)), new ECBlocks(26, new ECB(3, 44), new ECB(11, 45)), new ECBlocks(26, new ECB(17, 21), new ECB(4, 22)), new ECBlocks(26, new ECB(9, 13), new ECB(16, 14))), 
+	new Version(20, new Array(6, 34, 62, 90), new ECBlocks(28, new ECB(3, 107), new ECB(5, 108)), new ECBlocks(26, new ECB(3, 41), new ECB(13, 42)), new ECBlocks(30, new ECB(15, 24), new ECB(5, 25)), new ECBlocks(28, new ECB(15, 15), new ECB(10, 16))), 
+	new Version(21, new Array(6, 28, 50, 72, 94), new ECBlocks(28, new ECB(4, 116), new ECB(4, 117)), new ECBlocks(26, new ECB(17, 42)), new ECBlocks(28, new ECB(17, 22), new ECB(6, 23)), new ECBlocks(30, new ECB(19, 16), new ECB(6, 17))), 
+	new Version(22, new Array(6, 26, 50, 74, 98), new ECBlocks(28, new ECB(2, 111), new ECB(7, 112)), new ECBlocks(28, new ECB(17, 46)), new ECBlocks(30, new ECB(7, 24), new ECB(16, 25)), new ECBlocks(24, new ECB(34, 13))), 
+	new Version(23, new Array(6, 30, 54, 74, 102), new ECBlocks(30, new ECB(4, 121), new ECB(5, 122)), new ECBlocks(28, new ECB(4, 47), new ECB(14, 48)), new ECBlocks(30, new ECB(11, 24), new ECB(14, 25)), new ECBlocks(30, new ECB(16, 15), new ECB(14, 16))), 
+	new Version(24, new Array(6, 28, 54, 80, 106), new ECBlocks(30, new ECB(6, 117), new ECB(4, 118)), new ECBlocks(28, new ECB(6, 45), new ECB(14, 46)), new ECBlocks(30, new ECB(11, 24), new ECB(16, 25)), new ECBlocks(30, new ECB(30, 16), new ECB(2, 17))), 
+	new Version(25, new Array(6, 32, 58, 84, 110), new ECBlocks(26, new ECB(8, 106), new ECB(4, 107)), new ECBlocks(28, new ECB(8, 47), new ECB(13, 48)), new ECBlocks(30, new ECB(7, 24), new ECB(22, 25)), new ECBlocks(30, new ECB(22, 15), new ECB(13, 16))), 
+	new Version(26, new Array(6, 30, 58, 86, 114), new ECBlocks(28, new ECB(10, 114), new ECB(2, 115)), new ECBlocks(28, new ECB(19, 46), new ECB(4, 47)), new ECBlocks(28, new ECB(28, 22), new ECB(6, 23)), new ECBlocks(30, new ECB(33, 16), new ECB(4, 17))), 
+	new Version(27, new Array(6, 34, 62, 90, 118), new ECBlocks(30, new ECB(8, 122), new ECB(4, 123)), new ECBlocks(28, new ECB(22, 45), new ECB(3, 46)), new ECBlocks(30, new ECB(8, 23), new ECB(26, 24)), new ECBlocks(30, new ECB(12, 15), 		new ECB(28, 16))),
+	new Version(28, new Array(6, 26, 50, 74, 98, 122), new ECBlocks(30, new ECB(3, 117), new ECB(10, 118)), new ECBlocks(28, new ECB(3, 45), new ECB(23, 46)), new ECBlocks(30, new ECB(4, 24), new ECB(31, 25)), new ECBlocks(30, new ECB(11, 15), new ECB(31, 16))), 
+	new Version(29, new Array(6, 30, 54, 78, 102, 126), new ECBlocks(30, new ECB(7, 116), new ECB(7, 117)), new ECBlocks(28, new ECB(21, 45), new ECB(7, 46)), new ECBlocks(30, new ECB(1, 23), new ECB(37, 24)), new ECBlocks(30, new ECB(19, 15), new ECB(26, 16))), 
+	new Version(30, new Array(6, 26, 52, 78, 104, 130), new ECBlocks(30, new ECB(5, 115), new ECB(10, 116)), new ECBlocks(28, new ECB(19, 47), new ECB(10, 48)), new ECBlocks(30, new ECB(15, 24), new ECB(25, 25)), new ECBlocks(30, new ECB(23, 15), new ECB(25, 16))), 
+	new Version(31, new Array(6, 30, 56, 82, 108, 134), new ECBlocks(30, new ECB(13, 115), new ECB(3, 116)), new ECBlocks(28, new ECB(2, 46), new ECB(29, 47)), new ECBlocks(30, new ECB(42, 24), new ECB(1, 25)), new ECBlocks(30, new ECB(23, 15), new ECB(28, 16))), 
+	new Version(32, new Array(6, 34, 60, 86, 112, 138), new ECBlocks(30, new ECB(17, 115)), new ECBlocks(28, new ECB(10, 46), new ECB(23, 47)), new ECBlocks(30, new ECB(10, 24), new ECB(35, 25)), new ECBlocks(30, new ECB(19, 15), new ECB(35, 16))), 
+	new Version(33, new Array(6, 30, 58, 86, 114, 142), new ECBlocks(30, new ECB(17, 115), new ECB(1, 116)), new ECBlocks(28, new ECB(14, 46), new ECB(21, 47)), new ECBlocks(30, new ECB(29, 24), new ECB(19, 25)), new ECBlocks(30, new ECB(11, 15), new ECB(46, 16))), 
+	new Version(34, new Array(6, 34, 62, 90, 118, 146), new ECBlocks(30, new ECB(13, 115), new ECB(6, 116)), new ECBlocks(28, new ECB(14, 46), new ECB(23, 47)), new ECBlocks(30, new ECB(44, 24), new ECB(7, 25)), new ECBlocks(30, new ECB(59, 16), new ECB(1, 17))), 
+	new Version(35, new Array(6, 30, 54, 78, 102, 126, 150), new ECBlocks(30, new ECB(12, 121), new ECB(7, 122)), new ECBlocks(28, new ECB(12, 47), new ECB(26, 48)), new ECBlocks(30, new ECB(39, 24), new ECB(14, 25)),new ECBlocks(30, new ECB(22, 15), new ECB(41, 16))), 
+	new Version(36, new Array(6, 24, 50, 76, 102, 128, 154), new ECBlocks(30, new ECB(6, 121), new ECB(14, 122)), new ECBlocks(28, new ECB(6, 47), new ECB(34, 48)), new ECBlocks(30, new ECB(46, 24), new ECB(10, 25)), new ECBlocks(30, new ECB(2, 15), new ECB(64, 16))), 
+	new Version(37, new Array(6, 28, 54, 80, 106, 132, 158), new ECBlocks(30, new ECB(17, 122), new ECB(4, 123)), new ECBlocks(28, new ECB(29, 46), new ECB(14, 47)), new ECBlocks(30, new ECB(49, 24), new ECB(10, 25)), new ECBlocks(30, new ECB(24, 15), new ECB(46, 16))), 
+	new Version(38, new Array(6, 32, 58, 84, 110, 136, 162), new ECBlocks(30, new ECB(4, 122), new ECB(18, 123)), new ECBlocks(28, new ECB(13, 46), new ECB(32, 47)), new ECBlocks(30, new ECB(48, 24), new ECB(14, 25)), new ECBlocks(30, new ECB(42, 15), new ECB(32, 16))), 
+	new Version(39, new Array(6, 26, 54, 82, 110, 138, 166), new ECBlocks(30, new ECB(20, 117), new ECB(4, 118)), new ECBlocks(28, new ECB(40, 47), new ECB(7, 48)), new ECBlocks(30, new ECB(43, 24), new ECB(22, 25)), new ECBlocks(30, new ECB(10, 15), new ECB(67, 16))), 
+	new Version(40, new Array(6, 30, 58, 86, 114, 142, 170), new ECBlocks(30, new ECB(19, 118), new ECB(6, 119)), new ECBlocks(28, new ECB(18, 47), new ECB(31, 48)), new ECBlocks(30, new ECB(34, 24), new ECB(34, 25)), new ECBlocks(30, new ECB(20, 15), new ECB(61, 16))));
+}/*
+  Ported to JavaScript by Lazar Laszlo 2011
+
+  [e-mail], www.lazarsoft.info
+
+*/
+
+/*
+*
+* Copyright 2007 ZXing authors
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*      http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+
+function PerspectiveTransform( a11,  a21,  a31,  a12,  a22,  a32,  a13,  a23,  a33)
+{
+	this.a11 = a11;
+	this.a12 = a12;
+	this.a13 = a13;
+	this.a21 = a21;
+	this.a22 = a22;
+	this.a23 = a23;
+	this.a31 = a31;
+	this.a32 = a32;
+	this.a33 = a33;
+	this.transformPoints1=function( points)
+		{
+			var max = points.length;
+			var a11 = this.a11;
+			var a12 = this.a12;
+			var a13 = this.a13;
+			var a21 = this.a21;
+			var a22 = this.a22;
+			var a23 = this.a23;
+			var a31 = this.a31;
+			var a32 = this.a32;
+			var a33 = this.a33;
+			for (var i = 0; i < max; i += 2)
+			{
+				var x = points[i];
+				var y = points[i + 1];
+				var denominator = a13 * x + a23 * y + a33;
+				points[i] = (a11 * x + a21 * y + a31) / denominator;
+				points[i + 1] = (a12 * x + a22 * y + a32) / denominator;
+			}
+		}
+	this. transformPoints2=function(xValues, yValues)
+		{
+			var n = xValues.length;
+			for (var i = 0; i < n; i++)
+			{
+				var x = xValues[i];
+				var y = yValues[i];
+				var denominator = this.a13 * x + this.a23 * y + this.a33;
+				xValues[i] = (this.a11 * x + this.a21 * y + this.a31) / denominator;
+				yValues[i] = (this.a12 * x + this.a22 * y + this.a32) / denominator;
+			}
+		}
+
+	this.buildAdjoint=function()
+		{
+			// Adjoint is the transpose of the cofactor matrix:
+			return new PerspectiveTransform(this.a22 * this.a33 - this.a23 * this.a32, this.a23 * this.a31 - this.a21 * this.a33, this.a21 * this.a32 - this.a22 * this.a31, this.a13 * this.a32 - this.a12 * this.a33, this.a11 * this.a33 - this.a13 * this.a31, this.a12 * this.a31 - this.a11 * this.a32, this.a12 * this.a23 - this.a13 * this.a22, this.a13 * this.a21 - this.a11 * this.a23, this.a11 * this.a22 - this.a12 * this.a21);
+		}
+	this.times=function( other)
+		{
+			return new PerspectiveTransform(this.a11 * other.a11 + this.a21 * other.a12 + this.a31 * other.a13, this.a11 * other.a21 + this.a21 * other.a22 + this.a31 * other.a23, this.a11 * other.a31 + this.a21 * other.a32 + this.a31 * other.a33, this.a12 * other.a11 + this.a22 * other.a12 + this.a32 * other.a13, this.a12 * other.a21 + this.a22 * other.a22 + this.a32 * other.a23, this.a12 * other.a31 + this.a22 * other.a32 + this.a32 * other.a33, this.a13 * other.a11 + this.a23 * other.a12 +this.a33 * other.a13, this.a13 * other.a21 + this.a23 * other.a22 + this.a33 * other.a23, this.a13 * other.a31 + this.a23 * other.a32 + this.a33 * other.a33);
+		}
+
+}
+
+PerspectiveTransform.quadrilateralToQuadrilateral=function( x0,  y0,  x1,  y1,  x2,  y2,  x3,  y3,  x0p,  y0p,  x1p,  y1p,  x2p,  y2p,  x3p,  y3p)
+{
+
+	var qToS = this.quadrilateralToSquare(x0, y0, x1, y1, x2, y2, x3, y3);
+	var sToQ = this.squareToQuadrilateral(x0p, y0p, x1p, y1p, x2p, y2p, x3p, y3p);
+	return sToQ.times(qToS);
+}
+
+PerspectiveTransform.squareToQuadrilateral=function( x0,  y0,  x1,  y1,  x2,  y2,  x3,  y3)
+{
+	 var dy2 = y3 - y2;
+	 var dy3 = y0 - y1 + y2 - y3;
+	if (dy2 == 0.0 && dy3 == 0.0)
+	{
+		return new PerspectiveTransform(x1 - x0, x2 - x1, x0, y1 - y0, y2 - y1, y0, 0.0, 0.0, 1.0);
+	}
+	else
+	{
+		 var dx1 = x1 - x2;
+		 var dx2 = x3 - x2;
+		 var dx3 = x0 - x1 + x2 - x3;
+		 var dy1 = y1 - y2;
+		 var denominator = dx1 * dy2 - dx2 * dy1;
+		 var a13 = (dx3 * dy2 - dx2 * dy3) / denominator;
+		 var a23 = (dx1 * dy3 - dx3 * dy1) / denominator;
+		return new PerspectiveTransform(x1 - x0 + a13 * x1, x3 - x0 + a23 * x3, x0, y1 - y0 + a13 * y1, y3 - y0 + a23 * y3, y0, a13, a23, 1.0);
+	}
+}
+
+PerspectiveTransform.quadrilateralToSquare=function( x0,  y0,  x1,  y1,  x2,  y2,  x3,  y3)
+{
+	// Here, the adjoint serves as the inverse:
+	return this.squareToQuadrilateral(x0, y0, x1, y1, x2, y2, x3, y3).buildAdjoint();
+}
+
+function DetectorResult(bits,  points)
+{
+	this.bits = bits;
+	this.points = points;
+}
+
+
+function Detector(image)
+{
+	this.image=image;
+	this.resultPointCallback = null;
+
+	this.sizeOfBlackWhiteBlackRun=function( fromX,  fromY,  toX,  toY)
+		{
+			// Mild variant of Bresenham's algorithm;
+			// see http://en.wikipedia.org/wiki/Bresenham's_line_algorithm
+			var steep = Math.abs(toY - fromY) > Math.abs(toX - fromX);
+			if (steep)
+			{
+				var temp = fromX;
+				fromX = fromY;
+				fromY = temp;
+				temp = toX;
+				toX = toY;
+				toY = temp;
+			}
+
+			var dx = Math.abs(toX - fromX);
+			var dy = Math.abs(toY - fromY);
+			var error = - dx >> 1;
+			var ystep = fromY < toY?1:- 1;
+			var xstep = fromX < toX?1:- 1;
+			var state = 0; // In black pixels, looking for white, first or second time
+			for (var x = fromX, y = fromY; x != toX; x += xstep)
+			{
+
+				var realX = steep?y:x;
+				var realY = steep?x:y;
+				if (state == 1)
+				{
+					// In white pixels, looking for black
+					if (this.image[realX + realY*qrcode.width])
+					{
+						state++;
+					}
+				}
+				else
+				{
+					if (!this.image[realX + realY*qrcode.width])
+					{
+						state++;
+					}
+				}
+
+				if (state == 3)
+				{
+					// Found black, white, black, and stumbled back onto white; done
+					var diffX = x - fromX;
+					var diffY = y - fromY;
+					return  Math.sqrt( (diffX * diffX + diffY * diffY));
+				}
+				error += dy;
+				if (error > 0)
+				{
+					if (y == toY)
+					{
+						break;
+					}
+					y += ystep;
+					error -= dx;
+				}
+			}
+			var diffX2 = toX - fromX;
+			var diffY2 = toY - fromY;
+			return  Math.sqrt( (diffX2 * diffX2 + diffY2 * diffY2));
+		}
+
+
+	this.sizeOfBlackWhiteBlackRunBothWays=function( fromX,  fromY,  toX,  toY)
+		{
+
+			var result = this.sizeOfBlackWhiteBlackRun(fromX, fromY, toX, toY);
+
+			// Now count other way -- don't run off image though of course
+			var scale = 1.0;
+			var otherToX = fromX - (toX - fromX);
+			if (otherToX < 0)
+			{
+				scale =  fromX /  (fromX - otherToX);
+				otherToX = 0;
+			}
+			else if (otherToX >= qrcode.width)
+			{
+				scale =  (qrcode.width - 1 - fromX) /  (otherToX - fromX);
+				otherToX = qrcode.width - 1;
+			}
+			var otherToY = Math.floor (fromY - (toY - fromY) * scale);
+
+			scale = 1.0;
+			if (otherToY < 0)
+			{
+				scale =  fromY /  (fromY - otherToY);
+				otherToY = 0;
+			}
+			else if (otherToY >= qrcode.height)
+			{
+				scale =  (qrcode.height - 1 - fromY) /  (otherToY - fromY);
+				otherToY = qrcode.height - 1;
+			}
+			otherToX = Math.floor (fromX + (otherToX - fromX) * scale);
+
+			result += this.sizeOfBlackWhiteBlackRun(fromX, fromY, otherToX, otherToY);
+			return result - 1.0; // -1 because we counted the middle pixel twice
+		}
+
+
+
+	this.calculateModuleSizeOneWay=function( pattern,  otherPattern)
+		{
+			var moduleSizeEst1 = this.sizeOfBlackWhiteBlackRunBothWays(Math.floor( pattern.X), Math.floor( pattern.Y), Math.floor( otherPattern.X), Math.floor(otherPattern.Y));
+			var moduleSizeEst2 = this.sizeOfBlackWhiteBlackRunBothWays(Math.floor(otherPattern.X), Math.floor(otherPattern.Y), Math.floor( pattern.X), Math.floor(pattern.Y));
+			if (isNaN(moduleSizeEst1))
+			{
+				return moduleSizeEst2 / 7.0;
+			}
+			if (isNaN(moduleSizeEst2))
+			{
+				return moduleSizeEst1 / 7.0;
+			}
+			// Average them, and divide by 7 since we've counted the width of 3 black modules,
+			// and 1 white and 1 black module on either side. Ergo, divide sum by 14.
+			return (moduleSizeEst1 + moduleSizeEst2) / 14.0;
+		}
+
+
+	this.calculateModuleSize=function( topLeft,  topRight,  bottomLeft)
+		{
+			// Take the average
+			return (this.calculateModuleSizeOneWay(topLeft, topRight) + this.calculateModuleSizeOneWay(topLeft, bottomLeft)) / 2.0;
+		}
+
+	this.distance=function( pattern1,  pattern2)
+	{
+		var xDiff = pattern1.X - pattern2.X;
+		var yDiff = pattern1.Y - pattern2.Y;
+		return  Math.sqrt( (xDiff * xDiff + yDiff * yDiff));
+	}
+	this.computeDimension=function( topLeft,  topRight,  bottomLeft,  moduleSize)
+		{
+
+			var tltrCentersDimension = Math.round(this.distance(topLeft, topRight) / moduleSize);
+			var tlblCentersDimension = Math.round(this.distance(topLeft, bottomLeft) / moduleSize);
+			var dimension = ((tltrCentersDimension + tlblCentersDimension) >> 1) + 7;
+			switch (dimension & 0x03)
+			{
+
+				// mod 4
+				case 0:
+					dimension++;
+					break;
+					// 1? do nothing
+
+				case 2:
+					dimension--;
+					break;
+
+				case 3:
+					throw "Error";
+				}
+			return dimension;
+		}
+
+	this.findAlignmentInRegion=function( overallEstModuleSize,  estAlignmentX,  estAlignmentY,  allowanceFactor)
+		{
+			// Look for an alignment pattern (3 modules in size) around where it
+			// should be
+			var allowance = Math.floor (allowanceFactor * overallEstModuleSize);
+			var alignmentAreaLeftX = Math.max(0, estAlignmentX - allowance);
+			var alignmentAreaRightX = Math.min(qrcode.width - 1, estAlignmentX + allowance);
+			if (alignmentAreaRightX - alignmentAreaLeftX < overallEstModuleSize * 3)
+			{
+				throw "Error";
+			}
+
+			var alignmentAreaTopY = Math.max(0, estAlignmentY - allowance);
+			var alignmentAreaBottomY = Math.min(qrcode.height - 1, estAlignmentY + allowance);
+
+			var alignmentFinder = new AlignmentPatternFinder(this.image, alignmentAreaLeftX, alignmentAreaTopY, alignmentAreaRightX - alignmentAreaLeftX, alignmentAreaBottomY - alignmentAreaTopY, overallEstModuleSize, this.resultPointCallback);
+			return alignmentFinder.find();
+		}
+
+	this.createTransform=function( topLeft,  topRight,  bottomLeft, alignmentPattern, dimension)
+		{
+			var dimMinusThree =  dimension - 3.5;
+			var bottomRightX;
+			var bottomRightY;
+			var sourceBottomRightX;
+			var sourceBottomRightY;
+			if (alignmentPattern != null)
+			{
+				bottomRightX = alignmentPattern.X;
+				bottomRightY = alignmentPattern.Y;
+				sourceBottomRightX = sourceBottomRightY = dimMinusThree - 3.0;
+			}
+			else
+			{
+				// Don't have an alignment pattern, just make up the bottom-right point
+				bottomRightX = (topRight.X - topLeft.X) + bottomLeft.X;
+				bottomRightY = (topRight.Y - topLeft.Y) + bottomLeft.Y;
+				sourceBottomRightX = sourceBottomRightY = dimMinusThree;
+			}
+
+			var transform = PerspectiveTransform.quadrilateralToQuadrilateral(3.5, 3.5, dimMinusThree, 3.5, sourceBottomRightX, sourceBottomRightY, 3.5, dimMinusThree, topLeft.X, topLeft.Y, topRight.X, topRight.Y, bottomRightX, bottomRightY, bottomLeft.X, bottomLeft.Y);
+
+			return transform;
+		}
+
+	this.sampleGrid=function( image,  transform,  dimension)
+		{
+
+			var sampler = GridSampler;
+			return sampler.sampleGrid3(image, dimension, transform);
+		}
+
+	this.processFinderPatternInfo = function( info)
+		{
+
+			var topLeft = info.TopLeft;
+			var topRight = info.TopRight;
+			var bottomLeft = info.BottomLeft;
+
+			var moduleSize = this.calculateModuleSize(topLeft, topRight, bottomLeft);
+			if (moduleSize < 1.0)
+			{
+				throw "Error";
+			}
+			var dimension = this.computeDimension(topLeft, topRight, bottomLeft, moduleSize);
+			var provisionalVersion = Version.getProvisionalVersionForDimension(dimension);
+			var modulesBetweenFPCenters = provisionalVersion.DimensionForVersion - 7;
+
+			var alignmentPattern = null;
+			// Anything above version 1 has an alignment pattern
+			if (provisionalVersion.AlignmentPatternCenters.length > 0)
+			{
+
+				// Guess where a "bottom right" finder pattern would have been
+				var bottomRightX = topRight.X - topLeft.X + bottomLeft.X;
+				var bottomRightY = topRight.Y - topLeft.Y + bottomLeft.Y;
+
+				// Estimate that alignment pattern is closer by 3 modules
+				// from "bottom right" to known top left location
+				var correctionToTopLeft = 1.0 - 3.0 /  modulesBetweenFPCenters;
+				var estAlignmentX = Math.floor (topLeft.X + correctionToTopLeft * (bottomRightX - topLeft.X));
+				var estAlignmentY = Math.floor (topLeft.Y + correctionToTopLeft * (bottomRightY - topLeft.Y));
+
+				// Kind of arbitrary -- expand search radius before giving up
+				for (var i = 4; i <= 16; i <<= 1)
+				{
+					//try
+					//{
+						alignmentPattern = this.findAlignmentInRegion(moduleSize, estAlignmentX, estAlignmentY,  i);
+						break;
+					//}
+					//catch (re)
+					//{
+						// try next round
+					//}
+				}
+				// If we didn't find alignment pattern... well try anyway without it
+			}
+
+			var transform = this.createTransform(topLeft, topRight, bottomLeft, alignmentPattern, dimension);
+
+			var bits = this.sampleGrid(this.image, transform, dimension);
+
+			var points;
+			if (alignmentPattern == null)
+			{
+				points = new Array(bottomLeft, topLeft, topRight);
+			}
+			else
+			{
+				points = new Array(bottomLeft, topLeft, topRight, alignmentPattern);
+			}
+			return new DetectorResult(bits, points);
+		}
+
+
+
+	this.detect=function()
+	{
+		var info =  new FinderPatternFinder().findFinderPattern(this.image);
+
+		return this.processFinderPatternInfo(info);
+	}
+}/*
+  Ported to JavaScript by Lazar Laszlo 2011 
+  
+  [e-mail], www.lazarsoft.info
+  
+*/
+
+/*
+*
+* Copyright 2007 ZXing authors
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*      http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+
+var FORMAT_INFO_MASK_QR = 0x5412;
+var FORMAT_INFO_DECODE_LOOKUP = new Array(new Array(0x5412, 0x00), new Array(0x5125, 0x01), new Array(0x5E7C, 0x02), new Array(0x5B4B, 0x03), new Array(0x45F9, 0x04), new Array(0x40CE, 0x05), new Array(0x4F97, 0x06), new Array(0x4AA0, 0x07), new Array(0x77C4, 0x08), new Array(0x72F3, 0x09), new Array(0x7DAA, 0x0A), new Array(0x789D, 0x0B), new Array(0x662F, 0x0C), new Array(0x6318, 0x0D), new Array(0x6C41, 0x0E), new Array(0x6976, 0x0F), new Array(0x1689, 0x10), new Array(0x13BE, 0x11), new Array(0x1CE7, 0x12), new Array(0x19D0, 0x13), new Array(0x0762, 0x14), new Array(0x0255, 0x15), new Array(0x0D0C, 0x16), new Array(0x083B, 0x17), new Array(0x355F, 0x18), new Array(0x3068, 0x19), new Array(0x3F31, 0x1A), new Array(0x3A06, 0x1B), new Array(0x24B4, 0x1C), new Array(0x2183, 0x1D), new Array(0x2EDA, 0x1E), new Array(0x2BED, 0x1F));
+var BITS_SET_IN_HALF_BYTE = new Array(0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4);
+
+
+function FormatInformation(formatInfo)
+{
+	this.errorCorrectionLevel = ErrorCorrectionLevel.forBits((formatInfo >> 3) & 0x03);
+	this.dataMask =  (formatInfo & 0x07);
+
+	this.__defineGetter__("ErrorCorrectionLevel", function()
+	{
+		return this.errorCorrectionLevel;
+	});
+	this.__defineGetter__("DataMask", function()
+	{
+		return this.dataMask;
+	});
+	this.GetHashCode=function()
+	{
+		return (this.errorCorrectionLevel.ordinal() << 3) |  dataMask;
+	}
+	this.Equals=function( o)
+	{
+		var other =  o;
+		return this.errorCorrectionLevel == other.errorCorrectionLevel && this.dataMask == other.dataMask;
+	}
+}
+
+FormatInformation.numBitsDiffering=function( a,  b)
+{
+	a ^= b; // a now has a 1 bit exactly where its bit differs with b's
+	// Count bits set quickly with a series of lookups:
+	return BITS_SET_IN_HALF_BYTE[a & 0x0F] + BITS_SET_IN_HALF_BYTE[(URShift(a, 4) & 0x0F)] + BITS_SET_IN_HALF_BYTE[(URShift(a, 8) & 0x0F)] + BITS_SET_IN_HALF_BYTE[(URShift(a, 12) & 0x0F)] + BITS_SET_IN_HALF_BYTE[(URShift(a, 16) & 0x0F)] + BITS_SET_IN_HALF_BYTE[(URShift(a, 20) & 0x0F)] + BITS_SET_IN_HALF_BYTE[(URShift(a, 24) & 0x0F)] + BITS_SET_IN_HALF_BYTE[(URShift(a, 28) & 0x0F)];
+}
+
+FormatInformation.decodeFormatInformation=function( maskedFormatInfo)
+{
+	var formatInfo = FormatInformation.doDecodeFormatInformation(maskedFormatInfo);
+	if (formatInfo != null)
+	{
+		return formatInfo;
+	}
+	// Should return null, but, some QR codes apparently
+	// do not mask this info. Try again by actually masking the pattern
+	// first
+	return FormatInformation.doDecodeFormatInformation(maskedFormatInfo ^ FORMAT_INFO_MASK_QR);
+}
+FormatInformation.doDecodeFormatInformation=function( maskedFormatInfo)
+{
+	// Find the int in FORMAT_INFO_DECODE_LOOKUP with fewest bits differing
+	var bestDifference = 0xffffffff;
+	var bestFormatInfo = 0;
+	for (var i = 0; i < FORMAT_INFO_DECODE_LOOKUP.length; i++)
+	{
+		var decodeInfo = FORMAT_INFO_DECODE_LOOKUP[i];
+		var targetInfo = decodeInfo[0];
+		if (targetInfo == maskedFormatInfo)
+		{
+			// Found an exact match
+			return new FormatInformation(decodeInfo[1]);
+		}
+		var bitsDifference = this.numBitsDiffering(maskedFormatInfo, targetInfo);
+		if (bitsDifference < bestDifference)
+		{
+			bestFormatInfo = decodeInfo[1];
+			bestDifference = bitsDifference;
+		}
+	}
+	// Hamming distance of the 32 masked codes is 7, by construction, so <= 3 bits
+	// differing means we found a match
+	if (bestDifference <= 3)
+	{
+		return new FormatInformation(bestFormatInfo);
+	}
+	return null;
+}
+
+		/*
+  Ported to JavaScript by Lazar Laszlo 2011 
+  
+  [e-mail], www.lazarsoft.info
+  
+*/
+
+/*
+*
+* Copyright 2007 ZXing authors
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*      http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+
+function ErrorCorrectionLevel(ordinal,  bits, name)
+{
+	this.ordinal_Renamed_Field = ordinal;
+	this.bits = bits;
+	this.name = name;
+	this.__defineGetter__("Bits", function()
+	{
+		return this.bits;
+	});
+	this.__defineGetter__("Name", function()
+	{
+		return this.name;
+	});
+	this.ordinal=function()
+	{
+		return this.ordinal_Renamed_Field;
+	}
+}
+
+ErrorCorrectionLevel.forBits=function( bits)
+{
+	if (bits < 0 || bits >= FOR_BITS.Length)
+	{
+		throw "ArgumentException";
+	}
+	return FOR_BITS[bits];
+}
+
+var L = new ErrorCorrectionLevel(0, 0x01, "L");
+var M = new ErrorCorrectionLevel(1, 0x00, "M");
+var Q = new ErrorCorrectionLevel(2, 0x03, "Q");
+var H = new ErrorCorrectionLevel(3, 0x02, "H");
+var FOR_BITS = new Array( M, L, H, Q);/*
+  Ported to JavaScript by Lazar Laszlo 2011 
+  
+  [e-mail], www.lazarsoft.info
+  
+*/
+
+/*
+*
+* Copyright 2007 ZXing authors
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*      http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+
+function BitMatrix( width,  height)
+{
+	if(!height)
+		height=width;
+	if (width < 1 || height < 1)
+	{
+		throw "Both dimensions must be greater than 0";
+	}
+	this.width = width;
+	this.height = height;
+	var rowSize = width >> 5;
+	if ((width & 0x1f) != 0)
+	{
+		rowSize++;
+	}
+	this.rowSize = rowSize;
+	this.bits = new Array(rowSize * height);
+	for(var i=0;i<this.bits.length;i++)
+		this.bits[i]=0;
+	
+	this.__defineGetter__("Width", function()
+	{
+		return this.width;
+	});
+	this.__defineGetter__("Height", function()
+	{
+		return this.height;
+	});
+	this.__defineGetter__("Dimension", function()
+	{
+		if (this.width != this.height)
+		{
+			throw "Can't call getDimension() on a non-square matrix";
+		}
+		return this.width;
+	});
+	
+	this.get_Renamed=function( x,  y)
+		{
+			var offset = y * this.rowSize + (x >> 5);
+			return ((URShift(this.bits[offset], (x & 0x1f))) & 1) != 0;
+		}
+	this.set_Renamed=function( x,  y)
+		{
+			var offset = y * this.rowSize + (x >> 5);
+			this.bits[offset] |= 1 << (x & 0x1f);
+		}
+	this.flip=function( x,  y)
+		{
+			var offset = y * this.rowSize + (x >> 5);
+			this.bits[offset] ^= 1 << (x & 0x1f);
+		}
+	this.clear=function()
+		{
+			var max = this.bits.length;
+			for (var i = 0; i < max; i++)
+			{
+				this.bits[i] = 0;
+			}
+		}
+	this.setRegion=function( left,  top,  width,  height)
+		{
+			if (top < 0 || left < 0)
+			{
+				throw "Left and top must be nonnegative";
+			}
+			if (height < 1 || width < 1)
+			{
+				throw "Height and width must be at least 1";
+			}
+			var right = left + width;
+			var bottom = top + height;
+			if (bottom > this.height || right > this.width)
+			{
+				throw "The region must fit inside the matrix";
+			}
+			for (var y = top; y < bottom; y++)
+			{
+				var offset = y * this.rowSize;
+				for (var x = left; x < right; x++)
+				{
+					this.bits[offset + (x >> 5)] |= 1 << (x & 0x1f);
+				}
+			}
+		}
+}/*
+  Ported to JavaScript by Lazar Laszlo 2011 
+  
+  [e-mail], www.lazarsoft.info
+  
+*/
+
+/*
+*
+* Copyright 2007 ZXing authors
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*      http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+
+function DataBlock(numDataCodewords,  codewords)
+{
+	this.numDataCodewords = numDataCodewords;
+	this.codewords = codewords;
+	
+	this.__defineGetter__("NumDataCodewords", function()
+	{
+		return this.numDataCodewords;
+	});
+	this.__defineGetter__("Codewords", function()
+	{
+		return this.codewords;
+	});
+}	
+	
+DataBlock.getDataBlocks=function(rawCodewords,  version,  ecLevel)
+{
+	
+	if (rawCodewords.length != version.TotalCodewords)
+	{
+		throw "ArgumentException";
+	}
+	
+	// Figure out the number and size of data blocks used by this version and
+	// error correction level
+	var ecBlocks = version.getECBlocksForLevel(ecLevel);
+	
+	// First count the total number of data blocks
+	var totalBlocks = 0;
+	var ecBlockArray = ecBlocks.getECBlocks();
+	for (var i = 0; i < ecBlockArray.length; i++)
+	{
+		totalBlocks += ecBlockArray[i].Count;
+	}
+	
+	// Now establish DataBlocks of the appropriate size and number of data codewords
+	var result = new Array(totalBlocks);
+	var numResultBlocks = 0;
+	for (var j = 0; j < ecBlockArray.length; j++)
+	{
+		var ecBlock = ecBlockArray[j];
+		for (var i = 0; i < ecBlock.Count; i++)
+		{
+			var numDataCodewords = ecBlock.DataCodewords;
+			var numBlockCodewords = ecBlocks.ECCodewordsPerBlock + numDataCodewords;
+			result[numResultBlocks++] = new DataBlock(numDataCodewords, new Array(numBlockCodewords));
+		}
+	}
+	
+	// All blocks have the same amount of data, except that the last n
+	// (where n may be 0) have 1 more byte. Figure out where these start.
+	var shorterBlocksTotalCodewords = result[0].codewords.length;
+	var longerBlocksStartAt = result.length - 1;
+	while (longerBlocksStartAt >= 0)
+	{
+		var numCodewords = result[longerBlocksStartAt].codewords.length;
+		if (numCodewords == shorterBlocksTotalCodewords)
+		{
+			break;
+		}
+		longerBlocksStartAt--;
+	}
+	longerBlocksStartAt++;
+	
+	var shorterBlocksNumDataCodewords = shorterBlocksTotalCodewords - ecBlocks.ECCodewordsPerBlock;
+	// The last elements of result may be 1 element longer;
+	// first fill out as many elements as all of them have
+	var rawCodewordsOffset = 0;
+	for (var i = 0; i < shorterBlocksNumDataCodewords; i++)
+	{
+		for (var j = 0; j < numResultBlocks; j++)
+		{
+			result[j].codewords[i] = rawCodewords[rawCodewordsOffset++];
+		}
+	}
+	// Fill out the last data block in the longer ones
+	for (var j = longerBlocksStartAt; j < numResultBlocks; j++)
+	{
+		result[j].codewords[shorterBlocksNumDataCodewords] = rawCodewords[rawCodewordsOffset++];
+	}
+	// Now add in error correction blocks
+	var max = result[0].codewords.length;
+	for (var i = shorterBlocksNumDataCodewords; i < max; i++)
+	{
+		for (var j = 0; j < numResultBlocks; j++)
+		{
+			var iOffset = j < longerBlocksStartAt?i:i + 1;
+			result[j].codewords[iOffset] = rawCodewords[rawCodewordsOffset++];
+		}
+	}
+	return result;
+}
+/*
+  Ported to JavaScript by Lazar Laszlo 2011 
+  
+  [e-mail], www.lazarsoft.info
+  
+*/
+
+/*
+*
+* Copyright 2007 ZXing authors
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*      http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+
+function BitMatrixParser(bitMatrix)
+{
+	var dimension = bitMatrix.Dimension;
+	if (dimension < 21 || (dimension & 0x03) != 1)
+	{
+		throw "Error BitMatrixParser";
+	}
+	this.bitMatrix = bitMatrix;
+	this.parsedVersion = null;
+	this.parsedFormatInfo = null;
+	
+	this.copyBit=function( i,  j,  versionBits)
+	{
+		return this.bitMatrix.get_Renamed(i, j)?(versionBits << 1) | 0x1:versionBits << 1;
+	}
+	
+	this.readFormatInformation=function()
+	{
+			if (this.parsedFormatInfo != null)
+			{
+				return this.parsedFormatInfo;
+			}
+			
+			// Read top-left format info bits
+			var formatInfoBits = 0;
+			for (var i = 0; i < 6; i++)
+			{
+				formatInfoBits = this.copyBit(i, 8, formatInfoBits);
+			}
+			// .. and skip a bit in the timing pattern ...
+			formatInfoBits = this.copyBit(7, 8, formatInfoBits);
+			formatInfoBits = this.copyBit(8, 8, formatInfoBits);
+			formatInfoBits = this.copyBit(8, 7, formatInfoBits);
+			// .. and skip a bit in the timing pattern ...
+			for (var j = 5; j >= 0; j--)
+			{
+				formatInfoBits = this.copyBit(8, j, formatInfoBits);
+			}
+			
+			this.parsedFormatInfo = FormatInformation.decodeFormatInformation(formatInfoBits);
+			if (this.parsedFormatInfo != null)
+			{
+				return this.parsedFormatInfo;
+			}
+			
+			// Hmm, failed. Try the top-right/bottom-left pattern
+			var dimension = this.bitMatrix.Dimension;
+			formatInfoBits = 0;
+			var iMin = dimension - 8;
+			for (var i = dimension - 1; i >= iMin; i--)
+			{
+				formatInfoBits = this.copyBit(i, 8, formatInfoBits);
+			}
+			for (var j = dimension - 7; j < dimension; j++)
+			{
+				formatInfoBits = this.copyBit(8, j, formatInfoBits);
+			}
+			
+			this.parsedFormatInfo = FormatInformation.decodeFormatInformation(formatInfoBits);
+			if (this.parsedFormatInfo != null)
+			{
+				return this.parsedFormatInfo;
+			}
+			throw "Error readFormatInformation";	
+	}
+	this.readVersion=function()
+		{
+			
+			if (this.parsedVersion != null)
+			{
+				return this.parsedVersion;
+			}
+			
+			var dimension = this.bitMatrix.Dimension;
+			
+			var provisionalVersion = (dimension - 17) >> 2;
+			if (provisionalVersion <= 6)
+			{
+				return Version.getVersionForNumber(provisionalVersion);
+			}
+			
+			// Read top-right version info: 3 wide by 6 tall
+			var versionBits = 0;
+			var ijMin = dimension - 11;
+			for (var j = 5; j >= 0; j--)
+			{
+				for (var i = dimension - 9; i >= ijMin; i--)
+				{
+					versionBits = this.copyBit(i, j, versionBits);
+				}
+			}
+			
+			this.parsedVersion = Version.decodeVersionInformation(versionBits);
+			if (this.parsedVersion != null && this.parsedVersion.DimensionForVersion == dimension)
+			{
+				return this.parsedVersion;
+			}
+			
+			// Hmm, failed. Try bottom left: 6 wide by 3 tall
+			versionBits = 0;
+			for (var i = 5; i >= 0; i--)
+			{
+				for (var j = dimension - 9; j >= ijMin; j--)
+				{
+					versionBits = this.copyBit(i, j, versionBits);
+				}
+			}
+			
+			this.parsedVersion = Version.decodeVersionInformation(versionBits);
+			if (this.parsedVersion != null && this.parsedVersion.DimensionForVersion == dimension)
+			{
+				return this.parsedVersion;
+			}
+			throw "Error readVersion";
+		}
+	this.readCodewords=function()
+		{
+			
+			var formatInfo = this.readFormatInformation();
+			var version = this.readVersion();
+			
+			// Get the data mask for the format used in this QR Code. This will exclude
+			// some bits from reading as we wind through the bit matrix.
+			var dataMask = DataMask.forReference( formatInfo.DataMask);
+			var dimension = this.bitMatrix.Dimension;
+			dataMask.unmaskBitMatrix(this.bitMatrix, dimension);
+			
+			var functionPattern = version.buildFunctionPattern();
+			
+			var readingUp = true;
+			var result = new Array(version.TotalCodewords);
+			var resultOffset = 0;
+			var currentByte = 0;
+			var bitsRead = 0;
+			// Read columns in pairs, from right to left
+			for (var j = dimension - 1; j > 0; j -= 2)
+			{
+				if (j == 6)
+				{
+					// Skip whole column with vertical alignment pattern;
+					// saves time and makes the other code proceed more cleanly
+					j--;
+				}
+				// Read alternatingly from bottom to top then top to bottom
+				for (var count = 0; count < dimension; count++)
+				{
+					var i = readingUp?dimension - 1 - count:count;
+					for (var col = 0; col < 2; col++)
+					{
+						// Ignore bits covered by the function pattern
+						if (!functionPattern.get_Renamed(j - col, i))
+						{
+							// Read a bit
+							bitsRead++;
+							currentByte <<= 1;
+							if (this.bitMatrix.get_Renamed(j - col, i))
+							{
+								currentByte |= 1;
+							}
+							// If we've made a whole byte, save it off
+							if (bitsRead == 8)
+							{
+								result[resultOffset++] =  currentByte;
+								bitsRead = 0;
+								currentByte = 0;
+							}
+						}
+					}
+				}
+				readingUp ^= true; // readingUp = !readingUp; // switch directions
+			}
+			if (resultOffset != version.TotalCodewords)
+			{
+				throw "Error readCodewords";
+			}
+			return result;
+		}
+}/*
+  Ported to JavaScript by Lazar Laszlo 2011
+
+  [e-mail], www.lazarsoft.info
+
+*/
+
+/*
+*
+* Copyright 2007 ZXing authors
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*      http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+
+var DataMask = {};
+
+DataMask.forReference = function(reference)
+{
+	if (reference < 0 || reference > 7)
+	{
+		throw "System.ArgumentException";
+	}
+	return DataMask.DATA_MASKS[reference];
+}
+
+function DataMask000()
+{
+	this.unmaskBitMatrix=function(bits,  dimension)
+	{
+		for (var i = 0; i < dimension; i++)
+		{
+			for (var j = 0; j < dimension; j++)
+			{
+				if (this.isMasked(i, j))
+				{
+					bits.flip(j, i);
+				}
+			}
+		}
+	}
+	this.isMasked=function( i,  j)
+	{
+		return ((i + j) & 0x01) == 0;
+	}
+}
+
+function DataMask001()
+{
+	this.unmaskBitMatrix=function(bits,  dimension)
+	{
+		for (var i = 0; i < dimension; i++)
+		{
+			for (var j = 0; j < dimension; j++)
+			{
+				if (this.isMasked(i, j))
+				{
+					bits.flip(j, i);
+				}
+			}
+		}
+	}
+	this.isMasked=function( i,  j)
+	{
+		return (i & 0x01) == 0;
+	}
+}
+
+function DataMask010()
+{
+	this.unmaskBitMatrix=function(bits,  dimension)
+	{
+		for (var i = 0; i < dimension; i++)
+		{
+			for (var j = 0; j < dimension; j++)
+			{
+				if (this.isMasked(i, j))
+				{
+					bits.flip(j, i);
+				}
+			}
+		}
+	}
+	this.isMasked=function( i,  j)
+	{
+		return j % 3 == 0;
+	}
+}
+
+function DataMask011()
+{
+	this.unmaskBitMatrix=function(bits,  dimension)
+	{
+		for (var i = 0; i < dimension; i++)
+		{
+			for (var j = 0; j < dimension; j++)
+			{
+				if (this.isMasked(i, j))
+				{
+					bits.flip(j, i);
+				}
+			}
+		}
+	}
+	this.isMasked=function( i,  j)
+	{
+		return (i + j) % 3 == 0;
+	}
+}
+
+function DataMask100()
+{
+	this.unmaskBitMatrix=function(bits,  dimension)
+	{
+		for (var i = 0; i < dimension; i++)
+		{
+			for (var j = 0; j < dimension; j++)
+			{
+				if (this.isMasked(i, j))
+				{
+					bits.flip(j, i);
+				}
+			}
+		}
+	}
+	this.isMasked=function( i,  j)
+	{
+		return (((URShift(i, 1)) + (j / 3)) & 0x01) == 0;
+	}
+}
+
+function DataMask101()
+{
+	this.unmaskBitMatrix=function(bits,  dimension)
+	{
+		for (var i = 0; i < dimension; i++)
+		{
+			for (var j = 0; j < dimension; j++)
+			{
+				if (this.isMasked(i, j))
+				{
+					bits.flip(j, i);
+				}
+			}
+		}
+	}
+	this.isMasked=function( i,  j)
+	{
+		var temp = i * j;
+		return (temp & 0x01) + (temp % 3) == 0;
+	}
+}
+
+function DataMask110()
+{
+	this.unmaskBitMatrix=function(bits,  dimension)
+	{
+		for (var i = 0; i < dimension; i++)
+		{
+			for (var j = 0; j < dimension; j++)
+			{
+				if (this.isMasked(i, j))
+				{
+					bits.flip(j, i);
+				}
+			}
+		}
+	}
+	this.isMasked=function( i,  j)
+	{
+		var temp = i * j;
+		return (((temp & 0x01) + (temp % 3)) & 0x01) == 0;
+	}
+}
+function DataMask111()
+{
+	this.unmaskBitMatrix=function(bits,  dimension)
+	{
+		for (var i = 0; i < dimension; i++)
+		{
+			for (var j = 0; j < dimension; j++)
+			{
+				if (this.isMasked(i, j))
+				{
+					bits.flip(j, i);
+				}
+			}
+		}
+	}
+	this.isMasked=function( i,  j)
+	{
+		return ((((i + j) & 0x01) + ((i * j) % 3)) & 0x01) == 0;
+	}
+}
+
+DataMask.DATA_MASKS = new Array(new DataMask000(), new DataMask001(), new DataMask010(), new DataMask011(), new DataMask100(), new DataMask101(), new DataMask110(), new DataMask111());
+
+/*
+  Ported to JavaScript by Lazar Laszlo 2011 
+  
+  [e-mail], www.lazarsoft.info
+  
+*/
+
+/*
+*
+* Copyright 2007 ZXing authors
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*      http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+
+function ReedSolomonDecoder(field)
+{
+	this.field = field;
+	this.decode=function(received,  twoS)
+	{
+			var poly = new GF256Poly(this.field, received);
+			var syndromeCoefficients = new Array(twoS);
+			for(var i=0;i<syndromeCoefficients.length;i++)syndromeCoefficients[i]=0;
+			var dataMatrix = false;//this.field.Equals(GF256.DATA_MATRIX_FIELD);
+			var noError = true;
+			for (var i = 0; i < twoS; i++)
+			{
+				// Thanks to sanfordsquires for this fix:
+				var eval = poly.evaluateAt(this.field.exp(dataMatrix?i + 1:i));
+				syndromeCoefficients[syndromeCoefficients.length - 1 - i] = eval;
+				if (eval != 0)
+				{
+					noError = false;
+				}
+			}
+			if (noError)
+			{
+				return ;
+			}
+			var syndrome = new GF256Poly(this.field, syndromeCoefficients);
+			var sigmaOmega = this.runEuclideanAlgorithm(this.field.buildMonomial(twoS, 1), syndrome, twoS);
+			var sigma = sigmaOmega[0];
+			var omega = sigmaOmega[1];
+			var errorLocations = this.findErrorLocations(sigma);
+			var errorMagnitudes = this.findErrorMagnitudes(omega, errorLocations, dataMatrix);
+			for (var i = 0; i < errorLocations.length; i++)
+			{
+				var position = received.length - 1 - this.field.log(errorLocations[i]);
+				if (position < 0)
+				{
+					throw "ReedSolomonException Bad error location";
+				}
+				received[position] = GF256.addOrSubtract(received[position], errorMagnitudes[i]);
+			}
+	}
+	
+	this.runEuclideanAlgorithm=function( a,  b,  R)
+		{
+			// Assume a's degree is >= b's
+			if (a.Degree < b.Degree)
+			{
+				var temp = a;
+				a = b;
+				b = temp;
+			}
+			
+			var rLast = a;
+			var r = b;
+			var sLast = this.field.One;
+			var s = this.field.Zero;
+			var tLast = this.field.Zero;
+			var t = this.field.One;
+			
+			// Run Euclidean algorithm until r's degree is less than R/2
+			while (r.Degree >= Math.floor(R / 2))
+			{
+				var rLastLast = rLast;
+				var sLastLast = sLast;
+				var tLastLast = tLast;
+				rLast = r;
+				sLast = s;
+				tLast = t;
+				
+				// Divide rLastLast by rLast, with quotient in q and remainder in r
+				if (rLast.Zero)
+				{
+					// Oops, Euclidean algorithm already terminated?
+					throw "r_{i-1} was zero";
+				}
+				r = rLastLast;
+				var q = this.field.Zero;
+				var denominatorLeadingTerm = rLast.getCoefficient(rLast.Degree);
+				var dltInverse = this.field.inverse(denominatorLeadingTerm);
+				while (r.Degree >= rLast.Degree && !r.Zero)
+				{
+					var degreeDiff = r.Degree - rLast.Degree;
+					var scale = this.field.multiply(r.getCoefficient(r.Degree), dltInverse);
+					q = q.addOrSubtract(this.field.buildMonomial(degreeDiff, scale));
+					r = r.addOrSubtract(rLast.multiplyByMonomial(degreeDiff, scale));
+					//r.EXE();
+				}
+				
+				s = q.multiply1(sLast).addOrSubtract(sLastLast);
+				t = q.multiply1(tLast).addOrSubtract(tLastLast);
+			}
+			
+			var sigmaTildeAtZero = t.getCoefficient(0);
+			if (sigmaTildeAtZero == 0)
+			{
+				throw "ReedSolomonException sigmaTilde(0) was zero";
+			}
+			
+			var inverse = this.field.inverse(sigmaTildeAtZero);
+			var sigma = t.multiply2(inverse);
+			var omega = r.multiply2(inverse);
+			return new Array(sigma, omega);
+		}
+	this.findErrorLocations=function( errorLocator)
+		{
+			// This is a direct application of Chien's search
+			var numErrors = errorLocator.Degree;
+			if (numErrors == 1)
+			{
+				// shortcut
+				return new Array(errorLocator.getCoefficient(1));
+			}
+			var result = new Array(numErrors);
+			var e = 0;
+			for (var i = 1; i < 256 && e < numErrors; i++)
+			{
+				if (errorLocator.evaluateAt(i) == 0)
+				{
+					result[e] = this.field.inverse(i);
+					e++;
+				}
+			}
+			if (e != numErrors)
+			{
+				throw "Error locator degree does not match number of roots";
+			}
+			return result;
+		}
+	this.findErrorMagnitudes=function( errorEvaluator,  errorLocations,  dataMatrix)
+		{
+			// This is directly applying Forney's Formula
+			var s = errorLocations.length;
+			var result = new Array(s);
+			for (var i = 0; i < s; i++)
+			{
+				var xiInverse = this.field.inverse(errorLocations[i]);
+				var denominator = 1;
+				for (var j = 0; j < s; j++)
+				{
+					if (i != j)
+					{
+						denominator = this.field.multiply(denominator, GF256.addOrSubtract(1, this.field.multiply(errorLocations[j], xiInverse)));
+					}
+				}
+				result[i] = this.field.multiply(errorEvaluator.evaluateAt(xiInverse), this.field.inverse(denominator));
+				// Thanks to sanfordsquires for this fix:
+				if (dataMatrix)
+				{
+					result[i] = this.field.multiply(result[i], xiInverse);
+				}
+			}
+			return result;
+		}
+}/*
+  Ported to JavaScript by Lazar Laszlo 2011 
+  
+  [e-mail], www.lazarsoft.info
+  
+*/
+
+/*
+*
+* Copyright 2007 ZXing authors
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*      http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+
+function GF256Poly(field,  coefficients)
+{
+	if (coefficients == null || coefficients.length == 0)
+	{
+		throw "System.ArgumentException";
+	}
+	this.field = field;
+	var coefficientsLength = coefficients.length;
+	if (coefficientsLength > 1 && coefficients[0] == 0)
+	{
+		// Leading term must be non-zero for anything except the constant polynomial "0"
+		var firstNonZero = 1;
+		while (firstNonZero < coefficientsLength && coefficients[firstNonZero] == 0)
+		{
+			firstNonZero++;
+		}
+		if (firstNonZero == coefficientsLength)
+		{
+			this.coefficients = field.Zero.coefficients;
+		}
+		else
+		{
+			this.coefficients = new Array(coefficientsLength - firstNonZero);
+			for(var i=0;i<this.coefficients.length;i++)this.coefficients[i]=0;
+			//Array.Copy(coefficients, firstNonZero, this.coefficients, 0, this.coefficients.length);
+			for(var ci=0;ci<this.coefficients.length;ci++)this.coefficients[ci]=coefficients[firstNonZero+ci];
+		}
+	}
+	else
+	{
+		this.coefficients = coefficients;
+	}
+	
+	this.__defineGetter__("Zero", function()
+	{
+		return this.coefficients[0] == 0;
+	});
+	this.__defineGetter__("Degree", function()
+	{
+		return this.coefficients.length - 1;
+	});
+	this.__defineGetter__("Coefficients", function()
+	{
+		return this.coefficients;
+	});
+	
+	this.getCoefficient=function( degree)
+	{
+		return this.coefficients[this.coefficients.length - 1 - degree];
+	}
+	
+	this.evaluateAt=function( a)
+	{
+		if (a == 0)
+		{
+			// Just return the x^0 coefficient
+			return this.getCoefficient(0);
+		}
+		var size = this.coefficients.length;
+		if (a == 1)
+		{
+			// Just the sum of the coefficients
+			var result = 0;
+			for (var i = 0; i < size; i++)
+			{
+				result = GF256.addOrSubtract(result, this.coefficients[i]);
+			}
+			return result;
+		}
+		var result2 = this.coefficients[0];
+		for (var i = 1; i < size; i++)
+		{
+			result2 = GF256.addOrSubtract(this.field.multiply(a, result2), this.coefficients[i]);
+		}
+		return result2;
+	}
+	
+	this.addOrSubtract=function( other)
+		{
+			if (this.field != other.field)
+			{
+				throw "GF256Polys do not have same GF256 field";
+			}
+			if (this.Zero)
+			{
+				return other;
+			}
+			if (other.Zero)
+			{
+				return this;
+			}
+			
+			var smallerCoefficients = this.coefficients;
+			var largerCoefficients = other.coefficients;
+			if (smallerCoefficients.length > largerCoefficients.length)
+			{
+				var temp = smallerCoefficients;
+				smallerCoefficients = largerCoefficients;
+				largerCoefficients = temp;
+			}
+			var sumDiff = new Array(largerCoefficients.length);
+			var lengthDiff = largerCoefficients.length - smallerCoefficients.length;
+			// Copy high-order terms only found in higher-degree polynomial's coefficients
+			//Array.Copy(largerCoefficients, 0, sumDiff, 0, lengthDiff);
+			for(var ci=0;ci<lengthDiff;ci++)sumDiff[ci]=largerCoefficients[ci];
+			
+			for (var i = lengthDiff; i < largerCoefficients.length; i++)
+			{
+				sumDiff[i] = GF256.addOrSubtract(smallerCoefficients[i - lengthDiff], largerCoefficients[i]);
+			}
+			
+			return new GF256Poly(field, sumDiff);
+	}
+	this.multiply1=function( other)
+		{
+			if (this.field!=other.field)
+			{
+				throw "GF256Polys do not have same GF256 field";
+			}
+			if (this.Zero || other.Zero)
+			{
+				return this.field.Zero;
+			}
+			var aCoefficients = this.coefficients;
+			var aLength = aCoefficients.length;
+			var bCoefficients = other.coefficients;
+			var bLength = bCoefficients.length;
+			var product = new Array(aLength + bLength - 1);
+			for (var i = 0; i < aLength; i++)
+			{
+				var aCoeff = aCoefficients[i];
+				for (var j = 0; j < bLength; j++)
+				{
+					product[i + j] = GF256.addOrSubtract(product[i + j], this.field.multiply(aCoeff, bCoefficients[j]));
+				}
+			}
+			return new GF256Poly(this.field, product);
+		}
+	this.multiply2=function( scalar)
+		{
+			if (scalar == 0)
+			{
+				return this.field.Zero;
+			}
+			if (scalar == 1)
+			{
+				return this;
+			}
+			var size = this.coefficients.length;
+			var product = new Array(size);
+			for (var i = 0; i < size; i++)
+			{
+				product[i] = this.field.multiply(this.coefficients[i], scalar);
+			}
+			return new GF256Poly(this.field, product);
+		}
+	this.multiplyByMonomial=function( degree,  coefficient)
+		{
+			if (degree < 0)
+			{
+				throw "System.ArgumentException";
+			}
+			if (coefficient == 0)
+			{
+				return this.field.Zero;
+			}
+			var size = this.coefficients.length;
+			var product = new Array(size + degree);
+			for(var i=0;i<product.length;i++)product[i]=0;
+			for (var i = 0; i < size; i++)
+			{
+				product[i] = this.field.multiply(this.coefficients[i], coefficient);
+			}
+			return new GF256Poly(this.field, product);
+		}
+	this.divide=function( other)
+		{
+			if (this.field!=other.field)
+			{
+				throw "GF256Polys do not have same GF256 field";
+			}
+			if (other.Zero)
+			{
+				throw "Divide by 0";
+			}
+			
+			var quotient = this.field.Zero;
+			var remainder = this;
+			
+			var denominatorLeadingTerm = other.getCoefficient(other.Degree);
+			var inverseDenominatorLeadingTerm = this.field.inverse(denominatorLeadingTerm);
+			
+			while (remainder.Degree >= other.Degree && !remainder.Zero)
+			{
+				var degreeDifference = remainder.Degree - other.Degree;
+				var scale = this.field.multiply(remainder.getCoefficient(remainder.Degree), inverseDenominatorLeadingTerm);
+				var term = other.multiplyByMonomial(degreeDifference, scale);
+				var iterationQuotient = this.field.buildMonomial(degreeDifference, scale);
+				quotient = quotient.addOrSubtract(iterationQuotient);
+				remainder = remainder.addOrSubtract(term);
+			}
+			
+			return new Array(quotient, remainder);
+		}
+}/*
+  Ported to JavaScript by Lazar Laszlo 2011
+
+  [e-mail], www.lazarsoft.info
+
+*/
+
+/*
+*
+* Copyright 2007 ZXing authors
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*      http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+
+function GF256( primitive)
+{
+	this.expTable = new Array(256);
+	this.logTable = new Array(256);
+	var x = 1;
+	for (var i = 0; i < 256; i++)
+	{
+		this.expTable[i] = x;
+		x <<= 1; // x = x * 2; we're assuming the generator alpha is 2
+		if (x >= 0x100)
+		{
+			x ^= primitive;
+		}
+	}
+	for (var i = 0; i < 255; i++)
+	{
+		this.logTable[this.expTable[i]] = i;
+	}
+	// logTable[0] == 0 but this should never be used
+	var at0=new Array(1);at0[0]=0;
+	this.zero = new GF256Poly(this, new Array(at0));
+	var at1=new Array(1);at1[0]=1;
+	this.one = new GF256Poly(this, new Array(at1));
+
+	this.__defineGetter__("Zero", function()
+	{
+		return this.zero;
+	});
+	this.__defineGetter__("One", function()
+	{
+		return this.one;
+	});
+	this.buildMonomial=function( degree,  coefficient)
+		{
+			if (degree < 0)
+			{
+				throw "System.ArgumentException";
+			}
+			if (coefficient == 0)
+			{
+				return zero;
+			}
+			var coefficients = new Array(degree + 1);
+			for(var i=0;i<coefficients.length;i++)coefficients[i]=0;
+			coefficients[0] = coefficient;
+			return new GF256Poly(this, coefficients);
+		}
+	this.exp=function( a)
+		{
+			return this.expTable[a];
+		}
+	this.log=function( a)
+		{
+			if (a == 0)
+			{
+				throw "System.ArgumentException";
+			}
+			return this.logTable[a];
+		}
+	this.inverse=function( a)
+		{
+			if (a == 0)
+			{
+				throw "System.ArithmeticException";
+			}
+			return this.expTable[255 - this.logTable[a]];
+		}
+	this.multiply=function( a,  b)
+		{
+			if (a == 0 || b == 0)
+			{
+				return 0;
+			}
+			if (a == 1)
+			{
+				return b;
+			}
+			if (b == 1)
+			{
+				return a;
+			}
+			return this.expTable[(this.logTable[a] + this.logTable[b]) % 255];
+		}
+}
+
+GF256.QR_CODE_FIELD = new GF256(0x011D);
+GF256.DATA_MATRIX_FIELD = new GF256(0x012D);
+
+GF256.addOrSubtract=function( a,  b)
+{
+	return a ^ b;
+}/*
+  Ported to JavaScript by Lazar Laszlo 2011
+
+  [e-mail], www.lazarsoft.info
+
+*/
+
+/*
+*
+* Copyright 2007 ZXing authors
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*      http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+
+var Decoder={};
+Decoder.rsDecoder = new ReedSolomonDecoder(GF256.QR_CODE_FIELD);
+
+Decoder.correctErrors=function( codewordBytes,  numDataCodewords)
+{
+	var numCodewords = codewordBytes.length;
+	// First read into an array of ints
+	var codewordsInts = new Array(numCodewords);
+	for (var i = 0; i < numCodewords; i++)
+	{
+		codewordsInts[i] = codewordBytes[i] & 0xFF;
+	}
+	var numECCodewords = codewordBytes.length - numDataCodewords;
+	try
+	{
+		Decoder.rsDecoder.decode(codewordsInts, numECCodewords);
+		//var corrector = new ReedSolomon(codewordsInts, numECCodewords);
+		//corrector.correct();
+	}
+	catch ( rse)
+	{
+		throw rse;
+	}
+	// Copy back into array of bytes -- only need to worry about the bytes that were data
+	// We don't care about errors in the error-correction codewords
+	for (var i = 0; i < numDataCodewords; i++)
+	{
+		codewordBytes[i] =  codewordsInts[i];
+	}
+}
+
+Decoder.decode=function(bits)
+{
+	var parser = new BitMatrixParser(bits);
+	var version = parser.readVersion();
+	var ecLevel = parser.readFormatInformation().ErrorCorrectionLevel;
+
+	// Read codewords
+	var codewords = parser.readCodewords();
+
+	// Separate into data blocks
+	var dataBlocks = DataBlock.getDataBlocks(codewords, version, ecLevel);
+
+	// Count total number of data bytes
+	var totalBytes = 0;
+	for (var i = 0; i < dataBlocks.Length; i++)
+	{
+		totalBytes += dataBlocks[i].NumDataCodewords;
+	}
+	var resultBytes = new Array(totalBytes);
+	var resultOffset = 0;
+
+	// Error-correct and copy data blocks together into a stream of bytes
+	for (var j = 0; j < dataBlocks.length; j++)
+	{
+		var dataBlock = dataBlocks[j];
+		var codewordBytes = dataBlock.Codewords;
+		var numDataCodewords = dataBlock.NumDataCodewords;
+		Decoder.correctErrors(codewordBytes, numDataCodewords);
+		for (var i = 0; i < numDataCodewords; i++)
+		{
+			resultBytes[resultOffset++] = codewordBytes[i];
+		}
+	}
+
+	// Decode the contents of that stream of bytes
+	var reader = new QRCodeDataBlockReader(resultBytes, version.VersionNumber, ecLevel.Bits);
+	return reader;
+	//return DecodedBitStreamParser.decode(resultBytes, version, ecLevel);
+}
+/*
+   Copyright 2011 Lazar Laszlo ([e-mail], www.lazarsoft.info)
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.
+*/
+
+
+var qrcode = {};
+qrcode.imagedata = null;
+qrcode.width = 0;
+qrcode.height = 0;
+qrcode.qrCodeSymbol = null;
+qrcode.debug = false;
+
+qrcode.sizeOfDataLengthInfo =  [  [ 10, 9, 8, 8 ],  [ 12, 11, 16, 10 ],  [ 14, 13, 16, 12 ] ];
+
+qrcode.callback = null;
+
+qrcode.decode = function(src){
+
+	if(arguments.length==0)
+	{
+		var canvas_qr = document.getElementById("qr-canvas");
+		var context = canvas_qr.getContext('2d');
+		qrcode.width = canvas_qr.width;
+		qrcode.height = canvas_qr.height;
+		qrcode.imagedata = context.getImageData(0, 0, qrcode.width, qrcode.height);
+        qrcode.result = qrcode.process(context);
+        if(qrcode.callback!=null)
+            qrcode.callback(qrcode.result);
+		return qrcode.result;
+	}
+	else
+	{
+		var image = new Image();
+		image.onload=function(){
+			//var canvas_qr = document.getElementById("qr-canvas");
+			var canvas_qr = document.createElement('canvas');
+			var context = canvas_qr.getContext('2d');
+			var canvas_out = document.getElementById("out-canvas");
+			if(canvas_out!=null)
+            {
+                var outctx = canvas_out.getContext('2d');
+                outctx.clearRect(0, 0, 320, 240);
+				outctx.drawImage(image, 0, 0, 320, 240);
+            }
+			canvas_qr.width = image.width;
+			canvas_qr.height = image.height;
+            context.drawImage(image, 0, 0);
+			qrcode.width = image.width;
+			qrcode.height = image.height;
+			try{
+				qrcode.imagedata = context.getImageData(0, 0, image.width, image.height);
+			}catch(e){
+				qrcode.result = "Cross domain image reading not supported in your browser! Save it to your computer then drag and drop the file!";
+				if(qrcode.callback!=null)
+					qrcode.callback(qrcode.result);
+				return;
+			}
+
+            try
+            {
+                qrcode.result = qrcode.process(context);
+            }
+            catch(e)
+            {
+				console.log(e);
+                qrcode.result = "error decoding QR Code";
+            }
+			if(qrcode.callback!=null)
+				qrcode.callback(qrcode.result);
+		}
+		image.src = src;
+	}
+}
+
+qrcode.decode_utf8 = function ( s )
+{
+  return decodeURIComponent( escape( s ) );
+}
+
+qrcode.process = function(ctx){
+
+	var start = new Date().getTime();
+
+	var image = qrcode.grayScaleToBitmap(qrcode.grayscale());
+    //var image = qrcode.binarize(128);
+
+    if(qrcode.debug)
+    {
+        for (var y = 0; y < qrcode.height; y++)
+        {
+            for (var x = 0; x < qrcode.width; x++)
+            {
+                var point = (x * 4) + (y * qrcode.width * 4);
+                qrcode.imagedata.data[point] = image[x+y*qrcode.width]?0:0;
+                qrcode.imagedata.data[point+1] = image[x+y*qrcode.width]?0:0;
+                qrcode.imagedata.data[point+2] = image[x+y*qrcode.width]?255:0;
+            }
+        }
+        ctx.putImageData(qrcode.imagedata, 0, 0);
+    }
+
+	//var finderPatternInfo = new FinderPatternFinder().findFinderPattern(image);
+
+	var detector = new Detector(image);
+
+	var qRCodeMatrix = detector.detect();
+
+	/*for (var y = 0; y < qRCodeMatrix.bits.Height; y++)
+	{
+		for (var x = 0; x < qRCodeMatrix.bits.Width; x++)
+		{
+			var point = (x * 4*2) + (y*2 * qrcode.width * 4);
+			qrcode.imagedata.data[point] = qRCodeMatrix.bits.get_Renamed(x,y)?0:0;
+			qrcode.imagedata.data[point+1] = qRCodeMatrix.bits.get_Renamed(x,y)?0:0;
+			qrcode.imagedata.data[point+2] = qRCodeMatrix.bits.get_Renamed(x,y)?255:0;
+		}
+	}*/
+    if(qrcode.debug)
+        ctx.putImageData(qrcode.imagedata, 0, 0);
+
+	var reader = Decoder.decode(qRCodeMatrix.bits);
+	var data = reader.DataByte;
+	var str="";
+	for(var i=0;i<data.length;i++)
+	{
+		for(var j=0;j<data[i].length;j++)
+			str+=String.fromCharCode(data[i][j]);
+	}
+
+	var end = new Date().getTime();
+	var time = end - start;
+	console.log(time);
+
+	return qrcode.decode_utf8(str);
+	//alert("Time:" + time + " Code: "+str);
+}
+
+qrcode.getPixel = function(x,y){
+	if (qrcode.width < x) {
+		throw "point error";
+	}
+	if (qrcode.height < y) {
+		throw "point error";
+	}
+	var point = (x * 4) + (y * qrcode.width * 4);
+	var p = (qrcode.imagedata.data[point]*33 + qrcode.imagedata.data[point + 1]*34 + qrcode.imagedata.data[point + 2]*33)/100;
+	return p;
+}
+
+qrcode.binarize = function(th){
+	var ret = new Array(qrcode.width*qrcode.height);
+	for (var y = 0; y < qrcode.height; y++)
+	{
+		for (var x = 0; x < qrcode.width; x++)
+		{
+			var gray = qrcode.getPixel(x, y);
+
+			ret[x+y*qrcode.width] = gray<=th?true:false;
+		}
+	}
+	return ret;
+}
+
+qrcode.getMiddleBrightnessPerArea=function(image)
+{
+	var numSqrtArea = 4;
+	//obtain middle brightness((min + max) / 2) per area
+	var areaWidth = Math.floor(qrcode.width / numSqrtArea);
+	var areaHeight = Math.floor(qrcode.height / numSqrtArea);
+	var minmax = new Array(numSqrtArea);
+	for (var i = 0; i < numSqrtArea; i++)
+	{
+		minmax[i] = new Array(numSqrtArea);
+		for (var i2 = 0; i2 < numSqrtArea; i2++)
+		{
+			minmax[i][i2] = new Array(0,0);
+		}
+	}
+	for (var ay = 0; ay < numSqrtArea; ay++)
+	{
+		for (var ax = 0; ax < numSqrtArea; ax++)
+		{
+			minmax[ax][ay][0] = 0xFF;
+			for (var dy = 0; dy < areaHeight; dy++)
+			{
+				for (var dx = 0; dx < areaWidth; dx++)
+				{
+					var target = image[areaWidth * ax + dx+(areaHeight * ay + dy)*qrcode.width];
+					if (target < minmax[ax][ay][0])
+						minmax[ax][ay][0] = target;
+					if (target > minmax[ax][ay][1])
+						minmax[ax][ay][1] = target;
+				}
+			}
+			//minmax[ax][ay][0] = (minmax[ax][ay][0] + minmax[ax][ay][1]) / 2;
+		}
+	}
+	var middle = new Array(numSqrtArea);
+	for (var i3 = 0; i3 < numSqrtArea; i3++)
+	{
+		middle[i3] = new Array(numSqrtArea);
+	}
+	for (var ay = 0; ay < numSqrtArea; ay++)
+	{
+		for (var ax = 0; ax < numSqrtArea; ax++)
+		{
+			middle[ax][ay] = Math.floor((minmax[ax][ay][0] + minmax[ax][ay][1]) / 2);
+			//Console.out.print(middle[ax][ay] + ",");
+		}
+		//Console.out.println("");
+	}
+	//Console.out.println("");
+
+	return middle;
+}
+
+qrcode.grayScaleToBitmap=function(grayScale)
+{
+	var middle = qrcode.getMiddleBrightnessPerArea(grayScale);
+	var sqrtNumArea = middle.length;
+	var areaWidth = Math.floor(qrcode.width / sqrtNumArea);
+	var areaHeight = Math.floor(qrcode.height / sqrtNumArea);
+	var bitmap = new Array(qrcode.height*qrcode.width);
+
+	for (var ay = 0; ay < sqrtNumArea; ay++)
+	{
+		for (var ax = 0; ax < sqrtNumArea; ax++)
+		{
+			for (var dy = 0; dy < areaHeight; dy++)
+			{
+				for (var dx = 0; dx < areaWidth; dx++)
+				{
+					bitmap[areaWidth * ax + dx+ (areaHeight * ay + dy)*qrcode.width] = (grayScale[areaWidth * ax + dx+ (areaHeight * ay + dy)*qrcode.width] < middle[ax][ay])?true:false;
+				}
+			}
+		}
+	}
+	return bitmap;
+}
+
+qrcode.grayscale = function(){
+	var ret = new Array(qrcode.width*qrcode.height);
+	for (var y = 0; y < qrcode.height; y++)
+	{
+		for (var x = 0; x < qrcode.width; x++)
+		{
+			var gray = qrcode.getPixel(x, y);
+
+			ret[x+y*qrcode.width] = gray;
+		}
+	}
+	return ret;
+}
+
+
+
+
+function URShift( number,  bits)
+{
+	if (number >= 0)
+		return number >> bits;
+	else
+		return (number >> bits) + (2 << ~bits);
+}
+
+
+Array.prototype.remove = function(from, to) {
+  var rest = this.slice((to || from) + 1 || this.length);
+  this.length = from < 0 ? this.length + from : from;
+  return this.push.apply(this, rest);
+};
+/*
+  Ported to JavaScript by Lazar Laszlo 2011
+
+  [e-mail], www.lazarsoft.info
+
+*/
+
+/*
+*
+* Copyright 2007 ZXing authors
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*      http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+
+var MIN_SKIP = 3;
+var MAX_MODULES = 57;
+var INTEGER_MATH_SHIFT = 8;
+var CENTER_QUORUM = 2;
+
+qrcode.orderBestPatterns=function(patterns)
+		{
+
+			function distance( pattern1,  pattern2)
+			{
+				var xDiff = pattern1.X - pattern2.X;
+				var yDiff = pattern1.Y - pattern2.Y;
+				return  Math.sqrt( (xDiff * xDiff + yDiff * yDiff));
+			}
+
+			/// <summary> Returns the z component of the cross product between vectors BC and BA.</summary>
+			function crossProductZ( pointA,  pointB,  pointC)
+			{
+				var bX = pointB.x;
+				var bY = pointB.y;
+				return ((pointC.x - bX) * (pointA.y - bY)) - ((pointC.y - bY) * (pointA.x - bX));
+			}
+
+
+			// Find distances between pattern centers
+			var zeroOneDistance = distance(patterns[0], patterns[1]);
+			var oneTwoDistance = distance(patterns[1], patterns[2]);
+			var zeroTwoDistance = distance(patterns[0], patterns[2]);
+
+			var pointA, pointB, pointC;
+			// Assume one closest to other two is B; A and C will just be guesses at first
+			if (oneTwoDistance >= zeroOneDistance && oneTwoDistance >= zeroTwoDistance)
+			{
+				pointB = patterns[0];
+				pointA = patterns[1];
+				pointC = patterns[2];
+			}
+			else if (zeroTwoDistance >= oneTwoDistance && zeroTwoDistance >= zeroOneDistance)
+			{
+				pointB = patterns[1];
+				pointA = patterns[0];
+				pointC = patterns[2];
+			}
+			else
+			{
+				pointB = patterns[2];
+				pointA = patterns[0];
+				pointC = patterns[1];
+			}
+
+			// Use cross product to figure out whether A and C are correct or flipped.
+			// This asks whether BC x BA has a positive z component, which is the arrangement
+			// we want for A, B, C. If it's negative, then we've got it flipped around and
+			// should swap A and C.
+			if (crossProductZ(pointA, pointB, pointC) < 0.0)
+			{
+				var temp = pointA;
+				pointA = pointC;
+				pointC = temp;
+			}
+
+			patterns[0] = pointA;
+			patterns[1] = pointB;
+			patterns[2] = pointC;
+		}
+
+
+function FinderPattern(posX, posY,  estimatedModuleSize)
+{
+	this.x=posX;
+	this.y=posY;
+	this.count = 1;
+	this.estimatedModuleSize = estimatedModuleSize;
+
+	this.__defineGetter__("EstimatedModuleSize", function()
+	{
+		return this.estimatedModuleSize;
+	});
+	this.__defineGetter__("Count", function()
+	{
+		return this.count;
+	});
+	this.__defineGetter__("X", function()
+	{
+		return this.x;
+	});
+	this.__defineGetter__("Y", function()
+	{
+		return this.y;
+	});
+	this.incrementCount = function()
+	{
+		this.count++;
+	}
+	this.aboutEquals=function( moduleSize,  i,  j)
+		{
+			if (Math.abs(i - this.y) <= moduleSize && Math.abs(j - this.x) <= moduleSize)
+			{
+				var moduleSizeDiff = Math.abs(moduleSize - this.estimatedModuleSize);
+				return moduleSizeDiff <= 1.0 || moduleSizeDiff / this.estimatedModuleSize <= 1.0;
+			}
+			return false;
+		}
+
+}
+
+function FinderPatternInfo(patternCenters)
+{
+	this.bottomLeft = patternCenters[0];
+	this.topLeft = patternCenters[1];
+	this.topRight = patternCenters[2];
+	this.__defineGetter__("BottomLeft", function()
+	{
+		return this.bottomLeft;
+	});
+	this.__defineGetter__("TopLeft", function()
+	{
+		return this.topLeft;
+	});
+	this.__defineGetter__("TopRight", function()
+	{
+		return this.topRight;
+	});
+}
+
+function FinderPatternFinder()
+{
+	this.image=null;
+	this.possibleCenters = [];
+	this.hasSkipped = false;
+	this.crossCheckStateCount = new Array(0,0,0,0,0);
+	this.resultPointCallback = null;
+
+	this.__defineGetter__("CrossCheckStateCount", function()
+	{
+		this.crossCheckStateCount[0] = 0;
+		this.crossCheckStateCount[1] = 0;
+		this.crossCheckStateCount[2] = 0;
+		this.crossCheckStateCount[3] = 0;
+		this.crossCheckStateCount[4] = 0;
+		return this.crossCheckStateCount;
+	});
+
+	this.foundPatternCross=function( stateCount)
+		{
+			var totalModuleSize = 0;
+			for (var i = 0; i < 5; i++)
+			{
+				var count = stateCount[i];
+				if (count == 0)
+				{
+					return false;
+				}
+				totalModuleSize += count;
+			}
+			if (totalModuleSize < 7)
+			{
+				return false;
+			}
+			var moduleSize = Math.floor((totalModuleSize << INTEGER_MATH_SHIFT) / 7);
+			var maxVariance = Math.floor(moduleSize / 2);
+			// Allow less than 50% variance from 1-1-3-1-1 proportions
+			return Math.abs(moduleSize - (stateCount[0] << INTEGER_MATH_SHIFT)) < maxVariance && Math.abs(moduleSize - (stateCount[1] << INTEGER_MATH_SHIFT)) < maxVariance && Math.abs(3 * moduleSize - (stateCount[2] << INTEGER_MATH_SHIFT)) < 3 * maxVariance && Math.abs(moduleSize - (stateCount[3] << INTEGER_MATH_SHIFT)) < maxVariance && Math.abs(moduleSize - (stateCount[4] << INTEGER_MATH_SHIFT)) < maxVariance;
+		}
+	this.centerFromEnd=function( stateCount,  end)
+		{
+			return  (end - stateCount[4] - stateCount[3]) - stateCount[2] / 2.0;
+		}
+	this.crossCheckVertical=function( startI,  centerJ,  maxCount,  originalStateCountTotal)
+		{
+			var image = this.image;
+
+			var maxI = qrcode.height;
+			var stateCount = this.CrossCheckStateCount;
+
+			// Start counting up from center
+			var i = startI;
+			while (i >= 0 && image[centerJ + i*qrcode.width])
+			{
+				stateCount[2]++;
+				i--;
+			}
+			if (i < 0)
+			{
+				return NaN;
+			}
+			while (i >= 0 && !image[centerJ +i*qrcode.width] && stateCount[1] <= maxCount)
+			{
+				stateCount[1]++;
+				i--;
+			}
+			// If already too many modules in this state or ran off the edge:
+			if (i < 0 || stateCount[1] > maxCount)
+			{
+				return NaN;
+			}
+			while (i >= 0 && image[centerJ + i*qrcode.width] && stateCount[0] <= maxCount)
+			{
+				stateCount[0]++;
+				i--;
+			}
+			if (stateCount[0] > maxCount)
+			{
+				return NaN;
+			}
+
+			// Now also count down from center
+			i = startI + 1;
+			while (i < maxI && image[centerJ +i*qrcode.width])
+			{
+				stateCount[2]++;
+				i++;
+			}
+			if (i == maxI)
+			{
+				return NaN;
+			}
+			while (i < maxI && !image[centerJ + i*qrcode.width] && stateCount[3] < maxCount)
+			{
+				stateCount[3]++;
+				i++;
+			}
+			if (i == maxI || stateCount[3] >= maxCount)
+			{
+				return NaN;
+			}
+			while (i < maxI && image[centerJ + i*qrcode.width] && stateCount[4] < maxCount)
+			{
+				stateCount[4]++;
+				i++;
+			}
+			if (stateCount[4] >= maxCount)
+			{
+				return NaN;
+			}
+
+			// If we found a finder-pattern-like section, but its size is more than 40% different than
+			// the original, assume it's a false positive
+			var stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2] + stateCount[3] + stateCount[4];
+			if (5 * Math.abs(stateCountTotal - originalStateCountTotal) >= 2 * originalStateCountTotal)
+			{
+				return NaN;
+			}
+
+			return this.foundPatternCross(stateCount)?this.centerFromEnd(stateCount, i):NaN;
+		}
+	this.crossCheckHorizontal=function( startJ,  centerI,  maxCount, originalStateCountTotal)
+		{
+			var image = this.image;
+
+			var maxJ = qrcode.width;
+			var stateCount = this.CrossCheckStateCount;
+
+			var j = startJ;
+			while (j >= 0 && image[j+ centerI*qrcode.width])
+			{
+				stateCount[2]++;
+				j--;
+			}
+			if (j < 0)
+			{
+				return NaN;
+			}
+			while (j >= 0 && !image[j+ centerI*qrcode.width] && stateCount[1] <= maxCount)
+			{
+				stateCount[1]++;
+				j--;
+			}
+			if (j < 0 || stateCount[1] > maxCount)
+			{
+				return NaN;
+			}
+			while (j >= 0 && image[j+ centerI*qrcode.width] && stateCount[0] <= maxCount)
+			{
+				stateCount[0]++;
+				j--;
+			}
+			if (stateCount[0] > maxCount)
+			{
+				return NaN;
+			}
+
+			j = startJ + 1;
+			while (j < maxJ && image[j+ centerI*qrcode.width])
+			{
+				stateCount[2]++;
+				j++;
+			}
+			if (j == maxJ)
+			{
+				return NaN;
+			}
+			while (j < maxJ && !image[j+ centerI*qrcode.width] && stateCount[3] < maxCount)
+			{
+				stateCount[3]++;
+				j++;
+			}
+			if (j == maxJ || stateCount[3] >= maxCount)
+			{
+				return NaN;
+			}
+			while (j < maxJ && image[j+ centerI*qrcode.width] && stateCount[4] < maxCount)
+			{
+				stateCount[4]++;
+				j++;
+			}
+			if (stateCount[4] >= maxCount)
+			{
+				return NaN;
+			}
+
+			// If we found a finder-pattern-like section, but its size is significantly different than
+			// the original, assume it's a false positive
+			var stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2] + stateCount[3] + stateCount[4];
+			if (5 * Math.abs(stateCountTotal - originalStateCountTotal) >= originalStateCountTotal)
+			{
+				return NaN;
+			}
+
+			return this.foundPatternCross(stateCount)?this.centerFromEnd(stateCount, j):NaN;
+		}
+	this.handlePossibleCenter=function( stateCount,  i,  j)
+		{
+			var stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2] + stateCount[3] + stateCount[4];
+			var centerJ = this.centerFromEnd(stateCount, j); //float
+			var centerI = this.crossCheckVertical(i, Math.floor( centerJ), stateCount[2], stateCountTotal); //float
+			if (!isNaN(centerI))
+			{
+				// Re-cross check
+				centerJ = this.crossCheckHorizontal(Math.floor( centerJ), Math.floor( centerI), stateCount[2], stateCountTotal);
+				if (!isNaN(centerJ))
+				{
+					var estimatedModuleSize =   stateCountTotal / 7.0;
+					var found = false;
+					var max = this.possibleCenters.length;
+					for (var index = 0; index < max; index++)
+					{
+						var center = this.possibleCenters[index];
+						// Look for about the same center and module size:
+						if (center.aboutEquals(estimatedModuleSize, centerI, centerJ))
+						{
+							center.incrementCount();
+							found = true;
+							break;
+						}
+					}
+					if (!found)
+					{
+						var point = new FinderPattern(centerJ, centerI, estimatedModuleSize);
+						this.possibleCenters.push(point);
+						if (this.resultPointCallback != null)
+						{
+							this.resultPointCallback.foundPossibleResultPoint(point);
+						}
+					}
+					return true;
+				}
+			}
+			return false;
+		}
+
+	this.selectBestPatterns=function()
+		{
+
+			var startSize = this.possibleCenters.length;
+			if (startSize < 3)
+			{
+				// Couldn't find enough finder patterns
+				throw "Couldn't find enough finder patterns (found " + startSize + ")";
+			}
+
+			// Filter outlier possibilities whose module size is too different
+			if (startSize > 3)
+			{
+				// But we can only afford to do so if we have at least 4 possibilities to choose from
+				var totalModuleSize = 0.0;
+				for (var i = 0; i < startSize; i++)
+				{
+					totalModuleSize +=  this.possibleCenters[i].EstimatedModuleSize;
+				}
+				var average = totalModuleSize /  startSize;
+				for (var i = 0; i < this.possibleCenters.length && this.possibleCenters.length > 3; i++)
+				{
+					var pattern =  this.possibleCenters[i];
+					if (Math.abs(pattern.EstimatedModuleSize - average) > 0.2 * average)
+					{
+						this.possibleCenters.remove(i);
+						i--;
+					}
+				}
+			}
+
+			if (this.possibleCenters.Count > 3)
+			{
+				// Throw away all but those first size candidate points we found.
+				//Collections.insertionSort(possibleCenters, new CenterComparator());
+				//SupportClass.SetCapacity(possibleCenters, 3);
+			}
+
+			return new Array( this.possibleCenters[0],  this.possibleCenters[1],  this.possibleCenters[2]);
+		}
+
+	this.findRowSkip=function()
+		{
+			var max = this.possibleCenters.length;
+			if (max <= 1)
+			{
+				return 0;
+			}
+			var firstConfirmedCenter = null;
+			for (var i = 0; i < max; i++)
+			{
+				var center =  this.possibleCenters[i];
+				if (center.Count >= CENTER_QUORUM)
+				{
+					if (firstConfirmedCenter == null)
+					{
+						firstConfirmedCenter = center;
+					}
+					else
+					{
+						// We have two confirmed centers
+						// How far down can we skip before resuming looking for the next
+						// pattern? In the worst case, only the difference between the
+						// difference in the x / y coordinates of the two centers.
+						// This is the case where you find top left last.
+						this.hasSkipped = true;
+						return Math.floor ((Math.abs(firstConfirmedCenter.X - center.X) - Math.abs(firstConfirmedCenter.Y - center.Y)) / 2);
+					}
+				}
+			}
+			return 0;
+		}
+
+	this.haveMultiplyConfirmedCenters=function()
+		{
+			var confirmedCount = 0;
+			var totalModuleSize = 0.0;
+			var max = this.possibleCenters.length;
+			for (var i = 0; i < max; i++)
+			{
+				var pattern =  this.possibleCenters[i];
+				if (pattern.Count >= CENTER_QUORUM)
+				{
+					confirmedCount++;
+					totalModuleSize += pattern.EstimatedModuleSize;
+				}
+			}
+			if (confirmedCount < 3)
+			{
+				return false;
+			}
+			// OK, we have at least 3 confirmed centers, but, it's possible that one is a "false positive"
+			// and that we need to keep looking. We detect this by asking if the estimated module sizes
+			// vary too much. We arbitrarily say that when the total deviation from average exceeds
+			// 5% of the total module size estimates, it's too much.
+			var average = totalModuleSize / max;
+			var totalDeviation = 0.0;
+			for (var i = 0; i < max; i++)
+			{
+				pattern = this.possibleCenters[i];
+				totalDeviation += Math.abs(pattern.EstimatedModuleSize - average);
+			}
+			return totalDeviation <= 0.05 * totalModuleSize;
+		}
+
+	this.findFinderPattern = function(image){
+		var tryHarder = false;
+		this.image=image;
+		var maxI = qrcode.height;
+		var maxJ = qrcode.width;
+		var iSkip = Math.floor((3 * maxI) / (4 * MAX_MODULES));
+		if (iSkip < MIN_SKIP || tryHarder)
+		{
+				iSkip = MIN_SKIP;
+		}
+
+		var done = false;
+		var stateCount = new Array(5);
+		for (var i = iSkip - 1; i < maxI && !done; i += iSkip)
+		{
+			// Get a row of black/white values
+			stateCount[0] = 0;
+			stateCount[1] = 0;
+			stateCount[2] = 0;
+			stateCount[3] = 0;
+			stateCount[4] = 0;
+			var currentState = 0;
+			for (var j = 0; j < maxJ; j++)
+			{
+				if (image[j+i*qrcode.width] )
+				{
+					// Black pixel
+					if ((currentState & 1) == 1)
+					{
+						// Counting white pixels
+						currentState++;
+					}
+					stateCount[currentState]++;
+				}
+				else
+				{
+					// White pixel
+					if ((currentState & 1) == 0)
+					{
+						// Counting black pixels
+						if (currentState == 4)
+						{
+							// A winner?
+							if (this.foundPatternCross(stateCount))
+							{
+								// Yes
+								var confirmed = this.handlePossibleCenter(stateCount, i, j);
+								if (confirmed)
+								{
+									// Start examining every other line. Checking each line turned out to be too
+									// expensive and didn't improve performance.
+									iSkip = 2;
+									if (this.hasSkipped)
+									{
+										done = this.haveMultiplyConfirmedCenters();
+									}
+									else
+									{
+										var rowSkip = this.findRowSkip();
+										if (rowSkip > stateCount[2])
+										{
+											// Skip rows between row of lower confirmed center
+											// and top of presumed third confirmed center
+											// but back up a bit to get a full chance of detecting
+											// it, entire width of center of finder pattern
+
+											// Skip by rowSkip, but back off by stateCount[2] (size of last center
+											// of pattern we saw) to be conservative, and also back off by iSkip which
+											// is about to be re-added
+											i += rowSkip - stateCount[2] - iSkip;
+											j = maxJ - 1;
+										}
+									}
+								}
+								else
+								{
+									// Advance to next black pixel
+									do
+									{
+										j++;
+									}
+									while (j < maxJ && !image[j + i*qrcode.width]);
+									j--; // back up to that last white pixel
+								}
+								// Clear state to start looking again
+								currentState = 0;
+								stateCount[0] = 0;
+								stateCount[1] = 0;
+								stateCount[2] = 0;
+								stateCount[3] = 0;
+								stateCount[4] = 0;
+							}
+							else
+							{
+								// No, shift counts back by two
+								stateCount[0] = stateCount[2];
+								stateCount[1] = stateCount[3];
+								stateCount[2] = stateCount[4];
+								stateCount[3] = 1;
+								stateCount[4] = 0;
+								currentState = 3;
+							}
+						}
+						else
+						{
+							stateCount[++currentState]++;
+						}
+					}
+					else
+					{
+						// Counting white pixels
+						stateCount[currentState]++;
+					}
+				}
+			}
+			if (this.foundPatternCross(stateCount))
+			{
+				var confirmed = this.handlePossibleCenter(stateCount, i, maxJ);
+				if (confirmed)
+				{
+					iSkip = stateCount[0];
+					if (this.hasSkipped)
+					{
+						// Found a third one
+						done = haveMultiplyConfirmedCenters();
+					}
+				}
+			}
+		}
+
+		var patternInfo = this.selectBestPatterns();
+		qrcode.orderBestPatterns(patternInfo);
+
+		return new FinderPatternInfo(patternInfo);
+	};
+}/*
+  Ported to JavaScript by Lazar Laszlo 2011 
+  
+  [e-mail], www.lazarsoft.info
+  
+*/
+
+/*
+*
+* Copyright 2007 ZXing authors
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*      http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+
+function AlignmentPattern(posX, posY,  estimatedModuleSize)
+{
+	this.x=posX;
+	this.y=posY;
+	this.count = 1;
+	this.estimatedModuleSize = estimatedModuleSize;
+	
+	this.__defineGetter__("EstimatedModuleSize", function()
+	{
+		return this.estimatedModuleSize;
+	}); 
+	this.__defineGetter__("Count", function()
+	{
+		return this.count;
+	});
+	this.__defineGetter__("X", function()
+	{
+		return Math.floor(this.x);
+	});
+	this.__defineGetter__("Y", function()
+	{
+		return Math.floor(this.y);
+	});
+	this.incrementCount = function()
+	{
+		this.count++;
+	}
+	this.aboutEquals=function( moduleSize,  i,  j)
+		{
+			if (Math.abs(i - this.y) <= moduleSize && Math.abs(j - this.x) <= moduleSize)
+			{
+				var moduleSizeDiff = Math.abs(moduleSize - this.estimatedModuleSize);
+				return moduleSizeDiff <= 1.0 || moduleSizeDiff / this.estimatedModuleSize <= 1.0;
+			}
+			return false;
+		}
+	
+}
+
+function AlignmentPatternFinder( image,  startX,  startY,  width,  height,  moduleSize,  resultPointCallback)
+{
+	this.image = image;
+	this.possibleCenters = new Array();
+	this.startX = startX;
+	this.startY = startY;
+	this.width = width;
+	this.height = height;
+	this.moduleSize = moduleSize;
+	this.crossCheckStateCount = new Array(0,0,0);
+	this.resultPointCallback = resultPointCallback;
+	
+	this.centerFromEnd=function(stateCount,  end)
+		{
+			return  (end - stateCount[2]) - stateCount[1] / 2.0;
+		}
+	this.foundPatternCross = function(stateCount)
+		{
+			var moduleSize = this.moduleSize;
+			var maxVariance = moduleSize / 2.0;
+			for (var i = 0; i < 3; i++)
+			{
+				if (Math.abs(moduleSize - stateCount[i]) >= maxVariance)
+				{
+					return false;
+				}
+			}
+			return true;
+		}
+
+	this.crossCheckVertical=function( startI,  centerJ,  maxCount,  originalStateCountTotal)
+		{
+			var image = this.image;
+			
+			var maxI = qrcode.height;
+			var stateCount = this.crossCheckStateCount;
+			stateCount[0] = 0;
+			stateCount[1] = 0;
+			stateCount[2] = 0;
+			
+			// Start counting up from center
+			var i = startI;
+			while (i >= 0 && image[centerJ + i*qrcode.width] && stateCount[1] <= maxCount)
+			{
+				stateCount[1]++;
+				i--;
+			}
+			// If already too many modules in this state or ran off the edge:
+			if (i < 0 || stateCount[1] > maxCount)
+			{
+				return NaN;
+			}
+			while (i >= 0 && !image[centerJ + i*qrcode.width] && stateCount[0] <= maxCount)
+			{
+				stateCount[0]++;
+				i--;
+			}
+			if (stateCount[0] > maxCount)
+			{
+				return NaN;
+			}
+			
+			// Now also count down from center
+			i = startI + 1;
+			while (i < maxI && image[centerJ + i*qrcode.width] && stateCount[1] <= maxCount)
+			{
+				stateCount[1]++;
+				i++;
+			}
+			if (i == maxI || stateCount[1] > maxCount)
+			{
+				return NaN;
+			}
+			while (i < maxI && !image[centerJ + i*qrcode.width] && stateCount[2] <= maxCount)
+			{
+				stateCount[2]++;
+				i++;
+			}
+			if (stateCount[2] > maxCount)
+			{
+				return NaN;
+			}
+			
+			var stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2];
+			if (5 * Math.abs(stateCountTotal - originalStateCountTotal) >= 2 * originalStateCountTotal)
+			{
+				return NaN;
+			}
+			
+			return this.foundPatternCross(stateCount)?this.centerFromEnd(stateCount, i):NaN;
+		}
+		
+	this.handlePossibleCenter=function( stateCount,  i,  j)
+		{
+			var stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2];
+			var centerJ = this.centerFromEnd(stateCount, j);
+			var centerI = this.crossCheckVertical(i, Math.floor (centerJ), 2 * stateCount[1], stateCountTotal);
+			if (!isNaN(centerI))
+			{
+				var estimatedModuleSize = (stateCount[0] + stateCount[1] + stateCount[2]) / 3.0;
+				var max = this.possibleCenters.length;
+				for (var index = 0; index < max; index++)
+				{
+					var center =  this.possibleCenters[index];
+					// Look for about the same center and module size:
+					if (center.aboutEquals(estimatedModuleSize, centerI, centerJ))
+					{
+						return new AlignmentPattern(centerJ, centerI, estimatedModuleSize);
+					}
+				}
+				// Hadn't found this before; save it
+				var point = new AlignmentPattern(centerJ, centerI, estimatedModuleSize);
+				this.possibleCenters.push(point);
+				if (this.resultPointCallback != null)
+				{
+					this.resultPointCallback.foundPossibleResultPoint(point);
+				}
+			}
+			return null;
+		}
+		
+	this.find = function()
+	{
+			var startX = this.startX;
+			var height = this.height;
+			var maxJ = startX + width;
+			var middleI = startY + (height >> 1);
+			// We are looking for black/white/black modules in 1:1:1 ratio;
+			// this tracks the number of black/white/black modules seen so far
+			var stateCount = new Array(0,0,0);
+			for (var iGen = 0; iGen < height; iGen++)
+			{
+				// Search from middle outwards
+				var i = middleI + ((iGen & 0x01) == 0?((iGen + 1) >> 1):- ((iGen + 1) >> 1));
+				stateCount[0] = 0;
+				stateCount[1] = 0;
+				stateCount[2] = 0;
+				var j = startX;
+				// Burn off leading white pixels before anything else; if we start in the middle of
+				// a white run, it doesn't make sense to count its length, since we don't know if the
+				// white run continued to the left of the start point
+				while (j < maxJ && !image[j + qrcode.width* i])
+				{
+					j++;
+				}
+				var currentState = 0;
+				while (j < maxJ)
+				{
+					if (image[j + i*qrcode.width])
+					{
+						// Black pixel
+						if (currentState == 1)
+						{
+							// Counting black pixels
+							stateCount[currentState]++;
+						}
+						else
+						{
+							// Counting white pixels
+							if (currentState == 2)
+							{
+								// A winner?
+								if (this.foundPatternCross(stateCount))
+								{
+									// Yes
+									var confirmed = this.handlePossibleCenter(stateCount, i, j);
+									if (confirmed != null)
+									{
+										return confirmed;
+									}
+								}
+								stateCount[0] = stateCount[2];
+								stateCount[1] = 1;
+								stateCount[2] = 0;
+								currentState = 1;
+							}
+							else
+							{
+								stateCount[++currentState]++;
+							}
+						}
+					}
+					else
+					{
+						// White pixel
+						if (currentState == 1)
+						{
+							// Counting black pixels
+							currentState++;
+						}
+						stateCount[currentState]++;
+					}
+					j++;
+				}
+				if (this.foundPatternCross(stateCount))
+				{
+					var confirmed = this.handlePossibleCenter(stateCount, i, maxJ);
+					if (confirmed != null)
+					{
+						return confirmed;
+					}
+				}
+			}
+			
+			// Hmm, nothing we saw was observed and confirmed twice. If we had
+			// any guess at all, return it.
+			if (!(this.possibleCenters.length == 0))
+			{
+				return  this.possibleCenters[0];
+			}
+			
+			throw "Couldn't find enough alignment patterns";
+		}
+	
+}/*
+  Ported to JavaScript by Lazar Laszlo 2011
+
+  [e-mail], www.lazarsoft.info
+
+*/
+
+/*
+*
+* Copyright 2007 ZXing authors
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*      http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+
+function QRCodeDataBlockReader(blocks,  version,  numErrorCorrectionCode)
+{
+	this.blockPointer = 0;
+	this.bitPointer = 7;
+	this.dataLength = 0;
+	this.blocks = blocks;
+	this.numErrorCorrectionCode = numErrorCorrectionCode;
+	if (version <= 9)
+		this.dataLengthMode = 0;
+	else if (version >= 10 && version <= 26)
+		this.dataLengthMode = 1;
+	else if (version >= 27 && version <= 40)
+		this.dataLengthMode = 2;
+
+	this.getNextBits = function( numBits)
+		{
+			var bits = 0;
+			if (numBits < this.bitPointer + 1)
+			{
+				// next word fits into current data block
+				var mask = 0;
+				for (var i = 0; i < numBits; i++)
+				{
+					mask += (1 << i);
+				}
+				mask <<= (this.bitPointer - numBits + 1);
+
+				bits = (this.blocks[this.blockPointer] & mask) >> (this.bitPointer - numBits + 1);
+				this.bitPointer -= numBits;
+				return bits;
+			}
+			else if (numBits < this.bitPointer + 1 + 8)
+			{
+				// next word crosses 2 data blocks
+				var mask1 = 0;
+				for (var i = 0; i < this.bitPointer + 1; i++)
+				{
+					mask1 += (1 << i);
+				}
+				bits = (this.blocks[this.blockPointer] & mask1) << (numBits - (this.bitPointer + 1));
+                this.blockPointer++;
+				bits += ((this.blocks[this.blockPointer]) >> (8 - (numBits - (this.bitPointer + 1))));
+
+				this.bitPointer = this.bitPointer - numBits % 8;
+				if (this.bitPointer < 0)
+				{
+					this.bitPointer = 8 + this.bitPointer;
+				}
+				return bits;
+			}
+			else if (numBits < this.bitPointer + 1 + 16)
+			{
+				// next word crosses 3 data blocks
+				var mask1 = 0; // mask of first block
+				var mask3 = 0; // mask of 3rd block
+				//bitPointer + 1 : number of bits of the 1st block
+				//8 : number of the 2nd block (note that use already 8bits because next word uses 3 data blocks)
+				//numBits - (bitPointer + 1 + 8) : number of bits of the 3rd block
+				for (var i = 0; i < this.bitPointer + 1; i++)
+				{
+					mask1 += (1 << i);
+				}
+				var bitsFirstBlock = (this.blocks[this.blockPointer] & mask1) << (numBits - (this.bitPointer + 1));
+				this.blockPointer++;
+
+				var bitsSecondBlock = this.blocks[this.blockPointer] << (numBits - (this.bitPointer + 1 + 8));
+				this.blockPointer++;
+
+				for (var i = 0; i < numBits - (this.bitPointer + 1 + 8); i++)
+				{
+					mask3 += (1 << i);
+				}
+				mask3 <<= 8 - (numBits - (this.bitPointer + 1 + 8));
+				var bitsThirdBlock = (this.blocks[this.blockPointer] & mask3) >> (8 - (numBits - (this.bitPointer + 1 + 8)));
+
+				bits = bitsFirstBlock + bitsSecondBlock + bitsThirdBlock;
+				this.bitPointer = this.bitPointer - (numBits - 8) % 8;
+				if (this.bitPointer < 0)
+				{
+					this.bitPointer = 8 + this.bitPointer;
+				}
+				return bits;
+			}
+			else
+			{
+				return 0;
+			}
+		}
+	this.NextMode=function()
+	{
+		if ((this.blockPointer > this.blocks.length - this.numErrorCorrectionCode - 2))
+			return 0;
+		else
+			return this.getNextBits(4);
+	}
+	this.getDataLength=function( modeIndicator)
+		{
+			var index = 0;
+			while (true)
+			{
+				if ((modeIndicator >> index) == 1)
+					break;
+				index++;
+			}
+
+			return this.getNextBits(qrcode.sizeOfDataLengthInfo[this.dataLengthMode][index]);
+		}
+	this.getRomanAndFigureString=function( dataLength)
+		{
+			var length = dataLength;
+			var intData = 0;
+			var strData = "";
+			var tableRomanAndFigure = new Array('0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z', ' ', '$', '%', '*', '+', '-', '.', '/', ':');
+			do
+			{
+				if (length > 1)
+				{
+					intData = this.getNextBits(11);
+					var firstLetter = Math.floor(intData / 45);
+					var secondLetter = intData % 45;
+					strData += tableRomanAndFigure[firstLetter];
+					strData += tableRomanAndFigure[secondLetter];
+					length -= 2;
+				}
+				else if (length == 1)
+				{
+					intData = this.getNextBits(6);
+					strData += tableRomanAndFigure[intData];
+					length -= 1;
+				}
+			}
+			while (length > 0);
+
+			return strData;
+		}
+	this.getFigureString=function( dataLength)
+		{
+			var length = dataLength;
+			var intData = 0;
+			var strData = "";
+			do
+			{
+				if (length >= 3)
+				{
+					intData = this.getNextBits(10);
+					if (intData < 100)
+						strData += "0";
+					if (intData < 10)
+						strData += "0";
+					length -= 3;
+				}
+				else if (length == 2)
+				{
+					intData = this.getNextBits(7);
+					if (intData < 10)
+						strData += "0";
+					length -= 2;
+				}
+				else if (length == 1)
+				{
+					intData = this.getNextBits(4);
+					length -= 1;
+				}
+				strData += intData;
+			}
+			while (length > 0);
+
+			return strData;
+		}
+	this.get8bitByteArray=function( dataLength)
+		{
+			var length = dataLength;
+			var intData = 0;
+			var output = new Array();
+
+			do
+			{
+				intData = this.getNextBits(8);
+				output.push( intData);
+				length--;
+			}
+			while (length > 0);
+			return output;
+		}
+    this.getKanjiString=function( dataLength)
+		{
+			var length = dataLength;
+			var intData = 0;
+			var unicodeString = "";
+			do
+			{
+				intData = getNextBits(13);
+				var lowerByte = intData % 0xC0;
+				var higherByte = intData / 0xC0;
+
+				var tempWord = (higherByte << 8) + lowerByte;
+				var shiftjisWord = 0;
+				if (tempWord + 0x8140 <= 0x9FFC)
+				{
+					// between 8140 - 9FFC on Shift_JIS character set
+					shiftjisWord = tempWord + 0x8140;
+				}
+				else
+				{
+					// between E040 - EBBF on Shift_JIS character set
+					shiftjisWord = tempWord + 0xC140;
+				}
+
+				//var tempByte = new Array(0,0);
+				//tempByte[0] = (sbyte) (shiftjisWord >> 8);
+				//tempByte[1] = (sbyte) (shiftjisWord & 0xFF);
+				//unicodeString += new String(SystemUtils.ToCharArray(SystemUtils.ToByteArray(tempByte)));
+                unicodeString += String.fromCharCode(shiftjisWord);
+				length--;
+			}
+			while (length > 0);
+
+
+			return unicodeString;
+		}
+
+	this.__defineGetter__("DataByte", function()
+	{
+		var output = new Array();
+		var MODE_NUMBER = 1;
+	    var MODE_ROMAN_AND_NUMBER = 2;
+	    var MODE_8BIT_BYTE = 4;
+	    var MODE_KANJI = 8;
+		do
+					{
+						var mode = this.NextMode();
+						//canvas.println("mode: " + mode);
+						if (mode == 0)
+						{
+							if (output.length > 0)
+								break;
+							else
+								throw "Empty data block";
+						}
+						//if (mode != 1 && mode != 2 && mode != 4 && mode != 8)
+						//	break;
+						//}
+						if (mode != MODE_NUMBER && mode != MODE_ROMAN_AND_NUMBER && mode != MODE_8BIT_BYTE && mode != MODE_KANJI)
+						{
+							/*					canvas.println("Invalid mode: " + mode);
+							mode = guessMode(mode);
+							canvas.println("Guessed mode: " + mode); */
+							throw "Invalid mode: " + mode + " in (block:" + this.blockPointer + " bit:" + this.bitPointer + ")";
+						}
+						var dataLength = this.getDataLength(mode);
+						if (dataLength < 1)
+							throw "Invalid data length: " + dataLength;
+						//canvas.println("length: " + dataLength);
+						switch (mode)
+						{
+
+							case MODE_NUMBER:
+								//canvas.println("Mode: Figure");
+								var temp_str = this.getFigureString(dataLength);
+								var ta = new Array(temp_str.length);
+								for(var j=0;j<temp_str.length;j++)
+									ta[j]=temp_str.charCodeAt(j);
+								output.push(ta);
+								break;
+
+							case MODE_ROMAN_AND_NUMBER:
+								//canvas.println("Mode: Roman&Figure");
+								var temp_str = this.getRomanAndFigureString(dataLength);
+								var ta = new Array(temp_str.length);
+								for(var j=0;j<temp_str.length;j++)
+									ta[j]=temp_str.charCodeAt(j);
+								output.push(ta );
+								//output.Write(SystemUtils.ToByteArray(temp_sbyteArray2), 0, temp_sbyteArray2.Length);
+								break;
+
+							case MODE_8BIT_BYTE:
+								//canvas.println("Mode: 8bit Byte");
+								//sbyte[] temp_sbyteArray3;
+								var temp_sbyteArray3 = this.get8bitByteArray(dataLength);
+								output.push(temp_sbyteArray3);
+								//output.Write(SystemUtils.ToByteArray(temp_sbyteArray3), 0, temp_sbyteArray3.Length);
+								break;
+
+							case MODE_KANJI:
+								//canvas.println("Mode: Kanji");
+								//sbyte[] temp_sbyteArray4;
+								//temp_sbyteArray4 = SystemUtils.ToSByteArray(SystemUtils.ToByteArray(getKanjiString(dataLength)));
+								//output.Write(SystemUtils.ToByteArray(temp_sbyteArray4), 0, temp_sbyteArray4.Length);
+                                var temp_str = this.getKanjiString(dataLength);
+								output.push(temp_str);
+								break;
+							}
+						//
+						//canvas.println("DataLength: " + dataLength);
+						//Console.out.println(dataString);
+					}
+					while (true);
+		return output;
+	});
+}
 
=== modified file 'qreator-touch.qml'
--- qreator-touch.qml	2013-06-15 07:59:41 +0000
+++ qreator-touch.qml	2013-06-16 10:03:26 +0000
@@ -1,23 +1,30 @@
 import QtQuick 2.0
 import Ubuntu.Components 0.1
-
-import Ubuntu.Components.ListItems 0.1 as ListItem
+import Ubuntu.Components.ListItems 0.1 as ListItems
 import Ubuntu.Components.Popups 0.1
-import QtGraphicalEffects 1.0
 
 import "qreator"
 
 MainView {
-    // We define objectName for functional testing purposes
-    // (autopilot-qt5)
     objectName: "mainView"
     applicationName: "qreator-touch"
+    automaticOrientation: true
+    property bool debugMode: false
+    property real pageSpacing: units.gu(6)
     id: root
 
-    width: units.gu(50)
-    height: units.gu(75)
-
-    property real pageSpacing: units.gu(6)
+    width: units.gu(80)
+    height: units.gu(80)
+
+    function debugLog(msg) {
+        /* Display debug messages in the debug tab. Useful to present debug messages
+           in a device
+
+           @msg: string with the debug message to display
+         */
+        debugLogger.text += msg + "\n"
+        console.log(msg)
+    }
 
     Tabs {
         id: tabs
@@ -26,7 +33,7 @@
             objectName: "tabScanner"
             title: i18n.tr("Scan")
             page: Scanner {
-                id: scannerPage
+                id: pageScanner
             }
         }
 
@@ -34,17 +41,43 @@
                 objectName: "tabQreator"
                 title: i18n.tr("Create")
                 page: Creator {
-                    id: creatorPage
+                    id: pageCreator
                 }
         }
 
         Tab {
-            objectName: "tabHistory"
-            title: i18n.tr("History")
-            page: History {
-                id: historyPage
+            objectName: "TabDebug"
+            title: i18n.tr("Debug")
+
+            // FIXME: this property seems to have a weird effect: when set to
+            // true, the tab contents are always visible, also when other tabs
+            // are loaded
+            //visible: root.debugMode? true : false
+
+            page: Page {
+                Column {
+                    anchors.fill: parent
+
+                    spacing: units.gu(1)
+
+                    TextArea {
+                        id: debugLogger
+                        width: parent.width
+                        height: parent.height - parent.spacing - buttonClear.height
+
+                        readOnly: true
+                        text: ""
+                    }
+
+                    Button {
+                        id: buttonClear
+                        text: "Clear"
+                        width: parent.width
+
+                        onClicked: debugLogger.text = "";
+                    }
+                }
             }
         }
     }
 }
-
 
=== renamed file 'qreator.qmlproject' => 'qreator-touch.qmlproject'
=== modified file 'qreator/Creator.qml'
--- qreator/Creator.qml	2013-06-15 07:59:41 +0000
+++ qreator/Creator.qml	2013-06-16 10:03:26 +0000
@@ -52,22 +52,5 @@
             }
         }
 
-        tools: ToolbarActions {
-            Action {
-                text: i18n.tr("About")
-                iconSource: Qt.resolvedUrl("../img/about.png")
-                onTriggered: pageStack.push(pageAbout)
-            }
-            Action {
-                text: i18n.tr("History")
-                iconSource: Qt.resolvedUrl("../img/history.png")
-                onTriggered: pageStack.push(pageHistory)
-            }
-            Action {
-                text: i18n.tr("Settings")
-                iconSource: Qt.resolvedUrl("../img/settings.png")
-                onTriggered: pageStack.push(pageSettings)
-            }
-        }
     }
 }
 
=== added file 'qreator/Decoder.qml'
--- qreator/Decoder.qml	1970-01-01 00:00:00 +0000
+++ qreator/Decoder.qml	2013-06-16 10:03:26 +0000
@@ -0,0 +1,68 @@
+import QtQuick 2.0
+import Ubuntu.Components 0.1
+import QZXing 1.2
+import "../js/jsqrcode-combined.js" as QR
+
+Item {
+
+    // This property allows switching between decoding backends:
+    // true: uses the JavaScript decoding backend
+    // false: uses the C++ decoding backend
+    property bool useJsbackend: false
+
+    signal decodingSuccess(string tag)
+    signal decodingStart()
+    signal decodingFinish(bool success)
+
+    function decode(imageUrl) {
+        if (!useJsbackend) {
+            decoder.decodeImageQML(imageUrl);
+        } else {
+            decodingcanvas.imageurl = imageUrl;
+            decodingcanvas.loadImage(imageUrl);
+        }
+    }
+
+    // For the C++ decoding backend
+    QZXing {
+        id: decoder
+        onTagFound: {
+            decodingSuccess(tag);
+        }
+
+        onDecodingStarted: {
+            decodingStart();
+        }
+
+        onDecodingFinished: {
+            decodingFinish(succeeded);
+        }
+    }
+
+    // For the JavaScript decoding backend
+    Canvas {
+        id: decodingcanvas
+        visible: false
+        property string imageurl
+
+        onImageLoaded: {
+            debugLog("Loaded image:" + imageurl);
+            var context = decodingcanvas.getContext("2d");
+            QR.qrcode.imagedata = context.createImageData(imageurl);
+            QR.qrcode.width = QR.qrcode.imagedata.width;
+            QR.qrcode.height = QR.qrcode.imagedata.height;
+
+            decodingStart();
+            try {
+                var result = QR.qrcode.process(context);
+                decodingSuccess(result);
+                decodingFinish(true);
+                debugLog("Result: " + result);
+            }
+            catch(e) {
+                debugLog("Could not decode: " + e );
+                decodingFinish(false);
+            }
+        }
+    }
+}
 
=== added file 'qreator/DeviceOrientation.qml'
--- qreator/DeviceOrientation.qml	1970-01-01 00:00:00 +0000
+++ qreator/DeviceOrientation.qml	2013-06-16 10:03:26 +0000
@@ -0,0 +1,37 @@
+/*
+ * Copyright 2013 Canonical Ltd.
+ *
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU Lesser General Public License as published by
+ * the Free Software Foundation; version 3.
+ *
+ * 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 Lesser General Public License for more details.
+ *
+ * You should have received a copy of the GNU Lesser General Public License
+ * along with this program.  If not, see <http://www.gnu.org/licenses/>.
+ */
+
+import QtQuick 2.0
+import QtQuick.Window 2.0
+
+// We must use Item element because Screen component does not works with QtObject
+Item {
+    property string naturalOrientation: Screen.primaryOrientation == Qt.LandscapeOrientation ? "landscape" : "portrait"
+
+    /* Is the device currently rotated to be in lanscape orientation ? */
+    property bool isLandscape: Screen.orientation == Qt.LandscapeOrientation ||
+                               Screen.orientation == Qt.InvertedLandscapeOrientation
+
+    /* Is the device currently rotated upside down ? */
+    property bool isInverted: Screen.orientation == Qt.InvertedLandscapeOrientation ||
+                              Screen.orientation == Qt.InvertedPortraitOrientation
+
+    /* The rotation angle in 90 degrees increments with respect to the device being in its
+       default position */
+    property int rotationAngle: Screen.angleBetween(Screen.primaryOrientation, Screen.orientation)
+
+    visible: false
+}
 
=== modified file 'qreator/History.qml'
--- qreator/History.qml	2013-06-15 07:59:41 +0000
+++ qreator/History.qml	2013-06-16 10:03:26 +0000
@@ -2,8 +2,8 @@
 import Ubuntu.Components 0.1
 
 Page {
-    id: pageRoot
-    title: i18n.tr("Scan")
+    id: pageHistory
+    title: i18n.tr("History")
     visible: false
     
 }
 
=== modified file 'qreator/QrCodeCanvas.qml'
--- qreator/QrCodeCanvas.qml	2013-06-15 07:59:41 +0000
+++ qreator/QrCodeCanvas.qml	2013-06-16 10:03:26 +0000
@@ -13,7 +13,7 @@
     RectangularGlow {
         id: effect
         anchors.fill: qrcanvas
-        glowRadius: 10
+        glowRadius: units.gu(1)
         spread: 0.2
         color: "#DD4814"
         cornerRadius: glowRadius
@@ -28,15 +28,15 @@
         onPaint: drawQrCode(container.text)
     }
     
-    function requestQrCodePaint(textme) {
-        container.text = textme;
+    function requestQrCodePaint(qrcodetext) {
+        container.text = qrcodetext;
         qrcanvas.requestPaint();
     }
 
     function drawQrCode (textdata) {
         var ctx = qrcanvas.getContext('2d');
         
-        var pixel_size = 8;
+        var pixel_size = units.gu(1);
         // Determines the overall dimensions of the symbol (1..10)
         // We choose Version 4 (33×33).
         var QRCodeVersion = 4;
 
=== added file 'qreator/QrCodeDialog.qml'
--- qreator/QrCodeDialog.qml	1970-01-01 00:00:00 +0000
+++ qreator/QrCodeDialog.qml	2013-06-16 10:03:26 +0000
@@ -0,0 +1,44 @@
+import QtQuick 2.0
+import Ubuntu.Components 0.1
+import Ubuntu.Components.Popups 0.1
+
+Dialog {
+    id: qrcodedialog
+    title: ""
+    text: ""
+    property bool decodingSuccess: false
+
+    onTextChanged: {
+        fakeClipboard.text = text;
+    }
+
+    Button {
+        text: i18n.tr("Open")
+        color: "#DD4814"
+        visible: decodingSuccess ? true:false
+        onClicked: PopupUtils.close(qrcodedialog);
+    }
+
+    Button {
+        text: i18n.tr("Copy to clipboard")
+        visible: decodingSuccess ? true:false
+        onClicked: {
+            fakeClipboard.selectAll();
+            fakeClipboard.copy();
+            PopupUtils.close(qrcodedialog);
+        }
+    }
+
+    Button {
+        text: decodingSuccess ? i18n.tr("Cancel"):i18n.tr("OK")
+        onClicked: PopupUtils.close(qrcodedialog);
+    }
+
+    TextField {
+        // There is no QML clipboard API, so we use the Textfield's
+        // copy() method to indirectly access the clipboard
+        id: fakeClipboard
+        visible: false
+    }
+
+}
 
=== modified file 'qreator/QrCodeToolbar.qml'
--- qreator/QrCodeToolbar.qml	2013-06-15 07:59:41 +0000
+++ qreator/QrCodeToolbar.qml	2013-06-16 10:03:26 +0000
@@ -1,6 +1,17 @@
 import QtQuick 2.0
 import Ubuntu.Components 0.1
-import QtQuick.LocalStorage 2.0
 
 ToolbarActions {
-}
 \ No newline at end of file
+    Action {
+        text: i18n.tr("Edit")
+        iconSource: Qt.resolvedUrl("../img/edit.png")
+    }
+    Action {
+        text: i18n.tr("Save")
+        iconSource: Qt.resolvedUrl("../img/save.png")
+    }
+    Action {
+        text: i18n.tr("Share")
+        iconSource: Qt.resolvedUrl("../img/share.png")
+    }
+}
 
=== modified file 'qreator/Scanner.qml'
--- qreator/Scanner.qml	2013-06-15 07:59:41 +0000
+++ qreator/Scanner.qml	2013-06-16 10:03:26 +0000
@@ -1,13 +1,189 @@
 import QtQuick 2.0
 import Ubuntu.Components 0.1
-
-import Ubuntu.Components.ListItems 0.1 as ListItem
 import Ubuntu.Components.Popups 0.1
-import QtGraphicalEffects 1.0
-
-Page {
-    id: pageRoot
-    title: i18n.tr("Scan")
-    visible: false
-
+import QtMultimedia 5.0
+
+Item {
+    anchors.fill: parent
+
+    /*
+    Connections {
+        target: Qt.application
+        // FIXME: this paints the video output on top of the canvas
+        onActiveChanged: (Qt.application.active) ? camera.start() : camera.stop();
+    }*/
+
+    Page {
+            id: pagePreview
+
+            onWidthChanged: canvas.requestPaint();
+            onHeightChanged: canvas.requestPaint();
+
+            tools: ToolbarActions {
+                Action {
+                    text: i18n.tr("Decode")
+                    iconSource: Qt.resolvedUrl("../img/camera.png")
+                    onTriggered: captureImage();
+                }
+                Action {
+                    text: i18n.tr("Upload")
+                    iconSource: Qt.resolvedUrl("../img/add.png")
+                    onTriggered: PopupUtils.open(uploader);
+                }
+            }
+
+            VideoOutput {
+                id: videoPreview
+                source: camera
+                anchors {
+                    top: parent.top
+                    horizontalCenter: parent.horizontalCenter
+                }
+                //width: parent.width
+                //height: parent.width
+
+                focus: visible
+
+                /* This rotation needs to be applied since the camera hardware in the
+                   Galaxy Nexus phone is mounted at an angle inside the device, so the video
+                   feed is rotated too.
+                   FIXME: This should come from a system configuration option so that we
+                   don't have to have a different codebase for each different device we want
+                   to run on */
+                orientation: device.naturalOrientation === "portrait"  ? -90 : 0
+            }
+
+            Canvas {
+                id: canvas
+                property string imageurl
+                width: videoPreview.width
+                height: videoPreview.height
+                anchors.fill: videoPreview
+                visible: true
+
+                onPaint: {
+                    var ctx = canvas.getContext('2d');
+                    var captureWidth = units.gu(30);
+                    var captureHeight = units.gu(30);
+
+                    ctx.clearRect(0, 0, width, height);
+
+                    ctx.fillStyle = "rgba(0, 0, 0, .5)";
+
+                    console.log("Canvas width: " + width)
+                    console.log("Canvas height: " + height)
+
+                    var originX = (width / 2) - (captureWidth / 2);
+                    var originY = (height / 2) - (captureHeight / 2);
+
+                    ctx.fillRect(0, 0, width, height);
+
+                    // Origin, a width, and a height
+                    ctx.clearRect(originX, originY, captureWidth, captureHeight);
+                }
+            }
+    }
+
+    Decoder {
+        id: decoder
+        onDecodingSuccess: {
+            debugLog("Tag found: " + tag);
+            var resultTitle = i18n.tr("Your code contents");
+            var resultMessage = tag;
+            showResult(resultMessage, resultTitle, true);
+        }
+
+        onDecodingStart: {
+            debugLog("Decoding started");
+        }
+
+        onDecodingFinish: {
+            debugLog("Decoding finished " + (success==true ? "successfully" : "unsuccessfully"));
+            if (!success) {
+                // This dialog will go away as soon as we implement automatic scanning
+                // But we might want to keep it for providing feedback when manually uploading
+                // images to decode
+                var resultTitle = i18n.tr("Oops!");
+                var resultMessage = i18n.tr("The code's content could not be decoded");
+                showResult(resultMessage, resultTitle, false);
+            }
+        }
+    }
+
+    Component {
+        id: uploader
+
+        UploadImageDialog {
+
+            onAccepted: {
+                if (inputText !== '') {
+                    console.log("Uploaded image", inputText);
+                    decoder.decode(inputText);
+                } else {
+                    console.log("Empty image path, ignored")
+                }
+            }
+
+        }
+    }
+
+    Camera {
+        id: camera
+        flash.mode: Camera.FlashOff
+        captureMode: Camera.CaptureStillImage
+        focus.focusMode: Camera.FocusAuto
+        exposure.exposureMode: Camera.ExposureAuto
+
+        imageCapture {
+            //resolution: Qt.size(640, 480)
+
+            onImageSaved: {
+                debugLog("Picture saved as " + path);
+                decoder.decode(path);
+            }
+        }
+    }
+
+    DeviceOrientation {
+        id: device
+    }
+
+    function showResult(resultMessage, resultTitle, decodingSuccess) {
+        /* Shows the decoding result in a dialog
+
+           @resultMessage: Main message to display
+           @resultTitle: Title of the dialog
+           @decodingSuccess: True if the decoding was successful
+        */
+
+        PopupUtils.open(Qt.resolvedUrl("QrCodeDialog.qml"), pagePreview,
+                        {
+                            text: resultMessage,
+                            title: resultTitle,
+                            decodingSuccess: decodingSuccess
+                         })
+    }
+
+    function captureImage(){
+        /*
+        FIXME: we need to decide whether to save the image at all on the
+        file system (perhaps by intercepting onImageCaptured from the
+        Camera), to save files individually or to always overwrite the same
+        picture as a workaround (using captureToLocation)
+
+        The later seems to work on the desktop, but it inexplicably crashes
+        the camera when doing it on a device.
+
+        Another option to complement it could be to delete the saved image from
+        C++: QFile::remove(const QString &fileName);
+
+        For now, we'll simply save all images
+        */
+
+        //var captureLocation = "/tmp/qrcode.jpg";
+        //camera.imageCapture.captureToLocation(captureLocation);
+
+        camera.imageCapture.capture()
+
+    }
 }
 
=== added file 'qreator/UploadImageDialog.qml'
--- qreator/UploadImageDialog.qml	1970-01-01 00:00:00 +0000
+++ qreator/UploadImageDialog.qml	2013-06-16 10:03:26 +0000
@@ -0,0 +1,37 @@
+import QtQuick 2.0
+import Ubuntu.Components 0.1
+import Ubuntu.Components.Popups 0.1
+
+Dialog {
+    id: root
+
+    title: i18n.tr("Upload image")
+    text: i18n.tr("Enter the path to an image to decode")
+
+    property alias inputText: input.text
+
+    signal accepted
+    signal rejected
+
+    TextField {
+        id: input
+        focus: true
+    }
+
+    Button {
+        text: i18n.tr("Decode image")
+        color: "#DD4814"
+        onClicked: {
+            accepted()
+            PopupUtils.close(root)
+        }
+    }
+
+    Button {
+        text: i18n.tr("Cancel")
+        onClicked: {
+            rejected()
+            PopupUtils.close(root)
+        }
+    }
+}