@wecom/wecom-openclaw-cli 1.0.14 → 1.0.16

package/dist/node_modules/dijkstrajs/dijkstra.js

@@ -0,0 +1,179 @@
+'use strict';
+
+var dijkstra = require('../../_virtual/dijkstra.js');
+
+var hasRequiredDijkstra;
+
+function requireDijkstra () {
+	if (hasRequiredDijkstra) return dijkstra.__module.exports;
+	hasRequiredDijkstra = 1;
+	(function (module) {
+
+		/******************************************************************************
+		 * Created 2008-08-19.
+		 *
+		 * Dijkstra path-finding functions. Adapted from the Dijkstar Python project.
+		 *
+		 * Copyright (C) 2008
+		 *   Wyatt Baldwin <self@wyattbaldwin.com>
+		 *   All rights reserved
+		 *
+		 * Licensed under the MIT license.
+		 *
+		 *   http://www.opensource.org/licenses/mit-license.php
+		 *
+		 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+		 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+		 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+		 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+		 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+		 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+		 * THE SOFTWARE.
+		 *****************************************************************************/
+		var dijkstra = {
+		  single_source_shortest_paths: function(graph, s, d) {
+		    // Predecessor map for each node that has been encountered.
+		    // node ID => predecessor node ID
+		    var predecessors = {};
+
+		    // Costs of shortest paths from s to all nodes encountered.
+		    // node ID => cost
+		    var costs = {};
+		    costs[s] = 0;
+
+		    // Costs of shortest paths from s to all nodes encountered; differs from
+		    // `costs` in that it provides easy access to the node that currently has
+		    // the known shortest path from s.
+		    // XXX: Do we actually need both `costs` and `open`?
+		    var open = dijkstra.PriorityQueue.make();
+		    open.push(s, 0);
+
+		    var closest,
+		        u, v,
+		        cost_of_s_to_u,
+		        adjacent_nodes,
+		        cost_of_e,
+		        cost_of_s_to_u_plus_cost_of_e,
+		        cost_of_s_to_v,
+		        first_visit;
+		    while (!open.empty()) {
+		      // In the nodes remaining in graph that have a known cost from s,
+		      // find the node, u, that currently has the shortest path from s.
+		      closest = open.pop();
+		      u = closest.value;
+		      cost_of_s_to_u = closest.cost;
+
+		      // Get nodes adjacent to u...
+		      adjacent_nodes = graph[u] || {};
+
+		      // ...and explore the edges that connect u to those nodes, updating
+		      // the cost of the shortest paths to any or all of those nodes as
+		      // necessary. v is the node across the current edge from u.
+		      for (v in adjacent_nodes) {
+		        if (adjacent_nodes.hasOwnProperty(v)) {
+		          // Get the cost of the edge running from u to v.
+		          cost_of_e = adjacent_nodes[v];
+
+		          // Cost of s to u plus the cost of u to v across e--this is *a*
+		          // cost from s to v that may or may not be less than the current
+		          // known cost to v.
+		          cost_of_s_to_u_plus_cost_of_e = cost_of_s_to_u + cost_of_e;
+
+		          // If we haven't visited v yet OR if the current known cost from s to
+		          // v is greater than the new cost we just found (cost of s to u plus
+		          // cost of u to v across e), update v's cost in the cost list and
+		          // update v's predecessor in the predecessor list (it's now u).
+		          cost_of_s_to_v = costs[v];
+		          first_visit = (typeof costs[v] === 'undefined');
+		          if (first_visit || cost_of_s_to_v > cost_of_s_to_u_plus_cost_of_e) {
+		            costs[v] = cost_of_s_to_u_plus_cost_of_e;
+		            open.push(v, cost_of_s_to_u_plus_cost_of_e);
+		            predecessors[v] = u;
+		          }
+		        }
+		      }
+		    }
+
+		    if (typeof d !== 'undefined' && typeof costs[d] === 'undefined') {
+		      var msg = ['Could not find a path from ', s, ' to ', d, '.'].join('');
+		      throw new Error(msg);
+		    }
+
+		    return predecessors;
+		  },
+
+		  extract_shortest_path_from_predecessor_list: function(predecessors, d) {
+		    var nodes = [];
+		    var u = d;
+		    while (u) {
+		      nodes.push(u);
+		      predecessors[u];
+		      u = predecessors[u];
+		    }
+		    nodes.reverse();
+		    return nodes;
+		  },
+
+		  find_path: function(graph, s, d) {
+		    var predecessors = dijkstra.single_source_shortest_paths(graph, s, d);
+		    return dijkstra.extract_shortest_path_from_predecessor_list(
+		      predecessors, d);
+		  },
+
+		  /**
+		   * A very naive priority queue implementation.
+		   */
+		  PriorityQueue: {
+		    make: function (opts) {
+		      var T = dijkstra.PriorityQueue,
+		          t = {},
+		          key;
+		      opts = opts || {};
+		      for (key in T) {
+		        if (T.hasOwnProperty(key)) {
+		          t[key] = T[key];
+		        }
+		      }
+		      t.queue = [];
+		      t.sorter = opts.sorter || T.default_sorter;
+		      return t;
+		    },
+
+		    default_sorter: function (a, b) {
+		      return a.cost - b.cost;
+		    },
+
+		    /**
+		     * Add a new item to the queue and ensure the highest priority element
+		     * is at the front of the queue.
+		     */
+		    push: function (value, cost) {
+		      var item = {value: value, cost: cost};
+		      this.queue.push(item);
+		      this.queue.sort(this.sorter);
+		    },
+
+		    /**
+		     * Return the highest priority element in the queue.
+		     */
+		    pop: function () {
+		      return this.queue.shift();
+		    },
+
+		    empty: function () {
+		      return this.queue.length === 0;
+		    }
+		  }
+		};
+
+
+		// node.js module exports
+		{
+		  module.exports = dijkstra;
+		} 
+	} (dijkstra.__module));
+	return dijkstra.__module.exports;
+}
+
+exports.__require = requireDijkstra;
+//# sourceMappingURL=dijkstra.js.map

package/dist/node_modules/dijkstrajs/dijkstra.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dijkstra.js","sources":["../../../node_modules/dijkstrajs/dijkstra.js"],"sourcesContent":["'use strict';\n\n/******************************************************************************\n * Created 2008-08-19.\n *\n * Dijkstra path-finding functions. Adapted from the Dijkstar Python project.\n *\n * Copyright (C) 2008\n *   Wyatt Baldwin <self@wyattbaldwin.com>\n *   All rights reserved\n *\n * Licensed under the MIT license.\n *\n *   http://www.opensource.org/licenses/mit-license.php\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n *****************************************************************************/\nvar dijkstra = {\n  single_source_shortest_paths: function(graph, s, d) {\n    // Predecessor map for each node that has been encountered.\n    // node ID => predecessor node ID\n    var predecessors = {};\n\n    // Costs of shortest paths from s to all nodes encountered.\n    // node ID => cost\n    var costs = {};\n    costs[s] = 0;\n\n    // Costs of shortest paths from s to all nodes encountered; differs from\n    // `costs` in that it provides easy access to the node that currently has\n    // the known shortest path from s.\n    // XXX: Do we actually need both `costs` and `open`?\n    var open = dijkstra.PriorityQueue.make();\n    open.push(s, 0);\n\n    var closest,\n        u, v,\n        cost_of_s_to_u,\n        adjacent_nodes,\n        cost_of_e,\n        cost_of_s_to_u_plus_cost_of_e,\n        cost_of_s_to_v,\n        first_visit;\n    while (!open.empty()) {\n      // In the nodes remaining in graph that have a known cost from s,\n      // find the node, u, that currently has the shortest path from s.\n      closest = open.pop();\n      u = closest.value;\n      cost_of_s_to_u = closest.cost;\n\n      // Get nodes adjacent to u...\n      adjacent_nodes = graph[u] || {};\n\n      // ...and explore the edges that connect u to those nodes, updating\n      // the cost of the shortest paths to any or all of those nodes as\n      // necessary. v is the node across the current edge from u.\n      for (v in adjacent_nodes) {\n        if (adjacent_nodes.hasOwnProperty(v)) {\n          // Get the cost of the edge running from u to v.\n          cost_of_e = adjacent_nodes[v];\n\n          // Cost of s to u plus the cost of u to v across e--this is *a*\n          // cost from s to v that may or may not be less than the current\n          // known cost to v.\n          cost_of_s_to_u_plus_cost_of_e = cost_of_s_to_u + cost_of_e;\n\n          // If we haven't visited v yet OR if the current known cost from s to\n          // v is greater than the new cost we just found (cost of s to u plus\n          // cost of u to v across e), update v's cost in the cost list and\n          // update v's predecessor in the predecessor list (it's now u).\n          cost_of_s_to_v = costs[v];\n          first_visit = (typeof costs[v] === 'undefined');\n          if (first_visit || cost_of_s_to_v > cost_of_s_to_u_plus_cost_of_e) {\n            costs[v] = cost_of_s_to_u_plus_cost_of_e;\n            open.push(v, cost_of_s_to_u_plus_cost_of_e);\n            predecessors[v] = u;\n          }\n        }\n      }\n    }\n\n    if (typeof d !== 'undefined' && typeof costs[d] === 'undefined') {\n      var msg = ['Could not find a path from ', s, ' to ', d, '.'].join('');\n      throw new Error(msg);\n    }\n\n    return predecessors;\n  },\n\n  extract_shortest_path_from_predecessor_list: function(predecessors, d) {\n    var nodes = [];\n    var u = d;\n    var predecessor;\n    while (u) {\n      nodes.push(u);\n      predecessor = predecessors[u];\n      u = predecessors[u];\n    }\n    nodes.reverse();\n    return nodes;\n  },\n\n  find_path: function(graph, s, d) {\n    var predecessors = dijkstra.single_source_shortest_paths(graph, s, d);\n    return dijkstra.extract_shortest_path_from_predecessor_list(\n      predecessors, d);\n  },\n\n  /**\n   * A very naive priority queue implementation.\n   */\n  PriorityQueue: {\n    make: function (opts) {\n      var T = dijkstra.PriorityQueue,\n          t = {},\n          key;\n      opts = opts || {};\n      for (key in T) {\n        if (T.hasOwnProperty(key)) {\n          t[key] = T[key];\n        }\n      }\n      t.queue = [];\n      t.sorter = opts.sorter || T.default_sorter;\n      return t;\n    },\n\n    default_sorter: function (a, b) {\n      return a.cost - b.cost;\n    },\n\n    /**\n     * Add a new item to the queue and ensure the highest priority element\n     * is at the front of the queue.\n     */\n    push: function (value, cost) {\n      var item = {value: value, cost: cost};\n      this.queue.push(item);\n      this.queue.sort(this.sorter);\n    },\n\n    /**\n     * Return the highest priority element in the queue.\n     */\n    pop: function () {\n      return this.queue.shift();\n    },\n\n    empty: function () {\n      return this.queue.length === 0;\n    }\n  }\n};\n\n\n// node.js module exports\nif (typeof module !== 'undefined') {\n  module.exports = dijkstra;\n}\n"],"names":[],"mappings":";;;;;;;;;;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAA,IAAI,QAAQ,GAAG;IACb,4BAA4B,EAAE,SAAS,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE;AACtD;AACA;MACI,IAAI,YAAY,GAAG,EAAE;;AAEzB;AACA;MACI,IAAI,KAAK,GAAG,EAAE;AAClB,MAAI,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC;;AAEhB;AACA;AACA;AACA;MACI,IAAI,IAAI,GAAG,QAAQ,CAAC,aAAa,CAAC,IAAI,EAAE;AAC5C,MAAI,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC;;AAEnB,MAAI,IAAI,OAAO;UACP,CAAC,EAAE,CAAC;AACZ,UAAQ,cAAc;AACtB,UAAQ,cAAc;AACtB,UAAQ,SAAS;AACjB,UAAQ,6BAA6B;AACrC,UAAQ,cAAc;AACtB,UAAQ,WAAW;AACnB,MAAI,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE;AAC1B;AACA;AACA,QAAM,OAAO,GAAG,IAAI,CAAC,GAAG,EAAE;AAC1B,QAAM,CAAC,GAAG,OAAO,CAAC,KAAK;AACvB,QAAM,cAAc,GAAG,OAAO,CAAC,IAAI;;AAEnC;AACA,QAAM,cAAc,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE;;AAErC;AACA;AACA;AACA,QAAM,KAAK,CAAC,IAAI,cAAc,EAAE;AAChC,UAAQ,IAAI,cAAc,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE;AAC9C;AACA,YAAU,SAAS,GAAG,cAAc,CAAC,CAAC,CAAC;;AAEvC;AACA;AACA;AACA,YAAU,6BAA6B,GAAG,cAAc,GAAG,SAAS;;AAEpE;AACA;AACA;AACA;AACA,YAAU,cAAc,GAAG,KAAK,CAAC,CAAC,CAAC;YACzB,WAAW,IAAI,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,WAAW,CAAC;AACzD,YAAU,IAAI,WAAW,IAAI,cAAc,GAAG,6BAA6B,EAAE;AAC7E,cAAY,KAAK,CAAC,CAAC,CAAC,GAAG,6BAA6B;AACpD,cAAY,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,6BAA6B,CAAC;AACvD,cAAY,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC;AAC/B,YAAA;AACA,UAAA;AACA,QAAA;AACA,MAAA;;AAEA,MAAI,IAAI,OAAO,CAAC,KAAK,WAAW,IAAI,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,WAAW,EAAE;AACrE,QAAM,IAAI,GAAG,GAAG,CAAC,6BAA6B,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;AAC3E,QAAM,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC;AAC1B,MAAA;;AAEA,MAAI,OAAO,YAAY;IACvB,CAAG;;AAEH,IAAE,2CAA2C,EAAE,SAAS,YAAY,EAAE,CAAC,EAAE;MACrE,IAAI,KAAK,GAAG,EAAE;MACd,IAAI,CAAC,GAAG,CAAC;MAET,OAAO,CAAC,EAAE;AACd,QAAM,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;AACnB,QAAoB,YAAY,CAAC,CAAC,CAAC;AACnC,QAAM,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC;AACzB,MAAA;MACI,KAAK,CAAC,OAAO,EAAE;AACnB,MAAI,OAAO,KAAK;IAChB,CAAG;;IAED,SAAS,EAAE,SAAS,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE;AACnC,MAAI,IAAI,YAAY,GAAG,QAAQ,CAAC,4BAA4B,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;MACrE,OAAO,QAAQ,CAAC,2CAA2C;QACzD,YAAY,EAAE,CAAC,CAAC;IACtB,CAAG;;AAEH;AACA;AACA;AACA,IAAE,aAAa,EAAE;AACjB,MAAI,IAAI,EAAE,UAAU,IAAI,EAAE;AAC1B,QAAM,IAAI,CAAC,GAAG,QAAQ,CAAC,aAAa;YAC1B,CAAC,GAAG,EAAE;AAChB,YAAU,GAAG;AACb,QAAM,IAAI,GAAG,IAAI,IAAI,EAAE;AACvB,QAAM,KAAK,GAAG,IAAI,CAAC,EAAE;AACrB,UAAQ,IAAI,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;YACzB,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC;AACzB,UAAA;AACA,QAAA;AACA,QAAM,CAAC,CAAC,KAAK,GAAG,EAAE;QACZ,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,cAAc;AAChD,QAAM,OAAO,CAAC;MACd,CAAK;;AAEL,MAAI,cAAc,EAAE,UAAU,CAAC,EAAE,CAAC,EAAE;AACpC,QAAM,OAAO,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI;MAC5B,CAAK;;AAEL;AACA;AACA;AACA;AACA,MAAI,IAAI,EAAE,UAAU,KAAK,EAAE,IAAI,EAAE;QAC3B,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC;AAC3C,QAAM,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;QACrB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;MAClC,CAAK;;AAEL;AACA;AACA;MACI,GAAG,EAAE,YAAY;AACrB,QAAM,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE;MAC/B,CAAK;;MAED,KAAK,EAAE,YAAY;AACvB,QAAM,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;AACpC,MAAA;AACA;GACC;;;AAGD;EACmC;AACnC,IAAE,iBAAiB,QAAQ;AAC3B,EAAA,CAAA;;;;;;;","x_google_ignoreList":[0]}

package/dist/node_modules/pngjs/lib/bitmapper.js

@@ -0,0 +1,281 @@
+'use strict';
+
+var bitmapper = require('../../../_virtual/bitmapper.js');
+var interlace = require('./interlace.js');
+
+var hasRequiredBitmapper;
+
+function requireBitmapper () {
+	if (hasRequiredBitmapper) return bitmapper.__exports;
+	hasRequiredBitmapper = 1;
+
+	let interlaceUtils = interlace.__require();
+
+	let pixelBppMapper = [
+	  // 0 - dummy entry
+	  function () {},
+
+	  // 1 - L
+	  // 0: 0, 1: 0, 2: 0, 3: 0xff
+	  function (pxData, data, pxPos, rawPos) {
+	    if (rawPos === data.length) {
+	      throw new Error("Ran out of data");
+	    }
+
+	    let pixel = data[rawPos];
+	    pxData[pxPos] = pixel;
+	    pxData[pxPos + 1] = pixel;
+	    pxData[pxPos + 2] = pixel;
+	    pxData[pxPos + 3] = 0xff;
+	  },
+
+	  // 2 - LA
+	  // 0: 0, 1: 0, 2: 0, 3: 1
+	  function (pxData, data, pxPos, rawPos) {
+	    if (rawPos + 1 >= data.length) {
+	      throw new Error("Ran out of data");
+	    }
+
+	    let pixel = data[rawPos];
+	    pxData[pxPos] = pixel;
+	    pxData[pxPos + 1] = pixel;
+	    pxData[pxPos + 2] = pixel;
+	    pxData[pxPos + 3] = data[rawPos + 1];
+	  },
+
+	  // 3 - RGB
+	  // 0: 0, 1: 1, 2: 2, 3: 0xff
+	  function (pxData, data, pxPos, rawPos) {
+	    if (rawPos + 2 >= data.length) {
+	      throw new Error("Ran out of data");
+	    }
+
+	    pxData[pxPos] = data[rawPos];
+	    pxData[pxPos + 1] = data[rawPos + 1];
+	    pxData[pxPos + 2] = data[rawPos + 2];
+	    pxData[pxPos + 3] = 0xff;
+	  },
+
+	  // 4 - RGBA
+	  // 0: 0, 1: 1, 2: 2, 3: 3
+	  function (pxData, data, pxPos, rawPos) {
+	    if (rawPos + 3 >= data.length) {
+	      throw new Error("Ran out of data");
+	    }
+
+	    pxData[pxPos] = data[rawPos];
+	    pxData[pxPos + 1] = data[rawPos + 1];
+	    pxData[pxPos + 2] = data[rawPos + 2];
+	    pxData[pxPos + 3] = data[rawPos + 3];
+	  },
+	];
+
+	let pixelBppCustomMapper = [
+	  // 0 - dummy entry
+	  function () {},
+
+	  // 1 - L
+	  // 0: 0, 1: 0, 2: 0, 3: 0xff
+	  function (pxData, pixelData, pxPos, maxBit) {
+	    let pixel = pixelData[0];
+	    pxData[pxPos] = pixel;
+	    pxData[pxPos + 1] = pixel;
+	    pxData[pxPos + 2] = pixel;
+	    pxData[pxPos + 3] = maxBit;
+	  },
+
+	  // 2 - LA
+	  // 0: 0, 1: 0, 2: 0, 3: 1
+	  function (pxData, pixelData, pxPos) {
+	    let pixel = pixelData[0];
+	    pxData[pxPos] = pixel;
+	    pxData[pxPos + 1] = pixel;
+	    pxData[pxPos + 2] = pixel;
+	    pxData[pxPos + 3] = pixelData[1];
+	  },
+
+	  // 3 - RGB
+	  // 0: 0, 1: 1, 2: 2, 3: 0xff
+	  function (pxData, pixelData, pxPos, maxBit) {
+	    pxData[pxPos] = pixelData[0];
+	    pxData[pxPos + 1] = pixelData[1];
+	    pxData[pxPos + 2] = pixelData[2];
+	    pxData[pxPos + 3] = maxBit;
+	  },
+
+	  // 4 - RGBA
+	  // 0: 0, 1: 1, 2: 2, 3: 3
+	  function (pxData, pixelData, pxPos) {
+	    pxData[pxPos] = pixelData[0];
+	    pxData[pxPos + 1] = pixelData[1];
+	    pxData[pxPos + 2] = pixelData[2];
+	    pxData[pxPos + 3] = pixelData[3];
+	  },
+	];
+
+	function bitRetriever(data, depth) {
+	  let leftOver = [];
+	  let i = 0;
+
+	  function split() {
+	    if (i === data.length) {
+	      throw new Error("Ran out of data");
+	    }
+	    let byte = data[i];
+	    i++;
+	    let byte8, byte7, byte6, byte5, byte4, byte3, byte2, byte1;
+	    switch (depth) {
+	      default:
+	        throw new Error("unrecognised depth");
+	      case 16:
+	        byte2 = data[i];
+	        i++;
+	        leftOver.push((byte << 8) + byte2);
+	        break;
+	      case 4:
+	        byte2 = byte & 0x0f;
+	        byte1 = byte >> 4;
+	        leftOver.push(byte1, byte2);
+	        break;
+	      case 2:
+	        byte4 = byte & 3;
+	        byte3 = (byte >> 2) & 3;
+	        byte2 = (byte >> 4) & 3;
+	        byte1 = (byte >> 6) & 3;
+	        leftOver.push(byte1, byte2, byte3, byte4);
+	        break;
+	      case 1:
+	        byte8 = byte & 1;
+	        byte7 = (byte >> 1) & 1;
+	        byte6 = (byte >> 2) & 1;
+	        byte5 = (byte >> 3) & 1;
+	        byte4 = (byte >> 4) & 1;
+	        byte3 = (byte >> 5) & 1;
+	        byte2 = (byte >> 6) & 1;
+	        byte1 = (byte >> 7) & 1;
+	        leftOver.push(byte1, byte2, byte3, byte4, byte5, byte6, byte7, byte8);
+	        break;
+	    }
+	  }
+
+	  return {
+	    get: function (count) {
+	      while (leftOver.length < count) {
+	        split();
+	      }
+	      let returner = leftOver.slice(0, count);
+	      leftOver = leftOver.slice(count);
+	      return returner;
+	    },
+	    resetAfterLine: function () {
+	      leftOver.length = 0;
+	    },
+	    end: function () {
+	      if (i !== data.length) {
+	        throw new Error("extra data found");
+	      }
+	    },
+	  };
+	}
+
+	function mapImage8Bit(image, pxData, getPxPos, bpp, data, rawPos) {
+	  // eslint-disable-line max-params
+	  let imageWidth = image.width;
+	  let imageHeight = image.height;
+	  let imagePass = image.index;
+	  for (let y = 0; y < imageHeight; y++) {
+	    for (let x = 0; x < imageWidth; x++) {
+	      let pxPos = getPxPos(x, y, imagePass);
+	      pixelBppMapper[bpp](pxData, data, pxPos, rawPos);
+	      rawPos += bpp; //eslint-disable-line no-param-reassign
+	    }
+	  }
+	  return rawPos;
+	}
+
+	function mapImageCustomBit(image, pxData, getPxPos, bpp, bits, maxBit) {
+	  // eslint-disable-line max-params
+	  let imageWidth = image.width;
+	  let imageHeight = image.height;
+	  let imagePass = image.index;
+	  for (let y = 0; y < imageHeight; y++) {
+	    for (let x = 0; x < imageWidth; x++) {
+	      let pixelData = bits.get(bpp);
+	      let pxPos = getPxPos(x, y, imagePass);
+	      pixelBppCustomMapper[bpp](pxData, pixelData, pxPos, maxBit);
+	    }
+	    bits.resetAfterLine();
+	  }
+	}
+
+	bitmapper.__exports.dataToBitMap = function (data, bitmapInfo) {
+	  let width = bitmapInfo.width;
+	  let height = bitmapInfo.height;
+	  let depth = bitmapInfo.depth;
+	  let bpp = bitmapInfo.bpp;
+	  let interlace = bitmapInfo.interlace;
+	  let bits;
+
+	  if (depth !== 8) {
+	    bits = bitRetriever(data, depth);
+	  }
+	  let pxData;
+	  if (depth <= 8) {
+	    pxData = Buffer.alloc(width * height * 4);
+	  } else {
+	    pxData = new Uint16Array(width * height * 4);
+	  }
+	  let maxBit = Math.pow(2, depth) - 1;
+	  let rawPos = 0;
+	  let images;
+	  let getPxPos;
+
+	  if (interlace) {
+	    images = interlaceUtils.getImagePasses(width, height);
+	    getPxPos = interlaceUtils.getInterlaceIterator(width, height);
+	  } else {
+	    let nonInterlacedPxPos = 0;
+	    getPxPos = function () {
+	      let returner = nonInterlacedPxPos;
+	      nonInterlacedPxPos += 4;
+	      return returner;
+	    };
+	    images = [{ width: width, height: height }];
+	  }
+
+	  for (let imageIndex = 0; imageIndex < images.length; imageIndex++) {
+	    if (depth === 8) {
+	      rawPos = mapImage8Bit(
+	        images[imageIndex],
+	        pxData,
+	        getPxPos,
+	        bpp,
+	        data,
+	        rawPos
+	      );
+	    } else {
+	      mapImageCustomBit(
+	        images[imageIndex],
+	        pxData,
+	        getPxPos,
+	        bpp,
+	        bits,
+	        maxBit
+	      );
+	    }
+	  }
+	  if (depth === 8) {
+	    if (rawPos !== data.length) {
+	      throw new Error("extra data found");
+	    }
+	  } else {
+	    bits.end();
+	  }
+
+	  return pxData;
+	};
+	return bitmapper.__exports;
+}
+
+exports.__require = requireBitmapper;
+//# sourceMappingURL=bitmapper.js.map

package/dist/node_modules/pngjs/lib/bitmapper.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bitmapper.js","sources":["../../../../node_modules/pngjs/lib/bitmapper.js"],"sourcesContent":["\"use strict\";\n\nlet interlaceUtils = require(\"./interlace\");\n\nlet pixelBppMapper = [\n  // 0 - dummy entry\n  function () {},\n\n  // 1 - L\n  // 0: 0, 1: 0, 2: 0, 3: 0xff\n  function (pxData, data, pxPos, rawPos) {\n    if (rawPos === data.length) {\n      throw new Error(\"Ran out of data\");\n    }\n\n    let pixel = data[rawPos];\n    pxData[pxPos] = pixel;\n    pxData[pxPos + 1] = pixel;\n    pxData[pxPos + 2] = pixel;\n    pxData[pxPos + 3] = 0xff;\n  },\n\n  // 2 - LA\n  // 0: 0, 1: 0, 2: 0, 3: 1\n  function (pxData, data, pxPos, rawPos) {\n    if (rawPos + 1 >= data.length) {\n      throw new Error(\"Ran out of data\");\n    }\n\n    let pixel = data[rawPos];\n    pxData[pxPos] = pixel;\n    pxData[pxPos + 1] = pixel;\n    pxData[pxPos + 2] = pixel;\n    pxData[pxPos + 3] = data[rawPos + 1];\n  },\n\n  // 3 - RGB\n  // 0: 0, 1: 1, 2: 2, 3: 0xff\n  function (pxData, data, pxPos, rawPos) {\n    if (rawPos + 2 >= data.length) {\n      throw new Error(\"Ran out of data\");\n    }\n\n    pxData[pxPos] = data[rawPos];\n    pxData[pxPos + 1] = data[rawPos + 1];\n    pxData[pxPos + 2] = data[rawPos + 2];\n    pxData[pxPos + 3] = 0xff;\n  },\n\n  // 4 - RGBA\n  // 0: 0, 1: 1, 2: 2, 3: 3\n  function (pxData, data, pxPos, rawPos) {\n    if (rawPos + 3 >= data.length) {\n      throw new Error(\"Ran out of data\");\n    }\n\n    pxData[pxPos] = data[rawPos];\n    pxData[pxPos + 1] = data[rawPos + 1];\n    pxData[pxPos + 2] = data[rawPos + 2];\n    pxData[pxPos + 3] = data[rawPos + 3];\n  },\n];\n\nlet pixelBppCustomMapper = [\n  // 0 - dummy entry\n  function () {},\n\n  // 1 - L\n  // 0: 0, 1: 0, 2: 0, 3: 0xff\n  function (pxData, pixelData, pxPos, maxBit) {\n    let pixel = pixelData[0];\n    pxData[pxPos] = pixel;\n    pxData[pxPos + 1] = pixel;\n    pxData[pxPos + 2] = pixel;\n    pxData[pxPos + 3] = maxBit;\n  },\n\n  // 2 - LA\n  // 0: 0, 1: 0, 2: 0, 3: 1\n  function (pxData, pixelData, pxPos) {\n    let pixel = pixelData[0];\n    pxData[pxPos] = pixel;\n    pxData[pxPos + 1] = pixel;\n    pxData[pxPos + 2] = pixel;\n    pxData[pxPos + 3] = pixelData[1];\n  },\n\n  // 3 - RGB\n  // 0: 0, 1: 1, 2: 2, 3: 0xff\n  function (pxData, pixelData, pxPos, maxBit) {\n    pxData[pxPos] = pixelData[0];\n    pxData[pxPos + 1] = pixelData[1];\n    pxData[pxPos + 2] = pixelData[2];\n    pxData[pxPos + 3] = maxBit;\n  },\n\n  // 4 - RGBA\n  // 0: 0, 1: 1, 2: 2, 3: 3\n  function (pxData, pixelData, pxPos) {\n    pxData[pxPos] = pixelData[0];\n    pxData[pxPos + 1] = pixelData[1];\n    pxData[pxPos + 2] = pixelData[2];\n    pxData[pxPos + 3] = pixelData[3];\n  },\n];\n\nfunction bitRetriever(data, depth) {\n  let leftOver = [];\n  let i = 0;\n\n  function split() {\n    if (i === data.length) {\n      throw new Error(\"Ran out of data\");\n    }\n    let byte = data[i];\n    i++;\n    let byte8, byte7, byte6, byte5, byte4, byte3, byte2, byte1;\n    switch (depth) {\n      default:\n        throw new Error(\"unrecognised depth\");\n      case 16:\n        byte2 = data[i];\n        i++;\n        leftOver.push((byte << 8) + byte2);\n        break;\n      case 4:\n        byte2 = byte & 0x0f;\n        byte1 = byte >> 4;\n        leftOver.push(byte1, byte2);\n        break;\n      case 2:\n        byte4 = byte & 3;\n        byte3 = (byte >> 2) & 3;\n        byte2 = (byte >> 4) & 3;\n        byte1 = (byte >> 6) & 3;\n        leftOver.push(byte1, byte2, byte3, byte4);\n        break;\n      case 1:\n        byte8 = byte & 1;\n        byte7 = (byte >> 1) & 1;\n        byte6 = (byte >> 2) & 1;\n        byte5 = (byte >> 3) & 1;\n        byte4 = (byte >> 4) & 1;\n        byte3 = (byte >> 5) & 1;\n        byte2 = (byte >> 6) & 1;\n        byte1 = (byte >> 7) & 1;\n        leftOver.push(byte1, byte2, byte3, byte4, byte5, byte6, byte7, byte8);\n        break;\n    }\n  }\n\n  return {\n    get: function (count) {\n      while (leftOver.length < count) {\n        split();\n      }\n      let returner = leftOver.slice(0, count);\n      leftOver = leftOver.slice(count);\n      return returner;\n    },\n    resetAfterLine: function () {\n      leftOver.length = 0;\n    },\n    end: function () {\n      if (i !== data.length) {\n        throw new Error(\"extra data found\");\n      }\n    },\n  };\n}\n\nfunction mapImage8Bit(image, pxData, getPxPos, bpp, data, rawPos) {\n  // eslint-disable-line max-params\n  let imageWidth = image.width;\n  let imageHeight = image.height;\n  let imagePass = image.index;\n  for (let y = 0; y < imageHeight; y++) {\n    for (let x = 0; x < imageWidth; x++) {\n      let pxPos = getPxPos(x, y, imagePass);\n      pixelBppMapper[bpp](pxData, data, pxPos, rawPos);\n      rawPos += bpp; //eslint-disable-line no-param-reassign\n    }\n  }\n  return rawPos;\n}\n\nfunction mapImageCustomBit(image, pxData, getPxPos, bpp, bits, maxBit) {\n  // eslint-disable-line max-params\n  let imageWidth = image.width;\n  let imageHeight = image.height;\n  let imagePass = image.index;\n  for (let y = 0; y < imageHeight; y++) {\n    for (let x = 0; x < imageWidth; x++) {\n      let pixelData = bits.get(bpp);\n      let pxPos = getPxPos(x, y, imagePass);\n      pixelBppCustomMapper[bpp](pxData, pixelData, pxPos, maxBit);\n    }\n    bits.resetAfterLine();\n  }\n}\n\nexports.dataToBitMap = function (data, bitmapInfo) {\n  let width = bitmapInfo.width;\n  let height = bitmapInfo.height;\n  let depth = bitmapInfo.depth;\n  let bpp = bitmapInfo.bpp;\n  let interlace = bitmapInfo.interlace;\n  let bits;\n\n  if (depth !== 8) {\n    bits = bitRetriever(data, depth);\n  }\n  let pxData;\n  if (depth <= 8) {\n    pxData = Buffer.alloc(width * height * 4);\n  } else {\n    pxData = new Uint16Array(width * height * 4);\n  }\n  let maxBit = Math.pow(2, depth) - 1;\n  let rawPos = 0;\n  let images;\n  let getPxPos;\n\n  if (interlace) {\n    images = interlaceUtils.getImagePasses(width, height);\n    getPxPos = interlaceUtils.getInterlaceIterator(width, height);\n  } else {\n    let nonInterlacedPxPos = 0;\n    getPxPos = function () {\n      let returner = nonInterlacedPxPos;\n      nonInterlacedPxPos += 4;\n      return returner;\n    };\n    images = [{ width: width, height: height }];\n  }\n\n  for (let imageIndex = 0; imageIndex < images.length; imageIndex++) {\n    if (depth === 8) {\n      rawPos = mapImage8Bit(\n        images[imageIndex],\n        pxData,\n        getPxPos,\n        bpp,\n        data,\n        rawPos\n      );\n    } else {\n      mapImageCustomBit(\n        images[imageIndex],\n        pxData,\n        getPxPos,\n        bpp,\n        bits,\n        maxBit\n      );\n    }\n  }\n  if (depth === 8) {\n    if (rawPos !== data.length) {\n      throw new Error(\"extra data found\");\n    }\n  } else {\n    bits.end();\n  }\n\n  return pxData;\n};\n"],"names":["require$$0","bitmapper"],"mappings":";;;;;;;;;;;CAEA,IAAI,cAAc,GAAGA,mBAAA,EAAsB;;AAE3C,CAAA,IAAI,cAAc,GAAG;AACrB;AACA,GAAE,YAAY,CAAA,CAAE;;AAEhB;AACA;GACE,UAAU,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE;AACzC,KAAI,IAAI,MAAM,KAAK,IAAI,CAAC,MAAM,EAAE;AAChC,OAAM,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC;AACxC,KAAA;;AAEA,KAAI,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;AAC5B,KAAI,MAAM,CAAC,KAAK,CAAC,GAAG,KAAK;AACzB,KAAI,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,KAAK;AAC7B,KAAI,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,KAAK;AAC7B,KAAI,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI;GAC5B,CAAG;;AAEH;AACA;GACE,UAAU,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE;KACrC,IAAI,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE;AACnC,OAAM,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC;AACxC,KAAA;;AAEA,KAAI,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;AAC5B,KAAI,MAAM,CAAC,KAAK,CAAC,GAAG,KAAK;AACzB,KAAI,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,KAAK;AAC7B,KAAI,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,KAAK;AAC7B,KAAI,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;GACxC,CAAG;;AAEH;AACA;GACE,UAAU,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE;KACrC,IAAI,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE;AACnC,OAAM,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC;AACxC,KAAA;;KAEI,MAAM,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;AAChC,KAAI,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;AACxC,KAAI,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;AACxC,KAAI,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI;GAC5B,CAAG;;AAEH;AACA;GACE,UAAU,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE;KACrC,IAAI,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE;AACnC,OAAM,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC;AACxC,KAAA;;KAEI,MAAM,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;AAChC,KAAI,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;AACxC,KAAI,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;AACxC,KAAI,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;GACxC,CAAG;EACF;;AAED,CAAA,IAAI,oBAAoB,GAAG;AAC3B;AACA,GAAE,YAAY,CAAA,CAAE;;AAEhB;AACA;GACE,UAAU,MAAM,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE;AAC9C,KAAI,IAAI,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC;AAC5B,KAAI,MAAM,CAAC,KAAK,CAAC,GAAG,KAAK;AACzB,KAAI,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,KAAK;AAC7B,KAAI,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,KAAK;AAC7B,KAAI,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,MAAM;GAC9B,CAAG;;AAEH;AACA;AACA,GAAE,UAAU,MAAM,EAAE,SAAS,EAAE,KAAK,EAAE;AACtC,KAAI,IAAI,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC;AAC5B,KAAI,MAAM,CAAC,KAAK,CAAC,GAAG,KAAK;AACzB,KAAI,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,KAAK;AAC7B,KAAI,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,KAAK;KACzB,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC;GACpC,CAAG;;AAEH;AACA;GACE,UAAU,MAAM,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE;KAC1C,MAAM,CAAC,KAAK,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC;KAC5B,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC;KAChC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC;AACpC,KAAI,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,MAAM;GAC9B,CAAG;;AAEH;AACA;AACA,GAAE,UAAU,MAAM,EAAE,SAAS,EAAE,KAAK,EAAE;KAClC,MAAM,CAAC,KAAK,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC;KAC5B,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC;KAChC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC;KAChC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC;GACpC,CAAG;EACF;;AAED,CAAA,SAAS,YAAY,CAAC,IAAI,EAAE,KAAK,EAAE;GACjC,IAAI,QAAQ,GAAG,EAAE;GACjB,IAAI,CAAC,GAAG,CAAC;;GAET,SAAS,KAAK,GAAG;AACnB,KAAI,IAAI,CAAC,KAAK,IAAI,CAAC,MAAM,EAAE;AAC3B,OAAM,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC;AACxC,KAAA;AACA,KAAI,IAAI,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC;AACtB,KAAI,CAAC,EAAE;AACP,KAAI,IAAI,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK;AAC9D,KAAI,QAAQ,KAAK;OACX;AACN,SAAQ,MAAM,IAAI,KAAK,CAAC,oBAAoB,CAAC;AAC7C,OAAM,KAAK,EAAE;AACb,SAAQ,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC;AACvB,SAAQ,CAAC,EAAE;SACH,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC;SAClC;AACR,OAAM,KAAK,CAAC;AACZ,SAAQ,KAAK,GAAG,IAAI,GAAG,IAAI;AAC3B,SAAQ,KAAK,GAAG,IAAI,IAAI,CAAC;AACzB,SAAQ,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC;SAC3B;AACR,OAAM,KAAK,CAAC;AACZ,SAAQ,KAAK,GAAG,IAAI,GAAG,CAAC;AACxB,SAAQ,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC;AAC/B,SAAQ,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC;AAC/B,SAAQ,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC;SACvB,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC;SACzC;AACR,OAAM,KAAK,CAAC;AACZ,SAAQ,KAAK,GAAG,IAAI,GAAG,CAAC;AACxB,SAAQ,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC;AAC/B,SAAQ,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC;AAC/B,SAAQ,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC;AAC/B,SAAQ,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC;AAC/B,SAAQ,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC;AAC/B,SAAQ,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC;AAC/B,SAAQ,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC;AAC/B,SAAQ,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC;SACrE;AACR;AACA,GAAA;;AAEA,GAAE,OAAO;AACT,KAAI,GAAG,EAAE,UAAU,KAAK,EAAE;AAC1B,OAAM,OAAO,QAAQ,CAAC,MAAM,GAAG,KAAK,EAAE;AACtC,SAAQ,KAAK,EAAE;AACf,OAAA;OACM,IAAI,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC;AAC7C,OAAM,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC;AACtC,OAAM,OAAO,QAAQ;KACrB,CAAK;KACD,cAAc,EAAE,YAAY;AAChC,OAAM,QAAQ,CAAC,MAAM,GAAG,CAAC;KACzB,CAAK;KACD,GAAG,EAAE,YAAY;AACrB,OAAM,IAAI,CAAC,KAAK,IAAI,CAAC,MAAM,EAAE;AAC7B,SAAQ,MAAM,IAAI,KAAK,CAAC,kBAAkB,CAAC;AAC3C,OAAA;KACA,CAAK;IACF;AACH,CAAA;;AAEA,CAAA,SAAS,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE;AAClE;AACA,GAAE,IAAI,UAAU,GAAG,KAAK,CAAC,KAAK;AAC9B,GAAE,IAAI,WAAW,GAAG,KAAK,CAAC,MAAM;AAChC,GAAE,IAAI,SAAS,GAAG,KAAK,CAAC,KAAK;AAC7B,GAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE;AACxC,KAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE;OACnC,IAAI,KAAK,GAAG,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC;AAC3C,OAAM,cAAc,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC;OAChD,MAAM,IAAI,GAAG,CAAC;AACpB,KAAA;AACA,GAAA;AACA,GAAE,OAAO,MAAM;AACf,CAAA;;AAEA,CAAA,SAAS,iBAAiB,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE;AACvE;AACA,GAAE,IAAI,UAAU,GAAG,KAAK,CAAC,KAAK;AAC9B,GAAE,IAAI,WAAW,GAAG,KAAK,CAAC,MAAM;AAChC,GAAE,IAAI,SAAS,GAAG,KAAK,CAAC,KAAK;AAC7B,GAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE;AACxC,KAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE;OACnC,IAAI,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;OAC7B,IAAI,KAAK,GAAG,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC;AAC3C,OAAM,oBAAoB,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,CAAC;AACjE,KAAA;KACI,IAAI,CAAC,cAAc,EAAE;AACzB,GAAA;AACA,CAAA;;AAEA,CAAAC,mBAAA,CAAA,YAAoB,GAAG,UAAU,IAAI,EAAE,UAAU,EAAE;AACnD,GAAE,IAAI,KAAK,GAAG,UAAU,CAAC,KAAK;AAC9B,GAAE,IAAI,MAAM,GAAG,UAAU,CAAC,MAAM;AAChC,GAAE,IAAI,KAAK,GAAG,UAAU,CAAC,KAAK;AAC9B,GAAE,IAAI,GAAG,GAAG,UAAU,CAAC,GAAG;AAC1B,GAAE,IAAI,SAAS,GAAG,UAAU,CAAC,SAAS;AACtC,GAAE,IAAI,IAAI;;AAEV,GAAE,IAAI,KAAK,KAAK,CAAC,EAAE;AACnB,KAAI,IAAI,GAAG,YAAY,CAAC,IAAI,EAAE,KAAK,CAAC;AACpC,GAAA;AACA,GAAE,IAAI,MAAM;AACZ,GAAE,IAAI,KAAK,IAAI,CAAC,EAAE;KACd,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,GAAG,MAAM,GAAG,CAAC,CAAC;AAC7C,GAAA,CAAG,MAAM;KACL,MAAM,GAAG,IAAI,WAAW,CAAC,KAAK,GAAG,MAAM,GAAG,CAAC,CAAC;AAChD,GAAA;AACA,GAAE,IAAI,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC;GACnC,IAAI,MAAM,GAAG,CAAC;AAChB,GAAE,IAAI,MAAM;AACZ,GAAE,IAAI,QAAQ;;GAEZ,IAAI,SAAS,EAAE;KACb,MAAM,GAAG,cAAc,CAAC,cAAc,CAAC,KAAK,EAAE,MAAM,CAAC;KACrD,QAAQ,GAAG,cAAc,CAAC,oBAAoB,CAAC,KAAK,EAAE,MAAM,CAAC;AACjE,GAAA,CAAG,MAAM;KACL,IAAI,kBAAkB,GAAG,CAAC;KAC1B,QAAQ,GAAG,YAAY;OACrB,IAAI,QAAQ,GAAG,kBAAkB;OACjC,kBAAkB,IAAI,CAAC;AAC7B,OAAM,OAAO,QAAQ;KACrB,CAAK;AACL,KAAI,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC;AAC/C,GAAA;;AAEA,GAAE,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,UAAU,GAAG,MAAM,CAAC,MAAM,EAAE,UAAU,EAAE,EAAE;AACrE,KAAI,IAAI,KAAK,KAAK,CAAC,EAAE;OACf,MAAM,GAAG,YAAY;SACnB,MAAM,CAAC,UAAU,CAAC;AAC1B,SAAQ,MAAM;AACd,SAAQ,QAAQ;AAChB,SAAQ,GAAG;AACX,SAAQ,IAAI;SACJ;QACD;AACP,KAAA,CAAK,MAAM;AACX,OAAM,iBAAiB;SACf,MAAM,CAAC,UAAU,CAAC;AAC1B,SAAQ,MAAM;AACd,SAAQ,QAAQ;AAChB,SAAQ,GAAG;AACX,SAAQ,IAAI;SACJ;QACD;AACP,KAAA;AACA,GAAA;AACA,GAAE,IAAI,KAAK,KAAK,CAAC,EAAE;AACnB,KAAI,IAAI,MAAM,KAAK,IAAI,CAAC,MAAM,EAAE;AAChC,OAAM,MAAM,IAAI,KAAK,CAAC,kBAAkB,CAAC;AACzC,KAAA;AACA,GAAA,CAAG,MAAM;KACL,IAAI,CAAC,GAAG,EAAE;AACd,GAAA;;AAEA,GAAE,OAAO,MAAM;CACf,CAAC;;;;;;","x_google_ignoreList":[0]}

package/dist/node_modules/pngjs/lib/bitpacker.js

@@ -0,0 +1,172 @@
+'use strict';
+
+var constants = require('./constants.js');
+
+var bitpacker;
+var hasRequiredBitpacker;
+
+function requireBitpacker () {
+	if (hasRequiredBitpacker) return bitpacker;
+	hasRequiredBitpacker = 1;
+
+	let constants$1 = constants.__require();
+
+	bitpacker = function (dataIn, width, height, options) {
+	  let outHasAlpha =
+	    [constants$1.COLORTYPE_COLOR_ALPHA, constants$1.COLORTYPE_ALPHA].indexOf(
+	      options.colorType
+	    ) !== -1;
+	  if (options.colorType === options.inputColorType) {
+	    let bigEndian = (function () {
+	      let buffer = new ArrayBuffer(2);
+	      new DataView(buffer).setInt16(0, 256, true /* littleEndian */);
+	      // Int16Array uses the platform's endianness.
+	      return new Int16Array(buffer)[0] !== 256;
+	    })();
+	    // If no need to convert to grayscale and alpha is present/absent in both, take a fast route
+	    if (options.bitDepth === 8 || (options.bitDepth === 16 && bigEndian)) {
+	      return dataIn;
+	    }
+	  }
+
+	  // map to a UInt16 array if data is 16bit, fix endianness below
+	  let data = options.bitDepth !== 16 ? dataIn : new Uint16Array(dataIn.buffer);
+
+	  let maxValue = 255;
+	  let inBpp = constants$1.COLORTYPE_TO_BPP_MAP[options.inputColorType];
+	  if (inBpp === 4 && !options.inputHasAlpha) {
+	    inBpp = 3;
+	  }
+	  let outBpp = constants$1.COLORTYPE_TO_BPP_MAP[options.colorType];
+	  if (options.bitDepth === 16) {
+	    maxValue = 65535;
+	    outBpp *= 2;
+	  }
+	  let outData = Buffer.alloc(width * height * outBpp);
+
+	  let inIndex = 0;
+	  let outIndex = 0;
+
+	  let bgColor = options.bgColor || {};
+	  if (bgColor.red === undefined) {
+	    bgColor.red = maxValue;
+	  }
+	  if (bgColor.green === undefined) {
+	    bgColor.green = maxValue;
+	  }
+	  if (bgColor.blue === undefined) {
+	    bgColor.blue = maxValue;
+	  }
+
+	  function getRGBA() {
+	    let red;
+	    let green;
+	    let blue;
+	    let alpha = maxValue;
+	    switch (options.inputColorType) {
+	      case constants$1.COLORTYPE_COLOR_ALPHA:
+	        alpha = data[inIndex + 3];
+	        red = data[inIndex];
+	        green = data[inIndex + 1];
+	        blue = data[inIndex + 2];
+	        break;
+	      case constants$1.COLORTYPE_COLOR:
+	        red = data[inIndex];
+	        green = data[inIndex + 1];
+	        blue = data[inIndex + 2];
+	        break;
+	      case constants$1.COLORTYPE_ALPHA:
+	        alpha = data[inIndex + 1];
+	        red = data[inIndex];
+	        green = red;
+	        blue = red;
+	        break;
+	      case constants$1.COLORTYPE_GRAYSCALE:
+	        red = data[inIndex];
+	        green = red;
+	        blue = red;
+	        break;
+	      default:
+	        throw new Error(
+	          "input color type:" +
+	            options.inputColorType +
+	            " is not supported at present"
+	        );
+	    }
+
+	    if (options.inputHasAlpha) {
+	      if (!outHasAlpha) {
+	        alpha /= maxValue;
+	        red = Math.min(
+	          Math.max(Math.round((1 - alpha) * bgColor.red + alpha * red), 0),
+	          maxValue
+	        );
+	        green = Math.min(
+	          Math.max(Math.round((1 - alpha) * bgColor.green + alpha * green), 0),
+	          maxValue
+	        );
+	        blue = Math.min(
+	          Math.max(Math.round((1 - alpha) * bgColor.blue + alpha * blue), 0),
+	          maxValue
+	        );
+	      }
+	    }
+	    return { red: red, green: green, blue: blue, alpha: alpha };
+	  }
+
+	  for (let y = 0; y < height; y++) {
+	    for (let x = 0; x < width; x++) {
+	      let rgba = getRGBA();
+
+	      switch (options.colorType) {
+	        case constants$1.COLORTYPE_COLOR_ALPHA:
+	        case constants$1.COLORTYPE_COLOR:
+	          if (options.bitDepth === 8) {
+	            outData[outIndex] = rgba.red;
+	            outData[outIndex + 1] = rgba.green;
+	            outData[outIndex + 2] = rgba.blue;
+	            if (outHasAlpha) {
+	              outData[outIndex + 3] = rgba.alpha;
+	            }
+	          } else {
+	            outData.writeUInt16BE(rgba.red, outIndex);
+	            outData.writeUInt16BE(rgba.green, outIndex + 2);
+	            outData.writeUInt16BE(rgba.blue, outIndex + 4);
+	            if (outHasAlpha) {
+	              outData.writeUInt16BE(rgba.alpha, outIndex + 6);
+	            }
+	          }
+	          break;
+	        case constants$1.COLORTYPE_ALPHA:
+	        case constants$1.COLORTYPE_GRAYSCALE: {
+	          // Convert to grayscale and alpha
+	          let grayscale = (rgba.red + rgba.green + rgba.blue) / 3;
+	          if (options.bitDepth === 8) {
+	            outData[outIndex] = grayscale;
+	            if (outHasAlpha) {
+	              outData[outIndex + 1] = rgba.alpha;
+	            }
+	          } else {
+	            outData.writeUInt16BE(grayscale, outIndex);
+	            if (outHasAlpha) {
+	              outData.writeUInt16BE(rgba.alpha, outIndex + 2);
+	            }
+	          }
+	          break;
+	        }
+	        default:
+	          throw new Error("unrecognised color Type " + options.colorType);
+	      }
+
+	      inIndex += inBpp;
+	      outIndex += outBpp;
+	    }
+	  }
+
+	  return outData;
+	};
+	return bitpacker;
+}
+
+exports.__require = requireBitpacker;
+//# sourceMappingURL=bitpacker.js.map