diff --git a/.gitignore b/.gitignore new file mode 100644 index 0000000..4f4740d --- /dev/null +++ b/.gitignore @@ -0,0 +1,20 @@ +test/javasource/ +test/deployment/ +test/.classpath +test/.project +test/theme/ +test/userlib/ +test/.classpath +test/.project +*.launch +*.tmp +*.lock +.idea/ + +dist/ + +node_modules/ +.editorconfig +*DS_Store* +.vscode/ +*.bak diff --git a/.jshintrc b/.jshintrc new file mode 100644 index 0000000..f73b569 --- /dev/null +++ b/.jshintrc @@ -0,0 +1,23 @@ +{ + // Enforcing + "curly" : false, + "forin" : false, + "latedef" : "nofunc", + "newcap" : true, + "quotmark" : "double", + "eqeqeq" : true, + "undef" : true, + "globals" : { + "mendix" : false, + "mx" : false, + "logger" : false + }, + + // Relaxing + "laxbreak" : true, + + // Environments + "browser" : true, + "devel" : true, + "dojo" : true +} diff --git a/Gruntfile.js b/Gruntfile.js new file mode 100644 index 0000000..01ed084 --- /dev/null +++ b/Gruntfile.js @@ -0,0 +1,233 @@ +// Generated on 2016-06-01 using generator-mendix 1.3.6 :: git+https://github.com/mendix/generator-mendix.git +/*jshint -W069*/ +/*global module*/ +"use strict"; + +// In case you seem to have trouble starting Mendix through `grunt start-mendix`, you might have to set the path to the Mendix application. +// If it works, leave MODELER_PATH at null +var MODELER_PATH = null; +var MODELER_ARGS = "/file:{path}"; + +/******************************************************************************** + * Do not edit anything below, unless you know what you are doing + ********************************************************************************/ + +var path = require("path"), + mendixApp = require("node-mendix-modeler-path"), + base64 = require("node-base64-image"), + semver = require("semver"), + xml2js = require("xml2js"), + parser = new xml2js.Parser(), + builder = new xml2js.Builder({ + renderOpts: { pretty: true, indent: " ", newline: "\n" }, + xmldec: { standalone: null, encoding: "utf-8" } + }), + shelljs = require("shelljs"), + pkg = require("./package.json"), + currentFolder = shelljs.pwd().toString(); + +var TEST_PATH = path.join(currentFolder, "/test/Test.mpr"); +var WIDGET_XML = path.join(currentFolder, "/src/", pkg.name, "/", pkg.name + ".xml"); +var PACKAGE_XML = path.join(currentFolder, "/src/package.xml"); +var TEST_WIDGETS_FOLDER = path.join(currentFolder, "./test/widgets"); +var TEST_WIDGETS_DEPLOYMENT_FOLDER = path.join(currentFolder, "./test/deployment/web/widgets"); + +/** + * If you want to use a custom folder for the test project, make sure these are added to package.json: + * "paths": { + * "testProjectFolder": "./test/", + * "testProjectFileName": "Test.mpr" + * }, + * You can test it by running: `grunt folders` + **/ + +if (pkg.paths && pkg.paths.testProjectFolder && pkg.paths.testProjectFileName) { + var folder = pkg.paths.testProjectFolder; + if (folder.indexOf(".") === 0) { + folder = path.join(currentFolder, folder); + } + TEST_PATH = path.join(folder, pkg.paths.testProjectFileName); + TEST_WIDGETS_FOLDER = path.join(folder, "/widgets"); + TEST_WIDGETS_DEPLOYMENT_FOLDER = path.join(folder, "/deployment/web/widgets"); +} + +module.exports = function (grunt) { + grunt.initConfig({ + watch: { + autoDeployUpdate: { + "files": [ "./src/**/*" ], + "tasks": [ "compress", "newer:copy" ], + options: { + debounceDelay: 250, + livereload: true + } + } + }, + compress: { + makezip: { + options: { + archive: "./dist/" + pkg.name + ".mpk", + mode: "zip" + }, + files: [{ + expand: true, + date: new Date(), + store: false, + cwd: "./src", + src: ["**/*"] + }] + } + }, + copy: { + deployment: { + files: [ + { dest: TEST_WIDGETS_DEPLOYMENT_FOLDER, cwd: "./src/", src: ["**/*"], expand: true } + ] + }, + mpks: { + files: [ + { dest: TEST_WIDGETS_FOLDER, cwd: "./dist/", src: [ pkg.name + ".mpk"], expand: true } + ] + } + }, + clean: { + build: [ + path.join(currentFolder, "dist", pkg.name, "/*") + ] + }, + csslint: { + strict: { + options: { + import: 2 + }, + src: ["src/" + pkg.name + "/widget/ui/*.css"] + } + } + }); + + grunt.loadNpmTasks("grunt-contrib-compress"); + grunt.loadNpmTasks("grunt-contrib-clean"); + grunt.loadNpmTasks("grunt-contrib-watch"); + grunt.loadNpmTasks("grunt-contrib-copy"); + grunt.loadNpmTasks("grunt-newer"); + grunt.loadNpmTasks("grunt-contrib-csslint"); + + grunt.registerTask("start-modeler", function () { + var done = this.async(); + if (MODELER_PATH !== null || (mendixApp.err === null && mendixApp.output !== null && mendixApp.output.cmd && mendixApp.output.arg)) { + grunt.util.spawn({ + cmd: MODELER_PATH || mendixApp.output.cmd, + args: [ + (MODELER_PATH !== null ? MODELER_ARGS : mendixApp.output.arg).replace("{path}", TEST_PATH) + ] + }, function () { + done(); + }); + } else { + console.error("Cannot start Modeler, see error:"); + console.log(mendixApp.err); + done(); + } + }); + + grunt.registerTask("version", function (version) { + var done = this.async(); + if (!grunt.file.exists(PACKAGE_XML)) { + grunt.log.error("Cannot find " + PACKAGE_XML); + return done(); + } + + var xml = grunt.file.read(PACKAGE_XML); + parser.parseString(xml, function (err, res) { + if (err) { + grunt.log.error(err); + return done(); + } + if (res.package.clientModule[0]["$"]["version"]) { + var currentVersion = res.package.clientModule[0]["$"]["version"]; + if (!version) { + grunt.log.writeln("\nCurrent version is " + currentVersion); + grunt.log.writeln("Set new version by running 'grunt version:x.y.z'"); + done(); + } else { + if (!semver.valid(version) || !semver.satisfies(version, ">= 1.0.0")) { + grunt.log.error("\nPlease provide a valid version that is higher than 1.0.0. Current version: " + currentVersion); + done(); + } else { + res.package.clientModule[0]["$"]["version"] = version; + pkg.version = version; + var xmlString = builder.buildObject(res); + grunt.file.write(PACKAGE_XML, xmlString); + grunt.file.write("package.json", JSON.stringify(pkg, null, 2)); + done(); + } + } + } else { + grunt.log.error("Cannot find current version number"); + } + }); + + }); + + grunt.registerTask("generate-icon", function () { + var iconPath = path.join(currentFolder, "/icon.png"), + options = {localFile: true, string: true}, + done = this.async(); + + grunt.log.writeln("Processing icon"); + + if (!grunt.file.exists(iconPath) || !grunt.file.exists(WIDGET_XML)) { + grunt.log.error("can\'t generate icon"); + return done(); + } + + base64.base64encoder(iconPath, options, function (err, image) { + if (!err) { + var xmlOld = grunt.file.read(WIDGET_XML); + parser.parseString(xmlOld, function (err, result) { + if (!err) { + if (result && result.widget && result.widget.icon) { + result.widget.icon[0] = image; + } + var xmlString = builder.buildObject(result); + grunt.file.write(WIDGET_XML, xmlString); + done(); + } + }); + } else { + grunt.log.error("can\'t generate icon"); + return done(); + } + }); + }); + + grunt.registerTask("folders", function () { + var done = this.async(); + grunt.log.writeln("\nShowing file paths that Grunt will use. You can edit the package.json accordingly\n"); + grunt.log.writeln("TEST_PATH: ", TEST_PATH); + grunt.log.writeln("WIDGET_XML: ", WIDGET_XML); + grunt.log.writeln("PACKAGE_XML: ", PACKAGE_XML); + grunt.log.writeln("TEST_WIDGETS_FOLDER: ", TEST_WIDGETS_FOLDER); + grunt.log.writeln("TEST_WIDGETS_DEPLOYMENT_FOLDER: ", TEST_WIDGETS_DEPLOYMENT_FOLDER); + return done(); + }); + + grunt.registerTask("start-mendix", [ "start-modeler" ]); + + grunt.registerTask( + "default", + "Watches for changes and automatically creates an MPK file, as well as copying the changes to your deployment folder", + [ "watch" ] + ); + + grunt.registerTask( + "clean build", + "Compiles all the assets and copies the files to the build directory.", + [ "clean", "compress", "copy" ] + ); + + grunt.registerTask( + "build", + [ "clean build" ] + ); +}; diff --git a/LICENSE b/LICENSE new file mode 100644 index 0000000..5c304d1 --- /dev/null +++ b/LICENSE @@ -0,0 +1,201 @@ +Apache License + Version 2.0, January 2004 + http://www.apache.org/licenses/ + + TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION + + 1. Definitions. + + "License" shall mean the terms and conditions for use, reproduction, + and distribution as defined by Sections 1 through 9 of this document. + + "Licensor" shall mean the copyright owner or entity authorized by + the copyright owner that is granting the License. + + "Legal Entity" shall mean the union of the acting entity and all + other entities that control, are controlled by, or are under common + control with that entity. For the purposes of this definition, + "control" means (i) the power, direct or indirect, to cause the + direction or management of such entity, whether by contract or + otherwise, or (ii) ownership of fifty percent (50%) or more of the + outstanding shares, or (iii) beneficial ownership of such entity. + + "You" (or "Your") shall mean an individual or Legal Entity + exercising permissions granted by this License. + + "Source" form shall mean the preferred form for making modifications, + including but not limited to software source code, documentation + source, and configuration files. + + "Object" form shall mean any form resulting from mechanical + transformation or translation of a Source form, including but + not limited to compiled object code, generated documentation, + and conversions to other media types. + + "Work" shall mean the work of authorship, whether in Source or + Object form, made available under the License, as indicated by a + copyright notice that is included in or attached to the work + (an example is provided in the Appendix below). + + "Derivative Works" shall mean any work, whether in Source or Object + form, that is based on (or derived from) the Work and for which the + editorial revisions, annotations, elaborations, or other modifications + represent, as a whole, an original work of authorship. For the purposes + of this License, Derivative Works shall not include works that remain + separable from, or merely link (or bind by name) to the interfaces of, + the Work and Derivative Works thereof. + + "Contribution" shall mean any work of authorship, including + the original version of the Work and any modifications or additions + to that Work or Derivative Works thereof, that is intentionally + submitted to Licensor for inclusion in the Work by the copyright owner + or by an individual or Legal Entity authorized to submit on behalf of + the copyright owner. For the purposes of this definition, "submitted" + means any form of electronic, verbal, or written communication sent + to the Licensor or its representatives, including but not limited to + communication on electronic mailing lists, source code control systems, + and issue tracking systems that are managed by, or on behalf of, the + Licensor for the purpose of discussing and improving the Work, but + excluding communication that is conspicuously marked or otherwise + designated in writing by the copyright owner as "Not a Contribution." + + "Contributor" shall mean Licensor and any individual or Legal Entity + on behalf of whom a Contribution has been received by Licensor and + subsequently incorporated within the Work. + + 2. Grant of Copyright License. Subject to the terms and conditions of + this License, each Contributor hereby grants to You a perpetual, + worldwide, non-exclusive, no-charge, royalty-free, irrevocable + copyright license to reproduce, prepare Derivative Works of, + publicly display, publicly perform, sublicense, and distribute the + Work and such Derivative Works in Source or Object form. + + 3. Grant of Patent License. Subject to the terms and conditions of + this License, each Contributor hereby grants to You a perpetual, + worldwide, non-exclusive, no-charge, royalty-free, irrevocable + (except as stated in this section) patent license to make, have made, + use, offer to sell, sell, import, and otherwise transfer the Work, + where such license applies only to those patent claims licensable + by such Contributor that are necessarily infringed by their + Contribution(s) alone or by combination of their Contribution(s) + with the Work to which such Contribution(s) was submitted. If You + institute patent litigation against any entity (including a + cross-claim or counterclaim in a lawsuit) alleging that the Work + or a Contribution incorporated within the Work constitutes direct + or contributory patent infringement, then any patent licenses + granted to You under this License for that Work shall terminate + as of the date such litigation is filed. + + 4. Redistribution. You may reproduce and distribute copies of the + Work or Derivative Works thereof in any medium, with or without + modifications, and in Source or Object form, provided that You + meet the following conditions: + + (a) You must give any other recipients of the Work or + Derivative Works a copy of this License; and + + (b) You must cause any modified files to carry prominent notices + stating that You changed the files; and + + (c) You must retain, in the Source form of any Derivative Works + that You distribute, all copyright, patent, trademark, and + attribution notices from the Source form of the Work, + excluding those notices that do not pertain to any part of + the Derivative Works; and + + (d) If the Work includes a "NOTICE" text file as part of its + distribution, then any Derivative Works that You distribute must + include a readable copy of the attribution notices contained + within such NOTICE file, excluding those notices that do not + pertain to any part of the Derivative Works, in at least one + of the following places: within a NOTICE text file distributed + as part of the Derivative Works; within the Source form or + documentation, if provided along with the Derivative Works; or, + within a display generated by the Derivative Works, if and + wherever such third-party notices normally appear. The contents + of the NOTICE file are for informational purposes only and + do not modify the License. You may add Your own attribution + notices within Derivative Works that You distribute, alongside + or as an addendum to the NOTICE text from the Work, provided + that such additional attribution notices cannot be construed + as modifying the License. + + You may add Your own copyright statement to Your modifications and + may provide additional or different license terms and conditions + for use, reproduction, or distribution of Your modifications, or + for any such Derivative Works as a whole, provided Your use, + reproduction, and distribution of the Work otherwise complies with + the conditions stated in this License. + + 5. Submission of Contributions. Unless You explicitly state otherwise, + any Contribution intentionally submitted for inclusion in the Work + by You to the Licensor shall be under the terms and conditions of + this License, without any additional terms or conditions. + Notwithstanding the above, nothing herein shall supersede or modify + the terms of any separate license agreement you may have executed + with Licensor regarding such Contributions. + + 6. Trademarks. This License does not grant permission to use the trade + names, trademarks, service marks, or product names of the Licensor, + except as required for reasonable and customary use in describing the + origin of the Work and reproducing the content of the NOTICE file. + + 7. Disclaimer of Warranty. Unless required by applicable law or + agreed to in writing, Licensor provides the Work (and each + Contributor provides its Contributions) on an "AS IS" BASIS, + WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or + implied, including, without limitation, any warranties or conditions + of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A + PARTICULAR PURPOSE. You are solely responsible for determining the + appropriateness of using or redistributing the Work and assume any + risks associated with Your exercise of permissions under this License. + + 8. Limitation of Liability. In no event and under no legal theory, + whether in tort (including negligence), contract, or otherwise, + unless required by applicable law (such as deliberate and grossly + negligent acts) or agreed to in writing, shall any Contributor be + liable to You for damages, including any direct, indirect, special, + incidental, or consequential damages of any character arising as a + result of this License or out of the use or inability to use the + Work (including but not limited to damages for loss of goodwill, + work stoppage, computer failure or malfunction, or any and all + other commercial damages or losses), even if such Contributor + has been advised of the possibility of such damages. + + 9. Accepting Warranty or Additional Liability. While redistributing + the Work or Derivative Works thereof, You may choose to offer, + and charge a fee for, acceptance of support, warranty, indemnity, + or other liability obligations and/or rights consistent with this + License. However, in accepting such obligations, You may act only + on Your own behalf and on Your sole responsibility, not on behalf + of any other Contributor, and only if You agree to indemnify, + defend, and hold each Contributor harmless for any liability + incurred by, or claims asserted against, such Contributor by reason + of your accepting any such warranty or additional liability. + + END OF TERMS AND CONDITIONS + + APPENDIX: How to apply the Apache License to your work. + + To apply the Apache License to your work, attach the following + boilerplate notice, with the fields enclosed by brackets "{}" + replaced with your own identifying information. (Don't include + the brackets!) The text should be enclosed in the appropriate + comment syntax for the file format. We also recommend that a + file or class name and description of purpose be included on the + same "printed page" as the copyright notice for easier + identification within third-party archives. + + Copyright {yyyy} {name of copyright owner} + + 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. diff --git a/README.md b/README.md new file mode 100644 index 0000000..d1995ab --- /dev/null +++ b/README.md @@ -0,0 +1,11 @@ +# QR Code Widget + +Generate a QR code in your browser using [qr.js](https://github.com/neocotic/qr.js). The widget takes a String or Integer for the value of the QR code. The amount of characters that you can put in a QR code is about 4,000 characters. + +## Contributing + +For more information on contributing to this repository visit [Contributing to a GitHub repository](https://world.mendix.com/display/howto50/Contributing+to+a+GitHub+repository)! + +## Configuration + +TBD diff --git a/assets/app_store_banner.png b/assets/app_store_banner.png new file mode 100644 index 0000000..35fdc7d Binary files /dev/null and b/assets/app_store_banner.png differ diff --git a/assets/app_store_icon.png b/assets/app_store_icon.png new file mode 100644 index 0000000..26b1275 Binary files /dev/null and b/assets/app_store_icon.png differ diff --git a/icon.png b/icon.png new file mode 100644 index 0000000..494b3cf Binary files /dev/null and b/icon.png differ diff --git a/package.json b/package.json new file mode 100644 index 0000000..1148070 --- /dev/null +++ b/package.json @@ -0,0 +1,35 @@ +{ + "name": "QRCodeWidget", + "version": "1.0.0", + "description": "Generate QR Codes, client-side", + "license": "Apache 2", + "author": "J.W. Lagendijk ", + "private": true, + "dependencies": { + }, + "devDependencies": { + "grunt": "1.0.1", + "grunt-contrib-clean": "^1.0.0", + "grunt-contrib-compress": "^1.2.0", + "grunt-contrib-copy": "^1.0.0", + "grunt-contrib-watch": "^1.0.0", + "grunt-contrib-csslint": "^1.0.0", + "grunt-newer": "^1.1.1", + "node-base64-image": "^0.1.0", + "shelljs": "^0.7.0", + "xml2js": "^0.4.15", + "semver": "^5.1.0", + "node-mendix-modeler-path": "https://github.com/JelteMX/node-mendix-modeler-path/archive/v1.0.0.tar.gz" + }, + "engines": { + "node": ">=0.12.0" + }, + "generatorVersion": "1.3.6", + "paths": { + "testProjectFolder": "./test/", + "testProjectFileName": "Test.mpr" + }, + "scripts": { + "test": "grunt test" + } +} diff --git a/src/QRCodeWidget/QRCodeWidget.xml b/src/QRCodeWidget/QRCodeWidget.xml new file mode 100644 index 0000000..c21ce42 --- /dev/null +++ b/src/QRCodeWidget/QRCodeWidget.xml @@ -0,0 +1,47 @@ + + + QR Code + Generate QR codes with Mendix + iVBORw0KGgoAAAANSUhEUgAAACAAAAAgCAYAAABzenr0AAAABGdBTUEAALGPC/xhBQAAAAlwSFlzAAAOxAAADsQBlSsOGwAAAIVJREFUWEftlNEKwCAIRXX//8+tYhMmSN0YKOKB6CEmeqYyEbV+YFr7fsY8QuFcz+2GGNAVWbyVWgbQOPEMWP9Sv68M7MZxN1AJVAKjFWdb6q622J2CFWGmQAygWAZQ/A30So4M/EWNYZ4pOCWOAXSD5TVgbTT9nsZAJVAJ1B4QAyhJDBDdQaBQGZb6/OEAAAAASUVORK5CYII= + + + Value + Datasource + Contents of the barcode + + + + + + + Size + Appearance + Size of the barcode in pixels, if it is not responsive. Minimum is set to 25 + + + Responsive + Appearance + If set to true,, it will determine the size itself, based on the width of the parent element. If the parent element has a size of 0, it will ignore this and default back to the Size you set here in the modeler + + + Barcode type + Appearance + Type of the element. Note that the colors should be valid hex colors (E.g. #000000). Colors like 'transparent' might also work on Canvas/PNG elements, but not on JPEGs + + Canvas + Image (png) + Image (jpg) + + + + Foreground color + Appearance + + + + Background color + Appearance + + + + \ No newline at end of file diff --git a/src/QRCodeWidget/lib/qr.js b/src/QRCodeWidget/lib/qr.js new file mode 100644 index 0000000..85c90fd --- /dev/null +++ b/src/QRCodeWidget/lib/qr.js @@ -0,0 +1,1207 @@ +/* + Edited by J.W. lagendijk + + r. 1009 size now in pixels, not levels +*/ + +// [qr.js](http://neocotic.com/qr.js) +// (c) 2015 Alasdair Mercer +// Licensed under the GPL Version 3 license. +// Based on [jsqrencode](http://code.google.com/p/jsqrencode/) +// (c) 2010 tz@execpc.com +// Licensed under the GPL Version 3 license. +// For all details and documentation: +// + +(function(root) { + + 'use strict'; + + // Private constants + // ----------------- + + // Alignment pattern. + var ALIGNMENT_DELTA = [ + 0, 11, 15, 19, 23, 27, 31, + 16, 18, 20, 22, 24, 26, 28, 20, 22, 24, 24, 26, 28, 28, 22, 24, 24, + 26, 26, 28, 28, 24, 24, 26, 26, 26, 28, 28, 24, 26, 26, 26, 28, 28]; + // Default MIME type. + var DEFAULT_MIME = 'image/png'; + // MIME used to initiate a browser download prompt when `qr.save` is called. + var DOWNLOAD_MIME = 'image/octet-stream'; + // There are four elements per version. The first two indicate the number of blocks, then the + // data width, and finally the ECC width. + var ECC_BLOCKS = [ + 1, 0, 19, 7, 1, 0, 16, 10, 1, 0, 13, 13, 1, 0, 9, 17, + 1, 0, 34, 10, 1, 0, 28, 16, 1, 0, 22, 22, 1, 0, 16, 28, + 1, 0, 55, 15, 1, 0, 44, 26, 2, 0, 17, 18, 2, 0, 13, 22, + 1, 0, 80, 20, 2, 0, 32, 18, 2, 0, 24, 26, 4, 0, 9, 16, + 1, 0, 108, 26, 2, 0, 43, 24, 2, 2, 15, 18, 2, 2, 11, 22, + 2, 0, 68, 18, 4, 0, 27, 16, 4, 0, 19, 24, 4, 0, 15, 28, + 2, 0, 78, 20, 4, 0, 31, 18, 2, 4, 14, 18, 4, 1, 13, 26, + 2, 0, 97, 24, 2, 2, 38, 22, 4, 2, 18, 22, 4, 2, 14, 26, + 2, 0, 116, 30, 3, 2, 36, 22, 4, 4, 16, 20, 4, 4, 12, 24, + 2, 2, 68, 18, 4, 1, 43, 26, 6, 2, 19, 24, 6, 2, 15, 28, + 4, 0, 81, 20, 1, 4, 50, 30, 4, 4, 22, 28, 3, 8, 12, 24, + 2, 2, 92, 24, 6, 2, 36, 22, 4, 6, 20, 26, 7, 4, 14, 28, + 4, 0, 107, 26, 8, 1, 37, 22, 8, 4, 20, 24, 12, 4, 11, 22, + 3, 1, 115, 30, 4, 5, 40, 24, 11, 5, 16, 20, 11, 5, 12, 24, + 5, 1, 87, 22, 5, 5, 41, 24, 5, 7, 24, 30, 11, 7, 12, 24, + 5, 1, 98, 24, 7, 3, 45, 28, 15, 2, 19, 24, 3, 13, 15, 30, + 1, 5, 107, 28, 10, 1, 46, 28, 1, 15, 22, 28, 2, 17, 14, 28, + 5, 1, 120, 30, 9, 4, 43, 26, 17, 1, 22, 28, 2, 19, 14, 28, + 3, 4, 113, 28, 3, 11, 44, 26, 17, 4, 21, 26, 9, 16, 13, 26, + 3, 5, 107, 28, 3, 13, 41, 26, 15, 5, 24, 30, 15, 10, 15, 28, + 4, 4, 116, 28, 17, 0, 42, 26, 17, 6, 22, 28, 19, 6, 16, 30, + 2, 7, 111, 28, 17, 0, 46, 28, 7, 16, 24, 30, 34, 0, 13, 24, + 4, 5, 121, 30, 4, 14, 47, 28, 11, 14, 24, 30, 16, 14, 15, 30, + 6, 4, 117, 30, 6, 14, 45, 28, 11, 16, 24, 30, 30, 2, 16, 30, + 8, 4, 106, 26, 8, 13, 47, 28, 7, 22, 24, 30, 22, 13, 15, 30, + 10, 2, 114, 28, 19, 4, 46, 28, 28, 6, 22, 28, 33, 4, 16, 30, + 8, 4, 122, 30, 22, 3, 45, 28, 8, 26, 23, 30, 12, 28, 15, 30, + 3, 10, 117, 30, 3, 23, 45, 28, 4, 31, 24, 30, 11, 31, 15, 30, + 7, 7, 116, 30, 21, 7, 45, 28, 1, 37, 23, 30, 19, 26, 15, 30, + 5, 10, 115, 30, 19, 10, 47, 28, 15, 25, 24, 30, 23, 25, 15, 30, + 13, 3, 115, 30, 2, 29, 46, 28, 42, 1, 24, 30, 23, 28, 15, 30, + 17, 0, 115, 30, 10, 23, 46, 28, 10, 35, 24, 30, 19, 35, 15, 30, + 17, 1, 115, 30, 14, 21, 46, 28, 29, 19, 24, 30, 11, 46, 15, 30, + 13, 6, 115, 30, 14, 23, 46, 28, 44, 7, 24, 30, 59, 1, 16, 30, + 12, 7, 121, 30, 12, 26, 47, 28, 39, 14, 24, 30, 22, 41, 15, 30, + 6, 14, 121, 30, 6, 34, 47, 28, 46, 10, 24, 30, 2, 64, 15, 30, + 17, 4, 122, 30, 29, 14, 46, 28, 49, 10, 24, 30, 24, 46, 15, 30, + 4, 18, 122, 30, 13, 32, 46, 28, 48, 14, 24, 30, 42, 32, 15, 30, + 20, 4, 117, 30, 40, 7, 47, 28, 43, 22, 24, 30, 10, 67, 15, 30, + 19, 6, 118, 30, 18, 31, 47, 28, 34, 34, 24, 30, 20, 61, 15, 30]; + // Map of human-readable ECC levels. + var ECC_LEVELS = { + L: 1, + M: 2, + Q: 3, + H: 4 + }; + // Final format bits with mask (level << 3 | mask). + var FINAL_FORMAT = [ + 0x77c4, 0x72f3, 0x7daa, 0x789d, 0x662f, 0x6318, 0x6c41, 0x6976, /* L */ + 0x5412, 0x5125, 0x5e7c, 0x5b4b, 0x45f9, 0x40ce, 0x4f97, 0x4aa0, /* M */ + 0x355f, 0x3068, 0x3f31, 0x3a06, 0x24b4, 0x2183, 0x2eda, 0x2bed, /* Q */ + 0x1689, 0x13be, 0x1ce7, 0x19d0, 0x0762, 0x0255, 0x0d0c, 0x083b /* H */ ]; + // Galois field exponent table. + var GALOIS_EXPONENT = [ + 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1d, 0x3a, 0x74, 0xe8, 0xcd, 0x87, 0x13, 0x26, + 0x4c, 0x98, 0x2d, 0x5a, 0xb4, 0x75, 0xea, 0xc9, 0x8f, 0x03, 0x06, 0x0c, 0x18, 0x30, 0x60, 0xc0, + 0x9d, 0x27, 0x4e, 0x9c, 0x25, 0x4a, 0x94, 0x35, 0x6a, 0xd4, 0xb5, 0x77, 0xee, 0xc1, 0x9f, 0x23, + 0x46, 0x8c, 0x05, 0x0a, 0x14, 0x28, 0x50, 0xa0, 0x5d, 0xba, 0x69, 0xd2, 0xb9, 0x6f, 0xde, 0xa1, + 0x5f, 0xbe, 0x61, 0xc2, 0x99, 0x2f, 0x5e, 0xbc, 0x65, 0xca, 0x89, 0x0f, 0x1e, 0x3c, 0x78, 0xf0, + 0xfd, 0xe7, 0xd3, 0xbb, 0x6b, 0xd6, 0xb1, 0x7f, 0xfe, 0xe1, 0xdf, 0xa3, 0x5b, 0xb6, 0x71, 0xe2, + 0xd9, 0xaf, 0x43, 0x86, 0x11, 0x22, 0x44, 0x88, 0x0d, 0x1a, 0x34, 0x68, 0xd0, 0xbd, 0x67, 0xce, + 0x81, 0x1f, 0x3e, 0x7c, 0xf8, 0xed, 0xc7, 0x93, 0x3b, 0x76, 0xec, 0xc5, 0x97, 0x33, 0x66, 0xcc, + 0x85, 0x17, 0x2e, 0x5c, 0xb8, 0x6d, 0xda, 0xa9, 0x4f, 0x9e, 0x21, 0x42, 0x84, 0x15, 0x2a, 0x54, + 0xa8, 0x4d, 0x9a, 0x29, 0x52, 0xa4, 0x55, 0xaa, 0x49, 0x92, 0x39, 0x72, 0xe4, 0xd5, 0xb7, 0x73, + 0xe6, 0xd1, 0xbf, 0x63, 0xc6, 0x91, 0x3f, 0x7e, 0xfc, 0xe5, 0xd7, 0xb3, 0x7b, 0xf6, 0xf1, 0xff, + 0xe3, 0xdb, 0xab, 0x4b, 0x96, 0x31, 0x62, 0xc4, 0x95, 0x37, 0x6e, 0xdc, 0xa5, 0x57, 0xae, 0x41, + 0x82, 0x19, 0x32, 0x64, 0xc8, 0x8d, 0x07, 0x0e, 0x1c, 0x38, 0x70, 0xe0, 0xdd, 0xa7, 0x53, 0xa6, + 0x51, 0xa2, 0x59, 0xb2, 0x79, 0xf2, 0xf9, 0xef, 0xc3, 0x9b, 0x2b, 0x56, 0xac, 0x45, 0x8a, 0x09, + 0x12, 0x24, 0x48, 0x90, 0x3d, 0x7a, 0xf4, 0xf5, 0xf7, 0xf3, 0xfb, 0xeb, 0xcb, 0x8b, 0x0b, 0x16, + 0x2c, 0x58, 0xb0, 0x7d, 0xfa, 0xe9, 0xcf, 0x83, 0x1b, 0x36, 0x6c, 0xd8, 0xad, 0x47, 0x8e, 0x00]; + // Galois field log table. + var GALOIS_LOG = [ + 0xff, 0x00, 0x01, 0x19, 0x02, 0x32, 0x1a, 0xc6, 0x03, 0xdf, 0x33, 0xee, 0x1b, 0x68, 0xc7, 0x4b, + 0x04, 0x64, 0xe0, 0x0e, 0x34, 0x8d, 0xef, 0x81, 0x1c, 0xc1, 0x69, 0xf8, 0xc8, 0x08, 0x4c, 0x71, + 0x05, 0x8a, 0x65, 0x2f, 0xe1, 0x24, 0x0f, 0x21, 0x35, 0x93, 0x8e, 0xda, 0xf0, 0x12, 0x82, 0x45, + 0x1d, 0xb5, 0xc2, 0x7d, 0x6a, 0x27, 0xf9, 0xb9, 0xc9, 0x9a, 0x09, 0x78, 0x4d, 0xe4, 0x72, 0xa6, + 0x06, 0xbf, 0x8b, 0x62, 0x66, 0xdd, 0x30, 0xfd, 0xe2, 0x98, 0x25, 0xb3, 0x10, 0x91, 0x22, 0x88, + 0x36, 0xd0, 0x94, 0xce, 0x8f, 0x96, 0xdb, 0xbd, 0xf1, 0xd2, 0x13, 0x5c, 0x83, 0x38, 0x46, 0x40, + 0x1e, 0x42, 0xb6, 0xa3, 0xc3, 0x48, 0x7e, 0x6e, 0x6b, 0x3a, 0x28, 0x54, 0xfa, 0x85, 0xba, 0x3d, + 0xca, 0x5e, 0x9b, 0x9f, 0x0a, 0x15, 0x79, 0x2b, 0x4e, 0xd4, 0xe5, 0xac, 0x73, 0xf3, 0xa7, 0x57, + 0x07, 0x70, 0xc0, 0xf7, 0x8c, 0x80, 0x63, 0x0d, 0x67, 0x4a, 0xde, 0xed, 0x31, 0xc5, 0xfe, 0x18, + 0xe3, 0xa5, 0x99, 0x77, 0x26, 0xb8, 0xb4, 0x7c, 0x11, 0x44, 0x92, 0xd9, 0x23, 0x20, 0x89, 0x2e, + 0x37, 0x3f, 0xd1, 0x5b, 0x95, 0xbc, 0xcf, 0xcd, 0x90, 0x87, 0x97, 0xb2, 0xdc, 0xfc, 0xbe, 0x61, + 0xf2, 0x56, 0xd3, 0xab, 0x14, 0x2a, 0x5d, 0x9e, 0x84, 0x3c, 0x39, 0x53, 0x47, 0x6d, 0x41, 0xa2, + 0x1f, 0x2d, 0x43, 0xd8, 0xb7, 0x7b, 0xa4, 0x76, 0xc4, 0x17, 0x49, 0xec, 0x7f, 0x0c, 0x6f, 0xf6, + 0x6c, 0xa1, 0x3b, 0x52, 0x29, 0x9d, 0x55, 0xaa, 0xfb, 0x60, 0x86, 0xb1, 0xbb, 0xcc, 0x3e, 0x5a, + 0xcb, 0x59, 0x5f, 0xb0, 0x9c, 0xa9, 0xa0, 0x51, 0x0b, 0xf5, 0x16, 0xeb, 0x7a, 0x75, 0x2c, 0xd7, + 0x4f, 0xae, 0xd5, 0xe9, 0xe6, 0xe7, 0xad, 0xe8, 0x74, 0xd6, 0xf4, 0xea, 0xa8, 0x50, 0x58, 0xaf]; + // *Badness* coefficients. + var N1 = 3; + var N2 = 3; + var N3 = 40; + var N4 = 10; + // Version pattern. + var VERSION_BLOCK = [ + 0xc94, 0x5bc, 0xa99, 0x4d3, 0xbf6, 0x762, 0x847, 0x60d, 0x928, 0xb78, 0x45d, 0xa17, 0x532, + 0x9a6, 0x683, 0x8c9, 0x7ec, 0xec4, 0x1e1, 0xfab, 0x08e, 0xc1a, 0x33f, 0xd75, 0x250, 0x9d5, + 0x6f0, 0x8ba, 0x79f, 0xb0b, 0x42e, 0xa64, 0x541, 0xc69]; + // Mode for node.js file system file writes. + var WRITE_MODE = parseInt('0666', 8); + + // Private variables + // ----------------- + + // Run lengths for badness. + var badBuffer = []; + // Constructor for `canvas` elements in the node.js environment. + var Canvas; + // Data block. + var dataBlock; + // ECC data blocks and tables. + var eccBlock, neccBlock1, neccBlock2; + // ECC buffer. + var eccBuffer = []; + // ECC level (defaults to **L**). + var eccLevel = 1; + // Image buffer. + var frameBuffer = []; + // Fixed part of the image. + var frameMask = []; + // File system within the node.js environment. + var fs; + // Constructor for `img` elements in the node.js environment. + var Image; + // Indicates whether or not this script is running in node.js. + var inNode = false; + // Generator polynomial. + var polynomial = []; + // Save the previous value of the `qr` variable. + var previousQr = root.qr; + // Data input buffer. + var stringBuffer = []; + // Version for the data. + var version; + // Data width is based on `version`. + var width; + + // Private functions + // ----------------- + + // Create a new canvas using `document.createElement` unless script is running in node.js, in + // which case the `canvas` module is used. + function createCanvas() { + return inNode ? new Canvas() : root.document.createElement('canvas'); + } + + // Create a new image using `document.createElement` unless script is running in node.js, in + // which case the `canvas` module is used. + function createImage() { + return inNode ? new Image() : root.document.createElement('img'); + } + + // Force the canvas image to be downloaded in the browser. + // Optionally, a `callback` function can be specified which will be called upon completed. Since + // this is not an asynchronous operation, this is merely convenient and helps simplify the + // calling code. + function download(cvs, data, callback) { + var mime = data.mime || DEFAULT_MIME; + + root.location.href = cvs.toDataURL(mime).replace(mime, DOWNLOAD_MIME); + + if (typeof callback === 'function') callback(); + } + + // Normalize the `data` that is provided to the main API. + function normalizeData(data) { + if (typeof data === 'string') data = { + value: data + }; + return data || {}; + } + + // Override the `qr` API methods that require HTML5 canvas support to throw a relevant error. + function overrideAPI(qr) { + var methods = ['canvas', 'image', 'save', 'saveSync', 'toDataURL']; + var i; + + function overrideMethod(name) { + qr[name] = function() { + throw new Error(name + ' requires HTML5 canvas element support'); + }; + } + + for (i = 0; i < methods.length; i++) { + overrideMethod(methods[i]); + } + } + + // Asynchronously write the data of the rendered canvas to a given file path. + function writeFile(cvs, data, callback) { + if (typeof data.path !== 'string') { + return callback(new TypeError('Invalid path type: ' + typeof data.path)); + } + + var fd, buff; + + // Write the buffer to the open file stream once both prerequisites are met. + function writeBuffer() { + fs.write(fd, buff, 0, buff.length, 0, function(error) { + fs.close(fd); + + callback(error); + }); + } + + // Create a buffer of the canvas' data. + cvs.toBuffer(function(error, _buff) { + if (error) return callback(error); + + buff = _buff; + if (fd) { + writeBuffer(); + } + }); + + // Open a stream for the file to be written. + fs.open(data.path, 'w', WRITE_MODE, function(error, _fd) { + if (error) return callback(error); + + fd = _fd; + if (buff) { + writeBuffer(); + } + }); + } + + // Write the data of the rendered canvas to a given file path. + function writeFileSync(cvs, data) { + if (typeof data.path !== 'string') { + throw new TypeError('Invalid path type: ' + typeof data.path); + } + + var buff = cvs.toBuffer(); + var fd = fs.openSync(data.path, 'w', WRITE_MODE); + + try { + fs.writeSync(fd, buff, 0, buff.length, 0); + } finally { + fs.closeSync(fd); + } + } + + // Set bit to indicate cell in frame is immutable (symmetric around diagonal). + function setMask(x, y) { + var bit; + + if (x > y) { + bit = x; + x = y; + y = bit; + } + + bit = y; + bit *= y; + bit += y; + bit >>= 1; + bit += x; + + frameMask[bit] = 1; + } + + // Enter alignment pattern. Foreground colour to frame, background to mask. Frame will be merged + // with mask later. + function addAlignment(x, y) { + var i; + + frameBuffer[x + width * y] = 1; + + for (i = -2; i < 2; i++) { + frameBuffer[(x + i) + width * (y - 2)] = 1; + frameBuffer[(x - 2) + width * (y + i + 1)] = 1; + frameBuffer[(x + 2) + width * (y + i)] = 1; + frameBuffer[(x + i + 1) + width * (y + 2)] = 1; + } + + for (i = 0; i < 2; i++) { + setMask(x - 1, y + i); + setMask(x + 1, y - i); + setMask(x - i, y - 1); + setMask(x + i, y + 1); + } + } + + // Exponentiation mod N. + function modN(x) { + while (x >= 255) { + x -= 255; + x = (x >> 8) + (x & 255); + } + + return x; + } + + // Calculate and append `ecc` data to the `data` block. If block is in the string buffer the + // indices to buffers are used. + function appendData(data, dataLength, ecc, eccLength) { + var bit, i, j; + + for (i = 0; i < eccLength; i++) { + stringBuffer[ecc + i] = 0; + } + + for (i = 0; i < dataLength; i++) { + bit = GALOIS_LOG[stringBuffer[data + i] ^ stringBuffer[ecc]]; + + if (bit !== 255) { + for (j = 1; j < eccLength; j++) { + stringBuffer[ecc + j - 1] = stringBuffer[ecc + j] ^ GALOIS_EXPONENT[modN(bit + polynomial[eccLength - j])]; + } + } else { + for (j = ecc; j < ecc + eccLength; j++) { + stringBuffer[j] = stringBuffer[j + 1]; + } + } + + stringBuffer[ecc + eccLength - 1] = bit === 255 ? 0 : GALOIS_EXPONENT[modN(bit + polynomial[0])]; + } + } + + // Check mask since symmetricals use half. + function isMasked(x, y) { + var bit; + + if (x > y) { + bit = x; + x = y; + y = bit; + } + + bit = y; + bit += y * y; + bit >>= 1; + bit += x; + + return frameMask[bit] === 1; + } + + // Apply the selected mask out of the 8 options. + function applyMask(mask) { + var x, y, r3x, r3y; + + switch (mask) { + case 0: + for (y = 0; y < width; y++) { + for (x = 0; x < width; x++) { + if (!((x + y) & 1) && !isMasked(x, y)) { + frameBuffer[x + y * width] ^= 1; + } + } + } + + break; + case 1: + for (y = 0; y < width; y++) { + for (x = 0; x < width; x++) { + if (!(y & 1) && !isMasked(x, y)) { + frameBuffer[x + y * width] ^= 1; + } + } + } + + break; + case 2: + for (y = 0; y < width; y++) { + for (r3x = 0, x = 0; x < width; x++, r3x++) { + if (r3x === 3) r3x = 0; + + if (!r3x && !isMasked(x, y)) { + frameBuffer[x + y * width] ^= 1; + } + } + } + + break; + case 3: + for (r3y = 0, y = 0; y < width; y++, r3y++) { + if (r3y === 3) r3y = 0; + + for (r3x = r3y, x = 0; x < width; x++, r3x++) { + if (r3x === 3) r3x = 0; + + if (!r3x && !isMasked(x, y)) { + frameBuffer[x + y * width] ^= 1; + } + } + } + + break; + case 4: + for (y = 0; y < width; y++) { + for (r3x = 0, r3y = ((y >> 1) & 1), x = 0; x < width; x++, r3x++) { + if (r3x === 3) { + r3x = 0; + r3y = !r3y; + } + + if (!r3y && !isMasked(x, y)) { + frameBuffer[x + y * width] ^= 1; + } + } + } + + break; + case 5: + for (r3y = 0, y = 0; y < width; y++, r3y++) { + if (r3y === 3) r3y = 0; + + for (r3x = 0, x = 0; x < width; x++, r3x++) { + if (r3x === 3) r3x = 0; + + if (!((x & y & 1) + !(!r3x | !r3y)) && !isMasked(x, y)) { + frameBuffer[x + y * width] ^= 1; + } + } + } + + break; + case 6: + for (r3y = 0, y = 0; y < width; y++, r3y++) { + if (r3y === 3) r3y = 0; + + for (r3x = 0, x = 0; x < width; x++, r3x++) { + if (r3x === 3) r3x = 0; + + if (!(((x & y & 1) + (r3x && (r3x === r3y))) & 1) && !isMasked(x, y)) { + frameBuffer[x + y * width] ^= 1; + } + } + } + + break; + case 7: + for (r3y = 0, y = 0; y < width; y++, r3y++) { + if (r3y === 3) r3y = 0; + + for (r3x = 0, x = 0; x < width; x++, r3x++) { + if (r3x === 3) r3x = 0; + + if (!(((r3x && (r3x === r3y)) + ((x + y) & 1)) & 1) && !isMasked(x, y)) { + frameBuffer[x + y * width] ^= 1; + } + } + } + + break; + } + } + + // Using the table for the length of each run, calculate the amount of bad image. Long runs or + // those that look like finders are called twice; once for X and Y. + function getBadRuns(length) { + var badRuns = 0; + var i; + + for (i = 0; i <= length; i++) { + if (badBuffer[i] >= 5) { + badRuns += N1 + badBuffer[i] - 5; + } + } + + // FBFFFBF as in finder. + for (i = 3; i < length - 1; i += 2) { + if (badBuffer[i - 2] === badBuffer[i + 2] && badBuffer[i + 2] === badBuffer[i - 1] && badBuffer[i - 1] === badBuffer[i + 1] && badBuffer[i - 1] * 3 === badBuffer[i] && + // Background around the foreground pattern? Not part of the specs. + (badBuffer[i - 3] === 0 || i + 3 > length || badBuffer[i - 3] * 3 >= badBuffer[i] * 4 || badBuffer[i + 3] * 3 >= badBuffer[i] * 4)) { + badRuns += N3; + } + } + + return badRuns; + } + + // Calculate how bad the masked image is (e.g. blocks, imbalance, runs, or finders). + function checkBadness() { + var b, b1, bad, big, bw, count, h, x, y; + bad = bw = count = 0; + + // Blocks of same colour. + for (y = 0; y < width - 1; y++) { + for (x = 0; x < width - 1; x++) { + // All foreground colour. + if ((frameBuffer[x + width * y] && frameBuffer[(x + 1) + width * y] && frameBuffer[x + width * (y + 1)] && frameBuffer[(x + 1) + width * (y + 1)]) || + // All background colour. + !(frameBuffer[x + width * y] || frameBuffer[(x + 1) + width * y] || frameBuffer[x + width * (y + 1)] || frameBuffer[(x + 1) + width * (y + 1)])) { + bad += N2; + } + } + } + + // X runs. + for (y = 0; y < width; y++) { + badBuffer[0] = 0; + + for (h = b = x = 0; x < width; x++) { + if ((b1 = frameBuffer[x + width * y]) === b) { + badBuffer[h]++; + } else { + badBuffer[++h] = 1; + } + + b = b1; + bw += b ? 1 : -1; + } + + bad += getBadRuns(h); + } + + if (bw < 0) bw = -bw; + + big = bw; + big += big << 2; + big <<= 1; + + while (big > width * width) { + big -= width * width; + count++; + } + + bad += count * N4; + + // Y runs. + for (x = 0; x < width; x++) { + badBuffer[0] = 0; + + for (h = b = y = 0; y < width; y++) { + if ((b1 = frameBuffer[x + width * y]) === b) { + badBuffer[h]++; + } else { + badBuffer[++h] = 1; + } + + b = b1; + } + + bad += getBadRuns(h); + } + + return bad; + } + + // Generate the encoded QR image for the string provided. + function generateFrame(str) { + var i, j, k, m, t, v, x, y; + + // Find the smallest version that fits the string. + t = str.length; + + version = 0; + + do { + version++; + + k = (eccLevel - 1) * 4 + (version - 1) * 16; + + neccBlock1 = ECC_BLOCKS[k++]; + neccBlock2 = ECC_BLOCKS[k++]; + dataBlock = ECC_BLOCKS[k++]; + eccBlock = ECC_BLOCKS[k]; + + k = dataBlock * (neccBlock1 + neccBlock2) + neccBlock2 - 3 + (version <= 9); + + if (t <= k) break; + } while (version < 40); + + // FIXME: Ensure that it fits insted of being truncated. + width = 17 + 4 * version; + + // Allocate, clear and setup data structures. + v = dataBlock + (dataBlock + eccBlock) * (neccBlock1 + neccBlock2) + neccBlock2; + + for (t = 0; t < v; t++) { + eccBuffer[t] = 0; + } + + stringBuffer = str.slice(0); + + for (t = 0; t < width * width; t++) { + frameBuffer[t] = 0; + } + + for (t = 0; t < (width * (width + 1) + 1) / 2; t++) { + frameMask[t] = 0; + } + + // Insert finders: Foreground colour to frame and background to mask. + for (t = 0; t < 3; t++) { + k = y = 0; + + if (t === 1) k = (width - 7); + if (t === 2) y = (width - 7); + + frameBuffer[(y + 3) + width * (k + 3)] = 1; + + for (x = 0; x < 6; x++) { + frameBuffer[(y + x) + width * k] = 1; + frameBuffer[y + width * (k + x + 1)] = 1; + frameBuffer[(y + 6) + width * (k + x)] = 1; + frameBuffer[(y + x + 1) + width * (k + 6)] = 1; + } + + for (x = 1; x < 5; x++) { + setMask(y + x, k + 1); + setMask(y + 1, k + x + 1); + setMask(y + 5, k + x); + setMask(y + x + 1, k + 5); + } + + for (x = 2; x < 4; x++) { + frameBuffer[(y + x) + width * (k + 2)] = 1; + frameBuffer[(y + 2) + width * (k + x + 1)] = 1; + frameBuffer[(y + 4) + width * (k + x)] = 1; + frameBuffer[(y + x + 1) + width * (k + 4)] = 1; + } + } + + // Alignment blocks. + if (version > 1) { + t = ALIGNMENT_DELTA[version]; + y = width - 7; + + for (;;) { + x = width - 7; + + while (x > t - 3) { + addAlignment(x, y); + + if (x < t) break; + + x -= t; + } + + if (y <= t + 9) break; + + y -= t; + + addAlignment(6, y); + addAlignment(y, 6); + } + } + + // Single foreground cell. + frameBuffer[8 + width * (width - 8)] = 1; + + // Timing gap (mask only). + for (y = 0; y < 7; y++) { + setMask(7, y); + setMask(width - 8, y); + setMask(7, y + width - 7); + } + + for (x = 0; x < 8; x++) { + setMask(x, 7); + setMask(x + width - 8, 7); + setMask(x, width - 8); + } + + // Reserve mask, format area. + for (x = 0; x < 9; x++) { + setMask(x, 8); + } + + for (x = 0; x < 8; x++) { + setMask(x + width - 8, 8); + setMask(8, x); + } + + for (y = 0; y < 7; y++) { + setMask(8, y + width - 7); + } + + // Timing row/column. + for (x = 0; x < width - 14; x++) { + if (x & 1) { + setMask(8 + x, 6); + setMask(6, 8 + x); + } else { + frameBuffer[(8 + x) + width * 6] = 1; + frameBuffer[6 + width * (8 + x)] = 1; + } + } + + // Version block. + if (version > 6) { + t = VERSION_BLOCK[version - 7]; + k = 17; + + for (x = 0; x < 6; x++) { + for (y = 0; y < 3; y++, k--) { + if (1 & (k > 11 ? version >> (k - 12) : t >> k)) { + frameBuffer[(5 - x) + width * (2 - y + width - 11)] = 1; + frameBuffer[(2 - y + width - 11) + width * (5 - x)] = 1; + } else { + setMask(5 - x, 2 - y + width - 11); + setMask(2 - y + width - 11, 5 - x); + } + } + } + } + + // Sync mask bits. Only set above for background cells, so now add the foreground. + for (y = 0; y < width; y++) { + for (x = 0; x <= y; x++) { + if (frameBuffer[x + width * y]) { + setMask(x, y); + } + } + } + + // Convert string to bit stream. 8-bit data to QR-coded 8-bit data (numeric, alphanum, or kanji + // not supported). + v = stringBuffer.length; + + // String to array. + for (i = 0; i < v; i++) { + eccBuffer[i] = stringBuffer.charCodeAt(i); + } + + stringBuffer = eccBuffer.slice(0); + + // Calculate max string length. + x = dataBlock * (neccBlock1 + neccBlock2) + neccBlock2; + + if (v >= x - 2) { + v = x - 2; + + if (version > 9) v--; + } + + // Shift and re-pack to insert length prefix. + i = v; + + if (version > 9) { + stringBuffer[i + 2] = 0; + stringBuffer[i + 3] = 0; + + while (i--) { + t = stringBuffer[i]; + + stringBuffer[i + 3] |= 255 & (t << 4); + stringBuffer[i + 2] = t >> 4; + } + + stringBuffer[2] |= 255 & (v << 4); + stringBuffer[1] = v >> 4; + stringBuffer[0] = 0x40 | (v >> 12); + } else { + stringBuffer[i + 1] = 0; + stringBuffer[i + 2] = 0; + + while (i--) { + t = stringBuffer[i]; + + stringBuffer[i + 2] |= 255 & (t << 4); + stringBuffer[i + 1] = t >> 4; + } + + stringBuffer[1] |= 255 & (v << 4); + stringBuffer[0] = 0x40 | (v >> 4); + } + + // Fill to end with pad pattern. + i = v + 3 - (version < 10); + + while (i < x) { + stringBuffer[i++] = 0xec; + stringBuffer[i++] = 0x11; + } + + // Calculate generator polynomial. + polynomial[0] = 1; + + for (i = 0; i < eccBlock; i++) { + polynomial[i + 1] = 1; + + for (j = i; j > 0; j--) { + polynomial[j] = polynomial[j] ? polynomial[j - 1] ^ GALOIS_EXPONENT[modN(GALOIS_LOG[polynomial[j]] + i)] : polynomial[j - 1]; + } + + polynomial[0] = GALOIS_EXPONENT[modN(GALOIS_LOG[polynomial[0]] + i)]; + } + + // Use logs for generator polynomial to save calculation step. + for (i = 0; i <= eccBlock; i++) { + polynomial[i] = GALOIS_LOG[polynomial[i]]; + } + + // Append ECC to data buffer. + k = x; + y = 0; + + for (i = 0; i < neccBlock1; i++) { + appendData(y, dataBlock, k, eccBlock); + + y += dataBlock; + k += eccBlock; + } + + for (i = 0; i < neccBlock2; i++) { + appendData(y, dataBlock + 1, k, eccBlock); + + y += dataBlock + 1; + k += eccBlock; + } + + // Interleave blocks. + y = 0; + + for (i = 0; i < dataBlock; i++) { + for (j = 0; j < neccBlock1; j++) { + eccBuffer[y++] = stringBuffer[i + j * dataBlock]; + } + + for (j = 0; j < neccBlock2; j++) { + eccBuffer[y++] = stringBuffer[(neccBlock1 * dataBlock) + i + (j * (dataBlock + 1))]; + } + } + + for (j = 0; j < neccBlock2; j++) { + eccBuffer[y++] = stringBuffer[(neccBlock1 * dataBlock) + i + (j * (dataBlock + 1))]; + } + + for (i = 0; i < eccBlock; i++) { + for (j = 0; j < neccBlock1 + neccBlock2; j++) { + eccBuffer[y++] = stringBuffer[x + i + j * eccBlock]; + } + } + + stringBuffer = eccBuffer; + + // Pack bits into frame avoiding masked area. + x = y = width - 1; + k = v = 1; + + // inteleaved data and ECC codes. + m = (dataBlock + eccBlock) * (neccBlock1 + neccBlock2) + neccBlock2; + + for (i = 0; i < m; i++) { + t = stringBuffer[i]; + + for (j = 0; j < 8; j++, t <<= 1) { + if (0x80 & t) { + frameBuffer[x + width * y] = 1; + } + + // Find next fill position. + do { + if (v) { + x--; + } else { + x++; + + if (k) { + if (y !== 0) { + y--; + } else { + x -= 2; + k = !k; + + if (x === 6) { + x--; + y = 9; + } + } + } else { + if (y !== width - 1) { + y++; + } else { + x -= 2; + k = !k; + + if (x === 6) { + x--; + y -= 8; + } + } + } + } + + v = !v; + } while (isMasked(x, y)); + } + } + + // Save pre-mask copy of frame. + stringBuffer = frameBuffer.slice(0); + + t = 0; + y = 30000; + + // Using `for` instead of `while` since in original Arduino code if an early mask was *good + // enough* it wouldn't try for a better one since they get more complex and take longer. + for (k = 0; k < 8; k++) { + // Returns foreground-background imbalance. + applyMask(k); + + x = checkBadness(); + + // Is current mask better than previous best? + if (x < y) { + y = x; + t = k; + } + + // Don't increment `i` to a void redoing mask. + if (t === 7) break; + + // Reset for next pass. + frameBuffer = stringBuffer.slice(0); + } + + // Redo best mask as none were *good enough* (i.e. last wasn't `t`). + if (t !== k) { + applyMask(t); + } + + // Add in final mask/ECC level bytes. + y = FINAL_FORMAT[t + ((eccLevel - 1) << 3)]; + + // Low byte. + for (k = 0; k < 8; k++, y >>= 1) { + if (y & 1) { + frameBuffer[(width - 1 - k) + width * 8] = 1; + + if (k < 6) { + frameBuffer[8 + width * k] = 1; + } else { + frameBuffer[8 + width * (k + 1)] = 1; + } + } + } + + // High byte. + for (k = 0; k < 7; k++, y >>= 1) { + if (y & 1) { + frameBuffer[8 + width * (width - 7 + k)] = 1; + + if (k) { + frameBuffer[(6 - k) + width * 8] = 1; + } else { + frameBuffer[7 + width * 8] = 1; + } + } + } + + // Finally, return the image data. + return frameBuffer; + } + + // qr.js setup + // ----------- + + // Build the publicly exposed API. + var qr = { + + // Constants + // --------- + + // Current version of `qr`. + VERSION: '1.1.4', + + // QR functions + // ------------ + + // Generate the QR code using the data provided and render it on to a `` element. + // If no `` element is specified in the argument provided a new one will be created and + // used. + // ECC (error correction capacity) determines how many intential errors are contained in the QR + // code. + canvas: function(data) { + data = normalizeData(data); + + // Module size of the generated QR code (i.e. 1-10). + // var size = data.size >= 2 && data.size <= 10 ? data.size : 4; + // // Actual size of the QR code symbol and is scaled to 25 pixels (e.g. 1 = 25px, 3 = 75px). + // size *= 25; + + var size = data.size >= 25 ? data.size : 25; + + // `` element used to render the QR code. + var cvs = data.canvas || createCanvas(); + // Retreive the 2D context of the canvas. + var c2d = cvs.getContext('2d'); + // Ensure the canvas has the correct dimensions. + c2d.canvas.width = size; + c2d.canvas.height = size; + // Fill the canvas with the correct background colour. + c2d.fillStyle = data.background || '#fff'; + c2d.fillRect(0, 0, size, size); + + // Determine the ECC level to be applied. + eccLevel = ECC_LEVELS[(data.level && data.level.toUpperCase()) || 'L']; + + // Generate the image frame for the given `value`. + var frame = generateFrame(data.value || ''); + + c2d.lineWidth = 1; + + // Determine the *pixel* size. + var px = size; + px /= width; + px = Math.floor(px); + + var offset = Math.floor((size - (px * width)) / 2); + + // Draw the QR code. + c2d.clearRect(0, 0, size, size); + c2d.fillStyle = data.background || '#fff'; + c2d.fillRect(0, 0, size, size); + c2d.fillStyle = data.foreground || '#000'; + + var i, j; + + for (i = 0; i < width; i++) { + for (j = 0; j < width; j++) { + if (frame[j * width + i]) { + c2d.fillRect(px * i + offset, px * j + offset, px, px); + } + } + } + + return cvs; + }, + + // Generate the QR code using the data provided and render it on to a `` element. + // If no `` element is specified in the argument provided a new one will be created and + // used. + // ECC (error correction capacity) determines how many intential errors are contained in the QR + // code. + image: function(data) { + data = normalizeData(data); + + // `` element only which the QR code is rendered. + var cvs = this.canvas(data); + // `` element used to display the QR code. + var img = data.image || createImage(); + + // Apply the QR code to `img`. + img.src = cvs.toDataURL(data.mime || DEFAULT_MIME); + img.height = cvs.height; + img.width = cvs.width; + + return img; + }, + + // Generate the QR code using the data provided and render it on to a `` element and + // save it as an image file. + // If no `` element is specified in the argument provided a new one will be created and + // used. + // ECC (error correction capacity) determines how many intential errors are contained in the QR + // code. + // If called in a browser the `path` property/argument is ignored and will simply prompt the + // user to choose a location and file name. However, if called within node.js the file will be + // saved to specified path. + // A `callback` function must be provided which will be called once the saving process has + // started. If an error occurs it will be passed as the first argument to this function, + // otherwise this argument will be `null`. + save: function(data, path, callback) { + data = normalizeData(data); + + switch (typeof path) { + case 'function': + callback = path; + path = null; + break; + case 'string': + data.path = path; + break; + } + + // Callback function is required. + if (typeof callback !== 'function') { + throw new TypeError('Invalid callback type: ' + typeof callback); + } + + var completed = false; + // `` element only which the QR code is rendered. + var cvs = this.canvas(data); + + // Simple function to try and ensure that the `callback` function is only called once. + function done(error) { + if (!completed) { + completed = true; + + callback(error); + } + } + + if (inNode) { + writeFile(cvs, data, done); + } else { + download(cvs, data, done); + } + }, + + // Generate the QR code using the data provided and render it on to a `` element and + // save it as an image file. + // If no `` element is specified in the argument provided a new one will be created and + // used. + // ECC (error correction capacity) determines how many intential errors are contained in the QR + // code. + // If called in a browser the `path` property/argument is ignored and will simply prompt the + // user to choose a location and file name. However, if called within node.js the file will be + // saved to specified path. + saveSync: function(data, path) { + data = normalizeData(data); + + if (typeof path === 'string') data.path = path; + + // `` element only which the QR code is rendered. + var cvs = this.canvas(data); + + if (inNode) { + writeFileSync(cvs, data); + } else { + download(cvs, data); + } + }, + + // Generate the QR code using the data provided and render it on to a `` element before + // returning its data URI. + // If no `` element is specified in the argument provided a new one will be created and + // used. + // ECC (error correction capacity) determines how many intential errors are contained in the QR + // code. + toDataURL: function(data) { + data = normalizeData(data); + + return this.canvas(data).toDataURL(data.mime || DEFAULT_MIME); + }, + + // Utility functions + // ----------------- + + // Run qr.js in *noConflict* mode, returning the `qr` variable to its previous owner. + // Returns a reference to `qr`. + noConflict: function() { + root.qr = previousQr; + return this; + } + + }; + + // Support + // ------- + + // Export `qr` for node.js and CommonJS. + if (typeof exports !== 'undefined') { + inNode = true; + + if (typeof module !== 'undefined' && module.exports) { + exports = module.exports = qr; + } + exports.qr = qr; + + // Import required node.js modules. + Canvas = require('canvas'); + Image = Canvas.Image; + fs = require('fs'); + } else if (typeof define === 'function' && define.amd) { + define([], function() { + return qr; + }); + } else { + // In non-HTML5 browser so strip base functionality. + if (!root.HTMLCanvasElement) { + overrideAPI(qr); + } + + root.qr = qr; + } + +})(this); diff --git a/src/QRCodeWidget/widget/QRCodeWidget.js b/src/QRCodeWidget/widget/QRCodeWidget.js new file mode 100644 index 0000000..1359b1c --- /dev/null +++ b/src/QRCodeWidget/widget/QRCodeWidget.js @@ -0,0 +1,149 @@ +define([ + "dojo/_base/declare", + "mxui/widget/_WidgetBase", + + "dojo/dom-style", + "dojo/dom-construct", + "dojo/dom-geometry", + "dojo/_base/array", + "dojo/_base/lang", + + "QRCodeWidget/lib/qr" +], function (declare, _WidgetBase, dojoStyle, dojoConstruct, domGeom, dojoArray, lang, qr) { + "use strict"; + + return declare("QRCodeWidget.widget.QRCodeWidget", [ _WidgetBase ], { + + // Parameters configured in the Modeler. + barcodeValue: "", + barcodeSize: 100, + barcodeResponsive: false, + barcodeType: "canvas", + barcodeFGColor: "#000000", + barcodeBGColor: "#FFFFFF", + + // Internal variables + _elementType: "canvas", + _barcodeNode: null, + _handles: [], + _resizeTimer: null, + _contextObj: null, + + postCreate: function () { + logger.debug(this.id + ".postCreate"); + this._handles = []; + + this._elementType = (this.barcodeType === "canvas") ? "canvas" : "img"; + }, + + update: function (obj, callback) { + logger.debug(this.id + ".update"); + + this._contextObj = obj; + this._resetSubscriptions(); + this._updateRendering(callback); + }, + + resize: function () { + if (this.barcodeResponsive) { + if (this._resizeTimer) { + clearTimeout(this._resizeTimer); + } + + this._resizeTimer = setTimeout(lang.hitch(this, function () { + logger.debug(this.id + ".resize"); + this._updateRendering(); + }), 50); + } + }, + + _getSize: function () { + if (this.barcodeResponsive) { + var position = domGeom.position(this.domNode.parentElement, false); + return position.w > 0 ? position.w : this.barcodeSize; + } else { + return this.barcodeSize; + } + }, + + _generateQr: function (value, callback) { + logger.debug(this.id + "._generateQr"); + var options = { + value: value, + size: this._getSize(), + background: this.barcodeBGColor, + foreground: this.barcodeFGColor + }; + + if (this.barcodeType === "canvas") { + options.canvas = this._barcodeNode; + qr.canvas(options); + } else { + options.image = this._barcodeNode; + options.mime = this.barcodeType === "imgpng" ? "image/png" : "image/jpeg"; + qr.image(options); + } + + mendix.lang.nullExec(callback); + }, + + _updateRendering: function (callback) { + logger.debug(this.id + "._updateRendering"); + + if (this._contextObj !== null) { + dojoStyle.set(this.domNode, "display", "block"); + + this._contextObj.fetch(this.barcodeValue, lang.hitch(this, function (value) { + + if (this._barcodeNode) { + dojoConstruct.destroy(this._barcodeNode); + } + + if (value === "") { + dojoStyle.set(this.domNode, "display", "none"); + mendix.lang.nullExec(callback); + } else { + this._barcodeNode = dojoConstruct.create(this._elementType, {}, this.domNode); + this._generateQr(value, callback); + } + + })); + } else { + dojoStyle.set(this.domNode, "display", "none"); + mendix.lang.nullExec(callback); + } + }, + + _resetSubscriptions: function () { + logger.debug(this.id + "._resetSubscriptions"); + + if (this._handles) { + dojoArray.forEach(this._handles, function (handle) { + mx.data.unsubscribe(handle); + }); + this._handles = []; + } + + if (this._contextObj) { + var objectHandle = mx.data.subscribe({ + guid: this._contextObj.getGuid(), + callback: lang.hitch(this, function (guid) { + this._updateRendering(); + }) + }); + + var attrHandle = mx.data.subscribe({ + guid: this._contextObj.getGuid(), + attr: this.barcodeValue, + callback: lang.hitch(this, function (guid, attr, attrValue) { + this._updateRendering(); + }) + }); + + this._handles = [ objectHandle, attrHandle ]; + } + } + }); +}); + +require(["QRCodeWidget/widget/QRCodeWidget"]); diff --git a/src/package.xml b/src/package.xml new file mode 100644 index 0000000..af9a8b8 --- /dev/null +++ b/src/package.xml @@ -0,0 +1,11 @@ + + + + + + + + + + + \ No newline at end of file diff --git a/test/Test.mpr b/test/Test.mpr new file mode 100644 index 0000000..fcf3a5e Binary files /dev/null and b/test/Test.mpr differ diff --git a/test/widgets/QRCodeWidget.mpk b/test/widgets/QRCodeWidget.mpk new file mode 100644 index 0000000..a73afa9 Binary files /dev/null and b/test/widgets/QRCodeWidget.mpk differ diff --git a/xsd/widget.xsd b/xsd/widget.xsd new file mode 100644 index 0000000..3f4c734 --- /dev/null +++ b/xsd/widget.xsd @@ -0,0 +1,153 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +