2b:null 2c:["$","title",null,{"children":"Benchmarking JavaScript (WIP!) | Job van der Zwan | Observable"}] 31:T2db5,LZString = (function () { // private property var i = 0, fromCharCode = String.fromCharCode, streamData, streamDataVal, streamDataPosition, streamBitsPerChar, streamGetCharFromInt, reverseDict = {}, base = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+", Base64CharArray = (base + "/=").split(''), UriSafeCharArray = (base + "-$").split(''); while (i < 65) { if (i > 62) { reverseDict[UriSafeCharArray[i].charCodeAt(0)] = i; } reverseDict[Base64CharArray[i].charCodeAt(0)] = i++; } function streamBits(value, numBitsMask) { for (var i = 0; numBitsMask >>= 1; i++) { // shifting has precedence over bitmasking streamDataVal = value >> i & 1 | streamDataVal << 1; if (++streamDataPosition === streamBitsPerChar) { streamDataPosition = 0; streamData.push(streamGetCharFromInt(streamDataVal)); streamDataVal = 0; } } } function getCharFromBase64(a) { return Base64CharArray[a]; } function getCharFromURISafe(a) { return UriSafeCharArray[a]; } function getCharFromUTF16(a) { return fromCharCode(a + 32); } function _node(val) { return { 0x10000: val }; } function _compress(uncompressed, bitsPerChar, getCharFromInt) { // data - empty stream streamData = []; if (uncompressed != null) { // davaVal streamDataVal = 0; // dataPosition streamDataPosition = 0; streamBitsPerChar = bitsPerChar; streamGetCharFromInt = getCharFromInt; var j = 0, value = 0, dictionary = {}, freshNode = true, c = 0, node = _node(3), // first node will always be initialised like this. nextNode, dictSize = 3, numBitsMask = 0b100; if (uncompressed.length) { // If there is a string, the first charCode is guaranteed to // be new, so we write it to output stream, and add it to the // dictionary. For the same reason we can initialize freshNode // as true, and new_node, node and dictSize as if // it was already added to the dictionary (see above). c = uncompressed.charCodeAt(0); // == Write first charCode token to output == // 8 or 16 bit? value = c < 256 ? 0 : 1 // insert "new 8/16 bit charCode" token // into bitstream (value 1) streamBits(value, numBitsMask); streamBits(c, value ? 0b10000000000000000 : 0b100000000); // Add charCode to the dictionary. dictionary[c] = node; for (j = 1; j < uncompressed.length; j++) { c = uncompressed.charCodeAt(j); // does the new charCode match an existing prefix? nextNode = node[c]; if (nextNode) { // continue with next prefix node = nextNode; } else { // Prefix+charCode does not exist in trie yet. // We write the prefix to the bitstream, and add // the new charCode to the dictionary if it's new // Then we set node to the root node matching // the charCode. if (freshNode) { // Prefix is a freshly added character token, // which was already written to the bitstream freshNode = false; } else { // write out the current prefix token value = node[0x10000]; streamBits(value, numBitsMask); } // Is the new charCode a new character // that needs to be stored at the root? if (dictionary[c] == undefined) { // increase token bitlength if necessary if (++dictSize >= numBitsMask) { numBitsMask <<= 1; } // insert "new 8/16 bit charCode" token, // see comments above for explanation value = c < 256 ? 0 : 1 streamBits(value, numBitsMask); streamBits(c, value ? 0b10000000000000000 : 0b100000000); dictionary[c] = _node(dictSize) // Note of that we already wrote // the charCode token to the bitstream freshNode = true; } // add node representing prefix + new charCode to trie node[c] = _node(++dictSize) // increase token bitlength if necessary if (dictSize >= numBitsMask) { numBitsMask <<= 1; } // set node to first charCode of new prefix node = dictionary[c]; } } // === Write last prefix to output === if (freshNode) { // character token already written to output freshNode = false; } else { // write out the prefix token streamBits(node[0x10000], numBitsMask); } // Is c a new character? if (dictionary[c] == undefined) { // increase token bitlength if necessary if (++dictSize >= numBitsMask) { numBitsMask <<= 1; } // insert "new 8/16 bit charCode" token, // see comments above for explanation value = c < 256 ? 0 : 1 streamBits(value, numBitsMask); streamBits(c, 0b100000000 << value); } // increase token bitlength if necessary if (++dictSize >= numBitsMask) { numBitsMask <<= 1; } } // Mark the end of the stream streamBits(2, numBitsMask); // Flush the last char streamDataVal <<= streamBitsPerChar - streamDataPosition; streamData.push(streamGetCharFromInt(streamDataVal)); } return streamData; } function _decompress(length, resetBits, getNextValue) { var dictionary = ['', '', ''], enlargeIn = 4, dictSize = 4, numBits = 3, entry = "", result = [], bits = 0, maxpower = 2, power = 0, c = "", data_val = getNextValue(0), data_position = resetBits, data_index = 1; // Get first token, guaranteed to be either // a new character token (8 or 16 bits) // or end of stream token. while (power != maxpower) { // shifting has precedence over bitmasking bits += (data_val >> --data_position & 1) << power++; if (data_position == 0) { data_position = resetBits; data_val = getNextValue(data_index++); } } // if end of stream token, return empty string if (bits == 2) { return ""; } // else, get character maxpower = bits * 8 + 8; bits = power = 0; while (power != maxpower) { // shifting has precedence over bitmasking bits += (data_val >> --data_position & 1) << power++; if (data_position == 0) { data_position = resetBits; data_val = getNextValue(data_index++); } } c = fromCharCode(bits); dictionary[3] = c; result.push(c); // read rest of string while (data_index <= length) { // read out next token maxpower = numBits; bits = power = 0; while (power != maxpower) { // shifting has precedence over bitmasking bits += (data_val >> --data_position & 1) << power++; if (data_position == 0) { data_position = resetBits; data_val = getNextValue(data_index++); } } // 0 or 1 implies new character token if (bits < 2) { maxpower = (8 + 8 * bits); bits = power = 0; while (power != maxpower) { // shifting has precedence over bitmasking bits += (data_val >> --data_position & 1) << power++; if (data_position == 0) { data_position = resetBits; data_val = getNextValue(data_index++); } } dictionary[dictSize] = fromCharCode(bits); bits = dictSize++; if (--enlargeIn == 0) { enlargeIn = 1 << numBits++; } } else if (bits == 2) { // end of stream token return result.join(''); } if (bits > dictionary.length) { return null; } entry = bits < dictionary.length ? dictionary[bits] : c + c.charAt(0); result.push(entry); // Add c+entry[0] to the dictionary. dictionary[dictSize++] = c + entry.charAt(0); c = entry; if (--enlargeIn == 0) { enlargeIn = 1 << numBits++; } } return ""; } function _compressToArray(uncompressed) { return _compress(uncompressed, 16, fromCharCode); } function _decompressFromArray(compressed) { if (compressed == null) return ""; if (compressed.length == 0) return null; return _decompress(compressed.length, 16, function (index) { return compressed[index].charCodeAt(0); }); } return { compressToBase64: function (input) { if (input == null) return ""; var res = _compress(input, 6, getCharFromBase64), i = res.length % 4; // To produce valid Base64 while (i--) { res.push("="); } return res.join(''); }, decompressFromBase64: function (input) { if (input == null) return ""; if (input == "") return null; return _decompress(input.length, 6, function (index) { return reverseDict[input.charCodeAt(index)]; }); }, compressToUTF16: function (input) { if (input == null) return ""; var compressed = _compress(input, 15, getCharFromUTF16); compressed.push(" "); return compressed.join(''); }, decompressFromUTF16: function (compressed) { if (compressed == null) return ""; if (compressed == "") return null; return _decompress(compressed.length, 15, function (index) { return compressed.charCodeAt(index) - 32; }); }, //compress into uint8array (UCS-2 big endian format) compressToUint8Array: function (uncompressed) { var compressed = _compressToArray(uncompressed); var buf = new Uint8Array(compressed.length * 2); // 2 bytes per character for (var i = 0, TotalLen = compressed.length; i < TotalLen; i++) { var current_value = compressed[i].charCodeAt(0); buf[i * 2] = current_value >>> 8; buf[i * 2 + 1] = current_value & 0xFF; } return buf; }, //decompress from uint8array (UCS-2 big endian format) decompressFromUint8Array: function (compressed) { if (compressed === null || compressed === undefined) { return _decompressFromArray(compressed); } else if (compressed.length == 0) { return null; } return _decompress(compressed.length, 8, function (index) { return compressed[index]; }); }, //compress into a string that is already URI encoded compressToEncodedURIComponent: function (input) { if (input == null) return ""; return _compress(input, 6, getCharFromURISafe).join(''); }, //decompress from an output of compressToEncodedURIComponent decompressFromEncodedURIComponent: function (input) { if (input == null) return ""; if (input == "") return null; input = input.replace(/ /g, "+"); return _decompress(input.length, 6, function (index) { return reverseDict[input.charCodeAt(index)]; }); }, compress: function (uncompressed) { return _compressToArray(uncompressed).join(''); }, compressToArray: _compressToArray, decompress: function (compressed) { if (compressed == null) return ""; if (compressed == "") return null; return _decompress(compressed.length, 16, function (index) { return compressed.charCodeAt(index); }); }, decompressFromArray: _decompressFromArray }; })()32:T356b,LZStringDeferred = (function () { // private property var i = 0, fromCharCode = String.fromCharCode, stream = [], reverseDict = {}, base = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+", Base64CharArray = (base + "/=").split(''), UriSafeCharArray = (base + "-$").split(''); while (i < 65) { if (i > 62) { reverseDict[UriSafeCharArray[i].charCodeAt(0)] = i; } reverseDict[Base64CharArray[i].charCodeAt(0)] = i++; } function flushStreamToString(tokens, bitsPerChar, getCharFromInt) { var numBits = 2, dictSize = 2, output = [], outputChar = 0, token = 0, newCharToken = 0, pos = bitsPerChar; for(var i = 0; i < tokens.length; i++) { token = tokens[i]; if (token < 1) { // new charCode token newCharToken = tokens[++i]; // charCode value is in next element // increase numBits if dictSize no longer fits if (++dictSize >= (1<> j & 1 | outputChar << 1; if (--pos === 0) { pos = bitsPerChar; output.push(getCharFromInt(outputChar)); outputChar = 0; } } // reuse token as number of bits to stream for char code token = 8<> j & 1 | outputChar << 1; if (--pos === 0) { pos = bitsPerChar; output.push(getCharFromInt(outputChar)); outputChar = 0; } } } else { // regular token for (var j = 0; j < numBits; j++) { // shifting has precedence over bitmasking outputChar = token >> j & 1 | outputChar << 1; if (--pos === 0) { pos = bitsPerChar; output.push(getCharFromInt(outputChar)); outputChar = 0; } } } if (++dictSize >= (1<= (1<> j & 1 | outputChar << 1; if (--pos === 0) { pos = bitsPerChar; output.push(getCharFromInt(outputChar)); outputChar = 0; } } // reuse token as number of bits to stream for char code token = 8<> j & 1 | outputChar << 1; if (--pos === 0) { pos = bitsPerChar; output.push(getCharFromInt(outputChar)); outputChar = 0; } } } else { // regular token for (var j = 0; j < numBits; j++) { // shifting has precedence over bitmasking outputChar = token >> j & 1 | outputChar << 1; if (--pos === 0) { pos = bitsPerChar; output.push(getCharFromInt(outputChar)); outputChar = 0; } } } if (++dictSize >= (1<> --data_position & 1) << power++; if (data_position == 0) { data_position = resetBits; data_val = getNextValue(data_index++); } } // if end of stream token, return empty string if (bits == 2) { return ""; } // else, get character maxpower = bits * 8 + 8; bits = power = 0; while (power != maxpower) { // shifting has precedence over bitmasking bits += (data_val >> --data_position & 1) << power++; if (data_position == 0) { data_position = resetBits; data_val = getNextValue(data_index++); } } c = fromCharCode(bits); dictionary[3] = c; result.push(c); // read rest of string while (data_index <= length) { // read out next token maxpower = numBits; bits = power = 0; while (power != maxpower) { // shifting has precedence over bitmasking bits += (data_val >> --data_position & 1) << power++; if (data_position == 0) { data_position = resetBits; data_val = getNextValue(data_index++); } } // 0 or 1 implies new character token if (bits < 2) { maxpower = (8 + 8 * bits); bits = power = 0; while (power != maxpower) { // shifting has precedence over bitmasking bits += (data_val >> --data_position & 1) << power++; if (data_position == 0) { data_position = resetBits; data_val = getNextValue(data_index++); } } dictionary[dictSize] = fromCharCode(bits); bits = dictSize++; if (--enlargeIn == 0) { enlargeIn = 1 << numBits++; } } else if (bits == 2) { // end of stream token return result.join(''); } if (bits > dictionary.length) { return null; } entry = bits < dictionary.length ? dictionary[bits] : c + c.charAt(0); result.push(entry); // Add c+entry[0] to the dictionary. dictionary[dictSize++] = c + entry.charAt(0); c = entry; if (--enlargeIn == 0) { enlargeIn = 1 << numBits++; } } return ""; } function _compressToArray(uncompressed) { return _compress(uncompressed, 16, fromCharCode); } function _decompressFromArray(compressed) { if (compressed == null) return ""; if (compressed.length == 0) return null; return _decompress(compressed.length, 16, function (index) { return compressed[index].charCodeAt(0); }); } return { compressToBase64: function (input) { if (input == null) return ""; var res = _compress(input, 6, getCharFromBase64), i = res.length % 4; // To produce valid Base64 while (i--) { res.push("="); } return res.join(''); }, decompressFromBase64: function (input) { if (input == null) return ""; if (input == "") return null; return _decompress(input.length, 6, function (index) { return reverseDict[input.charCodeAt(index)]; }); }, compressToUTF16: function (input) { if (input == null) return ""; var compressed = _compress(input, 15, getCharFromUTF16); compressed.push(" "); return compressed.join(''); }, decompressFromUTF16: function (compressed) { if (compressed == null) return ""; if (compressed == "") return null; return _decompress(compressed.length, 15, function (index) { return compressed.charCodeAt(index) - 32; }); }, //compress into uint8array (UCS-2 big endian format) compressToUint8Array: function (uncompressed) { var compressed = _compressToArray(uncompressed); var buf = new Uint8Array(compressed.length * 2); // 2 bytes per character for (var i = 0, TotalLen = compressed.length; i < TotalLen; i++) { var current_value = compressed[i].charCodeAt(0); buf[i * 2] = current_value >>> 8; buf[i * 2 + 1] = current_value & 0xFF; } return buf; }, //decompress from uint8array (UCS-2 big endian format) decompressFromUint8Array: function (compressed) { if (compressed === null || compressed === undefined) { return _decompressFromArray(compressed); } else if (compressed.length == 0) { return null; } return _decompress(compressed.length, 8, function (index) { return compressed[index]; }); }, //compress into a string that is already URI encoded compressToEncodedURIComponent: function (input) { if (input == null) return ""; return _compress(input, 6, getCharFromURISafe).join(''); }, //decompress from an output of compressToEncodedURIComponent decompressFromEncodedURIComponent: function (input) { if (input == null) return ""; if (input == "") return null; input = input.replace(/ /g, "+"); return _decompress(input.length, 6, function (index) { return reverseDict[input.charCodeAt(index)]; }); }, compress: function (uncompressed) { return _compressToArray(uncompressed).join(''); }, compressToArray: _compressToArray, decompress: function (compressed) { if (compressed == null) return ""; if (compressed == "") return null; return _decompress(compressed.length, 16, function (index) { return compressed.charCodeAt(index); }); }, decompressFromArray: _decompressFromArray }; })()33:T2eb6,LZStringDeferred2 = (function () { // private property var i = 0, fromCharCode = String.fromCharCode, stream = [], reverseDict = {}, base = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+", Base64CharArray = (base + "/=").split(''), UriSafeCharArray = (base + "-$").split(''); while (i < 65) { if (i > 62) { reverseDict[UriSafeCharArray[i].charCodeAt(0)] = i; } reverseDict[Base64CharArray[i].charCodeAt(0)] = i++; } function getCharFromBase64(a) { return Base64CharArray[a]; } function getCharFromURISafe(a) { return UriSafeCharArray[a]; } function getCharFromUTF16(a) { return fromCharCode(a + 32); } function _node(val) { return { v: val, d: {} }; } function _compress(uncompressed, bitsPerChar, getCharFromInt) { // data - empty stream stream = []; if (uncompressed != null) { var j = 0, value = 0, dictionary = {}, freshNode = true, c = 0, node = _node(3), // first node will always be initialised like this. nextNode, dictSize = 3; if (uncompressed.length) { // If there is a string, the first charCode is guaranteed to // be new, so we write it to output stream, and add it to the // dictionary. For the same reason we can initialize freshNode // as true, and new_node, node and dictSize as if // it was already added to the dictionary (see above). c = uncompressed.charCodeAt(0); // == Write first charCode token to output == // 8 or 16 bit? value = c < 256 ? 0 : 1 // insert "new 8/16 bit char" token plus char into bitstream stream.push(value); stream.push(c); // Add charCode to the dictionary. dictionary[c] = node; for (j = 1; j < uncompressed.length; j++) { c = uncompressed.charCodeAt(j); // does the new charCode match an existing prefix? nextNode = node.d[c]; if (nextNode) { // continue with next prefix node = nextNode; } else { // Prefix+charCode does not exist in trie yet. // We write the prefix to the bitstream, and add // the new charCode to the dictionary if it's new // Then we set node to the root node matching // the charCode. if (freshNode) { // Prefix is a freshly added character token, // which was already written to the bitstream freshNode = false; } else { // write out the current prefix token value = node.v; stream.push(value); } // Is the new charCode a new character // that needs to be stored at the root? if (dictionary[c] == undefined) { // insert "new 8/16 bit charCode" token, // see comments above for explanation value = c < 256 ? 0 : 1 stream.push(value); stream.push(c); dictionary[c] = _node(dictSize) // Note of that we already wrote // the charCode token to the bitstream freshNode = true; } // add node representing prefix + new charCode to trie node.d[c] = _node(++dictSize) // set node to first charCode of new prefix node = dictionary[c]; } } // === Write last prefix to output === if (freshNode) { // character token already written to output freshNode = false; } else { // write out the prefix token stream.push(node.v) } // Is c a new character? if (dictionary[c] == undefined) { // insert "new 8/16 bit charCode" token, // see comments above for explanation value = c < 256 ? 0 : 1 stream.push(value); stream.push(c); } } // Mark the end of the stream stream.push(2); // // Flush the last char // streamDataVal <<= streamBitsPerChar - streamDataPosition; // streamData.push(streamGetCharFromInt(streamDataVal)); } //return flushStreamToString(stream, bitsPerChar, getCharFromInt); dictSize = 2; var numBits = 2, output = [], outputChar = 0, token = 0, newCharToken = 0, pos = bitsPerChar; for(var i = 0; i < stream.length; i++) { token = stream[i]; if (token < 1) { // new charCode token newCharToken = stream[++i]; // charCode value is in next element // increase numBits if dictSize no longer fits if (++dictSize >= (1<> j & 1 | outputChar << 1; if (--pos === 0) { pos = bitsPerChar; output.push(getCharFromInt(outputChar)); outputChar = 0; } } // reuse token as number of bits to stream for char code token = 8<> j & 1 | outputChar << 1; if (--pos === 0) { pos = bitsPerChar; output.push(getCharFromInt(outputChar)); outputChar = 0; } } } else { // regular token for (var j = 0; j < numBits; j++) { // shifting has precedence over bitmasking outputChar = token >> j & 1 | outputChar << 1; if (--pos === 0) { pos = bitsPerChar; output.push(getCharFromInt(outputChar)); outputChar = 0; } } } if (++dictSize >= (1<> --data_position & 1) << power++; if (data_position == 0) { data_position = resetBits; data_val = getNextValue(data_index++); } } // if end of stream token, return empty string if (bits == 2) { return ""; } // else, get character maxpower = bits * 8 + 8; bits = power = 0; while (power != maxpower) { // shifting has precedence over bitmasking bits += (data_val >> --data_position & 1) << power++; if (data_position == 0) { data_position = resetBits; data_val = getNextValue(data_index++); } } c = fromCharCode(bits); dictionary[3] = c; result.push(c); // read rest of string while (data_index <= length) { // read out next token maxpower = numBits; bits = power = 0; while (power != maxpower) { // shifting has precedence over bitmasking bits += (data_val >> --data_position & 1) << power++; if (data_position == 0) { data_position = resetBits; data_val = getNextValue(data_index++); } } // 0 or 1 implies new character token if (bits < 2) { maxpower = (8 + 8 * bits); bits = power = 0; while (power != maxpower) { // shifting has precedence over bitmasking bits += (data_val >> --data_position & 1) << power++; if (data_position == 0) { data_position = resetBits; data_val = getNextValue(data_index++); } } dictionary[dictSize] = fromCharCode(bits); bits = dictSize++; if (--enlargeIn == 0) { enlargeIn = 1 << numBits++; } } else if (bits == 2) { // end of stream token return result.join(''); } if (bits > dictionary.length) { return null; } entry = bits < dictionary.length ? dictionary[bits] : c + c.charAt(0); result.push(entry); // Add c+entry[0] to the dictionary. dictionary[dictSize++] = c + entry.charAt(0); c = entry; if (--enlargeIn == 0) { enlargeIn = 1 << numBits++; } } return ""; } function _compressToArray(uncompressed) { return _compress(uncompressed, 16, fromCharCode); } function _decompressFromArray(compressed) { if (compressed == null) return ""; if (compressed.length == 0) return null; return _decompress(compressed.length, 16, function (index) { return compressed[index].charCodeAt(0); }); } return { compressToBase64: function (input) { if (input == null) return ""; var res = _compress(input, 6, getCharFromBase64), i = res.length % 4; // To produce valid Base64 while (i--) { res.push("="); } return res.join(''); }, decompressFromBase64: function (input) { if (input == null) return ""; if (input == "") return null; return _decompress(input.length, 6, function (index) { return reverseDict[input.charCodeAt(index)]; }); }, compressToUTF16: function (input) { if (input == null) return ""; var compressed = _compress(input, 15, getCharFromUTF16); compressed.push(" "); return compressed.join(''); }, decompressFromUTF16: function (compressed) { if (compressed == null) return ""; if (compressed == "") return null; return _decompress(compressed.length, 15, function (index) { return compressed.charCodeAt(index) - 32; }); }, //compress into uint8array (UCS-2 big endian format) compressToUint8Array: function (uncompressed) { var compressed = _compressToArray(uncompressed); var buf = new Uint8Array(compressed.length * 2); // 2 bytes per character for (var i = 0, TotalLen = compressed.length; i < TotalLen; i++) { var current_value = compressed[i].charCodeAt(0); buf[i * 2] = current_value >>> 8; buf[i * 2 + 1] = current_value & 0xFF; } return buf; }, //decompress from uint8array (UCS-2 big endian format) decompressFromUint8Array: function (compressed) { if (compressed === null || compressed === undefined) { return _decompressFromArray(compressed); } else if (compressed.length == 0) { return null; } return _decompress(compressed.length, 8, function (index) { return compressed[index]; }); }, //compress into a string that is already URI encoded compressToEncodedURIComponent: function (input) { if (input == null) return ""; return _compress(input, 6, getCharFromURISafe).join(''); }, //decompress from an output of compressToEncodedURIComponent decompressFromEncodedURIComponent: function (input) { if (input == null) return ""; if (input == "") return null; input = input.replace(/ /g, "+"); return _decompress(input.length, 6, function (index) { return reverseDict[input.charCodeAt(index)]; }); }, compress: function (uncompressed) { return _compressToArray(uncompressed).join(''); }, compressToArray: _compressToArray, decompress: function (compressed) { if (compressed == null) return ""; if (compressed == "") return null; return _decompress(compressed.length, 16, function (index) { return compressed.charCodeAt(index); }); }, decompressFromArray: _decompressFromArray }; })()34:[] 2f:{"id":"769511a1fee5e49b","slug":null,"title":"Benchmarking JavaScript (WIP!)","thumbnail":"b560358eab659386d3848b2eb361c0b16a51419f76611f7dd933c863f9ec9abd","access_level":"unlisted","create_time":"$D2019-03-25T15:36:40.934Z","update_time":"$D2019-03-27T21:57:19.690Z","view_time":null,"first_public_time":null,"has_unpublished_edits":null,"fork":false,"stars":0,"starred":false,"owner":{"type":"team","id":"3f83172cfde1e56a","login":"jobleonard","name":"Job van der Zwan","avatar_url":"https://avatars-next.observableusercontent.com/808373580aa09723ceabb9cb31d01ea6db287280b59eaa63618e259f5d28dd71","tier":"starter_2024"},"version":140,"publish_version":140,"role":null,"authored":false,"authors":[{"type":"individual","id":"d36034ddfb454bdd","login":"jobleonard","name":"Job van der Zwan","avatar_url":"https://avatars-next.observableusercontent.com/808373580aa09723ceabb9cb31d01ea6db287280b59eaa63618e259f5d28dd71","tier":null}],"members":[{"type":"individual","id":"d36034ddfb454bdd","login":"jobleonard","name":"Job van der Zwan","avatar_url":"https://avatars-next.observableusercontent.com/808373580aa09723ceabb9cb31d01ea6db287280b59eaa63618e259f5d28dd71","tier":null,"role":"editor"}],"comments":[],"custom_thumbnail":false,"trashed":false,"lapsed":null,"subscribed":null,"forks":1,"collection":null,"type":"notebook","body":{"title":"Benchmarking JavaScript (WIP!)","cells":[{"id":0,"value":"md`# Benchmarking JavaScript (WIP!)\n\nLet's use [\\`stats.sample\\`](https://benchmarkjs.com/docs#stats_sample) object from [\\`benchmark.js\\`](https://benchmarkjs.com/)' to produce richer output than just a number + error margin`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":28,"value":"multiLineChart","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":30,"value":"perfData = {\n if (output) {\n const series = [], dates = [];\n for(let i = 0, benchmark; output[i]; i++) {\n benchmark = output[i]\n const name = benchmark.name;\n const data = {\n name,\n values: benchmark.stats.sample.map(v => Math.round(1/v))\n };\n series.push(data);\n for (let i = dates.length; dates.length < data.values.length; i++) dates.push(i+'');\n }\n for(let i = 0; i < series.length; i++){\n const {values} = series[i];\n // pad the last values with repeat output\n while(values.length < dates.length) values.push(values[values.length-1]);\n }\n return {\n y: \"ops/sec\",\n series,\n dates,\n };\n } else {\n return {\n y: \"ops/sec\",\n series: [],\n dates: [],\n };\n }\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":11,"value":"mutable output = null","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":66,"value":"{\n var suite = new Benchmark.Suite;\n \n // add tests\n suite\n .add('LZString.compress', function() {\n LZString.compress(randomString());\n })\n .add('LZStringDeferred.compress', function() {\n LZStringDeferred.compress(randomString());\n })\n .add('LZStringDeferred2.compress', function() {\n LZStringDeferred2.compress(randomString());\n })\n // add listeners\n .on('cycle', function(event) {\n console.log(String(event.target));\n })\n .on('complete', function() {\n console.log('Fastest is ' + this.filter('fastest').map('name'));\n mutable output = this;\n });\n \n for(let i = 0; i < 3; i++) {\n suite[i].options.minSamples = 50;\n }\n \n // run async\n suite.run({ 'async': true });\n return suite;\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":36,"value":"x = d3.scaleLinear()\n .domain(d3.extent(perfData.dates)).nice()\n .range([margin.left, width - margin.right])","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":97,"value":"y = d3.scaleLinear()\n .domain([0, d3.max(perfData.series, d => d3.max(d.values))]).nice()\n .range([height - margin.bottom, margin.top])","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":94,"value":"yAxis = g => g\n .attr(\"transform\", `translate(${margin.left},0)`)\n .call(d3.axisLeft(y))\n .call(g => g.select(\".domain\").remove())\n .call(g => g.select(\".tick:last-of-type text\").clone()\n .attr(\"x\", 3)\n .attr(\"text-anchor\", \"start\")\n .attr(\"font-weight\", \"bold\")\n .text(perfData.y))","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":37,"value":"margin = ({top: 20, right: 20, bottom: 30, left: 100})","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":24,"value":"height = 600","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":40,"value":"d3 = require(\"d3@5\")","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":22,"value":"import {chart as multiLineChart} with {perfData as data, x as x, y as y, yAxis as yAxis, width, height} from '@d3/multi-line-chart'","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":2,"value":"Benchmark = require('benchmark')","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":130,"value":"function randomString() {let s = ''; for(let i = 0; i < 1000; i++) s += Math.random(); return s}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":124,"value":"$31","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":122,"value":"$32","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":133,"value":"$33","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"}],"files":"$W34","stdlib":"1","titling":"auto"}} 30:"$2f:body"