diff --git a/.eslintrc.js b/.eslintrc.js index 90c208a77..4088884ec 100644 --- a/.eslintrc.js +++ b/.eslintrc.js @@ -34,8 +34,6 @@ module.exports = { 'Crossroads': "readonly", // vendors/jua 'Jua': "readonly", - // vendors/qr.js - 'qr': "readonly", // vendors/bootstrap/bootstrap.native.js 'BSN': "readonly" }, diff --git a/vendors/qr.js/AUTHORS.md b/vendors/qr.js/AUTHORS.md deleted file mode 100644 index 0fa53ceee..000000000 --- a/vendors/qr.js/AUTHORS.md +++ /dev/null @@ -1,7 +0,0 @@ -# Authors ordered by first contribution - -* tz -* Alasdair Mercer -* Alexandre Perrin -* Michael Mason -* Benjamin Besse diff --git a/vendors/qr.js/CHANGES.md b/vendors/qr.js/CHANGES.md deleted file mode 100644 index 08a1f2d7f..000000000 --- a/vendors/qr.js/CHANGES.md +++ /dev/null @@ -1,60 +0,0 @@ -## Version 1.1.4, 2015.11.11 - -* [#2](https://github.com/neocotic/qr.js/issues/2): Fix padding issues -* [#35](https://github.com/neocotic/qr.js/pull/35): Make the QR-code center-aligned -* [#38](https://github.com/neocotic/qr.js/pull/38): Update node-canvas dependency version to support Node.js v4 and above - -## Version 1.1.3, 2014.09.01 - -* [#23](https://github.com/neocotic/qr.js/issues/23): Revert back to [GPL License][] - -## Version 1.1.2, 2014.04.27 - -* [#20](https://github.com/neocotic/qr.js/issues/20): Fix "too many open files" bug - -## Version 1.1.1, 2013.12.03 - -* Fix bug with IIFE - -## Version 1.1.0, 2013.12.02 - -* [#9](https://github.com/neocotic/qr.js/issues/9): Fix RequireJS support -* [#13](https://github.com/neocotic/qr.js/issues/13): Remove [Ender][] support -* [#14](https://github.com/neocotic/qr.js/issues/14): Improve code formatting and style -* [#16](https://github.com/neocotic/qr.js/issues/16): Support different MIME types for `toDataURL` and other related functions -* [#17](https://github.com/neocotic/qr.js/issues/17): Remove unnecessary callback arguments from synchronous functions -* [#17](https://github.com/neocotic/qr.js/issues/17): Make `save` fully asynchronous -* [#17](https://github.com/neocotic/qr.js/issues/17): Add `saveSync` for synchronous saving -* [#18](https://github.com/neocotic/qr.js/issues/18): Add [Grunt][] build system -* [#18](https://github.com/neocotic/qr.js/issues/18): Generate source map as part of build -* [#18](https://github.com/neocotic/qr.js/issues/18): Improve developer documentation -* [#19](https://github.com/neocotic/qr.js/issues/19): Add support for [Bower][] -* Many small fixes and tweaks - -## Version 1.0.3, 2011.12.19 - -* [#3](https://github.com/neocotic/qr.js/issues/3): Rename `QRCode` to `qr` -* [#3](https://github.com/neocotic/qr.js/issues/3): Remove all deprecated methods -* [#4](https://github.com/neocotic/qr.js/issues/4): Reformat code and add additional, along with some original, code comments -* [#6](https://github.com/neocotic/qr.js/issues/6): Add support for [Node.js][], [CommonJS][] and [Ender][] -* [#6](https://github.com/neocotic/qr.js/issues/6): Add optional `callback` functionality to API methods -* [#7](https://github.com/neocotic/qr.js/issues/7): Allow `data` arguments to be an object or string value -* [#8](https://github.com/neocotic/qr.js/issues/8): Add `VERSION` property to the API -* [#8](https://github.com/neocotic/qr.js/issues/8): Add `toDataURL`, `save` and `noConflict` methods to the API -* Now distributed under the [MIT License][] - -## Version 1.0.2, 2011.08.31 - -* [#1](https://github.com/neocotic/qr.js/issues/1): Deprecate `generateCanvas` and `generateImage` and replaced with `canvas` and `image` respectively - -## Version 1.0.1, 2011.08.12 - -* Allow customisation of colours used when rendering - -[bower]: http://bower.io -[commonjs]: http://commonjs.org -[ender]: http://ender.no.de -[gpl license]: http://www.gnu.org/licenses/ -[grunt]: http://gruntjs.com -[mit license]: http://en.wikipedia.org/wiki/MIT_License -[node.js]: http://nodejs.org diff --git a/vendors/qr.js/CONTRIBUTING.md b/vendors/qr.js/CONTRIBUTING.md deleted file mode 100644 index de239d8be..000000000 --- a/vendors/qr.js/CONTRIBUTING.md +++ /dev/null @@ -1,59 +0,0 @@ -# Contributing - -Here are some guidelines that we'd like contributors to follow so that we can have a chance of -keeping things right. - -## Getting Starting - -* Make sure you have a [GitHub account](https://github.com/signup/free) -* Submit a ticket for your issue if one does not already exist - * Clearly describe the issue including steps to reproduce when it is a bug - * Include the earliest version that you know has the issue -* Fork the repository on GitHub -* Read the `INSTALL.md` file - -## Making Changes - -* Create a topic branch from where you want to base your work - * This is usually the master branch - * Only target release branches if you are certain your fix must be on that branch - * To quickly create a topic branch based on master; - `git branch fix/master/my_contribution master` then checkout the new branch with - `git checkout fix/master/my_contribution` - * Avoid working directly on the `master` branch -* Make commits of logical units -* Check for unnecessary whitespace with `git diff --check` before committing -* Make sure your commit messages are in the proper format -* Avoid updating the distributable file or annotated source code documentation - -``` -(#99999) Make the example in CONTRIBUTING imperative and concrete - -Without this patch applied the example commit message in the CONTRIBUTING document is not a -concrete example. This is a problem because the contributor is left to imagine what the commit -message should look like based on a description rather than an example. This patch fixes the -problem by making the example concrete and imperative. - -The first line is a real life imperative statement with a ticket number from our issue tracker. The -body describes the behavior without the patch, why this is a problem, and how the patch fixes the -problem when applied. -``` - -* Make sure you have added the necessary tests for your changes -* Run *all* the tests to assure nothing else was accidentally broken - -## Submitting Changes - -* Ensure you added your details to `AUTHORS.md` in the correct format - `Joe Bloggs ` -* Push your changes to a topic branch in your fork of the repository -* Submit a pull request to neocotic's repository -* Update your issue to mark that you have submitted code and are ready for it to be reviewed - * Include a link to the pull request in the issue - -# Additional Resources - -* [qr.js repository](https://github.com/neocotic/qr.js) -* [Issue tracker](https://github.com/neocotic/qr.js/issues) -* [General GitHub documentation](http://help.github.com) -* [GitHub pull request documentation](http://help.github.com/send-pull-requests) diff --git a/vendors/qr.js/INSTALL.md b/vendors/qr.js/INSTALL.md deleted file mode 100644 index d793d2b86..000000000 --- a/vendors/qr.js/INSTALL.md +++ /dev/null @@ -1,46 +0,0 @@ -This document is only relevant for those that want to contribute to the [qr.js][] open source -project (we love you guys!). If you are only interested in installing the tool look at `README.md`. - -## Build Requirements - -In order to build [qr.js][], you need to have the following install [git][] 1.7+ and [node.js][] -0.8+ (which includes [npm][]). - -### Canvas Support - -[qr.js][] heavily depends on [node-canvas][] to support the HTML5 canvas element in the [node.js][] -environment. Unfortunately, this library is dependant on [Cairo][], which is not managed by -[npm][]. Before you are able to build [qr.js][] (and it's dependencies), you must have [Cairo][] -installed. Please see their wiki on steps on how to do this on various platforms: - -https://github.com/LearnBoost/node-canvas/wiki/_pages - -## Building - -Follow these steps to build [qr.js][]; - -1. Clone a copy of the main [qr.js git repository](https://github.com/neocotic/qr.js) by running - `git clone git://github.com/neocotic/qr.js.git` -2. `cd` to the repository directory -3. Ensure you have all of the dependencies by entering `npm install` -4. Ensure you can run [Grunt][] by running `npm install -g grunt-cli` -5. To run the full test suite enter `grunt test` - * **Pro Tip:** You can easily run step 5 by just entering `grunt` -6. To update the optimized distributable file and documentation enter `grunt dist` - * Outputs to documentation to the `docs` directory - -## Important - -If you're planning on contributing to [qr.js][] please do **NOT** update the distributable file or -documentation (step 6) when submitting a pull request. We will not accept pull requests when these -files have been changed as we do this ourselves when finalizing a release. - -Read the `CONTRIBUTING.md` file for more information about submitting pull requests. - -[cairo]: http://cairographics.org -[git]: http://git-scm.com -[grunt]: http://gruntjs.com -[node.js]: http://nodejs.org -[node-canvas]: https://github.com/LearnBoost/node-canvas -[npm]: http://npmjs.org -[qr.js]: http://neocotic.com/qr.js diff --git a/vendors/qr.js/LICENSE.md b/vendors/qr.js/LICENSE.md deleted file mode 100644 index dec605db5..000000000 --- a/vendors/qr.js/LICENSE.md +++ /dev/null @@ -1,14 +0,0 @@ -Copyright (C) 2015 Alasdair Mercer, http://neocotic.com - -This program is free software: you can redistribute it and/or modify -it under the terms of the GNU General Public License as published by -the Free Software Foundation, either version 3 of the License, or -(at your option) any later version. - -This program is distributed in the hope that it will be useful, -but WITHOUT ANY WARRANTY; without even the implied warranty of -MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -GNU General Public License for more details. - -You should have received a copy of the GNU General Public License -along with this program. If not, see . diff --git a/vendors/qr.js/README.md b/vendors/qr.js/README.md deleted file mode 100644 index 74ec9a12c..000000000 --- a/vendors/qr.js/README.md +++ /dev/null @@ -1,290 +0,0 @@ - __ - __ _ __ /\_\ ____ - /'__`\/\`'__\ \/\ \ /',__\ - /\ \L\ \ \ \/__ \ \ \/\__, `\ - \ \___, \ \_\\_\_\ \ \/\____/ - \/___/\ \/_//_/\ \_\ \/___/ - \ \_\ \ \____/ - \/_/ \/___/ - -[qr.js][] is a pure JavaScript library for [QR code][] generation using canvas. - -* [Install](#install) -* [Examples](#examples) -* [API](#api) -* [Canvas Support](#canvas-support) -* [Bugs](#bugs) -* [Questions](#questions) - -## Install - -Install using the package manager for your desired environment(s): - -``` bash -# for node.js: -$ npm install qr-js -# OR; for the browser: -$ bower install qr-js -``` - -## Examples - -In the browser: - -``` html - - - - - - - -``` - -In [node.js][]: - -``` javascript -var qr = require('qr-js'); - -qr.saveSync('http://neocotic.com/qr.js', 'qrcode.png'); -``` - -## API - -### Standard Data - -The following configuration data options are recognised by all of the core API methods (all of -which are optional): - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
PropertyDescriptionDefault
backgroundBackground colour to be used#fff
canvas<canvas> element in which the QR code should be renderedCreates a new element
foregroundForeground colour to be used#000
levelECC (error correction capacity) level to be appliedL
sizeModule size of the generated QR code4
valueValue to be encoded in the generated QR code""
- -### `canvas([data|value])` -Renders a QR code in an HTML5 `` element for a given value. - -``` javascript -// Render the QR code on a newly created canvas element -var canvas = qr.canvas('http://neocotic.com/qr.js'); -// Re-render the QR code on an existing element -qr.canvas({ - canvas: canvas, - value: 'https://github.com/neocotic/qr.js' -}); -``` - -### `image([data|value])` -Renders a QR code in an HTML `` element for a given value. - -``` javascript -// Render the QR code on a newly created img element -var img = qr.image('http://neocotic.com/qr.js'); -// Re-render the QR code on an existing element -qr.image({ - image: img, - value: 'https://github.com/neocotic/qr.js' -}); -``` - -#### Additional Data -As well as the [Standard Data](#standard-data), this method also accepts the following additional -data options: - - - - - - - - - - - - - - - - - -
PropertyDescriptionDefault
image<img> element in which the QR code should be renderedCreates a new element
mimeMIME type to process the QR code imageimage/png
- -### `save([data|value][, path], callback)` -Saves a QR code, which has been rendered for a given value, to the user's file system. - -``` javascript -// Render a QR code to a PNG file -qr.save('http://neocotic.com/qr.js', 'qr.png', function(err) { - if (err) throw err; - - // ... -}); -// Render a QR code to a JPEG file -qr.save({ - mime: 'image/jpeg', - path: 'qr.jpg', - value: 'https://github.com/neocotic/qr.js' -}, function(err) { - if (err) throw err; - - // ... -}); -``` - -**Note:** Currently, in the browser, this just does it's best to force a download prompt. We will -try to improve on this in the future. - -#### Additional Data -As well as the [Standard Data](#standard-data), this method also accepts the following additional -data options: - - - - - - - - - - - - - - - - - -
PropertyDescriptionDefault
mimeMIME type to process the QR code imageimage/png
pathPath to which the QR code should be saved
Ignored in browsers		Required if not specified as an argument
- -### `saveSync([data|value][, path])` -Synchronous [`save(3)`](#savedatavalue-path-callback). - -### `toDataURL([data|value])` -Returns a data URL for rendered QR code. This is a convenient shorthand for dealing with the native -`HTMLCanvasElement.prototype.toDataURL` function. - -``` javascript -console.log(qr.toDataURL('http://neocotic.com/qr.js')); // "data:image/png;base64,iVBORw0KGgoAAAA..." -console.log(qr.toDataURL({ - mime: 'image/jpeg', - value: 'https://github.com/neocotic/qr.js' -})); // "data:image/jpeg;base64,/9j/4AAQSkZJRg..." -``` - -#### Additional Data -As well as the [Standard Data](#standard-data), this method also accepts the following additional -data options: - - - - - - - - - - - - -
PropertyDescriptionDefault
mimeMIME type to process the QR code imageimage/png
- -### Miscellaneous - -#### `noConflict()` -Returns `qr` in a no-conflict state, reallocating the `qr` global variable name to its previous -owner, where possible. - -This is really just intended for use within a browser. - -``` html - - - -``` - -#### `VERSION` -The current version of `qr`. - -``` javascript -console.log(qr.VERSION); // "1.1.4" -``` - -## Canvas Support - -For browser users; their browser must support the HTML5 canvas element or the API will throw an -error immediately. - -For [node.js][] users; [qr.js][] heavily depends on [node-canvas][] to support the HTML5 canvas -element in the [node.js][] environment. Unfortunately, this library is dependant on [Cairo][], -which is not managed by [npm][]. Before you are able to install [qr.js][] (and it's dependencies), -you must have [Cairo][] installed. Please see their wiki on steps on how to do this on various -platforms: - -https://github.com/LearnBoost/node-canvas/wiki/_pages - -## Bugs - -If you have any problems with this library or would like to see the changes currently in -development you can do so here; - -https://github.com/neocotic/qr.js/issues - -## Questions? - -Take a look at `docs/qr.html` to get a better understanding of what the code is doing. - -If that doesn't help, feel free to follow me on Twitter, [@neocotic][]. - -However, if you want more information or examples of using this library please visit the project's -homepage; - -http://neocotic.com/qr.js - -[@neocotic]: https://twitter.com/neocotic -[cairo]: http://cairographics.org -[node.js]: http://nodejs.org -[node-canvas]: https://github.com/LearnBoost/node-canvas -[npm]: http://npmjs.org -[qr.js]: http://neocotic.com/qr.js -[qr code]: http://en.wikipedia.org/wiki/QR_code diff --git a/vendors/qr.js/bower.json b/vendors/qr.js/bower.json deleted file mode 100644 index 60ed2373f..000000000 --- a/vendors/qr.js/bower.json +++ /dev/null @@ -1,38 +0,0 @@ -{ - "name": "qr-js", - "version": "1.1.4", - "description": "Library for QR code generation using canvas", - "homepage": "http://neocotic.com/qr.js", - "authors": [ - { - "name": "Alasdair Mercer", - "email": "mercer.alasdair@gmail.com", - "homepage": "http://neocotic.com" - } - ], - "license": "GPL-3.0", - "keywords": [ - "qr", - "code", - "encode", - "canvas", - "image" - ], - "repository": { - "type": "git", - "url": "https://github.com/neocotic/qr.js.git" - }, - "main": "qr.min.js", - "ignore": [ - "**/.*", - "docs", - "AUTHORS.md", - "CHANGES.md", - "CONTRIBUTING.md", - "Gruntfile.js", - "INSTALL.md", - "README.md", - "bower.json", - "package.json" - ] -} diff --git a/vendors/qr.js/package.json b/vendors/qr.js/package.json deleted file mode 100644 index 5f8bc01b7..000000000 --- a/vendors/qr.js/package.json +++ /dev/null @@ -1,40 +0,0 @@ -{ - "name": "qr-js", - "version": "1.1.4", - "description": "Library for QR code generation using canvas", - "homepage": "http://neocotic.com/qr.js", - "bugs": { - "url": "https://github.com/neocotic/qr.js/issues" - }, - "author": { - "name": "Alasdair Mercer", - "email": "mercer.alasdair@gmail.com", - "url": "http://neocotic.com" - }, - "license": "GPL-3.0", - "keywords": [ - "qr", - "code", - "encode", - "canvas", - "image" - ], - "repository": { - "type": "git", - "url": "https://github.com/neocotic/qr.js.git" - }, - "dependencies": { - "canvas": "^1.3.1" - }, - "devDependencies": { - "grunt": "^0.4.5", - "grunt-cli": "^0.1.13", - "grunt-contrib-jshint": "^0.11.3", - "grunt-contrib-uglify": "^0.10.0", - "grunt-docco": "^0.4.0" - }, - "main": "qr.js", - "scripts": { - "test": "grunt test" - } -} diff --git a/vendors/qr.js/qr.js b/vendors/qr.js/qr.js deleted file mode 100644 index d205e2fa8..000000000 --- a/vendors/qr.js/qr.js +++ /dev/null @@ -1,964 +0,0 @@ -// [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: -// - -(root => { - - // 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 - ]; - // 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 - ]; - - // 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 = []; - // Indicates whether or not this script is running in node.js. - var inNode = false; - // Generator polynomial. - var polynomial = []; - // Data input buffer. - var stringBuffer = []; - // Version for the data. - var version; - // Data width is based on `version`. - var width; - - // Private functions - // ----------------- - - // Normalize the `data` that is provided to the main API. - const normalizeData = data => { - if (typeof data === 'string') data = { value: data }; - return data || {}; - }, - - // Set bit to indicate cell in frame is immutable (symmetric around diagonal). - 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. - 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. - 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. - 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. - 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. - 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. - 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). - 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. - 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. - root.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 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: data => { - data = normalizeData(data); - - // Module size of the generated QR code (i.e. 1-10). - var size = data.size >= 1 && 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; - - // `` element used to render the QR code. - var cvs = inNode ? new Canvas() : document.createElement('canvas'); - // 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.toDataURL('image/png'); - } - - }; - -})(this); diff --git a/vendors/qr.js/qr.min.js b/vendors/qr.js/qr.min.js deleted file mode 100644 index 584c554ca..000000000 --- a/vendors/qr.js/qr.min.js +++ /dev/null @@ -1,4 +0,0 @@ -/*! qr-js v1.1.4 | (c) 2015 Alasdair Mercer | GPL v3 License -jsqrencode | (c) 2010 tz@execpc.com | GPL v3 License -*/ -(r=>{var f,o,e,a,t,l,i=[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],c=[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],s={L:1,M:2,Q:3,H:4},n=[30660,29427,32170,30877,26159,25368,27713,26998,21522,20773,24188,23371,17913,16590,20375,19104,13663,12392,16177,14854,9396,8579,11994,11245,5769,5054,7399,6608,1890,597,3340,2107],v=[1,2,4,8,16,32,64,128,29,58,116,232,205,135,19,38,76,152,45,90,180,117,234,201,143,3,6,12,24,48,96,192,157,39,78,156,37,74,148,53,106,212,181,119,238,193,159,35,70,140,5,10,20,40,80,160,93,186,105,210,185,111,222,161,95,190,97,194,153,47,94,188,101,202,137,15,30,60,120,240,253,231,211,187,107,214,177,127,254,225,223,163,91,182,113,226,217,175,67,134,17,34,68,136,13,26,52,104,208,189,103,206,129,31,62,124,248,237,199,147,59,118,236,197,151,51,102,204,133,23,46,92,184,109,218,169,79,158,33,66,132,21,42,84,168,77,154,41,82,164,85,170,73,146,57,114,228,213,183,115,230,209,191,99,198,145,63,126,252,229,215,179,123,246,241,255,227,219,171,75,150,49,98,196,149,55,110,220,165,87,174,65,130,25,50,100,200,141,7,14,28,56,112,224,221,167,83,166,81,162,89,178,121,242,249,239,195,155,43,86,172,69,138,9,18,36,72,144,61,122,244,245,247,243,251,235,203,139,11,22,44,88,176,125,250,233,207,131,27,54,108,216,173,71,142,0],h=[255,0,1,25,2,50,26,198,3,223,51,238,27,104,199,75,4,100,224,14,52,141,239,129,28,193,105,248,200,8,76,113,5,138,101,47,225,36,15,33,53,147,142,218,240,18,130,69,29,181,194,125,106,39,249,185,201,154,9,120,77,228,114,166,6,191,139,98,102,221,48,253,226,152,37,179,16,145,34,136,54,208,148,206,143,150,219,189,241,210,19,92,131,56,70,64,30,66,182,163,195,72,126,110,107,58,40,84,250,133,186,61,202,94,155,159,10,21,121,43,78,212,229,172,115,243,167,87,7,112,192,247,140,128,99,13,103,74,222,237,49,197,254,24,227,165,153,119,38,184,180,124,17,68,146,217,35,32,137,46,55,63,209,91,149,188,207,205,144,135,151,178,220,252,190,97,242,86,211,171,20,42,93,158,132,60,57,83,71,109,65,162,31,45,67,216,183,123,164,118,196,23,73,236,127,12,111,246,108,161,59,82,41,157,85,170,251,96,134,177,187,204,62,90,203,89,95,176,156,169,160,81,11,245,22,235,122,117,44,215,79,174,213,233,230,231,173,232,116,214,244,234,168,80,88,175],u=[3220,1468,2713,1235,3062,1890,2119,1549,2344,2936,1117,2583,1330,2470,1667,2249,2028,3780,481,4011,142,3098,831,3445,592,2517,1776,2234,1951,2827,1070,2660,1345,3177],b=[],k=[],d=1,g=[],R=[],p=[],w=[];const y=(r,f)=>{var o;r>f&&(o=r,r=f,f=o),o=f,o*=f,o+=f,o>>=1,R[o+=r]=1},L=(r,f)=>{var o;for(g[r+l*f]=1,o=-2;o<2;o++)g[r+o+l*(f-2)]=1,g[r-2+l*(f+o+1)]=1,g[r+2+l*(f+o)]=1,g[r+o+1+l*(f+2)]=1;for(o=0;o<2;o++)y(r-1,f+o),y(r+1,f-o),y(r-o,f-1),y(r+o,f+1)},S=r=>{for(;r>=255;)r=((r-=255)>>8)+(255&r);return r},m=(r,f,o,e)=>{var a,t,l;for(t=0;t{var o;return r>f&&(o=r,r=f,f=o),o=f,o+=f*f,o>>=1,1===R[o+=r]},C=r=>{var f,o,e,a;switch(r){case 0:for(o=0;o>1&1,f=0;f{var f,o=0;for(f=0;f<=r;f++)b[f]>=5&&(o+=3+b[f]-5);for(f=3;fr||3*b[f-3]>=4*b[f]||3*b[f+3]>=4*b[f])&&(o+=40);return o},U=()=>{var r,f,o,e,a,t,i,c,s;for(o=a=t=0,s=0;sl*l;)e-=l*l,t++;for(o+=10*t,c=0;c{var b=(r=(r=>("string"==typeof r&&(r={value:r}),r||{}))(r)).size>=1&&r.size<=10?r.size:4;b*=25;var M=document.createElement("canvas"),D=M.getContext("2d");D.canvas.width=b,D.canvas.height=b,D.fillStyle=r.background||"#fff",D.fillRect(0,0,b,b),d=s[r.level&&r.level.toUpperCase()||"L"];var E=(r=>{var s,b,M,D,E,q,x,A;E=r.length,t=0;do{if(M=4*(d-1)+16*(++t-1),e=c[M++],a=c[M++],f=c[M++],o=c[M],E<=(M=f*(e+a)+a-3+(t<=9)))break}while(t<40);for(l=17+4*t,q=f+(f+o)*(e+a)+a,E=0;E1)for(E=i[t],A=l-7;;){for(x=l-7;x>E-3&&(L(x,A),!(x6)for(E=u[t-7],M=17,x=0;x<6;x++)for(A=0;A<3;A++,M--)1&(M>11?t>>M-12:E>>M)?(g[5-x+l*(2-A+l-11)]=1,g[2-A+l-11+l*(5-x)]=1):(y(5-x,2-A+l-11),y(2-A+l-11,5-x));for(A=0;A=(x=f*(e+a)+a)-2&&(q=x-2,t>9&&q--),s=q,t>9){for(w[s+2]=0,w[s+3]=0;s--;)E=w[s],w[s+3]|=255&E<<4,w[s+2]=E>>4;w[2]|=255&q<<4,w[1]=q>>4,w[0]=64|q>>12}else{for(w[s+1]=0,w[s+2]=0;s--;)E=w[s],w[s+2]|=255&E<<4,w[s+1]=E>>4;w[1]|=255&q<<4,w[0]=64|q>>4}for(s=q+3-(t<10);s0;b--)p[b]=p[b]?p[b-1]^v[S(h[p[b]]+s)]:p[b-1];p[0]=v[S(h[p[0]]+s)]}for(s=0;s<=o;s++)p[s]=h[p[s]];for(M=x,A=0,s=0;s>=1)1&A&&(g[l-1-M+8*l]=1,M<6?g[8+l*M]=1:g[8+l*(M+1)]=1);for(M=0;M<7;M++,A>>=1)1&A&&(g[8+l*(l-7+M)]=1,M?g[6-M+8*l]=1:g[7+8*l]=1);return g})(r.value||"");D.lineWidth=1;var q=b;q/=l,q=Math.floor(q);var x,A,H=Math.floor((b-q*l)/2);for(D.clearRect(0,0,b,b),D.fillStyle=r.background||"#fff",D.fillRect(0,0,b,b),D.fillStyle=r.foreground||"#000",x=0;x