{“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 Adlern// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsinn//n// This software is provided 'as-is', without any express or impliedn// warranty. In no event will the authors be held liable for any damagesn// 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 itn// freely, subject to the following restrictions:n//n// 1. The origin of this software must not be misrepresented; you must notn// claim that you wrote the original software. If you use this softwaren// in a product, an acknowledgment in the product documentation would ben// appreciated but is not required.n// 2. Altered source versions must be plainly marked as such, and must not ben// misrepresented as being the original software.n// 3. This notice may not be removed or altered from any source distribution.nnfunction adler32(adler, buf, len, pos) {n var s1 = adler & 0xffff | 0,n s2 = adler >>> 16 & 0xffff | 0,n n = 0;nn while (len !== 0) {n // Set limit ~ twice less than 5552, to keepn // s2 in 31-bits, because we force signed ints.n // in other case %= will fail.n n = len > 2000 ? 2000 : len;n len -= n;nn do {n s1 = s1 + buf | 0;n s2 = s2 + s1 | 0;n } while (–n);nn s1 %= 65521;n s2 %= 65521;n }nn return s1 | s2 << 16 | 0;n}nnmodule.exports = adler32;”,“map”:null,“metadata”:{},“sourceType”:“module”}