{"ast":null,"code":"'use strict'; // Note: adler32 takes 12% for level 0 and 2% for level 6.\n// It isn't worth it to make additional optimizations as in original.\n// Small size is preferable.\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction adler32(adler, buf, len, pos) {\n  var s1 = adler & 0xffff | 0,\n      s2 = adler >>> 16 & 0xffff | 0,\n      n = 0;\n\n  while (len !== 0) {\n    // Set limit ~ twice less than 5552, to keep\n    // s2 in 31-bits, because we force signed ints.\n    // in other case %= will fail.\n    n = len > 2000 ? 2000 : len;\n    len -= n;\n\n    do {\n      s1 = s1 + buf[pos++] | 0;\n      s2 = s2 + s1 | 0;\n    } while (--n);\n\n    s1 %= 65521;\n    s2 %= 65521;\n  }\n\n  return s1 | s2 << 16 | 0;\n}\n\nmodule.exports = adler32;","map":{"version":3,"sources":["/Users/tylerkoenig/Code/personal/react-scss2/node_modules/pako/lib/zlib/adler32.js"],"names":["adler32","adler","buf","len","pos","s1","s2","n","module","exports"],"mappings":"AAAA,a,CAEA;AACA;AACA;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,SAASA,OAAT,CAAiBC,KAAjB,EAAwBC,GAAxB,EAA6BC,GAA7B,EAAkCC,GAAlC,EAAuC;AACrC,MAAIC,EAAE,GAAIJ,KAAK,GAAG,MAAT,GAAkB,CAA3B;AAAA,MACIK,EAAE,GAAKL,KAAK,KAAK,EAAX,GAAiB,MAAlB,GAA2B,CADpC;AAAA,MAEIM,CAAC,GAAG,CAFR;;AAIA,SAAOJ,GAAG,KAAK,CAAf,EAAkB;AAChB;AACA;AACA;AACAI,IAAAA,CAAC,GAAGJ,GAAG,GAAG,IAAN,GAAa,IAAb,GAAoBA,GAAxB;AACAA,IAAAA,GAAG,IAAII,CAAP;;AAEA,OAAG;AACDF,MAAAA,EAAE,GAAIA,EAAE,GAAGH,GAAG,CAACE,GAAG,EAAJ,CAAT,GAAmB,CAAxB;AACAE,MAAAA,EAAE,GAAIA,EAAE,GAAGD,EAAN,GAAW,CAAhB;AACD,KAHD,QAGS,EAAEE,CAHX;;AAKAF,IAAAA,EAAE,IAAI,KAAN;AACAC,IAAAA,EAAE,IAAI,KAAN;AACD;;AAED,SAAQD,EAAE,GAAIC,EAAE,IAAI,EAAb,GAAmB,CAA1B;AACD;;AAGDE,MAAM,CAACC,OAAP,GAAiBT,OAAjB","sourcesContent":["'use strict';\n\n// Note: adler32 takes 12% for level 0 and 2% for level 6.\n// It isn't worth it to make additional optimizations as in original.\n// Small size is preferable.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction adler32(adler, buf, len, pos) {\n  var s1 = (adler & 0xffff) |0,\n      s2 = ((adler >>> 16) & 0xffff) |0,\n      n = 0;\n\n  while (len !== 0) {\n    // Set limit ~ twice less than 5552, to keep\n    // s2 in 31-bits, because we force signed ints.\n    // in other case %= will fail.\n    n = len > 2000 ? 2000 : len;\n    len -= n;\n\n    do {\n      s1 = (s1 + buf[pos++]) |0;\n      s2 = (s2 + s1) |0;\n    } while (--n);\n\n    s1 %= 65521;\n    s2 %= 65521;\n  }\n\n  return (s1 | (s2 << 16)) |0;\n}\n\n\nmodule.exports = adler32;\n"]},"metadata":{},"sourceType":"script"}