pagyra-js 0.0.1

package/src/compression/brotli/vendor/dictionary.js

@@ -0,0 +1,36 @@
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   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.
+
+   Collection of static dictionary words.
+*/
+
+var data = require('./dictionary-data');
+exports.init = function() {
+  exports.dictionary = data.init();
+};
+
+exports.offsetsByLength = new Uint32Array([
+     0,     0,     0,     0,     0,  4096,  9216, 21504, 35840, 44032,
+ 53248, 63488, 74752, 87040, 93696, 100864, 104704, 106752, 108928, 113536,
+ 115968, 118528, 119872, 121280, 122016,
+]);
+
+exports.sizeBitsByLength = new Uint8Array([
+  0,  0,  0,  0, 10, 10, 11, 11, 10, 10,
+ 10, 10, 10,  9,  9,  8,  7,  7,  8,  7,
+  7,  6,  6,  5,  5,
+]);
+
+exports.minDictionaryWordLength = 4;
+exports.maxDictionaryWordLength = 24;

package/src/compression/brotli/vendor/huffman.js

@@ -0,0 +1,123 @@
+function HuffmanCode(bits, value) {
+  this.bits = bits;   /* number of bits used for this symbol */
+  this.value = value; /* symbol value or table offset */
+}
+
+exports.HuffmanCode = HuffmanCode;
+
+var MAX_LENGTH = 15;
+
+/* Returns reverse(reverse(key, len) + 1, len), where reverse(key, len) is the
+   bit-wise reversal of the len least significant bits of key. */
+function GetNextKey(key, len) {
+  var step = 1 << (len - 1);
+  while (key & step) {
+    step >>= 1;
+  }
+  return (key & (step - 1)) + step;
+}
+
+/* Stores code in table[0], table[step], table[2*step], ..., table[end] */
+/* Assumes that end is an integer multiple of step */
+function ReplicateValue(table, i, step, end, code) {
+  do {
+    end -= step;
+    table[i + end] = new HuffmanCode(code.bits, code.value);
+  } while (end > 0);
+}
+
+/* Returns the table width of the next 2nd level table. count is the histogram
+   of bit lengths for the remaining symbols, len is the code length of the next
+   processed symbol */
+function NextTableBitSize(count, len, root_bits) {
+  var left = 1 << (len - root_bits);
+  while (len < MAX_LENGTH) {
+    left -= count[len];
+    if (left <= 0) break;
+    ++len;
+    left <<= 1;
+  }
+  return len - root_bits;
+}
+
+exports.BrotliBuildHuffmanTable = function(root_table, table, root_bits, code_lengths, code_lengths_size) {
+  var start_table = table;
+  var code;            /* current table entry */
+  var len;             /* current code length */
+  var symbol;          /* symbol index in original or sorted table */
+  var key;             /* reversed prefix code */
+  var step;            /* step size to replicate values in current table */
+  var low;             /* low bits for current root entry */
+  var mask;            /* mask for low bits */
+  var table_bits;      /* key length of current table */
+  var table_size;      /* size of current table */
+  var total_size;      /* sum of root table size and 2nd level table sizes */
+  var sorted;          /* symbols sorted by code length */
+  var count = new Int32Array(MAX_LENGTH + 1);  /* number of codes of each length */
+  var offset = new Int32Array(MAX_LENGTH + 1);  /* offsets in sorted table for each length */
+
+  sorted = new Int32Array(code_lengths_size);
+
+  /* build histogram of code lengths */
+  for (symbol = 0; symbol < code_lengths_size; symbol++) {
+    count[code_lengths[symbol]]++;
+  }
+
+  /* generate offsets into sorted symbol table by code length */
+  offset[1] = 0;
+  for (len = 1; len < MAX_LENGTH; len++) {
+    offset[len + 1] = offset[len] + count[len];
+  }
+
+  /* sort symbols by length, by symbol order within each length */
+  for (symbol = 0; symbol < code_lengths_size; symbol++) {
+    if (code_lengths[symbol] !== 0) {
+      sorted[offset[code_lengths[symbol]]++] = symbol;
+    }
+  }
+  
+  table_bits = root_bits;
+  table_size = 1 << table_bits;
+  total_size = table_size;
+
+  /* special case code with only one value */
+  if (offset[MAX_LENGTH] === 1) {
+    for (key = 0; key < total_size; ++key) {
+      root_table[table + key] = new HuffmanCode(0, sorted[0] & 0xffff);
+    }
+    
+    return total_size;
+  }
+
+  /* fill in root table */
+  key = 0;
+  symbol = 0;
+  for (len = 1, step = 2; len <= root_bits; ++len, step <<= 1) {
+    for (; count[len] > 0; --count[len]) {
+      code = new HuffmanCode(len & 0xff, sorted[symbol++] & 0xffff);
+      ReplicateValue(root_table, table + key, step, table_size, code);
+      key = GetNextKey(key, len);
+    }
+  }
+
+  /* fill in 2nd level tables and add pointers to root table */
+  mask = total_size - 1;
+  low = -1;
+  for (len = root_bits + 1, step = 2; len <= MAX_LENGTH; ++len, step <<= 1) {
+    for (; count[len] > 0; --count[len]) {
+      if ((key & mask) !== low) {
+        table += table_size;
+        table_bits = NextTableBitSize(count, len, root_bits);
+        table_size = 1 << table_bits;
+        total_size += table_size;
+        low = key & mask;
+        root_table[start_table + low] = new HuffmanCode((table_bits + root_bits) & 0xff, ((table - start_table) - low) & 0xffff);
+      }
+      code = new HuffmanCode((len - root_bits) & 0xff, sorted[symbol++] & 0xffff);
+      ReplicateValue(root_table, table + (key >> root_bits), step, table_size, code);
+      key = GetNextKey(key, len);
+    }
+  }
+  
+  return total_size;
+}

package/src/compression/brotli/vendor/package.json

@@ -0,0 +1,3 @@
+{
+  "type": "commonjs"
+}

package/src/compression/brotli/vendor/prefix.js

@@ -0,0 +1,60 @@
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   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.
+
+   Lookup tables to map prefix codes to value ranges. This is used during
+   decoding of the block lengths, literal insertion lengths and copy lengths.
+*/
+
+/* Represents the range of values belonging to a prefix code: */
+/* [offset, offset + 2^nbits) */
+function PrefixCodeRange(offset, nbits) {
+  this.offset = offset;
+  this.nbits = nbits;
+}
+
+exports.kBlockLengthPrefixCode = [
+  new PrefixCodeRange(1, 2), new PrefixCodeRange(5, 2), new PrefixCodeRange(9, 2), new PrefixCodeRange(13, 2),
+  new PrefixCodeRange(17, 3), new PrefixCodeRange(25, 3), new PrefixCodeRange(33, 3), new PrefixCodeRange(41, 3),
+  new PrefixCodeRange(49, 4), new PrefixCodeRange(65, 4), new PrefixCodeRange(81, 4), new PrefixCodeRange(97, 4),
+  new PrefixCodeRange(113, 5), new PrefixCodeRange(145, 5), new PrefixCodeRange(177, 5), new PrefixCodeRange(209, 5),
+  new PrefixCodeRange(241, 6), new PrefixCodeRange(305, 6), new PrefixCodeRange(369, 7), new PrefixCodeRange(497, 8),
+  new PrefixCodeRange(753, 9), new PrefixCodeRange(1265, 10), new PrefixCodeRange(2289, 11), new PrefixCodeRange(4337, 12),
+  new PrefixCodeRange(8433, 13), new PrefixCodeRange(16625, 24)
+];
+
+exports.kInsertLengthPrefixCode = [
+  new PrefixCodeRange(0, 0), new PrefixCodeRange(1, 0), new PrefixCodeRange(2, 0), new PrefixCodeRange(3, 0),
+  new PrefixCodeRange(4, 0), new PrefixCodeRange(5, 0), new PrefixCodeRange(6, 1), new PrefixCodeRange(8, 1),
+  new PrefixCodeRange(10, 2), new PrefixCodeRange(14, 2), new PrefixCodeRange(18, 3), new PrefixCodeRange(26, 3),
+  new PrefixCodeRange(34, 4), new PrefixCodeRange(50, 4), new PrefixCodeRange(66, 5), new PrefixCodeRange(98, 5),
+  new PrefixCodeRange(130, 6), new PrefixCodeRange(194, 7), new PrefixCodeRange(322, 8), new PrefixCodeRange(578, 9),
+  new PrefixCodeRange(1090, 10), new PrefixCodeRange(2114, 12), new PrefixCodeRange(6210, 14), new PrefixCodeRange(22594, 24),
+];
+
+exports.kCopyLengthPrefixCode = [
+  new PrefixCodeRange(2, 0), new PrefixCodeRange(3, 0), new PrefixCodeRange(4, 0), new PrefixCodeRange(5, 0),
+  new PrefixCodeRange(6, 0), new PrefixCodeRange(7, 0), new PrefixCodeRange(8, 0), new PrefixCodeRange(9, 0),
+  new PrefixCodeRange(10, 1), new PrefixCodeRange(12, 1), new PrefixCodeRange(14, 2), new PrefixCodeRange(18, 2),
+  new PrefixCodeRange(22, 3), new PrefixCodeRange(30, 3), new PrefixCodeRange(38, 4), new PrefixCodeRange(54, 4),
+  new PrefixCodeRange(70, 5), new PrefixCodeRange(102, 5), new PrefixCodeRange(134, 6), new PrefixCodeRange(198, 7),
+  new PrefixCodeRange(326, 8), new PrefixCodeRange(582, 9), new PrefixCodeRange(1094, 10), new PrefixCodeRange(2118, 24),
+];
+
+exports.kInsertRangeLut = [
+  0, 0, 8, 8, 0, 16, 8, 16, 16,
+];
+
+exports.kCopyRangeLut = [
+  0, 8, 0, 8, 16, 0, 16, 8, 16,
+];

package/src/compression/brotli/vendor/streams.js

@@ -0,0 +1,31 @@
+function BrotliInput(buffer) {
+  this.buffer = buffer;
+  this.pos = 0;
+}
+
+BrotliInput.prototype.read = function (buf, i, count) {
+  if (this.pos + count > this.buffer.length) {
+    count = this.buffer.length - this.pos;
+  }
+  for (var p = 0; p < count; p++) {
+    buf[i + p] = this.buffer[this.pos + p];
+  }
+  this.pos += count;
+  return count;
+};
+
+function BrotliOutput(buf) {
+  this.buffer = buf;
+  this.pos = 0;
+}
+
+BrotliOutput.prototype.write = function (buf, count) {
+  if (this.pos + count > this.buffer.length) {
+    throw new Error("Output buffer is not large enough");
+  }
+  this.buffer.set(buf.subarray(0, count), this.pos);
+  this.pos += count;
+  return count;
+};
+
+module.exports = { BrotliInput, BrotliOutput };

package/src/compression/brotli/vendor/transform.js

@@ -0,0 +1,247 @@
+/* Copyright 2013 Google Inc. All Rights Reserved.
+
+   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.
+
+   Transformations on dictionary words.
+*/
+
+var BrotliDictionary = require('./dictionary');
+
+var kIdentity       = 0;
+var kOmitLast1      = 1;
+var kOmitLast2      = 2;
+var kOmitLast3      = 3;
+var kOmitLast4      = 4;
+var kOmitLast5      = 5;
+var kOmitLast6      = 6;
+var kOmitLast7      = 7;
+var kOmitLast8      = 8;
+var kOmitLast9      = 9;
+var kUppercaseFirst = 10;
+var kUppercaseAll   = 11;
+var kOmitFirst1     = 12;
+var kOmitFirst2     = 13;
+var kOmitFirst3     = 14;
+var kOmitFirst4     = 15;
+var kOmitFirst5     = 16;
+var kOmitFirst6     = 17;
+var kOmitFirst7     = 18;
+var kOmitFirst8     = 19;
+var kOmitFirst9     = 20;
+
+function Transform(prefix, transform, suffix) {
+  this.prefix = new Uint8Array(prefix.length);
+  this.transform = transform;
+  this.suffix = new Uint8Array(suffix.length);
+  
+  for (var i = 0; i < prefix.length; i++)
+    this.prefix[i] = prefix.charCodeAt(i);
+  
+  for (var i = 0; i < suffix.length; i++)
+    this.suffix[i] = suffix.charCodeAt(i);
+}
+
+var kTransforms = [
+     new Transform(         "", kIdentity,       ""           ),
+     new Transform(         "", kIdentity,       " "          ),
+     new Transform(        " ", kIdentity,       " "          ),
+     new Transform(         "", kOmitFirst1,     ""           ),
+     new Transform(         "", kUppercaseFirst, " "          ),
+     new Transform(         "", kIdentity,       " the "      ),
+     new Transform(        " ", kIdentity,       ""           ),
+     new Transform(       "s ", kIdentity,       " "          ),
+     new Transform(         "", kIdentity,       " of "       ),
+     new Transform(         "", kUppercaseFirst, ""           ),
+     new Transform(         "", kIdentity,       " and "      ),
+     new Transform(         "", kOmitFirst2,     ""           ),
+     new Transform(         "", kOmitLast1,      ""           ),
+     new Transform(       ", ", kIdentity,       " "          ),
+     new Transform(         "", kIdentity,       ", "         ),
+     new Transform(        " ", kUppercaseFirst, " "          ),
+     new Transform(         "", kIdentity,       " in "       ),
+     new Transform(         "", kIdentity,       " to "       ),
+     new Transform(       "e ", kIdentity,       " "          ),
+     new Transform(         "", kIdentity,       "\""         ),
+     new Transform(         "", kIdentity,       "."          ),
+     new Transform(         "", kIdentity,       "\">"        ),
+     new Transform(         "", kIdentity,       "\n"         ),
+     new Transform(         "", kOmitLast3,      ""           ),
+     new Transform(         "", kIdentity,       "]"          ),
+     new Transform(         "", kIdentity,       " for "      ),
+     new Transform(         "", kOmitFirst3,     ""           ),
+     new Transform(         "", kOmitLast2,      ""           ),
+     new Transform(         "", kIdentity,       " a "        ),
+     new Transform(         "", kIdentity,       " that "     ),
+     new Transform(        " ", kUppercaseFirst, ""           ),
+     new Transform(         "", kIdentity,       ". "         ),
+     new Transform(        ".", kIdentity,       ""           ),
+     new Transform(        " ", kIdentity,       ", "         ),
+     new Transform(         "", kOmitFirst4,     ""           ),
+     new Transform(         "", kIdentity,       " with "     ),
+     new Transform(         "", kIdentity,       "'"          ),
+     new Transform(         "", kIdentity,       " from "     ),
+     new Transform(         "", kIdentity,       " by "       ),
+     new Transform(         "", kOmitFirst5,     ""           ),
+     new Transform(         "", kOmitFirst6,     ""           ),
+     new Transform(    " the ", kIdentity,       ""           ),
+     new Transform(         "", kOmitLast4,      ""           ),
+     new Transform(         "", kIdentity,       ". The "     ),
+     new Transform(         "", kUppercaseAll,   ""           ),
+     new Transform(         "", kIdentity,       " on "       ),
+     new Transform(         "", kIdentity,       " as "       ),
+     new Transform(         "", kIdentity,       " is "       ),
+     new Transform(         "", kOmitLast7,      ""           ),
+     new Transform(         "", kOmitLast1,      "ing "       ),
+     new Transform(         "", kIdentity,       "\n\t"       ),
+     new Transform(         "", kIdentity,       ":"          ),
+     new Transform(        " ", kIdentity,       ". "         ),
+     new Transform(         "", kIdentity,       "ed "        ),
+     new Transform(         "", kOmitFirst9,     ""           ),
+     new Transform(         "", kOmitFirst7,     ""           ),
+     new Transform(         "", kOmitLast6,      ""           ),
+     new Transform(         "", kIdentity,       "("          ),
+     new Transform(         "", kUppercaseFirst, ", "         ),
+     new Transform(         "", kOmitLast8,      ""           ),
+     new Transform(         "", kIdentity,       " at "       ),
+     new Transform(         "", kIdentity,       "ly "        ),
+     new Transform(    " the ", kIdentity,       " of "       ),
+     new Transform(         "", kOmitLast5,      ""           ),
+     new Transform(         "", kOmitLast9,      ""           ),
+     new Transform(        " ", kUppercaseFirst, ", "         ),
+     new Transform(         "", kUppercaseFirst, "\""         ),
+     new Transform(        ".", kIdentity,       "("          ),
+     new Transform(         "", kUppercaseAll,   " "          ),
+     new Transform(         "", kUppercaseFirst, "\">"        ),
+     new Transform(         "", kIdentity,       "=\""        ),
+     new Transform(        " ", kIdentity,       "."          ),
+     new Transform(    ".com/", kIdentity,       ""           ),
+     new Transform(    " the ", kIdentity,       " of the "   ),
+     new Transform(         "", kUppercaseFirst, "'"          ),
+     new Transform(         "", kIdentity,       ". This "    ),
+     new Transform(         "", kIdentity,       ","          ),
+     new Transform(        ".", kIdentity,       " "          ),
+     new Transform(         "", kUppercaseFirst, "("          ),
+     new Transform(         "", kUppercaseFirst, "."          ),
+     new Transform(         "", kIdentity,       " not "      ),
+     new Transform(        " ", kIdentity,       "=\""        ),
+     new Transform(         "", kIdentity,       "er "        ),
+     new Transform(        " ", kUppercaseAll,   " "          ),
+     new Transform(         "", kIdentity,       "al "        ),
+     new Transform(        " ", kUppercaseAll,   ""           ),
+     new Transform(         "", kIdentity,       "='"         ),
+     new Transform(         "", kUppercaseAll,   "\""         ),
+     new Transform(         "", kUppercaseFirst, ". "         ),
+     new Transform(        " ", kIdentity,       "("          ),
+     new Transform(         "", kIdentity,       "ful "       ),
+     new Transform(        " ", kUppercaseFirst, ". "         ),
+     new Transform(         "", kIdentity,       "ive "       ),
+     new Transform(         "", kIdentity,       "less "      ),
+     new Transform(         "", kUppercaseAll,   "'"          ),
+     new Transform(         "", kIdentity,       "est "       ),
+     new Transform(        " ", kUppercaseFirst, "."          ),
+     new Transform(         "", kUppercaseAll,   "\">"        ),
+     new Transform(        " ", kIdentity,       "='"         ),
+     new Transform(         "", kUppercaseFirst, ","          ),
+     new Transform(         "", kIdentity,       "ize "       ),
+     new Transform(         "", kUppercaseAll,   "."          ),
+     new Transform( "\xc2\xa0", kIdentity,       ""           ),
+     new Transform(        " ", kIdentity,       ","          ),
+     new Transform(         "", kUppercaseFirst, "=\""        ),
+     new Transform(         "", kUppercaseAll,   "=\""        ),
+     new Transform(         "", kIdentity,       "ous "       ),
+     new Transform(         "", kUppercaseAll,   ", "         ),
+     new Transform(         "", kUppercaseFirst, "='"         ),
+     new Transform(        " ", kUppercaseFirst, ","          ),
+     new Transform(        " ", kUppercaseAll,   "=\""        ),
+     new Transform(        " ", kUppercaseAll,   ", "         ),
+     new Transform(         "", kUppercaseAll,   ","          ),
+     new Transform(         "", kUppercaseAll,   "("          ),
+     new Transform(         "", kUppercaseAll,   ". "         ),
+     new Transform(        " ", kUppercaseAll,   "."          ),
+     new Transform(         "", kUppercaseAll,   "='"         ),
+     new Transform(        " ", kUppercaseAll,   ". "         ),
+     new Transform(        " ", kUppercaseFirst, "=\""        ),
+     new Transform(        " ", kUppercaseAll,   "='"         ),
+     new Transform(        " ", kUppercaseFirst, "='"         )
+];
+
+exports.kTransforms = kTransforms;
+exports.kNumTransforms = kTransforms.length;
+
+function ToUpperCase(p, i) {
+  if (p[i] < 0xc0) {
+    if (p[i] >= 97 && p[i] <= 122) {
+      p[i] ^= 32;
+    }
+    return 1;
+  }
+  
+  /* An overly simplified uppercasing model for utf-8. */
+  if (p[i] < 0xe0) {
+    p[i + 1] ^= 32;
+    return 2;
+  }
+  
+  /* An arbitrary transform for three byte characters. */
+  p[i + 2] ^= 5;
+  return 3;
+}
+
+exports.transformDictionaryWord = function(dst, idx, word, len, transform) {
+  var prefix = kTransforms[transform].prefix;
+  var suffix = kTransforms[transform].suffix;
+  var t = kTransforms[transform].transform;
+  var skip = t < kOmitFirst1 ? 0 : t - (kOmitFirst1 - 1);
+  var i = 0;
+  var start_idx = idx;
+  var uppercase;
+  
+  if (skip > len) {
+    skip = len;
+  }
+  
+  var prefix_pos = 0;
+  while (prefix_pos < prefix.length) {
+    dst[idx++] = prefix[prefix_pos++];
+  }
+  
+  word += skip;
+  len -= skip;
+  
+  if (t <= kOmitLast9) {
+    len -= t;
+  }
+  
+  for (i = 0; i < len; i++) {
+    dst[idx++] = BrotliDictionary.dictionary[word + i];
+  }
+  
+  uppercase = idx - len;
+  
+  if (t === kUppercaseFirst) {
+    ToUpperCase(dst, uppercase);
+  } else if (t === kUppercaseAll) {
+    while (len > 0) {
+      var step = ToUpperCase(dst, uppercase);
+      uppercase += step;
+      len -= step;
+    }
+  }
+  
+  var suffix_pos = 0;
+  while (suffix_pos < suffix.length) {
+    dst[idx++] = suffix[suffix_pos++];
+  }
+  
+  return idx - start_idx;
+}

package/src/compression/brotli/vendor-decode.d.ts

@@ -0,0 +1,4 @@
+declare module "../../compression/brotli/vendor/decode.js" {
+  export function BrotliDecompress(input: Uint8Array, output?: Uint8Array): Uint8Array;
+  export function BrotliDecompressBuffer(buffer: Uint8Array, outputSize?: number): Uint8Array;
+}