test
\", \"![\":octocat:\"](\"https://assets-cdn.github.com/images/icons/emoji/octocat.png\"){kind=icon}
',\n 'showdown': 'S'\n };\n\n /**\n * Created by Estevao on 31-05-2015.\n */\n\n /**\n * Showdown Converter class\n * @class\n * @param {object} [converterOptions]\n * @returns {Converter}\n */\n showdown.Converter = function (converterOptions) {\n 'use strict';\n\n var\n /**\n * Options used by this converter\n * @private\n * @type {{}}\n */\n options = {},\n\n\n /**\n * Language extensions used by this converter\n * @private\n * @type {Array}\n */\n langExtensions = [],\n\n\n /**\n * Output modifiers extensions used by this converter\n * @private\n * @type {Array}\n */\n outputModifiers = [],\n\n\n /**\n * Event listeners\n * @private\n * @type {{}}\n */\n listeners = {},\n\n\n /**\n * The flavor set in this converter\n */\n setConvFlavor = setFlavor,\n\n\n /**\n * Metadata of the document\n * @type {{parsed: {}, raw: string, format: string}}\n */\n metadata = {\n parsed: {},\n raw: '',\n format: ''\n };\n\n _constructor();\n\n /**\n * Converter constructor\n * @private\n */\n function _constructor() {\n converterOptions = converterOptions || {};\n\n for (var gOpt in globalOptions) {\n if (globalOptions.hasOwnProperty(gOpt)) {\n options[gOpt] = globalOptions[gOpt];\n }\n }\n\n // Merge options\n if (typeof converterOptions === 'object') {\n for (var opt in converterOptions) {\n if (converterOptions.hasOwnProperty(opt)) {\n options[opt] = converterOptions[opt];\n }\n }\n } else {\n throw Error('Converter expects the passed parameter to be an object, but ' + typeof converterOptions + ' was passed instead.');\n }\n\n if (options.extensions) {\n showdown.helper.forEach(options.extensions, _parseExtension);\n }\n }\n\n /**\n * Parse extension\n * @param {*} ext\n * @param {string} [name='']\n * @private\n */\n function _parseExtension(ext, name) {\n\n name = name || null;\n // If it's a string, the extension was previously loaded\n if (showdown.helper.isString(ext)) {\n ext = showdown.helper.stdExtName(ext);\n name = ext;\n\n // LEGACY_SUPPORT CODE\n if (showdown.extensions[ext]) {\n console.warn('DEPRECATION WARNING: ' + ext + ' is an old extension that uses a deprecated loading method.' + 'Please inform the developer that the extension should be updated!');\n legacyExtensionLoading(showdown.extensions[ext], ext);\n return;\n // END LEGACY SUPPORT CODE\n } else if (!showdown.helper.isUndefined(extensions[ext])) {\n ext = extensions[ext];\n } else {\n throw Error('Extension \"' + ext + '\" could not be loaded. It was either not found or is not a valid extension.');\n }\n }\n\n if (typeof ext === 'function') {\n ext = ext();\n }\n\n if (!showdown.helper.isArray(ext)) {\n ext = [ext];\n }\n\n var validExt = validate(ext, name);\n if (!validExt.valid) {\n throw Error(validExt.error);\n }\n\n for (var i = 0; i < ext.length; ++i) {\n switch (ext[i].type) {\n\n case 'lang':\n langExtensions.push(ext[i]);\n break;\n\n case 'output':\n outputModifiers.push(ext[i]);\n break;\n }\n if (ext[i].hasOwnProperty('listeners')) {\n for (var ln in ext[i].listeners) {\n if (ext[i].listeners.hasOwnProperty(ln)) {\n listen(ln, ext[i].listeners[ln]);\n }\n }\n }\n }\n }\n\n /**\n * LEGACY_SUPPORT\n * @param {*} ext\n * @param {string} name\n */\n function legacyExtensionLoading(ext, name) {\n if (typeof ext === 'function') {\n ext = ext(new showdown.Converter());\n }\n if (!showdown.helper.isArray(ext)) {\n ext = [ext];\n }\n var valid = validate(ext, name);\n\n if (!valid.valid) {\n throw Error(valid.error);\n }\n\n for (var i = 0; i < ext.length; ++i) {\n switch (ext[i].type) {\n case 'lang':\n langExtensions.push(ext[i]);\n break;\n case 'output':\n outputModifiers.push(ext[i]);\n break;\n default:\n // should never reach here\n throw Error('Extension loader error: Type unrecognized!!!');\n }\n }\n }\n\n /**\n * Listen to an event\n * @param {string} name\n * @param {function} callback\n */\n function listen(name, callback) {\n if (!showdown.helper.isString(name)) {\n throw Error('Invalid argument in converter.listen() method: name must be a string, but ' + typeof name + ' given');\n }\n\n if (typeof callback !== 'function') {\n throw Error('Invalid argument in converter.listen() method: callback must be a function, but ' + typeof callback + ' given');\n }\n\n if (!listeners.hasOwnProperty(name)) {\n listeners[name] = [];\n }\n listeners[name].push(callback);\n }\n\n function rTrimInputText(text) {\n var rsp = text.match(/^\\s*/)[0].length,\n rgx = new RegExp('^\\\\s{0,' + rsp + '}', 'gm');\n return text.replace(rgx, '');\n }\n\n /**\n * Dispatch an event\n * @private\n * @param {string} evtName Event name\n * @param {string} text Text\n * @param {{}} options Converter Options\n * @param {{}} globals\n * @returns {string}\n */\n this._dispatch = function dispatch(evtName, text, options, globals) {\n if (listeners.hasOwnProperty(evtName)) {\n for (var ei = 0; ei < listeners[evtName].length; ++ei) {\n var nText = listeners[evtName][ei](evtName, text, this, options, globals);\n if (nText && typeof nText !== 'undefined') {\n text = nText;\n }\n }\n }\n return text;\n };\n\n /**\n * Listen to an event\n * @param {string} name\n * @param {function} callback\n * @returns {showdown.Converter}\n */\n this.listen = function (name, callback) {\n listen(name, callback);\n return this;\n };\n\n /**\n * Converts a markdown string into HTML\n * @param {string} text\n * @returns {*}\n */\n this.makeHtml = function (text) {\n //check if text is not falsy\n if (!text) {\n return text;\n }\n\n var globals = {\n gHtmlBlocks: [],\n gHtmlMdBlocks: [],\n gHtmlSpans: [],\n gUrls: {},\n gTitles: {},\n gDimensions: {},\n gListLevel: 0,\n hashLinkCounts: {},\n langExtensions: langExtensions,\n outputModifiers: outputModifiers,\n converter: this,\n ghCodeBlocks: [],\n metadata: {\n parsed: {},\n raw: '',\n format: ''\n }\n };\n\n // This lets us use ¨ trema as an escape char to avoid md5 hashes\n // The choice of character is arbitrary; anything that isn't\n // magic in Markdown will work.\n text = text.replace(/¨/g, '¨T');\n\n // Replace $ with ¨D\n // RegExp interprets $ as a special character\n // when it's in a replacement string\n text = text.replace(/\\$/g, '¨D');\n\n // Standardize line endings\n text = text.replace(/\\r\\n/g, '\\n'); // DOS to Unix\n text = text.replace(/\\r/g, '\\n'); // Mac to Unix\n\n // Stardardize line spaces\n text = text.replace(/\\u00A0/g, ' ');\n\n if (options.smartIndentationFix) {\n text = rTrimInputText(text);\n }\n\n // Make sure text begins and ends with a couple of newlines:\n text = '\\n\\n' + text + '\\n\\n';\n\n // detab\n text = showdown.subParser('detab')(text, options, globals);\n\n /**\n * Strip any lines consisting only of spaces and tabs.\n * This makes subsequent regexs easier to write, because we can\n * match consecutive blank lines with /\\n+/ instead of something\n * contorted like /[ \\t]*\\n+/\n */\n text = text.replace(/^[ \\t]+$/mg, '');\n\n //run languageExtensions\n showdown.helper.forEach(langExtensions, function (ext) {\n text = showdown.subParser('runExtension')(ext, text, options, globals);\n });\n\n // run the sub parsers\n text = showdown.subParser('metadata')(text, options, globals);\n text = showdown.subParser('hashPreCodeTags')(text, options, globals);\n text = showdown.subParser('githubCodeBlocks')(text, options, globals);\n text = showdown.subParser('hashHTMLBlocks')(text, options, globals);\n text = showdown.subParser('hashCodeTags')(text, options, globals);\n text = showdown.subParser('stripLinkDefinitions')(text, options, globals);\n text = showdown.subParser('blockGamut')(text, options, globals);\n text = showdown.subParser('unhashHTMLSpans')(text, options, globals);\n text = showdown.subParser('unescapeSpecialChars')(text, options, globals);\n\n // attacklab: Restore dollar signs\n text = text.replace(/¨D/g, '$$');\n\n // attacklab: Restore tremas\n text = text.replace(/¨T/g, '¨');\n\n // render a complete html document instead of a partial if the option is enabled\n text = showdown.subParser('completeHTMLDocument')(text, options, globals);\n\n // Run output modifiers\n showdown.helper.forEach(outputModifiers, function (ext) {\n text = showdown.subParser('runExtension')(ext, text, options, globals);\n });\n\n // update metadata\n metadata = globals.metadata;\n return text;\n };\n\n /**\n * Converts an HTML string into a markdown string\n * @param src\n * @param [HTMLParser] A WHATWG DOM and HTML parser, such as JSDOM. If none is supplied, window.document will be used.\n * @returns {string}\n */\n this.makeMarkdown = this.makeMd = function (src, HTMLParser) {\n\n // replace \\r\\n with \\n\n src = src.replace(/\\r\\n/g, '\\n');\n src = src.replace(/\\r/g, '\\n'); // old macs\n\n // due to an edge case, we need to find this: > <\n // to prevent removing of non silent white spaces\n // ex: this is sparta\n src = src.replace(/>[ \\t]+¨NBSP;<');\n\n if (!HTMLParser) {\n if (window && window.document) {\n HTMLParser = window.document;\n } else {\n throw new Error('HTMLParser is undefined. If in a webworker or nodejs environment, you need to provide a WHATWG DOM and HTML such as JSDOM');\n }\n }\n\n var doc = HTMLParser.createElement('div');\n doc.innerHTML = src;\n\n var globals = {\n preList: substitutePreCodeTags(doc)\n };\n\n // remove all newlines and collapse spaces\n clean(doc);\n\n // some stuff, like accidental reference links must now be escaped\n // TODO\n // doc.innerHTML = doc.innerHTML.replace(/\\[[\\S\\t ]]/);\n\n var nodes = doc.childNodes,\n mdDoc = '';\n\n for (var i = 0; i < nodes.length; i++) {\n mdDoc += showdown.subParser('makeMarkdown.node')(nodes[i], globals);\n }\n\n function clean(node) {\n for (var n = 0; n < node.childNodes.length; ++n) {\n var child = node.childNodes[n];\n if (child.nodeType === 3) {\n if (!/\\S/.test(child.nodeValue)) {\n node.removeChild(child);\n --n;\n } else {\n child.nodeValue = child.nodeValue.split('\\n').join(' ');\n child.nodeValue = child.nodeValue.replace(/(\\s)+/g, '$1');\n }\n } else if (child.nodeType === 1) {\n clean(child);\n }\n }\n }\n\n // find all pre tags and replace contents with placeholder\n // we need this so that we can remove all indentation from html\n // to ease up parsing\n function substitutePreCodeTags(doc) {\n\n var pres = doc.querySelectorAll('pre'),\n presPH = [];\n\n for (var i = 0; i < pres.length; ++i) {\n\n if (pres[i].childElementCount === 1 && pres[i].firstChild.tagName.toLowerCase() === 'code') {\n var content = pres[i].firstChild.innerHTML.trim(),\n language = pres[i].firstChild.getAttribute('data-language') || '';\n\n // if data-language attribute is not defined, then we look for class language-*\n if (language === '') {\n var classes = pres[i].firstChild.className.split(' ');\n for (var c = 0; c < classes.length; ++c) {\n var matches = classes[c].match(/^language-(.+)$/);\n if (matches !== null) {\n language = matches[1];\n break;\n }\n }\n }\n\n // unescape html entities in content\n content = showdown.helper.unescapeHTMLEntities(content);\n\n presPH.push(content);\n pres[i].outerHTML = 'tags around block-level tags.\n text = showdown.subParser('hashHTMLBlocks')(text, options, globals);\n text = showdown.subParser('paragraphs')(text, options, globals);\n\n text = globals.converter._dispatch('blockGamut.after', text, options, globals);\n\n return text;\n });\n\n showdown.subParser('blockQuotes', function (text, options, globals) {\n 'use strict';\n\n text = globals.converter._dispatch('blockQuotes.before', text, options, globals);\n\n // add a couple extra lines after the text and endtext mark\n text = text + '\\n\\n';\n\n var rgx = /(^ {0,3}>[ \\t]?.+\\n(.+\\n)*\\n*)+/gm;\n\n if (options.splitAdjacentBlockquotes) {\n rgx = /^ {0,3}>[\\s\\S]*?(?:\\n\\n)/gm;\n }\n\n text = text.replace(rgx, function (bq) {\n // attacklab: hack around Konqueror 3.5.4 bug:\n // \"----------bug\".replace(/^-/g,\"\") == \"bug\"\n bq = bq.replace(/^[ \\t]*>[ \\t]?/gm, ''); // trim one level of quoting\n\n // attacklab: clean up hack\n bq = bq.replace(/¨0/g, '');\n\n bq = bq.replace(/^[ \\t]+$/gm, ''); // trim whitespace-only lines\n bq = showdown.subParser('githubCodeBlocks')(bq, options, globals);\n bq = showdown.subParser('blockGamut')(bq, options, globals); // recurse\n\n bq = bq.replace(/(^|\\n)/g, '$1 ');\n // These leading spaces screw with
content, so we need to fix that:\n bq = bq.replace(/(\\s*[^\\r]+?<\\/pre>)/gm, function (wholeMatch, m1) {\n var pre = m1;\n // attacklab: hack around Konqueror 3.5.4 bug:\n pre = pre.replace(/^ /mg, '¨0');\n pre = pre.replace(/¨0/g, '');\n return pre;\n });\n\n return showdown.subParser('hashBlock')('\\n' + bq + '\\n
', options, globals);\n });\n\n text = globals.converter._dispatch('blockQuotes.after', text, options, globals);\n return text;\n });\n\n /**\n * Process Markdown `` blocks.\n */\n showdown.subParser('codeBlocks', function (text, options, globals) {\n 'use strict';\n\n text = globals.converter._dispatch('codeBlocks.before', text, options, globals);\n\n // sentinel workarounds for lack of \\A and \\Z, safari\\khtml bug\n text += '¨0';\n\n var pattern = /(?:\\n\\n|^)((?:(?:[ ]{4}|\\t).*\\n+)+)(\\n*[ ]{0,3}[^ \\t\\n]|(?=¨0))/g;\n text = text.replace(pattern, function (wholeMatch, m1, m2) {\n var codeblock = m1,\n nextChar = m2,\n end = '\\n';\n\n codeblock = showdown.subParser('outdent')(codeblock, options, globals);\n codeblock = showdown.subParser('encodeCode')(codeblock, options, globals);\n codeblock = showdown.subParser('detab')(codeblock, options, globals);\n codeblock = codeblock.replace(/^\\n+/g, ''); // trim leading newlines\n codeblock = codeblock.replace(/\\n+$/g, ''); // trim trailing newlines\n\n if (options.omitExtraWLInCodeBlocks) {\n end = '';\n }\n\n codeblock = '' + codeblock + end + '
';\n\n return showdown.subParser('hashBlock')(codeblock, options, globals) + nextChar;\n });\n\n // strip sentinel\n text = text.replace(/¨0/, '');\n\n text = globals.converter._dispatch('codeBlocks.after', text, options, globals);\n return text;\n });\n\n /**\n *\n * * Backtick quotes are used for Just type foo `bar` baz at the prompt.
\n *\n * There's no arbitrary limit to the number of backticks you\n * can use as delimters. If you need three consecutive backticks\n * in your code, use four for delimiters, etc.\n *\n * * You can use spaces to get literal backticks at the edges:\n *\n * ... type `` `bar` `` ...\n *\n * Turns to:\n *\n * ... type `bar` ...\n */\n showdown.subParser('codeSpans', function (text, options, globals) {\n 'use strict';\n\n text = globals.converter._dispatch('codeSpans.before', text, options, globals);\n\n if (typeof text === 'undefined') {\n text = '';\n }\n text = text.replace(/(^|[^\\\\])(`+)([^\\r]*?[^`])\\2(?!`)/gm, function (wholeMatch, m1, m2, m3) {\n var c = m3;\n c = c.replace(/^([ \\t]*)/g, ''); // leading whitespace\n c = c.replace(/[ \\t]*$/g, ''); // trailing whitespace\n c = showdown.subParser('encodeCode')(c, options, globals);\n c = m1 + '' + c + '';\n c = showdown.subParser('hashHTMLSpans')(c, options, globals);\n return c;\n });\n\n text = globals.converter._dispatch('codeSpans.after', text, options, globals);\n return text;\n });\n\n /**\n * Create a full HTML document from the processed markdown\n */\n showdown.subParser('completeHTMLDocument', function (text, options, globals) {\n 'use strict';\n\n if (!options.completeHTMLDocument) {\n return text;\n }\n\n text = globals.converter._dispatch('completeHTMLDocument.before', text, options, globals);\n\n var doctype = 'html',\n doctypeParsed = '\\n',\n title = '',\n charset = '\\n',\n lang = '',\n metadata = '';\n\n if (typeof globals.metadata.parsed.doctype !== 'undefined') {\n doctypeParsed = '\\n';\n doctype = globals.metadata.parsed.doctype.toString().toLowerCase();\n if (doctype === 'html' || doctype === 'html5') {\n charset = '';\n }\n }\n\n for (var meta in globals.metadata.parsed) {\n if (globals.metadata.parsed.hasOwnProperty(meta)) {\n switch (meta.toLowerCase()) {\n case 'doctype':\n break;\n\n case 'title':\n title = '' + globals.metadata.parsed.title + ' \\n';\n break;\n\n case 'charset':\n if (doctype === 'html' || doctype === 'html5') {\n charset = '\\n';\n } else {\n charset = '\\n';\n }\n break;\n\n case 'language':\n case 'lang':\n lang = ' lang=\"' + globals.metadata.parsed[meta] + '\"';\n metadata += '\\n';\n break;\n\n default:\n metadata += '\\n';\n }\n }\n }\n\n text = doctypeParsed + '\\n\\n' + title + charset + metadata + '\\n\\n' + text.trim() + '\\n\\n';\n\n text = globals.converter._dispatch('completeHTMLDocument.after', text, options, globals);\n return text;\n });\n\n /**\n * Convert all tabs to spaces\n */\n showdown.subParser('detab', function (text, options, globals) {\n 'use strict';\n\n text = globals.converter._dispatch('detab.before', text, options, globals);\n\n // expand first n-1 tabs\n text = text.replace(/\\t(?=\\t)/g, ' '); // g_tab_width\n\n // replace the nth with two sentinels\n text = text.replace(/\\t/g, '¨A¨B');\n\n // use the sentinel to anchor our regex so it doesn't explode\n text = text.replace(/¨B(.+?)¨A/g, function (wholeMatch, m1) {\n var leadingText = m1,\n numSpaces = 4 - leadingText.length % 4; // g_tab_width\n\n // there *must* be a better way to do this:\n for (var i = 0; i < numSpaces; i++) {\n leadingText += ' ';\n }\n\n return leadingText;\n });\n\n // clean up sentinels\n text = text.replace(/¨A/g, ' '); // g_tab_width\n text = text.replace(/¨B/g, '');\n\n text = globals.converter._dispatch('detab.after', text, options, globals);\n return text;\n });\n\n showdown.subParser('ellipsis', function (text, options, globals) {\n 'use strict';\n\n text = globals.converter._dispatch('ellipsis.before', text, options, globals);\n\n text = text.replace(/\\.\\.\\./g, '…');\n\n text = globals.converter._dispatch('ellipsis.after', text, options, globals);\n\n return text;\n });\n\n /**\n * Turn emoji codes into emojis\n *\n * List of supported emojis: https://github.com/showdownjs/showdown/wiki/Emojis\n */\n showdown.subParser('emoji', function (text, options, globals) {\n 'use strict';\n\n if (!options.emoji) {\n return text;\n }\n\n text = globals.converter._dispatch('emoji.before', text, options, globals);\n\n var emojiRgx = /:([\\S]+?):/g;\n\n text = text.replace(emojiRgx, function (wm, emojiCode) {\n if (showdown.helper.emojis.hasOwnProperty(emojiCode)) {\n return showdown.helper.emojis[emojiCode];\n }\n return wm;\n });\n\n text = globals.converter._dispatch('emoji.after', text, options, globals);\n\n return text;\n });\n\n /**\n * Smart processing for ampersands and angle brackets that need to be encoded.\n */\n showdown.subParser('encodeAmpsAndAngles', function (text, options, globals) {\n 'use strict';\n\n text = globals.converter._dispatch('encodeAmpsAndAngles.before', text, options, globals);\n\n // Ampersand-encoding based entirely on Nat Irons's Amputator MT plugin:\n // http://bumppo.net/projects/amputator/\n text = text.replace(/&(?!#?[xX]?(?:[0-9a-fA-F]+|\\w+);)/g, '&');\n\n // Encode naked <'s\n text = text.replace(/<(?![a-z\\/?$!])/gi, '<');\n\n // Encode <\n text = text.replace(/\n text = text.replace(/>/g, '>');\n\n text = globals.converter._dispatch('encodeAmpsAndAngles.after', text, options, globals);\n return text;\n });\n\n /**\n * Returns the string, with after processing the following backslash escape sequences.\n *\n * attacklab: The polite way to do this is with the new escapeCharacters() function:\n *\n * text = escapeCharacters(text,\"\\\\\",true);\n * text = escapeCharacters(text,\"`*_{}[]()>#+-.!\",true);\n *\n * ...but we're sidestepping its use of the (slow) RegExp constructor\n * as an optimization for Firefox. This function gets called a LOT.\n */\n showdown.subParser('encodeBackslashEscapes', function (text, options, globals) {\n 'use strict';\n\n text = globals.converter._dispatch('encodeBackslashEscapes.before', text, options, globals);\n\n text = text.replace(/\\\\(\\\\)/g, showdown.helper.escapeCharactersCallback);\n text = text.replace(/\\\\([`*_{}\\[\\]()>#+.!~=|-])/g, showdown.helper.escapeCharactersCallback);\n\n text = globals.converter._dispatch('encodeBackslashEscapes.after', text, options, globals);\n return text;\n });\n\n /**\n * Encode/escape certain characters inside Markdown code runs.\n * The point is that in code, these characters are literals,\n * and lose their special Markdown meanings.\n */\n showdown.subParser('encodeCode', function (text, options, globals) {\n 'use strict';\n\n text = globals.converter._dispatch('encodeCode.before', text, options, globals);\n\n // Encode all ampersands; HTML entities are not\n // entities within a Markdown code span.\n text = text.replace(/&/g, '&')\n // Do the angle bracket song and dance:\n .replace(//g, '>')\n // Now, escape characters that are magic in Markdown:\n .replace(/([*_{}\\[\\]\\\\=~-])/g, showdown.helper.escapeCharactersCallback);\n\n text = globals.converter._dispatch('encodeCode.after', text, options, globals);\n return text;\n });\n\n /**\n * Within tags -- meaning between < and > -- encode [\\ ` * _ ~ =] so they\n * don't conflict with their use in Markdown for code, italics and strong.\n */\n showdown.subParser('escapeSpecialCharsWithinTagAttributes', function (text, options, globals) {\n 'use strict';\n\n text = globals.converter._dispatch('escapeSpecialCharsWithinTagAttributes.before', text, options, globals);\n\n // Build a regex to find HTML tags.\n var tags = /<\\/?[a-z\\d_:-]+(?:[\\s]+[\\s\\S]+?)?>/gi,\n comments = /-]|-[^>])(?:[^-]|-[^-])*)--)>/gi;\n\n text = text.replace(tags, function (wholeMatch) {\n return wholeMatch.replace(/(.)<\\/?code>(?=.)/g, '$1`').replace(/([\\\\`*_~=|])/g, showdown.helper.escapeCharactersCallback);\n });\n\n text = text.replace(comments, function (wholeMatch) {\n return wholeMatch.replace(/([\\\\`*_~=|])/g, showdown.helper.escapeCharactersCallback);\n });\n\n text = globals.converter._dispatch('escapeSpecialCharsWithinTagAttributes.after', text, options, globals);\n return text;\n });\n\n /**\n * Handle github codeblocks prior to running HashHTML so that\n * HTML contained within the codeblock gets escaped properly\n * Example:\n * ```ruby\n * def hello_world(x)\n * puts \"Hello, #{x}\"\n * end\n * ```\n */\n showdown.subParser('githubCodeBlocks', function (text, options, globals) {\n 'use strict';\n\n // early exit if option is not enabled\n\n if (!options.ghCodeBlocks) {\n return text;\n }\n\n text = globals.converter._dispatch('githubCodeBlocks.before', text, options, globals);\n\n text += '¨0';\n\n text = text.replace(/(?:^|\\n)(?: {0,3})(```+|~~~+)(?: *)([^\\s`~]*)\\n([\\s\\S]*?)\\n(?: {0,3})\\1/g, function (wholeMatch, delim, language, codeblock) {\n var end = options.omitExtraWLInCodeBlocks ? '' : '\\n';\n\n // First parse the github code block\n codeblock = showdown.subParser('encodeCode')(codeblock, options, globals);\n codeblock = showdown.subParser('detab')(codeblock, options, globals);\n codeblock = codeblock.replace(/^\\n+/g, ''); // trim leading newlines\n codeblock = codeblock.replace(/\\n+$/g, ''); // trim trailing whitespace\n\n codeblock = '' + codeblock + end + '
';\n\n codeblock = showdown.subParser('hashBlock')(codeblock, options, globals);\n\n // Since GHCodeblocks can be false positives, we need to\n // store the primitive text and the parsed text in a global var,\n // and then return a token\n return '\\n\\n¨G' + (globals.ghCodeBlocks.push({ text: wholeMatch, codeblock: codeblock }) - 1) + 'G\\n\\n';\n });\n\n // attacklab: strip sentinel\n text = text.replace(/¨0/, '');\n\n return globals.converter._dispatch('githubCodeBlocks.after', text, options, globals);\n });\n\n showdown.subParser('hashBlock', function (text, options, globals) {\n 'use strict';\n\n text = globals.converter._dispatch('hashBlock.before', text, options, globals);\n text = text.replace(/(^\\n+|\\n+$)/g, '');\n text = '\\n\\n¨K' + (globals.gHtmlBlocks.push(text) - 1) + 'K\\n\\n';\n text = globals.converter._dispatch('hashBlock.after', text, options, globals);\n return text;\n });\n\n /**\n * Hash and escape elements that should not be parsed as markdown\n */\n showdown.subParser('hashCodeTags', function (text, options, globals) {\n 'use strict';\n\n text = globals.converter._dispatch('hashCodeTags.before', text, options, globals);\n\n var repFunc = function repFunc(wholeMatch, match, left, right) {\n var codeblock = left + showdown.subParser('encodeCode')(match, options, globals) + right;\n return '¨C' + (globals.gHtmlSpans.push(codeblock) - 1) + 'C';\n };\n\n // Hash naked \n text = showdown.helper.replaceRecursiveRegExp(text, repFunc, ']*>', ' ', 'gim');\n\n text = globals.converter._dispatch('hashCodeTags.after', text, options, globals);\n return text;\n });\n\n showdown.subParser('hashElement', function (text, options, globals) {\n 'use strict';\n\n return function (wholeMatch, m1) {\n var blockText = m1;\n\n // Undo double lines\n blockText = blockText.replace(/\\n\\n/g, '\\n');\n blockText = blockText.replace(/^\\n/, '');\n\n // strip trailing blank lines\n blockText = blockText.replace(/\\n+$/g, '');\n\n // Replace the element text with a marker (\"¨KxK\" where x is its key)\n blockText = '\\n\\n¨K' + (globals.gHtmlBlocks.push(blockText) - 1) + 'K\\n\\n';\n\n return blockText;\n };\n });\n\n showdown.subParser('hashHTMLBlocks', function (text, options, globals) {\n 'use strict';\n\n text = globals.converter._dispatch('hashHTMLBlocks.before', text, options, globals);\n\n var blockTags = ['pre', 'div', 'h1', 'h2', 'h3', 'h4', 'h5', 'h6', 'blockquote', 'table', 'dl', 'ol', 'ul', 'script', 'noscript', 'form', 'fieldset', 'iframe', 'math', 'style', 'section', 'header', 'footer', 'nav', 'article', 'aside', 'address', 'audio', 'canvas', 'figure', 'hgroup', 'output', 'video', 'p'],\n repFunc = function repFunc(wholeMatch, match, left, right) {\n var txt = wholeMatch;\n // check if this html element is marked as markdown\n // if so, it's contents should be parsed as markdown\n if (left.search(/\\bmarkdown\\b/) !== -1) {\n txt = left + globals.converter.makeHtml(match) + right;\n }\n return '\\n\\n¨K' + (globals.gHtmlBlocks.push(txt) - 1) + 'K\\n\\n';\n };\n\n if (options.backslashEscapesHTMLTags) {\n // encode backslash escaped HTML tags\n text = text.replace(/\\\\<(\\/?[^>]+?)>/g, function (wm, inside) {\n return '<' + inside + '>';\n });\n }\n\n // hash HTML Blocks\n for (var i = 0; i < blockTags.length; ++i) {\n\n var opTagPos,\n rgx1 = new RegExp('^ {0,3}(<' + blockTags[i] + '\\\\b[^>]*>)', 'im'),\n patLeft = '<' + blockTags[i] + '\\\\b[^>]*>',\n patRight = '';\n // 1. Look for the first position of the first opening HTML tag in the text\n while ((opTagPos = showdown.helper.regexIndexOf(text, rgx1)) !== -1) {\n\n // if the HTML tag is \\ escaped, we need to escape it and break\n\n\n //2. Split the text in that position\n var subTexts = showdown.helper.splitAtIndex(text, opTagPos),\n\n //3. Match recursively\n newSubText1 = showdown.helper.replaceRecursiveRegExp(subTexts[1], repFunc, patLeft, patRight, 'im');\n\n // prevent an infinite loop\n if (newSubText1 === subTexts[1]) {\n break;\n }\n text = subTexts[0].concat(newSubText1);\n }\n }\n // HR SPECIAL CASE\n text = text.replace(/(\\n {0,3}(<(hr)\\b([^<>])*?\\/?>)[ \\t]*(?=\\n{2,}))/g, showdown.subParser('hashElement')(text, options, globals));\n\n // Special case for standalone HTML comments\n text = showdown.helper.replaceRecursiveRegExp(text, function (txt) {\n return '\\n\\n¨K' + (globals.gHtmlBlocks.push(txt) - 1) + 'K\\n\\n';\n }, '^ {0,3}', 'gm');\n\n // PHP and ASP-style processor instructions ( and <%...%>)\n text = text.replace(/(?:\\n\\n)( {0,3}(?:<([?%])[^\\r]*?\\2>)[ \\t]*(?=\\n{2,}))/g, showdown.subParser('hashElement')(text, options, globals));\n\n text = globals.converter._dispatch('hashHTMLBlocks.after', text, options, globals);\n return text;\n });\n\n /**\n * Hash span elements that should not be parsed as markdown\n */\n showdown.subParser('hashHTMLSpans', function (text, options, globals) {\n 'use strict';\n\n text = globals.converter._dispatch('hashHTMLSpans.before', text, options, globals);\n\n function hashHTMLSpan(html) {\n return '¨C' + (globals.gHtmlSpans.push(html) - 1) + 'C';\n }\n\n // Hash Self Closing tags\n text = text.replace(/<[^>]+?\\/>/gi, function (wm) {\n return hashHTMLSpan(wm);\n });\n\n // Hash tags without properties\n text = text.replace(/<([^>]+?)>[\\s\\S]*?<\\/\\1>/g, function (wm) {\n return hashHTMLSpan(wm);\n });\n\n // Hash tags with properties\n text = text.replace(/<([^>]+?)\\s[^>]+?>[\\s\\S]*?<\\/\\1>/g, function (wm) {\n return hashHTMLSpan(wm);\n });\n\n // Hash self closing tags without />\n text = text.replace(/<[^>]+?>/gi, function (wm) {\n return hashHTMLSpan(wm);\n });\n\n /*showdown.helper.matchRecursiveRegExp(text, ']*>', ' ', 'gi');*/\n\n text = globals.converter._dispatch('hashHTMLSpans.after', text, options, globals);\n return text;\n });\n\n /**\n * Unhash HTML spans\n */\n showdown.subParser('unhashHTMLSpans', function (text, options, globals) {\n 'use strict';\n\n text = globals.converter._dispatch('unhashHTMLSpans.before', text, options, globals);\n\n for (var i = 0; i < globals.gHtmlSpans.length; ++i) {\n var repText = globals.gHtmlSpans[i],\n\n // limiter to prevent infinite loop (assume 10 as limit for recurse)\n limit = 0;\n\n while (/¨C(\\d+)C/.test(repText)) {\n var num = RegExp.$1;\n repText = repText.replace('¨C' + num + 'C', globals.gHtmlSpans[num]);\n if (limit === 10) {\n console.error('maximum nesting of 10 spans reached!!!');\n break;\n }\n ++limit;\n }\n text = text.replace('¨C' + i + 'C', repText);\n }\n\n text = globals.converter._dispatch('unhashHTMLSpans.after', text, options, globals);\n return text;\n });\n\n /**\n * Hash and escape elements that should not be parsed as markdown\n */\n showdown.subParser('hashPreCodeTags', function (text, options, globals) {\n 'use strict';\n\n text = globals.converter._dispatch('hashPreCodeTags.before', text, options, globals);\n\n var repFunc = function repFunc(wholeMatch, match, left, right) {\n // encode html entities\n var codeblock = left + showdown.subParser('encodeCode')(match, options, globals) + right;\n return '\\n\\n¨G' + (globals.ghCodeBlocks.push({ text: wholeMatch, codeblock: codeblock }) - 1) + 'G\\n\\n';\n };\n\n // Hash \n text = showdown.helper.replaceRecursiveRegExp(text, repFunc, '^ {0,3}]*>\\\\s*]*>', '^ {0,3} \\\\s*
', 'gim');\n\n text = globals.converter._dispatch('hashPreCodeTags.after', text, options, globals);\n return text;\n });\n\n showdown.subParser('headers', function (text, options, globals) {\n 'use strict';\n\n text = globals.converter._dispatch('headers.before', text, options, globals);\n\n var headerLevelStart = isNaN(parseInt(options.headerLevelStart)) ? 1 : parseInt(options.headerLevelStart),\n\n\n // Set text-style headers:\n //\tHeader 1\n //\t========\n //\n //\tHeader 2\n //\t--------\n //\n setextRegexH1 = options.smoothLivePreview ? /^(.+)[ \\t]*\\n={2,}[ \\t]*\\n+/gm : /^(.+)[ \\t]*\\n=+[ \\t]*\\n+/gm,\n setextRegexH2 = options.smoothLivePreview ? /^(.+)[ \\t]*\\n-{2,}[ \\t]*\\n+/gm : /^(.+)[ \\t]*\\n-+[ \\t]*\\n+/gm;\n\n text = text.replace(setextRegexH1, function (wholeMatch, m1) {\n\n var spanGamut = showdown.subParser('spanGamut')(m1, options, globals),\n hID = options.noHeaderId ? '' : ' id=\"' + headerId(m1) + '\"',\n hLevel = headerLevelStart,\n hashBlock = '' + spanGamut + ' ';\n return showdown.subParser('hashBlock')(hashBlock, options, globals);\n });\n\n text = text.replace(setextRegexH2, function (matchFound, m1) {\n var spanGamut = showdown.subParser('spanGamut')(m1, options, globals),\n hID = options.noHeaderId ? '' : ' id=\"' + headerId(m1) + '\"',\n hLevel = headerLevelStart + 1,\n hashBlock = '' + spanGamut + ' ';\n return showdown.subParser('hashBlock')(hashBlock, options, globals);\n });\n\n // atx-style headers:\n // # Header 1\n // ## Header 2\n // ## Header 2 with closing hashes ##\n // ...\n // ###### Header 6\n //\n var atxStyle = options.requireSpaceBeforeHeadingText ? /^(#{1,6})[ \\t]+(.+?)[ \\t]*#*\\n+/gm : /^(#{1,6})[ \\t]*(.+?)[ \\t]*#*\\n+/gm;\n\n text = text.replace(atxStyle, function (wholeMatch, m1, m2) {\n var hText = m2;\n if (options.customizedHeaderId) {\n hText = m2.replace(/\\s?\\{([^{]+?)}\\s*$/, '');\n }\n\n var span = showdown.subParser('spanGamut')(hText, options, globals),\n hID = options.noHeaderId ? '' : ' id=\"' + headerId(m2) + '\"',\n hLevel = headerLevelStart - 1 + m1.length,\n header = '' + span + ' ';\n\n return showdown.subParser('hashBlock')(header, options, globals);\n });\n\n function headerId(m) {\n var title, prefix;\n\n // It is separate from other options to allow combining prefix and customized\n if (options.customizedHeaderId) {\n var match = m.match(/\\{([^{]+?)}\\s*$/);\n if (match && match[1]) {\n m = match[1];\n }\n }\n\n title = m;\n\n // Prefix id to prevent causing inadvertent pre-existing style matches.\n if (showdown.helper.isString(options.prefixHeaderId)) {\n prefix = options.prefixHeaderId;\n } else if (options.prefixHeaderId === true) {\n prefix = 'section-';\n } else {\n prefix = '';\n }\n\n if (!options.rawPrefixHeaderId) {\n title = prefix + title;\n }\n\n if (options.ghCompatibleHeaderId) {\n title = title.replace(/ /g, '-')\n // replace previously escaped chars (&, ¨ and $)\n .replace(/&/g, '').replace(/¨T/g, '').replace(/¨D/g, '')\n // replace rest of the chars (&~$ are repeated as they might have been escaped)\n // borrowed from github's redcarpet (some they should produce similar results)\n .replace(/[&+$,\\/:;=?@\"#{}|^¨~\\[\\]`\\\\*)(%.!'<>]/g, '').toLowerCase();\n } else if (options.rawHeaderId) {\n title = title.replace(/ /g, '-')\n // replace previously escaped chars (&, ¨ and $)\n .replace(/&/g, '&').replace(/¨T/g, '¨').replace(/¨D/g, '$')\n // replace \" and '\n .replace(/[\"']/g, '-').toLowerCase();\n } else {\n title = title.replace(/[^\\w]/g, '').toLowerCase();\n }\n\n if (options.rawPrefixHeaderId) {\n title = prefix + title;\n }\n\n if (globals.hashLinkCounts[title]) {\n title = title + '-' + globals.hashLinkCounts[title]++;\n } else {\n globals.hashLinkCounts[title] = 1;\n }\n return title;\n }\n\n text = globals.converter._dispatch('headers.after', text, options, globals);\n return text;\n });\n\n /**\n * Turn Markdown link shortcuts into XHTML tags.\n */\n showdown.subParser('horizontalRule', function (text, options, globals) {\n 'use strict';\n\n text = globals.converter._dispatch('horizontalRule.before', text, options, globals);\n\n var key = showdown.subParser('hashBlock')('
', options, globals);\n text = text.replace(/^ {0,2}( ?-){3,}[ \\t]*$/gm, key);\n text = text.replace(/^ {0,2}( ?\\*){3,}[ \\t]*$/gm, key);\n text = text.replace(/^ {0,2}( ?_){3,}[ \\t]*$/gm, key);\n\n text = globals.converter._dispatch('horizontalRule.after', text, options, globals);\n return text;\n });\n\n /**\n * Turn Markdown image shortcuts into ![]()
tags.\n */\n showdown.subParser('images', function (text, options, globals) {\n 'use strict';\n\n text = globals.converter._dispatch('images.before', text, options, globals);\n\n var inlineRegExp = /!\\[([^\\]]*?)][ \\t]*()\\([ \\t]??(?: =([*\\d]+[A-Za-z%]{0,4})x([*\\d]+[A-Za-z%]{0,4}))?[ \\t]*(?:([\"'])([^\"]*?)\\6)?[ \\t]?\\)/g,\n crazyRegExp = /!\\[([^\\]]*?)][ \\t]*()\\([ \\t]?<([^>]*)>(?: =([*\\d]+[A-Za-z%]{0,4})x([*\\d]+[A-Za-z%]{0,4}))?[ \\t]*(?:(?:([\"'])([^\"]*?)\\6))?[ \\t]?\\)/g,\n base64RegExp = /!\\[([^\\]]*?)][ \\t]*()\\([ \\t]??(?: =([*\\d]+[A-Za-z%]{0,4})x([*\\d]+[A-Za-z%]{0,4}))?[ \\t]*(?:([\"'])([^\"]*?)\\6)?[ \\t]?\\)/g,\n referenceRegExp = /!\\[([^\\]]*?)] ?(?:\\n *)?\\[([\\s\\S]*?)]()()()()()/g,\n refShortcutRegExp = /!\\[([^\\[\\]]+)]()()()()()/g;\n\n function writeImageTagBase64(wholeMatch, altText, linkId, url, width, height, m5, title) {\n url = url.replace(/\\s/g, '');\n return writeImageTag(wholeMatch, altText, linkId, url, width, height, m5, title);\n }\n\n function writeImageTag(wholeMatch, altText, linkId, url, width, height, m5, title) {\n\n var gUrls = globals.gUrls,\n gTitles = globals.gTitles,\n gDims = globals.gDimensions;\n\n linkId = linkId.toLowerCase();\n\n if (!title) {\n title = '';\n }\n // Special case for explicit empty url\n if (wholeMatch.search(/\\(? ?(['\"].*['\"])?\\)$/m) > -1) {\n url = '';\n } else if (url === '' || url === null) {\n if (linkId === '' || linkId === null) {\n // lower-case and turn embedded newlines into spaces\n linkId = altText.toLowerCase().replace(/ ?\\n/g, ' ');\n }\n url = '#' + linkId;\n\n if (!showdown.helper.isUndefined(gUrls[linkId])) {\n url = gUrls[linkId];\n if (!showdown.helper.isUndefined(gTitles[linkId])) {\n title = gTitles[linkId];\n }\n if (!showdown.helper.isUndefined(gDims[linkId])) {\n width = gDims[linkId].width;\n height = gDims[linkId].height;\n }\n } else {\n return wholeMatch;\n }\n }\n\n altText = altText.replace(/\"/g, '"')\n //altText = showdown.helper.escapeCharacters(altText, '*_', false);\n .replace(showdown.helper.regexes.asteriskDashAndColon, showdown.helper.escapeCharactersCallback);\n //url = showdown.helper.escapeCharacters(url, '*_', false);\n url = url.replace(showdown.helper.regexes.asteriskDashAndColon, showdown.helper.escapeCharactersCallback);\n var result = '![\"'](\"' "title.replace(/\\"/g,")
x \"optional title\")\n\n // base64 encoded images\n text = text.replace(base64RegExp, writeImageTagBase64);\n\n // cases with crazy urls like ./image/cat1).png\n text = text.replace(crazyRegExp, writeImageTag);\n\n // normal cases\n text = text.replace(inlineRegExp, writeImageTag);\n\n // handle reference-style shortcuts: ![img text]\n text = text.replace(refShortcutRegExp, writeImageTag);\n\n text = globals.converter._dispatch('images.after', text, options, globals);\n return text;\n });\n\n showdown.subParser('italicsAndBold', function (text, options, globals) {\n 'use strict';\n\n text = globals.converter._dispatch('italicsAndBold.before', text, options, globals);\n\n // it's faster to have 3 separate regexes for each case than have just one\n // because of backtracing, in some cases, it could lead to an exponential effect\n // called \"catastrophic backtrace\". Ominous!\n\n function parseInside(txt, left, right) {\n /*\n if (options.simplifiedAutoLink) {\n txt = showdown.subParser('simplifiedAutoLinks')(txt, options, globals);\n }\n */\n return left + txt + right;\n }\n\n // Parse underscores\n if (options.literalMidWordUnderscores) {\n text = text.replace(/\\b___(\\S[\\s\\S]*?)___\\b/g, function (wm, txt) {\n return parseInside(txt, '', '');\n });\n text = text.replace(/\\b__(\\S[\\s\\S]*?)__\\b/g, function (wm, txt) {\n return parseInside(txt, '', '');\n });\n text = text.replace(/\\b_(\\S[\\s\\S]*?)_\\b/g, function (wm, txt) {\n return parseInside(txt, '', '');\n });\n } else {\n text = text.replace(/___(\\S[\\s\\S]*?)___/g, function (wm, m) {\n return (/\\S$/.test(m) ? parseInside(m, '', '') : wm\n );\n });\n text = text.replace(/__(\\S[\\s\\S]*?)__/g, function (wm, m) {\n return (/\\S$/.test(m) ? parseInside(m, '', '') : wm\n );\n });\n text = text.replace(/_([^\\s_][\\s\\S]*?)_/g, function (wm, m) {\n // !/^_[^_]/.test(m) - test if it doesn't start with __ (since it seems redundant, we removed it)\n return (/\\S$/.test(m) ? parseInside(m, '', '') : wm\n );\n });\n }\n\n // Now parse asterisks\n if (options.literalMidWordAsterisks) {\n text = text.replace(/([^*]|^)\\B\\*\\*\\*(\\S[\\s\\S]*?)\\*\\*\\*\\B(?!\\*)/g, function (wm, lead, txt) {\n return parseInside(txt, lead + '', '');\n });\n text = text.replace(/([^*]|^)\\B\\*\\*(\\S[\\s\\S]*?)\\*\\*\\B(?!\\*)/g, function (wm, lead, txt) {\n return parseInside(txt, lead + '', '');\n });\n text = text.replace(/([^*]|^)\\B\\*(\\S[\\s\\S]*?)\\*\\B(?!\\*)/g, function (wm, lead, txt) {\n return parseInside(txt, lead + '', '');\n });\n } else {\n text = text.replace(/\\*\\*\\*(\\S[\\s\\S]*?)\\*\\*\\*/g, function (wm, m) {\n return (/\\S$/.test(m) ? parseInside(m, '', '') : wm\n );\n });\n text = text.replace(/\\*\\*(\\S[\\s\\S]*?)\\*\\*/g, function (wm, m) {\n return (/\\S$/.test(m) ? parseInside(m, '', '') : wm\n );\n });\n text = text.replace(/\\*([^\\s*][\\s\\S]*?)\\*/g, function (wm, m) {\n // !/^\\*[^*]/.test(m) - test if it doesn't start with ** (since it seems redundant, we removed it)\n return (/\\S$/.test(m) ? parseInside(m, '', '') : wm\n );\n });\n }\n\n text = globals.converter._dispatch('italicsAndBold.after', text, options, globals);\n return text;\n });\n\n /**\n * Form HTML ordered (numbered) and unordered (bulleted) lists.\n */\n showdown.subParser('lists', function (text, options, globals) {\n 'use strict';\n\n /**\n * Process the contents of a single ordered or unordered list, splitting it\n * into individual list items.\n * @param {string} listStr\n * @param {boolean} trimTrailing\n * @returns {string}\n */\n\n function processListItems(listStr, trimTrailing) {\n // The $g_list_level global keeps track of when we're inside a list.\n // Each time we enter a list, we increment it; when we leave a list,\n // we decrement. If it's zero, we're not in a list anymore.\n //\n // We do this because when we're not inside a list, we want to treat\n // something like this:\n //\n // I recommend upgrading to version\n // 8. Oops, now this line is treated\n // as a sub-list.\n //\n // As a single paragraph, despite the fact that the second line starts\n // with a digit-period-space sequence.\n //\n // Whereas when we're inside a list (or sub-list), that line will be\n // treated as the start of a sub-list. What a kludge, huh? This is\n // an aspect of Markdown's syntax that's hard to parse perfectly\n // without resorting to mind-reading. Perhaps the solution is to\n // change the syntax rules such that sub-lists must start with a\n // starting cardinal number; e.g. \"1.\" or \"a.\".\n globals.gListLevel++;\n\n // trim trailing blank lines:\n listStr = listStr.replace(/\\n{2,}$/, '\\n');\n\n // attacklab: add sentinel to emulate \\z\n listStr += '¨0';\n\n var rgx = /(\\n)?(^ {0,3})([*+-]|\\d+[.])[ \\t]+((\\[(x|X| )?])?[ \\t]*[^\\r]+?(\\n{1,2}))(?=\\n*(¨0| {0,3}([*+-]|\\d+[.])[ \\t]+))/gm,\n isParagraphed = /\\n[ \\t]*\\n(?!¨0)/.test(listStr);\n\n // Since version 1.5, nesting sublists requires 4 spaces (or 1 tab) indentation,\n // which is a syntax breaking change\n // activating this option reverts to old behavior\n if (options.disableForced4SpacesIndentedSublists) {\n rgx = /(\\n)?(^ {0,3})([*+-]|\\d+[.])[ \\t]+((\\[(x|X| )?])?[ \\t]*[^\\r]+?(\\n{1,2}))(?=\\n*(¨0|\\2([*+-]|\\d+[.])[ \\t]+))/gm;\n }\n\n listStr = listStr.replace(rgx, function (wholeMatch, m1, m2, m3, m4, taskbtn, checked) {\n checked = checked && checked.trim() !== '';\n\n var item = showdown.subParser('outdent')(m4, options, globals),\n bulletStyle = '';\n\n // Support for github tasklists\n if (taskbtn && options.tasklists) {\n bulletStyle = ' class=\"task-list-item\" style=\"list-style-type: none;\"';\n item = item.replace(/^[ \\t]*\\[(x|X| )?]/m, function () {\n var otp = 'a \n // instead of:\n // - - - a
\n // So, to prevent it, we will put a marker (¨A)in the beginning of the line\n // Kind of hackish/monkey patching, but seems more effective than overcomplicating the list parser\n item = item.replace(/^([-*+]|\\d\\.)[ \\t]+[\\S\\n ]*/g, function (wm2) {\n return '¨A' + wm2;\n });\n\n // m1 - Leading line or\n // Has a double return (multi paragraph) or\n // Has sublist\n if (m1 || item.search(/\\n{2,}/) > -1) {\n item = showdown.subParser('githubCodeBlocks')(item, options, globals);\n item = showdown.subParser('blockGamut')(item, options, globals);\n } else {\n // Recursion for sub-lists:\n item = showdown.subParser('lists')(item, options, globals);\n item = item.replace(/\\n$/, ''); // chomp(item)\n item = showdown.subParser('hashHTMLBlocks')(item, options, globals);\n\n // Colapse double linebreaks\n item = item.replace(/\\n\\n+/g, '\\n\\n');\n if (isParagraphed) {\n item = showdown.subParser('paragraphs')(item, options, globals);\n } else {\n item = showdown.subParser('spanGamut')(item, options, globals);\n }\n }\n\n // now we need to remove the marker (¨A)\n item = item.replace('¨A', '');\n // we can finally wrap the line in list item tags\n item = '' + item + '\\n';\n\n return item;\n });\n\n // attacklab: strip sentinel\n listStr = listStr.replace(/¨0/g, '');\n\n globals.gListLevel--;\n\n if (trimTrailing) {\n listStr = listStr.replace(/\\s+$/, '');\n }\n\n return listStr;\n }\n\n function styleStartNumber(list, listType) {\n // check if ol and starts by a number different than 1\n if (listType === 'ol') {\n var res = list.match(/^ *(\\d+)\\./);\n if (res && res[1] !== '1') {\n return ' start=\"' + res[1] + '\"';\n }\n }\n return '';\n }\n\n /**\n * Check and parse consecutive lists (better fix for issue #142)\n * @param {string} list\n * @param {string} listType\n * @param {boolean} trimTrailing\n * @returns {string}\n */\n function parseConsecutiveLists(list, listType, trimTrailing) {\n // check if we caught 2 or more consecutive lists by mistake\n // we use the counterRgx, meaning if listType is UL we look for OL and vice versa\n var olRgx = options.disableForced4SpacesIndentedSublists ? /^ ?\\d+\\.[ \\t]/gm : /^ {0,3}\\d+\\.[ \\t]/gm,\n ulRgx = options.disableForced4SpacesIndentedSublists ? /^ ?[*+-][ \\t]/gm : /^ {0,3}[*+-][ \\t]/gm,\n counterRxg = listType === 'ul' ? olRgx : ulRgx,\n result = '';\n\n if (list.search(counterRxg) !== -1) {\n (function parseCL(txt) {\n var pos = txt.search(counterRxg),\n style = styleStartNumber(list, listType);\n if (pos !== -1) {\n // slice\n result += '\\n\\n<' + listType + style + '>\\n' + processListItems(txt.slice(0, pos), !!trimTrailing) + '\\n';\n\n // invert counterType and listType\n listType = listType === 'ul' ? 'ol' : 'ul';\n counterRxg = listType === 'ul' ? olRgx : ulRgx;\n\n //recurse\n parseCL(txt.slice(pos));\n } else {\n result += '\\n\\n<' + listType + style + '>\\n' + processListItems(txt, !!trimTrailing) + '\\n';\n }\n })(list);\n } else {\n var style = styleStartNumber(list, listType);\n result = '\\n\\n<' + listType + style + '>\\n' + processListItems(list, !!trimTrailing) + '\\n';\n }\n\n return result;\n }\n\n /** Start of list parsing **/\n text = globals.converter._dispatch('lists.before', text, options, globals);\n // add sentinel to hack around khtml/safari bug:\n // http://bugs.webkit.org/show_bug.cgi?id=11231\n text += '¨0';\n\n if (globals.gListLevel) {\n text = text.replace(/^(( {0,3}([*+-]|\\d+[.])[ \\t]+)[^\\r]+?(¨0|\\n{2,}(?=\\S)(?![ \\t]*(?:[*+-]|\\d+[.])[ \\t]+)))/gm, function (wholeMatch, list, m2) {\n var listType = m2.search(/[*+-]/g) > -1 ? 'ul' : 'ol';\n return parseConsecutiveLists(list, listType, true);\n });\n } else {\n text = text.replace(/(\\n\\n|^\\n?)(( {0,3}([*+-]|\\d+[.])[ \\t]+)[^\\r]+?(¨0|\\n{2,}(?=\\S)(?![ \\t]*(?:[*+-]|\\d+[.])[ \\t]+)))/gm, function (wholeMatch, m1, list, m3) {\n var listType = m3.search(/[*+-]/g) > -1 ? 'ul' : 'ol';\n return parseConsecutiveLists(list, listType, false);\n });\n }\n\n // strip sentinel\n text = text.replace(/¨0/, '');\n text = globals.converter._dispatch('lists.after', text, options, globals);\n return text;\n });\n\n /**\n * Parse metadata at the top of the document\n */\n showdown.subParser('metadata', function (text, options, globals) {\n 'use strict';\n\n if (!options.metadata) {\n return text;\n }\n\n text = globals.converter._dispatch('metadata.before', text, options, globals);\n\n function parseMetadataContents(content) {\n // raw is raw so it's not changed in any way\n globals.metadata.raw = content;\n\n // escape chars forbidden in html attributes\n // double quotes\n content = content\n // ampersand first\n .replace(/&/g, '&')\n // double quotes\n .replace(/\"/g, '"');\n\n content = content.replace(/\\n {4}/g, ' ');\n content.replace(/^([\\S ]+): +([\\s\\S]+?)$/gm, function (wm, key, value) {\n globals.metadata.parsed[key] = value;\n return '';\n });\n }\n\n text = text.replace(/^\\s*«««+(\\S*?)\\n([\\s\\S]+?)\\n»»»+\\n/, function (wholematch, format, content) {\n parseMetadataContents(content);\n return '¨M';\n });\n\n text = text.replace(/^\\s*---+(\\S*?)\\n([\\s\\S]+?)\\n---+\\n/, function (wholematch, format, content) {\n if (format) {\n globals.metadata.format = format;\n }\n parseMetadataContents(content);\n return '¨M';\n });\n\n text = text.replace(/¨M/g, '');\n\n text = globals.converter._dispatch('metadata.after', text, options, globals);\n return text;\n });\n\n /**\n * Remove one level of line-leading tabs or spaces\n */\n showdown.subParser('outdent', function (text, options, globals) {\n 'use strict';\n\n text = globals.converter._dispatch('outdent.before', text, options, globals);\n\n // attacklab: hack around Konqueror 3.5.4 bug:\n // \"----------bug\".replace(/^-/g,\"\") == \"bug\"\n text = text.replace(/^(\\t|[ ]{1,4})/gm, '¨0'); // attacklab: g_tab_width\n\n // attacklab: clean up hack\n text = text.replace(/¨0/g, '');\n\n text = globals.converter._dispatch('outdent.after', text, options, globals);\n return text;\n });\n\n /**\n *\n */\n showdown.subParser('paragraphs', function (text, options, globals) {\n 'use strict';\n\n text = globals.converter._dispatch('paragraphs.before', text, options, globals);\n // Strip leading and trailing lines:\n text = text.replace(/^\\n+/g, '');\n text = text.replace(/\\n+$/g, '');\n\n var grafs = text.split(/\\n{2,}/g),\n grafsOut = [],\n end = grafs.length; // Wrap tags\n\n for (var i = 0; i < end; i++) {\n var str = grafs[i];\n // if this is an HTML marker, copy it\n if (str.search(/¨(K|G)(\\d+)\\1/g) >= 0) {\n grafsOut.push(str);\n\n // test for presence of characters to prevent empty lines being parsed\n // as paragraphs (resulting in undesired extra empty paragraphs)\n } else if (str.search(/\\S/) >= 0) {\n str = showdown.subParser('spanGamut')(str, options, globals);\n str = str.replace(/^([ \\t]*)/g, '
');\n str += '
';\n grafsOut.push(str);\n }\n }\n\n /** Unhashify HTML blocks */\n end = grafsOut.length;\n for (i = 0; i < end; i++) {\n var blockText = '',\n grafsOutIt = grafsOut[i],\n codeFlag = false;\n // if this is a marker for an html block...\n // use RegExp.test instead of string.search because of QML bug\n while (/¨(K|G)(\\d+)\\1/.test(grafsOutIt)) {\n var delim = RegExp.$1,\n num = RegExp.$2;\n\n if (delim === 'K') {\n blockText = globals.gHtmlBlocks[num];\n } else {\n // we need to check if ghBlock is a false positive\n if (codeFlag) {\n // use encoded version of all text\n blockText = showdown.subParser('encodeCode')(globals.ghCodeBlocks[num].text, options, globals);\n } else {\n blockText = globals.ghCodeBlocks[num].codeblock;\n }\n }\n blockText = blockText.replace(/\\$/g, '$$$$'); // Escape any dollar signs\n\n grafsOutIt = grafsOutIt.replace(/(\\n\\n)?¨(K|G)\\d+\\2(\\n\\n)?/, blockText);\n // Check if grafsOutIt is a pre->code\n if (/^]*>\\s*]*>/.test(grafsOutIt)) {\n codeFlag = true;\n }\n }\n grafsOut[i] = grafsOutIt;\n }\n text = grafsOut.join('\\n');\n // Strip leading and trailing lines:\n text = text.replace(/^\\n+/g, '');\n text = text.replace(/\\n+$/g, '');\n return globals.converter._dispatch('paragraphs.after', text, options, globals);\n });\n\n /**\n * Run extension\n */\n showdown.subParser('runExtension', function (ext, text, options, globals) {\n 'use strict';\n\n if (ext.filter) {\n text = ext.filter(text, globals.converter, options);\n } else if (ext.regex) {\n // TODO remove this when old extension loading mechanism is deprecated\n var re = ext.regex;\n if (!(re instanceof RegExp)) {\n re = new RegExp(re, 'g');\n }\n text = text.replace(re, ext.replace);\n }\n\n return text;\n });\n\n /**\n * These are all the transformations that occur *within* block-level\n * tags like paragraphs, headers, and list items.\n */\n showdown.subParser('spanGamut', function (text, options, globals) {\n 'use strict';\n\n text = globals.converter._dispatch('spanGamut.before', text, options, globals);\n text = showdown.subParser('codeSpans')(text, options, globals);\n text = showdown.subParser('escapeSpecialCharsWithinTagAttributes')(text, options, globals);\n text = showdown.subParser('encodeBackslashEscapes')(text, options, globals);\n\n // Process anchor and image tags. Images must come first,\n // because ![foo][f] looks like an anchor.\n text = showdown.subParser('images')(text, options, globals);\n text = showdown.subParser('anchors')(text, options, globals);\n\n // Make links out of things like `).\n text = showdown.subParser('autoLinks')(text, options, globals);\n text = showdown.subParser('simplifiedAutoLinks')(text, options, globals);\n text = showdown.subParser('emoji')(text, options, globals);\n text = showdown.subParser('underline')(text, options, globals);\n text = showdown.subParser('italicsAndBold')(text, options, globals);\n text = showdown.subParser('strikethrough')(text, options, globals);\n text = showdown.subParser('ellipsis')(text, options, globals);\n\n // we need to hash HTML tags inside spans\n text = showdown.subParser('hashHTMLSpans')(text, options, globals);\n\n // now we encode amps and angles\n text = showdown.subParser('encodeAmpsAndAngles')(text, options, globals);\n\n // Do hard breaks\n if (options.simpleLineBreaks) {\n // GFM style hard breaks\n // only add line breaks if the text does not contain a block (special case for lists)\n if (!/\\n\\n¨K/.test(text)) {\n text = text.replace(/\\n+/g, '
\\n');\n }\n } else {\n // Vanilla hard breaks\n text = text.replace(/ +\\n/g, '
\\n');\n }\n\n text = globals.converter._dispatch('spanGamut.after', text, options, globals);\n return text;\n });\n\n showdown.subParser('strikethrough', function (text, options, globals) {\n 'use strict';\n\n function parseInside(txt) {\n if (options.simplifiedAutoLink) {\n txt = showdown.subParser('simplifiedAutoLinks')(txt, options, globals);\n }\n return '' + txt + '';\n }\n\n if (options.strikethrough) {\n text = globals.converter._dispatch('strikethrough.before', text, options, globals);\n text = text.replace(/(?:~){2}([\\s\\S]+?)(?:~){2}/g, function (wm, txt) {\n return parseInside(txt);\n });\n text = globals.converter._dispatch('strikethrough.after', text, options, globals);\n }\n\n return text;\n });\n\n /**\n * Strips link definitions from text, stores the URLs and titles in\n * hash references.\n * Link defs are in the form: ^[id]: url \"optional title\"\n */\n showdown.subParser('stripLinkDefinitions', function (text, options, globals) {\n 'use strict';\n\n var regex = /^ {0,3}\\[(.+)]:[ \\t]*\\n?[ \\t]*\\s]+)>?(?: =([*\\d]+[A-Za-z%]{0,4})x([*\\d]+[A-Za-z%]{0,4}))?[ \\t]*\\n?[ \\t]*(?:(\\n*)[\"|'(](.+?)[\"|')][ \\t]*)?(?:\\n+|(?=¨0))/gm,\n base64Regex = /^ {0,3}\\[(.+)]:[ \\t]*\\n?[ \\t]*?(?: =([*\\d]+[A-Za-z%]{0,4})x([*\\d]+[A-Za-z%]{0,4}))?[ \\t]*\\n?[ \\t]*(?:(\\n*)[\"|'(](.+?)[\"|')][ \\t]*)?(?:\\n\\n|(?=¨0)|(?=\\n\\[))/gm;\n\n // attacklab: sentinel workarounds for lack of \\A and \\Z, safari\\khtml bug\n text += '¨0';\n\n var replaceFunc = function replaceFunc(wholeMatch, linkId, url, width, height, blankLines, title) {\n linkId = linkId.toLowerCase();\n if (url.match(/^data:.+?\\/.+?;base64,/)) {\n // remove newlines\n globals.gUrls[linkId] = url.replace(/\\s/g, '');\n } else {\n globals.gUrls[linkId] = showdown.subParser('encodeAmpsAndAngles')(url, options, globals); // Link IDs are case-insensitive\n }\n\n if (blankLines) {\n // Oops, found blank lines, so it's not a title.\n // Put back the parenthetical statement we stole.\n return blankLines + title;\n } else {\n if (title) {\n globals.gTitles[linkId] = title.replace(/\"|'/g, '"');\n }\n if (options.parseImgDimensions && width && height) {\n globals.gDimensions[linkId] = {\n width: width,\n height: height\n };\n }\n }\n // Completely remove the definition from the text\n return '';\n };\n\n // first we try to find base64 link references\n text = text.replace(base64Regex, replaceFunc);\n\n text = text.replace(regex, replaceFunc);\n\n // attacklab: strip sentinel\n text = text.replace(/¨0/, '');\n\n return text;\n });\n\n showdown.subParser('tables', function (text, options, globals) {\n 'use strict';\n\n if (!options.tables) {\n return text;\n }\n\n var tableRgx = /^ {0,3}\\|?.+\\|.+\\n {0,3}\\|?[ \\t]*:?[ \\t]*(?:[-=]){2,}[ \\t]*:?[ \\t]*\\|[ \\t]*:?[ \\t]*(?:[-=]){2,}[\\s\\S]+?(?:\\n\\n|¨0)/gm,\n\n //singeColTblRgx = /^ {0,3}\\|.+\\|\\n {0,3}\\|[ \\t]*:?[ \\t]*(?:[-=]){2,}[ \\t]*:?[ \\t]*\\|[ \\t]*\\n(?: {0,3}\\|.+\\|\\n)+(?:\\n\\n|¨0)/gm;\n singeColTblRgx = /^ {0,3}\\|.+\\|[ \\t]*\\n {0,3}\\|[ \\t]*:?[ \\t]*(?:[-=]){2,}[ \\t]*:?[ \\t]*\\|[ \\t]*\\n( {0,3}\\|.+\\|[ \\t]*\\n)*(?:\\n|¨0)/gm;\n\n function parseStyles(sLine) {\n if (/^:[ \\t]*--*$/.test(sLine)) {\n return ' style=\"text-align:left;\"';\n } else if (/^--*[ \\t]*:[ \\t]*$/.test(sLine)) {\n return ' style=\"text-align:right;\"';\n } else if (/^:[ \\t]*--*[ \\t]*:$/.test(sLine)) {\n return ' style=\"text-align:center;\"';\n } else {\n return '';\n }\n }\n\n function parseHeaders(header, style) {\n var id = '';\n header = header.trim();\n // support both tablesHeaderId and tableHeaderId due to error in documentation so we don't break backwards compatibility\n if (options.tablesHeaderId || options.tableHeaderId) {\n id = ' id=\"' + header.replace(/ /g, '_').toLowerCase() + '\"';\n }\n header = showdown.subParser('spanGamut')(header, options, globals);\n\n return '' + header + '\\n';\n }\n\n function parseCells(cell, style) {\n var subText = showdown.subParser('spanGamut')(cell, options, globals);\n return '' + subText + '\\n';\n }\n\n function buildTable(headers, cells) {\n var tb = '\\n\\n\\n',\n tblLgn = headers.length;\n\n for (var i = 0; i < tblLgn; ++i) {\n tb += headers[i];\n }\n tb += ' \\n\\n\\n';\n\n for (i = 0; i < cells.length; ++i) {\n tb += '\\n';\n for (var ii = 0; ii < tblLgn; ++ii) {\n tb += cells[i][ii];\n }\n tb += ' \\n';\n }\n tb += '\\n
\\n';\n return tb;\n }\n\n function parseTable(rawTable) {\n var i,\n tableLines = rawTable.split('\\n');\n\n for (i = 0; i < tableLines.length; ++i) {\n // strip wrong first and last column if wrapped tables are used\n if (/^ {0,3}\\|/.test(tableLines[i])) {\n tableLines[i] = tableLines[i].replace(/^ {0,3}\\|/, '');\n }\n if (/\\|[ \\t]*$/.test(tableLines[i])) {\n tableLines[i] = tableLines[i].replace(/\\|[ \\t]*$/, '');\n }\n // parse code spans first, but we only support one line code spans\n tableLines[i] = showdown.subParser('codeSpans')(tableLines[i], options, globals);\n }\n\n var rawHeaders = tableLines[0].split('|').map(function (s) {\n return s.trim();\n }),\n rawStyles = tableLines[1].split('|').map(function (s) {\n return s.trim();\n }),\n rawCells = [],\n headers = [],\n styles = [],\n cells = [];\n\n tableLines.shift();\n tableLines.shift();\n\n for (i = 0; i < tableLines.length; ++i) {\n if (tableLines[i].trim() === '') {\n continue;\n }\n rawCells.push(tableLines[i].split('|').map(function (s) {\n return s.trim();\n }));\n }\n\n if (rawHeaders.length < rawStyles.length) {\n return rawTable;\n }\n\n for (i = 0; i < rawStyles.length; ++i) {\n styles.push(parseStyles(rawStyles[i]));\n }\n\n for (i = 0; i < rawHeaders.length; ++i) {\n if (showdown.helper.isUndefined(styles[i])) {\n styles[i] = '';\n }\n headers.push(parseHeaders(rawHeaders[i], styles[i]));\n }\n\n for (i = 0; i < rawCells.length; ++i) {\n var row = [];\n for (var ii = 0; ii < headers.length; ++ii) {\n if (showdown.helper.isUndefined(rawCells[i][ii])) {}\n row.push(parseCells(rawCells[i][ii], styles[ii]));\n }\n cells.push(row);\n }\n\n return buildTable(headers, cells);\n }\n\n text = globals.converter._dispatch('tables.before', text, options, globals);\n\n // find escaped pipe characters\n text = text.replace(/\\\\(\\|)/g, showdown.helper.escapeCharactersCallback);\n\n // parse multi column tables\n text = text.replace(tableRgx, parseTable);\n\n // parse one column tables\n text = text.replace(singeColTblRgx, parseTable);\n\n text = globals.converter._dispatch('tables.after', text, options, globals);\n\n return text;\n });\n\n showdown.subParser('underline', function (text, options, globals) {\n 'use strict';\n\n if (!options.underline) {\n return text;\n }\n\n text = globals.converter._dispatch('underline.before', text, options, globals);\n\n if (options.literalMidWordUnderscores) {\n text = text.replace(/\\b___(\\S[\\s\\S]*?)___\\b/g, function (wm, txt) {\n return '' + txt + '';\n });\n text = text.replace(/\\b__(\\S[\\s\\S]*?)__\\b/g, function (wm, txt) {\n return '' + txt + '';\n });\n } else {\n text = text.replace(/___(\\S[\\s\\S]*?)___/g, function (wm, m) {\n return (/\\S$/.test(m) ? '' + m + '' : wm\n );\n });\n text = text.replace(/__(\\S[\\s\\S]*?)__/g, function (wm, m) {\n return (/\\S$/.test(m) ? '' + m + '' : wm\n );\n });\n }\n\n // escape remaining underscores to prevent them being parsed by italic and bold\n text = text.replace(/(_)/g, showdown.helper.escapeCharactersCallback);\n\n text = globals.converter._dispatch('underline.after', text, options, globals);\n\n return text;\n });\n\n /**\n * Swap back in all the special characters we've hidden.\n */\n showdown.subParser('unescapeSpecialChars', function (text, options, globals) {\n 'use strict';\n\n text = globals.converter._dispatch('unescapeSpecialChars.before', text, options, globals);\n\n text = text.replace(/¨E(\\d+)E/g, function (wholeMatch, m1) {\n var charCodeToReplace = parseInt(m1);\n return String.fromCharCode(charCodeToReplace);\n });\n\n text = globals.converter._dispatch('unescapeSpecialChars.after', text, options, globals);\n return text;\n });\n\n showdown.subParser('makeMarkdown.blockquote', function (node, globals) {\n 'use strict';\n\n var txt = '';\n if (node.hasChildNodes()) {\n var children = node.childNodes,\n childrenLength = children.length;\n\n for (var i = 0; i < childrenLength; ++i) {\n var innerTxt = showdown.subParser('makeMarkdown.node')(children[i], globals);\n\n if (innerTxt === '') {\n continue;\n }\n txt += innerTxt;\n }\n }\n // cleanup\n txt = txt.trim();\n txt = '> ' + txt.split('\\n').join('\\n> ');\n return txt;\n });\n\n showdown.subParser('makeMarkdown.codeBlock', function (node, globals) {\n 'use strict';\n\n var lang = node.getAttribute('language'),\n num = node.getAttribute('precodenum');\n return '```' + lang + '\\n' + globals.preList[num] + '\\n```';\n });\n\n showdown.subParser('makeMarkdown.codeSpan', function (node) {\n 'use strict';\n\n return '`' + node.innerHTML + '`';\n });\n\n showdown.subParser('makeMarkdown.emphasis', function (node, globals) {\n 'use strict';\n\n var txt = '';\n if (node.hasChildNodes()) {\n txt += '*';\n var children = node.childNodes,\n childrenLength = children.length;\n for (var i = 0; i < childrenLength; ++i) {\n txt += showdown.subParser('makeMarkdown.node')(children[i], globals);\n }\n txt += '*';\n }\n return txt;\n });\n\n showdown.subParser('makeMarkdown.header', function (node, globals, headerLevel) {\n 'use strict';\n\n var headerMark = new Array(headerLevel + 1).join('#'),\n txt = '';\n\n if (node.hasChildNodes()) {\n txt = headerMark + ' ';\n var children = node.childNodes,\n childrenLength = children.length;\n\n for (var i = 0; i < childrenLength; ++i) {\n txt += showdown.subParser('makeMarkdown.node')(children[i], globals);\n }\n }\n return txt;\n });\n\n showdown.subParser('makeMarkdown.hr', function () {\n 'use strict';\n\n return '---';\n });\n\n showdown.subParser('makeMarkdown.image', function (node) {\n 'use strict';\n\n var txt = '';\n if (node.hasAttribute('src')) {\n txt += ' + '>';\n if (node.hasAttribute('width') && node.hasAttribute('height')) {\n txt += ' =' + node.getAttribute('width') + 'x' + node.getAttribute('height');\n }\n\n if (node.hasAttribute('title')) {\n txt += ' \"' + node.getAttribute('title') + '\"';\n }\n txt += ')';\n }\n return txt;\n });\n\n showdown.subParser('makeMarkdown.links', function (node, globals) {\n 'use strict';\n\n var txt = '';\n if (node.hasChildNodes() && node.hasAttribute('href')) {\n var children = node.childNodes,\n childrenLength = children.length;\n txt = '[';\n for (var i = 0; i < childrenLength; ++i) {\n txt += showdown.subParser('makeMarkdown.node')(children[i], globals);\n }\n txt += '](';\n txt += '<' + node.getAttribute('href') + '>';\n if (node.hasAttribute('title')) {\n txt += ' \"' + node.getAttribute('title') + '\"';\n }\n txt += ')';\n }\n return txt;\n });\n\n showdown.subParser('makeMarkdown.list', function (node, globals, type) {\n 'use strict';\n\n var txt = '';\n if (!node.hasChildNodes()) {\n return '';\n }\n var listItems = node.childNodes,\n listItemsLenght = listItems.length,\n listNum = node.getAttribute('start') || 1;\n\n for (var i = 0; i < listItemsLenght; ++i) {\n if (typeof listItems[i].tagName === 'undefined' || listItems[i].tagName.toLowerCase() !== 'li') {\n continue;\n }\n\n // define the bullet to use in list\n var bullet = '';\n if (type === 'ol') {\n bullet = listNum.toString() + '. ';\n } else {\n bullet = '- ';\n }\n\n // parse list item\n txt += bullet + showdown.subParser('makeMarkdown.listItem')(listItems[i], globals);\n ++listNum;\n }\n\n // add comment at the end to prevent consecutive lists to be parsed as one\n txt += '\\n\\n';\n return txt.trim();\n });\n\n showdown.subParser('makeMarkdown.listItem', function (node, globals) {\n 'use strict';\n\n var listItemTxt = '';\n\n var children = node.childNodes,\n childrenLenght = children.length;\n\n for (var i = 0; i < childrenLenght; ++i) {\n listItemTxt += showdown.subParser('makeMarkdown.node')(children[i], globals);\n }\n // if it's only one liner, we need to add a newline at the end\n if (!/\\n$/.test(listItemTxt)) {\n listItemTxt += '\\n';\n } else {\n // it's multiparagraph, so we need to indent\n listItemTxt = listItemTxt.split('\\n').join('\\n ').replace(/^ {4}$/gm, '').replace(/\\n\\n+/g, '\\n\\n');\n }\n\n return listItemTxt;\n });\n\n showdown.subParser('makeMarkdown.node', function (node, globals, spansOnly) {\n 'use strict';\n\n spansOnly = spansOnly || false;\n\n var txt = '';\n\n // edge case of text without wrapper paragraph\n if (node.nodeType === 3) {\n return showdown.subParser('makeMarkdown.txt')(node, globals);\n }\n\n // HTML comment\n if (node.nodeType === 8) {\n return '\\n\\n';\n }\n\n // process only node elements\n if (node.nodeType !== 1) {\n return '';\n }\n\n var tagName = node.tagName.toLowerCase();\n\n switch (tagName) {\n\n //\n // BLOCKS\n //\n case 'h1':\n if (!spansOnly) {\n txt = showdown.subParser('makeMarkdown.header')(node, globals, 1) + '\\n\\n';\n }\n break;\n case 'h2':\n if (!spansOnly) {\n txt = showdown.subParser('makeMarkdown.header')(node, globals, 2) + '\\n\\n';\n }\n break;\n case 'h3':\n if (!spansOnly) {\n txt = showdown.subParser('makeMarkdown.header')(node, globals, 3) + '\\n\\n';\n }\n break;\n case 'h4':\n if (!spansOnly) {\n txt = showdown.subParser('makeMarkdown.header')(node, globals, 4) + '\\n\\n';\n }\n break;\n case 'h5':\n if (!spansOnly) {\n txt = showdown.subParser('makeMarkdown.header')(node, globals, 5) + '\\n\\n';\n }\n break;\n case 'h6':\n if (!spansOnly) {\n txt = showdown.subParser('makeMarkdown.header')(node, globals, 6) + '\\n\\n';\n }\n break;\n\n case 'p':\n if (!spansOnly) {\n txt = showdown.subParser('makeMarkdown.paragraph')(node, globals) + '\\n\\n';\n }\n break;\n\n case 'blockquote':\n if (!spansOnly) {\n txt = showdown.subParser('makeMarkdown.blockquote')(node, globals) + '\\n\\n';\n }\n break;\n\n case 'hr':\n if (!spansOnly) {\n txt = showdown.subParser('makeMarkdown.hr')(node, globals) + '\\n\\n';\n }\n break;\n\n case 'ol':\n if (!spansOnly) {\n txt = showdown.subParser('makeMarkdown.list')(node, globals, 'ol') + '\\n\\n';\n }\n break;\n\n case 'ul':\n if (!spansOnly) {\n txt = showdown.subParser('makeMarkdown.list')(node, globals, 'ul') + '\\n\\n';\n }\n break;\n\n case 'precode':\n if (!spansOnly) {\n txt = showdown.subParser('makeMarkdown.codeBlock')(node, globals) + '\\n\\n';\n }\n break;\n\n case 'pre':\n if (!spansOnly) {\n txt = showdown.subParser('makeMarkdown.pre')(node, globals) + '\\n\\n';\n }\n break;\n\n case 'table':\n if (!spansOnly) {\n txt = showdown.subParser('makeMarkdown.table')(node, globals) + '\\n\\n';\n }\n break;\n\n //\n // SPANS\n //\n case 'code':\n txt = showdown.subParser('makeMarkdown.codeSpan')(node, globals);\n break;\n\n case 'em':\n case 'i':\n txt = showdown.subParser('makeMarkdown.emphasis')(node, globals);\n break;\n\n case 'strong':\n case 'b':\n txt = showdown.subParser('makeMarkdown.strong')(node, globals);\n break;\n\n case 'del':\n txt = showdown.subParser('makeMarkdown.strikethrough')(node, globals);\n break;\n\n case 'a':\n txt = showdown.subParser('makeMarkdown.links')(node, globals);\n break;\n\n case 'img':\n txt = showdown.subParser('makeMarkdown.image')(node, globals);\n break;\n\n default:\n txt = node.outerHTML + '\\n\\n';\n }\n\n // common normalization\n // TODO eventually\n\n return txt;\n });\n\n showdown.subParser('makeMarkdown.paragraph', function (node, globals) {\n 'use strict';\n\n var txt = '';\n if (node.hasChildNodes()) {\n var children = node.childNodes,\n childrenLength = children.length;\n for (var i = 0; i < childrenLength; ++i) {\n txt += showdown.subParser('makeMarkdown.node')(children[i], globals);\n }\n }\n\n // some text normalization\n txt = txt.trim();\n\n return txt;\n });\n\n showdown.subParser('makeMarkdown.pre', function (node, globals) {\n 'use strict';\n\n var num = node.getAttribute('prenum');\n return '' + globals.preList[num] + '
';\n });\n\n showdown.subParser('makeMarkdown.strikethrough', function (node, globals) {\n 'use strict';\n\n var txt = '';\n if (node.hasChildNodes()) {\n txt += '~~';\n var children = node.childNodes,\n childrenLength = children.length;\n for (var i = 0; i < childrenLength; ++i) {\n txt += showdown.subParser('makeMarkdown.node')(children[i], globals);\n }\n txt += '~~';\n }\n return txt;\n });\n\n showdown.subParser('makeMarkdown.strong', function (node, globals) {\n 'use strict';\n\n var txt = '';\n if (node.hasChildNodes()) {\n txt += '**';\n var children = node.childNodes,\n childrenLength = children.length;\n for (var i = 0; i < childrenLength; ++i) {\n txt += showdown.subParser('makeMarkdown.node')(children[i], globals);\n }\n txt += '**';\n }\n return txt;\n });\n\n showdown.subParser('makeMarkdown.table', function (node, globals) {\n 'use strict';\n\n var txt = '',\n tableArray = [[], []],\n headings = node.querySelectorAll('thead>tr>th'),\n rows = node.querySelectorAll('tbody>tr'),\n i,\n ii;\n for (i = 0; i < headings.length; ++i) {\n var headContent = showdown.subParser('makeMarkdown.tableCell')(headings[i], globals),\n allign = '---';\n\n if (headings[i].hasAttribute('style')) {\n var style = headings[i].getAttribute('style').toLowerCase().replace(/\\s/g, '');\n switch (style) {\n case 'text-align:left;':\n allign = ':---';\n break;\n case 'text-align:right;':\n allign = '---:';\n break;\n case 'text-align:center;':\n allign = ':---:';\n break;\n }\n }\n tableArray[0][i] = headContent.trim();\n tableArray[1][i] = allign;\n }\n\n for (i = 0; i < rows.length; ++i) {\n var r = tableArray.push([]) - 1,\n cols = rows[i].getElementsByTagName('td');\n\n for (ii = 0; ii < headings.length; ++ii) {\n var cellContent = ' ';\n if (typeof cols[ii] !== 'undefined') {\n cellContent = showdown.subParser('makeMarkdown.tableCell')(cols[ii], globals);\n }\n tableArray[r].push(cellContent);\n }\n }\n\n var cellSpacesCount = 3;\n for (i = 0; i < tableArray.length; ++i) {\n for (ii = 0; ii < tableArray[i].length; ++ii) {\n var strLen = tableArray[i][ii].length;\n if (strLen > cellSpacesCount) {\n cellSpacesCount = strLen;\n }\n }\n }\n\n for (i = 0; i < tableArray.length; ++i) {\n for (ii = 0; ii < tableArray[i].length; ++ii) {\n if (i === 1) {\n if (tableArray[i][ii].slice(-1) === ':') {\n tableArray[i][ii] = showdown.helper.padEnd(tableArray[i][ii].slice(-1), cellSpacesCount - 1, '-') + ':';\n } else {\n tableArray[i][ii] = showdown.helper.padEnd(tableArray[i][ii], cellSpacesCount, '-');\n }\n } else {\n tableArray[i][ii] = showdown.helper.padEnd(tableArray[i][ii], cellSpacesCount);\n }\n }\n txt += '| ' + tableArray[i].join(' | ') + ' |\\n';\n }\n\n return txt.trim();\n });\n\n showdown.subParser('makeMarkdown.tableCell', function (node, globals) {\n 'use strict';\n\n var txt = '';\n if (!node.hasChildNodes()) {\n return '';\n }\n var children = node.childNodes,\n childrenLength = children.length;\n\n for (var i = 0; i < childrenLength; ++i) {\n txt += showdown.subParser('makeMarkdown.node')(children[i], globals, true);\n }\n return txt.trim();\n });\n\n showdown.subParser('makeMarkdown.txt', function (node) {\n 'use strict';\n\n var txt = node.nodeValue;\n\n // multiple spaces are collapsed\n txt = txt.replace(/ +/g, ' ');\n\n // replace the custom ¨NBSP; with a space\n txt = txt.replace(/¨NBSP;/g, ' ');\n\n // \", <, > and & should replace escaped html entities\n txt = showdown.helper.unescapeHTMLEntities(txt);\n\n // escape markdown magic characters\n // emphasis, strong and strikethrough - can appear everywhere\n // we also escape pipe (|) because of tables\n // and escape ` because of code blocks and spans\n txt = txt.replace(/([*_~|`])/g, '\\\\$1');\n\n // escape > because of blockquotes\n txt = txt.replace(/^(\\s*)>/g, '\\\\$1>');\n\n // hash character, only troublesome at the beginning of a line because of headers\n txt = txt.replace(/^#/gm, '\\\\#');\n\n // horizontal rules\n txt = txt.replace(/^(\\s*)([-=]{3,})(\\s*)$/, '$1\\\\$2$3');\n\n // dot, because of ordered lists, only troublesome at the beginning of a line when preceded by an integer\n txt = txt.replace(/^( {0,3}\\d+)\\./gm, '$1\\\\.');\n\n // +, * and -, at the beginning of a line becomes a list, so we need to escape them also (asterisk was already escaped)\n txt = txt.replace(/^( {0,3})([+-])/gm, '$1\\\\$2');\n\n // images and links, ] followed by ( is problematic, so we escape it\n txt = txt.replace(/]([\\s]*)\\(/g, '\\\\]$1\\\\(');\n\n // reference URIs must also be escaped\n txt = txt.replace(/^ {0,3}\\[([\\S \\t]*?)]:/gm, '\\\\[$1]:');\n\n return txt;\n });\n\n var root = this;\n\n // AMD Loader\n if (true) {\n !(__WEBPACK_AMD_DEFINE_RESULT__ = (function () {\n 'use strict';\n\n return showdown;\n }).call(exports, __webpack_require__, exports, module),\n\t\t\t\t__WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__));\n\n // CommonJS/nodeJS Loader\n } else if (typeof module !== 'undefined' && module.exports) {\n module.exports = showdown;\n\n // Regular Browser loader\n } else {\n root.showdown = showdown;\n }\n}).call(this);\n\n//# sourceMappingURL=showdown.js.map\n\n/***/ }),\n\n/***/ \"J9SO\":\n/***/ (function(module, exports) {\n\n// removed by extract-text-webpack-plugin\nmodule.exports = {\"thesis\":\"thesis__3uAQ4\"};\n\n/***/ }),\n\n/***/ \"JkW7\":\n/***/ (function(module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\nObject.defineProperty(__webpack_exports__, \"__esModule\", { value: true });\n\n// EXTERNAL MODULE: ../node_modules/preact/dist/preact.min.js\nvar preact_min = __webpack_require__(\"KM04\");\nvar preact_min_default = /*#__PURE__*/__webpack_require__.n(preact_min);\n\n// EXTERNAL MODULE: ./index.css\nvar index = __webpack_require__(\"xHuH\");\nvar index_default = /*#__PURE__*/__webpack_require__.n(index);\n\n// EXTERNAL MODULE: ./manifest.json\nvar manifest = __webpack_require__(\"ZcXo\");\nvar manifest_default = /*#__PURE__*/__webpack_require__.n(manifest);\n\n// CONCATENATED MODULE: ../node_modules/preact-router/dist/preact-router.es.js\n\n\nvar EMPTY$1 = {};\n\nfunction preact_router_es_assign(obj, props) {\n\t// eslint-disable-next-line guard-for-in\n\tfor (var i in props) {\n\t\tobj[i] = props[i];\n\t}\n\treturn obj;\n}\n\nfunction exec(url, route, opts) {\n\tvar reg = /(?:\\?([^#]*))?(#.*)?$/,\n\t c = url.match(reg),\n\t matches = {},\n\t ret;\n\tif (c && c[1]) {\n\t\tvar p = c[1].split('&');\n\t\tfor (var i = 0; i < p.length; i++) {\n\t\t\tvar r = p[i].split('=');\n\t\t\tmatches[decodeURIComponent(r[0])] = decodeURIComponent(r.slice(1).join('='));\n\t\t}\n\t}\n\turl = segmentize(url.replace(reg, ''));\n\troute = segmentize(route || '');\n\tvar max = Math.max(url.length, route.length);\n\tfor (var i$1 = 0; i$1 < max; i$1++) {\n\t\tif (route[i$1] && route[i$1].charAt(0) === ':') {\n\t\t\tvar param = route[i$1].replace(/(^\\:|[+*?]+$)/g, ''),\n\t\t\t flags = (route[i$1].match(/[+*?]+$/) || EMPTY$1)[0] || '',\n\t\t\t plus = ~flags.indexOf('+'),\n\t\t\t star = ~flags.indexOf('*'),\n\t\t\t val = url[i$1] || '';\n\t\t\tif (!val && !star && (flags.indexOf('?') < 0 || plus)) {\n\t\t\t\tret = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tmatches[param] = decodeURIComponent(val);\n\t\t\tif (plus || star) {\n\t\t\t\tmatches[param] = url.slice(i$1).map(decodeURIComponent).join('/');\n\t\t\t\tbreak;\n\t\t\t}\n\t\t} else if (route[i$1] !== url[i$1]) {\n\t\t\tret = false;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif (opts.default !== true && ret === false) {\n\t\treturn false;\n\t}\n\treturn matches;\n}\n\nfunction pathRankSort(a, b) {\n\treturn a.rank < b.rank ? 1 : a.rank > b.rank ? -1 : a.index - b.index;\n}\n\n// filter out VNodes without attributes (which are unrankeable), and add `index`/`rank` properties to be used in sorting.\nfunction prepareVNodeForRanking(vnode, index) {\n\tvnode.index = index;\n\tvnode.rank = rankChild(vnode);\n\treturn vnode.attributes;\n}\n\nfunction segmentize(url) {\n\treturn url.replace(/(^\\/+|\\/+$)/g, '').split('/');\n}\n\nfunction rankSegment(segment) {\n\treturn segment.charAt(0) == ':' ? 1 + '*+?'.indexOf(segment.charAt(segment.length - 1)) || 4 : 5;\n}\n\nfunction rank(path) {\n\treturn segmentize(path).map(rankSegment).join('');\n}\n\nfunction rankChild(vnode) {\n\treturn vnode.attributes.default ? 0 : rank(vnode.attributes.path);\n}\n\nvar customHistory = null;\n\nvar ROUTERS = [];\n\nvar subscribers = [];\n\nvar EMPTY = {};\n\nfunction isPreactElement(node) {\n\treturn node.__preactattr_ != null || typeof Symbol !== 'undefined' && node[Symbol.for('preactattr')] != null;\n}\n\nfunction setUrl(url, type) {\n\tif (type === void 0) type = 'push';\n\n\tif (customHistory && customHistory[type]) {\n\t\tcustomHistory[type](url);\n\t} else if (typeof history !== 'undefined' && history[type + 'State']) {\n\t\thistory[type + 'State'](null, null, url);\n\t}\n}\n\nfunction getCurrentUrl() {\n\tvar url;\n\tif (customHistory && customHistory.location) {\n\t\turl = customHistory.location;\n\t} else if (customHistory && customHistory.getCurrentLocation) {\n\t\turl = customHistory.getCurrentLocation();\n\t} else {\n\t\turl = typeof location !== 'undefined' ? location : EMPTY;\n\t}\n\treturn \"\" + (url.pathname || '') + (url.search || '');\n}\n\nfunction route(url, replace) {\n\tif (replace === void 0) replace = false;\n\n\tif (typeof url !== 'string' && url.url) {\n\t\treplace = url.replace;\n\t\turl = url.url;\n\t}\n\n\t// only push URL into history if we can handle it\n\tif (canRoute(url)) {\n\t\tsetUrl(url, replace ? 'replace' : 'push');\n\t}\n\n\treturn routeTo(url);\n}\n\n/** Check if the given URL can be handled by any router instances. */\nfunction canRoute(url) {\n\tfor (var i = ROUTERS.length; i--;) {\n\t\tif (ROUTERS[i].canRoute(url)) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\n/** Tell all router instances to handle the given URL. */\nfunction routeTo(url) {\n\tvar didRoute = false;\n\tfor (var i = 0; i < ROUTERS.length; i++) {\n\t\tif (ROUTERS[i].routeTo(url) === true) {\n\t\t\tdidRoute = true;\n\t\t}\n\t}\n\tfor (var i$1 = subscribers.length; i$1--;) {\n\t\tsubscribers[i$1](url);\n\t}\n\treturn didRoute;\n}\n\nfunction routeFromLink(node) {\n\t// only valid elements\n\tif (!node || !node.getAttribute) {\n\t\treturn;\n\t}\n\n\tvar href = node.getAttribute('href'),\n\t target = node.getAttribute('target');\n\n\t// ignore links with targets and non-path URLs\n\tif (!href || !href.match(/^\\//g) || target && !target.match(/^_?self$/i)) {\n\t\treturn;\n\t}\n\n\t// attempt to route, if no match simply cede control to browser\n\treturn route(href);\n}\n\nfunction handleLinkClick(e) {\n\tif (e.button == 0) {\n\t\trouteFromLink(e.currentTarget || e.target || this);\n\t\treturn prevent(e);\n\t}\n}\n\nfunction prevent(e) {\n\tif (e) {\n\t\tif (e.stopImmediatePropagation) {\n\t\t\te.stopImmediatePropagation();\n\t\t}\n\t\tif (e.stopPropagation) {\n\t\t\te.stopPropagation();\n\t\t}\n\t\te.preventDefault();\n\t}\n\treturn false;\n}\n\nfunction delegateLinkHandler(e) {\n\t// ignore events the browser takes care of already:\n\tif (e.ctrlKey || e.metaKey || e.altKey || e.shiftKey || e.button !== 0) {\n\t\treturn;\n\t}\n\n\tvar t = e.target;\n\tdo {\n\t\tif (String(t.nodeName).toUpperCase() === 'A' && t.getAttribute('href') && isPreactElement(t)) {\n\t\t\tif (t.hasAttribute('native')) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t// if link is handled by the router, prevent browser defaults\n\t\t\tif (routeFromLink(t)) {\n\t\t\t\treturn prevent(e);\n\t\t\t}\n\t\t}\n\t} while (t = t.parentNode);\n}\n\nvar eventListenersInitialized = false;\n\nfunction initEventListeners() {\n\tif (eventListenersInitialized) {\n\t\treturn;\n\t}\n\n\tif (typeof addEventListener === 'function') {\n\t\tif (!customHistory) {\n\t\t\taddEventListener('popstate', function () {\n\t\t\t\trouteTo(getCurrentUrl());\n\t\t\t});\n\t\t}\n\t\taddEventListener('click', delegateLinkHandler);\n\t}\n\teventListenersInitialized = true;\n}\n\nvar preact_router_es_Router = function (Component$$1) {\n\tfunction Router(props) {\n\t\tComponent$$1.call(this, props);\n\t\tif (props.history) {\n\t\t\tcustomHistory = props.history;\n\t\t}\n\n\t\tthis.state = {\n\t\t\turl: props.url || getCurrentUrl()\n\t\t};\n\n\t\tinitEventListeners();\n\t}\n\n\tif (Component$$1) Router.__proto__ = Component$$1;\n\tRouter.prototype = Object.create(Component$$1 && Component$$1.prototype);\n\tRouter.prototype.constructor = Router;\n\n\tRouter.prototype.shouldComponentUpdate = function shouldComponentUpdate(props) {\n\t\tif (props.static !== true) {\n\t\t\treturn true;\n\t\t}\n\t\treturn props.url !== this.props.url || props.onChange !== this.props.onChange;\n\t};\n\n\t/** Check if the given URL can be matched against any children */\n\tRouter.prototype.canRoute = function canRoute(url) {\n\t\treturn this.getMatchingChildren(this.props.children, url, false).length > 0;\n\t};\n\n\t/** Re-render children with a new URL to match against. */\n\tRouter.prototype.routeTo = function routeTo(url) {\n\t\tthis._didRoute = false;\n\t\tthis.setState({ url: url });\n\n\t\t// if we're in the middle of an update, don't synchronously re-route.\n\t\tif (this.updating) {\n\t\t\treturn this.canRoute(url);\n\t\t}\n\n\t\tthis.forceUpdate();\n\t\treturn this._didRoute;\n\t};\n\n\tRouter.prototype.componentWillMount = function componentWillMount() {\n\t\tROUTERS.push(this);\n\t\tthis.updating = true;\n\t};\n\n\tRouter.prototype.componentDidMount = function componentDidMount() {\n\t\tvar this$1 = this;\n\n\t\tif (customHistory) {\n\t\t\tthis.unlisten = customHistory.listen(function (location) {\n\t\t\t\tthis$1.routeTo(\"\" + (location.pathname || '') + (location.search || ''));\n\t\t\t});\n\t\t}\n\t\tthis.updating = false;\n\t};\n\n\tRouter.prototype.componentWillUnmount = function componentWillUnmount() {\n\t\tif (typeof this.unlisten === 'function') {\n\t\t\tthis.unlisten();\n\t\t}\n\t\tROUTERS.splice(ROUTERS.indexOf(this), 1);\n\t};\n\n\tRouter.prototype.componentWillUpdate = function componentWillUpdate() {\n\t\tthis.updating = true;\n\t};\n\n\tRouter.prototype.componentDidUpdate = function componentDidUpdate() {\n\t\tthis.updating = false;\n\t};\n\n\tRouter.prototype.getMatchingChildren = function getMatchingChildren(children, url, invoke) {\n\t\treturn children.filter(prepareVNodeForRanking).sort(pathRankSort).map(function (vnode) {\n\t\t\tvar matches = exec(url, vnode.attributes.path, vnode.attributes);\n\t\t\tif (matches) {\n\t\t\t\tif (invoke !== false) {\n\t\t\t\t\tvar newProps = { url: url, matches: matches };\n\t\t\t\t\tpreact_router_es_assign(newProps, matches);\n\t\t\t\t\tdelete newProps.ref;\n\t\t\t\t\tdelete newProps.key;\n\t\t\t\t\treturn Object(preact_min[\"cloneElement\"])(vnode, newProps);\n\t\t\t\t}\n\t\t\t\treturn vnode;\n\t\t\t}\n\t\t}).filter(Boolean);\n\t};\n\n\tRouter.prototype.render = function render(ref, ref$1) {\n\t\tvar children = ref.children;\n\t\tvar onChange = ref.onChange;\n\t\tvar url = ref$1.url;\n\n\t\tvar active = this.getMatchingChildren(children, url, true);\n\n\t\tvar current = active[0] || null;\n\t\tthis._didRoute = !!current;\n\n\t\tvar previous = this.previousUrl;\n\t\tif (url !== previous) {\n\t\t\tthis.previousUrl = url;\n\t\t\tif (typeof onChange === 'function') {\n\t\t\t\tonChange({\n\t\t\t\t\trouter: this,\n\t\t\t\t\turl: url,\n\t\t\t\t\tprevious: previous,\n\t\t\t\t\tactive: active,\n\t\t\t\t\tcurrent: current\n\t\t\t\t});\n\t\t\t}\n\t\t}\n\n\t\treturn current;\n\t};\n\n\treturn Router;\n}(preact_min[\"Component\"]);\n\nvar preact_router_es_Link = function Link(props) {\n\treturn Object(preact_min[\"h\"])('a', preact_router_es_assign({ onClick: handleLinkClick }, props));\n};\n\nvar preact_router_es_Route = function Route(props) {\n\treturn Object(preact_min[\"h\"])(props.component, props);\n};\n\npreact_router_es_Router.subscribers = subscribers;\npreact_router_es_Router.getCurrentUrl = getCurrentUrl;\npreact_router_es_Router.route = route;\npreact_router_es_Router.Router = preact_router_es_Router;\npreact_router_es_Router.Route = preact_router_es_Route;\npreact_router_es_Router.Link = preact_router_es_Link;\n\n/* harmony default export */ var preact_router_es = (preact_router_es_Router);\n//# sourceMappingURL=preact-router.es.js.map\n// EXTERNAL MODULE: ./pages/home.css\nvar home = __webpack_require__(\"36Ou\");\nvar home_default = /*#__PURE__*/__webpack_require__.n(home);\n\n// EXTERNAL MODULE: ./components/panel.css\nvar panel = __webpack_require__(\"P9k+\");\nvar panel_default = /*#__PURE__*/__webpack_require__.n(panel);\n\n// CONCATENATED MODULE: ./components/panel.js\n\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n\n\n\n\nvar panel_Panel = function (_Component) {\n\t_inherits(Panel, _Component);\n\n\tfunction Panel() {\n\t\t_classCallCheck(this, Panel);\n\n\t\treturn _possibleConstructorReturn(this, _Component.apply(this, arguments));\n\t}\n\n\tPanel.prototype.getStyle = function getStyle() {\n\t\treturn panel_default.a.panel;\n\t};\n\n\tPanel.prototype.render = function render() {\n\t\tvar title = null;\n\t\tif (this.props.title !== undefined) {\n\t\t\ttitle = Object(preact_min[\"h\"])(\n\t\t\t\t\"h3\",\n\t\t\t\tnull,\n\t\t\t\tthis.props.title\n\t\t\t);\n\t\t}\n\n\t\treturn Object(preact_min[\"h\"])(\n\t\t\t\"div\",\n\t\t\t{ \"class\": this.getStyle(), id: this.props.id },\n\t\t\ttitle,\n\t\t\tthis.props.children\n\t\t);\n\t};\n\n\treturn Panel;\n}(preact_min[\"Component\"]);\n\n\n// EXTERNAL MODULE: ./components/split.css\nvar split = __webpack_require__(\"1EpE\");\nvar split_default = /*#__PURE__*/__webpack_require__.n(split);\n\n// CONCATENATED MODULE: ./components/split.js\n\n\nfunction split__classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction split__possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction split__inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n\n\n\n\nvar split_Split = function (_Component) {\n split__inherits(Split, _Component);\n\n function Split() {\n split__classCallCheck(this, Split);\n\n return split__possibleConstructorReturn(this, _Component.apply(this, arguments));\n }\n\n Split.prototype.render = function render() {\n var title = null;\n if (this.props.title !== undefined) {\n title = Object(preact_min[\"h\"])(\n \"h2\",\n null,\n this.props.title\n );\n }\n\n var children = void 0;\n if (Array.isArray(this.props.children)) {\n children = this.props.children.map(function (element) {\n return Object(preact_min[\"h\"])(\n \"div\",\n { \"class\": split_default.a.splitchild },\n element\n );\n });\n } else {\n children = Object(preact_min[\"h\"])(\n \"div\",\n { \"class\": split_default.a.splitchild },\n this.props.children\n );\n }\n return Object(preact_min[\"h\"])(\n \"div\",\n { \"class\": split_default.a.split },\n title,\n Object(preact_min[\"h\"])(\n \"div\",\n { \"class\": split_default.a.splitparent },\n children\n )\n );\n };\n\n return Split;\n}(preact_min[\"Component\"]);\n\n\n// EXTERNAL MODULE: ./components/todo.css\nvar todo = __webpack_require__(\"tO1d\");\nvar todo_default = /*#__PURE__*/__webpack_require__.n(todo);\n\n// CONCATENATED MODULE: ./components/todo.js\n\n\nfunction todo__classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction todo__possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction todo__inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n\n\n\n\nvar todo_Todo = function (_Component) {\n\ttodo__inherits(Todo, _Component);\n\n\tfunction Todo() {\n\t\ttodo__classCallCheck(this, Todo);\n\n\t\treturn todo__possibleConstructorReturn(this, _Component.apply(this, arguments));\n\t}\n\n\tTodo.prototype.render = function render() {\n\t\treturn Object(preact_min[\"h\"])(\n\t\t\t\"span\",\n\t\t\t{ \"class\": todo_default.a.todo },\n\t\t\tthis.props.children\n\t\t);\n\t};\n\n\treturn Todo;\n}(preact_min[\"Component\"]);\n\n\n// CONCATENATED MODULE: ./pages/home.js\n\n\nfunction home__classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction home__possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction home__inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n\n\n\n\n\n\n\nvar _ref = Object(preact_min[\"h\"])(\n 'h1',\n null,\n 'Indice'\n);\n\nvar _ref2 = Object(preact_min[\"h\"])(\n split_Split,\n { title: 'Argomenti' },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: Object(preact_min[\"h\"])(\n 'a',\n { href: '/statistica' },\n 'Statistica ed elementi di probabilit\\xE0'\n ) },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Appunti scritti mentre studiavo per l\\'esame di ',\n Object(preact_min[\"h\"])(\n 'a',\n { href: \"http://personale.unimore.it/rubrica/contenutiad/llarocca/2019/58028/N0/N0/9999\" },\n 'Statistica ed elementi di probabilit\\xE0'\n ),\n ' del ',\n Object(preact_min[\"h\"])(\n 'a',\n { href: 'https://www.unimore.it/didattica/mlaurea.html?ID=54' },\n 'corso triennale di Informatica'\n ),\n ' all\\'',\n Object(preact_min[\"h\"])(\n 'a',\n { href: 'https://www.unimore.it/' },\n 'Unimore'\n ),\n ' del Prof. ',\n Object(preact_min[\"h\"])(\n 'a',\n { href: \"http://personale.unimore.it/rubrica/dettaglio/llarocca\" },\n 'Luca La Rocca'\n ),\n '.'\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: Object(preact_min[\"h\"])(\n 'a',\n { href: 'https://github.com/Steffo99/cleaver' },\n 'Cleaver'\n ) },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Progetto in Java sviluppato per l\\'esame di ',\n Object(preact_min[\"h\"])(\n 'a',\n { href: 'http://personale.unimore.it/rubrica/contenutiad/gcabri/2019/58026/N0/N0/9999' },\n 'Programmazione ad Oggetti'\n ),\n ' del ',\n Object(preact_min[\"h\"])(\n 'a',\n { href: 'https://www.unimore.it/didattica/mlaurea.html?ID=54' },\n 'corso triennale di Informatica'\n ),\n ' all\\'',\n Object(preact_min[\"h\"])(\n 'a',\n { href: 'https://www.unimore.it/' },\n 'Unimore'\n ),\n ', tenuto dai Prof. ',\n Object(preact_min[\"h\"])(\n 'a',\n { href: 'http://personale.unimore.it/rubrica/dettaglio/gcabri' },\n 'Giacomo Cabri'\n ),\n ' e ',\n Object(preact_min[\"h\"])(\n 'a',\n { href: 'http://personale.unimore.it/Rubrica/Dettaglio/n.capodieci' },\n 'Nicola Capodieci'\n ),\n '.'\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: Object(preact_min[\"h\"])(\n 'a',\n { href: '/fisica' },\n 'Fisica'\n ) },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Appunti delle ',\n Object(preact_min[\"h\"])(\n 'a',\n { href: 'http://personale.unimore.it/rubrica/contenutiad/brunetti/2019/58025/N0/N0/9999' },\n 'lezioni di Fisica'\n ),\n ' del ',\n Object(preact_min[\"h\"])(\n 'a',\n { href: 'https://www.unimore.it/didattica/mlaurea.html?ID=54' },\n 'corso triennale di Informatica'\n ),\n ' all\\'',\n Object(preact_min[\"h\"])(\n 'a',\n { href: 'https://www.unimore.it/' },\n 'Unimore'\n ),\n ', tenute dalla ',\n Object(preact_min[\"h\"])(\n 'a',\n { href: 'https://personale.unimore.it/rubrica/dettaglio/brunetti' },\n 'Prof.ssa Rossella Brunetti'\n ),\n ' nel primo semestre dell\\'Anno Accademico 2019/2020.'\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: Object(preact_min[\"h\"])(\n 'a',\n { href: 'https://github.com/Steffo99/appunti-universitari/tree/master/2019_SistemiOperativi/Arzigogoli' },\n 'Sistemi Operativi'\n ) },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Soluzioni agli ',\n Object(preact_min[\"h\"])(\n 'a',\n { href: 'https://weblab.ing.unimore.it/people/andreolini/didattica/sistemi-operativi/index.html#arzigogoli' },\n 'Arzigogoli'\n ),\n ' proposti dal ',\n Object(preact_min[\"h\"])(\n 'a',\n { href: 'https://personale.unimore.it/rubrica/dettaglio/andreolini' },\n 'Prof. Mauro Andreolini'\n ),\n ' durante le ',\n Object(preact_min[\"h\"])(\n 'a',\n { href: 'https://personale.unimore.it/rubrica/contenutiad/andreolini/2019/58027/N0/N0/9999' },\n 'lezioni di Sistemi Operativi'\n ),\n ' del ',\n Object(preact_min[\"h\"])(\n 'a',\n { href: 'https://www.unimore.it/didattica/mlaurea.html?ID=54' },\n 'corso triennale di Informatica'\n ),\n ' all\\'',\n Object(preact_min[\"h\"])(\n 'a',\n { href: 'https://www.unimore.it/' },\n 'Unimore'\n ),\n ' tenutesi nel primo semestre dell\\'Anno Accademico 2019/2020.'\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: Object(preact_min[\"h\"])(\n 'a',\n { href: 'https://github.com/Steffo99/appunti-universitari/tree/master/2018_AlgoritmiEStruttureDati' },\n 'Algoritmi e Strutture Dati'\n ) },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Appunti delle ',\n Object(preact_min[\"h\"])(\n 'a',\n { href: 'https://personale.unimore.it/rubrica/contenutiad/mmontangero/2018/58133/N0/N0/9999' },\n 'lezioni di Algoritmi e Strutture Dati'\n ),\n ' del ',\n Object(preact_min[\"h\"])(\n 'a',\n { href: 'https://www.unimore.it/didattica/mlaurea.html?ID=54' },\n 'corso triennale di Informatica'\n ),\n ' all\\'',\n Object(preact_min[\"h\"])(\n 'a',\n { href: 'https://www.unimore.it/' },\n 'Unimore'\n ),\n ', tenute dalla ',\n Object(preact_min[\"h\"])(\n 'a',\n { href: 'https://personale.unimore.it/rubrica/dettaglio/mmontangero' },\n 'Prof.ssa Manuela Montangero'\n ),\n ' nel secondo semestre dell\\'Anno Accademico 2018/2019.'\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: Object(preact_min[\"h\"])(\n 'a',\n { href: '/vldigeometria' },\n 'Videolezioni di Geometria'\n ) },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Ottime videolezioni di Geometria con licenza ',\n Object(preact_min[\"h\"])(\n 'a',\n { href: 'https://creativecommons.org/licenses/by-nc-sa/4.0/' },\n 'CC BY-NC-SA 4.0'\n ),\n ' che ho trovato sul ',\n Object(preact_min[\"h\"])(\n 'a',\n { href: 'https://dolly.fim.unimore.it/2018/course/view.php?id=14#section-0' },\n 'portale Dolly 2018'\n ),\n ' dell\\'',\n Object(preact_min[\"h\"])(\n 'a',\n { href: 'https://www.unimore.it/' },\n 'Unimore'\n ),\n '.'\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: Object(preact_min[\"h\"])(\n 'a',\n { href: '/mingwinstall' },\n 'Come installare MinGW'\n ) },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Un breve tutorial con immagini su come installare e configurare ',\n Object(preact_min[\"h\"])(\n 'a',\n { href: 'https://it.wikipedia.org/wiki/MinGW' },\n 'MinGW'\n ),\n ' per compilare programmi C e C++ su Windows.'\n )\n )\n);\n\nvar _ref3 = Object(preact_min[\"h\"])(\n split_Split,\n { title: 'Altri collegamenti utili' },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: Object(preact_min[\"h\"])(\n 'a',\n { href: 'https://t.me/unimoreinfo' },\n '@unimoreinfo'\n ) },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Il gruppo ',\n Object(preact_min[\"h\"])(\n 'a',\n { href: 'https://telegram.org/' },\n 'Telegram'\n ),\n ' del corso di Informatica dell\\'Unimore!'\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: Object(preact_min[\"h\"])(\n 'a',\n { href: 'https://calendar.google.com/calendar?cid=MmYza2o2M3VuZWQ1cmZqaGpmOGY0MWFrNmdAZ3JvdXAuY2FsZW5kYXIuZ29vZ2xlLmNvbQ' },\n 'Calendario Lezioni'\n ) },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Calendario Google ',\n Object(preact_min[\"h\"])(\n 'small',\n null,\n 'quasi'\n ),\n ' sempre aggiornato delle lezioni e degli esami del secondo anno dell\\'',\n Object(preact_min[\"h\"])(\n 'a',\n { href: 'https://www.unimore.it/' },\n 'Unimore'\n ),\n ' durante l\\'Anno Accademico 2019/2020.'\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: Object(preact_min[\"h\"])(\n 'a',\n { href: 'http://erre2.fermitech.info/dashboard' },\n 'Erre2'\n ) },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Portale contenente appunti e riassunti mantenuto da ',\n Object(preact_min[\"h\"])(\n 'a',\n { href: 'https://github.com/LBindustries' },\n 'Lorenzo Balugani'\n ),\n '.'\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: Object(preact_min[\"h\"])(\n 'a',\n { href: 'https://github.com/vezzalinistefano/Appunti-Algoritmi' },\n 'vezzalinistefano/Appunti-Algoritmi'\n ) },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Appunti di Algoritmi e Strutture Dati mantenuti da ',\n Object(preact_min[\"h\"])(\n 'a',\n { href: 'https://github.com/vezzalinistefano/' },\n 'Vezzalini Stefano'\n ),\n '.'\n )\n )\n);\n\nvar home_Home = function (_Component) {\n home__inherits(Home, _Component);\n\n function Home() {\n home__classCallCheck(this, Home);\n\n return home__possibleConstructorReturn(this, _Component.apply(this, arguments));\n }\n\n Home.prototype.render = function render() {\n return Object(preact_min[\"h\"])(\n 'div',\n { style: home_default.a.home },\n _ref,\n _ref2,\n _ref3\n );\n };\n\n return Home;\n}(preact_min[\"Component\"]);\n\n\n// EXTERNAL MODULE: ./pages/fisica.css\nvar fisica = __webpack_require__(\"0lnO\");\nvar fisica_default = /*#__PURE__*/__webpack_require__.n(fisica);\n\n// EXTERNAL MODULE: ./components/latex.css\nvar latex = __webpack_require__(\"+uq9\");\nvar latex_default = /*#__PURE__*/__webpack_require__.n(latex);\n\n// CONCATENATED MODULE: ./components/latex.js\n\n\nfunction latex__classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction latex__possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction latex__inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n\n\n\n\nvar latex_Latex = function (_Component) {\n\tlatex__inherits(Latex, _Component);\n\n\tfunction Latex() {\n\t\tlatex__classCallCheck(this, Latex);\n\n\t\treturn latex__possibleConstructorReturn(this, _Component.apply(this, arguments));\n\t}\n\n\tLatex.prototype.render = function render() {\n\t\tvar equation = '{\\\\color{White} ' + this.props.children + ' }';\n\t\treturn Object(preact_min[\"h\"])('img', { src: 'https://latex.codecogs.com/svg.latex?' + equation,\n\t\t\talt: this.props.children,\n\t\t\ttitle: this.props.children,\n\t\t\t'class': latex_default.a.latex\n\t\t});\n\t};\n\n\treturn Latex;\n}(preact_min[\"Component\"]);\n\n\n// EXTERNAL MODULE: ./components/plus.css\nvar plus = __webpack_require__(\"ddTt\");\nvar plus_default = /*#__PURE__*/__webpack_require__.n(plus);\n\n// CONCATENATED MODULE: ./components/plus.js\n\n\nfunction plus__classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction plus__possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction plus__inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n\n\n\n\nvar plus_Plus = function (_Component) {\n\tplus__inherits(Plus, _Component);\n\n\tfunction Plus() {\n\t\tplus__classCallCheck(this, Plus);\n\n\t\treturn plus__possibleConstructorReturn(this, _Component.apply(this, arguments));\n\t}\n\n\tPlus.prototype.render = function render() {\n\t\treturn Object(preact_min[\"h\"])(\n\t\t\t\"span\",\n\t\t\t{ \"class\": plus_default.a.plus },\n\t\t\tthis.props.children\n\t\t);\n\t};\n\n\treturn Plus;\n}(preact_min[\"Component\"]);\n\n\n// EXTERNAL MODULE: ./components/minus.css\nvar minus = __webpack_require__(\"MeW5\");\nvar minus_default = /*#__PURE__*/__webpack_require__.n(minus);\n\n// CONCATENATED MODULE: ./components/minus.js\n\n\nfunction minus__classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction minus__possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction minus__inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n\n\n\n\nvar minus_Minus = function (_Component) {\n\tminus__inherits(Minus, _Component);\n\n\tfunction Minus() {\n\t\tminus__classCallCheck(this, Minus);\n\n\t\treturn minus__possibleConstructorReturn(this, _Component.apply(this, arguments));\n\t}\n\n\tMinus.prototype.render = function render() {\n\t\treturn Object(preact_min[\"h\"])(\n\t\t\t\"span\",\n\t\t\t{ \"class\": minus_default.a.minus },\n\t\t\tthis.props.children\n\t\t);\n\t};\n\n\treturn Minus;\n}(preact_min[\"Component\"]);\n\n\n// CONCATENATED MODULE: ./pages/fisica.js\nvar _templateObject = _taggedTemplateLiteralLoose(['\\x0Bec{v} = \\x0Bec{v}_x + \\x0Bec{v}_y'], ['\\\\vec{v} = \\\\vec{v}_x + \\\\vec{v}_y']),\n _templateObject2 = _taggedTemplateLiteralLoose(['left | \\x0Bec{v}_x \\right | = left | \\x0Bec{v} \\right | sin alpha'], ['\\\\left | \\\\vec{v}_x \\\\right | = \\\\left | \\\\vec{v} \\\\right | \\\\sin \\\\alpha']),\n _templateObject3 = _taggedTemplateLiteralLoose(['left | \\x0Bec{v}_y \\right | = left | \\x0Bec{v} \\right | cos alpha'], ['\\\\left | \\\\vec{v}_y \\\\right | = \\\\left | \\\\vec{v} \\\\right | \\\\cos \\\\alpha']),\n _templateObject4 = _taggedTemplateLiteralLoose(['\\x0Bec{v} + \\x0Bec{w} = (\\x0Bec{v}_x + \\x0Bec{w}_x) + (\\x0Bec{v}_y + \\x0Bec{w}_y)'], ['\\\\vec{v} + \\\\vec{w} = (\\\\vec{v}_x + \\\\vec{w}_x) + (\\\\vec{v}_y + \\\\vec{w}_y)']),\n _templateObject5 = _taggedTemplateLiteralLoose(['\\x0Bec{v} - \\x0Bec{w} = (\\x0Bec{v}_x - \\x0Bec{w}_x) + (\\x0Bec{v}_y - \\x0Bec{w}_y)'], ['\\\\vec{v} - \\\\vec{w} = (\\\\vec{v}_x - \\\\vec{w}_x) + (\\\\vec{v}_y - \\\\vec{w}_y)']),\n _templateObject6 = _taggedTemplateLiteralLoose(['\\x0Bec{v} cdot \\x0Bec{w} = left | \\x0Bec{v} \\right | left | \\x0Bec{w} \\right | cos alpha'], ['\\\\vec{v} \\\\cdot \\\\vec{w} = \\\\left | \\\\vec{v} \\\\right | \\\\left | \\\\vec{w} \\\\right | \\\\cos \\\\alpha']),\n _templateObject7 = _taggedTemplateLiteralLoose(['\\x0Bec{a}'], ['\\\\vec{a}']),\n _templateObject8 = _taggedTemplateLiteralLoose(['\\x0Bec{b}'], ['\\\\vec{b}']),\n _templateObject9 = _taggedTemplateLiteralLoose(['\\x0Bec{c} = \\x0Bec{a} \\times \\x0Bec{b}'], ['\\\\vec{c} = \\\\vec{a} \\\\times \\\\vec{b}']),\n _templateObject10 = _taggedTemplateLiteralLoose(['left | \\x0Bec{c} \\right | = left | \\x0Bec{a} \\right | cdot left | \\x0Bec{b} \\right | cdot sin(alpha)'], ['\\\\left | \\\\vec{c} \\\\right | = \\\\left | \\\\vec{a} \\\\right | \\\\cdot \\\\left | \\\\vec{b} \\\\right | \\\\cdot \\\\sin(\\\\alpha)']),\n _templateObject11 = _taggedTemplateLiteralLoose(['Sigma \\x0Bec{F} = 0 Longleftrightarrow Delta v = 0'], ['\\\\Sigma \\\\vec{F} = 0 \\\\Longleftrightarrow \\\\Delta v = 0']),\n _templateObject12 = _taggedTemplateLiteralLoose(['Sigma \\x0Bec{F} = m \\x0Bec{a}'], ['\\\\Sigma \\\\vec{F} = m \\\\vec{a}']),\n _templateObject13 = _taggedTemplateLiteralLoose(['\\x0Bec{F}_{21} = -\\x0Bec{F}_{12}'], ['\\\\vec{F}_{21} = -\\\\vec{F}_{12}']),\n _templateObject14 = _taggedTemplateLiteralLoose(['left | \\x0Bec{F} \\right | = G \\frac{m_1 m_2}{s^2}'], ['\\\\left | \\\\vec{F} \\\\right | = G \\\\frac{m_1 m_2}{s^2}']),\n _templateObject15 = _taggedTemplateLiteralLoose(['G = 6.67 cdot 10^{-11} \\frac{N m^2}{{kg}^2}'], ['G = 6.67 \\\\cdot 10^{-11} \\\\frac{N m^2}{{kg}^2}']),\n _templateObject16 = _taggedTemplateLiteralLoose(['left | \\x0Bec{F} \\right | = g m'], ['\\\\left | \\\\vec{F} \\\\right | = g m']),\n _templateObject17 = _taggedTemplateLiteralLoose(['g = 9.81 \\frac{m}{s^2}'], ['g = 9.81 \\\\frac{m}{s^2}']),\n _templateObject18 = _taggedTemplateLiteralLoose(['g_{luna} = 1.62 \\frac{m}{s^2}'], ['g_{luna} = 1.62 \\\\frac{m}{s^2}']),\n _templateObject19 = _taggedTemplateLiteralLoose(['g_{marte} = 3.71 \\frac{m}{s^2}'], ['g_{marte} = 3.71 \\\\frac{m}{s^2}']),\n _templateObject20 = _taggedTemplateLiteralLoose(['left | \\x0Bec{F} \\right | leq mu_{s} left | \\x0Bec{F}_{normale} \\right |'], ['\\\\left | \\\\vec{F} \\\\right | \\\\leq \\\\mu_{s} \\\\left | \\\\vec{F}_{normale} \\\\right |']),\n _templateObject21 = _taggedTemplateLiteralLoose(['left | \\x0Bec{F} \\right | leq mu_{d} left | \\x0Bec{F}_{normale} \\right |'], ['\\\\left | \\\\vec{F} \\\\right | \\\\leq \\\\mu_{d} \\\\left | \\\\vec{F}_{normale} \\\\right |']),\n _templateObject22 = _taggedTemplateLiteralLoose(['F = -k x'], ['F = -k x']),\n _templateObject23 = _taggedTemplateLiteralLoose(['Delta \\x0Bec{s} = \\x0Bec{s}(fine) - \\x0Bec{s}(inizio)'], ['\\\\Delta \\\\vec{s} = \\\\vec{s}(fine) - \\\\vec{s}(inizio)']),\n _templateObject24 = _taggedTemplateLiteralLoose(['\\x0Bec{v} = \\frac{Delta \\x0Bec{s}}{Delta t}'], ['\\\\vec{v} = \\\\frac{\\\\Delta \\\\vec{s}}{\\\\Delta t}']),\n _templateObject25 = _taggedTemplateLiteralLoose(['\\x0Bec{v} = lim_{Delta t \\to 0} \\frac{Delta \\x0Bec{s}}{Delta t} = \\frac{d \\x0Bec{s}}{dt}'], ['\\\\vec{v} = \\\\lim_{\\\\Delta t \\\\to 0} \\\\frac{\\\\Delta \\\\vec{s}}{\\\\Delta t} = \\\\frac{d \\\\vec{s}}{dt}']),\n _templateObject26 = _taggedTemplateLiteralLoose(['\\x0Bec{a} = \\frac{Delta \\x0Bec{v}}{Delta t}'], ['\\\\vec{a} = \\\\frac{\\\\Delta \\\\vec{v}}{\\\\Delta t}']),\n _templateObject27 = _taggedTemplateLiteralLoose(['\\x0Bec{a} = lim_{Delta v \\to 0} \\frac{Delta \\x0Bec{v}}{Delta t} = \\frac{d \\x0Bec{v}}{d t} = \\frac{d^2 \\x0Bec{s}}{d t^2}'], ['\\\\vec{a} = \\\\lim_{\\\\Delta v \\\\to 0} \\\\frac{\\\\Delta \\\\vec{v}}{\\\\Delta t} = \\\\frac{d \\\\vec{v}}{d t} = \\\\frac{d^2 \\\\vec{s}}{d t^2}']),\n _templateObject28 = _taggedTemplateLiteralLoose(['\\x0Bec{p} = m \\x0Bec{v}'], ['\\\\vec{p} = m \\\\vec{v}']),\n _templateObject29 = _taggedTemplateLiteralLoose(['Sigma \\x0Bec{F} = 0 Longleftrightarrow Delta \\x0Bec{p} = 0'], ['\\\\Sigma \\\\vec{F} = 0 \\\\Longleftrightarrow \\\\Delta \\\\vec{p} = 0']),\n _templateObject30 = _taggedTemplateLiteralLoose(['s(t) = v cdot Delta t + s(0)'], ['s(t) = v \\\\cdot \\\\Delta t + s(0)']),\n _templateObject31 = _taggedTemplateLiteralLoose(['v(t) = k'], ['v(t) = k']),\n _templateObject32 = _taggedTemplateLiteralLoose(['a(t) = 0'], ['a(t) = 0']),\n _templateObject33 = _taggedTemplateLiteralLoose(['s(t) = \\frac{1}{2} a cdot (Delta t)^2 + v(0) cdot (Delta t) + s(0)'], ['s(t) = \\\\frac{1}{2} a \\\\cdot (\\\\Delta t)^2 + v(0) \\\\cdot (\\\\Delta t) + s(0)']),\n _templateObject34 = _taggedTemplateLiteralLoose(['v(t) = a Delta t + v(0)'], ['v(t) = a \\\\Delta t + v(0)']),\n _templateObject35 = _taggedTemplateLiteralLoose(['a(t) = k'], ['a(t) = k']),\n _templateObject36 = _taggedTemplateLiteralLoose(['omega = \\frac{2 pi}{T}'], ['\\\\omega = \\\\frac{2 \\\\pi}{T}']),\n _templateObject37 = _taggedTemplateLiteralLoose(['s(t) = A sin (omega cdot t + phi)'], ['s(t) = A \\\\sin (\\\\omega \\\\cdot t + \\\\phi)']),\n _templateObject38 = _taggedTemplateLiteralLoose(['\\frac{pi}{2}'], ['\\\\frac{\\\\pi}{2}']),\n _templateObject39 = _taggedTemplateLiteralLoose(['v(t) = A sin (omega cdot t + phi + \\frac{pi}{2})'], ['v(t) = A \\\\sin (\\\\omega \\\\cdot t + \\\\phi + \\\\frac{\\\\pi}{2})']),\n _templateObject40 = _taggedTemplateLiteralLoose(['pi'], ['\\\\pi']),\n _templateObject41 = _taggedTemplateLiteralLoose(['a(t) = A sin (omega cdot t + phi + pi)'], ['a(t) = A \\\\sin (\\\\omega \\\\cdot t + \\\\phi + \\\\pi)']),\n _templateObject42 = _taggedTemplateLiteralLoose(['phi'], ['\\\\phi']),\n _templateObject43 = _taggedTemplateLiteralLoose(['v = \\frac{Delta s}{t} = \\frac{2 pi cdot r}{T} = omega r'], ['v = \\\\frac{\\\\Delta s}{t} = \\\\frac{2 \\\\pi \\\\cdot r}{T} = \\\\omega r']),\n _templateObject44 = _taggedTemplateLiteralLoose(['a = \\frac{v^2}{r} = r cdot omega^2 = v cdot omega'], ['a = \\\\frac{v^2}{r} = r \\\\cdot \\\\omega^2 = v \\\\cdot \\\\omega']),\n _templateObject45 = _taggedTemplateLiteralLoose(['F = m cdot a'], ['F = m \\\\cdot a']),\n _templateObject46 = _taggedTemplateLiteralLoose(['W = \\x0Bec{F} cdot \\x0Bec{s} = F cdot Delta s cdot cos(alpha )'], ['W = \\\\vec{F} \\\\cdot \\\\vec{s} = F \\\\cdot \\\\Delta s \\\\cdot cos(\\\\alpha )']),\n _templateObject47 = _taggedTemplateLiteralLoose(['E_c = \\frac{1}{2} m v^2'], ['E_c = \\\\frac{1}{2} m v^2']),\n _templateObject48 = _taggedTemplateLiteralLoose(['Delta E_c = W'], ['\\\\Delta E_c = W']),\n _templateObject49 = _taggedTemplateLiteralLoose(['E_{p_g} = m cdot g cdot h'], ['E_{p_g} = m \\\\cdot g \\\\cdot h']),\n _templateObject50 = _taggedTemplateLiteralLoose(['E_{p_e} = \\frac{1}{2} k x^2'], ['E_{p_e} = \\\\frac{1}{2} k x^2']),\n _templateObject51 = _taggedTemplateLiteralLoose(['E = E_k + E_p'], ['E = E_k + E_p']),\n _templateObject52 = _taggedTemplateLiteralLoose(['P = \\frac{Delta E}{Delta t}'], ['P = \\\\frac{\\\\Delta E}{\\\\Delta t}']),\n _templateObject53 = _taggedTemplateLiteralLoose(['C_{elettrone} = 1.602 cdot 10^{-19}'], ['C_{elettrone} = 1.602 \\\\cdot 10^{-19}']),\n _templateObject54 = _taggedTemplateLiteralLoose(['left | \\x0Bec{F}_{elettrica} \\right | = \\frac{-k cdot q_1 cdot q_2}{s^2}'], ['\\\\left | \\\\vec{F}_{elettrica} \\\\right | = \\\\frac{-k \\\\cdot q_1 \\\\cdot q_2}{s^2}']),\n _templateObject55 = _taggedTemplateLiteralLoose(['k'], ['k']),\n _templateObject56 = _taggedTemplateLiteralLoose(['k = 8.99 cdot 10^9 \\frac{N cdot m^2}{C^2}'], ['k = 8.99 \\\\cdot 10^9 \\\\frac{N \\\\cdot m^2}{C^2}']),\n _templateObject57 = _taggedTemplateLiteralLoose(['epsilon_0'], ['\\\\epsilon_0']),\n _templateObject58 = _taggedTemplateLiteralLoose(['k = \\frac{1}{4 pi cdot epsilon_0}'], ['k = \\\\frac{1}{4 \\\\pi \\\\cdot \\\\epsilon_0}']),\n _templateObject59 = _taggedTemplateLiteralLoose(['left | \\x0Bec{F}_{elettrica} \\right | = \\frac{q_1 cdot q_2}{4 pi cdot epsilon_0 cdot s^2}'], ['\\\\left | \\\\vec{F}_{elettrica} \\\\right | = \\\\frac{q_1 \\\\cdot q_2}{4 \\\\pi \\\\cdot \\\\epsilon_0 \\\\cdot s^2}']),\n _templateObject60 = _taggedTemplateLiteralLoose(['\\x0Bec{E} = \\frac{\\x0Bec{F}_{elettrica}}{q} = \\frac{-k cdot q}{s^2}'], ['\\\\vec{E} = \\\\frac{\\\\vec{F}_{elettrica}}{q} = \\\\frac{-k \\\\cdot q}{s^2}']),\n _templateObject61 = _taggedTemplateLiteralLoose(['Phi_E = \\x0Bec{E} cdot \\x0Bec{A}'], ['\\\\Phi_E = \\\\vec{E} \\\\cdot \\\\vec{A}']),\n _templateObject62 = _taggedTemplateLiteralLoose(['Phi_E = \\x0Bec{E} cdot \\x0Bec{A} = E_perp cdot A cdot cos(alpha)'], ['\\\\Phi_E = \\\\vec{E} \\\\cdot \\\\vec{A} = E_\\\\perp \\\\cdot A \\\\cdot \\\\cos(\\\\alpha)']),\n _templateObject63 = _taggedTemplateLiteralLoose(['Phi_E = 4 pi cdot k cdot q = \\frac{q}{epsilon_0}'], ['\\\\Phi_E = 4 \\\\pi \\\\cdot k \\\\cdot q = \\\\frac{q}{\\\\epsilon_0}']),\n _templateObject64 = _taggedTemplateLiteralLoose(['U_e'], ['U_e']),\n _templateObject65 = _taggedTemplateLiteralLoose(['V = \\frac{U_e}{q}'], ['V = \\\\frac{U_e}{q}']),\n _templateObject66 = _taggedTemplateLiteralLoose(['V'], ['V']),\n _templateObject67 = _taggedTemplateLiteralLoose(['I = \\frac{Delta q}{Delta t}'], ['I = \\\\frac{\\\\Delta q}{\\\\Delta t}']),\n _templateObject68 = _taggedTemplateLiteralLoose(['A'], ['A']),\n _templateObject69 = _taggedTemplateLiteralLoose(['P = \\frac{Delta U_e}{Delta t} = I cdot Delta V = I^2 cdot R = \\frac{(Delta V)^2}{R}'], ['P = \\\\frac{\\\\Delta U_e}{\\\\Delta t} = I \\\\cdot \\\\Delta V = I^2 \\\\cdot R = \\\\frac{(\\\\Delta V)^2}{R}']),\n _templateObject70 = _taggedTemplateLiteralLoose(['V = R cdot I'], ['V = R \\\\cdot I']),\n _templateObject71 = _taggedTemplateLiteralLoose(['R'], ['R']),\n _templateObject72 = _taggedTemplateLiteralLoose(['Omega'], ['\\\\Omega']),\n _templateObject73 = _taggedTemplateLiteralLoose(['R = \\rho \\frac{L_{unghezza}}{A_{rea}}'], ['R = \\\\rho \\\\frac{L_{unghezza}}{A_{rea}}']),\n _templateObject74 = _taggedTemplateLiteralLoose(['\\rho'], ['\\\\rho']),\n _templateObject75 = _taggedTemplateLiteralLoose(['\\rho = \\rho_0 (1 + alpha(T - T_0))'], ['\\\\rho = \\\\rho_0 (1 + \\\\alpha(T - T_0))']),\n _templateObject76 = _taggedTemplateLiteralLoose(['C = \\frac{q_{massima}}{Delta V}'], ['C = \\\\frac{q_{massima}}{\\\\Delta V}']),\n _templateObject77 = _taggedTemplateLiteralLoose(['C_{nuova} = kappa cdot \\frac{epsilon_0 cdot A}{s}'], ['C_{nuova} = \\\\kappa \\\\cdot \\\\frac{\\\\epsilon_0 \\\\cdot A}{s}']),\n _templateObject78 = _taggedTemplateLiteralLoose(['kappa'], ['\\\\kappa']),\n _templateObject79 = _taggedTemplateLiteralLoose(['s'], ['s']),\n _templateObject80 = _taggedTemplateLiteralLoose(['Fa'], ['Fa']),\n _templateObject81 = _taggedTemplateLiteralLoose(['R_{serie} = sum_{i=1}^{n} R_i'], ['R_{serie} = \\\\sum_{i=1}^{n} R_i']),\n _templateObject82 = _taggedTemplateLiteralLoose(['R_{parallelo} = \\frac{1}{sum_{i=1}^{n} \\frac{1}{R_i}}'], ['R_{parallelo} = \\\\frac{1}{\\\\sum_{i=1}^{n} \\\\frac{1}{R_i}}']),\n _templateObject83 = _taggedTemplateLiteralLoose(['C_{serie} = \\frac{1}{sum_{i=1}^{n} \\frac{1}{C_i}}'], ['C_{serie} = \\\\frac{1}{\\\\sum_{i=1}^{n} \\\\frac{1}{C_i}}']),\n _templateObject84 = _taggedTemplateLiteralLoose(['C_{parallelo} = sum_{i=1}^{n} C_n'], ['C_{parallelo} = \\\\sum_{i=1}^{n} C_n']),\n _templateObject85 = _taggedTemplateLiteralLoose(['mu_0 = 4 pi cdot 10^{-7} \\frac{H}{m}'], ['\\\\mu_0 = 4 \\\\pi \\\\cdot 10^{-7} \\\\frac{H}{m}']),\n _templateObject86 = _taggedTemplateLiteralLoose(['\\frac{N}{A^2}'], ['\\\\frac{N}{A^2}']),\n _templateObject87 = _taggedTemplateLiteralLoose(['B'], ['B']),\n _templateObject88 = _taggedTemplateLiteralLoose(['Phi_{B_{i}} = \\x0Bec{B} cdot \\x0Bec{L}_n = B cdot L_i cdot sin(alpha) = B_parallel cdot L_i'], ['\\\\Phi_{B_{i}} = \\\\vec{B} \\\\cdot \\\\vec{L}_n = B \\\\cdot L_i \\\\cdot \\\\sin(\\\\alpha) = B_\\\\parallel \\\\cdot L_i']),\n _templateObject89 = _taggedTemplateLiteralLoose(['Phi_{B} = sum_{i=0}^{n_{lati}} Phi_{Bn}'], ['\\\\Phi_{B} = \\\\sum_{i=0}^{n_{lati}} \\\\Phi_{Bn}']),\n _templateObject90 = _taggedTemplateLiteralLoose(['Wb = T cdot m^2'], ['Wb = T \\\\cdot m^2']),\n _templateObject91 = _taggedTemplateLiteralLoose(['Phi_B = mu_0 cdot I'], ['\\\\Phi_B = \\\\mu_0 \\\\cdot I']),\n _templateObject92 = _taggedTemplateLiteralLoose(['\\x0Bec{F}_{B} = q cdot (\\x0Bec{v} \\times \\x0Bec{B})'], ['\\\\vec{F}_{B} = q \\\\cdot (\\\\vec{v} \\\\times \\\\vec{B})']),\n _templateObject93 = _taggedTemplateLiteralLoose(['\\x0Bec{B}'], ['\\\\vec{B}']),\n _templateObject94 = _taggedTemplateLiteralLoose(['\\x0Bec{v}'], ['\\\\vec{v}']),\n _templateObject95 = _taggedTemplateLiteralLoose(['\\x0Bec{F}_{magnetica} = I cdot (\\x0Bec{L} \\times \\x0Bec{B})'], ['\\\\vec{F}_{magnetica} = I \\\\cdot (\\\\vec{L} \\\\times \\\\vec{B})']),\n _templateObject96 = _taggedTemplateLiteralLoose(['I'], ['I']),\n _templateObject97 = _taggedTemplateLiteralLoose(['\\x0Bec{L}'], ['\\\\vec{L}']),\n _templateObject98 = _taggedTemplateLiteralLoose(['left | \\x0Bec{B} \\right | = mu_0 cdot I cdot \\frac{A_{vvolgimenti}}{L_{unghezzafilo}}'], ['\\\\left | \\\\vec{B} \\\\right | = \\\\mu_0 \\\\cdot I \\\\cdot \\\\frac{A_{vvolgimenti}}{L_{unghezzafilo}}']),\n _templateObject99 = _taggedTemplateLiteralLoose(['left | \\x0Bec{B} \\right | = \\frac{mu cdot I}{2 pi r}'], ['\\\\left | \\\\vec{B} \\\\right | = \\\\frac{\\\\mu \\\\cdot I}{2 \\\\pi r}']),\n _templateObject100 = _taggedTemplateLiteralLoose(['Delta V_{indotta} = v cdot B cdot L'], ['\\\\Delta V_{indotta} = v \\\\cdot B \\\\cdot L']),\n _templateObject101 = _taggedTemplateLiteralLoose(['Phi_B = \\x0Bec{B} cdot \\x0Bec{A} = B cdot A cdot cos(alpha)'], ['\\\\Phi_B = \\\\vec{B} \\\\cdot \\\\vec{A} = B \\\\cdot A \\\\cdot \\\\cos(\\\\alpha)']),\n _templateObject102 = _taggedTemplateLiteralLoose(['Delta V_{indotta} = - \\frac{Delta Phi_B}{Delta t}'], ['\\\\Delta V_{indotta} = - \\\\frac{\\\\Delta \\\\Phi_B}{\\\\Delta t}']),\n _templateObject103 = _taggedTemplateLiteralLoose(['Delta V_{indotta} = - \\frac{N cdot Delta Phi_{B_{spira}}}{Delta t} = - \\frac{N cdot B cdot A cdot cos(alpha)}{Delta t}'], ['\\\\Delta V_{indotta} = - \\\\frac{N \\\\cdot \\\\Delta \\\\Phi_{B_{spira}}}{\\\\Delta t} = - \\\\frac{N \\\\cdot B \\\\cdot A \\\\cdot cos(\\\\alpha)}{\\\\Delta t}']),\n _templateObject104 = _taggedTemplateLiteralLoose(['N'], ['N']),\n _templateObject105 = _taggedTemplateLiteralLoose(['E'], ['E']),\n _templateObject106 = _taggedTemplateLiteralLoose(['E = c cdot B'], ['E = c \\\\cdot B']),\n _templateObject107 = _taggedTemplateLiteralLoose(['c'], ['c']),\n _templateObject108 = _taggedTemplateLiteralLoose(['c = \\frac{1}{sqrt{epsilon_0 cdot mu_0}} = 3.00 cdot 10^8 \\frac{m}{s}'], ['c = \\\\frac{1}{\\\\sqrt{\\\\epsilon_0 \\\\cdot \\\\mu_0}} = 3.00 \\\\cdot 10^8 \\\\frac{m}{s}']),\n _templateObject109 = _taggedTemplateLiteralLoose(['A(t) = A_{max} cdot sin left ( \\frac{2 pi}{lambda} - omega t + phi \\right )'], ['A(t) = A_{max} \\\\cdot \\\\sin \\\\left ( \\\\frac{2 \\\\pi}{\\\\lambda} - \\\\omega t + \\\\phi \\\\right )']),\n _templateObject110 = _taggedTemplateLiteralLoose(['A_{max}'], ['A_{max}']),\n _templateObject111 = _taggedTemplateLiteralLoose(['\\frac{2 pi}{lambda} = left | \\x0Bec{k} \\right |'], ['\\\\frac{2 \\\\pi}{\\\\lambda} = \\\\left | \\\\vec{k} \\\\right |']),\n _templateObject112 = _taggedTemplateLiteralLoose(['omega'], ['\\\\omega']),\n _templateObject113 = _taggedTemplateLiteralLoose(['\\frac{1}{lambda} = R left ( \\frac{1}{4} - \\frac{1}{n^2} \\right )'], ['\\\\frac{1}{\\\\lambda} = R \\\\left ( \\\\frac{1}{4} - \\\\frac{1}{n^2} \\\\right )']),\n _templateObject114 = _taggedTemplateLiteralLoose(['R = 1.097 cdot 10^7 \\frac{1}{m}'], ['R = 1.097 \\\\cdot 10^7 \\\\frac{1}{m}']),\n _templateObject115 = _taggedTemplateLiteralLoose(['n'], ['n']),\n _templateObject116 = _taggedTemplateLiteralLoose(['h'], ['h']),\n _templateObject117 = _taggedTemplateLiteralLoose(['hbar = left ( \\frac{h}{2 pi} \\right )'], ['\\\\hbar = \\\\left ( \\\\frac{h}{2 \\\\pi} \\\\right )']),\n _templateObject118 = _taggedTemplateLiteralLoose(['m cdot v_n cdot 2 pi cdot r = n cdot h'], ['m \\\\cdot v_n \\\\cdot 2 \\\\pi \\\\cdot r = n \\\\cdot h']),\n _templateObject119 = _taggedTemplateLiteralLoose(['r_n = n^2 cdot a_0 = n^2 cdot \\frac{hbar}{m_{elettrone} cdot k cdot e^2} '], ['r_n = n^2 \\\\cdot a_0 = n^2 \\\\cdot \\\\frac{\\\\hbar}{m_{elettrone} \\\\cdot k \\\\cdot e^2} ']),\n _templateObject120 = _taggedTemplateLiteralLoose(['a_0 = left ( \\frac{h}{2 pi} \\right )^2 cdot \\frac{1}{m_{elettrone} cdot k cdot e^2} = 5.29 cdot 10^{-11} m'], ['a_0 = \\\\left ( \\\\frac{h}{2 \\\\pi} \\\\right )^2 \\\\cdot \\\\frac{1}{m_{elettrone} \\\\cdot k \\\\cdot e^2} = 5.29 \\\\cdot 10^{-11} m']),\n _templateObject121 = _taggedTemplateLiteralLoose(['E_n = \\frac{1}{n^2} cdot E_1 = - \\frac{1}{n^2} cdot \\frac{a_0^2}{2 cdot m cdot hbar^4} = - \\frac{1}{n^2} cdot \\frac{m_{elettrone} cdot k^2 cdot e^4}{2 cdot hbar^2}'], ['E_n = \\\\frac{1}{n^2} \\\\cdot E_1 = - \\\\frac{1}{n^2} \\\\cdot \\\\frac{a_0^2}{2 \\\\cdot m \\\\cdot \\\\hbar^4} = - \\\\frac{1}{n^2} \\\\cdot \\\\frac{m_{elettrone} \\\\cdot k^2 \\\\cdot e^4}{2 \\\\cdot \\\\hbar^2}']),\n _templateObject122 = _taggedTemplateLiteralLoose(['10^1 eV'], ['10^1 eV']),\n _templateObject123 = _taggedTemplateLiteralLoose(['1 eV'], ['1 eV']),\n _templateObject124 = _taggedTemplateLiteralLoose(['lambda'], ['\\\\lambda']),\n _templateObject125 = _taggedTemplateLiteralLoose(['lambda_{max} cdot T'], ['\\\\lambda_{max} \\\\cdot T']),\n _templateObject126 = _taggedTemplateLiteralLoose(['E_{fotone} = h cdot f'], ['E_{fotone} = h \\\\cdot f']);\n\n\n\nfunction _taggedTemplateLiteralLoose(strings, raw) { strings.raw = raw; return strings; }\n\nfunction fisica__classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction fisica__possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction fisica__inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n\n\n\n\n\n\n\n\n\n\nvar r = String.raw;\n\nvar fisica__ref = Object(preact_min[\"h\"])(\n 'h1',\n null,\n 'Fisica'\n);\n\nvar fisica__ref2 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Usa le regole base della trigonometria:'\n);\n\nvar fisica__ref3 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Scomponi in componenti, poi sommali:'\n);\n\nvar _ref4 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Produce il vettore risultante dall\\'applicazione della regola del parallelogramma.'\n);\n\nvar _ref5 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Alla fine \\xE8 sempre una somma:'\n);\n\nvar _ref6 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Produce il vettore che parte da ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'w'\n ),\n ' e arriva a ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'v'\n ),\n '.'\n);\n\nvar _ref7 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Si chiama scalare perch\\xE8 il risultato \\xE8 uno scalare, non un vettore.'\n);\n\nvar _ref8 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Si chiama vettoriale perch\\xE8 il risultato \\xE8 un altro vettore.'\n);\n\nvar _ref9 = Object(preact_min[\"h\"])(\n 'li',\n null,\n Object(preact_min[\"h\"])(\n 'a',\n { href: 'https://it.wikipedia.org/wiki/Regola_della_mano_destra' },\n 'Regola della mano destra'\n )\n);\n\nvar _ref10 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Non \\xE8 commutativo!'\n);\n\nvar _ref11 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Se un corpo puntiforme ha forza risultante nulla, allora la sua velocit\\xE0 non cambia.'\n);\n\nvar _ref12 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La forza risultante di un corpo \\xE8 direttamente proporzionale alla sua accelerazione, e la costante di proporzionalit\\xE0 \\xE8 la ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'massa'\n ),\n '.'\n);\n\nvar _ref13 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Due corpi esercitano forze uguali e opposte uno sull\\'altro.'\n);\n\nvar _ref14 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Due corpi puntiformi si attirano uno verso l\\'altro con forza:'\n);\n\nvar _ref15 = Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'G'\n ),\n ' \\xE8 la ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'costante di gravitazione universale'\n ),\n ' e vale:'\n);\n\nvar _ref16 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Se nel sistema di riferimento consideriamo la Terra ferma, allora un corpo \\xE8 attratto verso la Terra con forza ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'peso'\n ),\n ' uguale a:'\n);\n\nvar _ref17 = Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'g'\n ),\n ' \\xE8 la ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'costante di gravit\\xE0'\n ),\n ' della Terra, e vale:'\n);\n\nvar _ref18 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Per pianeti diversi dalla Terra vale la stessa regola:'\n);\n\nvar _ref19 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'L\\'unica differenza \\xE8 che cambia la ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'costante di gravit\\xE0'\n ),\n ':'\n);\n\nvar _ref20 = Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Normale' },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Si oppone alle forze applicate alla superficie di contatto.'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Un libro appoggiato su un tavolo ha la ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'forza di gravit\\xE0'\n ),\n ' che lo attira verso il terreno e la ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'forza normale'\n ),\n ' che lo trattiene dal cadere.'\n )\n);\n\nvar _ref21 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Impedisce a un corpo di muoversi se non viene spinto da una forza che supera una certa soglia:'\n);\n\nvar _ref22 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Rallenta i corpi che si stanno muovendo finch\\xE8 essi non si fermano:'\n);\n\nvar _ref23 = Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Tensione' },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'E\\' forza trasmessa tra due estremi di una fune.'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Pu\\xF2 essere redirezionata per mezzo di carrucole.'\n )\n);\n\nvar _ref24 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Una molla cerca sempre di tornare alla sua posizione indeformata con forza:'\n);\n\nvar _ref25 = Object(preact_min[\"h\"])(\n 'p',\n null,\n '(E\\' negativa perch\\xE8 la forza \\xE8 opposta a quella applicata per deformarla.)'\n);\n\nvar _ref26 = Object(preact_min[\"h\"])(\n 'p',\n null,\n '\\xC8 un vettore che indica la posizione di un corpo rispetto a un\\'origine.'\n);\n\nvar _ref27 = Object(preact_min[\"h\"])(\n 'p',\n null,\n '\\xC8 un vettore che misura la variazione di posizione nel tempo.'\n);\n\nvar _ref28 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Se si considera un intervallo di tempo infinitesimale si dice ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'velocit\\xE0 istantanea'\n ),\n ':'\n);\n\nvar _ref29 = Object(preact_min[\"h\"])(\n 'p',\n null,\n '\\xC8 un vettore che misura la variazione di velocit\\xE0 nel tempo.'\n);\n\nvar _ref30 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Se si considera un intervallo di tempo infinitesimale si dice ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'accelerazione istantanea'\n ),\n ':'\n);\n\nvar _ref31 = Object(preact_min[\"h\"])(\n 'span',\n null,\n 'Quantit\\xE0 di moto ',\n Object(preact_min[\"h\"])(\n 'small',\n null,\n '(momento lineare)'\n )\n);\n\nvar _ref32 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La quantit\\xE0 di moto \\xE8 una propriet\\xE0 vettoriale dei corpi:'\n);\n\nvar _ref33 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Se la forza risultante \\xE8 nulla, la quantit\\xE0 di moto non cambia.'\n);\n\nvar _ref34 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'legge oraria'\n ),\n ' \\xE8:'\n);\n\nvar _ref35 = Object(preact_min[\"h\"])(\n 'p',\n null,\n '\\xC8 costante:'\n);\n\nvar _ref36 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La velocit\\xE0 non varia:'\n);\n\nvar _ref37 = Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Forze' },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Si applica la prima legge di Newton:'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'f(t) = 0'\n )\n )\n);\n\nvar _ref38 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'legge oraria'\n ),\n ' \\xE8:'\n);\n\nvar _ref39 = Object(preact_min[\"h\"])(\n 'p',\n null,\n '\\xC8 una retta:'\n);\n\nvar _ref40 = Object(preact_min[\"h\"])(\n 'p',\n null,\n '\\xC8 costante:'\n);\n\nvar _ref41 = Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Forze' },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Si applica la prima legge di Newton:'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'f(t) = m a'\n )\n )\n);\n\nvar _ref42 = Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Ampiezza' },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'E\\' la distanza dal centro massima che raggiunge il corpo.'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n '(L\\'ampiezza di una sinusoide.)'\n )\n);\n\nvar _ref43 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Indica quanto in fretta cambia la posizione del corpo.'\n);\n\nvar _ref44 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Dipende dal periodo:'\n);\n\nvar _ref45 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'E\\' una sinusoide:'\n);\n\nvar _ref46 = Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Forze' },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Si applica la prima legge di Newton:'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'f(t) = m a'\n )\n )\n);\n\nvar _ref47 = Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Moto parabolico' },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Il moto parabolico \\xE8 dato sommando un moto rettilineo uniforme sull\\'asse orizzontale e un moto rettilineo uniformemente accelerato sull\\'asse verticale.'\n )\n);\n\nvar _ref48 = Object(preact_min[\"h\"])(\n 'h3',\n null,\n 'Velocit\\xE0 angolare'\n);\n\nvar _ref49 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Quanto cambia la fase nel tempo.'\n);\n\nvar _ref50 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'E\\' l\\'angolo percorso dal corpo rispetto alla posizione iniziale.'\n);\n\nvar _ref51 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Si applicano le formule per la circonferenza:'\n);\n\nvar _ref52 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Il corpo ha sempre un accelerazione verso il centro che gli impedisce di abbandonare il moto:'\n);\n\nvar _ref53 = Object(preact_min[\"h\"])(\n 'p',\n null,\n '\\xC8 verso il centro e si calcola con:'\n);\n\nvar _ref54 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'E\\' compiuto da una forza che sposta un corpo.'\n);\n\nvar _ref55 = Object(preact_min[\"h\"])(\n 'p',\n null,\n '(Se la forza non \\xE8 parallela allo spostamento, il prodotto scalare ci fa considerare solo la componente parallela.)'\n);\n\nvar _ref56 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Un corpo ha energia cinetica in ogni momento uguale a:'\n);\n\nvar _ref57 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Se una forza effettua lavoro su un corpo, cambia la sua energia cinetica pari al lavoro effettuato:'\n);\n\nvar _ref58 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Un corpo ha energia potenziale in ogni momento pari a:'\n);\n\nvar _ref59 = Object(preact_min[\"h\"])(\n 'p',\n null,\n '(Con ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'h'\n ),\n ' uguale a un altezza scelta come punto di riferimento.)'\n);\n\nvar _ref60 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Una molla ha sempre energia potenziale elastica pari a:'\n);\n\nvar _ref61 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Sono conservative le forze per le quali il lavoro compiuto non dipende dal percorso seguito per andare dalla partenza all\\'arrivo.'\n);\n\nvar _ref62 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Ad esempio, \\xE8 conservativa la ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'forza di gravit\\xE0'\n ),\n ', ma ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'non'\n ),\n ' \\xE8 conservativa la forza di attrito.'\n);\n\nvar _ref63 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Se in un sistema ci sono solo forze conservative, allora l\\'energia meccanica totale si conserva:'\n);\n\nvar _ref64 = Object(preact_min[\"h\"])(\n 'p',\n null,\n '\\xC8 la velocit\\xE0 di trasferimento di energia:'\n);\n\nvar _ref65 = Object(preact_min[\"h\"])(\n 'p',\n null,\n '\\xC8 una propriet\\xE0 dei corpi che pu\\xF2 essere ',\n Object(preact_min[\"h\"])(\n plus_Plus,\n null,\n 'positiva'\n ),\n ' o ',\n Object(preact_min[\"h\"])(\n minus_Minus,\n null,\n 'negativa'\n ),\n '.'\n);\n\nvar _ref66 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Si conserva: in un sistema chiuso la carica totale \\xE8 costante.'\n);\n\nvar _ref67 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Cariche ',\n Object(preact_min[\"h\"])(\n plus_Plus,\n null,\n 'opp'\n ),\n Object(preact_min[\"h\"])(\n minus_Minus,\n null,\n 'oste'\n ),\n ' si attraggono; cariche ',\n Object(preact_min[\"h\"])(\n plus_Plus,\n null,\n 'uguali'\n ),\n ' si respingono.'\n);\n\nvar _ref68 = Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Conduttori e isolanti' },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Pi\\xF9 ',\n Object(preact_min[\"h\"])(\n 'a',\n { href: 'https://it.wikipedia.org/wiki/Ione' },\n 'ioni'\n ),\n ' ha un corpo, meglio la carica si muove attraverso di esso.'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'I corpi in cui la carica si muove bene sono ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'conduttori'\n ),\n ', mentre quelli in cui si muove difficilmente sono ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'isolanti'\n ),\n '.'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'Il corpo umano \\xE8 un buon conduttore.'\n )\n )\n);\n\nvar _ref69 = Object(preact_min[\"h\"])(\n split_Split,\n { title: 'Polarizzazione' },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Polarizzazione' },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'E\\' possibile polarizzare un corpo per accumulare la carica di un segno in una certa zona.'\n )\n )\n);\n\nvar _ref70 = Object(preact_min[\"h\"])(\n split_Split,\n null,\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Messa a terra' },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Se un corpo conduttore \\xE8 in contatto con la Terra, le cariche su di esso saranno ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'equilibrate'\n ),\n ' e il corpo diventer\\xE0 elettricamente neutro (con stesso numero di ',\n Object(preact_min[\"h\"])(\n plus_Plus,\n null,\n 'cariche positive'\n ),\n ' e ',\n Object(preact_min[\"h\"])(\n minus_Minus,\n null,\n 'negative'\n ),\n ' all\\'interno).'\n )\n )\n);\n\nvar _ref71 = Object(preact_min[\"h\"])(\n split_Split,\n null,\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Polarizzazione per strofinio' },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Strofinando tra loro due corpi isolanti, essi si ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'polarizzeranno per strofinio'\n ),\n '.'\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Polarizzazione per contatto' },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Toccando un conduttore con un corpo carico, il conduttore potr\\xE0 ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'polarizzarsi per contatto'\n ),\n '.'\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Polarizzazione per induzione' },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Se un corpo conduttore ha cariche \"esterne\" di un ',\n Object(preact_min[\"h\"])(\n plus_Plus,\n null,\n 'certo segno'\n ),\n ' vicino, esso avr\\xE0 tutte le cariche del ',\n Object(preact_min[\"h\"])(\n minus_Minus,\n null,\n 'segno opposto'\n ),\n ' in equilibrio vicino alle cariche esterne, e tutte le cariche dello ',\n Object(preact_min[\"h\"])(\n plus_Plus,\n null,\n 'stesso segno'\n ),\n ' pi\\xF9 lontano possibile da esse.'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Mettendo a terra il conduttore, nuove cariche del ',\n Object(preact_min[\"h\"])(\n minus_Minus,\n null,\n 'segno opposto'\n ),\n ' saranno attratte all\\'interno del corpo per equilibrare le cariche che si sono allontanate.'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Staccando il conduttore da terra e rimuovendo le cariche esterne, esso si ritrover\\xE0 ',\n Object(preact_min[\"h\"])(\n minus_Minus,\n null,\n 'caricato del segno opposto'\n ),\n ' rispetto alle cariche esterne.'\n )\n )\n);\n\nvar _ref72 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Due corpi carichi si attraggono tra loro con forza:'\n);\n\nvar _ref73 = Object(preact_min[\"h\"])(\n 'i',\n null,\n 'costante di Coulomb'\n);\n\nvar _ref74 = Object(preact_min[\"h\"])(\n 'i',\n null,\n 'permeabilit\\xE0 del vuoto'\n);\n\nvar _ref75 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Misura che forza viene applicata in ogni punto su una carica unitaria:'\n);\n\nvar _ref76 = Object(preact_min[\"h\"])(\n 'p',\n null,\n '\\xC8 la differenza tra \"quanto\" campo elettrico ',\n Object(preact_min[\"h\"])(\n plus_Plus,\n null,\n 'entra'\n ),\n ' e quanto campo elettrico ',\n Object(preact_min[\"h\"])(\n minus_Minus,\n null,\n 'esce'\n ),\n ' da una certa area.'\n);\n\nvar _ref77 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'In qualsiasi superficie chiusa, il flusso elettrico \\xE8 uguale alla componente perpendicolare del campo elettrico moltiplicato per l\\'area.'\n);\n\nvar _ref78 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Se il campo elettrico \\xE8 uniforme, se ne pu\\xF2 calcolare facilmente il valore:'\n);\n\nvar _ref79 = Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n todo_Todo,\n null,\n 'Circa. E\\' una specie di integrale...'\n )\n);\n\nvar _ref80 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Il flusso elettrico \\xE8 direttamente proporzionale alla carica presente all\\'interno della superficie.'\n);\n\nvar _ref81 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Ovvero, i campi elettrostatici sono generati dalle cariche elettriche.'\n);\n\nvar _ref82 = Object(preact_min[\"h\"])(\n 'i',\n null,\n 'energia potenziale elettrica'\n);\n\nvar _ref83 = Object(preact_min[\"h\"])(\n 'span',\n null,\n 'Potenziale elettrico ',\n Object(preact_min[\"h\"])(\n 'small',\n null,\n '(tensione)'\n )\n);\n\nvar _ref84 = Object(preact_min[\"h\"])(\n 'p',\n null,\n '\\xC8 il valore dell\\'energia potenziale elettrica per una carica unitaria.'\n);\n\nvar _ref85 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'In una batteria \\xE8 detto ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'forza elettromotrice'\n ),\n ', e corrisponde al lavoro compiuto da una batteria ideale per spostare una carica unitaria tra i due poli.'\n);\n\nvar _ref86 = Object(preact_min[\"h\"])(\n 'span',\n null,\n 'Corrente elettrica ',\n Object(preact_min[\"h\"])(\n 'small',\n null,\n '(intensit\\xE0)'\n )\n);\n\nvar _ref87 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Quanta carica passa attraverso un\\'area (perpendicolare al flusso) nel tempo.'\n);\n\nvar _ref88 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Fintanto che c\\'\\xE8 differenza di potenziale, ci sar\\xE0 anche intensit\\xE0 non nulla.'\n);\n\nvar _ref89 = Object(preact_min[\"h\"])(\n panel_Panel,\n { title: Object(preact_min[\"h\"])(\n 'span',\n null,\n 'Corrente continua ',\n Object(preact_min[\"h\"])(\n 'small',\n null,\n '(',\n Object(preact_min[\"h\"])(\n 'abbr',\n { title: 'Direct Current' },\n 'DC'\n ),\n ')'\n )\n ) },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Quando in un circuito la direzione della corrente \\xE8 costante.'\n )\n);\n\nvar _ref90 = Object(preact_min[\"h\"])(\n panel_Panel,\n { title: Object(preact_min[\"h\"])(\n 'span',\n null,\n 'Corrente alternata ',\n Object(preact_min[\"h\"])(\n 'small',\n null,\n '(',\n Object(preact_min[\"h\"])(\n 'abbr',\n { title: 'Alternate Current' },\n 'AC'\n ),\n ')'\n )\n ) },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Quando in un circuito la direzione della corrente si alterna periodicamente.'\n )\n);\n\nvar _ref91 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Possiamo calcolare la potenza di un circuito:'\n);\n\nvar _ref92 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Riduce l\\'intensit\\xE0 di corrente, e converte parte del potenziale in calore.'\n);\n\nvar _ref93 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Il potenziale utilizzato \\xE8 pari a:'\n);\n\nvar _ref94 = Object(preact_min[\"h\"])(\n 'i',\n null,\n 'resistenza'\n);\n\nvar _ref95 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La resistenza di un conduttore vale:'\n);\n\nvar _ref96 = Object(preact_min[\"h\"])(\n 'i',\n null,\n 'resistivit\\xE0'\n);\n\nvar _ref97 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Immagazzina potenziale elettrico, permettendo di riutilizzarla in seguito.'\n);\n\nvar _ref98 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Per farlo, cattura cariche ',\n Object(preact_min[\"h\"])(\n plus_Plus,\n null,\n 'positive'\n ),\n ' e ',\n Object(preact_min[\"h\"])(\n minus_Minus,\n null,\n 'negative'\n ),\n ' sulle sue due armature; perch\\xE8 questo avvenga, deve essere compiuto lavoro.'\n);\n\nvar _ref99 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Ha una ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'capacit\\xE0'\n ),\n ' caratteristica, che in un condensatore a facce piane parallele \\xE8:'\n);\n\nvar _ref100 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Condensatori di capacit\\xE0 maggiore immagazzinano pi\\xF9 potenziale con meno carica.'\n);\n\nvar _ref101 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La capacit\\xE0 aumenta se viene messo qualcosa tra le armature:'\n);\n\nvar _ref102 = Object(preact_min[\"h\"])(\n 'i',\n null,\n 'costante dielettrica relativa'\n);\n\nvar _ref103 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Se il campo elettrico creatosi tra le due armature supera la ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'rigidit\\xE0 dielettrica'\n ),\n ' del condensatore, la carica immagazzinata viene persa e ha luogo un ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'breakdown'\n ),\n '.'\n);\n\nvar _ref104 = Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Amperometro' },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Misura la corrente elettrica se messo in serie.'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n '(Funzionamento: ha una resistenza interna bassisima in modo da non influire significativamente sulla corrente.)'\n )\n);\n\nvar _ref105 = Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Voltmetro' },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Misura la differenza di potenziale se messo in parallelo.'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n '(Funzionamento: ha una resistenza altissima in modo da non influire significativamente sulla tensione.)'\n )\n);\n\nvar _ref106 = Object(preact_min[\"h\"])(\n split_Split,\n { title: 'Principi di Kirchhoff' },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Legge dei nodi' },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Per nodo si intende un qualsiasi punto del circuito.'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Da un nodo entra ed esce la stessa corrente.'\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Legge delle maglie' },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Per maglia si intende un qualsiasi percorso chiuso all\\'interno del circuito.'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'In una maglia chiusa, la somma delle differenze di potenziale \\xE8 0.'\n )\n )\n);\n\nvar _ref107 = Object(preact_min[\"h\"])(\n split_Split,\n { title: 'Serie e Parallelo' },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Circuito in serie' },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Pi\\xF9 parti di circuito sono ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'in serie'\n ),\n ' se sono consecutive e senza biforcazioni.'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Parti di circuito in serie sono attraversate dalla stessa corrente.'\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Circuito in parallelo' },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Pi\\xF9 parti di circuito sono ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'in parallelo'\n ),\n ' tra loro se hanno lo stesso punto di partenza e lo stesso punto di arrivo.'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Parti di circuito in parallelo hanno la stessa differenza di potenziale.'\n )\n )\n);\n\nvar _ref108 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Nei circuiti in serie, tutte le resistenze possono essere sostituite con una equivalente dalla resistenza della somma di tutte le quelle sostituite:'\n);\n\nvar _ref109 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Nei circuiti in parallelo, tutte le resistenze possono essere sostituite con una equivalente dalla resistenza di:'\n);\n\nvar _ref110 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Nei circuiti in serie, tutti i condensatori possono essere sostituiti con uno equivalente dalla capacit\\xE0 di:'\n);\n\nvar _ref111 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Nei circuiti in parallelo, tutte i condensatori possono essere sostituite con uno equivalente dalla capacit\\xE0 della somma di tutti quelli sostituiti:'\n);\n\nvar _ref112 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'E\\' una costante fisica fondamentale che rappresenta quanto un materiale si magnetizza facilmente.'\n);\n\nvar _ref113 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Come un campo elettrico, ma per i magneti.'\n);\n\nvar _ref114 = Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'T'\n);\n\nvar _ref115 = Object(preact_min[\"h\"])(\n 'p',\n null,\n '\\xC8 \"quanto\" campo magnetico ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'attraversa'\n ),\n ' un percorso chiuso.'\n);\n\nvar _ref116 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Per qualsiasi percorso chiuso, il flusso magnetico \\xE8 uguale alla somma di tutti i \"sottoflussi\" magnetici calcolati sui suoi lati.'\n);\n\nvar _ref117 = Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Legge di Gauss per i campi magnetici' },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Il flusso magnetico attraverso qualsiasi superficie chiusa \\xE8 sempre nullo.'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Ovvero, non esistono monopoli magnetici.'\n )\n);\n\nvar _ref118 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'L\\'intensit\\xE0 di corrente che attraversa un percorso chiuso \\xE8 direttamente proporzionale al flusso magnetico dello stesso percorso.'\n);\n\nvar _ref119 = Object(preact_min[\"h\"])(\n 'span',\n null,\n 'Forza magnetica su carica puntiforme ',\n Object(preact_min[\"h\"])(\n 'small',\n null,\n '(Forza di Lorentz)'\n )\n);\n\nvar _ref120 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'I campi magnetici applicano una forza sulle cariche vicine:'\n);\n\nvar _ref121 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Si ha una forza massima se la velocit\\xE0 \\xE8 perpendicolare al campo magnetico.'\n);\n\nvar _ref122 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'In un campo magnetico uniforme, una velocit\\xE0 perpendicolare al campo porta alla creazione di un moto circolare uniforme.'\n);\n\nvar _ref123 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'I campi magnetici influenzano ovviamente anche le cariche presenti in un conduttore:'\n);\n\nvar _ref124 = Object(preact_min[\"h\"])(\n 'a',\n { href: 'https://it.openprof.com/wb/forza_di_lorentz_su_un_filo_percorso_da_corrente?ch=360' },\n '[1]'\n);\n\nvar _ref125 = Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Campo magnetico in una spira' },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Una spira in cui passa corrente produce un campo magnetico perpendicolare al piano creato dalla spira.'\n )\n);\n\nvar _ref126 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Un solenoide sono tante spire avvolte in modo da formare una specie di cilindro.'\n);\n\nvar _ref127 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'All\\'interno del solenoide si crea un campo (quasi) uniforme:'\n);\n\nvar _ref128 = Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'Caso particolare della ',\n Object(preact_min[\"h\"])(\n 'a',\n { href: 'https://it.wikipedia.org/wiki/Legge_di_Amp%C3%A8re' },\n 'Legge di Amp\\xE8re'\n ),\n '.'\n )\n);\n\nvar _ref129 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Il modulo del campo magnetico ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'B'\n ),\n ' prodotto da un filo in cui passa una corrente continua ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'I'\n ),\n ' alla distanza ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 's'\n ),\n ' \\xE8:'\n);\n\nvar _ref130 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Il campo magnetico cos\\xEC creato gira attorno al filo in senso antiorario.'\n);\n\nvar _ref131 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Due fili attraversati dalla ',\n Object(preact_min[\"h\"])(\n plus_Plus,\n null,\n 'stessa corrente'\n ),\n ' si attraggono, due fili attraversati da ',\n Object(preact_min[\"h\"])(\n plus_Plus,\n null,\n 'corr'\n ),\n Object(preact_min[\"h\"])(\n minus_Minus,\n null,\n 'enti'\n ),\n ' ',\n Object(preact_min[\"h\"])(\n plus_Plus,\n null,\n 'opp'\n ),\n Object(preact_min[\"h\"])(\n minus_Minus,\n null,\n 'oste'\n ),\n ' si respingono.'\n);\n\nvar _ref132 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Un conduttore perpendicolare ad un campo magnetico pu\\xF2 ottenere una differenza di potenziale se messo in movimento in un direzione perpendicolare alla direzione del conduttore e del campo.'\n);\n\nvar _ref133 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La differenza di potenziale si crea a causa della forza magnetica, che fa spostare tutti gli elettroni verso un capo del conduttore.'\n);\n\nvar _ref134 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Essa vale:'\n);\n\nvar _ref135 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Dove ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'v'\n ),\n ' \\xE8 la velocit\\xE0 del conduttore, ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'B'\n ),\n ' \\xE8 l\\'intensit\\xE0 del campo magnetico ed ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'L'\n ),\n ' \\xE8 la lunghezza del conduttore.'\n);\n\nvar _ref136 = Object(preact_min[\"h\"])(\n 'i',\n null,\n 'Legge di Faraday-Neumann-Lenz'\n);\n\nvar _ref137 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Dice che la forza elettromotrice media indotta in un percorso dipende dalla variazione nel tempo del flusso magnetico nello stesso percorso.'\n);\n\nvar _ref138 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Il meno \\xE8 dovuto alla ',\n Object(preact_min[\"h\"])(\n 'a',\n { href: 'https://it.wikipedia.org/wiki/Legge_di_Lenz' },\n 'Legge di Lenz'\n ),\n ', che specifica qualitativamente il verso della forza elettromotrice indotta.'\n);\n\nvar _ref139 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'In un solenoide, la forza elettromotrice indotta \\xE8 uguale a:'\n);\n\nvar _ref140 = Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Legge di Amp\\xE8re-Maxwell' },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Correnti o campi elettrici variabili creano un campo magnetico.'\n )\n);\n\nvar _ref141 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Si dice quindi che sono ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'onde elettromagnetiche'\n ),\n '.'\n);\n\nvar _ref142 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Esse sono legate dalla relazione:'\n);\n\nvar _ref143 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'I solidi, se portati ad alta temperatura, emettono luce con uno ',\n Object(preact_min[\"h\"])(\n 'a',\n { href: 'https://it.wikipedia.org/wiki/Spettro_continuo' },\n 'spettro continuo'\n ),\n '.'\n);\n\nvar _ref144 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'I gas, invece, ad alta temperatura emettono luce solo con particolari lunghezze d\\'onda.'\n);\n\nvar _ref145 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'In un gas di idrogeno, le lunghezze d\\'onda emesse sono ricavabili con:'\n);\n\nvar _ref146 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Una grandezza si dice quantizzata (o discreta) se pu\\xF2 assumere solo determinati valori.'\n);\n\nvar _ref147 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Una grandezza si dice continua se pu\\xF2 assumere qualsiasi valore e quindi se non \\xE8 quantizzata.'\n);\n\nvar _ref148 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Energia, momento angolare e raggio sono quantizzati.'\n);\n\nvar _ref149 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'L\\'energia degli elettroni \\xE8 quantizzata.'\n);\n\nvar _ref150 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Inoltre, per essi \\xE8 valido che:'\n);\n\nvar _ref151 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Ancora, il raggio delle orbite \\xE8 uguale a:'\n);\n\nvar _ref152 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Infine, in ogni stato, l\\'energia \\xE8 pari a:'\n);\n\nvar _ref153 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Due elettroni non possono occupare lo stesso stato.'\n);\n\nvar _ref154 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Questo modello funziona solo per atomi con numero atomico basso. Atomi con molti elettroni hanno comportamenti diversi, descritti dal modello di'\n);\n\nvar _ref155 = Object(preact_min[\"h\"])(\n split_Split,\n null,\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Nei solidi' },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Nei solidi, le lunghezze d\\'onda sono talmente tanto vicine da poter essere considerate una banda.'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Possono per\\xF2 comunque avere dei gap dovuti agli intervalli di energia non ammessi.'\n )\n )\n);\n\nvar _ref156 = Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n todo_Todo,\n null,\n 'Refactor this'\n )\n);\n\nvar _ref157 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Se invece la banda di emissione si sovrappone a un altra, allora il corpo \\xE8 un conduttore.'\n);\n\nvar _ref158 = Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Lacune' },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Legami in cui ',\n Object(preact_min[\"h\"])(\n plus_Plus,\n null,\n 'mancano elettroni'\n ),\n '.'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n minus_Minus,\n null,\n 'Elettroni'\n ),\n ' di altri legami possono spostarsi per colmare le ',\n Object(preact_min[\"h\"])(\n plus_Plus,\n null,\n 'lacune'\n ),\n ', creandone altre, e spostandole in direzione opposta a quella della corrente.'\n )\n);\n\nvar _ref159 = Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Accettori e donori' },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Se si inserisce in un cristallo semiconduttore si inserisce un atomo con numero atomico diverso, si otterr\\xE0:'\n ),\n Object(preact_min[\"h\"])(\n 'ul',\n null,\n Object(preact_min[\"h\"])(\n 'li',\n null,\n 'Con numero atomico maggiore, un semiconduttore di ',\n Object(preact_min[\"h\"])(\n minus_Minus,\n null,\n 'tipo N'\n ),\n ' con ',\n Object(preact_min[\"h\"])(\n minus_Minus,\n null,\n 'elettroni in eccesso'\n ),\n ' liberi di scorrere.'\n ),\n Object(preact_min[\"h\"])(\n 'li',\n null,\n 'Con numero atomico minore, un semiconduttore di ',\n Object(preact_min[\"h\"])(\n plus_Plus,\n null,\n 'tipo P'\n ),\n ' con ',\n Object(preact_min[\"h\"])(\n plus_Plus,\n null,\n 'lacune in eccesso'\n ),\n ' libere di catturare elettroni da altri legami.'\n )\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Maggiore impurezza porta a maggiore conduttivit\\xE0.'\n )\n);\n\nvar _ref160 = Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Temperatura' },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Aumentando la temperatura di un semiconduttore si aumenta la conduttivit\\xE0, perch\\xE8 eccita le particelle e favorisce il movimento di ',\n Object(preact_min[\"h\"])(\n minus_Minus,\n null,\n 'elettroni'\n ),\n ' e ',\n Object(preact_min[\"h\"])(\n plus_Plus,\n null,\n 'lacune'\n ),\n '.'\n )\n);\n\nvar _ref161 = Object(preact_min[\"h\"])(\n 'span',\n null,\n 'Ottica ',\n Object(preact_min[\"h\"])(\n 'small',\n null,\n '(non l\\'abbiamo fatta)'\n )\n);\n\nvar _ref162 = Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Assorbimento e riflessione' },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'I corpi possono assorbire o riflettere le onde elettromagnetiche che li colpiscono.'\n )\n);\n\nvar _ref163 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Un corpo nero \\xE8 un corpo che assorbe tutte le onde elettromagnetiche che riceve senza rifletterne nessuna.'\n);\n\nvar _ref164 = Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Teoria di Planck per il corpo nero' },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'L\\'energia assorbita e emessa dai corpi neri \\xE8 quantizzata.'\n )\n);\n\nvar _ref165 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Un onda magnetica con un quanto di energia \\xE8 detta ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'fotone'\n ),\n ':'\n);\n\nvar _ref166 = Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Effetto fotoelettrico' },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'A volte, i fotoni che colpiscono un metallo possono estrarvi degli elettroni e creare una differenza di potenziale.'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Perch\\xE8 avvenga, la frequenza deve essere maggiore di una certa soglia.'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Il numero di elettroni estratti dipende dall\\'intensit\\xE0 dell\\'onda, mentre l\\'energia cinetica degli elettroni dipende dalla frequenza.'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Non c\\'\\xE8 nessun ritardo tra l\\'assorbimento del fotone e l\\'estrazione di elettroni.'\n )\n);\n\nvar fisica_Fisica = function (_Component) {\n fisica__inherits(Fisica, _Component);\n\n function Fisica() {\n fisica__classCallCheck(this, Fisica);\n\n return fisica__possibleConstructorReturn(this, _Component.apply(this, arguments));\n }\n\n Fisica.prototype.render = function render() {\n return Object(preact_min[\"h\"])(\n 'div',\n { style: fisica_default.a.fisica },\n fisica__ref,\n Object(preact_min[\"h\"])(\n split_Split,\n { title: 'Vettori' },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Componenti cartesiane' },\n fisica__ref2,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject)\n )\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject2)\n )\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject3)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Somma' },\n fisica__ref3,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject4)\n )\n ),\n _ref4\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Differenza' },\n _ref5,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject5)\n )\n ),\n _ref6\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Prodotto scalare' },\n _ref7,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject6)\n )\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Produce il modulo della proiezione di ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject7)\n ),\n ' su ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject8)\n ),\n '.'\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Prodotto vettoriale' },\n _ref8,\n Object(preact_min[\"h\"])(\n 'ul',\n null,\n Object(preact_min[\"h\"])(\n 'li',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject9)\n )\n ),\n Object(preact_min[\"h\"])(\n 'li',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject10)\n )\n ),\n _ref9\n ),\n _ref10\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: 'Leggi di Newton' },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: '1\\u1D43: Inerzia' },\n _ref11,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject11)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: '2\\u1D43: Proporzionalit\\xE0' },\n _ref12,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject12)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: '3\\u1D43: Azione e reazione' },\n _ref13,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject13)\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: 'Forza di gravit\\xE0' },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Tra due corpi' },\n _ref14,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject14)\n )\n ),\n _ref15,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject15)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Verso la Terra' },\n _ref16,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject16)\n )\n ),\n _ref17,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject17)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Su pianeti diversi' },\n _ref18,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject16)\n )\n ),\n _ref19,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject18)\n )\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject19)\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: 'Forze di contatto' },\n _ref20,\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Attrito statico' },\n _ref21,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject20)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Attrito dinamico' },\n _ref22,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject21)\n )\n )\n ),\n _ref23,\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Elastica' },\n _ref24,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject22)\n )\n ),\n _ref25\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: 'Cinematica' },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Spostamento' },\n _ref26,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject23)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Velocit\\xE0' },\n _ref27,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject24)\n )\n ),\n _ref28,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject25)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Accelerazione' },\n _ref29,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject26)\n )\n ),\n _ref30,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject27)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: _ref31 },\n _ref32,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject28)\n )\n ),\n _ref33,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject29)\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: 'Moto rettilineo uniforme' },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Spostamento' },\n _ref34,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject30)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Velocit\\xE0' },\n _ref35,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject31)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Accelerazione' },\n _ref36,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject32)\n )\n )\n ),\n _ref37\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: 'Moto rettilineo uniformemente accelerato' },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Spostamento' },\n _ref38,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject33)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Velocit\\xE0' },\n _ref39,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject34)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Accelerazione' },\n _ref40,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject35)\n )\n )\n ),\n _ref41\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: 'Moto armonico semplice' },\n _ref42,\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Velocit\\xE0 angolare' },\n _ref43,\n _ref44,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject36)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Spostamento' },\n _ref45,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject37)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Velocit\\xE0' },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'E\\' la sinusoide dello spostamento, sfasata di ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject38)\n ),\n ':'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject39)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Accelerazione' },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'E\\' la sinusoide della velocit\\xE0, sfasata di ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject40)\n ),\n ':'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject41)\n )\n )\n ),\n _ref46\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: 'Moti composti' },\n _ref47,\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Moto circolare uniforme' },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Il moto parabolico \\xE8 dato sommando due moti armonici semplici: uno sull\\'asse X, e l\\'altro, sfasato di ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject38)\n ),\n ', sull\\'asse Y.'\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: 'Moto circolare uniforme' },\n Object(preact_min[\"h\"])(\n panel_Panel,\n null,\n _ref48,\n _ref49,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject36)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Fase' },\n _ref50,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Si indica con ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject42)\n ),\n ', e generalmente si usa in radianti.'\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Velocit\\xE0' },\n _ref51,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject43)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Accelerazione' },\n _ref52,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject44)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Forza centripeta' },\n _ref53,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject45)\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: 'Lavoro ed energia' },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Lavoro' },\n _ref54,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject46)\n )\n ),\n _ref55\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Energia cinetica' },\n _ref56,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject47)\n )\n ),\n _ref57,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject48)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Energia potenziale gravitazionale' },\n _ref58,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject49)\n )\n ),\n _ref59\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Energia potenziale elastica' },\n _ref60,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject50)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Forze conservative' },\n _ref61,\n _ref62,\n _ref63,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject51)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Potenza' },\n _ref64,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject52)\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: 'Elettrostatica' },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Carica elettrica' },\n _ref65,\n _ref66,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Esiste un\\'unit\\xE0 elementare: ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject53)\n ),\n '.'\n ),\n _ref67\n ),\n _ref68\n ),\n _ref69,\n _ref70,\n _ref71,\n Object(preact_min[\"h\"])(\n split_Split,\n { title: 'Forza elettrica' },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Legge di Coulomb' },\n _ref72,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject54)\n )\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject55)\n ),\n ' \\xE8 la ',\n _ref73,\n ', e vale ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject56)\n ),\n '.'\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Permeabilit\\xE0 dello spazio vuoto' },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La costante ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject55)\n ),\n ' \\xE8 in realt\\xE0 dipendente da un altra costante, ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject57)\n ),\n ', la ',\n _ref74,\n '.'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject58)\n )\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject59)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Campo elettrico' },\n _ref75,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject60)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Flusso elettrico' },\n _ref76,\n _ref77,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject61)\n )\n ),\n _ref78,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject62)\n )\n ),\n _ref79\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Legge di Gauss per i campi elettrostatici' },\n _ref80,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject63)\n )\n ),\n _ref81\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: 'Energia elettrica' },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Energia potenziale elettrica' },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Un corpo carico vicino ad altre cariche possiede un\\'',\n _ref82,\n ' ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject64)\n ),\n '.'\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: 'Circuiti elettrici' },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: _ref83 },\n _ref84,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject65)\n )\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La sua unit\\xE0 di misura \\xE8 il Volt (',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject66)\n ),\n ').'\n ),\n _ref85\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: _ref86 },\n _ref87,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject67)\n )\n ),\n _ref88,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La sua unit\\xE0 di misura \\xE8 l\\'Ampere (',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject68)\n ),\n ').'\n )\n ),\n _ref89,\n _ref90,\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Potenza elettrica' },\n _ref91,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject69)\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: 'Elementi di un circuito' },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Resistore' },\n _ref92,\n _ref93,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject70)\n )\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Dove ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject71)\n ),\n ' \\xE8 una costante detta ',\n _ref94,\n ' con unit\\xE0 di misura Ohm (',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject72)\n ),\n ').'\n ),\n _ref95,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject73)\n )\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject74)\n ),\n ' \\xE8 la ',\n _ref96,\n ' del materiale, e varia in base alla temperatura:'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject75)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Condensatore' },\n _ref97,\n _ref98,\n _ref99,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject76)\n )\n ),\n _ref100,\n _ref101,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject77)\n )\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Dove ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject78)\n ),\n ' \\xE8 la ',\n _ref102,\n ' del materiale inserito, ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject68)\n ),\n ' l\\'area di una armatura e ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject79)\n ),\n ' la distanza tra le due armature.'\n ),\n _ref103,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La sua unit\\xE0 di misura \\xE8 il Farad (',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject80)\n ),\n ')'\n )\n ),\n _ref104,\n _ref105\n ),\n _ref106,\n _ref107,\n Object(preact_min[\"h\"])(\n split_Split,\n { title: 'Resistenze equivalenti' },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Circuiti in serie' },\n _ref108,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject81)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Circuiti in parallelo' },\n _ref109,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject82)\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: 'Condensatori equivalenti' },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Circuiti in serie' },\n _ref110,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject83)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Circuiti in parallelo' },\n _ref111,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject84)\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: 'Magnetismo' },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Permeabilit\\xE0 magnetica dello spazio vuoto' },\n _ref112,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject85)\n ),\n ' (',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject86)\n ),\n ')'\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Campo magnetico' },\n _ref113,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Il suo simbolo \\xE8 ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject87)\n ),\n ', e la sua unit\\xE0 di misura \\xE8 il Tesla (',\n _ref114,\n ').'\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Flusso magnetico' },\n _ref115,\n _ref116,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject88)\n )\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject89)\n )\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La sua unit\\xE0 di misura \\xE8 il Weber (',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject90)\n ),\n ').'\n )\n ),\n _ref117,\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Legge di Amp\\xE8re' },\n _ref118,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject91)\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: 'Forze magnetiche' },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: _ref119 },\n _ref120,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject92)\n )\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Dove ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject93)\n ),\n ' \\xE8 l\\'intensit\\xE0 del campo magnetico e ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject94)\n ),\n ' la velocit\\xE0 della carica considerata.'\n ),\n _ref121,\n _ref122\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Forza magnetica in un filo' },\n _ref123,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject95)\n ),\n ' ',\n _ref124\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Dove ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject96)\n ),\n ' \\xE8 la corrente elettrica, ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject97)\n ),\n ' \\xE8 un vettore che punta nella direzione di scorrimento della corrente e ha come modulo la lunghezza del conduttore.'\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: 'Campi magnetici' },\n _ref125,\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Campo magnetico di un solenoide' },\n _ref126,\n _ref127,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject98)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Legge di Oersted' },\n _ref128,\n _ref129,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject99)\n )\n ),\n _ref130,\n _ref131\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: 'Induzione elettromagnetica' },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Forza elettromotrice indotta' },\n _ref132,\n _ref133,\n _ref134,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject100)\n )\n ),\n _ref135\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Flusso magnetico in una spira' },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'In un campo magnetico ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject87)\n ),\n ' uniforme e perpendicolare al piano di una spira di area ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject68)\n ),\n ', il flusso magnetico si pu\\xF2 determinare con la ',\n _ref136,\n ':'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject101)\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n null,\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Legge di Faraday-Neumann-Lenz' },\n _ref137,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject102)\n )\n ),\n _ref138\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Faraday in un solenoide' },\n _ref139,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject103)\n )\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Dove ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject104)\n ),\n ' \\xE8 il numero delle spire del solenoide.'\n )\n ),\n _ref140\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: 'Elettromagnetismo' },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Onde elettromagnetiche' },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Nel vuoto, il campo elettrico ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject105)\n ),\n ' e il campo magnetico ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject87)\n ),\n ' sono perpendicolari tra loro e la direzione di propagazione, e sono entrambe funzioni del tempo.'\n ),\n _ref141,\n _ref142,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject106)\n )\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Dove ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject107)\n ),\n ' \\xE8 la velocit\\xE0 delle onde (luce) nel vuoto, e a sua volta \\xE8 uguale a:'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject108)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Formula delle onde' },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject109)\n )\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Dove ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject110)\n ),\n ' \\xE8 l\\'ampiezza massima che pu\\xF2 avere l\\'onda, ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject111)\n ),\n ' \\xE8 il vettore d\\'onda, ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject112)\n ),\n ' la frequenza angolare e ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject42)\n ),\n ' la fase.'\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: 'Spettroscopia' },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Emissione' },\n _ref143,\n _ref144,\n _ref145,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject113)\n )\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Con ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject114)\n ),\n ', detta costante di Rydberg, e ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject115)\n ),\n ' un numero intero.'\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Grandezza quantizzata' },\n _ref146,\n _ref147,\n _ref148,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Nota costante quantica \\xE8 ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject116)\n ),\n ', la costante di Planck, ovvero il valore minimo possibile per la carica (talvolta espressa come ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject117)\n ),\n '.'\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n null,\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Modello di Bohr' },\n _ref149,\n _ref150,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject118)\n )\n ),\n _ref151,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject119)\n )\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Con ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject120)\n ),\n '.'\n ),\n _ref152,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject121)\n )\n ),\n _ref153,\n _ref154\n )\n ),\n _ref155,\n Object(preact_min[\"h\"])(\n split_Split,\n { title: 'Semiconduttori' },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Semiconduttori' },\n _ref156,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Se la banda di emissione con energia pi\\xF9 alta di un corpo \\xE8 assente o \\xE8 separata da un gap dell\\'ordine di grandezza maggiore di ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject122)\n ),\n ', allora il corpo \\xE8 un isolante.'\n ),\n _ref157,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Se il gap \\xE8 invece dell\\'ordine di grandezza di ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject123)\n ),\n ', allora il corpo \\xE8 un semiconduttore.'\n )\n ),\n _ref158,\n _ref159,\n _ref160\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: _ref161 },\n _ref162,\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Corpo nero' },\n _ref163,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Le onde assorbite vengono poi riemesse sotto forma di un onda di ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject124)\n ),\n ' variabile in base alla temperatura.'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject125)\n ),\n ' \\xE8 costante.'\n )\n ),\n _ref164,\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: 'Fotone' },\n _ref165,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n r(_templateObject126)\n )\n )\n ),\n _ref166\n )\n );\n };\n\n return Fisica;\n}(preact_min[\"Component\"]);\n\n\n// EXTERNAL MODULE: ./pages/vldigeometria.css\nvar vldigeometria = __webpack_require__(\"jHTF\");\nvar vldigeometria_default = /*#__PURE__*/__webpack_require__.n(vldigeometria);\n\n// EXTERNAL MODULE: ./components/markdown.css\nvar markdown = __webpack_require__(\"MKE3\");\nvar markdown_default = /*#__PURE__*/__webpack_require__.n(markdown);\n\n// EXTERNAL MODULE: ../node_modules/showdown/dist/showdown.js\nvar showdown = __webpack_require__(\"6adR\");\nvar showdown_default = /*#__PURE__*/__webpack_require__.n(showdown);\n\n// CONCATENATED MODULE: ./components/markdown.js\n\n\nfunction markdown__classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction markdown__possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction markdown__inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n\n\n\n\n\nvar markdown_Markdown = function (_Component) {\n markdown__inherits(Markdown, _Component);\n\n function Markdown() {\n markdown__classCallCheck(this, Markdown);\n\n return markdown__possibleConstructorReturn(this, _Component.apply(this, arguments));\n }\n\n Markdown.prototype.render = function render() {\n var converter = new showdown_default.a.Converter();\n converter.setFlavor(\"github\");\n var html = converter.makeHtml(\"\" + this.props.children);\n // noinspection CheckTagEmptyBody\n return Object(preact_min[\"h\"])(\"div\", { style: markdown_default.a.markdown, dangerouslySetInnerHTML: { __html: html } });\n };\n\n return Markdown;\n}(preact_min[\"Component\"]);\n\n\n// CONCATENATED MODULE: ./pages/vldigeometria.js\nvar vldigeometria__templateObject = vldigeometria__taggedTemplateLiteralLoose(['\\nTutte le videolezioni sono state pubblicate sotto licenza [CC BY-NC-SA 4.0](https://creativecommons.org/licenses/by-nc-sa/4.0/) dalla Prof.ssa Beatrice Ruini nell\\'anno accademico 2018/2019 sul [portale Dolly 2018](https://dolly.fim.unimore.it/2018/course/view.php?id=14#section-0) (Moodle).\\n\\nPer comodit\\xE0, ho estratto l\\'url sorgente del video dall\\'embed presente nella rispettiva pagina.\\n\\n1. [Definizione di Spazio Vettoriale](https://www.youtube.com/watch?v=7eHEzf4403c) (1:17:29)\\n2. [Sottospazi vettoriali I](https://www.youtube.com/watch?v=FPqrULk5HBU) (37:15)\\n3. [Sottospazi vettoriali II](https://www.youtube.com/watch?v=ubDWUw9hk0k) (43:26)\\n4. [Sottospazi vettoriali III](https://www.youtube.com/watch?v=381n4NPb6Oc) (40:29)\\n5. [Lineare dipendenza e indipendenza](https://www.youtube.com/watch?v=9YVQ5olYrh0) (56:12)\\n6. [Basi di uno spazio vettoriale I](https://www.youtube.com/watch?v=mEF_lcTzEoE) (25:52)\\n7. [Basi di uno spazio vettoriale II](https://www.youtube.com/watch?v=k1r9JfXY53k) (48:24)\\n8. [Teorema di Grassmann](https://www.youtube.com/watch?v=3sqB-MMyCWM) (32:36)\\n9. [Basi e Matrici](https://www.youtube.com/watch?v=Rd6AB_jE7YI) (27:06)\\n10. [Definizione di Applicazioni Lineari](https://www.youtube.com/watch?v=rmd7ffZeVYk) (16:23)\\n11. [Propriet\\xE0 delle Applicazioni Lineari](https://www.youtube.com/watch?v=MH7ztQGkqmw) (31:58)\\n12. [Definizione di determinante](https://www.youtube.com/watch?v=EwubcLwBdzk) (36:43)\\n13. [Propriet\\xE0 e metodo di triangolazione](https://www.youtube.com/watch?v=SFusGarV6HI) (22:36)\\n14. [Teorema di Laplace](https://www.youtube.com/watch?v=BqZDWnKl2nQ) (29:03)\\n15. [4 applicazioni del Teorema di Laplace](https://www.youtube.com/watch?v=2tr3y725GY0) (47:53)\\n16. [Spazi vettoriali euclidei reali - Parte 1](https://www.youtube.com/watch?v=W7Z1hm-jwMM) (28:46)\\n17. [Spazi vettoriali euclidei reali - Parte 2](https://www.youtube.com/watch?v=zjmKE9TMGm8) (27:17)\\n18. [Autovalori e autovettori](https://www.youtube.com/watch?v=XlrlcnvcTtQ) (33:00)\\n19. [Polinomio caratteristico](https://www.youtube.com/watch?v=61icRbgWTdI) (31:31)\\n20. [Teorema diagonalizzabilit\\xE0](https://www.youtube.com/watch?v=wm5V6en9OFo) (18:49)\\n21. [Spazi affini](https://player.vimeo.com/video/291457587) (20:46)\\n22. [Sottospazi affini](https://player.vimeo.com/video/291458991) (21:32)\\n23. [Parallelismo e Riferimenti Affini](https://player.vimeo.com/video/291510181) (16:57)\\n24. [Rappresentazione di Sottospazi Affini](https://player.vimeo.com/video/291510296) (31:17)\\n25. [Spazi Euclidei](https://player.vimeo.com/video/291510612) (35:57)\\n26. [Teoria dei ranghi](https://player.vimeo.com/video/291510964) (9:44)\\n27. [Teoria dei ranghi 2](https://player.vimeo.com/video/291510862) (14:44)\\n\\nNell\\'anno accademico 2018/2019 non sono stati trattati gli argomenti nei video 21, 22 e 23.\\n '], ['\\nTutte le videolezioni sono state pubblicate sotto licenza [CC BY-NC-SA 4.0](https://creativecommons.org/licenses/by-nc-sa/4.0/) dalla Prof.ssa Beatrice Ruini nell\\'anno accademico 2018/2019 sul [portale Dolly 2018](https://dolly.fim.unimore.it/2018/course/view.php?id=14#section-0) (Moodle).\\n\\nPer comodit\\xE0, ho estratto l\\'url sorgente del video dall\\'embed presente nella rispettiva pagina.\\n\\n1. [Definizione di Spazio Vettoriale](https://www.youtube.com/watch?v=7eHEzf4403c) (1:17:29)\\n2. [Sottospazi vettoriali I](https://www.youtube.com/watch?v=FPqrULk5HBU) (37:15)\\n3. [Sottospazi vettoriali II](https://www.youtube.com/watch?v=ubDWUw9hk0k) (43:26)\\n4. [Sottospazi vettoriali III](https://www.youtube.com/watch?v=381n4NPb6Oc) (40:29)\\n5. [Lineare dipendenza e indipendenza](https://www.youtube.com/watch?v=9YVQ5olYrh0) (56:12)\\n6. [Basi di uno spazio vettoriale I](https://www.youtube.com/watch?v=mEF_lcTzEoE) (25:52)\\n7. [Basi di uno spazio vettoriale II](https://www.youtube.com/watch?v=k1r9JfXY53k) (48:24)\\n8. [Teorema di Grassmann](https://www.youtube.com/watch?v=3sqB-MMyCWM) (32:36)\\n9. [Basi e Matrici](https://www.youtube.com/watch?v=Rd6AB_jE7YI) (27:06)\\n10. [Definizione di Applicazioni Lineari](https://www.youtube.com/watch?v=rmd7ffZeVYk) (16:23)\\n11. [Propriet\\xE0 delle Applicazioni Lineari](https://www.youtube.com/watch?v=MH7ztQGkqmw) (31:58)\\n12. [Definizione di determinante](https://www.youtube.com/watch?v=EwubcLwBdzk) (36:43)\\n13. [Propriet\\xE0 e metodo di triangolazione](https://www.youtube.com/watch?v=SFusGarV6HI) (22:36)\\n14. [Teorema di Laplace](https://www.youtube.com/watch?v=BqZDWnKl2nQ) (29:03)\\n15. [4 applicazioni del Teorema di Laplace](https://www.youtube.com/watch?v=2tr3y725GY0) (47:53)\\n16. [Spazi vettoriali euclidei reali - Parte 1](https://www.youtube.com/watch?v=W7Z1hm-jwMM) (28:46)\\n17. [Spazi vettoriali euclidei reali - Parte 2](https://www.youtube.com/watch?v=zjmKE9TMGm8) (27:17)\\n18. [Autovalori e autovettori](https://www.youtube.com/watch?v=XlrlcnvcTtQ) (33:00)\\n19. [Polinomio caratteristico](https://www.youtube.com/watch?v=61icRbgWTdI) (31:31)\\n20. [Teorema diagonalizzabilit\\xE0](https://www.youtube.com/watch?v=wm5V6en9OFo) (18:49)\\n21. [Spazi affini](https://player.vimeo.com/video/291457587) (20:46)\\n22. [Sottospazi affini](https://player.vimeo.com/video/291458991) (21:32)\\n23. [Parallelismo e Riferimenti Affini](https://player.vimeo.com/video/291510181) (16:57)\\n24. [Rappresentazione di Sottospazi Affini](https://player.vimeo.com/video/291510296) (31:17)\\n25. [Spazi Euclidei](https://player.vimeo.com/video/291510612) (35:57)\\n26. [Teoria dei ranghi](https://player.vimeo.com/video/291510964) (9:44)\\n27. [Teoria dei ranghi 2](https://player.vimeo.com/video/291510862) (14:44)\\n\\nNell\\'anno accademico 2018/2019 non sono stati trattati gli argomenti nei video 21, 22 e 23.\\n ']);\n\n\n\nfunction vldigeometria__taggedTemplateLiteralLoose(strings, raw) { strings.raw = raw; return strings; }\n\nfunction vldigeometria__classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction vldigeometria__possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction vldigeometria__inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n\n\n\n\n\n\nvar vldigeometria_r = String.raw;\n\nvar vldigeometria__ref = Object(preact_min[\"h\"])(\n\t'h1',\n\tnull,\n\t'Videolezioni di Geometria'\n);\n\nvar vldigeometria_VlDiGeometria = function (_Component) {\n\tvldigeometria__inherits(VlDiGeometria, _Component);\n\n\tfunction VlDiGeometria() {\n\t\tvldigeometria__classCallCheck(this, VlDiGeometria);\n\n\t\treturn vldigeometria__possibleConstructorReturn(this, _Component.apply(this, arguments));\n\t}\n\n\tVlDiGeometria.prototype.render = function render() {\n\t\t//Imported from unimore-info-wiki\n\t\treturn Object(preact_min[\"h\"])(\n\t\t\t'div',\n\t\t\t{ style: vldigeometria_default.a.vldigeometria },\n\t\t\tvldigeometria__ref,\n\t\t\tObject(preact_min[\"h\"])(\n\t\t\t\tpanel_Panel,\n\t\t\t\tnull,\n\t\t\t\tObject(preact_min[\"h\"])(\n\t\t\t\t\tmarkdown_Markdown,\n\t\t\t\t\tnull,\n\t\t\t\t\tvldigeometria_r(vldigeometria__templateObject)\n\t\t\t\t)\n\t\t\t)\n\t\t);\n\t};\n\n\treturn VlDiGeometria;\n}(preact_min[\"Component\"]);\n\n\n// EXTERNAL MODULE: ./pages/mingwinstall.css\nvar mingwinstall = __webpack_require__(\"5m9J\");\nvar mingwinstall_default = /*#__PURE__*/__webpack_require__.n(mingwinstall);\n\n// CONCATENATED MODULE: ./pages/mingwinstall.js\n\n\nfunction mingwinstall__classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction mingwinstall__possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction mingwinstall__inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n\n\n\n\n\nvar mingwinstall__ref = Object(preact_min[\"h\"])(\n\t'h1',\n\tnull,\n\t'Come installare MinGW'\n);\n\nvar mingwinstall__ref2 = Object(preact_min[\"h\"])(\n\tpanel_Panel,\n\tnull,\n\tObject(preact_min[\"h\"])(\n\t\t'p',\n\t\tnull,\n\t\t' Scaricate ',\n\t\tObject(preact_min[\"h\"])(\n\t\t\t'a',\n\t\t\t{ href: 'https://osdn.net/projects/mingw/downloads/68260/mingw-get-setup.exe/' },\n\t\t\t'l\\'installer ufficiale'\n\t\t),\n\t\t', ed eseguitelo.'\n\t),\n\tObject(preact_min[\"h\"])('img', { src: 'https://i.imgur.com/mDZSqjV.png', alt: '' }),\n\tObject(preact_min[\"h\"])(\n\t\t'p',\n\t\tnull,\n\t\t' Dovrebbe comparire questa schermata. Cliccate su ',\n\t\tObject(preact_min[\"h\"])(\n\t\t\t'code',\n\t\t\tnull,\n\t\t\t'Install'\n\t\t),\n\t\t', poi scegliete una cartella di installazione (ricordatevela!) e poi ',\n\t\tObject(preact_min[\"h\"])(\n\t\t\t'code',\n\t\t\tnull,\n\t\t\t'Continue'\n\t\t),\n\t\t'. Lasciate stare le altre opzioni, dovrebbero essere tutte spuntate, tranne ',\n\t\tObject(preact_min[\"h\"])(\n\t\t\t'code',\n\t\t\tnull,\n\t\t\t'For all users'\n\t\t),\n\t\t', che dovrebbe essere disattivato.'\n\t),\n\tObject(preact_min[\"h\"])('img', { src: 'https://i.imgur.com/brdw8Xy.png', alt: '' }),\n\tObject(preact_min[\"h\"])(\n\t\t'p',\n\t\tnull,\n\t\t' Aspettate che finisca il download. Pochi secondi dopo, dovrebbe finire e dovrebbe apparire un tasto',\n\t\tObject(preact_min[\"h\"])(\n\t\t\t'code',\n\t\t\tnull,\n\t\t\t'Continue'\n\t\t),\n\t\t'. Premetelo.'\n\t),\n\tObject(preact_min[\"h\"])('img', { src: 'https://i.imgur.com/aPTwrxz.png', alt: '' }),\n\tObject(preact_min[\"h\"])(\n\t\t'p',\n\t\tnull,\n\t\t' Dovrebbe apparirvi questa finestra. L\\'installer di MinGW \\xE8 una specie di gestore pacchetti (tipo ',\n\t\tObject(preact_min[\"h\"])(\n\t\t\t'code',\n\t\t\tnull,\n\t\t\t'apt'\n\t\t),\n\t\t' su Ubuntu); potete scegliere quali pacchetti installare, e quindi quali funzionalit\\xE0.'\n\t),\n\tObject(preact_min[\"h\"])('img', { src: 'https://i.imgur.com/5QLSkFN.png', alt: '' }),\n\tObject(preact_min[\"h\"])(\n\t\t'p',\n\t\tnull,\n\t\t' Nel nostro caso, dovrebbero servirci ',\n\t\tObject(preact_min[\"h\"])(\n\t\t\t'code',\n\t\t\tnull,\n\t\t\t'mingw32-base-bin'\n\t\t),\n\t\t' (per il C e alcune librerie C++) e',\n\t\tObject(preact_min[\"h\"])(\n\t\t\t'code',\n\t\t\tnull,\n\t\t\t'mingw32-gcc-g++-bin'\n\t\t),\n\t\t' (per il C++). Cliccate, quindi, sui due quadratini corrispondenti, e premete',\n\t\tObject(preact_min[\"h\"])(\n\t\t\t'code',\n\t\t\tnull,\n\t\t\t'Mark for Installation'\n\t\t),\n\t\t'. Dovrebbe comparire una freccia gialla sul quadratino.'\n\t),\n\tObject(preact_min[\"h\"])('img', { src: 'https://i.imgur.com/zP74nks.png', alt: '' }),\n\tObject(preact_min[\"h\"])(\n\t\t'p',\n\t\tnull,\n\t\t' Ora, \\xE8 il momento di installare i pacchetti. Aprite il men\\xF9 ',\n\t\tObject(preact_min[\"h\"])(\n\t\t\t'code',\n\t\t\tnull,\n\t\t\t'Installation'\n\t\t),\n\t\t', poi premete',\n\t\tObject(preact_min[\"h\"])(\n\t\t\t'code',\n\t\t\tnull,\n\t\t\t'Apply Changes'\n\t\t),\n\t\t', e di nuovo ',\n\t\tObject(preact_min[\"h\"])(\n\t\t\t'code',\n\t\t\tnull,\n\t\t\t'Apply'\n\t\t),\n\t\t'.'\n\t),\n\tObject(preact_min[\"h\"])('img', { src: 'https://i.imgur.com/jp4uz5B.png', alt: '' }),\n\tObject(preact_min[\"h\"])(\n\t\t'p',\n\t\tnull,\n\t\t' Lasciate che scarichi, ci vorr\\xE0 un po\\'. Guardatevi un video nel frattempo, fatevi una partitina a qualcosa, tornate dopo circa 10 minuti.'\n\t),\n\tObject(preact_min[\"h\"])('img', { src: 'https://i.imgur.com/Lq9IepY.png', alt: '' }),\n\tObject(preact_min[\"h\"])(\n\t\t'p',\n\t\tnull,\n\t\t' Una volta installato, dobbiamo aggiungere ',\n\t\tObject(preact_min[\"h\"])(\n\t\t\t'code',\n\t\t\tnull,\n\t\t\t'g++'\n\t\t),\n\t\t' ai programmi eseguibili da Prompt dei Comandi: premete il tasto ',\n\t\tObject(preact_min[\"h\"])(\n\t\t\t'kbd',\n\t\t\tnull,\n\t\t\t'Windows'\n\t\t),\n\t\t', e scrivete ',\n\t\tObject(preact_min[\"h\"])(\n\t\t\t'code',\n\t\t\tnull,\n\t\t\t'PATH'\n\t\t),\n\t\t'. Windows dovrebbe trovarvi automaticamente quell\\'opzione.'\n\t),\n\tObject(preact_min[\"h\"])('img', { src: 'https://i.imgur.com/dy3b5Ub.png', alt: '' }),\n\tObject(preact_min[\"h\"])(\n\t\t'p',\n\t\tnull,\n\t\t' Dentro la finestra di ',\n\t\tObject(preact_min[\"h\"])(\n\t\t\t'i',\n\t\t\tnull,\n\t\t\t'Propriet\\xE0 del Sistema'\n\t\t),\n\t\t', premete ',\n\t\tObject(preact_min[\"h\"])(\n\t\t\t'code',\n\t\t\tnull,\n\t\t\t'Variabili d\\'ambiente'\n\t\t),\n\t\t'.'\n\t),\n\tObject(preact_min[\"h\"])('img', { src: 'https://i.imgur.com/FjYpT1n.png', alt: '' }),\n\tObject(preact_min[\"h\"])(\n\t\t'p',\n\t\tnull,\n\t\t' Trovate la variabile d\\'ambiente globale ',\n\t\tObject(preact_min[\"h\"])(\n\t\t\t'code',\n\t\t\tnull,\n\t\t\t'Path'\n\t\t),\n\t\t', e fateci doppio click per modificarla.'\n\t),\n\tObject(preact_min[\"h\"])('img', { src: 'https://i.imgur.com/klZQ9So.png', alt: '' }),\n\tObject(preact_min[\"h\"])(\n\t\t'p',\n\t\tnull,\n\t\t' Ora dovreste vedere l\\'elenco di tutte le cartelle contenenti programmi eseguibili da terminale: dobbiamo aggiungere quella di MinGW! Premete ',\n\t\tObject(preact_min[\"h\"])(\n\t\t\t'code',\n\t\t\tnull,\n\t\t\t'Sfoglia'\n\t\t),\n\t\t'.'\n\t),\n\tObject(preact_min[\"h\"])('img', { src: 'https://i.imgur.com/F6lBCqS.png', alt: '' }),\n\tObject(preact_min[\"h\"])(\n\t\t'p',\n\t\tnull,\n\t\t' Trovate la cartella in cui avete installato MinGW (vi avevo detto di ricordarvela!); entrateci, poi selezionate la sottocartella ',\n\t\tObject(preact_min[\"h\"])(\n\t\t\t'code',\n\t\t\tnull,\n\t\t\t'bin'\n\t\t),\n\t\t' e premete ',\n\t\tObject(preact_min[\"h\"])(\n\t\t\t'code',\n\t\t\tnull,\n\t\t\t'OK'\n\t\t),\n\t\t' su tutte le finestre che avete aperto fino ad ora, chiudendole.'\n\t),\n\tObject(preact_min[\"h\"])(\n\t\t'p',\n\t\tnull,\n\t\t' Complimenti! Avete installato MinGW e potete compilare programmi C e C++ da Windows! Avete a disposizione',\n\t\tObject(preact_min[\"h\"])(\n\t\t\t'code',\n\t\t\tnull,\n\t\t\t'gcc'\n\t\t),\n\t\t' e ',\n\t\tObject(preact_min[\"h\"])(\n\t\t\t'code',\n\t\t\tnull,\n\t\t\t'g++'\n\t\t),\n\t\t' sul Prompt dei Comandi, e potete finalmente creare dei file .exe! '\n\t)\n);\n\nvar mingwinstall_MingwInstall = function (_Component) {\n\tmingwinstall__inherits(MingwInstall, _Component);\n\n\tfunction MingwInstall() {\n\t\tmingwinstall__classCallCheck(this, MingwInstall);\n\n\t\treturn mingwinstall__possibleConstructorReturn(this, _Component.apply(this, arguments));\n\t}\n\n\tMingwInstall.prototype.render = function render() {\n\t\t//Imported from unimore-info-wiki\n\t\treturn Object(preact_min[\"h\"])(\n\t\t\t'div',\n\t\t\t{ style: mingwinstall_default.a.mingwinstall },\n\t\t\tmingwinstall__ref,\n\t\t\tmingwinstall__ref2\n\t\t);\n\t};\n\n\treturn MingwInstall;\n}(preact_min[\"Component\"]);\n\n\n// EXTERNAL MODULE: ./components/copyright.css\nvar copyright = __webpack_require__(\"qMTX\");\nvar copyright_default = /*#__PURE__*/__webpack_require__.n(copyright);\n\n// CONCATENATED MODULE: ./components/copyright.js\n\n\nfunction copyright__classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction copyright__possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction copyright__inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n\n\n\n\nvar copyright__ref = Object(preact_min[\"h\"])(\n\t'a',\n\t{ href: 'https://creativecommons.org/licenses/by-sa/4.0/' },\n\t'CC BY-SA 4.0'\n);\n\nvar copyright__ref2 = Object(preact_min[\"h\"])(\n\t'a',\n\t{ href: 'https://github.com/Steffo99/appuntiweb' },\n\t'Codice sorgente'\n);\n\nvar copyright_Copyright = function (_Component) {\n\tcopyright__inherits(Copyright, _Component);\n\n\tfunction Copyright() {\n\t\tcopyright__classCallCheck(this, Copyright);\n\n\t\treturn copyright__possibleConstructorReturn(this, _Component.apply(this, arguments));\n\t}\n\n\tCopyright.prototype.render = function render() {\n\t\treturn Object(preact_min[\"h\"])(\n\t\t\t'div',\n\t\t\t{ 'class': copyright_default.a.copyright },\n\t\t\t'\\xA9 2019 - Stefano Pigozzi - ',\n\t\t\tcopyright__ref,\n\t\t\t' - ',\n\t\t\tcopyright__ref2\n\t\t);\n\t};\n\n\treturn Copyright;\n}(preact_min[\"Component\"]);\n\n\n// EXTERNAL MODULE: ./pages/statistica.css\nvar statistica = __webpack_require__(\"WViY\");\nvar statistica_default = /*#__PURE__*/__webpack_require__.n(statistica);\n\n// EXTERNAL MODULE: ./components/theorem.css\nvar theorem = __webpack_require__(\"oNmJ\");\nvar theorem_default = /*#__PURE__*/__webpack_require__.n(theorem);\n\n// CONCATENATED MODULE: ./components/theorem.js\nfunction theorem__classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction theorem__possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction theorem__inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n\n\n\n\nvar theorem_Theorem = function (_Panel) {\n theorem__inherits(Theorem, _Panel);\n\n function Theorem() {\n theorem__classCallCheck(this, Theorem);\n\n return theorem__possibleConstructorReturn(this, _Panel.apply(this, arguments));\n }\n\n Theorem.prototype.getStyle = function getStyle() {\n return _Panel.prototype.getStyle.call(this) + \" \" + theorem_default.a.theorem;\n };\n\n return Theorem;\n}(panel_Panel);\n\n\n// EXTERNAL MODULE: ./components/hypothesis.css\nvar hypothesis = __webpack_require__(\"pRAn\");\nvar hypothesis_default = /*#__PURE__*/__webpack_require__.n(hypothesis);\n\n// CONCATENATED MODULE: ./components/hypothesis.js\n\n\nfunction hypothesis__classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction hypothesis__possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction hypothesis__inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n\n\n\n\nvar hypothesis__ref = Object(preact_min[\"h\"])(\n \"h4\",\n null,\n \"Ipotesi\"\n);\n\nvar hypothesis_Hypothesis = function (_Component) {\n hypothesis__inherits(Hypothesis, _Component);\n\n function Hypothesis() {\n hypothesis__classCallCheck(this, Hypothesis);\n\n return hypothesis__possibleConstructorReturn(this, _Component.apply(this, arguments));\n }\n\n Hypothesis.prototype.render = function render() {\n return Object(preact_min[\"h\"])(\n \"div\",\n { \"class\": hypothesis_default.a.hypothesis },\n hypothesis__ref,\n this.props.children\n );\n };\n\n return Hypothesis;\n}(preact_min[\"Component\"]);\n\n\n// EXTERNAL MODULE: ./components/thesis.css\nvar thesis = __webpack_require__(\"J9SO\");\nvar thesis_default = /*#__PURE__*/__webpack_require__.n(thesis);\n\n// CONCATENATED MODULE: ./components/thesis.js\n\n\nfunction thesis__classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction thesis__possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction thesis__inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n\n\n\n\nvar thesis__ref = Object(preact_min[\"h\"])(\n \"h4\",\n null,\n \"Tesi\"\n);\n\nvar thesis_Thesis = function (_Component) {\n thesis__inherits(Thesis, _Component);\n\n function Thesis() {\n thesis__classCallCheck(this, Thesis);\n\n return thesis__possibleConstructorReturn(this, _Component.apply(this, arguments));\n }\n\n Thesis.prototype.render = function render() {\n return Object(preact_min[\"h\"])(\n \"div\",\n { \"class\": thesis_default.a.thesis },\n thesis__ref,\n this.props.children\n );\n };\n\n return Thesis;\n}(preact_min[\"Component\"]);\n\n\n// EXTERNAL MODULE: ./components/proof.css\nvar proof = __webpack_require__(\"Oqef\");\nvar proof_default = /*#__PURE__*/__webpack_require__.n(proof);\n\n// CONCATENATED MODULE: ./components/proof.js\n\n\nfunction proof__classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction proof__possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction proof__inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n\n\n\n\nvar proof__ref = Object(preact_min[\"h\"])(\n \"h4\",\n null,\n \"Dimostrazione\"\n);\n\nvar proof_Proof = function (_Component) {\n proof__inherits(Proof, _Component);\n\n function Proof() {\n proof__classCallCheck(this, Proof);\n\n return proof__possibleConstructorReturn(this, _Component.apply(this, arguments));\n }\n\n Proof.prototype.render = function render() {\n return Object(preact_min[\"h\"])(\n \"div\",\n { \"class\": proof_default.a.proof },\n proof__ref,\n this.props.children\n );\n };\n\n return Proof;\n}(preact_min[\"Component\"]);\n\n\n// EXTERNAL MODULE: ./components/example.css\nvar example = __webpack_require__(\"Xa+Z\");\nvar example_default = /*#__PURE__*/__webpack_require__.n(example);\n\n// CONCATENATED MODULE: ./components/example.js\n\n\nfunction example__classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction example__possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction example__inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n\n\n\n\nvar example_Example = function (_Component) {\n example__inherits(Example, _Component);\n\n function Example() {\n example__classCallCheck(this, Example);\n\n return example__possibleConstructorReturn(this, _Component.apply(this, arguments));\n }\n\n Example.prototype.render = function render() {\n return Object(preact_min[\"h\"])(\n \"blockquote\",\n { \"class\": example_default.a.example },\n this.props.children\n );\n };\n\n return Example;\n}(preact_min[\"Component\"]);\n\n\n// CONCATENATED MODULE: ./pages/statistica.js\nvar statistica__templateObject = statistica__taggedTemplateLiteralLoose(['P(E) = \\frac{casi favorevoli}{casi possibili}'], ['P(E) = \\\\frac{casi\\\\ favorevoli}{casi\\\\ possibili}']),\n statistica__templateObject2 = statistica__taggedTemplateLiteralLoose(['P(E) = \\frac{successi}{prove totali}'], ['P(E) = \\\\frac{successi}{prove\\\\ totali}']),\n statistica__templateObject3 = statistica__taggedTemplateLiteralLoose(['Omega = left { 1, 2, 3, 4, 5, 6 \\right }'], ['\\\\Omega = \\\\left \\\\{ 1, 2, 3, 4, 5, 6 \\\\right \\\\}']),\n statistica__templateObject4 = statistica__taggedTemplateLiteralLoose(['omega = 1'], ['\\\\omega = 1']),\n statistica__templateObject5 = statistica__taggedTemplateLiteralLoose(['E = left { 1, 2 \\right }'], ['E = \\\\left \\\\{ 1, 2 \\\\right \\\\}']),\n statistica__templateObject6 = statistica__taggedTemplateLiteralLoose(['\\bar{E} = left { 3, 4, 5, 6 \\right }'], ['\\\\bar{E} = \\\\left \\\\{ 3, 4, 5, 6 \\\\right \\\\}']),\n statistica__templateObject7 = statistica__taggedTemplateLiteralLoose(['E cap F = left { 1 \\right }'], ['E \\\\cap F = \\\\left \\\\{ 1 \\\\right \\\\}']),\n statistica__templateObject8 = statistica__taggedTemplateLiteralLoose(['E cup F = left { 1, 2, 3, 4 \\right }'], ['E \\\\cup F = \\\\left \\\\{ 1, 2, 3, 4 \\\\right \\\\}']),\n statistica__templateObject9 = statistica__taggedTemplateLiteralLoose(['E setminus F = E cap \\bar{F}'], ['E \\\\setminus F = E \\\\cap \\\\bar{F}']),\n statistica__templateObject10 = statistica__taggedTemplateLiteralLoose(['E subseteq F'], ['E \\\\subseteq F']),\n statistica__templateObject11 = statistica__taggedTemplateLiteralLoose(['E = emptyset'], ['E = \\\\emptyset']),\n statistica__templateObject12 = statistica__taggedTemplateLiteralLoose(['E cap F = emptyset'], ['E \\\\cap F = \\\\emptyset']),\n statistica__templateObject13 = statistica__taggedTemplateLiteralLoose(['mathcal{F}'], ['\\\\mathcal{F}']),\n statistica__templateObject14 = statistica__taggedTemplateLiteralLoose(['sigma'], ['\\\\sigma']),\n statistica__templateObject15 = statistica__taggedTemplateLiteralLoose(['Omega in mathcal{F}'], ['\\\\Omega \\\\in \\\\mathcal{F}']),\n statistica__templateObject16 = statistica__taggedTemplateLiteralLoose(['E in mathcal{F} implies \\bar{E} in mathcal{F}'], ['E \\\\in \\\\mathcal{F} \\\\implies \\\\bar{E} \\\\in \\\\mathcal{F}']),\n statistica__templateObject17 = statistica__taggedTemplateLiteralLoose(['(E, F) in mathcal{F} implies (E cup F, E cap F) in mathcal{F}'], ['(E, F) \\\\in \\\\mathcal{F} \\\\implies (E \\\\cup F, E \\\\cap F) \\\\in \\\\mathcal{F}']),\n statistica__templateObject18 = statistica__taggedTemplateLiteralLoose(['E in mathcal{F} implies mathcal{F} = { emptyset, E, \\bar{E}, Omega }'], ['E \\\\in \\\\mathcal{F} \\\\implies \\\\mathcal{F} = \\\\{ \\\\emptyset, E, \\\\bar{E}, \\\\Omega \\\\}']),\n statistica__templateObject19 = statistica__taggedTemplateLiteralLoose(['E_i'], ['E_i']),\n statistica__templateObject20 = statistica__taggedTemplateLiteralLoose(['E_1'], ['E_1']),\n statistica__templateObject21 = statistica__taggedTemplateLiteralLoose(['E_2'], ['E_2']),\n statistica__templateObject22 = statistica__taggedTemplateLiteralLoose(['E_3'], ['E_3']),\n statistica__templateObject23 = statistica__taggedTemplateLiteralLoose(['E_n'], ['E_n']),\n statistica__templateObject24 = statistica__taggedTemplateLiteralLoose(['\\forall E in mathcal{F}, 0 leq P(E) leq 1'], ['\\\\forall E \\\\in \\\\mathcal{F}, 0 \\\\leq P(E) \\\\leq 1']),\n statistica__templateObject25 = statistica__taggedTemplateLiteralLoose(['P(Omega) = 1'], ['P(\\\\Omega) = 1']),\n statistica__templateObject26 = statistica__taggedTemplateLiteralLoose(['P left ( \\bigcup_i E_i \\right ) = sum_i P ( E_i )'], ['P \\\\left ( \\\\bigcup_i E_i \\\\right ) = \\\\sum_i P ( E_i )']),\n statistica__templateObject27 = statistica__taggedTemplateLiteralLoose(['P(\\bar{E}) = 1 - P({E})'], ['P(\\\\bar{E}) = 1 - P({E})']),\n statistica__templateObject28 = statistica__taggedTemplateLiteralLoose(['F subseteq E implies P(F) leq P(E)'], ['F \\\\subseteq E \\\\implies P(F) \\\\leq P(E)']),\n statistica__templateObject29 = statistica__taggedTemplateLiteralLoose(['P(E cup F) = P(E) + P(F) - P(E cap F)'], ['P(E \\\\cup F) = P(E) + P(F) - P(E \\\\cap F)']),\n statistica__templateObject30 = statistica__taggedTemplateLiteralLoose(['P(E) = \\frac{len(E)}{len(Omega)}'], ['P(E) = \\\\frac{len(E)}{len(\\\\Omega)}']),\n statistica__templateObject31 = statistica__taggedTemplateLiteralLoose(['\\boldsymbol{D}_{n, k} = \\frac{n!}{(n - k)!}'], ['\\\\boldsymbol{D}_{n, k} = \\\\frac{n!}{(n - k)!}']),\n statistica__templateObject32 = statistica__taggedTemplateLiteralLoose(['\\boldsymbol{D}^{r}_{n, k} = n^k'], ['\\\\boldsymbol{D}^{r}_{n, k} = n^k']),\n statistica__templateObject33 = statistica__taggedTemplateLiteralLoose(['\\boldsymbol{C}_{n, k} = \\binom{n}{k} = \\frac{n!}{(k)! cdot (n - k)!}'], ['\\\\boldsymbol{C}_{n, k} = \\\\binom{n}{k} = \\\\frac{n!}{(k)! \\\\cdot (n - k)!}']),\n statistica__templateObject34 = statistica__taggedTemplateLiteralLoose(['\\boldsymbol{C}^{r}_{n, k} = \\binom{n + k - 1}{k} = \\frac{(n + k - 1)!}{(k)! cdot (n - 1)!}'], ['\\\\boldsymbol{C}^{r}_{n, k} = \\\\binom{n + k - 1}{k} = \\\\frac{(n + k - 1)!}{(k)! \\\\cdot (n - 1)!}']),\n statistica__templateObject35 = statistica__taggedTemplateLiteralLoose(['\\boldsymbol{P}_n = n!'], ['\\\\boldsymbol{P}_n = n!']),\n statistica__templateObject36 = statistica__taggedTemplateLiteralLoose(['P(E|F) = \\frac{P(E cap F)}{P(F)}'], ['P(E|F) = \\\\frac{P(E \\\\cap F)}{P(F)}']),\n statistica__templateObject37 = statistica__taggedTemplateLiteralLoose(['E cap F = emptyset Longleftrightarrow P(E|F) = P(F|E) = 0'], ['E \\\\cap F = \\\\emptyset \\\\Longleftrightarrow P(E|F) = P(F|E) = 0']),\n statistica__templateObject38 = statistica__taggedTemplateLiteralLoose(['P(E_1 cap \\times cap E_n) = P(E_1) \\times P(E_2 | E_1) \\times dots \\times P(E_n | E_1 cap E_2 cap dots cap E_{n-1})'], ['P(E_1 \\\\cap \\\\times \\\\cap E_n) = P(E_1) \\\\times P(E_2 | E_1) \\\\times \\\\dots \\\\times P(E_n | E_1 \\\\cap E_2 \\\\cap \\\\dots \\\\cap E_{n-1})']),\n statistica__templateObject39 = statistica__taggedTemplateLiteralLoose(['P(F) = sum_{i} P(F|E_i) cdot P(E_i)'], ['P(F) = \\\\sum_{i} P(F|E_i) \\\\cdot P(E_i)']),\n statistica__templateObject40 = statistica__taggedTemplateLiteralLoose(['P(F|G) = sum_i P(F|E_i cap G) cdot P(E_i | G)'], ['P(F|G) = \\\\sum_i P(F|E_i \\\\cap G) \\\\cdot P(E_i | G)']),\n statistica__templateObject41 = statistica__taggedTemplateLiteralLoose(['P(E_h | F) = \\frac{P(F | E_h) cdot P(E_h)}{P(F)}'], ['P(E_h | F) = \\\\frac{P(F | E_h) \\\\cdot P(E_h)}{P(F)}']),\n statistica__templateObject42 = statistica__taggedTemplateLiteralLoose(['P(E cap F) = P(E) cdot P(F) Longleftrightarrow P(E|F) = P(E) Longleftrightarrow P(F|E) = P(F)'], ['P(E \\\\cap F) = P(E) \\\\cdot P(F) \\\\Longleftrightarrow P(E|F) = P(E) \\\\Longleftrightarrow P(F|E) = P(F)']),\n statistica__templateObject43 = statistica__taggedTemplateLiteralLoose(['P(E cap F cap G) = P(E) cdot P(F) cdot P(G)'], ['P(E \\\\cap F \\\\cap G) = P(E) \\\\cdot P(F) \\\\cdot P(G)']),\n statistica__templateObject44 = statistica__taggedTemplateLiteralLoose(['X(omega) : Omega \\to mathbb{R}'], ['X(\\\\omega) : \\\\Omega \\\\to \\\\mathbb{R}']),\n statistica__templateObject45 = statistica__taggedTemplateLiteralLoose(['A_t = { omega | X(omega) leq t }'], ['A_t = \\\\{ \\\\omega | X(\\\\omega) \\\\leq t \\\\}']),\n statistica__templateObject46 = statistica__taggedTemplateLiteralLoose(['\\forall t in mathbb{R}, A_t in mathcal{F}'], ['\\\\forall t \\\\in \\\\mathbb{R}, A_t \\\\in \\\\mathcal{F}']),\n statistica__templateObject47 = statistica__taggedTemplateLiteralLoose(['p_X : X \\to [0, 1]'], ['p_X : X \\\\to [0, 1]']),\n statistica__templateObject48 = statistica__taggedTemplateLiteralLoose(['p_X (x) = \\begin{cases}\\n P([X = x]) quad se X mapsto x \\\\\\n 0 qquad qquad quad se X \\notmapsto x\\n end{cases}'], ['p_X (x) = \\\\begin{cases}\\n P([X = x]) \\\\quad se\\\\ X \\\\mapsto x \\\\\\\\\\n 0 \\\\qquad \\\\qquad \\\\quad se\\\\ X \\\\not\\\\mapsto x\\n \\\\end{cases}']),\n statistica__templateObject49 = statistica__taggedTemplateLiteralLoose(['f_X : X \\to [0, 1]'], ['f_X : X \\\\to [0, 1]']),\n statistica__templateObject50 = statistica__taggedTemplateLiteralLoose(['P([a < X leq b]) = int_a^b f_X (x) dx'], ['P([a < X \\\\leq b]) = \\\\int_a^b f_X (x) dx']),\n statistica__templateObject51 = statistica__taggedTemplateLiteralLoose(['F_X : mathbb{R} \\to [0, 1]'], ['F_X : \\\\mathbb{R} \\\\to [0, 1]']),\n statistica__templateObject52 = statistica__taggedTemplateLiteralLoose(['A_t'], ['A_t']),\n statistica__templateObject53 = statistica__taggedTemplateLiteralLoose(['F_X (t) = P(A_t) = \\begin{cases}\\n sum_{i = 0}^{t} p_X (x_i) quad nel discreto\\\\\\n \\\\\\n int_{-infty}^t f_X (x) dx quad nel continuo\\n end{cases}'], ['F_X (t) = P(A_t) = \\\\begin{cases}\\n \\\\sum_{i = 0}^{t} p_X (x_i) \\\\quad nel\\\\ discreto\\\\\\\\\\n \\\\\\\\\\n \\\\int_{-\\\\infty}^t f_X (x) dx \\\\quad nel\\\\ continuo\\n \\\\end{cases}']),\n statistica__templateObject54 = statistica__taggedTemplateLiteralLoose(['\\forall x_0 in mathbb{R}, F_X (x_0) = lim_{t \\to x^+_0} F_X (t)'], ['\\\\forall x_0 \\\\in \\\\mathbb{R}, F_X (x_0) = \\\\lim_{t \\\\to x^+_0} F_X (t)']),\n statistica__templateObject55 = statistica__taggedTemplateLiteralLoose(['P([X = x_0]) = lim_{t \\to x^+_0} F_X (t) - lim_{t \\to x^-_0} F_X (t)'], ['P([X = x_0]) = \\\\lim_{t \\\\to x^+_0} F_X (t) - \\\\lim_{t \\\\to x^-_0} F_X (t)']),\n statistica__templateObject56 = statistica__taggedTemplateLiteralLoose(['f_Y (y) = int_{g(a)}^{g(b)} f_X ( g^{-1} (x) ) g^{-2} (x)'], ['f_Y (y) = \\\\int_{g(a)}^{g(b)} f_X ( g^{-1} (x) ) g^{-2} (x)']),\n statistica__templateObject57 = statistica__taggedTemplateLiteralLoose(['E(X) = int_0^{+infty} (1 - F_X (t)) dt - int_{-infty}^{0} F_X (t) dt'], ['E(X) = \\\\int_0^{+infty} (1 - F_X (t)) dt - \\\\int_{-\\\\infty}^{0} F_X (t) dt']),\n statistica__templateObject58 = statistica__taggedTemplateLiteralLoose(['E(X) = sum_i P(X = x_i) cdot x_i'], ['E(X) = \\\\sum_i P(X = x_i) \\\\cdot x_i']),\n statistica__templateObject59 = statistica__taggedTemplateLiteralLoose(['E(X) = int_{-infty}^{+infty} f_X (x) cdot x cdot dx'], ['E(X) = \\\\int_{-\\\\infty}^{+\\\\infty} f_X (x) \\\\cdot x \\\\cdot dx']),\n statistica__templateObject60 = statistica__taggedTemplateLiteralLoose(['x_{alpha}'], ['x_{\\\\alpha}']),\n statistica__templateObject61 = statistica__taggedTemplateLiteralLoose(['0 leq alpha leq 1'], ['0 \\\\leq \\\\alpha \\\\leq 1']),\n statistica__templateObject62 = statistica__taggedTemplateLiteralLoose(['P([X < x_{alpha}]) leq alpha leq P([X leq x_{alpha}])'], ['P([X < x_{\\\\alpha}]) \\\\leq \\\\alpha \\\\leq P([X \\\\leq x_{\\\\alpha}])']),\n statistica__templateObject63 = statistica__taggedTemplateLiteralLoose(['x_{0.5}'], ['x_{0.5}']),\n statistica__templateObject64 = statistica__taggedTemplateLiteralLoose(['x_{0.25}'], ['x_{0.25}']),\n statistica__templateObject65 = statistica__taggedTemplateLiteralLoose(['x_{0.75}'], ['x_{0.75}']),\n statistica__templateObject66 = statistica__taggedTemplateLiteralLoose(['\\frac{n}{100}'], ['\\\\frac{n}{100}']),\n statistica__templateObject67 = statistica__taggedTemplateLiteralLoose(['Var(X) = E( (X - E(X) )^2 ) = E ( X^2 ) - (E(X))^2'], ['Var(X) = E( (X - E(X) )^2 ) = E ( X^2 ) - (E(X))^2']),\n statistica__templateObject68 = statistica__taggedTemplateLiteralLoose(['\\forall k > 0, P([X geq k]) leq \\frac{E(X)}{k}'], ['\\\\forall k > 0, P([X \\\\geq k]) \\\\leq \\\\frac{E(X)}{k}']),\n statistica__templateObject69 = statistica__taggedTemplateLiteralLoose(['P(X < k)'], ['P(X < k)']),\n statistica__templateObject70 = statistica__taggedTemplateLiteralLoose(['P(X geq k)'], ['P(X \\\\geq k)']),\n statistica__templateObject71 = statistica__taggedTemplateLiteralLoose(['E(X) = overline{k} cdot P(X < k) + k cdot P(X geq k)'], ['E(X) = \\\\overline{k} \\\\cdot P(X < k) + k \\\\cdot P(X \\\\geq k)']),\n statistica__templateObject72 = statistica__taggedTemplateLiteralLoose(['epsilon'], ['\\\\epsilon']),\n statistica__templateObject73 = statistica__taggedTemplateLiteralLoose(['\\frac{Var(X)}{epsilon^2}'], ['\\\\frac{Var(X)}{\\\\epsilon^2}']),\n statistica__templateObject74 = statistica__taggedTemplateLiteralLoose(['\\forall epsilon > 0, P([ left| X - E(X) \\right| geq epsilon]) leq \\frac{Var(X)}{epsilon^2}'], ['\\\\forall \\\\epsilon > 0, P([ \\\\left| X - E(X) \\\\right| \\\\geq \\\\epsilon]) \\\\leq \\\\frac{Var(X)}{\\\\epsilon^2}']),\n statistica__templateObject75 = statistica__taggedTemplateLiteralLoose(['\\forall epsilon > 0, P([ left| X - E(X) \\right| < epsilon]) geq 1 - \\frac{Var(X)}{epsilon^2}'], ['\\\\forall \\\\epsilon > 0, P([ \\\\left| X - E(X) \\\\right| < \\\\epsilon]) \\\\geq 1 - \\\\frac{Var(X)}{\\\\epsilon^2}']),\n statistica__templateObject76 = statistica__taggedTemplateLiteralLoose(['mu_k = E ( X^k ) = \\begin{cases}\\n sum_i x_i^k p_X (x_i) qquad nel discreto\\\\\\n \\\\\\n int_{-infty}^{+infty} x^k f_X (x) dx qquad nel continuo\\n end{cases}'], ['\\\\mu_k = E ( X^k ) = \\\\begin{cases}\\n \\\\sum_i x_i^k p_X (x_i) \\\\qquad nel\\\\ discreto\\\\\\\\\\n \\\\\\\\\\n \\\\int_{-\\\\infty}^{+\\\\infty} x^k f_X (x) dx \\\\qquad nel\\\\ continuo\\n \\\\end{cases}']),\n statistica__templateObject77 = statistica__taggedTemplateLiteralLoose(['m_X (t) = E( e^{t cdot X} )'], ['m_X (t) = E( e^{t \\\\cdot X} )']),\n statistica__templateObject78 = statistica__taggedTemplateLiteralLoose(['H_X (t) = E ( e^{i cdot t cdot X} )'], ['H_X (t) = E ( e^{i \\\\cdot t \\\\cdot X} )']),\n statistica__templateObject79 = statistica__taggedTemplateLiteralLoose(['X sim Distribuzione()'], ['X \\\\sim Distribuzione()']),\n statistica__templateObject80 = statistica__taggedTemplateLiteralLoose(['Ber(p)'], ['Ber(p)']),\n statistica__templateObject81 = statistica__taggedTemplateLiteralLoose(['f_X (k) : {0, 1} = \\begin{cases}\\n p quad se k = 1\\\\\\n q quad se k = 0\\\\\\n 0 quad altrimenti\\n end{cases} = p^x cdot q^{1 - k}'], ['f_X (k) : \\\\{0, 1\\\\} = \\\\begin{cases}\\n p \\\\quad se\\\\ k = 1\\\\\\\\\\n q \\\\quad se\\\\ k = 0\\\\\\\\\\n 0 \\\\quad altrimenti\\n \\\\end{cases} = p^x \\\\cdot q^{1 - k}']),\n statistica__templateObject82 = statistica__taggedTemplateLiteralLoose(['Bin(n, p)'], ['Bin(n, p)']),\n statistica__templateObject83 = statistica__taggedTemplateLiteralLoose(['f_X (k) : {0..n} = \\binom{n}{k} cdot p^k cdot q^{n - k}'], ['f_X (k) : \\\\{0..n\\\\} = \\\\binom{n}{k} \\\\cdot p^k \\\\cdot q^{n - k}']),\n statistica__templateObject84 = statistica__taggedTemplateLiteralLoose(['m_X (t) = (q + p cdot e^t) ^ n'], ['m_X (t) = (q + p \\\\cdot e^t) ^ n']),\n statistica__templateObject85 = statistica__taggedTemplateLiteralLoose(['E(X) = n cdot p'], ['E(X) = n \\\\cdot p']),\n statistica__templateObject86 = statistica__taggedTemplateLiteralLoose(['Var(X) = n cdot p cdot q'], ['Var(X) = n \\\\cdot p \\\\cdot q']),\n statistica__templateObject87 = statistica__taggedTemplateLiteralLoose(['f_X (k) : mathbb{N} = q^{k - 1} p'], ['f_X (k) : \\\\mathbb{N} = q^{k - 1} p']),\n statistica__templateObject88 = statistica__taggedTemplateLiteralLoose(['m_X (t) = \\frac{p cdot e^t}{1 - q cdot e^t}'], ['m_X (t) = \\\\frac{p \\\\cdot e^t}{1 - q \\\\cdot e^t}']),\n statistica__templateObject89 = statistica__taggedTemplateLiteralLoose(['E(X) = \\frac{1}{p}'], ['E(X) = \\\\frac{1}{p}']),\n statistica__templateObject90 = statistica__taggedTemplateLiteralLoose(['Var(X) = \\frac{q}{p^2}'], ['Var(X) = \\\\frac{q}{p^2}']),\n statistica__templateObject91 = statistica__taggedTemplateLiteralLoose(['P([X = i + j | X > i ]) = P([X = j])'], ['P([X = i + j | X > i ]) = P([X = j])']),\n statistica__templateObject92 = statistica__taggedTemplateLiteralLoose(['overline{Bin}(n, p)'], ['\\\\overline{Bin}(n, p)']),\n statistica__templateObject93 = statistica__taggedTemplateLiteralLoose(['f_X (k) : { n .. +infty } in mathbb{N} = \\binom{k - 1}{n - 1} cdot p^n cdot q^{k - n} '], ['f_X (k) : \\\\{ n .. +\\\\infty \\\\} \\\\in \\\\mathbb{N} = \\\\binom{k - 1}{n - 1} \\\\cdot p^n \\\\cdot q^{k - n} ']),\n statistica__templateObject94 = statistica__taggedTemplateLiteralLoose(['m_X (t) : { t < ln(\\frac{1}{q}) } = left( \\frac{p cdot e^t}{1 - q cdot e^t} \\right) ^n'], ['m_X (t) : \\\\{ t < ln(\\\\frac{1}{q}) \\\\} = \\\\left( \\\\frac{p \\\\cdot e^t}{1 - q \\\\cdot e^t} \\\\right) ^n']),\n statistica__templateObject95 = statistica__taggedTemplateLiteralLoose(['E(X) = \\frac{n}{p}'], ['E(X) = \\\\frac{n}{p}']),\n statistica__templateObject96 = statistica__taggedTemplateLiteralLoose(['Var(X) = \\frac{n cdot q}{p^2}'], ['Var(X) = \\\\frac{n \\\\cdot q}{p^2}']),\n statistica__templateObject97 = statistica__taggedTemplateLiteralLoose(['Geo(p)'], ['Geo(p)']),\n statistica__templateObject98 = statistica__taggedTemplateLiteralLoose(['f_X (k) : mathbb{N} = p cdot q^k '], ['f_X (k) : \\\\mathbb{N} = p \\\\cdot q^k ']),\n statistica__templateObject99 = statistica__taggedTemplateLiteralLoose(['m_X (t) : left{ t < ln left( \\frac{1}{q} \\right) \\right} = \\frac{p}{1 - q cdot e^t}'], ['m_X (t) : \\\\left\\\\{ t < ln \\\\left( \\\\frac{1}{q} \\\\right) \\\\right\\\\} = \\\\frac{p}{1 - q \\\\cdot e^t}']),\n statistica__templateObject100 = statistica__taggedTemplateLiteralLoose(['E(X) = \\frac{q}{p}'], ['E(X) = \\\\frac{q}{p}']),\n statistica__templateObject101 = statistica__taggedTemplateLiteralLoose(['f_X (k) : mathbb{N} = \\binom{k + n - 1}{n - 1} cdot p^n cdot q^k '], ['f_X (k) : \\\\mathbb{N} = \\\\binom{k + n - 1}{n - 1} \\\\cdot p^n \\\\cdot q^k ']),\n statistica__templateObject102 = statistica__taggedTemplateLiteralLoose(['m_X (t) : left{ t < ln left( \\frac{1}{q} \\right) \\right} = left( \\frac{p cdot e^t}{1 - q cdot e^t} \\right) ^n'], ['m_X (t) : \\\\left\\\\{ t < ln \\\\left( \\\\frac{1}{q} \\\\right) \\\\right\\\\} = \\\\left( \\\\frac{p \\\\cdot e^t}{1 - q \\\\cdot e^t} \\\\right) ^n']),\n statistica__templateObject103 = statistica__taggedTemplateLiteralLoose(['E(X) = \\frac{n cdot q}{p}'], ['E(X) = \\\\frac{n \\\\cdot q}{p}']),\n statistica__templateObject104 = statistica__taggedTemplateLiteralLoose(['f_X (k) : {0..n} in mathbb{N} = \\frac{\\binom{K}{k} cdot \\binom{N - K}{n - k}}{\\binom{N}{n}}'], ['f_X (k) : \\\\{0..n\\\\} \\\\in \\\\mathbb{N} = \\\\frac{\\\\binom{K}{k} \\\\cdot \\\\binom{N - K}{n - k}}{\\\\binom{N}{n}}']),\n statistica__templateObject105 = statistica__taggedTemplateLiteralLoose(['E(X) = n cdot \\frac{K}{N}'], ['E(X) = n \\\\cdot \\\\frac{K}{N}']),\n statistica__templateObject106 = statistica__taggedTemplateLiteralLoose(['Var(X) = n cdot \\frac{K}{N} cdot \\frac{N - K}{N} cdot \\frac{N - n}{N - 1}'], ['Var(X) = n \\\\cdot \\\\frac{K}{N} \\\\cdot \\\\frac{N - K}{N} \\\\cdot \\\\frac{N - n}{N - 1}']),\n statistica__templateObject107 = statistica__taggedTemplateLiteralLoose(['X sim Bin(n, p)'], ['X \\\\sim Bin(n, p)']),\n statistica__templateObject108 = statistica__taggedTemplateLiteralLoose(['n \\to +infty'], ['n \\\\to +\\\\infty']),\n statistica__templateObject109 = statistica__taggedTemplateLiteralLoose(['p \\to 0'], ['p \\\\to 0']),\n statistica__templateObject110 = statistica__taggedTemplateLiteralLoose(['E(X) = n cdot p \\to mu \\neq 0'], ['E(X) = n \\\\cdot p \\\\to \\\\mu \\\\neq 0']),\n statistica__templateObject111 = statistica__taggedTemplateLiteralLoose(['Poi(mu)'], ['Poi(\\\\mu)']),\n statistica__templateObject112 = statistica__taggedTemplateLiteralLoose(['f_X (k) : mathbb{N} = \\frac{e^{-mu} cdot mu^k}{k!}'], ['f_X (k) : \\\\mathbb{N} = \\\\frac{e^{-\\\\mu} \\\\cdot \\\\mu^k}{k!}']),\n statistica__templateObject113 = statistica__taggedTemplateLiteralLoose(['m_X (t) = e^{mu cdot (e^t - 1)}'], ['m_X (t) = e^{\\\\mu \\\\cdot (e^t - 1)}']),\n statistica__templateObject114 = statistica__taggedTemplateLiteralLoose(['E(X) = mu'], ['E(X) = \\\\mu']),\n statistica__templateObject115 = statistica__taggedTemplateLiteralLoose(['Var(X) = mu'], ['Var(X) = \\\\mu']),\n statistica__templateObject116 = statistica__taggedTemplateLiteralLoose(['E(X^2) = mu^2 + mu'], ['E(X^2) = \\\\mu^2 + \\\\mu']),\n statistica__templateObject117 = statistica__taggedTemplateLiteralLoose(['lambda'], ['\\\\lambda']),\n statistica__templateObject118 = statistica__taggedTemplateLiteralLoose(['mu = t cdot lambda'], ['\\\\mu = t \\\\cdot \\\\lambda']),\n statistica__templateObject119 = statistica__taggedTemplateLiteralLoose(['Poi(t cdot lambda)'], ['Poi(t \\\\cdot \\\\lambda)']),\n statistica__templateObject120 = statistica__taggedTemplateLiteralLoose(['Esp(lambda)'], ['Esp(\\\\lambda)']),\n statistica__templateObject121 = statistica__taggedTemplateLiteralLoose(['f_X (x) = \\begin{cases}\\n 0 qquad qquad x < 0\\\\\\n lambda cdot e^{-lambda cdot x} quad x > 0\\n end{cases}'], ['f_X (x) = \\\\begin{cases}\\n 0 \\\\qquad \\\\qquad x < 0\\\\\\\\\\n \\\\lambda \\\\cdot e^{-\\\\lambda \\\\cdot x} \\\\quad x > 0\\n \\\\end{cases}']),\n statistica__templateObject122 = statistica__taggedTemplateLiteralLoose(['F_X (t) = \\begin{cases}\\n 0 qquad qquad t < 0\\\\\\n 1 - e^{-lambda cdot t} quad t geq 0\\n end{cases}'], ['F_X (t) = \\\\begin{cases}\\n 0 \\\\qquad \\\\qquad t < 0\\\\\\\\\\n 1 - e^{-\\\\lambda \\\\cdot t} \\\\quad t \\\\geq 0\\n \\\\end{cases}']),\n statistica__templateObject123 = statistica__taggedTemplateLiteralLoose(['m_X (t) : { t | t < lambda } in mathbb{R} = \\frac{lambda}{lambda - t}'], ['m_X (t) : \\\\{ t | t < \\\\lambda \\\\} \\\\in \\\\mathbb{R} = \\\\frac{\\\\lambda}{\\\\lambda - t}']),\n statistica__templateObject124 = statistica__taggedTemplateLiteralLoose(['E(X) = \\frac{1}{lambda}'], ['E(X) = \\\\frac{1}{\\\\lambda}']),\n statistica__templateObject125 = statistica__taggedTemplateLiteralLoose(['Var(X) = \\frac{1}{lambda^2}'], ['Var(X) = \\\\frac{1}{\\\\lambda^2}']),\n statistica__templateObject126 = statistica__taggedTemplateLiteralLoose(['P([X > s + t | X > s]) = P([X > t])'], ['P([X > s + t | X > s]) = P([X > t])']),\n _templateObject127 = statistica__taggedTemplateLiteralLoose(['Gamma(n, lambda)'], ['\\\\Gamma(n, \\\\lambda)']),\n _templateObject128 = statistica__taggedTemplateLiteralLoose(['f_X (x) = \\begin{cases}\\n 0 qquad qquad qquad qquad qquad x < 0\\\\\\n \\frac{1}{(n-1)!} cdot lambda^n cdot x^{n-1} cdot e^{-lambda cdot x} quad k > 0\\n end{cases}'], ['f_X (x) = \\\\begin{cases}\\n 0 \\\\qquad \\\\qquad \\\\qquad \\\\qquad \\\\qquad x < 0\\\\\\\\\\n \\\\frac{1}{(n-1)!} \\\\cdot \\\\lambda^n \\\\cdot x^{n-1} \\\\cdot e^{-\\\\lambda \\\\cdot x} \\\\quad k > 0\\n \\\\end{cases}']),\n _templateObject129 = statistica__taggedTemplateLiteralLoose(['m_X (t) : ( t < lambda ) in mathbb{R} = left( \\frac{lambda}{lambda - t} \\right) ^alpha'], ['m_X (t) : ( t < \\\\lambda ) \\\\in \\\\mathbb{R} = \\\\left( \\\\frac{\\\\lambda}{\\\\lambda - t} \\\\right) ^\\\\alpha']),\n _templateObject130 = statistica__taggedTemplateLiteralLoose(['E(X) = \\frac{alpha}{lambda}'], ['E(X) = \\\\frac{\\\\alpha}{\\\\lambda}']),\n _templateObject131 = statistica__taggedTemplateLiteralLoose(['Var(X) = \\frac{alpha}{lambda^2}'], ['Var(X) = \\\\frac{\\\\alpha}{\\\\lambda^2}']),\n _templateObject132 = statistica__taggedTemplateLiteralLoose(['[a, b]'], ['[a, b]']),\n _templateObject133 = statistica__taggedTemplateLiteralLoose(['Uni(a, b)'], ['Uni(a, b)']),\n _templateObject134 = statistica__taggedTemplateLiteralLoose(['P(X in (c, d)) = \\frac{d - c}{b - a}'], ['P(X \\\\in (c, d)) = \\\\frac{d - c}{b - a}']),\n _templateObject135 = statistica__taggedTemplateLiteralLoose(['f_X (x) = \\begin{cases}\\n \\frac{1}{b - a} qquad a leq x leq b\\\\\\n 0 qquad quad altrimenti \\n end{cases}'], ['f_X (x) = \\\\begin{cases}\\n \\\\frac{1}{b - a} \\\\qquad a \\\\leq x \\\\leq b\\\\\\\\\\n 0 \\\\qquad \\\\quad altrimenti \\n \\\\end{cases}']),\n _templateObject136 = statistica__taggedTemplateLiteralLoose(['f_X (x) = \\begin{cases}\\n 0 qquad quad x < a \\n \\frac{1}{b - a} qquad a leq x leq b\\\\\\n 1 qquad quad x > b\\n end{cases}'], ['f_X (x) = \\\\begin{cases}\\n 0 \\\\qquad \\\\quad x < a \\n \\\\frac{1}{b - a} \\\\qquad a \\\\leq x \\\\leq b\\\\\\\\\\n 1 \\\\qquad \\\\quad x > b\\n \\\\end{cases}']),\n _templateObject137 = statistica__taggedTemplateLiteralLoose(['m_X (t) = \\frac{e^{b cdot t} - e^{a cdot t}}{(b - a) cdot t}'], ['m_X (t) = \\\\frac{e^{b \\\\cdot t} - e^{a \\\\cdot t}}{(b - a) \\\\cdot t}']),\n _templateObject138 = statistica__taggedTemplateLiteralLoose(['E(X) = \\frac{a + b}{2}'], ['E(X) = \\\\frac{a + b}{2}']),\n _templateObject139 = statistica__taggedTemplateLiteralLoose(['Var(X) = \\frac{(b - a)^2}{12}'], ['Var(X) = \\\\frac{(b - a)^2}{12}']),\n _templateObject140 = statistica__taggedTemplateLiteralLoose(['Nor(mu, sigma^2)'], ['Nor(\\\\mu, \\\\sigma^2)']),\n _templateObject141 = statistica__taggedTemplateLiteralLoose(['f_X (x) = \\frac{e^{-\\frac{(x - mu)^2}{2 sigma^2}}}{sqrt{2 pi cdot sigma^2}}'], ['f_X (x) = \\\\frac{e^{-\\\\frac{(x - \\\\mu)^2}{2 \\\\sigma^2}}}{\\\\sqrt{2 \\\\pi \\\\cdot \\\\sigma^2}}']),\n _templateObject142 = statistica__taggedTemplateLiteralLoose(['m_X (t) = e^{mu cdot t + \\frac{sigma^2 cdot t^2}{2}}'], ['m_X (t) = e^{\\\\mu \\\\cdot t + \\\\frac{\\\\sigma^2 \\\\cdot t^2}{2}}']),\n _templateObject143 = statistica__taggedTemplateLiteralLoose(['Var(X) = sigma^2'], ['Var(X) = \\\\sigma^2']),\n _templateObject144 = statistica__taggedTemplateLiteralLoose(['X sim Nor(m, v^2) implies alpha X + \\beta sim Nor(alpha m + \\beta, (alpha v)^2)'], ['X \\\\sim Nor(m, v^2) \\\\implies \\\\alpha X + \\\\beta \\\\sim Nor(\\\\alpha m + \\\\beta, (\\\\alpha v)^2)']),\n _templateObject145 = statistica__taggedTemplateLiteralLoose(['phi(z)'], ['\\\\phi(z)']),\n _templateObject146 = statistica__taggedTemplateLiteralLoose(['F_Z(z) = phi(z) = \\frac{1}{sqrt{2 pi}} int_{-infty}^{z} e^{-\\frac{x^2}{2}} dx'], ['F_Z(z) = \\\\phi(z) = \\\\frac{1}{\\\\sqrt{2 \\\\pi}} \\\\int_{-\\\\infty}^{z} e^{-\\\\frac{x^2}{2}} dx']),\n _templateObject147 = statistica__taggedTemplateLiteralLoose(['z_alpha'], ['z_\\\\alpha']),\n _templateObject148 = statistica__taggedTemplateLiteralLoose(['x_alpha = mu + z_alpha cdot sqrt{sigma^2}'], ['x_\\\\alpha = \\\\mu + z_\\\\alpha \\\\cdot \\\\sqrt{\\\\sigma^2}']),\n _templateObject149 = statistica__taggedTemplateLiteralLoose(['Z^2 sim chi^2 (v = 1)'], ['Z^2 \\\\sim \\\\chi^2 (v = 1)']),\n _templateObject150 = statistica__taggedTemplateLiteralLoose(['Gamma left( \\frac{1}{2}, \\frac{1}{2} \\right) = chi^2 (v = 1)'], ['\\\\Gamma \\\\left( \\\\frac{1}{2}, \\\\frac{1}{2} \\\\right) = \\\\chi^2 (v = 1)']),\n _templateObject151 = statistica__taggedTemplateLiteralLoose(['chi^2 (n) + chi^2 (m) = chi^2 (n + m)'], ['\\\\chi^2 (n) + \\\\chi^2 (m) = \\\\chi^2 (n + m)']),\n _templateObject152 = statistica__taggedTemplateLiteralLoose(['T(v) = \\frac{Nor(0, 1)}{sqrt{\\frac{chi^2(v)}{v}}}'], ['T(v) = \\\\frac{Nor(0, 1)}{\\\\sqrt{\\\\frac{\\\\chi^2(v)}{v}}}']),\n _templateObject153 = statistica__taggedTemplateLiteralLoose(['Ipe(N, K, n) approx Bin(n, \\frac{K}{N})'], ['Ipe(N, K, n) \\\\approx Bin(n, \\\\frac{K}{N})']),\n _templateObject154 = statistica__taggedTemplateLiteralLoose(['Bin(n, p) approx Poi(n cdot p)'], ['Bin(n, p) \\\\approx Poi(n \\\\cdot p)']),\n _templateObject155 = statistica__taggedTemplateLiteralLoose(['Bin(n, p) approx Nor(n cdot p, n cdot p cdot q)'], ['Bin(n, p) \\\\approx Nor(n \\\\cdot p, n \\\\cdot p \\\\cdot q)']),\n _templateObject156 = statistica__taggedTemplateLiteralLoose(['(k - \\frac{1}{2}, k + \\frac{1}{2})'], ['(k - \\\\frac{1}{2}, k + \\\\frac{1}{2})']),\n _templateObject157 = statistica__taggedTemplateLiteralLoose(['P(X < k) simeq P(Y leq k - \\frac{1}{2})'], ['P(X < k) \\\\simeq P(Y \\\\leq k - \\\\frac{1}{2})']),\n _templateObject158 = statistica__taggedTemplateLiteralLoose(['P(X leq k) simeq P(Y leq k + \\frac{1}{2})'], ['P(X \\\\leq k) \\\\simeq P(Y \\\\leq k + \\\\frac{1}{2})']),\n _templateObject159 = statistica__taggedTemplateLiteralLoose(['P(X geq k) simeq P(Y geq k - \\frac{1}{2})'], ['P(X \\\\geq k) \\\\simeq P(Y \\\\geq k - \\\\frac{1}{2})']),\n _templateObject160 = statistica__taggedTemplateLiteralLoose(['P(X > k) simeq P(Y geq k + \\frac{1}{2})'], ['P(X > k) \\\\simeq P(Y \\\\geq k + \\\\frac{1}{2})']),\n _templateObject161 = statistica__taggedTemplateLiteralLoose(['\\boldsymbol{X}'], ['\\\\boldsymbol{X}']),\n _templateObject162 = statistica__taggedTemplateLiteralLoose(['X, Y'], ['X, Y']),\n _templateObject163 = statistica__taggedTemplateLiteralLoose(['F_{X, Y} (x, y) = P(X leq x, Y leq y)'], ['F_{X, Y} (x, y) = P(X \\\\leq x, Y \\\\leq y)']),\n _templateObject164 = statistica__taggedTemplateLiteralLoose(['F_X (x) = P(X leq x) = lim_{y \\to +infty} F_{X, Y} (x, y)'], ['F_X (x) = P(X \\\\leq x) = \\\\lim_{y \\\\to +\\\\infty} F_{X, Y} (x, y)']),\n _templateObject165 = statistica__taggedTemplateLiteralLoose(['p_{X, Y} (x, y) = P(X = x, Y = y)'], ['p_{X, Y} (x, y) = P(X = x, Y = y)']),\n _templateObject166 = statistica__taggedTemplateLiteralLoose(['p_X (x) = sum_j p_{X, Y} (x_i, y_j)'], ['p_X (x) = \\\\sum_j p_{X, Y} (x_i, y_j)']),\n _templateObject167 = statistica__taggedTemplateLiteralLoose(['P(X_1 in A_1, dots, X_n in A_n) = P(X_1 in A_1) \\times dots \\times P(X_n in A_n)'], ['P(X_1 \\\\in A_1, \\\\dots, X_n \\\\in A_n) = P(X_1 \\\\in A_1) \\\\times \\\\dots \\\\times P(X_n \\\\in A_n)']),\n _templateObject168 = statistica__taggedTemplateLiteralLoose(['E(g(X, Y)) = sum_{i, j} g(x_i, y_i) cdot p_{X, Y} (x_i, y_i)'], ['E(g(X, Y)) = \\\\sum_{i, j} g(x_i, y_i) \\\\cdot p_{X, Y} (x_i, y_i)']),\n _templateObject169 = statistica__taggedTemplateLiteralLoose(['E(X + Y) = E(X) + E(Y)'], ['E(X + Y) = E(X) + E(Y)']),\n _templateObject170 = statistica__taggedTemplateLiteralLoose(['Cov(X, Y) = E((X - E(X) cdot (Y - E(Y)) = E(XY) - E(X) cdot E(Y)'], ['Cov(X, Y) = E((X - E(X) \\\\cdot (Y - E(Y)) = E(XY) - E(X) \\\\cdot E(Y)']),\n _templateObject171 = statistica__taggedTemplateLiteralLoose(['Cov(X, alpha) = 0'], ['Cov(X, \\\\alpha) = 0']),\n _templateObject172 = statistica__taggedTemplateLiteralLoose(['Cov(X, Y) = Cov(Y, X)'], ['Cov(X, Y) = Cov(Y, X)']),\n _templateObject173 = statistica__taggedTemplateLiteralLoose(['Cov(X, X) = Var(X)'], ['Cov(X, X) = Var(X)']),\n _templateObject174 = statistica__taggedTemplateLiteralLoose(['Cov(alpha X, \\beta Y) = alpha cdot \\beta cdot Cov(X, Y)'], ['Cov(\\\\alpha X, \\\\beta Y) = \\\\alpha \\\\cdot \\\\beta \\\\cdot Cov(X, Y)']),\n _templateObject175 = statistica__taggedTemplateLiteralLoose(['Cov(X + Y, V + W) = Cov(X, Y) + Cov(X, W) + Cov(Y, V) + Cov(Y, W)'], ['Cov(X + Y, V + W) = Cov(X, Y) + Cov(X, W) + Cov(Y, V) + Cov(Y, W)']),\n _templateObject176 = statistica__taggedTemplateLiteralLoose(['Cov(X, Y) = 0'], ['Cov(X, Y) = 0']),\n _templateObject177 = statistica__taggedTemplateLiteralLoose(['\\boldsymbol{C_X}'], ['\\\\boldsymbol{C_X}']),\n _templateObject178 = statistica__taggedTemplateLiteralLoose(['\\n \\boldsymbol{C_X} = \\n \\begin{bmatrix}\\n Var(X_1) & Cov(X_1, X_2) & Cov(X_1, X_3)\\\\\\n Cov(X_2, X_1) & Var(X_2) & Cov(X_2, X_3)\\\\\\n Cov(X_3, X_1) & Cov(X_3, X_2) & Var(X_3)\\n end{bmatrix}\\n '], ['\\n \\\\boldsymbol{C_X} = \\n \\\\begin{bmatrix}\\n Var(X_1) & Cov(X_1, X_2) & Cov(X_1, X_3)\\\\\\\\\\n Cov(X_2, X_1) & Var(X_2) & Cov(X_2, X_3)\\\\\\\\\\n Cov(X_3, X_1) & Cov(X_3, X_2) & Var(X_3)\\n \\\\end{bmatrix}\\n ']),\n _templateObject179 = statistica__taggedTemplateLiteralLoose(['\\rho_{X, Y} = \\frac{Cov(X, Y)}{sqrt{Var(X)} cdot sqrt{Var(Y)}}'], ['\\\\rho_{X, Y} = \\\\frac{Cov(X, Y)}{\\\\sqrt{Var(X)} \\\\cdot \\\\sqrt{Var(Y)}}']),\n _templateObject180 = statistica__taggedTemplateLiteralLoose(['-1 leq \\rho_{X, Y} leq 1'], ['-1 \\\\leq \\\\rho_{X, Y} \\\\leq 1']),\n _templateObject181 = statistica__taggedTemplateLiteralLoose(['Y = a X + b Longleftrightarrow | \\rho_{X, Y} | = 1'], ['Y = a X + b \\\\Longleftrightarrow | \\\\rho_{X, Y} | = 1']),\n _templateObject182 = statistica__taggedTemplateLiteralLoose(['Var(X + Y) = Var(X) + Var(Y) + 2 cdot Cov(X, Y)'], ['Var(X + Y) = Var(X) + Var(Y) + 2 \\\\cdot Cov(X, Y)']),\n _templateObject183 = statistica__taggedTemplateLiteralLoose(['Var left( sum_i X_i \\right) = sum_i Var(X_i)'], ['Var \\\\left( \\\\sum_i X_i \\\\right) = \\\\sum_i Var(X_i)']),\n _templateObject184 = statistica__taggedTemplateLiteralLoose(['M^{(k)}_n = \\frac{1}{n} cdot sum_{i = 1}^n X_i^k '], ['M^{(k)}_n = \\\\frac{1}{n} \\\\cdot \\\\sum_{i = 1}^n X_i^k ']),\n _templateObject185 = statistica__taggedTemplateLiteralLoose(['overline{X}_n'], ['\\\\overline{X}_n']),\n _templateObject186 = statistica__taggedTemplateLiteralLoose(['m = E(X)'], ['m = E(X)']),\n _templateObject187 = statistica__taggedTemplateLiteralLoose(['S_0^2 = \\frac{1}{n} cdot sum_{i = 1}^n (X_i - m)^2 = M_n^(2) - 2 cdot m cdot overline{X}_n + m^2'], ['S_0^2 = \\\\frac{1}{n} \\\\cdot \\\\sum_{i = 1}^n (X_i - m)^2 = M_n^(2) - 2 \\\\cdot m \\\\cdot \\\\overline{X}_n + m^2']),\n _templateObject188 = statistica__taggedTemplateLiteralLoose(['S_n^2 = \\frac{1}{n - 1} cdot sum_{i = 1}^n (X_i - overline{X}_n)^2 = \\frac{1}{n - 1} cdot ( n cdot M_2^{(2)} - n cdot overline{X}_n^2)'], ['S_n^2 = \\\\frac{1}{n - 1} \\\\cdot \\\\sum_{i = 1}^n (X_i - \\\\overline{X}_n)^2 = \\\\frac{1}{n - 1} \\\\cdot ( n \\\\cdot M_2^{(2)} - n \\\\cdot \\\\overline{X}_n^2)']),\n _templateObject189 = statistica__taggedTemplateLiteralLoose(['E(overline{X}_n) = E(X)'], ['E(\\\\overline{X}_n) = E(X)']),\n _templateObject190 = statistica__taggedTemplateLiteralLoose(['Var(overline{X}_n) = \\frac{Var(X)}{n}'], ['Var(\\\\overline{X}_n) = \\\\frac{Var(X)}{n}']),\n _templateObject191 = statistica__taggedTemplateLiteralLoose(['E(S_0^2) = E(S_n^2) = Var(X)'], ['E(S_0^2) = E(S_n^2) = Var(X)']),\n _templateObject192 = statistica__taggedTemplateLiteralLoose(['X sim Nor(mu, sigma^2)'], ['X \\\\sim Nor(\\\\mu, \\\\sigma^2)']),\n _templateObject193 = statistica__taggedTemplateLiteralLoose(['overline{X}_n sim Nor left( mu, \\frac{sigma^2}{n} \\right)'], ['\\\\overline{X}_n \\\\sim Nor \\\\left( \\\\mu, \\\\frac{\\\\sigma^2}{n} \\\\right)']),\n _templateObject194 = statistica__taggedTemplateLiteralLoose(['S_0^2 sim \\frac{sigma^2}{n} cdot chi^2 (n)'], ['S_0^2 \\\\sim \\\\frac{\\\\sigma^2}{n} \\\\cdot \\\\chi^2 (n)']),\n _templateObject195 = statistica__taggedTemplateLiteralLoose(['S_n^2 sim \\frac{sigma^2}{n - 1} cdot chi^2 (n-1)'], ['S_n^2 \\\\sim \\\\frac{\\\\sigma^2}{n - 1} \\\\cdot \\\\chi^2 (n-1)']),\n _templateObject196 = statistica__taggedTemplateLiteralLoose(['E(X)'], ['E(X)']),\n _templateObject197 = statistica__taggedTemplateLiteralLoose(['\\forall epsilon > 0, lim_{n \\to +infty} P( | overline{X}_n - E(X) | < epsilon) = 1'], ['\\\\forall \\\\epsilon > 0, \\\\lim_{n \\\\to +\\\\infty} P( | \\\\overline{X}_n - E(X) | < \\\\epsilon) = 1']),\n _templateObject198 = statistica__taggedTemplateLiteralLoose(['P( | overline{X}_n - E(X) | < epsilon) \\to 1'], ['P( | \\\\overline{X}_n - E(X) | < \\\\epsilon) \\\\to 1']),\n _templateObject199 = statistica__taggedTemplateLiteralLoose(['\\forall epsilon > 0, P left( lim_{n \\to +infty} | overline{X}_n - E(X) | < epsilon \\right) = 1'], ['\\\\forall \\\\epsilon > 0, P \\\\left( \\\\lim_{n \\\\to +\\\\infty} | \\\\overline{X}_n - E(X) | < \\\\epsilon \\\\right) = 1']),\n _templateObject200 = statistica__taggedTemplateLiteralLoose(['Nor(0, 1) = Phi()'], ['Nor(0, 1) = \\\\Phi()']),\n _templateObject201 = statistica__taggedTemplateLiteralLoose(['overline{X}_n approx Nor left(E(X), \\frac{Var(X)}{n} \\right)'], ['\\\\overline{X}_n \\\\approx Nor \\\\left(E(X), \\\\frac{Var(X)}{n} \\\\right)']),\n _templateObject202 = statistica__taggedTemplateLiteralLoose(['\\forall x in mathbb{R}, lim_{n \\to +infty} P left( \\frac{overline{X}_n - E(X)}{sqrt{\\frac{Var(X)}{n}}} leq x \\right) = Phi(x)'], ['\\\\forall x \\\\in \\\\mathbb{R}, \\\\lim_{n \\\\to +\\\\infty} P \\\\left( \\\\frac{\\\\overline{X}_n - E(X)}{\\\\sqrt{\\\\frac{Var(X)}{n}}} \\\\leq x \\\\right) = \\\\Phi(x)']),\n _templateObject203 = statistica__taggedTemplateLiteralLoose(['overline{Bin} (n, p) approx Nor left( \\frac{n}{p}, \\frac{n cdot (1 - p)}{p^2} \\right)'], ['\\\\overline{Bin} (n, p) \\\\approx Nor \\\\left( \\\\frac{n}{p}, \\\\frac{n \\\\cdot (1 - p)}{p^2} \\\\right)']),\n _templateObject204 = statistica__taggedTemplateLiteralLoose(['Poi(lambda) approx Nor(lambda, lambda)'], ['Poi(\\\\lambda) \\\\approx Nor(\\\\lambda, \\\\lambda)']),\n _templateObject205 = statistica__taggedTemplateLiteralLoose(['Gamma (alpha, lambda) approx Nor left( \\frac{alpha}{lambda}, \\frac{alpha}{lambda^2} \\right)'], ['\\\\Gamma (\\\\alpha, \\\\lambda) \\\\approx Nor \\\\left( \\\\frac{\\\\alpha}{\\\\lambda}, \\\\frac{\\\\alpha}{\\\\lambda^2} \\\\right)']),\n _templateObject206 = statistica__taggedTemplateLiteralLoose(['Y = sum_{i=1}^{n} X_i'], ['Y = \\\\sum_{i=1}^{n} X_i']),\n _templateObject207 = statistica__taggedTemplateLiteralLoose(['T(\\boldsymbol{X})'], ['T(\\\\boldsymbol{X})']),\n _templateObject208 = statistica__taggedTemplateLiteralLoose(['T(\\boldsymbol{X}) = \\boldsymbol{X}'], ['T(\\\\boldsymbol{X}) = \\\\boldsymbol{X}']),\n _templateObject209 = statistica__taggedTemplateLiteralLoose(['E(T_n) = \\theta'], ['E(T_n) = \\\\theta']),\n _templateObject210 = statistica__taggedTemplateLiteralLoose(['lim_{n \\to +infty} E(T_n) = \\theta'], ['\\\\lim_{n \\\\to +\\\\infty} E(T_n) = \\\\theta']),\n _templateObject211 = statistica__taggedTemplateLiteralLoose(['lim_{n \\to +infty} E((T_n - \\theta)^2) = 0'], ['\\\\lim_{n \\\\to +\\\\infty} E((T_n - \\\\theta)^2) = 0']),\n _templateObject212 = statistica__taggedTemplateLiteralLoose(['\\forall epsilon > 0, lim_{n \\to +infty} P( |T_n - \\theta| < epsilon) = 1'], ['\\\\forall \\\\epsilon > 0, \\\\lim_{n \\\\to +\\\\infty} P( |T_n - \\\\theta| < \\\\epsilon) = 1']),\n _templateObject213 = statistica__taggedTemplateLiteralLoose(['lim_{n \\to +infty} \\frac{T_n - E(T_n)}{sqrt{Var(T_n)}} sim Nor(0, 1)'], ['\\\\lim_{n \\\\to +\\\\infty} \\\\frac{T_n - E(T_n)}{\\\\sqrt{Var(T_n)}} \\\\sim Nor(0, 1)']),\n _templateObject214 = statistica__taggedTemplateLiteralLoose(['\\theta'], ['\\\\theta']),\n _templateObject215 = statistica__taggedTemplateLiteralLoose(['widehat{\\theta}_M'], ['\\\\widehat{\\\\theta}_M']),\n _templateObject216 = statistica__taggedTemplateLiteralLoose(['\\theta = g(E(X))'], ['\\\\theta = g(E(X))']),\n _templateObject217 = statistica__taggedTemplateLiteralLoose(['widehat{E(X)} = overline{X}_n'], ['\\\\widehat{E(X)} = \\\\overline{X}_n']),\n _templateObject218 = statistica__taggedTemplateLiteralLoose(['widehat{\\theta}_M = g( overline{X}_n )'], ['\\\\widehat{\\\\theta}_M = g( \\\\overline{X}_n )']),\n _templateObject219 = statistica__taggedTemplateLiteralLoose(['M_n^2'], ['M_n^2']),\n _templateObject220 = statistica__taggedTemplateLiteralLoose(['M_n^3'], ['M_n^3']),\n _templateObject221 = statistica__taggedTemplateLiteralLoose(['widehat{\\theta}_L'], ['\\\\widehat{\\\\theta}_L']),\n _templateObject222 = statistica__taggedTemplateLiteralLoose(['L'], ['L']),\n _templateObject223 = statistica__taggedTemplateLiteralLoose(['L(x_1, ..., x_n; \\theta) = prod_{i=1}^n f_X(x_i; \\theta)'], ['L(x_1, ..., x_n; \\\\theta) = \\\\prod_{i=1}^n f_X(x_i; \\\\theta)']),\n _templateObject224 = statistica__taggedTemplateLiteralLoose(['widehat{g(\\theta)}_L = g(widehat{\\theta}_L)'], ['\\\\widehat{g(\\\\theta)}_L = g(\\\\widehat{\\\\theta}_L)']),\n _templateObject225 = statistica__taggedTemplateLiteralLoose(['widehat{p}_M = widehat{p}_L = overline{X}_n'], ['\\\\widehat{p}_M = \\\\widehat{p}_L = \\\\overline{X}_n']),\n _templateObject226 = statistica__taggedTemplateLiteralLoose(['widehat{mu}_M = widehat{mu}_L = overline{X}_n'], ['\\\\widehat{\\\\mu}_M = \\\\widehat{\\\\mu}_L = \\\\overline{X}_n']),\n _templateObject227 = statistica__taggedTemplateLiteralLoose(['widehat{lambda}_M = widehat{lambda}_L = \\frac{1}{overline{X}_n}'], ['\\\\widehat{\\\\lambda}_M = \\\\widehat{\\\\lambda}_L = \\\\frac{1}{\\\\overline{X}_n}']),\n _templateObject228 = statistica__taggedTemplateLiteralLoose(['widehat{mu}_L = overline{X}_n'], ['\\\\widehat{\\\\mu}_L = \\\\overline{X}_n']),\n _templateObject229 = statistica__taggedTemplateLiteralLoose(['widehat{sigma^2}_L = \\frac{sum (X_i - overline{X}_n)^2 }{n}'], ['\\\\widehat{\\\\sigma^2}_L = \\\\frac{\\\\sum (X_i - \\\\overline{X}_n)^2 }{n}']),\n _templateObject230 = statistica__taggedTemplateLiteralLoose(['widehat{W}'], ['\\\\widehat{W}']),\n _templateObject231 = statistica__taggedTemplateLiteralLoose(['P( a < W < b ) = N'], ['P( a < W < b ) = N']),\n _templateObject232 = statistica__taggedTemplateLiteralLoose(['mu in left[ overline{x}_n - z_{1 - \\frac{alpha}{2}} cdot sqrt{\\frac{sigma^2}{n}}, overline{x}_n + z_{1 - \\frac{alpha}{2}} cdot sqrt{\\frac{sigma^2}{n}} \\right]'], ['\\\\mu \\\\in \\\\left[ \\\\overline{x}_n - z_{1 - \\\\frac{\\\\alpha}{2}} \\\\cdot \\\\sqrt{\\\\frac{\\\\sigma^2}{n}}, \\\\overline{x}_n + z_{1 - \\\\frac{\\\\alpha}{2}} \\\\cdot \\\\sqrt{\\\\frac{\\\\sigma^2}{n}} \\\\right]']),\n _templateObject233 = statistica__taggedTemplateLiteralLoose(['mu in left( -infty, overline{x}_n + z_{1 - \\frac{alpha}{2}} cdot sqrt{\\frac{sigma^2}{n}} \\right]'], ['\\\\mu \\\\in \\\\left( -\\\\infty, \\\\overline{x}_n + z_{1 - \\\\frac{\\\\alpha}{2}} \\\\cdot \\\\sqrt{\\\\frac{\\\\sigma^2}{n}} \\\\right]']),\n _templateObject234 = statistica__taggedTemplateLiteralLoose(['mu in left[ overline{x}_n - z_{1 - \\frac{alpha}{2}} cdot sqrt{\\frac{sigma^2}{n}}, +infty \\right)'], ['\\\\mu \\\\in \\\\left[ \\\\overline{x}_n - z_{1 - \\\\frac{\\\\alpha}{2}} \\\\cdot \\\\sqrt{\\\\frac{\\\\sigma^2}{n}}, +\\\\infty \\\\right)']),\n _templateObject235 = statistica__taggedTemplateLiteralLoose(['mu in left[ overline{x}_n - t_{1 - \\frac{alpha}{2}; n-1} cdot sqrt{\\frac{s_n^2}{n}}, overline{x}_n + t_{1 - \\frac{alpha}{2}; n-1} cdot sqrt{\\frac{s_n^2}{n}} \\right]'], ['\\\\mu \\\\in \\\\left[ \\\\overline{x}_n - t_{1 - \\\\frac{\\\\alpha}{2}; n-1} \\\\cdot \\\\sqrt{\\\\frac{s_n^2}{n}}, \\\\overline{x}_n + t_{1 - \\\\frac{\\\\alpha}{2}; n-1} \\\\cdot \\\\sqrt{\\\\frac{s_n^2}{n}} \\\\right]']),\n _templateObject236 = statistica__taggedTemplateLiteralLoose(['mu in left( -infty, overline{x}_n + t_{1 - \\frac{alpha}{2}; n-1} cdot sqrt{\\frac{s_n^2}{n}} \\right]'], ['\\\\mu \\\\in \\\\left( -\\\\infty, \\\\overline{x}_n + t_{1 - \\\\frac{\\\\alpha}{2}; n-1} \\\\cdot \\\\sqrt{\\\\frac{s_n^2}{n}} \\\\right]']),\n _templateObject237 = statistica__taggedTemplateLiteralLoose(['mu in left[ overline{x}_n - t_{1 - \\frac{alpha}{2}; n-1} cdot sqrt{\\frac{s_n^2}{n}}, +infty \\right)'], ['\\\\mu \\\\in \\\\left[ \\\\overline{x}_n - t_{1 - \\\\frac{\\\\alpha}{2}; n-1} \\\\cdot \\\\sqrt{\\\\frac{s_n^2}{n}}, +\\\\infty \\\\right)']),\n _templateObject238 = statistica__taggedTemplateLiteralLoose(['t_{alpha, v}'], ['t_{\\\\alpha, v}']),\n _templateObject239 = statistica__taggedTemplateLiteralLoose(['p in left[ overline{p} - z_{1 - \\frac{alpha}{2}} cdot sqrt{\\frac{overline{p} cdot (1 - overline{p})}{n+4}}, overline{p} + z_{1 - \\frac{alpha}{2}} cdot sqrt{\\frac{overline{p} cdot (1 - overline{p})}{n+4}} \\right]'], ['p \\\\in \\\\left[ \\\\overline{p} - z_{1 - \\\\frac{\\\\alpha}{2}} \\\\cdot \\\\sqrt{\\\\frac{\\\\overline{p} \\\\cdot (1 - \\\\overline{p})}{n+4}}, \\\\overline{p} + z_{1 - \\\\frac{\\\\alpha}{2}} \\\\cdot \\\\sqrt{\\\\frac{\\\\overline{p} \\\\cdot (1 - \\\\overline{p})}{n+4}} \\\\right]']),\n _templateObject240 = statistica__taggedTemplateLiteralLoose(['m in left[ overline{x}_n - z_{1 - \\frac{alpha}{2}} cdot sqrt{\\frac{s^2_n}{n}}, overline{x}_n + z_{1 - \\frac{alpha}{2}} cdot sqrt{\\frac{s^2_n}{n}} \\right]'], ['m \\\\in \\\\left[ \\\\overline{x}_n - z_{1 - \\\\frac{\\\\alpha}{2}} \\\\cdot \\\\sqrt{\\\\frac{s^2_n}{n}}, \\\\overline{x}_n + z_{1 - \\\\frac{\\\\alpha}{2}} \\\\cdot \\\\sqrt{\\\\frac{s^2_n}{n}} \\\\right]']);\n\n\n\nfunction statistica__taggedTemplateLiteralLoose(strings, raw) { strings.raw = raw; return strings; }\n\nfunction statistica__classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction statistica__possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction statistica__inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nvar statistica_r = String.raw;\n\nvar statistica__ref = Object(preact_min[\"h\"])(\n 'h1',\n null,\n 'Statistica ed Elementi di Probabilit\\xE0'\n);\n\nvar statistica__ref2 = Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Soggettiva\" },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Il prezzo che un individuo coerente riterrebbe equo per ricevere ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n '1'\n ),\n ' nel caso l\\'evento si verificasse e ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n '0'\n ),\n ' nel caso l\\'evento non si verificasse.'\n )\n);\n\nvar statistica__ref3 = Object(preact_min[\"h\"])(\n 'blockquote',\n null,\n '\"omegone\"'\n);\n\nvar statistica__ref4 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'L\\'',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'insieme'\n ),\n ' di tutti gli esiti possibili di un esperimento.'\n);\n\nvar statistica__ref5 = Object(preact_min[\"h\"])(\n 'blockquote',\n null,\n '\"omeghino\"'\n);\n\nvar statistica__ref6 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Un ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'elemento'\n ),\n ' dello spazio campionario.'\n);\n\nvar statistica__ref7 = Object(preact_min[\"h\"])(\n 'blockquote',\n null,\n '\"e\"'\n);\n\nvar statistica__ref8 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Un ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'sottoinsieme'\n ),\n ' dello spazio campionario.'\n);\n\nvar statistica__ref9 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Lo spazio campionario stesso \\xE8 un ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'evento certo'\n ),\n '.'\n);\n\nvar statistica__ref10 = Object(preact_min[\"h\"])(\n 'blockquote',\n null,\n '\"not e\"'\n);\n\nvar statistica__ref11 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Il ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'complementare'\n ),\n ' di un sottoinsieme.'\n);\n\nvar statistica__ref12 = Object(preact_min[\"h\"])(\n 'blockquote',\n null,\n '\"e intersecato effe\"'\n);\n\nvar statistica__ref13 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'L\\'',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'intersezione'\n ),\n ' di pi\\xF9 sottoinsiemi.'\n);\n\nvar statistica__ref14 = Object(preact_min[\"h\"])(\n 'blockquote',\n null,\n '\"e unito a effe\"'\n);\n\nvar statistica__ref15 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'L\\'',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'unione'\n ),\n ' di pi\\xF9 sottoinsiemi.'\n);\n\nvar statistica__ref16 = Object(preact_min[\"h\"])(\n 'blockquote',\n null,\n '\"e meno effe\"'\n);\n\nvar statistica__ref17 = Object(preact_min[\"h\"])(\n 'blockquote',\n null,\n '\"e contenuto in effe\"'\n);\n\nvar statistica__ref18 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'L\\'',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'inclusione'\n ),\n ' del primo insieme in un altro.'\n);\n\nvar statistica__ref19 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Se si verifica ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'E'\n ),\n ', allora si verifica anche ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'F'\n ),\n '.'\n);\n\nvar statistica__ref20 = Object(preact_min[\"h\"])(\n 'blockquote',\n null,\n '\"e \\xE8 impossibile\"'\n);\n\nvar statistica__ref21 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Un sottoinsieme ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'vuoto'\n ),\n '.'\n);\n\nvar statistica__ref22 = Object(preact_min[\"h\"])(\n 'blockquote',\n null,\n '\"e ed effe si escludono mutualmente\"'\n);\n\nvar statistica__ref23 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'disgiunzione'\n ),\n ' di due insiemi.'\n);\n\nvar statistica__ref24 = Object(preact_min[\"h\"])(\n 'blockquote',\n null,\n '\"famiglia effe\"'\n);\n\nvar statistica__ref25 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'I sottoinsiemi dello spazio campionario formano una ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'famiglia'\n ),\n ' di sottoinsiemi detta ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'famiglia degli eventi'\n ),\n '.'\n);\n\nvar statistica__ref26 = Object(preact_min[\"h\"])(\n 'blockquote',\n null,\n '\"sigma algebra\"'\n);\n\nvar statistica__ref27 = Object(preact_min[\"h\"])(\n 'blockquote',\n null,\n '\"la partizione e composta da e uno, e due, e tre...\"'\n);\n\nvar statistica__ref28 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Un insieme di esiti e eventi:'\n);\n\nvar statistica__ref29 = Object(preact_min[\"h\"])(\n 'ul',\n null,\n Object(preact_min[\"h\"])(\n 'li',\n null,\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'Finito'\n ),\n '.'\n ),\n Object(preact_min[\"h\"])(\n 'li',\n null,\n 'In cui tutti gli eventi hanno ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'probabilit\\xE0 diversa da 0'\n ),\n '.'\n ),\n Object(preact_min[\"h\"])(\n 'li',\n null,\n 'In cui tutti gli eventi sono ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'mutualmente esclusivi'\n ),\n '.'\n ),\n Object(preact_min[\"h\"])(\n 'li',\n null,\n 'In cui l\\'unione di tutti i suoi elementi ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'copre lo spazio campionario'\n ),\n '.'\n )\n);\n\nvar statistica__ref30 = Object(preact_min[\"h\"])(\n example_Example,\n null,\n 'Se lo spazio campionario fosse una torta, una sua partizione sarebbe l\\'insieme delle fette di uno dei modi in cui si potrebbe tagliare.'\n);\n\nvar statistica__ref31 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La probabilit\\xE0 di un evento \\xE8 un numero tra 0 e 1.'\n);\n\nvar statistica__ref32 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La probabilit\\xE0 dello spazio campionario \\xE8 sempre 1.'\n);\n\nvar statistica__ref33 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La probabilit\\xE0 dell\\'unione di eventi indipendenti \\xE8 uguale alla somma delle loro probabilit\\xE0.'\n);\n\nvar statistica__ref34 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La probabilit\\xE0 di un evento negato \\xE8 uguale a 1 meno la probabilit\\xE0 dell\\'evento non negato.'\n);\n\nvar statistica__ref35 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La probabilit\\xE0 di un evento incluso in un altro \\xE8 sempre minore o uguale alla probabilit\\xE0 dell\\'evento in cui \\xE8 incluso.'\n);\n\nvar statistica__ref36 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La probabilit\\xE0 di un evento unito a un altro \\xE8 uguale alla somma delle probabilit\\xE0 dei due eventi meno la probabilit\\xE0 della loro intersezione.'\n);\n\nvar statistica__ref37 = Object(preact_min[\"h\"])(\n example_Example,\n null,\n 'Sommando le probabilit\\xE0 dei due eventi, l\\'intersezione viene contata due volte, e va quindi rimossa!'\n);\n\nvar statistica__ref38 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Spazi campionari in cui ci sono un numero finito di esiti e ogni esito ha la stessa probabilit\\xE0 di verificarsi.'\n);\n\nvar statistica__ref39 = Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Spazi equiprobabili geometrici\" },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Gli spazi campionari possono avere un numero infinito di esiti: sono ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'equiprobabili geometrici'\n ),\n ' se nessun esito \\xE8 privilegiato rispetto agli altri.'\n )\n);\n\nvar statistica__ref40 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Estraggo un numero, da un sacchetto con ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'n'\n ),\n ' numeri, mi segno che numero ho estratto e lo ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'tengo fuori dal sacchetto'\n ),\n '. Ripeto per ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'k'\n ),\n ' volte.'\n);\n\nvar statistica__ref41 = Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'Tengo conto'\n ),\n ' dell\\'ordine in cui ho estratto i numeri.'\n);\n\nvar statistica__ref42 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Estraggo un numero, da un sacchetto con ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'n'\n ),\n ' numeri, mi segno che numero ho estratto e lo ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'rimetto nel sacchetto'\n ),\n '. Ripeto per ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'k'\n ),\n ' volte.'\n);\n\nvar statistica__ref43 = Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'Tengo conto'\n ),\n ' dell\\'ordine in cui ho estratto i numeri.'\n);\n\nvar statistica__ref44 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Estraggo un numero, da un sacchetto con ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'n'\n ),\n ' numeri, mi segno che numero ho estratto e lo ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'tengo fuori dal sacchetto'\n ),\n '. Ripeto per ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'k'\n ),\n ' volte.'\n);\n\nvar statistica__ref45 = Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'Non mi interessa'\n ),\n ' l\\'ordine in cui ho estratto i numeri.'\n);\n\nvar statistica__ref46 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Estraggo un numero, da un sacchetto con ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'n'\n ),\n ' numeri, mi segno che numero ho estratto e lo ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'rimetto nel sacchetto'\n ),\n '. Ripeto per ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'k'\n ),\n ' volte.'\n);\n\nvar statistica__ref47 = Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'Non mi interessa'\n ),\n ' l\\'ordine in cui ho estratto i numeri.'\n);\n\nvar statistica__ref48 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Estraggo ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'n'\n ),\n ' numeri e guardo in quanti ordini diversi li posso mettere.'\n);\n\nvar statistica__ref49 = Object(preact_min[\"h\"])(\n 'blockquote',\n null,\n '\"E dato F\"'\n);\n\nvar statistica__ref50 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La probabilit\\xE0 che si verifichi ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'E'\n ),\n ' sapendo che ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'si \\xE8 gi\\xE0 verificato'\n ),\n ' ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'F'\n ),\n '.'\n);\n\nvar statistica__ref51 = Object(preact_min[\"h\"])(\n example_Example,\n null,\n 'Ricorda vagamente le pipe di ',\n Object(preact_min[\"h\"])(\n 'code',\n null,\n 'bash'\n ),\n ', per\\xF2 al contrario...'\n);\n\nvar statistica__ref52 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Se due eventi sono mutualmente esclusivi, entrambe le loro probabilit\\xE0 condizionate saranno uguali a 0.'\n);\n\nvar statistica__ref53 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Si pu\\xF2 sfruttare la formula inversa della probabilit\\xE0 condizionata per calcolare catene di intersezioni:'\n);\n\nvar statistica__ref54 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La probabilit\\xE0 che si verifichi un evento \\xE8 pari alla somma delle probabilit\\xE0 dell\\'evento stesso dati tutti gli eventi di una partizione.'\n);\n\nvar statistica__ref55 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La legge delle alternative funziona anche quando ad essere partizionato \\xE8 un ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'evento'\n ),\n ':'\n);\n\nvar statistica__ref56 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Tramite la ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'formula di Bayes'\n ),\n ' possiamo risalire alla probabilit\\xE0 di un evento condizionato a un altro partendo dalla probabilit\\xE0 di quest\\'ultimo condizionato al primo:'\n);\n\nvar statistica__ref57 = Object(preact_min[\"h\"])(\n example_Example,\n null,\n 'In pratica, invertiamo gli eventi.'\n);\n\nvar statistica__ref58 = Object(preact_min[\"h\"])(\n 'blockquote',\n null,\n '\"eventi indipendenti a due a due\"'\n);\n\nvar statistica__ref59 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Se due eventi sono indipendenti, sapere che uno dei due si \\xE8 verificato non influisce sulle probabilit\\xE0 che si sia verificato l\\'altro.'\n);\n\nvar statistica__ref60 = Object(preact_min[\"h\"])(\n 'blockquote',\n null,\n '\"eventi indipendenti a tre a tre, a quattro a quattro, a cinque a cinque...\"'\n);\n\nvar statistica__ref61 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Si pu\\xF2 verificare l\\'indipendenza di pi\\xF9 eventi alla volta:'\n);\n\nvar statistica__ref62 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Eventi indipendenti a due a due non sono per forza indipendenti a tre a tre, e viceversa.'\n);\n\nvar statistica__ref63 = Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Famiglia di eventi indipendenti\" },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Un insieme di ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'n'\n ),\n ' eventi \\xE8 una ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'famiglia di eventi indipendenti'\n ),\n ' se, preso un qualsiasi numero di eventi da essa, essi risulteranno indipendenti.'\n ),\n Object(preact_min[\"h\"])(\n example_Example,\n null,\n 'Tutti gli eventi provenienti da essa saranno indipendenti sia a due a due, sia a tre a tre, sia a quattro a quattro, e cos\\xEC via!'\n )\n);\n\nvar statistica__ref64 = Object(preact_min[\"h\"])(\n 'abbr',\n { title: \"Nome artigianale dato da Steffo.\" },\n 'Insieme di ripartizione'\n);\n\nvar statistica__ref65 = Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 't'\n);\n\nvar statistica__ref66 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Per definizione, tutte le variabili aleatorie devono rispettare questa condizione:'\n);\n\nvar statistica__ref67 = Object(preact_min[\"h\"])(\n example_Example,\n null,\n 'All\\'aumentare di t, l\\'insieme conterr\\xE0 sempre pi\\xF9 elementi.'\n);\n\nvar statistica__ref68 = Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Supporto\" },\n Object(preact_min[\"h\"])(\n 'blockquote',\n null,\n '\"supporto di X\"'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Il ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'codominio'\n ),\n ' della variabile aleatoria \\xE8 il suo ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'supporto'\n ),\n '.'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Per indicare che un valore ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'x_0'\n ),\n ' appartiene al supporto di ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'X'\n ),\n ', si usa la notazione ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'X \\\\mapsto x_0'\n ),\n '.'\n )\n);\n\nvar statistica__ref69 = Object(preact_min[\"h\"])(\n 'i',\n null,\n 'funzione probabilit\\xE0'\n);\n\nvar statistica__ref70 = Object(preact_min[\"h\"])(\n 'b',\n null,\n 'discreta'\n);\n\nvar statistica__ref71 = Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'X'\n);\n\nvar statistica__ref72 = Object(preact_min[\"h\"])(\n 'i',\n null,\n 'funzione densit\\xE0'\n);\n\nvar statistica__ref73 = Object(preact_min[\"h\"])(\n 'b',\n null,\n 'continua'\n);\n\nvar statistica__ref74 = Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'X'\n);\n\nvar statistica__ref75 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'A differenza della funzione probabilit\\xE0, \\xE8 possibile che la funzione densit\\xE0 ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'non esista'\n ),\n ' per una certa variabile aleatoria.'\n);\n\nvar statistica__ref76 = Object(preact_min[\"h\"])(\n example_Example,\n null,\n 'Rappresenta \"quanta\" probabilit\\xE0 c\\'\\xE8 in un\\'unit\\xE0 di x!'\n);\n\nvar statistica__ref77 = Object(preact_min[\"h\"])(\n 'i',\n null,\n 'funzione di ripartizione'\n);\n\nvar statistica__ref78 = Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 't'\n);\n\nvar statistica__ref79 = Object(preact_min[\"h\"])(\n 'li',\n null,\n '\\xC8 sempre ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'monotona crescente'\n ),\n ' (non strettamente).'\n);\n\nvar statistica__ref80 = Object(preact_min[\"h\"])('br', null);\n\nvar statistica__ref81 = Object(preact_min[\"h\"])(\n 'li',\n null,\n 'Vale ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n '0'\n ),\n ' a ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n '-\\\\infty'\n ),\n ' e ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n '1'\n ),\n ' a ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n '+\\\\infty'\n ),\n '.'\n);\n\nvar statistica__ref82 = Object(preact_min[\"h\"])('br', null);\n\nvar statistica__ref83 = Object(preact_min[\"h\"])(\n 'b',\n null,\n 'continua da destra'\n);\n\nvar statistica__ref84 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Possiamo usare la funzione di ripartizione per calcolare la probabilit\\xE0 di un certo valore reale:'\n);\n\nvar statistica__ref85 = Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Nel discreto\" },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Nel discreto basta abbinare un nuovo valore a ogni valore della variabile originale.'\n )\n);\n\nvar statistica__ref86 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Nel continuo applichiamo la formula dell\\'integrazione per sostituzione:'\n);\n\nvar statistica__ref87 = Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Nel... digitale\" },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Trasformare variabili aleatorie \\xE8 molto utile nell\\'informatica per creare distribuzioni partendo da una funzione ',\n Object(preact_min[\"h\"])(\n 'a',\n { href: \"https://docs.python.org/3/library/random.html#random.random\" },\n Object(preact_min[\"h\"])(\n 'code',\n null,\n 'random()'\n )\n ),\n ' che restituisce numeri da 0 a 1 con una distribuzione lineare.'\n )\n);\n\nvar statistica__ref88 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Ogni variabile aleatoria che ha una ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'funzione di ripartizione'\n ),\n ' e un ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'supporto finito'\n ),\n ' ha anche una ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'media'\n ),\n ' (o ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'valore medio'\n ),\n ' o ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'atteso'\n ),\n '):'\n);\n\nvar statistica__ref89 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Nel discreto, si pu\\xF2 calcolare con:'\n);\n\nvar statistica__ref90 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Nel continuo, si pu\\xF2 calcolare con:'\n);\n\nvar statistica__ref91 = Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Moda\" },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Valore per cui la ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'funzione probabilit\\xE0'\n ),\n ' o ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'funzione densit\\xE0'\n ),\n ' \\xE8 ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'massima'\n ),\n '.'\n )\n);\n\nvar statistica__ref92 = Object(preact_min[\"h\"])(\n 'i',\n null,\n 'quantile'\n);\n\nvar statistica__ref93 = Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'X'\n);\n\nvar statistica__ref94 = Object(preact_min[\"h\"])('p', null);\n\nvar statistica__ref95 = Object(preact_min[\"h\"])(\n 'i',\n null,\n 'mediana'\n);\n\nvar statistica__ref96 = Object(preact_min[\"h\"])(\n 'i',\n null,\n 'quartili'\n);\n\nvar statistica__ref97 = Object(preact_min[\"h\"])(\n 'i',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'n'\n ),\n '-esima percentile'\n);\n\nvar statistica__ref98 = Object(preact_min[\"h\"])(\n 'p',\n null,\n '\\xC8 un valore che indica quanto la variabile aleatoria si discosta generalmente dalla media:'\n);\n\nvar statistica__ref99 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Data una variabile aleatoria non-negativa:'\n);\n\nvar statistica__ref100 = Object(preact_min[\"h\"])(\n 'blockquote',\n null,\n '\"disuguaglianza di cebicev\"'\n);\n\nvar statistica__ref101 = Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'X'\n);\n\nvar statistica__ref102 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'E anche:'\n);\n\nvar statistica__ref103 = Object(preact_min[\"h\"])(\n example_Example,\n null,\n 'Serve per semplificare i calcoli quando la funzione di ripartizione \\xE8 difficile da calcolare!'\n);\n\nvar statistica__ref104 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Il ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'momento'\n ),\n ' ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'k'\n ),\n '-esimo di una variabile aleatoria \\xE8:'\n);\n\nvar statistica__ref105 = Object(preact_min[\"h\"])(\n example_Example,\n null,\n 'La media di una variabile aleatoria \\xE8 anche il suo primo momento.'\n);\n\nvar statistica__ref106 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'funzione generatrice dei momenti'\n ),\n ' \\xE8:'\n);\n\nvar statistica__ref107 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Se due variabile aleatorie hanno la stessa funzione generatrice dei momenti, allora esse hanno la ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'stessa distribuzione'\n ),\n '.'\n);\n\nvar statistica__ref108 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'E\\' la ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'trasformata di Laplace'\n ),\n ' della variabile aleatoria di X.'\n);\n\nvar statistica__ref109 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'funzione caratteristica'\n ),\n ' \\xE8:'\n);\n\nvar statistica__ref110 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Se due variabile aleatorie hanno la stessa funzione caratteristica, allora esse hanno la ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'stessa distribuzione'\n ),\n '.'\n);\n\nvar statistica__ref111 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'E\\' la ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'trasformata di Fourier'\n ),\n ' della variabile aleatoria di X.'\n);\n\nvar statistica__ref112 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Per dire che una variabile ha una certa distribuzione, si usa la notazione:'\n);\n\nvar statistica__ref113 = Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Prova di Bernoulli\" },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Una prova con solo due possibili esiti: ',\n Object(preact_min[\"h\"])(\n plus_Plus,\n null,\n 'successo'\n ),\n ' e ',\n Object(preact_min[\"h\"])(\n minus_Minus,\n null,\n 'insuccesso'\n ),\n '.'\n )\n);\n\nvar statistica__ref114 = Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Schema di Bernoulli\" },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Una sequenza di prove di Bernoulli per le quali le probabilit\\xE0 di successo e fallimento rimangono invariate.'\n )\n);\n\nvar statistica__ref115 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Una variabile aleatoria che rappresenta una prova di Bernoulli:'\n);\n\nvar statistica__ref116 = Object(preact_min[\"h\"])(\n 'ul',\n null,\n Object(preact_min[\"h\"])(\n 'li',\n null,\n 'vale ',\n Object(preact_min[\"h\"])(\n plus_Plus,\n null,\n '1'\n ),\n ' in caso di ',\n Object(preact_min[\"h\"])(\n plus_Plus,\n null,\n 'successo'\n ),\n '.'\n ),\n Object(preact_min[\"h\"])(\n 'li',\n null,\n 'vale ',\n Object(preact_min[\"h\"])(\n minus_Minus,\n null,\n '0'\n ),\n ' in caso di ',\n Object(preact_min[\"h\"])(\n minus_Minus,\n null,\n 'insuccesso'\n ),\n '.'\n )\n);\n\nvar statistica__ref117 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La distribuzione bernoulliana ha come densit\\xE0:'\n);\n\nvar statistica__ref118 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Una variabile aleatoria che conta il numero di successi di ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'n'\n ),\n ' prove di uno schema di Bernoulli.'\n);\n\nvar statistica__ref119 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La binomiale ha come densit\\xE0:'\n);\n\nvar statistica__ref120 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'funzione generatrice dei momenti'\n ),\n ' della binomiale \\xE8:'\n);\n\nvar statistica__ref121 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'media'\n ),\n ' di una binomiale \\xE8:'\n);\n\nvar statistica__ref122 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'varianza'\n ),\n ' di una binomiale \\xE8:'\n);\n\nvar statistica__ref123 = Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Distribuzione geometrica\" },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Una variabile aleatoria che conta il numero di prove in uno schema di Bernoulli fino alla comparsa del primo successo.'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Il suo simbolo \\xE8 ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'Geo(p)'\n ),\n '.'\n )\n);\n\nvar statistica__ref124 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La geometrica ha come densit\\xE0:'\n);\n\nvar statistica__ref125 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'funzione generatrice dei momenti'\n ),\n ' della geometrica \\xE8:'\n);\n\nvar statistica__ref126 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'media'\n ),\n ' della geometrica \\xE8:'\n);\n\nvar statistica__ref127 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'varianza'\n ),\n ' della geometrica \\xE8:'\n);\n\nvar statistica__ref128 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La geometrica non tiene conto degli eventi avvenuti in passato: ha la propriet\\xE0 dell\\'assenza di memoria:'\n);\n\nvar statistica__ref129 = Object(preact_min[\"h\"])(\n example_Example,\n null,\n 'Ovvero, riscalando opportunamente l\\'asse Y posso prendere come 0 qualsiasi punto dell\\'asse X.'\n);\n\nvar statistica__ref130 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Una variabile aleatoria che conta il numero di prove in uno schema di Bernoulli necessarie perch\\xE8 si verifichi l\\'',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'n'\n ),\n '-esimo successo.'\n);\n\nvar statistica__ref131 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La binomiale negativa ha come densit\\xE0:'\n);\n\nvar statistica__ref132 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'funzione generatrice dei momenti'\n ),\n ' della binomiale negativa \\xE8:'\n);\n\nvar statistica__ref133 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'media'\n ),\n ' della binomiale negativa \\xE8:'\n);\n\nvar statistica__ref134 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'varianza'\n ),\n ' della binomiale negativa \\xE8:'\n);\n\nvar statistica__ref135 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Una variabile aleatoria che conta il numero ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'k'\n ),\n ' di insuccessi consecutivi in uno schema di Bernoulli:'\n);\n\nvar statistica__ref136 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La geometrica traslata ha come densit\\xE0:'\n);\n\nvar statistica__ref137 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'funzione generatrice dei momenti'\n ),\n ' della geometrica traslata \\xE8:'\n);\n\nvar statistica__ref138 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'media'\n ),\n ' della geometrica traslata \\xE8:'\n);\n\nvar statistica__ref139 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'varianza'\n ),\n ' della geometrica \\xE8:'\n);\n\nvar statistica__ref140 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La geometrica traslata non tiene conto degli eventi avvenuti in passato: ha la propriet\\xE0 dell\\'assenza di memoria:'\n);\n\nvar statistica__ref141 = Object(preact_min[\"h\"])(\n example_Example,\n null,\n 'Ovvero, riscalando opportunamente l\\'asse Y posso prendere come 0 qualsiasi punto dell\\'asse X.'\n);\n\nvar statistica__ref142 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Una variabile aleatoria che conta il numero di insuccessi in uno schema di Bernoulli prima che si verifichi l\\'',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'n'\n ),\n '-esimo successo.'\n);\n\nvar statistica__ref143 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La binomiale negativa traslata ha come densit\\xE0:'\n);\n\nvar statistica__ref144 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'funzione generatrice dei momenti'\n ),\n ' della binomiale negativa traslata \\xE8:'\n);\n\nvar statistica__ref145 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'media'\n ),\n ' della binomiale negativa traslata \\xE8:'\n);\n\nvar statistica__ref146 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'varianza'\n ),\n ' della binomiale negativa traslata \\xE8:'\n);\n\nvar statistica__ref147 = Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Distribuzione ipergeometrica\" },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Una variabile aleatoria che, sapendo il numero di successi ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'K'\n ),\n ' e di insuccessi ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'N-K'\n ),\n ', conta quanti successi si otterrebbero se se ne estraessero ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'n'\n ),\n ' in blocco.'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Il suo simbolo \\xE8 ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'Ipe(N, K, n)'\n ),\n '.'\n )\n);\n\nvar statistica__ref148 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La ipergeometrica ha come densit\\xE0:'\n);\n\nvar statistica__ref149 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'funzione generatrice dei momenti'\n ),\n ' della ipergeometrica \\xE8 trascurabile.'\n);\n\nvar statistica__ref150 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'media'\n ),\n ' della ipergeometrica \\xE8:'\n);\n\nvar statistica__ref151 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'varianza'\n ),\n ' della ipergeometrica \\xE8:'\n);\n\nvar statistica__ref152 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Una variabile aleatoria che soddisfa tutte le seguenti caratteristiche:'\n);\n\nvar statistica__ref153 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La poissoniana ha come densit\\xE0:'\n);\n\nvar statistica__ref154 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'funzione generatrice dei momenti'\n ),\n ' della poissoniana \\xE8:'\n);\n\nvar statistica__ref155 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'media'\n ),\n ' della poissoniana \\xE8:'\n);\n\nvar statistica__ref156 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'varianza'\n ),\n ' della poissoniana \\xE8:'\n);\n\nvar statistica__ref157 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Gli altri momenti della poissoniana sono:'\n);\n\nvar statistica__ref158 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Una successione di ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'arrivi'\n ),\n ' avvenuti in un certo arco temporale che:'\n);\n\nvar statistica__ref159 = Object(preact_min[\"h\"])(\n 'li',\n null,\n 'non sono sovrapposti.'\n);\n\nvar statistica__ref160 = Object(preact_min[\"h\"])(\n 'li',\n null,\n 'avvengono indipendentemente gli uni dagli altri.'\n);\n\nvar statistica__ref161 = Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'N_t'\n);\n\nvar statistica__ref162 = Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 't'\n);\n\nvar statistica__ref163 = Object(preact_min[\"h\"])(\n example_Example,\n null,\n 'E\\' paragonabile a una bernoulliana: ogni successo corrisponde a un arrivo, mentre il tempo \\xE8 il numero di prove effettuate (ma nel continuo).'\n);\n\nvar statistica__ref164 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'L\\'esponenziale ha come ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'densit\\xE0'\n ),\n ':'\n);\n\nvar statistica__ref165 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'L\\'esponenziale ha come ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'funzione di ripartizione'\n ),\n ':'\n);\n\nvar statistica__ref166 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'funzione generatrice dei momenti'\n ),\n ' dell\\'esponenziale \\xE8:'\n);\n\nvar _ref167 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'media'\n ),\n ' dell\\'esponenziale \\xE8:'\n);\n\nvar _ref168 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'varianza'\n ),\n ' dell\\'esponenziale \\xE8:'\n);\n\nvar _ref169 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'L\\'esponenziale non tiene conto degli eventi avvenuti in passato: ha la propriet\\xE0 dell\\'assenza di memoria:'\n);\n\nvar _ref170 = Object(preact_min[\"h\"])(\n example_Example,\n null,\n 'Ovvero, riscalando opportunamente l\\'asse Y posso prendere come 0 qualsiasi punto dell\\'asse X.'\n);\n\nvar _ref171 = Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'n'\n);\n\nvar _ref172 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La legge gamma ha come densit\\xE0:'\n);\n\nvar _ref173 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'funzione generatrice dei momenti'\n ),\n ' della legge gamma \\xE8:'\n);\n\nvar _ref174 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'media'\n ),\n ' della legge gamma \\xE8:'\n);\n\nvar _ref175 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'varianza'\n ),\n ' della legge gamma \\xE8:'\n);\n\nvar _ref176 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Su di essa vale la seguente propriet\\xE0:'\n);\n\nvar _ref177 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La distribuzione uniforme ha come ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'densit\\xE0'\n ),\n ':'\n);\n\nvar _ref178 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La distribuzione uniforme ha come ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'funzione di ripartizione'\n ),\n ':'\n);\n\nvar _ref179 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'funzione generatrice dei momenti'\n ),\n ' della distribuzione uniforme \\xE8:'\n);\n\nvar _ref180 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'media'\n ),\n ' della distribuzione uniforme \\xE8:'\n);\n\nvar _ref181 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'varianza'\n ),\n ' della distribuzione uniforme \\xE8:'\n);\n\nvar _ref182 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Una variabile aleatoria con una specifica distribuzione.'\n);\n\nvar _ref183 = Object(preact_min[\"h\"])(\n example_Example,\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n '\\\\mu'\n ),\n ' e ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n '\\\\sigma^2'\n ),\n ' sono rispettivamente la media e la varianza della distribuzione!'\n);\n\nvar _ref184 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La distribuzione normale ha come densit\\xE0:'\n);\n\nvar _ref185 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'funzione generatrice dei momenti'\n ),\n ' della distribuzione normale \\xE8:'\n);\n\nvar _ref186 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'media'\n ),\n ' della distribuzione normale \\xE8:'\n);\n\nvar _ref187 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'varianza'\n ),\n ' della distribuzione normale \\xE8:'\n);\n\nvar _ref188 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Qualsiasi normale pu\\xF2 essere trasformata in qualsiasi altra normale:'\n);\n\nvar _ref189 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La distribuzione normale standard ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'Z'\n ),\n ' \\xE8:'\n);\n\nvar _ref190 = Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'Z \\\\sim Nor(0, 1)'\n )\n);\n\nvar _ref191 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La distribuzione normale ha una particolare relazione con la distribuzione Gamma:'\n);\n\nvar _ref192 = Object(preact_min[\"h\"])(\n 'blockquote',\n null,\n '\"chi-quadro a un grado di libert\\xE0\"'\n);\n\nvar _ref193 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Esiste una distribuzione Gamma particolare:'\n);\n\nvar _ref194 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Pi\\xF9 chi-quadro possono essere sommate per aumentare i loro gradi di libert\\xE0:'\n);\n\nvar _ref195 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Un\\'altra funzione particolare \\xE8 la funzione T di Student:'\n);\n\nvar _ref196 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La binomiale \\xE8 come una ipergeometrica ma con ripetizioni, quindi per valori molto grandi di ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'N'\n ),\n ' rispetto a ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'n'\n ),\n ', si pu\\xF2 dire che:'\n);\n\nvar _ref197 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La binomiale non \\xE8 altro che una poissoniana a tempo discreto, quindi, se ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'n'\n ),\n ' \\xE8 grande e ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'n \\\\cdot p'\n ),\n ' \\xE8 nell\\'ordine di grandezza delle unit\\xE0, allora:'\n);\n\nvar _ref198 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Per il Teorema di De Moivre-Laplace, se una binomiale ha una ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'n'\n ),\n ' grande e ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'p'\n ),\n ' non vicina a 0 o 1, si pu\\xF2 approssimare con:'\n);\n\nvar _ref199 = Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'X'\n);\n\nvar _ref200 = Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'Y'\n);\n\nvar _ref201 = Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'k'\n);\n\nvar _ref202 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Un vettore ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'composto da variabili aleatorie'\n ),\n '.'\n);\n\nvar _ref203 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'I vettori aleatori hanno pi\\xF9 funzioni di ripartizione che si differenziano in base al numero di parametri.'\n);\n\nvar _ref204 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Se il numero di parametri coincide con la dimensione del vettore aleatorio, allora la funzione sar\\xE0 una ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'funzione di ripartizione congiunta'\n ),\n ':'\n);\n\nvar _ref205 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Se il numero di parametri \\xE8 minore della dimensione del vettore aleatorio, allora la funzione sar\\xE0 una ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'funzione di ripartizione marginale'\n ),\n ':'\n);\n\nvar _ref206 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'I vettori aleatori ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'discreti'\n ),\n ' hanno pi\\xF9 densit\\xE0 che si differenziano in base al numero di parametri.'\n);\n\nvar _ref207 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Se il numero di parametri coincide con la dimensione del vettore aleatorio, allora la funzione sar\\xE0 una ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'densit\\xE0 congiunta'\n ),\n ':'\n);\n\nvar _ref208 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Se il numero di parametri \\xE8 minore della dimensione del vettore aleatorio, allora la funzione sar\\xE0 una ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'densit\\xE0 marginale'\n ),\n ':'\n);\n\nvar _ref209 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Pi\\xF9 variabili aleatorie sono indipendenti se, per qualsiasi scelta di intervalli ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'A_i'\n ),\n ':'\n);\n\nvar _ref210 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'E\\' possibile calcolare la media di qualsiasi funzione ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'g(X, Y)'\n ),\n ' avente elementi del vettore come variabili:'\n);\n\nvar _ref211 = Object(preact_min[\"h\"])(\n example_Example,\n null,\n 'Solitamente si calcola la media di ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'x \\\\cdot y'\n ),\n '.'\n);\n\nvar _ref212 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Le medie di pi\\xF9 variabili aleatorie si possono sommare:'\n);\n\nvar _ref213 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Un ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'operatore'\n ),\n ' che misura la correlazione di due variabili aleatorie.'\n);\n\nvar _ref214 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Si calcola con il valore atteso dei prodotti delle distanze dalla media:'\n);\n\nvar _ref215 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Ha diverse propriet\\xE0:'\n);\n\nvar _ref216 = Object(preact_min[\"h\"])(\n 'b',\n null,\n 'valore nullo'\n);\n\nvar _ref217 = Object(preact_min[\"h\"])(\n 'b',\n null,\n 'commutativa'\n);\n\nvar _ref218 = Object(preact_min[\"h\"])(\n 'b',\n null,\n 'semplificabile'\n);\n\nvar _ref219 = Object(preact_min[\"h\"])(\n 'b',\n null,\n 'lineare'\n);\n\nvar _ref220 = Object(preact_min[\"h\"])(\n 'b',\n null,\n 'distributiva'\n);\n\nvar _ref221 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Due variabili sono ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'variabili incorrelate'\n ),\n ' se:'\n);\n\nvar _ref222 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Variabili indipendenti sono sempre incorrelate.'\n);\n\nvar _ref223 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'E\\' sempre simmetrica e semidefinita positiva (tutti gli autovalori sono ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n '\\\\geq 0'\n ),\n '.'\n);\n\nvar _ref224 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Un valore che misura come due variabili aleatorie sono correlate:'\n);\n\nvar _ref225 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'E\\' sempre compreso tra -1 e 1:'\n);\n\nvar _ref226 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Vale esattamente -1 o 1 solo se esiste un legame lineare tra le due variaibli:'\n);\n\nvar _ref227 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La varianza di due variabili aleatorie sommate \\xE8:'\n);\n\nvar _ref228 = Object(preact_min[\"h\"])(\n example_Example,\n null,\n 'Si dimostra applicando le propriet\\xE0 della covarianza!'\n);\n\nvar _ref229 = Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'X_i'\n);\n\nvar _ref230 = Object(preact_min[\"h\"])(\n 'b',\n null,\n 'indipendenti'\n);\n\nvar _ref231 = Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Campione casuale\" },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Una ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'n-pla'\n ),\n ' di variabili aleatorie con la stessa distribuzione della variabile aleatoria ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'X'\n ),\n ' (\"popolazione\") ma ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'indipendenti'\n ),\n ' tra loro.'\n ),\n Object(preact_min[\"h\"])(\n example_Example,\n null,\n 'Le variabili aleatorie sono come un lazy-load in programmazione; quando ci sar\\xE0 bisogno del loro valore numerico, esse si ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'realizzeranno'\n ),\n ' nel loro valore.'\n )\n);\n\nvar _ref232 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Il valore dato dalla media aritmetica degli ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'n'\n ),\n ' elementi del campione elevati alla potenza ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'k'\n ),\n ':'\n);\n\nvar _ref233 = Object(preact_min[\"h\"])(\n 'i',\n null,\n 'media campionaria'\n);\n\nvar _ref234 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La media aritmetica dello scarto quadratico medio degli elementi del campione.'\n);\n\nvar _ref235 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Altrimenti:'\n);\n\nvar _ref236 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Se calcoliamo la media della media campionaria, risulter\\xE0 vero che:'\n);\n\nvar _ref237 = Object(preact_min[\"h\"])(\n example_Example,\n null,\n 'Quindi, \\xE8 possibile usare i campioni per trovare la media di una variabile aleatoria!'\n);\n\nvar _ref238 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Se calcoliamo la varianza della media campionaria, risulter\\xE0 vero che:'\n);\n\nvar _ref239 = Object(preact_min[\"h\"])(\n example_Example,\n null,\n 'Quindi, possiamo stimare l\\'errore della media calcolata tramite campioni!'\n);\n\nvar _ref240 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Se calcoliamo la media della varianza campionaria, risulter\\xE0 vero che:'\n);\n\nvar _ref241 = Object(preact_min[\"h\"])(\n example_Example,\n null,\n 'Quindi, possiamo stimare l\\'errore della media calcolata tramite campioni!'\n);\n\nvar _ref242 = Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'X'\n);\n\nvar _ref243 = Object(preact_min[\"h\"])(\n 'p',\n null,\n '...allora sappiamo anche la distribuzione della media campionaria!'\n);\n\nvar _ref244 = Object(preact_min[\"h\"])(\n 'p',\n null,\n '...e anche della varianza campionaria!'\n);\n\nvar _ref245 = Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Indipendenza\" },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n '...e che media campionaria e varianza campionaria sono indipendenti tra loro!'\n )\n);\n\nvar _ref246 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Se la successione di variabili aleatorie ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'X_n'\n ),\n ' all\\'infinito ha la ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'stessa funzione di ripartizione'\n ),\n ' della popolazione ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'X'\n ),\n ', allora essa ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'converge in distribuzione'\n ),\n '.'\n);\n\nvar _ref247 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Se la successione di variabili aleatorie ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'X_n'\n ),\n ' all\\'infinito ha la ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'stessa probabilit\\xE0'\n ),\n ' della popolazione ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'X'\n ),\n ', allora essa ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'converge in probabilit\\xE0'\n ),\n '.'\n);\n\nvar _ref248 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Se la successione di variabili aleatorie ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'X_n'\n ),\n ' all\\'infinito ha la ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'stessa probabilit\\xE0 a '\n ),\n ' della popolazione ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'X'\n ),\n ', allora essa ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'converge quasi certamente'\n ),\n '.'\n);\n\nvar _ref249 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Se la successione di variabili aleatorie ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'X_n'\n ),\n ' all\\'infinito ha la ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'media del quadrato della distanza'\n ),\n ' tra la successione e la popolazione ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'X'\n ),\n ' ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'uguale a 0'\n ),\n ', allora essa ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'converge in media quadratica'\n ),\n '.'\n);\n\nvar _ref250 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'In pi\\xF9:'\n);\n\nvar _ref251 = Object(preact_min[\"h\"])(\n 'b',\n null,\n 'converge in probabilit\\xE0'\n);\n\nvar _ref252 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Ovvero:'\n);\n\nvar _ref253 = Object(preact_min[\"h\"])(\n 'b',\n null,\n 'converge quasi certamente'\n);\n\nvar _ref254 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Ovvero:'\n);\n\nvar _ref255 = Object(preact_min[\"h\"])(\n example_Example,\n null,\n 'Dimostra che l\\'interpretazione frequentista della probabilit\\xE0 \\xE8 valida!'\n);\n\nvar _ref256 = Object(preact_min[\"h\"])(\n 'b',\n null,\n 'converge in distribuzione'\n);\n\nvar _ref257 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Ovvero:'\n);\n\nvar _ref258 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'E\\' una somma di ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'bernoulliane'\n ),\n ', e quindi si approssima a una normale:'\n);\n\nvar _ref259 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'E\\' una somma di ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'geometriche'\n ),\n ', e quindi si approssima a una normale:'\n);\n\nvar _ref260 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'E\\' una somma di altre ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'poissoniane'\n ),\n ', e quindi si approssima a una normale:'\n);\n\nvar _ref261 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'E\\' una somma di ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'esponenziali'\n ),\n ', e quindi si approssima a una normale:'\n);\n\nvar _ref262 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Se ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'n'\n ),\n ' \\xE8 grande, allora:'\n);\n\nvar _ref263 = Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Parametri sconosciuti\" },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Per indicare parametri sconosciuti di una legge si usa ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n '\\\\theta'\n ),\n '.'\n )\n);\n\nvar _ref264 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Una variabile aleatoria funzione di un campione:'\n);\n\nvar _ref265 = Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Stimatore\" },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Una statistica ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'T_n'\n ),\n ' ottenuta da ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'n'\n ),\n ' osservazioni, che stimi i parametri di una legge e sia indipendente da essi.'\n )\n);\n\nvar _ref266 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Uno stimatore \\xE8 ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'corretto'\n ),\n ' se il suo valore atteso coincide con quello dei parametri che stima:'\n);\n\nvar _ref267 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Uno stimatore \\xE8 ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'asintoticamente corretto'\n ),\n ' se, per infinite osservazioni, il suo valore atteso coincide con quello dei parametri che stima:'\n);\n\nvar _ref268 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Uno stimatore \\xE8 ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'consistente in media quadratica'\n ),\n ' se:'\n);\n\nvar _ref269 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Uno stimatore \\xE8 ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'consistente in probabilit\\xE0'\n ),\n ' se:'\n);\n\nvar _ref270 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Uno stimatore \\xE8 ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'asintoticamente normale'\n ),\n ' se:'\n);\n\nvar _ref271 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Si pu\\xF2 usare il ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'metodo dei momenti'\n ),\n ' per ottenere uno stimatore di una popolazione ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'X'\n ),\n '.'\n);\n\nvar _ref272 = Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'M'\n);\n\nvar _ref273 = Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n '\\\\theta'\n);\n\nvar _ref274 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Visto che:'\n);\n\nvar _ref275 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Allora:'\n);\n\nvar _ref276 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Si pu\\xF2 usare il ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n 'metodo della massima verosomiglianza'\n ),\n ' per ottenere uno stimatore di una popolazione ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'X'\n ),\n '.'\n);\n\nvar _ref277 = Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'L'\n);\n\nvar _ref278 = Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n '\\\\theta'\n);\n\nvar _ref279 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Gli stimatori di massima verosomiglianza sono ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'asintoticamente corretti'\n ),\n ', ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'consistenti in probabilit\\xE0'\n ),\n ' e ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'asintoticamente normali'\n ),\n '.'\n);\n\nvar _ref280 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Gli stimatori di massima verosomiglianza godono delle seguenti propriet\\xE0:'\n);\n\nvar _ref281 = Object(preact_min[\"h\"])(\n 'li',\n null,\n 'Sono ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'asintoticamente corretti'\n ),\n '.'\n);\n\nvar _ref282 = Object(preact_min[\"h\"])(\n 'li',\n null,\n 'Sono ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'consistenti in probabilit\\xE0'\n ),\n '.'\n);\n\nvar _ref283 = Object(preact_min[\"h\"])(\n 'li',\n null,\n 'Sono ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'asintoticamente normali'\n ),\n '.'\n);\n\nvar _ref284 = Object(preact_min[\"h\"])(\n 'b',\n null,\n 'invarianti'\n);\n\nvar _ref285 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Per il metodo dei momenti oppure per il metodo della massima verosomiglianza:'\n);\n\nvar _ref286 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Per il metodo dei momenti oppure per il metodo della massima verosomiglianza:'\n);\n\nvar _ref287 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Per il metodo dei momenti oppure per il metodo della massima verosomiglianza:'\n);\n\nvar _ref288 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Per il metodo della massima verosomiglianza:'\n);\n\nvar _ref289 = Object(preact_min[\"h\"])('br', null);\n\nvar _ref290 = Object(preact_min[\"h\"])(\n 'blockquote',\n null,\n '\"intervallo di confidenza al 95%\"'\n);\n\nvar _ref291 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'L\\'intervallo di valori di ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n '\\\\theta'\n ),\n ' all\\'interno del quale siamo \"pi\\xF9 o meno sicuri\" si trovi il valore effettivo:'\n);\n\nvar _ref292 = Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n ']a, b['\n);\n\nvar _ref293 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Pu\\xF2 anche essere ',\n Object(preact_min[\"h\"])(\n 'b',\n null,\n 'unilatero'\n ),\n ' nel caso limiti la stima in una sola direzione, positiva o negativa.'\n);\n\nvar _ref294 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Se conosciamo la varianza di una normale, allora possiamo ricavare velocemente gli intervalli di confidenza all\\'',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n '\\\\alpha'\n ),\n '% con queste formule:'\n);\n\nvar _ref295 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Se non conosciamo la varianza di una normale, allora possiamo ricavare velocemente gli intervalli di confidenza all\\'',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n '\\\\alpha'\n ),\n '% con queste formule:'\n);\n\nvar _ref296 = Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'v'\n);\n\nvar _ref297 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'L\\'intervallo di confidenza per la proprorzione di una bernoulliana qualsiasi si ottiene da questa formula:'\n);\n\nvar _ref298 = Object(preact_min[\"h\"])(\n 'p',\n null,\n 'L\\'intervallo di confidenza per la media di una qualsiasi popolazione si ottiene da questa formula:'\n);\n\nvar statistica_Statistica = function (_Component) {\n statistica__inherits(Statistica, _Component);\n\n function Statistica() {\n statistica__classCallCheck(this, Statistica);\n\n return statistica__possibleConstructorReturn(this, _Component.apply(this, arguments));\n }\n\n Statistica.prototype.render = function render() {\n /*\n \n \n \n Gruppo intero di oggetti di cui si cercano informazioni.\n
\n \n \n \n Popolazione finita di oggetti concreti che possono essere campionati ciascuno solo una volta.\n
\n \n \n \n Popolazione di valori ottenuti da prove sperimentali indipendenti ripetute più volte.\n
\n \n \n \n \n \n Sottoinsieme della popolazione che contiene gli oggetti che si sono osservati.\n
\n \n Simple random sample}>\n \n Campione di una data dimensione in cui qualsiasi selezione di n elementi ha la stessa probabilità di costituire il campione.\n
\n \n Sample of convenience}>\n \n Campione ottenuto in un modo casuale non ben definito.\n
\n \n Sample with replacement}>\n \n Campione ottenuto sostituendo nella popolazione gli elementi estratti con dei nuovi elementi.\n
\n \n Dire che un campione è ottenuto with replacement è equivalente a dire che la popolazione che si sta campionando è infinita, e quindi che tutti gli elementi sono indipendenti.\n
\n \n \n \n Campione ottenuto da una popolazione in cui certi elementi hanno più probabilità di essere stati selezionati di altri.\n
\n \n Stratified random sample}>\n \n Campione ottenuto da un sottoinsieme della popolazione detto strato.\n
\n \n Cluster sample}>\n \n Campione ottenuto selezionando più cluster di elementi alla volta.\n
\n \n \n \n Sampling variation}>\n \n Differenza di informazioni presente tra due campioni diversi della stessa popolazione.\n
\n \n \n \n Gli elementi in un campione sono indipendenti se gli elementi estratti in precedenza non influsicono significativamente sulle probabilità di estrazione dell'elemento successivo.\n
\n \n \n \n \n \n Esperimento in cui c'è una sola popolazione da cui vengono estratti campioni.\n
\n \n Serve per verificare delle condizioni.\n
\n \n \n \n Esperimento in cui sono presenti più popolazioni (aventi caratteristiche differenti una dall'altra dette fattori) da cui vengono estratti campioni.\n
\n \n Serve per capire quali fattori influenzano il risultato dell'esperimento.\n
\n \n \n \n Numerico o quantitativo}>\n Il dato descrive un valore numerico relativo all'elemento, come ad esempio una quantità fisica.\n \n Categorico o qualitativo}>\n Il dato indica una categoria a cui appartiene l'elemento, come ad esempio il suo colore.\n \n \n */\n return Object(preact_min[\"h\"])(\n 'div',\n { style: statistica_default.a.statistica },\n statistica__ref,\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Tipi di probabilità\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Classica\" },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Frequentista\" },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject2)\n )\n )\n ),\n statistica__ref2\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Linguaggio matematico\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Spazio campionario\" },\n statistica__ref3,\n statistica__ref4,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject3)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Esito\" },\n statistica__ref5,\n statistica__ref6,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject4)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Evento\" },\n statistica__ref7,\n statistica__ref8,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject5)\n )\n ),\n statistica__ref9\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Not\" },\n statistica__ref10,\n statistica__ref11,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject6)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"And\" },\n statistica__ref12,\n statistica__ref13,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject7)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Or\" },\n statistica__ref14,\n statistica__ref15,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject8)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Differenza\" },\n statistica__ref16,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject9)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Implicazione\" },\n statistica__ref17,\n statistica__ref18,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject10)\n )\n ),\n statistica__ref19\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Evento impossibile\" },\n statistica__ref20,\n statistica__ref21,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject11)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Mutua esclusione\" },\n statistica__ref22,\n statistica__ref23,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject12)\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n null,\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Famiglia degli eventi\" },\n statistica__ref24,\n statistica__ref25,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject13)\n )\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Qualsiasi sottoinsieme appartenente a ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject13)\n ),\n ' \\xE8 considerato un evento.'\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: Object(preact_min[\"h\"])(\n 'span',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject14)\n ),\n '-algebra'\n ) },\n statistica__ref26,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Se la famiglia degli eventi soddisfa questi tre requisiti, allora viene detta ',\n Object(preact_min[\"h\"])(\n 'i',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject14)\n ),\n '-algebra'\n ),\n ':'\n ),\n Object(preact_min[\"h\"])(\n 'ol',\n null,\n Object(preact_min[\"h\"])(\n 'li',\n null,\n 'Lo spazio campionario \\xE8 un evento: ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject15)\n )\n ),\n Object(preact_min[\"h\"])(\n 'li',\n null,\n 'Se un sottoinsieme \\xE8 un evento, allora anche il suo complementare lo \\xE8: ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject16)\n )\n ),\n Object(preact_min[\"h\"])(\n 'li',\n null,\n 'Se due sottoinsiemi sono eventi, allora lo sono anche la loro unione e intersezione: ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject17)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Un esempio: ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject18)\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n null,\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Partizione\" },\n statistica__ref27,\n statistica__ref28,\n statistica__ref29,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La partizione ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject19)\n ),\n ' \\xE8 composta dagli eventi ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject20)\n ),\n ', ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject21)\n ),\n ', ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject22)\n ),\n ', fino a ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject23)\n ),\n '.'\n ),\n statistica__ref30\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Assiomi della probabilità\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Primo assioma della probabilità\" },\n statistica__ref31,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject24)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Secondo assioma della probabilità\" },\n statistica__ref32,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject25)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Terzo assioma della probabilità\" },\n statistica__ref33,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject26)\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Conseguenze degli assiomi\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Probabilità di un evento negato\" },\n statistica__ref34,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject27)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Probabilità di un evento incluso\" },\n statistica__ref35,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject28)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Unione\" },\n statistica__ref36,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject29)\n )\n ),\n statistica__ref37\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Spazi equiprobabili\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Cosa sono?\" },\n statistica__ref38,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject30)\n )\n )\n ),\n statistica__ref39\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Calcolo combinatorio\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Disposizioni\" },\n statistica__ref40,\n statistica__ref41,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject31)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Disposizioni con ripetizione\" },\n statistica__ref42,\n statistica__ref43,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject32)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Combinazioni\" },\n statistica__ref44,\n statistica__ref45,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject33)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Combinazioni con ripetizione\" },\n statistica__ref46,\n statistica__ref47,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject34)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Permutazioni\" },\n statistica__ref48,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject35)\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Probabilità condizionata\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Eventi condizionati\" },\n statistica__ref49,\n statistica__ref50,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject36)\n )\n ),\n statistica__ref51\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Eventi mutualmente esclusivi\" },\n statistica__ref52,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject37)\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n null,\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Regola della catena\" },\n statistica__ref53,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject38)\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Le alternative\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Legge delle alternative\" },\n statistica__ref54,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject39)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Legge condizionata delle alternative\" },\n statistica__ref55,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject40)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Formula di Bayes\" },\n statistica__ref56,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject41)\n )\n ),\n statistica__ref57\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Eventi indipendenti\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Due eventi indipendenti\" },\n statistica__ref58,\n statistica__ref59,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject42)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Più eventi indipendenti\" },\n statistica__ref60,\n statistica__ref61,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject43)\n )\n ),\n statistica__ref62\n ),\n statistica__ref63\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Variabili aleatorie\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Variabile aleatoria\" },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Una funzione che fa corrispondere un numero reale a ogni possibile esito dello spazio campionario. ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject44)\n ),\n '.'\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: statistica__ref64 },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Ad ogni variabile aleatoria sono associati gli eventi ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject45)\n ),\n ', che contengono tutti gli esiti a cui la variabile aleatoria associa un valore minore o uguale a ',\n statistica__ref65,\n '.'\n ),\n statistica__ref66,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject46)\n )\n ),\n statistica__ref67\n ),\n statistica__ref68\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Densità\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Funzione probabilità\" },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La ',\n statistica__ref69,\n ' ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject47)\n ),\n ' di una variabile aleatoria ',\n statistica__ref70,\n ' ',\n statistica__ref71,\n ' \\xE8 la funzione che associa ad ogni esito la sua probabilit\\xE0:'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject48)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Funzione densità\" },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La ',\n statistica__ref72,\n ' ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject49)\n ),\n ' di una variabile aleatoria ',\n statistica__ref73,\n ' ',\n statistica__ref74,\n ' \\xE8 l\\'equivalente continuo della funzione probabilit\\xE0:'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject50)\n )\n ),\n statistica__ref75,\n statistica__ref76\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Funzione di ripartizione\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Definizione\" },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Ogni variabile aleatoria ha una ',\n statistica__ref77,\n ' ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject51)\n ),\n ' associata, che rappresenta la probabilit\\xE0 che la variabile aleatoria assuma un valore minore o uguale a ',\n statistica__ref78,\n ':'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Si pu\\xF2 dire che essa rappresenti la probabilit\\xE0 dell\\'evento ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject52)\n ),\n ':'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject53)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Proprietà della funzione\" },\n Object(preact_min[\"h\"])(\n 'ul',\n null,\n statistica__ref79,\n statistica__ref80,\n statistica__ref81,\n statistica__ref82,\n Object(preact_min[\"h\"])(\n 'li',\n null,\n '\\xC8 ',\n statistica__ref83,\n ': ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject54)\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Probabilità di un valore\" },\n statistica__ref84,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject55)\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Trasformazioni di variabili aleatorie\" },\n statistica__ref85,\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Nel continuo (invertibile)\" },\n statistica__ref86,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject56)\n )\n )\n ),\n statistica__ref87\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Informazioni delle variabili aleatorie\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Media\" },\n statistica__ref88,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject57)\n )\n ),\n statistica__ref89,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject58)\n )\n ),\n statistica__ref90,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject59)\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n null,\n statistica__ref91,\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Quantili\" },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Il ',\n statistica__ref92,\n ' ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject60)\n ),\n ' di ordine ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject61)\n ),\n ' della variabile aleatoria ',\n statistica__ref93,\n ' \\xE8 il pi\\xF9 piccolo numero tale che:'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject62)\n )\n ),\n statistica__ref94,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Il quantile di ordine 0.5 ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject63)\n ),\n ' \\xE8 detto ',\n statistica__ref95,\n '.'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'I quantili di ordine 0.25 ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject64)\n ),\n ' e 0.75 ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject65)\n ),\n ' sono detti ',\n statistica__ref96,\n '.'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'I quantili di ordine ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject66)\n ),\n ' sono detti ',\n statistica__ref97,\n '.'\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Varianza\" },\n statistica__ref98,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject67)\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Disuguaglianze notevoli\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Disuguaglianza di Markov\" },\n statistica__ref99,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject68)\n )\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Divide in due parti (',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject69)\n ),\n ' e ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject70)\n ),\n ') la funzione X, la cui media risulter\\xE0 uguale a:'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject71)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Disuguaglianza di Čebyšëv\" },\n statistica__ref100,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Se la variabile aleatoria ',\n statistica__ref101,\n ' ha media e varianza, allora la probabilit\\xE0 che essa abbia un valore a pi\\xF9 di ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject72)\n ),\n ' di distanza dal valore medio \\xE8 minore o uguale a ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject73)\n ),\n '.'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject74)\n )\n ),\n statistica__ref102,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject75)\n )\n ),\n statistica__ref103\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Un momento...!\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Momento\" },\n statistica__ref104,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject76)\n )\n ),\n statistica__ref105\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Funzione generatrice dei momenti\" },\n statistica__ref106,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject77)\n )\n ),\n statistica__ref107,\n statistica__ref108\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Funzione caratteristica\" },\n statistica__ref109,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject78)\n )\n ),\n statistica__ref110,\n statistica__ref111\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Prove e schemi\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Variabile con distribuzione\" },\n statistica__ref112,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject79)\n )\n )\n ),\n statistica__ref113,\n statistica__ref114\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Bernoulliana\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Distribuzione bernoulliana\" },\n statistica__ref115,\n statistica__ref116,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Il suo simbolo \\xE8 ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject80)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Densità della bernoulliana\" },\n statistica__ref117,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject81)\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Binomiale\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Distribuzione binomiale\" },\n statistica__ref118,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Il suo simbolo \\xE8 ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject82)\n ),\n '.'\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Densità della binomiale\" },\n statistica__ref119,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject83)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Momenti della binomiale\" },\n statistica__ref120,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject84)\n )\n ),\n statistica__ref121,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject85)\n )\n ),\n statistica__ref122,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject86)\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Geometrica\" },\n statistica__ref123,\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Densità della geometrica\" },\n statistica__ref124,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject87)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Momenti della geometrica\" },\n statistica__ref125,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject88)\n )\n ),\n statistica__ref126,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject89)\n )\n ),\n statistica__ref127,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject90)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Assenza di memoria della geometrica\" },\n statistica__ref128,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject91)\n )\n ),\n statistica__ref129\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Binomiale negativa\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Distribuzione binomiale negativa\" },\n statistica__ref130,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Il suo simbolo \\xE8 ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject92)\n ),\n '.'\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Densità della binomiale negativa\" },\n statistica__ref131,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject93)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Momenti della binomiale negativa\" },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n statistica__ref132,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject94)\n )\n ),\n statistica__ref133,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject95)\n )\n ),\n statistica__ref134,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject96)\n )\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Geometrica traslata\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Distribuzione geometrica traslata\" },\n statistica__ref135,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Il suo simbolo rimane ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject97)\n ),\n '.'\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Densità della geometrica tralsata\" },\n statistica__ref136,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject98)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Momenti della geometrica traslata\" },\n statistica__ref137,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject99)\n )\n ),\n statistica__ref138,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject100)\n )\n ),\n statistica__ref139,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject90)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Assenza di memoria della geometrica traslata\" },\n statistica__ref140,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject91)\n )\n ),\n statistica__ref141\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Binomiale negativa traslata\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Distribuzione binomiale negativa traslata\" },\n statistica__ref142,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Il suo simbolo rimane ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject92)\n ),\n '.'\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Densità della binomiale negativa traslata\" },\n statistica__ref143,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject101)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Momenti della binomiale negativa traslata\" },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n statistica__ref144,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject102)\n )\n ),\n statistica__ref145,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject103)\n )\n ),\n statistica__ref146,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject96)\n )\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Ipergeometrica\" },\n statistica__ref147,\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Densità della ipergeometrica\" },\n statistica__ref148,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject104)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Momenti della ipergeometrica\" },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n statistica__ref149,\n statistica__ref150,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject105)\n )\n ),\n statistica__ref151,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject106)\n )\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Poissoniana\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Distribuzione poissoniana\" },\n statistica__ref152,\n Object(preact_min[\"h\"])(\n 'ul',\n null,\n Object(preact_min[\"h\"])(\n 'li',\n null,\n 'Binomiale: ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject107)\n )\n ),\n Object(preact_min[\"h\"])(\n 'li',\n null,\n 'Il numero di prove tende a infinito: ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject108)\n )\n ),\n Object(preact_min[\"h\"])(\n 'li',\n null,\n 'La probabilit\\xE0 di successo tende a 0: ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject109)\n )\n ),\n Object(preact_min[\"h\"])(\n 'li',\n null,\n 'La media \\xE8 finita: ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject110)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Il suo simbolo \\xE8 ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject111)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Densità della poissoniana\" },\n statistica__ref153,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject112)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Momenti della poissoniana\" },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n statistica__ref154,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject113)\n )\n ),\n statistica__ref155,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject114)\n )\n ),\n statistica__ref156,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject115)\n )\n ),\n statistica__ref157,\n Object(preact_min[\"h\"])(\n 'ol',\n { start: 2 },\n Object(preact_min[\"h\"])(\n 'li',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject116)\n )\n )\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Un altro schema\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Schema di Poisson\" },\n statistica__ref158,\n Object(preact_min[\"h\"])(\n 'ul',\n null,\n statistica__ref159,\n Object(preact_min[\"h\"])(\n 'li',\n null,\n 'hanno intensit\\xE0 ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject117)\n ),\n ' costante.'\n ),\n statistica__ref160\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Processo di Poisson\" },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Una variabile aleatoria ',\n statistica__ref161,\n ' che conta il numero di arrivi di uno schema di Poisson di intensit\\xE0 ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject117)\n ),\n ' in un intervallo di tempo di durata ',\n statistica__ref162,\n '.'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'E\\' una distribuzione poissoniana con ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject118)\n ),\n ': ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject119)\n )\n ),\n statistica__ref163\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Esponenziale\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Distribuzione esponenziale\" },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Una variabile aleatoria che conta il tempo diwidehattesa prima del primo arrivo di un processo di Poisson di intensit\\xE0 ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject117)\n ),\n '.'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Il suo simbolo \\xE8 ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject120)\n ),\n '.'\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Densità dell'esponenziale\" },\n statistica__ref164,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject121)\n )\n ),\n statistica__ref165,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject122)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Momenti dell'esponenziale\" },\n statistica__ref166,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject123)\n )\n ),\n _ref167,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject124)\n )\n ),\n _ref168,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject125)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Assenza di memoria della esponenziale\" },\n _ref169,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject126)\n )\n ),\n _ref170\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Legge gamma\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Distribuzione gamma\" },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Una variabile aleatoria che conta il tempo diwidehattesa prima dell\\'',\n _ref171,\n '-esimo arrivo di un processo di Poisson di intensit\\xE0 ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject117)\n ),\n '.'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Il suo simbolo \\xE8 ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject127)\n ),\n '.'\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Densità della legge gamma\" },\n _ref172,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject128)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Momenti della legge gamma\" },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n _ref173,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject129)\n )\n ),\n _ref174,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject130)\n )\n ),\n _ref175,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject131)\n )\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Uniforme\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Distribuzione uniforme\" },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Una variabile aleatoria che pu\\xF2 assumere qualsiasi valore in un intervallo ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject132)\n ),\n ' in modo equiprobabile.'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Il suo simbolo \\xE8 ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject133)\n )\n ),\n _ref176,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject134)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Densità della distribuzione uniforme\" },\n _ref177,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject135)\n )\n ),\n _ref178,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject136)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Momenti della distribuzione uniforme\" },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n _ref179,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject137)\n )\n ),\n _ref180,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject138)\n )\n ),\n _ref181,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject139)\n )\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Normale o Gaussiana\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Distribuzione normale\" },\n _ref182,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Il suo simbolo \\xE8 ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject140)\n ),\n '.'\n ),\n _ref183\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Densità della distribuzione normale\" },\n _ref184,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject141)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Momenti della distribuzione normale\" },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n _ref185,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject142)\n )\n ),\n _ref186,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(statistica__templateObject114)\n )\n ),\n _ref187,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject143)\n )\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n null,\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Trasformazione della normale\" },\n _ref188,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject144)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Normale standard\" },\n _ref189,\n _ref190,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La sua funzione di ripartizione \\xE8 detta ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject145)\n ),\n ' e vale:'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject146)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Quantili normali\" },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Da un quantile ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject147)\n ),\n ' della normale standard \\xE8 possibile risalire allo stesso quantile di qualsiasi altra normale:'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject148)\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n null,\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Gamma e normale\" },\n _ref191,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject149)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"La funzione Chi\" },\n _ref192,\n _ref193,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject150)\n )\n ),\n _ref194,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject151)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"T di Student\" },\n _ref195,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject152)\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Approssimazioni notevoli\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Ipergeometrica e binomiale\" },\n _ref196,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject153)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Binomiale e poissoniana\" },\n _ref197,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject154)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Binomiale e normale\" },\n _ref198,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject155)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Correzione di Yates\" },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Passando da una variabile discreta ',\n _ref199,\n ' a una continua ',\n _ref200,\n ', per ogni valore discreto ',\n _ref201,\n ' la probabilit\\xE0 viene \"spalmata\" su tutto l\\'intervallo ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject156)\n ),\n ':'\n ),\n Object(preact_min[\"h\"])(\n 'ul',\n null,\n Object(preact_min[\"h\"])(\n 'li',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject157)\n )\n ),\n Object(preact_min[\"h\"])(\n 'li',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject158)\n )\n ),\n Object(preact_min[\"h\"])(\n 'li',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject159)\n )\n ),\n Object(preact_min[\"h\"])(\n 'li',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject160)\n )\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Vettori aleatori\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Vettore aleatorio\" },\n _ref202,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Il suo simbolo generalmente \\xE8 ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject161)\n ),\n ' oppure ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject162)\n ),\n '.'\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Funzioni di ripartizione\" },\n _ref203,\n _ref204,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject163)\n )\n ),\n _ref205,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject164)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Densità discreta\" },\n _ref206,\n _ref207,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject165)\n )\n ),\n _ref208,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject166)\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Più variabili aleatorie\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Indipendenza delle variabili aleatorie\" },\n _ref209,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject167)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Media dei vettori aleatori\" },\n _ref210,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject168)\n )\n ),\n _ref211,\n _ref212,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject169)\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n null,\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Covarianza\" },\n _ref213,\n _ref214,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject170)\n )\n ),\n _ref215,\n Object(preact_min[\"h\"])(\n 'ul',\n null,\n Object(preact_min[\"h\"])(\n 'li',\n null,\n 'Il suo ',\n _ref216,\n ' \\xE8 0: ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject171)\n )\n ),\n Object(preact_min[\"h\"])(\n 'li',\n null,\n 'E\\' ',\n _ref217,\n ': ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject172)\n )\n ),\n Object(preact_min[\"h\"])(\n 'li',\n null,\n 'E\\' ',\n _ref218,\n ': ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject173)\n )\n ),\n Object(preact_min[\"h\"])(\n 'li',\n null,\n 'E\\' ',\n _ref219,\n ': ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject174)\n )\n ),\n Object(preact_min[\"h\"])(\n 'li',\n null,\n 'E\\' ',\n _ref220,\n ': ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject175)\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Variabili incorrelate\" },\n _ref221,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject176)\n )\n ),\n _ref222\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Matrice di covarianza\" },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Una matrice ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject177)\n ),\n ' che contiene la covarianza tra tutte le variabili di un vettore aleatorio ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject161)\n ),\n ':'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject178)\n )\n ),\n _ref223\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Coefficiente di correlazione\" },\n _ref224,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject179)\n )\n ),\n _ref225,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject180)\n )\n ),\n _ref226,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject181)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Varianza di variabili aleatorie sommate\" },\n _ref227,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject182)\n )\n ),\n _ref228,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Se pi\\xF9 variabili aleatorie ',\n _ref229,\n ' sono ',\n _ref230,\n ' (',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject176)\n ),\n '), allora:'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject183)\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Campioni\" },\n _ref231,\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Momento campionario\" },\n _ref232,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject184)\n )\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Il momento campionario di primo ordine \\xE8 la ',\n _ref233,\n ' ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject185)\n ),\n '.'\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Varianza campionaria\" },\n _ref234,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Se \\xE8 noto il valore medio ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject186)\n ),\n ' di X:'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject187)\n )\n ),\n _ref235,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject188)\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Media-ception\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Media campionaria\" },\n _ref236,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject189)\n )\n ),\n _ref237\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Varianza campionaria\" },\n _ref238,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject190)\n )\n ),\n _ref239\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Correzione campionaria\" },\n _ref240,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject191)\n )\n ),\n _ref241\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Campionamento di una distribuzione normale\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Campionamento di una distribuzione normale\" },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Se la popolazione ',\n _ref242,\n ' ha una distribuzione normale (',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject192)\n ),\n ')...'\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Distribuzione della media campionaria\" },\n _ref243,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject193)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Distribuzione della varianza campionaria\" },\n _ref244,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject194)\n )\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject195)\n )\n )\n ),\n _ref245\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Quando i campioni hanno dimensioni infinite\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Convergenza in distribuzione\" },\n _ref246,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n '\\\\lim_{n \\\\to +\\\\infty} F_{X_n} (x) = F_X (x) \\\\implies X_n \\\\xrightarrow{d} X'\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Convergenza in probabilità\" },\n _ref247,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n '\\\\forall \\\\epsilon > 0, \\\\lim_{n \\\\to +\\\\infty} P( | X_n - X | < \\\\epsilon) = 1 \\\\implies X_n \\\\xrightarrow{p} X'\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Convergenza quasi certa\" },\n _ref248,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n '\\\\forall \\\\epsilon > 0, P left( \\\\lim_{n \\\\to +\\\\infty} | X_n - X | < \\\\epsilon) \\right) = 1 \\\\implies X_n \\\\xrightarrow{qc} X'\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Convergenza in media quadratica\" },\n _ref249,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n '\\\\lim_{n \\\\to +\\\\infty} E( | X_n - X |^2 = 0 \\\\implies X_n \\\\xrightarrow{mq} X'\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Gerarchia delle convergenze\" },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n '\\n \\\\begin{matrix}\\n X_n \\\\xrightarrow{mq} X\\\\\\\\\\n X_n \\\\xrightarrow{qc} X\\n \\\\end{matrix} \\\\implies X_n \\\\xrightarrow{p} X \\\\implies X_n \\\\xrightarrow{d} X'\n )\n ),\n _ref250,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n 'X_n \\\\xrightarrow{p} x \\\\Longleftrightarrow X_n \\\\xrightarrow{d} x'\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"I grandi numeri\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Legge debole dei grandi numeri\" },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La successione delle medie campionarie ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject185)\n ),\n ' ',\n _ref251,\n ' alla media della popolazione ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject196)\n ),\n ', se essa esiste.'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n '\\\\overline{X}_n \\\\xrightarrow{p} X'\n )\n ),\n _ref252,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject197)\n )\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject198)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Legge forte dei grandi numeri\" },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La successione delle medie campionarie ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject185)\n ),\n ' ',\n _ref253,\n ' alla media della popolazione ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject196)\n ),\n ', se essa esiste.'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n '\\\\overline{X}_n \\\\xrightarrow{qc} X'\n )\n ),\n _ref254,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject199)\n )\n ),\n _ref255\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Al limite\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Teorema centrale del limite\" },\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'La successione delle medie campionarie ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject185)\n ),\n ' ',\n _ref256,\n ' a ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject200)\n ),\n '.'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject201)\n )\n ),\n _ref257,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject202)\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Altre approsimazioni\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Binomiale e normale\" },\n _ref258,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject155)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Binomiale negativa e normale\" },\n _ref259,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject203)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Poissoniana e normale\" },\n _ref260,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject204)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Gamma e normale\" },\n _ref261,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject205)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"In generale\" },\n _ref262,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject206)\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Actually statistica\" },\n _ref263,\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Statistica\" },\n _ref264,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject207)\n )\n ),\n Object(preact_min[\"h\"])(\n example_Example,\n null,\n 'Ad esempio, sono statistiche media e varianza campionaria, cos\\xEC come il campione stesso ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject208)\n ),\n '.'\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Stimatori\" },\n _ref265,\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Corretto\" },\n _ref266,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject209)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Asintoticamente corretto\" },\n _ref267,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject210)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Consistente in media quadratica\" },\n _ref268,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject211)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Consistente in probabilità\" },\n _ref269,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject212)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Asintoticamente normale\" },\n _ref270,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject213)\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Metodo dei momenti\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Metodo dei momenti\" },\n _ref271,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Lo stimatore di ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject214)\n ),\n ' cos\\xEC ottenuto sar\\xE0 indicato aggiungendo un cappellino e una ',\n _ref272,\n ' a ',\n _ref273,\n ': ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject215)\n )\n ),\n _ref274,\n Object(preact_min[\"h\"])(\n 'ul',\n null,\n Object(preact_min[\"h\"])(\n 'li',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject216)\n )\n ),\n Object(preact_min[\"h\"])(\n 'li',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject217)\n )\n )\n ),\n _ref275,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject218)\n )\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Se ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject214)\n ),\n ' non \\xE8 esprimibile in termini di ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject196)\n ),\n ', si possono usare i momenti successivi ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject219)\n ),\n ', ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject220)\n ),\n ', ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject220)\n ),\n '...'\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Metodo della massima verosomiglianza\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Metodo della massima verosomiglianza\" },\n _ref276,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Lo stimatore di ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject214)\n ),\n ' cos\\xEC ottenuto sar\\xE0 indicato aggiungendo un cappellino e una ',\n _ref277,\n ' a ',\n _ref278,\n ': ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject221)\n )\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'Consiste nel trovare il massimo assoluto ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject221)\n ),\n ' della la funzione di verosomiglianza ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject222)\n ),\n ':'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject223)\n )\n ),\n _ref279\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Proprietà degli stimatori di massima verosomiglianza\" },\n _ref280,\n Object(preact_min[\"h\"])(\n 'ul',\n null,\n _ref281,\n _ref282,\n _ref283,\n Object(preact_min[\"h\"])(\n 'li',\n null,\n 'Sono ',\n _ref284,\n ': ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject224)\n )\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Nuove stime notevoli\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Stima di una bernoulliana\" },\n _ref285,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject225)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Stima di una poissoniana\" },\n _ref286,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject226)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Stima di una esponenziale\" },\n _ref287,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject227)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Stima di una normale\" },\n _ref288,\n Object(preact_min[\"h\"])(\n 'ul',\n null,\n Object(preact_min[\"h\"])(\n 'li',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject228)\n )\n ),\n _ref289,\n Object(preact_min[\"h\"])(\n 'li',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject229)\n )\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Intervalli di confidenza\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Confidenza\" },\n _ref290,\n _ref291,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n 'L\\'intervallo di confidenza a N della stima ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject230)\n ),\n ' \\xE8 l\\'intervallo ',\n _ref292,\n ' tale che:'\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject231)\n )\n ),\n _ref293\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Confidenza nella media di una normale\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Varianza nota\" },\n _ref294,\n Object(preact_min[\"h\"])(\n 'ul',\n null,\n Object(preact_min[\"h\"])(\n 'li',\n null,\n 'Intervalli bilateri: ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject232)\n )\n ),\n Object(preact_min[\"h\"])(\n 'li',\n null,\n 'Intervallo unilatero da sinistra: ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject233)\n )\n ),\n Object(preact_min[\"h\"])(\n 'li',\n null,\n 'Intervallo unilatero da destra: ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject234)\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Varianza incognita\" },\n _ref295,\n Object(preact_min[\"h\"])(\n 'ul',\n null,\n Object(preact_min[\"h\"])(\n 'li',\n null,\n 'Intervalli bilateri: ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject235)\n )\n ),\n Object(preact_min[\"h\"])(\n 'li',\n null,\n 'Intervallo unilatero da sinistra: ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject236)\n )\n ),\n Object(preact_min[\"h\"])(\n 'li',\n null,\n 'Intervallo unilatero da destra: ',\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject237)\n )\n )\n ),\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject238)\n ),\n ' \\xE8 un quantile della distribuzione di Student di parametro ',\n _ref296,\n '.'\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Confidenza per la proporzione di una bernoulliana\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Terzo metodo corretto\" },\n _ref297,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject239)\n )\n )\n )\n ),\n Object(preact_min[\"h\"])(\n split_Split,\n { title: \"Confidenza per la media di qualsiasi popolazione\" },\n Object(preact_min[\"h\"])(\n panel_Panel,\n { title: \"Approssimando con la normale\" },\n _ref298,\n Object(preact_min[\"h\"])(\n 'p',\n null,\n Object(preact_min[\"h\"])(\n latex_Latex,\n null,\n statistica_r(_templateObject240)\n )\n )\n )\n )\n );\n };\n\n return Statistica;\n}(preact_min[\"Component\"]);\n\n\n// CONCATENATED MODULE: ./index.js\n/* harmony export (binding) */ __webpack_require__.d(__webpack_exports__, \"default\", function() { return App; });\n\n\nfunction index__classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction index__possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return call && (typeof call === \"object\" || typeof call === \"function\") ? call : self; }\n\nfunction index__inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function, not \" + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; }\n\n\n\n\n\n\n\n\n\n\n\n\n// noinspection JSUnusedGlobalSymbols\n\nvar index__ref = Object(preact_min[\"h\"])(\n\t'div',\n\t{ id: 'app' },\n\tObject(preact_min[\"h\"])(\n\t\t'h1',\n\t\tnull,\n\t\tObject(preact_min[\"h\"])(\n\t\t\t'a',\n\t\t\t{ href: '/' },\n\t\t\t'Appuntiweb'\n\t\t),\n\t\t' ',\n\t\tObject(preact_min[\"h\"])(\n\t\t\t'small',\n\t\t\tnull,\n\t\t\t'di ',\n\t\t\tObject(preact_min[\"h\"])(\n\t\t\t\t'a',\n\t\t\t\t{ href: 'https://steffo.eu/' },\n\t\t\t\t'Steffo'\n\t\t\t)\n\t\t)\n\t),\n\tObject(preact_min[\"h\"])(\n\t\tpreact_router_es,\n\t\tnull,\n\t\tObject(preact_min[\"h\"])(home_Home, { path: '/' }),\n\t\tObject(preact_min[\"h\"])(fisica_Fisica, { path: '/fisica' }),\n\t\tObject(preact_min[\"h\"])(vldigeometria_VlDiGeometria, { path: '/vldigeometria' }),\n\t\tObject(preact_min[\"h\"])(mingwinstall_MingwInstall, { path: '/mingwinstall' }),\n\t\tObject(preact_min[\"h\"])(statistica_Statistica, { path: '/statistica' })\n\t),\n\tObject(preact_min[\"h\"])(copyright_Copyright, null)\n);\n\nvar App = function (_Component) {\n\tindex__inherits(App, _Component);\n\n\tfunction App() {\n\t\tindex__classCallCheck(this, App);\n\n\t\treturn index__possibleConstructorReturn(this, _Component.apply(this, arguments));\n\t}\n\n\tApp.prototype.render = function render() {\n\t\treturn index__ref;\n\t};\n\n\treturn App;\n}(preact_min[\"Component\"]);\n\n\n\n/***/ }),\n\n/***/ \"KM04\":\n/***/ (function(module, exports, __webpack_require__) {\n\n!function () {\n \"use strict\";\n function e(e, t) {\n var n,\n o,\n r,\n i,\n l = W;for (i = arguments.length; i-- > 2;) {\n P.push(arguments[i]);\n }t && null != t.children && (P.length || P.push(t.children), delete t.children);while (P.length) {\n if ((o = P.pop()) && void 0 !== o.pop) for (i = o.length; i--;) {\n P.push(o[i]);\n } else \"boolean\" == typeof o && (o = null), (r = \"function\" != typeof e) && (null == o ? o = \"\" : \"number\" == typeof o ? o += \"\" : \"string\" != typeof o && (r = !1)), r && n ? l[l.length - 1] += o : l === W ? l = [o] : l.push(o), n = r;\n }var a = new T();return a.nodeName = e, a.children = l, a.attributes = null == t ? void 0 : t, a.key = null == t ? void 0 : t.key, void 0 !== M.vnode && M.vnode(a), a;\n }function t(e, t) {\n for (var n in t) {\n e[n] = t[n];\n }return e;\n }function n(e, t) {\n e && (\"function\" == typeof e ? e(t) : e.current = t);\n }function o(n, o) {\n return e(n.nodeName, t(t({}, n.attributes), o), arguments.length > 2 ? [].slice.call(arguments, 2) : n.children);\n }function r(e) {\n !e.__d && (e.__d = !0) && 1 == V.push(e) && (M.debounceRendering || D)(i);\n }function i() {\n var e;while (e = V.pop()) {\n e.__d && x(e);\n }\n }function l(e, t, n) {\n return \"string\" == typeof t || \"number\" == typeof t ? void 0 !== e.splitText : \"string\" == typeof t.nodeName ? !e._componentConstructor && a(e, t.nodeName) : n || e._componentConstructor === t.nodeName;\n }function a(e, t) {\n return e.__n === t || e.nodeName.toLowerCase() === t.toLowerCase();\n }function u(e) {\n var n = t({}, e.attributes);n.children = e.children;var o = e.nodeName.defaultProps;if (void 0 !== o) for (var r in o) {\n void 0 === n[r] && (n[r] = o[r]);\n }return n;\n }function c(e, t) {\n var n = t ? document.createElementNS(\"http://www.w3.org/2000/svg\", e) : document.createElement(e);return n.__n = e, n;\n }function p(e) {\n var t = e.parentNode;t && t.removeChild(e);\n }function s(e, t, o, r, i) {\n if (\"className\" === t && (t = \"class\"), \"key\" === t) ;else if (\"ref\" === t) n(o, null), n(r, e);else if (\"class\" !== t || i) {\n if (\"style\" === t) {\n if (r && \"string\" != typeof r && \"string\" != typeof o || (e.style.cssText = r || \"\"), r && \"object\" == typeof r) {\n if (\"string\" != typeof o) for (var l in o) {\n l in r || (e.style[l] = \"\");\n }for (var l in r) {\n e.style[l] = \"number\" == typeof r[l] && !1 === E.test(l) ? r[l] + \"px\" : r[l];\n }\n }\n } else if (\"dangerouslySetInnerHTML\" === t) r && (e.innerHTML = r.__html || \"\");else if (\"o\" == t[0] && \"n\" == t[1]) {\n var a = t !== (t = t.replace(/Capture$/, \"\"));t = t.toLowerCase().substring(2), r ? o || e.addEventListener(t, _, a) : e.removeEventListener(t, _, a), (e.__l || (e.__l = {}))[t] = r;\n } else if (\"list\" !== t && \"type\" !== t && !i && t in e) {\n try {\n e[t] = null == r ? \"\" : r;\n } catch (e) {}null != r && !1 !== r || \"spellcheck\" == t || e.removeAttribute(t);\n } else {\n var u = i && t !== (t = t.replace(/^xlink:?/, \"\"));null == r || !1 === r ? u ? e.removeAttributeNS(\"http://www.w3.org/1999/xlink\", t.toLowerCase()) : e.removeAttribute(t) : \"function\" != typeof r && (u ? e.setAttributeNS(\"http://www.w3.org/1999/xlink\", t.toLowerCase(), r) : e.setAttribute(t, r));\n }\n } else e.className = r || \"\";\n }function _(e) {\n return this.__l[e.type](M.event && M.event(e) || e);\n }function f() {\n var e;while (e = A.shift()) {\n M.afterMount && M.afterMount(e), e.componentDidMount && e.componentDidMount();\n }\n }function d(e, t, n, o, r, i) {\n H++ || (R = null != r && void 0 !== r.ownerSVGElement, B = null != e && !(\"__preactattr_\" in e));var l = h(e, t, n, o, i);return r && l.parentNode !== r && r.appendChild(l), --H || (B = !1, i || f()), l;\n }function h(e, t, n, o, r) {\n var i = e,\n l = R;if (null != t && \"boolean\" != typeof t || (t = \"\"), \"string\" == typeof t || \"number\" == typeof t) return e && void 0 !== e.splitText && e.parentNode && (!e._component || r) ? e.nodeValue != t && (e.nodeValue = t) : (i = document.createTextNode(t), e && (e.parentNode && e.parentNode.replaceChild(i, e), v(e, !0))), i.__preactattr_ = !0, i;var u = t.nodeName;if (\"function\" == typeof u) return N(e, t, n, o);if (R = \"svg\" === u || \"foreignObject\" !== u && R, u += \"\", (!e || !a(e, u)) && (i = c(u, R), e)) {\n while (e.firstChild) {\n i.appendChild(e.firstChild);\n }e.parentNode && e.parentNode.replaceChild(i, e), v(e, !0);\n }var p = i.firstChild,\n s = i.__preactattr_,\n _ = t.children;if (null == s) {\n s = i.__preactattr_ = {};for (var f = i.attributes, d = f.length; d--;) {\n s[f[d].name] = f[d].value;\n }\n }return !B && _ && 1 === _.length && \"string\" == typeof _[0] && null != p && void 0 !== p.splitText && null == p.nextSibling ? p.nodeValue != _[0] && (p.nodeValue = _[0]) : (_ && _.length || null != p) && m(i, _, n, o, B || null != s.dangerouslySetInnerHTML), y(i, t.attributes, s), R = l, i;\n }function m(e, t, n, o, r) {\n var i,\n a,\n u,\n c,\n s,\n _ = e.childNodes,\n f = [],\n d = {},\n m = 0,\n b = 0,\n y = _.length,\n g = 0,\n w = t ? t.length : 0;if (0 !== y) for (var C = 0; C < y; C++) {\n var x = _[C],\n N = x.__preactattr_,\n k = w && N ? x._component ? x._component.__k : N.key : null;null != k ? (m++, d[k] = x) : (N || (void 0 !== x.splitText ? !r || x.nodeValue.trim() : r)) && (f[g++] = x);\n }if (0 !== w) for (var C = 0; C < w; C++) {\n c = t[C], s = null;var k = c.key;if (null != k) m && void 0 !== d[k] && (s = d[k], d[k] = void 0, m--);else if (b < g) for (i = b; i < g; i++) {\n if (void 0 !== f[i] && l(a = f[i], c, r)) {\n s = a, f[i] = void 0, i === g - 1 && g--, i === b && b++;break;\n }\n }s = h(s, c, n, o), u = _[C], s && s !== e && s !== u && (null == u ? e.appendChild(s) : s === u.nextSibling ? p(u) : e.insertBefore(s, u));\n }if (m) for (var C in d) {\n void 0 !== d[C] && v(d[C], !1);\n }while (b <= g) {\n void 0 !== (s = f[g--]) && v(s, !1);\n }\n }function v(e, t) {\n var o = e._component;o ? k(o) : (null != e.__preactattr_ && n(e.__preactattr_.ref, null), !1 !== t && null != e.__preactattr_ || p(e), b(e));\n }function b(e) {\n e = e.lastChild;while (e) {\n var t = e.previousSibling;v(e, !0), e = t;\n }\n }function y(e, t, n) {\n var o;for (o in n) {\n t && null != t[o] || null == n[o] || s(e, o, n[o], n[o] = void 0, R);\n }for (o in t) {\n \"children\" === o || \"innerHTML\" === o || o in n && t[o] === (\"value\" === o || \"checked\" === o ? e[o] : n[o]) || s(e, o, n[o], n[o] = t[o], R);\n }\n }function g(e, t, n) {\n var o,\n r = F.length;e.prototype && e.prototype.render ? (o = new e(t, n), U.call(o, t, n)) : (o = new U(t, n), o.constructor = e, o.render = w);while (r--) {\n if (F[r].constructor === e) return o.__b = F[r].__b, F.splice(r, 1), o;\n }return o;\n }function w(e, t, n) {\n return this.constructor(e, n);\n }function C(e, t, o, i, l) {\n e.__x || (e.__x = !0, e.__r = t.ref, e.__k = t.key, delete t.ref, delete t.key, void 0 === e.constructor.getDerivedStateFromProps && (!e.base || l ? e.componentWillMount && e.componentWillMount() : e.componentWillReceiveProps && e.componentWillReceiveProps(t, i)), i && i !== e.context && (e.__c || (e.__c = e.context), e.context = i), e.__p || (e.__p = e.props), e.props = t, e.__x = !1, 0 !== o && (1 !== o && !1 === M.syncComponentUpdates && e.base ? r(e) : x(e, 1, l)), n(e.__r, e));\n }function x(e, n, o, r) {\n if (!e.__x) {\n var i,\n l,\n a,\n c = e.props,\n p = e.state,\n s = e.context,\n _ = e.__p || c,\n h = e.__s || p,\n m = e.__c || s,\n b = e.base,\n y = e.__b,\n w = b || y,\n N = e._component,\n U = !1,\n S = m;if (e.constructor.getDerivedStateFromProps && (p = t(t({}, p), e.constructor.getDerivedStateFromProps(c, p)), e.state = p), b && (e.props = _, e.state = h, e.context = m, 2 !== n && e.shouldComponentUpdate && !1 === e.shouldComponentUpdate(c, p, s) ? U = !0 : e.componentWillUpdate && e.componentWillUpdate(c, p, s), e.props = c, e.state = p, e.context = s), e.__p = e.__s = e.__c = e.__b = null, e.__d = !1, !U) {\n i = e.render(c, p, s), e.getChildContext && (s = t(t({}, s), e.getChildContext())), b && e.getSnapshotBeforeUpdate && (S = e.getSnapshotBeforeUpdate(_, h));var L,\n T,\n P = i && i.nodeName;if (\"function\" == typeof P) {\n var W = u(i);l = N, l && l.constructor === P && W.key == l.__k ? C(l, W, 1, s, !1) : (L = l, e._component = l = g(P, W, s), l.__b = l.__b || y, l.__u = e, C(l, W, 0, s, !1), x(l, 1, o, !0)), T = l.base;\n } else a = w, L = N, L && (a = e._component = null), (w || 1 === n) && (a && (a._component = null), T = d(a, i, s, o || !b, w && w.parentNode, !0));if (w && T !== w && l !== N) {\n var D = w.parentNode;D && T !== D && (D.replaceChild(T, w), L || (w._component = null, v(w, !1)));\n }if (L && k(L), e.base = T, T && !r) {\n var E = e,\n V = e;while (V = V.__u) {\n (E = V).base = T;\n }T._component = E, T._componentConstructor = E.constructor;\n }\n }!b || o ? A.push(e) : U || (e.componentDidUpdate && e.componentDidUpdate(_, h, S), M.afterUpdate && M.afterUpdate(e));while (e.__h.length) {\n e.__h.pop().call(e);\n }H || r || f();\n }\n }function N(e, t, n, o) {\n var r = e && e._component,\n i = r,\n l = e,\n a = r && e._componentConstructor === t.nodeName,\n c = a,\n p = u(t);while (r && !c && (r = r.__u)) {\n c = r.constructor === t.nodeName;\n }return r && c && (!o || r._component) ? (C(r, p, 3, n, o), e = r.base) : (i && !a && (k(i), e = l = null), r = g(t.nodeName, p, n), e && !r.__b && (r.__b = e, l = null), C(r, p, 1, n, o), e = r.base, l && e !== l && (l._component = null, v(l, !1))), e;\n }function k(e) {\n M.beforeUnmount && M.beforeUnmount(e);var t = e.base;e.__x = !0, e.componentWillUnmount && e.componentWillUnmount(), e.base = null;var o = e._component;o ? k(o) : t && (null != t.__preactattr_ && n(t.__preactattr_.ref, null), e.__b = t, p(t), F.push(e), b(t)), n(e.__r, null);\n }function U(e, t) {\n this.__d = !0, this.context = t, this.props = e, this.state = this.state || {}, this.__h = [];\n }function S(e, t, n) {\n return d(n, e, {}, !1, t, !1);\n }function L() {\n return {};\n }var T = function T() {},\n M = {},\n P = [],\n W = [],\n D = \"function\" == typeof Promise ? Promise.resolve().then.bind(Promise.resolve()) : setTimeout,\n E = /acit|ex(?:s|g|n|p|$)|rph|ows|mnc|ntw|ine[ch]|zoo|^ord/i,\n V = [],\n A = [],\n H = 0,\n R = !1,\n B = !1,\n F = [];t(U.prototype, { setState: function setState(e, n) {\n this.__s || (this.__s = this.state), this.state = t(t({}, this.state), \"function\" == typeof e ? e(this.state, this.props) : e), n && this.__h.push(n), r(this);\n }, forceUpdate: function forceUpdate(e) {\n e && this.__h.push(e), x(this, 2);\n }, render: function render() {} });var j = { h: e, createElement: e, cloneElement: o, createRef: L, Component: U, render: S, rerender: i, options: M }; true ? module.exports = j : self.preact = j;\n}();\n//# sourceMappingURL=preact.min.js.map\n\n/***/ }),\n\n/***/ \"MKE3\":\n/***/ (function(module, exports) {\n\n// removed by extract-text-webpack-plugin\nmodule.exports = {\"markdown\":\"markdown__2fpjQ\"};\n\n/***/ }),\n\n/***/ \"MeW5\":\n/***/ (function(module, exports) {\n\n// removed by extract-text-webpack-plugin\nmodule.exports = {\"minus\":\"minus__2d_8r\"};\n\n/***/ }),\n\n/***/ \"Oqef\":\n/***/ (function(module, exports) {\n\n// removed by extract-text-webpack-plugin\n\n/***/ }),\n\n/***/ \"P9k+\":\n/***/ (function(module, exports) {\n\n// removed by extract-text-webpack-plugin\nmodule.exports = {\"panel\":\"panel__22fOQ\"};\n\n/***/ }),\n\n/***/ \"WViY\":\n/***/ (function(module, exports) {\n\n// removed by extract-text-webpack-plugin\n\n/***/ }),\n\n/***/ \"Xa+Z\":\n/***/ (function(module, exports) {\n\n// removed by extract-text-webpack-plugin\nmodule.exports = {\"example\":\"example__2CnC8\"};\n\n/***/ }),\n\n/***/ \"ZcXo\":\n/***/ (function(module, exports) {\n\nmodule.exports = {\"name\":\"Appunti Web\",\"short_name\":\"Appunti Web\",\"start_url\":\"/appuntiweb/\",\"display\":\"standalone\",\"orientation\":\"portrait\",\"background_color\":\"#0d193b\",\"theme_color\":\"#a0ccff\",\"icons\":[{\"src\":\"/assets/icon.png\",\"type\":\"image/png\",\"sizes\":\"800x800\"}]}\n\n/***/ }),\n\n/***/ \"ddTt\":\n/***/ (function(module, exports) {\n\n// removed by extract-text-webpack-plugin\nmodule.exports = {\"plus\":\"plus__1JPyf\"};\n\n/***/ }),\n\n/***/ \"jHTF\":\n/***/ (function(module, exports) {\n\n// removed by extract-text-webpack-plugin\n\n/***/ }),\n\n/***/ \"oNmJ\":\n/***/ (function(module, exports) {\n\n// removed by extract-text-webpack-plugin\nmodule.exports = {\"theorem\":\"theorem__yukmA\"};\n\n/***/ }),\n\n/***/ \"pRAn\":\n/***/ (function(module, exports) {\n\n// removed by extract-text-webpack-plugin\nmodule.exports = {\"hypothesis\":\"hypothesis__Ma0m3\"};\n\n/***/ }),\n\n/***/ \"pwNi\":\n/***/ (function(module, exports, __webpack_require__) {\n\n\"use strict\";\n\n\nvar _preact = __webpack_require__(\"KM04\");\n\nif (false) {\n\trequire('preact/devtools');\n} else if (true && 'serviceWorker' in navigator && location.protocol === 'https:') {\n\tnavigator.serviceWorker.register(__webpack_require__.p + 'sw.js');\n}\n\nvar interopDefault = function interopDefault(m) {\n\treturn m && m.default ? m.default : m;\n};\n\nvar app = interopDefault(__webpack_require__(\"JkW7\"));\n\nif (typeof app === 'function') {\n\tvar root = document.body.firstElementChild;\n\n\tvar init = function init() {\n\t\tvar app = interopDefault(__webpack_require__(\"JkW7\"));\n\t\troot = (0, _preact.render)((0, _preact.h)(app), document.body, root);\n\t};\n\n\tif (false) module.hot.accept('preact-cli-entrypoint', init);\n\n\tinit();\n}\n\n/***/ }),\n\n/***/ \"qMTX\":\n/***/ (function(module, exports) {\n\n// removed by extract-text-webpack-plugin\nmodule.exports = {\"copyright\":\"copyright__TBGn1\"};\n\n/***/ }),\n\n/***/ \"tO1d\":\n/***/ (function(module, exports) {\n\n// removed by extract-text-webpack-plugin\nmodule.exports = {\"todo\":\"todo__5Soco\"};\n\n/***/ }),\n\n/***/ \"xHuH\":\n/***/ (function(module, exports) {\n\n// removed by extract-text-webpack-plugin\n\n/***/ })\n\n/******/ });\n\n\n// WEBPACK FOOTER //\n// bundle.57708.js"," \t// The module cache\n \tvar installedModules = {};\n\n \t// The require function\n \tfunction __webpack_require__(moduleId) {\n\n \t\t// Check if module is in cache\n \t\tif(installedModules[moduleId]) {\n \t\t\treturn installedModules[moduleId].exports;\n \t\t}\n \t\t// Create a new module (and put it into the cache)\n \t\tvar module = installedModules[moduleId] = {\n \t\t\ti: moduleId,\n \t\t\tl: false,\n \t\t\texports: {}\n \t\t};\n\n \t\t// Execute the module function\n \t\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n \t\t// Flag the module as loaded\n \t\tmodule.l = true;\n\n \t\t// Return the exports of the module\n \t\treturn module.exports;\n \t}\n\n\n \t// expose the modules object (__webpack_modules__)\n \t__webpack_require__.m = modules;\n\n \t// expose the module cache\n \t__webpack_require__.c = installedModules;\n\n \t// define getter function for harmony exports\n \t__webpack_require__.d = function(exports, name, getter) {\n \t\tif(!__webpack_require__.o(exports, name)) {\n \t\t\tObject.defineProperty(exports, name, {\n \t\t\t\tconfigurable: false,\n \t\t\t\tenumerable: true,\n \t\t\t\tget: getter\n \t\t\t});\n \t\t}\n \t};\n\n \t// getDefaultExport function for compatibility with non-harmony modules\n \t__webpack_require__.n = function(module) {\n \t\tvar getter = module && module.__esModule ?\n \t\t\tfunction getDefault() { return module['default']; } :\n \t\t\tfunction getModuleExports() { return module; };\n \t\t__webpack_require__.d(getter, 'a', getter);\n \t\treturn getter;\n \t};\n\n \t// Object.prototype.hasOwnProperty.call\n \t__webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };\n\n \t// __webpack_public_path__\n \t__webpack_require__.p = \"/\";\n\n \t// Load entry module and return exports\n \treturn __webpack_require__(__webpack_require__.s = \"pwNi\");\n\n\n\n// WEBPACK FOOTER //\n// webpack/bootstrap 219ac49107a432343420","// removed by extract-text-webpack-plugin\nmodule.exports = {\"latex\":\"latex__34DCT\"};\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./components/latex.css\n// module id = +uq9\n// module chunks = 0","// removed by extract-text-webpack-plugin\nmodule.exports = {\"split\":\"split__2Bl8C\",\"splitparent\":\"splitparent__nqY7W\",\"splitchild\":\"splitchild__3Ip86\"};\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./components/split.css\n// module id = 1EpE\n// module chunks = 0",";/*! showdown v 1.9.1 - 02-11-2019 */\r\n(function(){\r\n/**\n * Created by Tivie on 13-07-2015.\n */\n\nfunction getDefaultOpts (simple) {\n 'use strict';\n\n var defaultOptions = {\n omitExtraWLInCodeBlocks: {\n defaultValue: false,\n describe: 'Omit the default extra whiteline added to code blocks',\n type: 'boolean'\n },\n noHeaderId: {\n defaultValue: false,\n describe: 'Turn on/off generated header id',\n type: 'boolean'\n },\n prefixHeaderId: {\n defaultValue: false,\n describe: 'Add a prefix to the generated header ids. Passing a string will prefix that string to the header id. Setting to true will add a generic \\'section-\\' prefix',\n type: 'string'\n },\n rawPrefixHeaderId: {\n defaultValue: false,\n describe: 'Setting this option to true will prevent showdown from modifying the prefix. This might result in malformed IDs (if, for instance, the \" char is used in the prefix)',\n type: 'boolean'\n },\n ghCompatibleHeaderId: {\n defaultValue: false,\n describe: 'Generate header ids compatible with github style (spaces are replaced with dashes, a bunch of non alphanumeric chars are removed)',\n type: 'boolean'\n },\n rawHeaderId: {\n defaultValue: false,\n describe: 'Remove only spaces, \\' and \" from generated header ids (including prefixes), replacing them with dashes (-). WARNING: This might result in malformed ids',\n type: 'boolean'\n },\n headerLevelStart: {\n defaultValue: false,\n describe: 'The header blocks level start',\n type: 'integer'\n },\n parseImgDimensions: {\n defaultValue: false,\n describe: 'Turn on/off image dimension parsing',\n type: 'boolean'\n },\n simplifiedAutoLink: {\n defaultValue: false,\n describe: 'Turn on/off GFM autolink style',\n type: 'boolean'\n },\n excludeTrailingPunctuationFromURLs: {\n defaultValue: false,\n describe: 'Excludes trailing punctuation from links generated with autoLinking',\n type: 'boolean'\n },\n literalMidWordUnderscores: {\n defaultValue: false,\n describe: 'Parse midword underscores as literal underscores',\n type: 'boolean'\n },\n literalMidWordAsterisks: {\n defaultValue: false,\n describe: 'Parse midword asterisks as literal asterisks',\n type: 'boolean'\n },\n strikethrough: {\n defaultValue: false,\n describe: 'Turn on/off strikethrough support',\n type: 'boolean'\n },\n tables: {\n defaultValue: false,\n describe: 'Turn on/off tables support',\n type: 'boolean'\n },\n tablesHeaderId: {\n defaultValue: false,\n describe: 'Add an id to table headers',\n type: 'boolean'\n },\n ghCodeBlocks: {\n defaultValue: true,\n describe: 'Turn on/off GFM fenced code blocks support',\n type: 'boolean'\n },\n tasklists: {\n defaultValue: false,\n describe: 'Turn on/off GFM tasklist support',\n type: 'boolean'\n },\n smoothLivePreview: {\n defaultValue: false,\n describe: 'Prevents weird effects in live previews due to incomplete input',\n type: 'boolean'\n },\n smartIndentationFix: {\n defaultValue: false,\n description: 'Tries to smartly fix indentation in es6 strings',\n type: 'boolean'\n },\n disableForced4SpacesIndentedSublists: {\n defaultValue: false,\n description: 'Disables the requirement of indenting nested sublists by 4 spaces',\n type: 'boolean'\n },\n simpleLineBreaks: {\n defaultValue: false,\n description: 'Parses simple line breaks as
(GFM Style)',\n type: 'boolean'\n },\n requireSpaceBeforeHeadingText: {\n defaultValue: false,\n description: 'Makes adding a space between `#` and the header text mandatory (GFM Style)',\n type: 'boolean'\n },\n ghMentions: {\n defaultValue: false,\n description: 'Enables github @mentions',\n type: 'boolean'\n },\n ghMentionsLink: {\n defaultValue: 'https://github.com/{u}',\n description: 'Changes the link generated by @mentions. Only applies if ghMentions option is enabled.',\n type: 'string'\n },\n encodeEmails: {\n defaultValue: true,\n description: 'Encode e-mail addresses through the use of Character Entities, transforming ASCII e-mail addresses into its equivalent decimal entities',\n type: 'boolean'\n },\n openLinksInNewWindow: {\n defaultValue: false,\n description: 'Open all links in new windows',\n type: 'boolean'\n },\n backslashEscapesHTMLTags: {\n defaultValue: false,\n description: 'Support for HTML Tag escaping. ex: \\foo\\',\n type: 'boolean'\n },\n emoji: {\n defaultValue: false,\n description: 'Enable emoji support. Ex: `this is a :smile: emoji`',\n type: 'boolean'\n },\n underline: {\n defaultValue: false,\n description: 'Enable support for underline. Syntax is double or triple underscores: `__underline word__`. With this option enabled, underscores no longer parses into `` and ``',\n type: 'boolean'\n },\n completeHTMLDocument: {\n defaultValue: false,\n description: 'Outputs a complete html document, including ``, `` and `` tags',\n type: 'boolean'\n },\n metadata: {\n defaultValue: false,\n description: 'Enable support for document metadata (defined at the top of the document between `«««` and `»»»` or between `---` and `---`).',\n type: 'boolean'\n },\n splitAdjacentBlockquotes: {\n defaultValue: false,\n description: 'Split adjacent blockquote blocks',\n type: 'boolean'\n }\n };\n if (simple === false) {\n return JSON.parse(JSON.stringify(defaultOptions));\n }\n var ret = {};\n for (var opt in defaultOptions) {\n if (defaultOptions.hasOwnProperty(opt)) {\n ret[opt] = defaultOptions[opt].defaultValue;\n }\n }\n return ret;\n}\n\nfunction allOptionsOn () {\n 'use strict';\n var options = getDefaultOpts(true),\n ret = {};\n for (var opt in options) {\n if (options.hasOwnProperty(opt)) {\n ret[opt] = true;\n }\n }\n return ret;\n}\n\r\n/**\n * Created by Tivie on 06-01-2015.\n */\n\n// Private properties\nvar showdown = {},\n parsers = {},\n extensions = {},\n globalOptions = getDefaultOpts(true),\n setFlavor = 'vanilla',\n flavor = {\n github: {\n omitExtraWLInCodeBlocks: true,\n simplifiedAutoLink: true,\n excludeTrailingPunctuationFromURLs: true,\n literalMidWordUnderscores: true,\n strikethrough: true,\n tables: true,\n tablesHeaderId: true,\n ghCodeBlocks: true,\n tasklists: true,\n disableForced4SpacesIndentedSublists: true,\n simpleLineBreaks: true,\n requireSpaceBeforeHeadingText: true,\n ghCompatibleHeaderId: true,\n ghMentions: true,\n backslashEscapesHTMLTags: true,\n emoji: true,\n splitAdjacentBlockquotes: true\n },\n original: {\n noHeaderId: true,\n ghCodeBlocks: false\n },\n ghost: {\n omitExtraWLInCodeBlocks: true,\n parseImgDimensions: true,\n simplifiedAutoLink: true,\n excludeTrailingPunctuationFromURLs: true,\n literalMidWordUnderscores: true,\n strikethrough: true,\n tables: true,\n tablesHeaderId: true,\n ghCodeBlocks: true,\n tasklists: true,\n smoothLivePreview: true,\n simpleLineBreaks: true,\n requireSpaceBeforeHeadingText: true,\n ghMentions: false,\n encodeEmails: true\n },\n vanilla: getDefaultOpts(true),\n allOn: allOptionsOn()\n };\n\n/**\n * helper namespace\n * @type {{}}\n */\nshowdown.helper = {};\n\n/**\n * TODO LEGACY SUPPORT CODE\n * @type {{}}\n */\nshowdown.extensions = {};\n\n/**\n * Set a global option\n * @static\n * @param {string} key\n * @param {*} value\n * @returns {showdown}\n */\nshowdown.setOption = function (key, value) {\n 'use strict';\n globalOptions[key] = value;\n return this;\n};\n\n/**\n * Get a global option\n * @static\n * @param {string} key\n * @returns {*}\n */\nshowdown.getOption = function (key) {\n 'use strict';\n return globalOptions[key];\n};\n\n/**\n * Get the global options\n * @static\n * @returns {{}}\n */\nshowdown.getOptions = function () {\n 'use strict';\n return globalOptions;\n};\n\n/**\n * Reset global options to the default values\n * @static\n */\nshowdown.resetOptions = function () {\n 'use strict';\n globalOptions = getDefaultOpts(true);\n};\n\n/**\n * Set the flavor showdown should use as default\n * @param {string} name\n */\nshowdown.setFlavor = function (name) {\n 'use strict';\n if (!flavor.hasOwnProperty(name)) {\n throw Error(name + ' flavor was not found');\n }\n showdown.resetOptions();\n var preset = flavor[name];\n setFlavor = name;\n for (var option in preset) {\n if (preset.hasOwnProperty(option)) {\n globalOptions[option] = preset[option];\n }\n }\n};\n\n/**\n * Get the currently set flavor\n * @returns {string}\n */\nshowdown.getFlavor = function () {\n 'use strict';\n return setFlavor;\n};\n\n/**\n * Get the options of a specified flavor. Returns undefined if the flavor was not found\n * @param {string} name Name of the flavor\n * @returns {{}|undefined}\n */\nshowdown.getFlavorOptions = function (name) {\n 'use strict';\n if (flavor.hasOwnProperty(name)) {\n return flavor[name];\n }\n};\n\n/**\n * Get the default options\n * @static\n * @param {boolean} [simple=true]\n * @returns {{}}\n */\nshowdown.getDefaultOptions = function (simple) {\n 'use strict';\n return getDefaultOpts(simple);\n};\n\n/**\n * Get or set a subParser\n *\n * subParser(name) - Get a registered subParser\n * subParser(name, func) - Register a subParser\n * @static\n * @param {string} name\n * @param {function} [func]\n * @returns {*}\n */\nshowdown.subParser = function (name, func) {\n 'use strict';\n if (showdown.helper.isString(name)) {\n if (typeof func !== 'undefined') {\n parsers[name] = func;\n } else {\n if (parsers.hasOwnProperty(name)) {\n return parsers[name];\n } else {\n throw Error('SubParser named ' + name + ' not registered!');\n }\n }\n }\n};\n\n/**\n * Gets or registers an extension\n * @static\n * @param {string} name\n * @param {object|function=} ext\n * @returns {*}\n */\nshowdown.extension = function (name, ext) {\n 'use strict';\n\n if (!showdown.helper.isString(name)) {\n throw Error('Extension \\'name\\' must be a string');\n }\n\n name = showdown.helper.stdExtName(name);\n\n // Getter\n if (showdown.helper.isUndefined(ext)) {\n if (!extensions.hasOwnProperty(name)) {\n throw Error('Extension named ' + name + ' is not registered!');\n }\n return extensions[name];\n\n // Setter\n } else {\n // Expand extension if it's wrapped in a function\n if (typeof ext === 'function') {\n ext = ext();\n }\n\n // Ensure extension is an array\n if (!showdown.helper.isArray(ext)) {\n ext = [ext];\n }\n\n var validExtension = validate(ext, name);\n\n if (validExtension.valid) {\n extensions[name] = ext;\n } else {\n throw Error(validExtension.error);\n }\n }\n};\n\n/**\n * Gets all extensions registered\n * @returns {{}}\n */\nshowdown.getAllExtensions = function () {\n 'use strict';\n return extensions;\n};\n\n/**\n * Remove an extension\n * @param {string} name\n */\nshowdown.removeExtension = function (name) {\n 'use strict';\n delete extensions[name];\n};\n\n/**\n * Removes all extensions\n */\nshowdown.resetExtensions = function () {\n 'use strict';\n extensions = {};\n};\n\n/**\n * Validate extension\n * @param {array} extension\n * @param {string} name\n * @returns {{valid: boolean, error: string}}\n */\nfunction validate (extension, name) {\n 'use strict';\n\n var errMsg = (name) ? 'Error in ' + name + ' extension->' : 'Error in unnamed extension',\n ret = {\n valid: true,\n error: ''\n };\n\n if (!showdown.helper.isArray(extension)) {\n extension = [extension];\n }\n\n for (var i = 0; i < extension.length; ++i) {\n var baseMsg = errMsg + ' sub-extension ' + i + ': ',\n ext = extension[i];\n if (typeof ext !== 'object') {\n ret.valid = false;\n ret.error = baseMsg + 'must be an object, but ' + typeof ext + ' given';\n return ret;\n }\n\n if (!showdown.helper.isString(ext.type)) {\n ret.valid = false;\n ret.error = baseMsg + 'property \"type\" must be a string, but ' + typeof ext.type + ' given';\n return ret;\n }\n\n var type = ext.type = ext.type.toLowerCase();\n\n // normalize extension type\n if (type === 'language') {\n type = ext.type = 'lang';\n }\n\n if (type === 'html') {\n type = ext.type = 'output';\n }\n\n if (type !== 'lang' && type !== 'output' && type !== 'listener') {\n ret.valid = false;\n ret.error = baseMsg + 'type ' + type + ' is not recognized. Valid values: \"lang/language\", \"output/html\" or \"listener\"';\n return ret;\n }\n\n if (type === 'listener') {\n if (showdown.helper.isUndefined(ext.listeners)) {\n ret.valid = false;\n ret.error = baseMsg + '. Extensions of type \"listener\" must have a property called \"listeners\"';\n return ret;\n }\n } else {\n if (showdown.helper.isUndefined(ext.filter) && showdown.helper.isUndefined(ext.regex)) {\n ret.valid = false;\n ret.error = baseMsg + type + ' extensions must define either a \"regex\" property or a \"filter\" method';\n return ret;\n }\n }\n\n if (ext.listeners) {\n if (typeof ext.listeners !== 'object') {\n ret.valid = false;\n ret.error = baseMsg + '\"listeners\" property must be an object but ' + typeof ext.listeners + ' given';\n return ret;\n }\n for (var ln in ext.listeners) {\n if (ext.listeners.hasOwnProperty(ln)) {\n if (typeof ext.listeners[ln] !== 'function') {\n ret.valid = false;\n ret.error = baseMsg + '\"listeners\" property must be an hash of [event name]: [callback]. listeners.' + ln +\n ' must be a function but ' + typeof ext.listeners[ln] + ' given';\n return ret;\n }\n }\n }\n }\n\n if (ext.filter) {\n if (typeof ext.filter !== 'function') {\n ret.valid = false;\n ret.error = baseMsg + '\"filter\" must be a function, but ' + typeof ext.filter + ' given';\n return ret;\n }\n } else if (ext.regex) {\n if (showdown.helper.isString(ext.regex)) {\n ext.regex = new RegExp(ext.regex, 'g');\n }\n if (!(ext.regex instanceof RegExp)) {\n ret.valid = false;\n ret.error = baseMsg + '\"regex\" property must either be a string or a RegExp object, but ' + typeof ext.regex + ' given';\n return ret;\n }\n if (showdown.helper.isUndefined(ext.replace)) {\n ret.valid = false;\n ret.error = baseMsg + '\"regex\" extensions must implement a replace string or function';\n return ret;\n }\n }\n }\n return ret;\n}\n\n/**\n * Validate extension\n * @param {object} ext\n * @returns {boolean}\n */\nshowdown.validateExtension = function (ext) {\n 'use strict';\n\n var validateExtension = validate(ext, null);\n if (!validateExtension.valid) {\n console.warn(validateExtension.error);\n return false;\n }\n return true;\n};\n\r\n/**\n * showdownjs helper functions\n */\n\nif (!showdown.hasOwnProperty('helper')) {\n showdown.helper = {};\n}\n\n/**\n * Check if var is string\n * @static\n * @param {string} a\n * @returns {boolean}\n */\nshowdown.helper.isString = function (a) {\n 'use strict';\n return (typeof a === 'string' || a instanceof String);\n};\n\n/**\n * Check if var is a function\n * @static\n * @param {*} a\n * @returns {boolean}\n */\nshowdown.helper.isFunction = function (a) {\n 'use strict';\n var getType = {};\n return a && getType.toString.call(a) === '[object Function]';\n};\n\n/**\n * isArray helper function\n * @static\n * @param {*} a\n * @returns {boolean}\n */\nshowdown.helper.isArray = function (a) {\n 'use strict';\n return Array.isArray(a);\n};\n\n/**\n * Check if value is undefined\n * @static\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `undefined`, else `false`.\n */\nshowdown.helper.isUndefined = function (value) {\n 'use strict';\n return typeof value === 'undefined';\n};\n\n/**\n * ForEach helper function\n * Iterates over Arrays and Objects (own properties only)\n * @static\n * @param {*} obj\n * @param {function} callback Accepts 3 params: 1. value, 2. key, 3. the original array/object\n */\nshowdown.helper.forEach = function (obj, callback) {\n 'use strict';\n // check if obj is defined\n if (showdown.helper.isUndefined(obj)) {\n throw new Error('obj param is required');\n }\n\n if (showdown.helper.isUndefined(callback)) {\n throw new Error('callback param is required');\n }\n\n if (!showdown.helper.isFunction(callback)) {\n throw new Error('callback param must be a function/closure');\n }\n\n if (typeof obj.forEach === 'function') {\n obj.forEach(callback);\n } else if (showdown.helper.isArray(obj)) {\n for (var i = 0; i < obj.length; i++) {\n callback(obj[i], i, obj);\n }\n } else if (typeof (obj) === 'object') {\n for (var prop in obj) {\n if (obj.hasOwnProperty(prop)) {\n callback(obj[prop], prop, obj);\n }\n }\n } else {\n throw new Error('obj does not seem to be an array or an iterable object');\n }\n};\n\n/**\n * Standardidize extension name\n * @static\n * @param {string} s extension name\n * @returns {string}\n */\nshowdown.helper.stdExtName = function (s) {\n 'use strict';\n return s.replace(/[_?*+\\/\\\\.^-]/g, '').replace(/\\s/g, '').toLowerCase();\n};\n\nfunction escapeCharactersCallback (wholeMatch, m1) {\n 'use strict';\n var charCodeToEscape = m1.charCodeAt(0);\n return '¨E' + charCodeToEscape + 'E';\n}\n\n/**\n * Callback used to escape characters when passing through String.replace\n * @static\n * @param {string} wholeMatch\n * @param {string} m1\n * @returns {string}\n */\nshowdown.helper.escapeCharactersCallback = escapeCharactersCallback;\n\n/**\n * Escape characters in a string\n * @static\n * @param {string} text\n * @param {string} charsToEscape\n * @param {boolean} afterBackslash\n * @returns {XML|string|void|*}\n */\nshowdown.helper.escapeCharacters = function (text, charsToEscape, afterBackslash) {\n 'use strict';\n // First we have to escape the escape characters so that\n // we can build a character class out of them\n var regexString = '([' + charsToEscape.replace(/([\\[\\]\\\\])/g, '\\\\$1') + '])';\n\n if (afterBackslash) {\n regexString = '\\\\\\\\' + regexString;\n }\n\n var regex = new RegExp(regexString, 'g');\n text = text.replace(regex, escapeCharactersCallback);\n\n return text;\n};\n\n/**\n * Unescape HTML entities\n * @param txt\n * @returns {string}\n */\nshowdown.helper.unescapeHTMLEntities = function (txt) {\n 'use strict';\n\n return txt\n .replace(/"/g, '\"')\n .replace(/</g, '<')\n .replace(/>/g, '>')\n .replace(/&/g, '&');\n};\n\nvar rgxFindMatchPos = function (str, left, right, flags) {\n 'use strict';\n var f = flags || '',\n g = f.indexOf('g') > -1,\n x = new RegExp(left + '|' + right, 'g' + f.replace(/g/g, '')),\n l = new RegExp(left, f.replace(/g/g, '')),\n pos = [],\n t, s, m, start, end;\n\n do {\n t = 0;\n while ((m = x.exec(str))) {\n if (l.test(m[0])) {\n if (!(t++)) {\n s = x.lastIndex;\n start = s - m[0].length;\n }\n } else if (t) {\n if (!--t) {\n end = m.index + m[0].length;\n var obj = {\n left: {start: start, end: s},\n match: {start: s, end: m.index},\n right: {start: m.index, end: end},\n wholeMatch: {start: start, end: end}\n };\n pos.push(obj);\n if (!g) {\n return pos;\n }\n }\n }\n }\n } while (t && (x.lastIndex = s));\n\n return pos;\n};\n\n/**\n * matchRecursiveRegExp\n *\n * (c) 2007 Steven Levithan \n * MIT License\n *\n * Accepts a string to search, a left and right format delimiter\n * as regex patterns, and optional regex flags. Returns an array\n * of matches, allowing nested instances of left/right delimiters.\n * Use the \"g\" flag to return all matches, otherwise only the\n * first is returned. Be careful to ensure that the left and\n * right format delimiters produce mutually exclusive matches.\n * Backreferences are not supported within the right delimiter\n * due to how it is internally combined with the left delimiter.\n * When matching strings whose format delimiters are unbalanced\n * to the left or right, the output is intentionally as a\n * conventional regex library with recursion support would\n * produce, e.g. \"<\" and \">\" both produce [\"x\"] when using\n * \"<\" and \">\" as the delimiters (both strings contain a single,\n * balanced instance of \"\").\n *\n * examples:\n * matchRecursiveRegExp(\"test\", \"\\\\(\", \"\\\\)\")\n * returns: []\n * matchRecursiveRegExp(\">>t<>\", \"<\", \">\", \"g\")\n * returns: [\"t<>\", \"\"]\n * matchRecursiveRegExp(\"test\", \"]*>\", \"\", \"gi\")\n * returns: [\"test\"]\n */\nshowdown.helper.matchRecursiveRegExp = function (str, left, right, flags) {\n 'use strict';\n\n var matchPos = rgxFindMatchPos (str, left, right, flags),\n results = [];\n\n for (var i = 0; i < matchPos.length; ++i) {\n results.push([\n str.slice(matchPos[i].wholeMatch.start, matchPos[i].wholeMatch.end),\n str.slice(matchPos[i].match.start, matchPos[i].match.end),\n str.slice(matchPos[i].left.start, matchPos[i].left.end),\n str.slice(matchPos[i].right.start, matchPos[i].right.end)\n ]);\n }\n return results;\n};\n\n/**\n *\n * @param {string} str\n * @param {string|function} replacement\n * @param {string} left\n * @param {string} right\n * @param {string} flags\n * @returns {string}\n */\nshowdown.helper.replaceRecursiveRegExp = function (str, replacement, left, right, flags) {\n 'use strict';\n\n if (!showdown.helper.isFunction(replacement)) {\n var repStr = replacement;\n replacement = function () {\n return repStr;\n };\n }\n\n var matchPos = rgxFindMatchPos(str, left, right, flags),\n finalStr = str,\n lng = matchPos.length;\n\n if (lng > 0) {\n var bits = [];\n if (matchPos[0].wholeMatch.start !== 0) {\n bits.push(str.slice(0, matchPos[0].wholeMatch.start));\n }\n for (var i = 0; i < lng; ++i) {\n bits.push(\n replacement(\n str.slice(matchPos[i].wholeMatch.start, matchPos[i].wholeMatch.end),\n str.slice(matchPos[i].match.start, matchPos[i].match.end),\n str.slice(matchPos[i].left.start, matchPos[i].left.end),\n str.slice(matchPos[i].right.start, matchPos[i].right.end)\n )\n );\n if (i < lng - 1) {\n bits.push(str.slice(matchPos[i].wholeMatch.end, matchPos[i + 1].wholeMatch.start));\n }\n }\n if (matchPos[lng - 1].wholeMatch.end < str.length) {\n bits.push(str.slice(matchPos[lng - 1].wholeMatch.end));\n }\n finalStr = bits.join('');\n }\n return finalStr;\n};\n\n/**\n * Returns the index within the passed String object of the first occurrence of the specified regex,\n * starting the search at fromIndex. Returns -1 if the value is not found.\n *\n * @param {string} str string to search\n * @param {RegExp} regex Regular expression to search\n * @param {int} [fromIndex = 0] Index to start the search\n * @returns {Number}\n * @throws InvalidArgumentError\n */\nshowdown.helper.regexIndexOf = function (str, regex, fromIndex) {\n 'use strict';\n if (!showdown.helper.isString(str)) {\n throw 'InvalidArgumentError: first parameter of showdown.helper.regexIndexOf function must be a string';\n }\n if (regex instanceof RegExp === false) {\n throw 'InvalidArgumentError: second parameter of showdown.helper.regexIndexOf function must be an instance of RegExp';\n }\n var indexOf = str.substring(fromIndex || 0).search(regex);\n return (indexOf >= 0) ? (indexOf + (fromIndex || 0)) : indexOf;\n};\n\n/**\n * Splits the passed string object at the defined index, and returns an array composed of the two substrings\n * @param {string} str string to split\n * @param {int} index index to split string at\n * @returns {[string,string]}\n * @throws InvalidArgumentError\n */\nshowdown.helper.splitAtIndex = function (str, index) {\n 'use strict';\n if (!showdown.helper.isString(str)) {\n throw 'InvalidArgumentError: first parameter of showdown.helper.regexIndexOf function must be a string';\n }\n return [str.substring(0, index), str.substring(index)];\n};\n\n/**\n * Obfuscate an e-mail address through the use of Character Entities,\n * transforming ASCII characters into their equivalent decimal or hex entities.\n *\n * Since it has a random component, subsequent calls to this function produce different results\n *\n * @param {string} mail\n * @returns {string}\n */\nshowdown.helper.encodeEmailAddress = function (mail) {\n 'use strict';\n var encode = [\n function (ch) {\n return '&#' + ch.charCodeAt(0) + ';';\n },\n function (ch) {\n return '&#x' + ch.charCodeAt(0).toString(16) + ';';\n },\n function (ch) {\n return ch;\n }\n ];\n\n mail = mail.replace(/./g, function (ch) {\n if (ch === '@') {\n // this *must* be encoded. I insist.\n ch = encode[Math.floor(Math.random() * 2)](ch);\n } else {\n var r = Math.random();\n // roughly 10% raw, 45% hex, 45% dec\n ch = (\n r > 0.9 ? encode[2](ch) : r > 0.45 ? encode[1](ch) : encode[0](ch)\n );\n }\n return ch;\n });\n\n return mail;\n};\n\n/**\n *\n * @param str\n * @param targetLength\n * @param padString\n * @returns {string}\n */\nshowdown.helper.padEnd = function padEnd (str, targetLength, padString) {\n 'use strict';\n /*jshint bitwise: false*/\n // eslint-disable-next-line space-infix-ops\n targetLength = targetLength>>0; //floor if number or convert non-number to 0;\n /*jshint bitwise: true*/\n padString = String(padString || ' ');\n if (str.length > targetLength) {\n return String(str);\n } else {\n targetLength = targetLength - str.length;\n if (targetLength > padString.length) {\n padString += padString.repeat(targetLength / padString.length); //append to original to ensure we are longer than needed\n }\n return String(str) + padString.slice(0,targetLength);\n }\n};\n\n/**\n * POLYFILLS\n */\n// use this instead of builtin is undefined for IE8 compatibility\nif (typeof console === 'undefined') {\n console = {\n warn: function (msg) {\n 'use strict';\n alert(msg);\n },\n log: function (msg) {\n 'use strict';\n alert(msg);\n },\n error: function (msg) {\n 'use strict';\n throw msg;\n }\n };\n}\n\n/**\n * Common regexes.\n * We declare some common regexes to improve performance\n */\nshowdown.helper.regexes = {\n asteriskDashAndColon: /([*_:~])/g\n};\n\n/**\n * EMOJIS LIST\n */\nshowdown.helper.emojis = {\n '+1':'\\ud83d\\udc4d',\n '-1':'\\ud83d\\udc4e',\n '100':'\\ud83d\\udcaf',\n '1234':'\\ud83d\\udd22',\n '1st_place_medal':'\\ud83e\\udd47',\n '2nd_place_medal':'\\ud83e\\udd48',\n '3rd_place_medal':'\\ud83e\\udd49',\n '8ball':'\\ud83c\\udfb1',\n 'a':'\\ud83c\\udd70\\ufe0f',\n 'ab':'\\ud83c\\udd8e',\n 'abc':'\\ud83d\\udd24',\n 'abcd':'\\ud83d\\udd21',\n 'accept':'\\ud83c\\ude51',\n 'aerial_tramway':'\\ud83d\\udea1',\n 'airplane':'\\u2708\\ufe0f',\n 'alarm_clock':'\\u23f0',\n 'alembic':'\\u2697\\ufe0f',\n 'alien':'\\ud83d\\udc7d',\n 'ambulance':'\\ud83d\\ude91',\n 'amphora':'\\ud83c\\udffa',\n 'anchor':'\\u2693\\ufe0f',\n 'angel':'\\ud83d\\udc7c',\n 'anger':'\\ud83d\\udca2',\n 'angry':'\\ud83d\\ude20',\n 'anguished':'\\ud83d\\ude27',\n 'ant':'\\ud83d\\udc1c',\n 'apple':'\\ud83c\\udf4e',\n 'aquarius':'\\u2652\\ufe0f',\n 'aries':'\\u2648\\ufe0f',\n 'arrow_backward':'\\u25c0\\ufe0f',\n 'arrow_double_down':'\\u23ec',\n 'arrow_double_up':'\\u23eb',\n 'arrow_down':'\\u2b07\\ufe0f',\n 'arrow_down_small':'\\ud83d\\udd3d',\n 'arrow_forward':'\\u25b6\\ufe0f',\n 'arrow_heading_down':'\\u2935\\ufe0f',\n 'arrow_heading_up':'\\u2934\\ufe0f',\n 'arrow_left':'\\u2b05\\ufe0f',\n 'arrow_lower_left':'\\u2199\\ufe0f',\n 'arrow_lower_right':'\\u2198\\ufe0f',\n 'arrow_right':'\\u27a1\\ufe0f',\n 'arrow_right_hook':'\\u21aa\\ufe0f',\n 'arrow_up':'\\u2b06\\ufe0f',\n 'arrow_up_down':'\\u2195\\ufe0f',\n 'arrow_up_small':'\\ud83d\\udd3c',\n 'arrow_upper_left':'\\u2196\\ufe0f',\n 'arrow_upper_right':'\\u2197\\ufe0f',\n 'arrows_clockwise':'\\ud83d\\udd03',\n 'arrows_counterclockwise':'\\ud83d\\udd04',\n 'art':'\\ud83c\\udfa8',\n 'articulated_lorry':'\\ud83d\\ude9b',\n 'artificial_satellite':'\\ud83d\\udef0',\n 'astonished':'\\ud83d\\ude32',\n 'athletic_shoe':'\\ud83d\\udc5f',\n 'atm':'\\ud83c\\udfe7',\n 'atom_symbol':'\\u269b\\ufe0f',\n 'avocado':'\\ud83e\\udd51',\n 'b':'\\ud83c\\udd71\\ufe0f',\n 'baby':'\\ud83d\\udc76',\n 'baby_bottle':'\\ud83c\\udf7c',\n 'baby_chick':'\\ud83d\\udc24',\n 'baby_symbol':'\\ud83d\\udebc',\n 'back':'\\ud83d\\udd19',\n 'bacon':'\\ud83e\\udd53',\n 'badminton':'\\ud83c\\udff8',\n 'baggage_claim':'\\ud83d\\udec4',\n 'baguette_bread':'\\ud83e\\udd56',\n 'balance_scale':'\\u2696\\ufe0f',\n 'balloon':'\\ud83c\\udf88',\n 'ballot_box':'\\ud83d\\uddf3',\n 'ballot_box_with_check':'\\u2611\\ufe0f',\n 'bamboo':'\\ud83c\\udf8d',\n 'banana':'\\ud83c\\udf4c',\n 'bangbang':'\\u203c\\ufe0f',\n 'bank':'\\ud83c\\udfe6',\n 'bar_chart':'\\ud83d\\udcca',\n 'barber':'\\ud83d\\udc88',\n 'baseball':'\\u26be\\ufe0f',\n 'basketball':'\\ud83c\\udfc0',\n 'basketball_man':'\\u26f9\\ufe0f',\n 'basketball_woman':'\\u26f9\\ufe0f\\u2640\\ufe0f',\n 'bat':'\\ud83e\\udd87',\n 'bath':'\\ud83d\\udec0',\n 'bathtub':'\\ud83d\\udec1',\n 'battery':'\\ud83d\\udd0b',\n 'beach_umbrella':'\\ud83c\\udfd6',\n 'bear':'\\ud83d\\udc3b',\n 'bed':'\\ud83d\\udecf',\n 'bee':'\\ud83d\\udc1d',\n 'beer':'\\ud83c\\udf7a',\n 'beers':'\\ud83c\\udf7b',\n 'beetle':'\\ud83d\\udc1e',\n 'beginner':'\\ud83d\\udd30',\n 'bell':'\\ud83d\\udd14',\n 'bellhop_bell':'\\ud83d\\udece',\n 'bento':'\\ud83c\\udf71',\n 'biking_man':'\\ud83d\\udeb4',\n 'bike':'\\ud83d\\udeb2',\n 'biking_woman':'\\ud83d\\udeb4\\u2640\\ufe0f',\n 'bikini':'\\ud83d\\udc59',\n 'biohazard':'\\u2623\\ufe0f',\n 'bird':'\\ud83d\\udc26',\n 'birthday':'\\ud83c\\udf82',\n 'black_circle':'\\u26ab\\ufe0f',\n 'black_flag':'\\ud83c\\udff4',\n 'black_heart':'\\ud83d\\udda4',\n 'black_joker':'\\ud83c\\udccf',\n 'black_large_square':'\\u2b1b\\ufe0f',\n 'black_medium_small_square':'\\u25fe\\ufe0f',\n 'black_medium_square':'\\u25fc\\ufe0f',\n 'black_nib':'\\u2712\\ufe0f',\n 'black_small_square':'\\u25aa\\ufe0f',\n 'black_square_button':'\\ud83d\\udd32',\n 'blonde_man':'\\ud83d\\udc71',\n 'blonde_woman':'\\ud83d\\udc71\\u2640\\ufe0f',\n 'blossom':'\\ud83c\\udf3c',\n 'blowfish':'\\ud83d\\udc21',\n 'blue_book':'\\ud83d\\udcd8',\n 'blue_car':'\\ud83d\\ude99',\n 'blue_heart':'\\ud83d\\udc99',\n 'blush':'\\ud83d\\ude0a',\n 'boar':'\\ud83d\\udc17',\n 'boat':'\\u26f5\\ufe0f',\n 'bomb':'\\ud83d\\udca3',\n 'book':'\\ud83d\\udcd6',\n 'bookmark':'\\ud83d\\udd16',\n 'bookmark_tabs':'\\ud83d\\udcd1',\n 'books':'\\ud83d\\udcda',\n 'boom':'\\ud83d\\udca5',\n 'boot':'\\ud83d\\udc62',\n 'bouquet':'\\ud83d\\udc90',\n 'bowing_man':'\\ud83d\\ude47',\n 'bow_and_arrow':'\\ud83c\\udff9',\n 'bowing_woman':'\\ud83d\\ude47\\u2640\\ufe0f',\n 'bowling':'\\ud83c\\udfb3',\n 'boxing_glove':'\\ud83e\\udd4a',\n 'boy':'\\ud83d\\udc66',\n 'bread':'\\ud83c\\udf5e',\n 'bride_with_veil':'\\ud83d\\udc70',\n 'bridge_at_night':'\\ud83c\\udf09',\n 'briefcase':'\\ud83d\\udcbc',\n 'broken_heart':'\\ud83d\\udc94',\n 'bug':'\\ud83d\\udc1b',\n 'building_construction':'\\ud83c\\udfd7',\n 'bulb':'\\ud83d\\udca1',\n 'bullettrain_front':'\\ud83d\\ude85',\n 'bullettrain_side':'\\ud83d\\ude84',\n 'burrito':'\\ud83c\\udf2f',\n 'bus':'\\ud83d\\ude8c',\n 'business_suit_levitating':'\\ud83d\\udd74',\n 'busstop':'\\ud83d\\ude8f',\n 'bust_in_silhouette':'\\ud83d\\udc64',\n 'busts_in_silhouette':'\\ud83d\\udc65',\n 'butterfly':'\\ud83e\\udd8b',\n 'cactus':'\\ud83c\\udf35',\n 'cake':'\\ud83c\\udf70',\n 'calendar':'\\ud83d\\udcc6',\n 'call_me_hand':'\\ud83e\\udd19',\n 'calling':'\\ud83d\\udcf2',\n 'camel':'\\ud83d\\udc2b',\n 'camera':'\\ud83d\\udcf7',\n 'camera_flash':'\\ud83d\\udcf8',\n 'camping':'\\ud83c\\udfd5',\n 'cancer':'\\u264b\\ufe0f',\n 'candle':'\\ud83d\\udd6f',\n 'candy':'\\ud83c\\udf6c',\n 'canoe':'\\ud83d\\udef6',\n 'capital_abcd':'\\ud83d\\udd20',\n 'capricorn':'\\u2651\\ufe0f',\n 'car':'\\ud83d\\ude97',\n 'card_file_box':'\\ud83d\\uddc3',\n 'card_index':'\\ud83d\\udcc7',\n 'card_index_dividers':'\\ud83d\\uddc2',\n 'carousel_horse':'\\ud83c\\udfa0',\n 'carrot':'\\ud83e\\udd55',\n 'cat':'\\ud83d\\udc31',\n 'cat2':'\\ud83d\\udc08',\n 'cd':'\\ud83d\\udcbf',\n 'chains':'\\u26d3',\n 'champagne':'\\ud83c\\udf7e',\n 'chart':'\\ud83d\\udcb9',\n 'chart_with_downwards_trend':'\\ud83d\\udcc9',\n 'chart_with_upwards_trend':'\\ud83d\\udcc8',\n 'checkered_flag':'\\ud83c\\udfc1',\n 'cheese':'\\ud83e\\uddc0',\n 'cherries':'\\ud83c\\udf52',\n 'cherry_blossom':'\\ud83c\\udf38',\n 'chestnut':'\\ud83c\\udf30',\n 'chicken':'\\ud83d\\udc14',\n 'children_crossing':'\\ud83d\\udeb8',\n 'chipmunk':'\\ud83d\\udc3f',\n 'chocolate_bar':'\\ud83c\\udf6b',\n 'christmas_tree':'\\ud83c\\udf84',\n 'church':'\\u26ea\\ufe0f',\n 'cinema':'\\ud83c\\udfa6',\n 'circus_tent':'\\ud83c\\udfaa',\n 'city_sunrise':'\\ud83c\\udf07',\n 'city_sunset':'\\ud83c\\udf06',\n 'cityscape':'\\ud83c\\udfd9',\n 'cl':'\\ud83c\\udd91',\n 'clamp':'\\ud83d\\udddc',\n 'clap':'\\ud83d\\udc4f',\n 'clapper':'\\ud83c\\udfac',\n 'classical_building':'\\ud83c\\udfdb',\n 'clinking_glasses':'\\ud83e\\udd42',\n 'clipboard':'\\ud83d\\udccb',\n 'clock1':'\\ud83d\\udd50',\n 'clock10':'\\ud83d\\udd59',\n 'clock1030':'\\ud83d\\udd65',\n 'clock11':'\\ud83d\\udd5a',\n 'clock1130':'\\ud83d\\udd66',\n 'clock12':'\\ud83d\\udd5b',\n 'clock1230':'\\ud83d\\udd67',\n 'clock130':'\\ud83d\\udd5c',\n 'clock2':'\\ud83d\\udd51',\n 'clock230':'\\ud83d\\udd5d',\n 'clock3':'\\ud83d\\udd52',\n 'clock330':'\\ud83d\\udd5e',\n 'clock4':'\\ud83d\\udd53',\n 'clock430':'\\ud83d\\udd5f',\n 'clock5':'\\ud83d\\udd54',\n 'clock530':'\\ud83d\\udd60',\n 'clock6':'\\ud83d\\udd55',\n 'clock630':'\\ud83d\\udd61',\n 'clock7':'\\ud83d\\udd56',\n 'clock730':'\\ud83d\\udd62',\n 'clock8':'\\ud83d\\udd57',\n 'clock830':'\\ud83d\\udd63',\n 'clock9':'\\ud83d\\udd58',\n 'clock930':'\\ud83d\\udd64',\n 'closed_book':'\\ud83d\\udcd5',\n 'closed_lock_with_key':'\\ud83d\\udd10',\n 'closed_umbrella':'\\ud83c\\udf02',\n 'cloud':'\\u2601\\ufe0f',\n 'cloud_with_lightning':'\\ud83c\\udf29',\n 'cloud_with_lightning_and_rain':'\\u26c8',\n 'cloud_with_rain':'\\ud83c\\udf27',\n 'cloud_with_snow':'\\ud83c\\udf28',\n 'clown_face':'\\ud83e\\udd21',\n 'clubs':'\\u2663\\ufe0f',\n 'cocktail':'\\ud83c\\udf78',\n 'coffee':'\\u2615\\ufe0f',\n 'coffin':'\\u26b0\\ufe0f',\n 'cold_sweat':'\\ud83d\\ude30',\n 'comet':'\\u2604\\ufe0f',\n 'computer':'\\ud83d\\udcbb',\n 'computer_mouse':'\\ud83d\\uddb1',\n 'confetti_ball':'\\ud83c\\udf8a',\n 'confounded':'\\ud83d\\ude16',\n 'confused':'\\ud83d\\ude15',\n 'congratulations':'\\u3297\\ufe0f',\n 'construction':'\\ud83d\\udea7',\n 'construction_worker_man':'\\ud83d\\udc77',\n 'construction_worker_woman':'\\ud83d\\udc77\\u2640\\ufe0f',\n 'control_knobs':'\\ud83c\\udf9b',\n 'convenience_store':'\\ud83c\\udfea',\n 'cookie':'\\ud83c\\udf6a',\n 'cool':'\\ud83c\\udd92',\n 'policeman':'\\ud83d\\udc6e',\n 'copyright':'\\u00a9\\ufe0f',\n 'corn':'\\ud83c\\udf3d',\n 'couch_and_lamp':'\\ud83d\\udecb',\n 'couple':'\\ud83d\\udc6b',\n 'couple_with_heart_woman_man':'\\ud83d\\udc91',\n 'couple_with_heart_man_man':'\\ud83d\\udc68\\u2764\\ufe0f\\ud83d\\udc68',\n 'couple_with_heart_woman_woman':'\\ud83d\\udc69\\u2764\\ufe0f\\ud83d\\udc69',\n 'couplekiss_man_man':'\\ud83d\\udc68\\u2764\\ufe0f\\ud83d\\udc8b\\ud83d\\udc68',\n 'couplekiss_man_woman':'\\ud83d\\udc8f',\n 'couplekiss_woman_woman':'\\ud83d\\udc69\\u2764\\ufe0f\\ud83d\\udc8b\\ud83d\\udc69',\n 'cow':'\\ud83d\\udc2e',\n 'cow2':'\\ud83d\\udc04',\n 'cowboy_hat_face':'\\ud83e\\udd20',\n 'crab':'\\ud83e\\udd80',\n 'crayon':'\\ud83d\\udd8d',\n 'credit_card':'\\ud83d\\udcb3',\n 'crescent_moon':'\\ud83c\\udf19',\n 'cricket':'\\ud83c\\udfcf',\n 'crocodile':'\\ud83d\\udc0a',\n 'croissant':'\\ud83e\\udd50',\n 'crossed_fingers':'\\ud83e\\udd1e',\n 'crossed_flags':'\\ud83c\\udf8c',\n 'crossed_swords':'\\u2694\\ufe0f',\n 'crown':'\\ud83d\\udc51',\n 'cry':'\\ud83d\\ude22',\n 'crying_cat_face':'\\ud83d\\ude3f',\n 'crystal_ball':'\\ud83d\\udd2e',\n 'cucumber':'\\ud83e\\udd52',\n 'cupid':'\\ud83d\\udc98',\n 'curly_loop':'\\u27b0',\n 'currency_exchange':'\\ud83d\\udcb1',\n 'curry':'\\ud83c\\udf5b',\n 'custard':'\\ud83c\\udf6e',\n 'customs':'\\ud83d\\udec3',\n 'cyclone':'\\ud83c\\udf00',\n 'dagger':'\\ud83d\\udde1',\n 'dancer':'\\ud83d\\udc83',\n 'dancing_women':'\\ud83d\\udc6f',\n 'dancing_men':'\\ud83d\\udc6f\\u2642\\ufe0f',\n 'dango':'\\ud83c\\udf61',\n 'dark_sunglasses':'\\ud83d\\udd76',\n 'dart':'\\ud83c\\udfaf',\n 'dash':'\\ud83d\\udca8',\n 'date':'\\ud83d\\udcc5',\n 'deciduous_tree':'\\ud83c\\udf33',\n 'deer':'\\ud83e\\udd8c',\n 'department_store':'\\ud83c\\udfec',\n 'derelict_house':'\\ud83c\\udfda',\n 'desert':'\\ud83c\\udfdc',\n 'desert_island':'\\ud83c\\udfdd',\n 'desktop_computer':'\\ud83d\\udda5',\n 'male_detective':'\\ud83d\\udd75\\ufe0f',\n 'diamond_shape_with_a_dot_inside':'\\ud83d\\udca0',\n 'diamonds':'\\u2666\\ufe0f',\n 'disappointed':'\\ud83d\\ude1e',\n 'disappointed_relieved':'\\ud83d\\ude25',\n 'dizzy':'\\ud83d\\udcab',\n 'dizzy_face':'\\ud83d\\ude35',\n 'do_not_litter':'\\ud83d\\udeaf',\n 'dog':'\\ud83d\\udc36',\n 'dog2':'\\ud83d\\udc15',\n 'dollar':'\\ud83d\\udcb5',\n 'dolls':'\\ud83c\\udf8e',\n 'dolphin':'\\ud83d\\udc2c',\n 'door':'\\ud83d\\udeaa',\n 'doughnut':'\\ud83c\\udf69',\n 'dove':'\\ud83d\\udd4a',\n 'dragon':'\\ud83d\\udc09',\n 'dragon_face':'\\ud83d\\udc32',\n 'dress':'\\ud83d\\udc57',\n 'dromedary_camel':'\\ud83d\\udc2a',\n 'drooling_face':'\\ud83e\\udd24',\n 'droplet':'\\ud83d\\udca7',\n 'drum':'\\ud83e\\udd41',\n 'duck':'\\ud83e\\udd86',\n 'dvd':'\\ud83d\\udcc0',\n 'e-mail':'\\ud83d\\udce7',\n 'eagle':'\\ud83e\\udd85',\n 'ear':'\\ud83d\\udc42',\n 'ear_of_rice':'\\ud83c\\udf3e',\n 'earth_africa':'\\ud83c\\udf0d',\n 'earth_americas':'\\ud83c\\udf0e',\n 'earth_asia':'\\ud83c\\udf0f',\n 'egg':'\\ud83e\\udd5a',\n 'eggplant':'\\ud83c\\udf46',\n 'eight_pointed_black_star':'\\u2734\\ufe0f',\n 'eight_spoked_asterisk':'\\u2733\\ufe0f',\n 'electric_plug':'\\ud83d\\udd0c',\n 'elephant':'\\ud83d\\udc18',\n 'email':'\\u2709\\ufe0f',\n 'end':'\\ud83d\\udd1a',\n 'envelope_with_arrow':'\\ud83d\\udce9',\n 'euro':'\\ud83d\\udcb6',\n 'european_castle':'\\ud83c\\udff0',\n 'european_post_office':'\\ud83c\\udfe4',\n 'evergreen_tree':'\\ud83c\\udf32',\n 'exclamation':'\\u2757\\ufe0f',\n 'expressionless':'\\ud83d\\ude11',\n 'eye':'\\ud83d\\udc41',\n 'eye_speech_bubble':'\\ud83d\\udc41\\ud83d\\udde8',\n 'eyeglasses':'\\ud83d\\udc53',\n 'eyes':'\\ud83d\\udc40',\n 'face_with_head_bandage':'\\ud83e\\udd15',\n 'face_with_thermometer':'\\ud83e\\udd12',\n 'fist_oncoming':'\\ud83d\\udc4a',\n 'factory':'\\ud83c\\udfed',\n 'fallen_leaf':'\\ud83c\\udf42',\n 'family_man_woman_boy':'\\ud83d\\udc6a',\n 'family_man_boy':'\\ud83d\\udc68\\ud83d\\udc66',\n 'family_man_boy_boy':'\\ud83d\\udc68\\ud83d\\udc66\\ud83d\\udc66',\n 'family_man_girl':'\\ud83d\\udc68\\ud83d\\udc67',\n 'family_man_girl_boy':'\\ud83d\\udc68\\ud83d\\udc67\\ud83d\\udc66',\n 'family_man_girl_girl':'\\ud83d\\udc68\\ud83d\\udc67\\ud83d\\udc67',\n 'family_man_man_boy':'\\ud83d\\udc68\\ud83d\\udc68\\ud83d\\udc66',\n 'family_man_man_boy_boy':'\\ud83d\\udc68\\ud83d\\udc68\\ud83d\\udc66\\ud83d\\udc66',\n 'family_man_man_girl':'\\ud83d\\udc68\\ud83d\\udc68\\ud83d\\udc67',\n 'family_man_man_girl_boy':'\\ud83d\\udc68\\ud83d\\udc68\\ud83d\\udc67\\ud83d\\udc66',\n 'family_man_man_girl_girl':'\\ud83d\\udc68\\ud83d\\udc68\\ud83d\\udc67\\ud83d\\udc67',\n 'family_man_woman_boy_boy':'\\ud83d\\udc68\\ud83d\\udc69\\ud83d\\udc66\\ud83d\\udc66',\n 'family_man_woman_girl':'\\ud83d\\udc68\\ud83d\\udc69\\ud83d\\udc67',\n 'family_man_woman_girl_boy':'\\ud83d\\udc68\\ud83d\\udc69\\ud83d\\udc67\\ud83d\\udc66',\n 'family_man_woman_girl_girl':'\\ud83d\\udc68\\ud83d\\udc69\\ud83d\\udc67\\ud83d\\udc67',\n 'family_woman_boy':'\\ud83d\\udc69\\ud83d\\udc66',\n 'family_woman_boy_boy':'\\ud83d\\udc69\\ud83d\\udc66\\ud83d\\udc66',\n 'family_woman_girl':'\\ud83d\\udc69\\ud83d\\udc67',\n 'family_woman_girl_boy':'\\ud83d\\udc69\\ud83d\\udc67\\ud83d\\udc66',\n 'family_woman_girl_girl':'\\ud83d\\udc69\\ud83d\\udc67\\ud83d\\udc67',\n 'family_woman_woman_boy':'\\ud83d\\udc69\\ud83d\\udc69\\ud83d\\udc66',\n 'family_woman_woman_boy_boy':'\\ud83d\\udc69\\ud83d\\udc69\\ud83d\\udc66\\ud83d\\udc66',\n 'family_woman_woman_girl':'\\ud83d\\udc69\\ud83d\\udc69\\ud83d\\udc67',\n 'family_woman_woman_girl_boy':'\\ud83d\\udc69\\ud83d\\udc69\\ud83d\\udc67\\ud83d\\udc66',\n 'family_woman_woman_girl_girl':'\\ud83d\\udc69\\ud83d\\udc69\\ud83d\\udc67\\ud83d\\udc67',\n 'fast_forward':'\\u23e9',\n 'fax':'\\ud83d\\udce0',\n 'fearful':'\\ud83d\\ude28',\n 'feet':'\\ud83d\\udc3e',\n 'female_detective':'\\ud83d\\udd75\\ufe0f\\u2640\\ufe0f',\n 'ferris_wheel':'\\ud83c\\udfa1',\n 'ferry':'\\u26f4',\n 'field_hockey':'\\ud83c\\udfd1',\n 'file_cabinet':'\\ud83d\\uddc4',\n 'file_folder':'\\ud83d\\udcc1',\n 'film_projector':'\\ud83d\\udcfd',\n 'film_strip':'\\ud83c\\udf9e',\n 'fire':'\\ud83d\\udd25',\n 'fire_engine':'\\ud83d\\ude92',\n 'fireworks':'\\ud83c\\udf86',\n 'first_quarter_moon':'\\ud83c\\udf13',\n 'first_quarter_moon_with_face':'\\ud83c\\udf1b',\n 'fish':'\\ud83d\\udc1f',\n 'fish_cake':'\\ud83c\\udf65',\n 'fishing_pole_and_fish':'\\ud83c\\udfa3',\n 'fist_raised':'\\u270a',\n 'fist_left':'\\ud83e\\udd1b',\n 'fist_right':'\\ud83e\\udd1c',\n 'flags':'\\ud83c\\udf8f',\n 'flashlight':'\\ud83d\\udd26',\n 'fleur_de_lis':'\\u269c\\ufe0f',\n 'flight_arrival':'\\ud83d\\udeec',\n 'flight_departure':'\\ud83d\\udeeb',\n 'floppy_disk':'\\ud83d\\udcbe',\n 'flower_playing_cards':'\\ud83c\\udfb4',\n 'flushed':'\\ud83d\\ude33',\n 'fog':'\\ud83c\\udf2b',\n 'foggy':'\\ud83c\\udf01',\n 'football':'\\ud83c\\udfc8',\n 'footprints':'\\ud83d\\udc63',\n 'fork_and_knife':'\\ud83c\\udf74',\n 'fountain':'\\u26f2\\ufe0f',\n 'fountain_pen':'\\ud83d\\udd8b',\n 'four_leaf_clover':'\\ud83c\\udf40',\n 'fox_face':'\\ud83e\\udd8a',\n 'framed_picture':'\\ud83d\\uddbc',\n 'free':'\\ud83c\\udd93',\n 'fried_egg':'\\ud83c\\udf73',\n 'fried_shrimp':'\\ud83c\\udf64',\n 'fries':'\\ud83c\\udf5f',\n 'frog':'\\ud83d\\udc38',\n 'frowning':'\\ud83d\\ude26',\n 'frowning_face':'\\u2639\\ufe0f',\n 'frowning_man':'\\ud83d\\ude4d\\u2642\\ufe0f',\n 'frowning_woman':'\\ud83d\\ude4d',\n 'middle_finger':'\\ud83d\\udd95',\n 'fuelpump':'\\u26fd\\ufe0f',\n 'full_moon':'\\ud83c\\udf15',\n 'full_moon_with_face':'\\ud83c\\udf1d',\n 'funeral_urn':'\\u26b1\\ufe0f',\n 'game_die':'\\ud83c\\udfb2',\n 'gear':'\\u2699\\ufe0f',\n 'gem':'\\ud83d\\udc8e',\n 'gemini':'\\u264a\\ufe0f',\n 'ghost':'\\ud83d\\udc7b',\n 'gift':'\\ud83c\\udf81',\n 'gift_heart':'\\ud83d\\udc9d',\n 'girl':'\\ud83d\\udc67',\n 'globe_with_meridians':'\\ud83c\\udf10',\n 'goal_net':'\\ud83e\\udd45',\n 'goat':'\\ud83d\\udc10',\n 'golf':'\\u26f3\\ufe0f',\n 'golfing_man':'\\ud83c\\udfcc\\ufe0f',\n 'golfing_woman':'\\ud83c\\udfcc\\ufe0f\\u2640\\ufe0f',\n 'gorilla':'\\ud83e\\udd8d',\n 'grapes':'\\ud83c\\udf47',\n 'green_apple':'\\ud83c\\udf4f',\n 'green_book':'\\ud83d\\udcd7',\n 'green_heart':'\\ud83d\\udc9a',\n 'green_salad':'\\ud83e\\udd57',\n 'grey_exclamation':'\\u2755',\n 'grey_question':'\\u2754',\n 'grimacing':'\\ud83d\\ude2c',\n 'grin':'\\ud83d\\ude01',\n 'grinning':'\\ud83d\\ude00',\n 'guardsman':'\\ud83d\\udc82',\n 'guardswoman':'\\ud83d\\udc82\\u2640\\ufe0f',\n 'guitar':'\\ud83c\\udfb8',\n 'gun':'\\ud83d\\udd2b',\n 'haircut_woman':'\\ud83d\\udc87',\n 'haircut_man':'\\ud83d\\udc87\\u2642\\ufe0f',\n 'hamburger':'\\ud83c\\udf54',\n 'hammer':'\\ud83d\\udd28',\n 'hammer_and_pick':'\\u2692',\n 'hammer_and_wrench':'\\ud83d\\udee0',\n 'hamster':'\\ud83d\\udc39',\n 'hand':'\\u270b',\n 'handbag':'\\ud83d\\udc5c',\n 'handshake':'\\ud83e\\udd1d',\n 'hankey':'\\ud83d\\udca9',\n 'hatched_chick':'\\ud83d\\udc25',\n 'hatching_chick':'\\ud83d\\udc23',\n 'headphones':'\\ud83c\\udfa7',\n 'hear_no_evil':'\\ud83d\\ude49',\n 'heart':'\\u2764\\ufe0f',\n 'heart_decoration':'\\ud83d\\udc9f',\n 'heart_eyes':'\\ud83d\\ude0d',\n 'heart_eyes_cat':'\\ud83d\\ude3b',\n 'heartbeat':'\\ud83d\\udc93',\n 'heartpulse':'\\ud83d\\udc97',\n 'hearts':'\\u2665\\ufe0f',\n 'heavy_check_mark':'\\u2714\\ufe0f',\n 'heavy_division_sign':'\\u2797',\n 'heavy_dollar_sign':'\\ud83d\\udcb2',\n 'heavy_heart_exclamation':'\\u2763\\ufe0f',\n 'heavy_minus_sign':'\\u2796',\n 'heavy_multiplication_x':'\\u2716\\ufe0f',\n 'heavy_plus_sign':'\\u2795',\n 'helicopter':'\\ud83d\\ude81',\n 'herb':'\\ud83c\\udf3f',\n 'hibiscus':'\\ud83c\\udf3a',\n 'high_brightness':'\\ud83d\\udd06',\n 'high_heel':'\\ud83d\\udc60',\n 'hocho':'\\ud83d\\udd2a',\n 'hole':'\\ud83d\\udd73',\n 'honey_pot':'\\ud83c\\udf6f',\n 'horse':'\\ud83d\\udc34',\n 'horse_racing':'\\ud83c\\udfc7',\n 'hospital':'\\ud83c\\udfe5',\n 'hot_pepper':'\\ud83c\\udf36',\n 'hotdog':'\\ud83c\\udf2d',\n 'hotel':'\\ud83c\\udfe8',\n 'hotsprings':'\\u2668\\ufe0f',\n 'hourglass':'\\u231b\\ufe0f',\n 'hourglass_flowing_sand':'\\u23f3',\n 'house':'\\ud83c\\udfe0',\n 'house_with_garden':'\\ud83c\\udfe1',\n 'houses':'\\ud83c\\udfd8',\n 'hugs':'\\ud83e\\udd17',\n 'hushed':'\\ud83d\\ude2f',\n 'ice_cream':'\\ud83c\\udf68',\n 'ice_hockey':'\\ud83c\\udfd2',\n 'ice_skate':'\\u26f8',\n 'icecream':'\\ud83c\\udf66',\n 'id':'\\ud83c\\udd94',\n 'ideograph_advantage':'\\ud83c\\ude50',\n 'imp':'\\ud83d\\udc7f',\n 'inbox_tray':'\\ud83d\\udce5',\n 'incoming_envelope':'\\ud83d\\udce8',\n 'tipping_hand_woman':'\\ud83d\\udc81',\n 'information_source':'\\u2139\\ufe0f',\n 'innocent':'\\ud83d\\ude07',\n 'interrobang':'\\u2049\\ufe0f',\n 'iphone':'\\ud83d\\udcf1',\n 'izakaya_lantern':'\\ud83c\\udfee',\n 'jack_o_lantern':'\\ud83c\\udf83',\n 'japan':'\\ud83d\\uddfe',\n 'japanese_castle':'\\ud83c\\udfef',\n 'japanese_goblin':'\\ud83d\\udc7a',\n 'japanese_ogre':'\\ud83d\\udc79',\n 'jeans':'\\ud83d\\udc56',\n 'joy':'\\ud83d\\ude02',\n 'joy_cat':'\\ud83d\\ude39',\n 'joystick':'\\ud83d\\udd79',\n 'kaaba':'\\ud83d\\udd4b',\n 'key':'\\ud83d\\udd11',\n 'keyboard':'\\u2328\\ufe0f',\n 'keycap_ten':'\\ud83d\\udd1f',\n 'kick_scooter':'\\ud83d\\udef4',\n 'kimono':'\\ud83d\\udc58',\n 'kiss':'\\ud83d\\udc8b',\n 'kissing':'\\ud83d\\ude17',\n 'kissing_cat':'\\ud83d\\ude3d',\n 'kissing_closed_eyes':'\\ud83d\\ude1a',\n 'kissing_heart':'\\ud83d\\ude18',\n 'kissing_smiling_eyes':'\\ud83d\\ude19',\n 'kiwi_fruit':'\\ud83e\\udd5d',\n 'koala':'\\ud83d\\udc28',\n 'koko':'\\ud83c\\ude01',\n 'label':'\\ud83c\\udff7',\n 'large_blue_circle':'\\ud83d\\udd35',\n 'large_blue_diamond':'\\ud83d\\udd37',\n 'large_orange_diamond':'\\ud83d\\udd36',\n 'last_quarter_moon':'\\ud83c\\udf17',\n 'last_quarter_moon_with_face':'\\ud83c\\udf1c',\n 'latin_cross':'\\u271d\\ufe0f',\n 'laughing':'\\ud83d\\ude06',\n 'leaves':'\\ud83c\\udf43',\n 'ledger':'\\ud83d\\udcd2',\n 'left_luggage':'\\ud83d\\udec5',\n 'left_right_arrow':'\\u2194\\ufe0f',\n 'leftwards_arrow_with_hook':'\\u21a9\\ufe0f',\n 'lemon':'\\ud83c\\udf4b',\n 'leo':'\\u264c\\ufe0f',\n 'leopard':'\\ud83d\\udc06',\n 'level_slider':'\\ud83c\\udf9a',\n 'libra':'\\u264e\\ufe0f',\n 'light_rail':'\\ud83d\\ude88',\n 'link':'\\ud83d\\udd17',\n 'lion':'\\ud83e\\udd81',\n 'lips':'\\ud83d\\udc44',\n 'lipstick':'\\ud83d\\udc84',\n 'lizard':'\\ud83e\\udd8e',\n 'lock':'\\ud83d\\udd12',\n 'lock_with_ink_pen':'\\ud83d\\udd0f',\n 'lollipop':'\\ud83c\\udf6d',\n 'loop':'\\u27bf',\n 'loud_sound':'\\ud83d\\udd0a',\n 'loudspeaker':'\\ud83d\\udce2',\n 'love_hotel':'\\ud83c\\udfe9',\n 'love_letter':'\\ud83d\\udc8c',\n 'low_brightness':'\\ud83d\\udd05',\n 'lying_face':'\\ud83e\\udd25',\n 'm':'\\u24c2\\ufe0f',\n 'mag':'\\ud83d\\udd0d',\n 'mag_right':'\\ud83d\\udd0e',\n 'mahjong':'\\ud83c\\udc04\\ufe0f',\n 'mailbox':'\\ud83d\\udceb',\n 'mailbox_closed':'\\ud83d\\udcea',\n 'mailbox_with_mail':'\\ud83d\\udcec',\n 'mailbox_with_no_mail':'\\ud83d\\udced',\n 'man':'\\ud83d\\udc68',\n 'man_artist':'\\ud83d\\udc68\\ud83c\\udfa8',\n 'man_astronaut':'\\ud83d\\udc68\\ud83d\\ude80',\n 'man_cartwheeling':'\\ud83e\\udd38\\u2642\\ufe0f',\n 'man_cook':'\\ud83d\\udc68\\ud83c\\udf73',\n 'man_dancing':'\\ud83d\\udd7a',\n 'man_facepalming':'\\ud83e\\udd26\\u2642\\ufe0f',\n 'man_factory_worker':'\\ud83d\\udc68\\ud83c\\udfed',\n 'man_farmer':'\\ud83d\\udc68\\ud83c\\udf3e',\n 'man_firefighter':'\\ud83d\\udc68\\ud83d\\ude92',\n 'man_health_worker':'\\ud83d\\udc68\\u2695\\ufe0f',\n 'man_in_tuxedo':'\\ud83e\\udd35',\n 'man_judge':'\\ud83d\\udc68\\u2696\\ufe0f',\n 'man_juggling':'\\ud83e\\udd39\\u2642\\ufe0f',\n 'man_mechanic':'\\ud83d\\udc68\\ud83d\\udd27',\n 'man_office_worker':'\\ud83d\\udc68\\ud83d\\udcbc',\n 'man_pilot':'\\ud83d\\udc68\\u2708\\ufe0f',\n 'man_playing_handball':'\\ud83e\\udd3e\\u2642\\ufe0f',\n 'man_playing_water_polo':'\\ud83e\\udd3d\\u2642\\ufe0f',\n 'man_scientist':'\\ud83d\\udc68\\ud83d\\udd2c',\n 'man_shrugging':'\\ud83e\\udd37\\u2642\\ufe0f',\n 'man_singer':'\\ud83d\\udc68\\ud83c\\udfa4',\n 'man_student':'\\ud83d\\udc68\\ud83c\\udf93',\n 'man_teacher':'\\ud83d\\udc68\\ud83c\\udfeb',\n 'man_technologist':'\\ud83d\\udc68\\ud83d\\udcbb',\n 'man_with_gua_pi_mao':'\\ud83d\\udc72',\n 'man_with_turban':'\\ud83d\\udc73',\n 'tangerine':'\\ud83c\\udf4a',\n 'mans_shoe':'\\ud83d\\udc5e',\n 'mantelpiece_clock':'\\ud83d\\udd70',\n 'maple_leaf':'\\ud83c\\udf41',\n 'martial_arts_uniform':'\\ud83e\\udd4b',\n 'mask':'\\ud83d\\ude37',\n 'massage_woman':'\\ud83d\\udc86',\n 'massage_man':'\\ud83d\\udc86\\u2642\\ufe0f',\n 'meat_on_bone':'\\ud83c\\udf56',\n 'medal_military':'\\ud83c\\udf96',\n 'medal_sports':'\\ud83c\\udfc5',\n 'mega':'\\ud83d\\udce3',\n 'melon':'\\ud83c\\udf48',\n 'memo':'\\ud83d\\udcdd',\n 'men_wrestling':'\\ud83e\\udd3c\\u2642\\ufe0f',\n 'menorah':'\\ud83d\\udd4e',\n 'mens':'\\ud83d\\udeb9',\n 'metal':'\\ud83e\\udd18',\n 'metro':'\\ud83d\\ude87',\n 'microphone':'\\ud83c\\udfa4',\n 'microscope':'\\ud83d\\udd2c',\n 'milk_glass':'\\ud83e\\udd5b',\n 'milky_way':'\\ud83c\\udf0c',\n 'minibus':'\\ud83d\\ude90',\n 'minidisc':'\\ud83d\\udcbd',\n 'mobile_phone_off':'\\ud83d\\udcf4',\n 'money_mouth_face':'\\ud83e\\udd11',\n 'money_with_wings':'\\ud83d\\udcb8',\n 'moneybag':'\\ud83d\\udcb0',\n 'monkey':'\\ud83d\\udc12',\n 'monkey_face':'\\ud83d\\udc35',\n 'monorail':'\\ud83d\\ude9d',\n 'moon':'\\ud83c\\udf14',\n 'mortar_board':'\\ud83c\\udf93',\n 'mosque':'\\ud83d\\udd4c',\n 'motor_boat':'\\ud83d\\udee5',\n 'motor_scooter':'\\ud83d\\udef5',\n 'motorcycle':'\\ud83c\\udfcd',\n 'motorway':'\\ud83d\\udee3',\n 'mount_fuji':'\\ud83d\\uddfb',\n 'mountain':'\\u26f0',\n 'mountain_biking_man':'\\ud83d\\udeb5',\n 'mountain_biking_woman':'\\ud83d\\udeb5\\u2640\\ufe0f',\n 'mountain_cableway':'\\ud83d\\udea0',\n 'mountain_railway':'\\ud83d\\ude9e',\n 'mountain_snow':'\\ud83c\\udfd4',\n 'mouse':'\\ud83d\\udc2d',\n 'mouse2':'\\ud83d\\udc01',\n 'movie_camera':'\\ud83c\\udfa5',\n 'moyai':'\\ud83d\\uddff',\n 'mrs_claus':'\\ud83e\\udd36',\n 'muscle':'\\ud83d\\udcaa',\n 'mushroom':'\\ud83c\\udf44',\n 'musical_keyboard':'\\ud83c\\udfb9',\n 'musical_note':'\\ud83c\\udfb5',\n 'musical_score':'\\ud83c\\udfbc',\n 'mute':'\\ud83d\\udd07',\n 'nail_care':'\\ud83d\\udc85',\n 'name_badge':'\\ud83d\\udcdb',\n 'national_park':'\\ud83c\\udfde',\n 'nauseated_face':'\\ud83e\\udd22',\n 'necktie':'\\ud83d\\udc54',\n 'negative_squared_cross_mark':'\\u274e',\n 'nerd_face':'\\ud83e\\udd13',\n 'neutral_face':'\\ud83d\\ude10',\n 'new':'\\ud83c\\udd95',\n 'new_moon':'\\ud83c\\udf11',\n 'new_moon_with_face':'\\ud83c\\udf1a',\n 'newspaper':'\\ud83d\\udcf0',\n 'newspaper_roll':'\\ud83d\\uddde',\n 'next_track_button':'\\u23ed',\n 'ng':'\\ud83c\\udd96',\n 'no_good_man':'\\ud83d\\ude45\\u2642\\ufe0f',\n 'no_good_woman':'\\ud83d\\ude45',\n 'night_with_stars':'\\ud83c\\udf03',\n 'no_bell':'\\ud83d\\udd15',\n 'no_bicycles':'\\ud83d\\udeb3',\n 'no_entry':'\\u26d4\\ufe0f',\n 'no_entry_sign':'\\ud83d\\udeab',\n 'no_mobile_phones':'\\ud83d\\udcf5',\n 'no_mouth':'\\ud83d\\ude36',\n 'no_pedestrians':'\\ud83d\\udeb7',\n 'no_smoking':'\\ud83d\\udead',\n 'non-potable_water':'\\ud83d\\udeb1',\n 'nose':'\\ud83d\\udc43',\n 'notebook':'\\ud83d\\udcd3',\n 'notebook_with_decorative_cover':'\\ud83d\\udcd4',\n 'notes':'\\ud83c\\udfb6',\n 'nut_and_bolt':'\\ud83d\\udd29',\n 'o':'\\u2b55\\ufe0f',\n 'o2':'\\ud83c\\udd7e\\ufe0f',\n 'ocean':'\\ud83c\\udf0a',\n 'octopus':'\\ud83d\\udc19',\n 'oden':'\\ud83c\\udf62',\n 'office':'\\ud83c\\udfe2',\n 'oil_drum':'\\ud83d\\udee2',\n 'ok':'\\ud83c\\udd97',\n 'ok_hand':'\\ud83d\\udc4c',\n 'ok_man':'\\ud83d\\ude46\\u2642\\ufe0f',\n 'ok_woman':'\\ud83d\\ude46',\n 'old_key':'\\ud83d\\udddd',\n 'older_man':'\\ud83d\\udc74',\n 'older_woman':'\\ud83d\\udc75',\n 'om':'\\ud83d\\udd49',\n 'on':'\\ud83d\\udd1b',\n 'oncoming_automobile':'\\ud83d\\ude98',\n 'oncoming_bus':'\\ud83d\\ude8d',\n 'oncoming_police_car':'\\ud83d\\ude94',\n 'oncoming_taxi':'\\ud83d\\ude96',\n 'open_file_folder':'\\ud83d\\udcc2',\n 'open_hands':'\\ud83d\\udc50',\n 'open_mouth':'\\ud83d\\ude2e',\n 'open_umbrella':'\\u2602\\ufe0f',\n 'ophiuchus':'\\u26ce',\n 'orange_book':'\\ud83d\\udcd9',\n 'orthodox_cross':'\\u2626\\ufe0f',\n 'outbox_tray':'\\ud83d\\udce4',\n 'owl':'\\ud83e\\udd89',\n 'ox':'\\ud83d\\udc02',\n 'package':'\\ud83d\\udce6',\n 'page_facing_up':'\\ud83d\\udcc4',\n 'page_with_curl':'\\ud83d\\udcc3',\n 'pager':'\\ud83d\\udcdf',\n 'paintbrush':'\\ud83d\\udd8c',\n 'palm_tree':'\\ud83c\\udf34',\n 'pancakes':'\\ud83e\\udd5e',\n 'panda_face':'\\ud83d\\udc3c',\n 'paperclip':'\\ud83d\\udcce',\n 'paperclips':'\\ud83d\\udd87',\n 'parasol_on_ground':'\\u26f1',\n 'parking':'\\ud83c\\udd7f\\ufe0f',\n 'part_alternation_mark':'\\u303d\\ufe0f',\n 'partly_sunny':'\\u26c5\\ufe0f',\n 'passenger_ship':'\\ud83d\\udef3',\n 'passport_control':'\\ud83d\\udec2',\n 'pause_button':'\\u23f8',\n 'peace_symbol':'\\u262e\\ufe0f',\n 'peach':'\\ud83c\\udf51',\n 'peanuts':'\\ud83e\\udd5c',\n 'pear':'\\ud83c\\udf50',\n 'pen':'\\ud83d\\udd8a',\n 'pencil2':'\\u270f\\ufe0f',\n 'penguin':'\\ud83d\\udc27',\n 'pensive':'\\ud83d\\ude14',\n 'performing_arts':'\\ud83c\\udfad',\n 'persevere':'\\ud83d\\ude23',\n 'person_fencing':'\\ud83e\\udd3a',\n 'pouting_woman':'\\ud83d\\ude4e',\n 'phone':'\\u260e\\ufe0f',\n 'pick':'\\u26cf',\n 'pig':'\\ud83d\\udc37',\n 'pig2':'\\ud83d\\udc16',\n 'pig_nose':'\\ud83d\\udc3d',\n 'pill':'\\ud83d\\udc8a',\n 'pineapple':'\\ud83c\\udf4d',\n 'ping_pong':'\\ud83c\\udfd3',\n 'pisces':'\\u2653\\ufe0f',\n 'pizza':'\\ud83c\\udf55',\n 'place_of_worship':'\\ud83d\\uded0',\n 'plate_with_cutlery':'\\ud83c\\udf7d',\n 'play_or_pause_button':'\\u23ef',\n 'point_down':'\\ud83d\\udc47',\n 'point_left':'\\ud83d\\udc48',\n 'point_right':'\\ud83d\\udc49',\n 'point_up':'\\u261d\\ufe0f',\n 'point_up_2':'\\ud83d\\udc46',\n 'police_car':'\\ud83d\\ude93',\n 'policewoman':'\\ud83d\\udc6e\\u2640\\ufe0f',\n 'poodle':'\\ud83d\\udc29',\n 'popcorn':'\\ud83c\\udf7f',\n 'post_office':'\\ud83c\\udfe3',\n 'postal_horn':'\\ud83d\\udcef',\n 'postbox':'\\ud83d\\udcee',\n 'potable_water':'\\ud83d\\udeb0',\n 'potato':'\\ud83e\\udd54',\n 'pouch':'\\ud83d\\udc5d',\n 'poultry_leg':'\\ud83c\\udf57',\n 'pound':'\\ud83d\\udcb7',\n 'rage':'\\ud83d\\ude21',\n 'pouting_cat':'\\ud83d\\ude3e',\n 'pouting_man':'\\ud83d\\ude4e\\u2642\\ufe0f',\n 'pray':'\\ud83d\\ude4f',\n 'prayer_beads':'\\ud83d\\udcff',\n 'pregnant_woman':'\\ud83e\\udd30',\n 'previous_track_button':'\\u23ee',\n 'prince':'\\ud83e\\udd34',\n 'princess':'\\ud83d\\udc78',\n 'printer':'\\ud83d\\udda8',\n 'purple_heart':'\\ud83d\\udc9c',\n 'purse':'\\ud83d\\udc5b',\n 'pushpin':'\\ud83d\\udccc',\n 'put_litter_in_its_place':'\\ud83d\\udeae',\n 'question':'\\u2753',\n 'rabbit':'\\ud83d\\udc30',\n 'rabbit2':'\\ud83d\\udc07',\n 'racehorse':'\\ud83d\\udc0e',\n 'racing_car':'\\ud83c\\udfce',\n 'radio':'\\ud83d\\udcfb',\n 'radio_button':'\\ud83d\\udd18',\n 'radioactive':'\\u2622\\ufe0f',\n 'railway_car':'\\ud83d\\ude83',\n 'railway_track':'\\ud83d\\udee4',\n 'rainbow':'\\ud83c\\udf08',\n 'rainbow_flag':'\\ud83c\\udff3\\ufe0f\\ud83c\\udf08',\n 'raised_back_of_hand':'\\ud83e\\udd1a',\n 'raised_hand_with_fingers_splayed':'\\ud83d\\udd90',\n 'raised_hands':'\\ud83d\\ude4c',\n 'raising_hand_woman':'\\ud83d\\ude4b',\n 'raising_hand_man':'\\ud83d\\ude4b\\u2642\\ufe0f',\n 'ram':'\\ud83d\\udc0f',\n 'ramen':'\\ud83c\\udf5c',\n 'rat':'\\ud83d\\udc00',\n 'record_button':'\\u23fa',\n 'recycle':'\\u267b\\ufe0f',\n 'red_circle':'\\ud83d\\udd34',\n 'registered':'\\u00ae\\ufe0f',\n 'relaxed':'\\u263a\\ufe0f',\n 'relieved':'\\ud83d\\ude0c',\n 'reminder_ribbon':'\\ud83c\\udf97',\n 'repeat':'\\ud83d\\udd01',\n 'repeat_one':'\\ud83d\\udd02',\n 'rescue_worker_helmet':'\\u26d1',\n 'restroom':'\\ud83d\\udebb',\n 'revolving_hearts':'\\ud83d\\udc9e',\n 'rewind':'\\u23ea',\n 'rhinoceros':'\\ud83e\\udd8f',\n 'ribbon':'\\ud83c\\udf80',\n 'rice':'\\ud83c\\udf5a',\n 'rice_ball':'\\ud83c\\udf59',\n 'rice_cracker':'\\ud83c\\udf58',\n 'rice_scene':'\\ud83c\\udf91',\n 'right_anger_bubble':'\\ud83d\\uddef',\n 'ring':'\\ud83d\\udc8d',\n 'robot':'\\ud83e\\udd16',\n 'rocket':'\\ud83d\\ude80',\n 'rofl':'\\ud83e\\udd23',\n 'roll_eyes':'\\ud83d\\ude44',\n 'roller_coaster':'\\ud83c\\udfa2',\n 'rooster':'\\ud83d\\udc13',\n 'rose':'\\ud83c\\udf39',\n 'rosette':'\\ud83c\\udff5',\n 'rotating_light':'\\ud83d\\udea8',\n 'round_pushpin':'\\ud83d\\udccd',\n 'rowing_man':'\\ud83d\\udea3',\n 'rowing_woman':'\\ud83d\\udea3\\u2640\\ufe0f',\n 'rugby_football':'\\ud83c\\udfc9',\n 'running_man':'\\ud83c\\udfc3',\n 'running_shirt_with_sash':'\\ud83c\\udfbd',\n 'running_woman':'\\ud83c\\udfc3\\u2640\\ufe0f',\n 'sa':'\\ud83c\\ude02\\ufe0f',\n 'sagittarius':'\\u2650\\ufe0f',\n 'sake':'\\ud83c\\udf76',\n 'sandal':'\\ud83d\\udc61',\n 'santa':'\\ud83c\\udf85',\n 'satellite':'\\ud83d\\udce1',\n 'saxophone':'\\ud83c\\udfb7',\n 'school':'\\ud83c\\udfeb',\n 'school_satchel':'\\ud83c\\udf92',\n 'scissors':'\\u2702\\ufe0f',\n 'scorpion':'\\ud83e\\udd82',\n 'scorpius':'\\u264f\\ufe0f',\n 'scream':'\\ud83d\\ude31',\n 'scream_cat':'\\ud83d\\ude40',\n 'scroll':'\\ud83d\\udcdc',\n 'seat':'\\ud83d\\udcba',\n 'secret':'\\u3299\\ufe0f',\n 'see_no_evil':'\\ud83d\\ude48',\n 'seedling':'\\ud83c\\udf31',\n 'selfie':'\\ud83e\\udd33',\n 'shallow_pan_of_food':'\\ud83e\\udd58',\n 'shamrock':'\\u2618\\ufe0f',\n 'shark':'\\ud83e\\udd88',\n 'shaved_ice':'\\ud83c\\udf67',\n 'sheep':'\\ud83d\\udc11',\n 'shell':'\\ud83d\\udc1a',\n 'shield':'\\ud83d\\udee1',\n 'shinto_shrine':'\\u26e9',\n 'ship':'\\ud83d\\udea2',\n 'shirt':'\\ud83d\\udc55',\n 'shopping':'\\ud83d\\udecd',\n 'shopping_cart':'\\ud83d\\uded2',\n 'shower':'\\ud83d\\udebf',\n 'shrimp':'\\ud83e\\udd90',\n 'signal_strength':'\\ud83d\\udcf6',\n 'six_pointed_star':'\\ud83d\\udd2f',\n 'ski':'\\ud83c\\udfbf',\n 'skier':'\\u26f7',\n 'skull':'\\ud83d\\udc80',\n 'skull_and_crossbones':'\\u2620\\ufe0f',\n 'sleeping':'\\ud83d\\ude34',\n 'sleeping_bed':'\\ud83d\\udecc',\n 'sleepy':'\\ud83d\\ude2a',\n 'slightly_frowning_face':'\\ud83d\\ude41',\n 'slightly_smiling_face':'\\ud83d\\ude42',\n 'slot_machine':'\\ud83c\\udfb0',\n 'small_airplane':'\\ud83d\\udee9',\n 'small_blue_diamond':'\\ud83d\\udd39',\n 'small_orange_diamond':'\\ud83d\\udd38',\n 'small_red_triangle':'\\ud83d\\udd3a',\n 'small_red_triangle_down':'\\ud83d\\udd3b',\n 'smile':'\\ud83d\\ude04',\n 'smile_cat':'\\ud83d\\ude38',\n 'smiley':'\\ud83d\\ude03',\n 'smiley_cat':'\\ud83d\\ude3a',\n 'smiling_imp':'\\ud83d\\ude08',\n 'smirk':'\\ud83d\\ude0f',\n 'smirk_cat':'\\ud83d\\ude3c',\n 'smoking':'\\ud83d\\udeac',\n 'snail':'\\ud83d\\udc0c',\n 'snake':'\\ud83d\\udc0d',\n 'sneezing_face':'\\ud83e\\udd27',\n 'snowboarder':'\\ud83c\\udfc2',\n 'snowflake':'\\u2744\\ufe0f',\n 'snowman':'\\u26c4\\ufe0f',\n 'snowman_with_snow':'\\u2603\\ufe0f',\n 'sob':'\\ud83d\\ude2d',\n 'soccer':'\\u26bd\\ufe0f',\n 'soon':'\\ud83d\\udd1c',\n 'sos':'\\ud83c\\udd98',\n 'sound':'\\ud83d\\udd09',\n 'space_invader':'\\ud83d\\udc7e',\n 'spades':'\\u2660\\ufe0f',\n 'spaghetti':'\\ud83c\\udf5d',\n 'sparkle':'\\u2747\\ufe0f',\n 'sparkler':'\\ud83c\\udf87',\n 'sparkles':'\\u2728',\n 'sparkling_heart':'\\ud83d\\udc96',\n 'speak_no_evil':'\\ud83d\\ude4a',\n 'speaker':'\\ud83d\\udd08',\n 'speaking_head':'\\ud83d\\udde3',\n 'speech_balloon':'\\ud83d\\udcac',\n 'speedboat':'\\ud83d\\udea4',\n 'spider':'\\ud83d\\udd77',\n 'spider_web':'\\ud83d\\udd78',\n 'spiral_calendar':'\\ud83d\\uddd3',\n 'spiral_notepad':'\\ud83d\\uddd2',\n 'spoon':'\\ud83e\\udd44',\n 'squid':'\\ud83e\\udd91',\n 'stadium':'\\ud83c\\udfdf',\n 'star':'\\u2b50\\ufe0f',\n 'star2':'\\ud83c\\udf1f',\n 'star_and_crescent':'\\u262a\\ufe0f',\n 'star_of_david':'\\u2721\\ufe0f',\n 'stars':'\\ud83c\\udf20',\n 'station':'\\ud83d\\ude89',\n 'statue_of_liberty':'\\ud83d\\uddfd',\n 'steam_locomotive':'\\ud83d\\ude82',\n 'stew':'\\ud83c\\udf72',\n 'stop_button':'\\u23f9',\n 'stop_sign':'\\ud83d\\uded1',\n 'stopwatch':'\\u23f1',\n 'straight_ruler':'\\ud83d\\udccf',\n 'strawberry':'\\ud83c\\udf53',\n 'stuck_out_tongue':'\\ud83d\\ude1b',\n 'stuck_out_tongue_closed_eyes':'\\ud83d\\ude1d',\n 'stuck_out_tongue_winking_eye':'\\ud83d\\ude1c',\n 'studio_microphone':'\\ud83c\\udf99',\n 'stuffed_flatbread':'\\ud83e\\udd59',\n 'sun_behind_large_cloud':'\\ud83c\\udf25',\n 'sun_behind_rain_cloud':'\\ud83c\\udf26',\n 'sun_behind_small_cloud':'\\ud83c\\udf24',\n 'sun_with_face':'\\ud83c\\udf1e',\n 'sunflower':'\\ud83c\\udf3b',\n 'sunglasses':'\\ud83d\\ude0e',\n 'sunny':'\\u2600\\ufe0f',\n 'sunrise':'\\ud83c\\udf05',\n 'sunrise_over_mountains':'\\ud83c\\udf04',\n 'surfing_man':'\\ud83c\\udfc4',\n 'surfing_woman':'\\ud83c\\udfc4\\u2640\\ufe0f',\n 'sushi':'\\ud83c\\udf63',\n 'suspension_railway':'\\ud83d\\ude9f',\n 'sweat':'\\ud83d\\ude13',\n 'sweat_drops':'\\ud83d\\udca6',\n 'sweat_smile':'\\ud83d\\ude05',\n 'sweet_potato':'\\ud83c\\udf60',\n 'swimming_man':'\\ud83c\\udfca',\n 'swimming_woman':'\\ud83c\\udfca\\u2640\\ufe0f',\n 'symbols':'\\ud83d\\udd23',\n 'synagogue':'\\ud83d\\udd4d',\n 'syringe':'\\ud83d\\udc89',\n 'taco':'\\ud83c\\udf2e',\n 'tada':'\\ud83c\\udf89',\n 'tanabata_tree':'\\ud83c\\udf8b',\n 'taurus':'\\u2649\\ufe0f',\n 'taxi':'\\ud83d\\ude95',\n 'tea':'\\ud83c\\udf75',\n 'telephone_receiver':'\\ud83d\\udcde',\n 'telescope':'\\ud83d\\udd2d',\n 'tennis':'\\ud83c\\udfbe',\n 'tent':'\\u26fa\\ufe0f',\n 'thermometer':'\\ud83c\\udf21',\n 'thinking':'\\ud83e\\udd14',\n 'thought_balloon':'\\ud83d\\udcad',\n 'ticket':'\\ud83c\\udfab',\n 'tickets':'\\ud83c\\udf9f',\n 'tiger':'\\ud83d\\udc2f',\n 'tiger2':'\\ud83d\\udc05',\n 'timer_clock':'\\u23f2',\n 'tipping_hand_man':'\\ud83d\\udc81\\u2642\\ufe0f',\n 'tired_face':'\\ud83d\\ude2b',\n 'tm':'\\u2122\\ufe0f',\n 'toilet':'\\ud83d\\udebd',\n 'tokyo_tower':'\\ud83d\\uddfc',\n 'tomato':'\\ud83c\\udf45',\n 'tongue':'\\ud83d\\udc45',\n 'top':'\\ud83d\\udd1d',\n 'tophat':'\\ud83c\\udfa9',\n 'tornado':'\\ud83c\\udf2a',\n 'trackball':'\\ud83d\\uddb2',\n 'tractor':'\\ud83d\\ude9c',\n 'traffic_light':'\\ud83d\\udea5',\n 'train':'\\ud83d\\ude8b',\n 'train2':'\\ud83d\\ude86',\n 'tram':'\\ud83d\\ude8a',\n 'triangular_flag_on_post':'\\ud83d\\udea9',\n 'triangular_ruler':'\\ud83d\\udcd0',\n 'trident':'\\ud83d\\udd31',\n 'triumph':'\\ud83d\\ude24',\n 'trolleybus':'\\ud83d\\ude8e',\n 'trophy':'\\ud83c\\udfc6',\n 'tropical_drink':'\\ud83c\\udf79',\n 'tropical_fish':'\\ud83d\\udc20',\n 'truck':'\\ud83d\\ude9a',\n 'trumpet':'\\ud83c\\udfba',\n 'tulip':'\\ud83c\\udf37',\n 'tumbler_glass':'\\ud83e\\udd43',\n 'turkey':'\\ud83e\\udd83',\n 'turtle':'\\ud83d\\udc22',\n 'tv':'\\ud83d\\udcfa',\n 'twisted_rightwards_arrows':'\\ud83d\\udd00',\n 'two_hearts':'\\ud83d\\udc95',\n 'two_men_holding_hands':'\\ud83d\\udc6c',\n 'two_women_holding_hands':'\\ud83d\\udc6d',\n 'u5272':'\\ud83c\\ude39',\n 'u5408':'\\ud83c\\ude34',\n 'u55b6':'\\ud83c\\ude3a',\n 'u6307':'\\ud83c\\ude2f\\ufe0f',\n 'u6708':'\\ud83c\\ude37\\ufe0f',\n 'u6709':'\\ud83c\\ude36',\n 'u6e80':'\\ud83c\\ude35',\n 'u7121':'\\ud83c\\ude1a\\ufe0f',\n 'u7533':'\\ud83c\\ude38',\n 'u7981':'\\ud83c\\ude32',\n 'u7a7a':'\\ud83c\\ude33',\n 'umbrella':'\\u2614\\ufe0f',\n 'unamused':'\\ud83d\\ude12',\n 'underage':'\\ud83d\\udd1e',\n 'unicorn':'\\ud83e\\udd84',\n 'unlock':'\\ud83d\\udd13',\n 'up':'\\ud83c\\udd99',\n 'upside_down_face':'\\ud83d\\ude43',\n 'v':'\\u270c\\ufe0f',\n 'vertical_traffic_light':'\\ud83d\\udea6',\n 'vhs':'\\ud83d\\udcfc',\n 'vibration_mode':'\\ud83d\\udcf3',\n 'video_camera':'\\ud83d\\udcf9',\n 'video_game':'\\ud83c\\udfae',\n 'violin':'\\ud83c\\udfbb',\n 'virgo':'\\u264d\\ufe0f',\n 'volcano':'\\ud83c\\udf0b',\n 'volleyball':'\\ud83c\\udfd0',\n 'vs':'\\ud83c\\udd9a',\n 'vulcan_salute':'\\ud83d\\udd96',\n 'walking_man':'\\ud83d\\udeb6',\n 'walking_woman':'\\ud83d\\udeb6\\u2640\\ufe0f',\n 'waning_crescent_moon':'\\ud83c\\udf18',\n 'waning_gibbous_moon':'\\ud83c\\udf16',\n 'warning':'\\u26a0\\ufe0f',\n 'wastebasket':'\\ud83d\\uddd1',\n 'watch':'\\u231a\\ufe0f',\n 'water_buffalo':'\\ud83d\\udc03',\n 'watermelon':'\\ud83c\\udf49',\n 'wave':'\\ud83d\\udc4b',\n 'wavy_dash':'\\u3030\\ufe0f',\n 'waxing_crescent_moon':'\\ud83c\\udf12',\n 'wc':'\\ud83d\\udebe',\n 'weary':'\\ud83d\\ude29',\n 'wedding':'\\ud83d\\udc92',\n 'weight_lifting_man':'\\ud83c\\udfcb\\ufe0f',\n 'weight_lifting_woman':'\\ud83c\\udfcb\\ufe0f\\u2640\\ufe0f',\n 'whale':'\\ud83d\\udc33',\n 'whale2':'\\ud83d\\udc0b',\n 'wheel_of_dharma':'\\u2638\\ufe0f',\n 'wheelchair':'\\u267f\\ufe0f',\n 'white_check_mark':'\\u2705',\n 'white_circle':'\\u26aa\\ufe0f',\n 'white_flag':'\\ud83c\\udff3\\ufe0f',\n 'white_flower':'\\ud83d\\udcae',\n 'white_large_square':'\\u2b1c\\ufe0f',\n 'white_medium_small_square':'\\u25fd\\ufe0f',\n 'white_medium_square':'\\u25fb\\ufe0f',\n 'white_small_square':'\\u25ab\\ufe0f',\n 'white_square_button':'\\ud83d\\udd33',\n 'wilted_flower':'\\ud83e\\udd40',\n 'wind_chime':'\\ud83c\\udf90',\n 'wind_face':'\\ud83c\\udf2c',\n 'wine_glass':'\\ud83c\\udf77',\n 'wink':'\\ud83d\\ude09',\n 'wolf':'\\ud83d\\udc3a',\n 'woman':'\\ud83d\\udc69',\n 'woman_artist':'\\ud83d\\udc69\\ud83c\\udfa8',\n 'woman_astronaut':'\\ud83d\\udc69\\ud83d\\ude80',\n 'woman_cartwheeling':'\\ud83e\\udd38\\u2640\\ufe0f',\n 'woman_cook':'\\ud83d\\udc69\\ud83c\\udf73',\n 'woman_facepalming':'\\ud83e\\udd26\\u2640\\ufe0f',\n 'woman_factory_worker':'\\ud83d\\udc69\\ud83c\\udfed',\n 'woman_farmer':'\\ud83d\\udc69\\ud83c\\udf3e',\n 'woman_firefighter':'\\ud83d\\udc69\\ud83d\\ude92',\n 'woman_health_worker':'\\ud83d\\udc69\\u2695\\ufe0f',\n 'woman_judge':'\\ud83d\\udc69\\u2696\\ufe0f',\n 'woman_juggling':'\\ud83e\\udd39\\u2640\\ufe0f',\n 'woman_mechanic':'\\ud83d\\udc69\\ud83d\\udd27',\n 'woman_office_worker':'\\ud83d\\udc69\\ud83d\\udcbc',\n 'woman_pilot':'\\ud83d\\udc69\\u2708\\ufe0f',\n 'woman_playing_handball':'\\ud83e\\udd3e\\u2640\\ufe0f',\n 'woman_playing_water_polo':'\\ud83e\\udd3d\\u2640\\ufe0f',\n 'woman_scientist':'\\ud83d\\udc69\\ud83d\\udd2c',\n 'woman_shrugging':'\\ud83e\\udd37\\u2640\\ufe0f',\n 'woman_singer':'\\ud83d\\udc69\\ud83c\\udfa4',\n 'woman_student':'\\ud83d\\udc69\\ud83c\\udf93',\n 'woman_teacher':'\\ud83d\\udc69\\ud83c\\udfeb',\n 'woman_technologist':'\\ud83d\\udc69\\ud83d\\udcbb',\n 'woman_with_turban':'\\ud83d\\udc73\\u2640\\ufe0f',\n 'womans_clothes':'\\ud83d\\udc5a',\n 'womans_hat':'\\ud83d\\udc52',\n 'women_wrestling':'\\ud83e\\udd3c\\u2640\\ufe0f',\n 'womens':'\\ud83d\\udeba',\n 'world_map':'\\ud83d\\uddfa',\n 'worried':'\\ud83d\\ude1f',\n 'wrench':'\\ud83d\\udd27',\n 'writing_hand':'\\u270d\\ufe0f',\n 'x':'\\u274c',\n 'yellow_heart':'\\ud83d\\udc9b',\n 'yen':'\\ud83d\\udcb4',\n 'yin_yang':'\\u262f\\ufe0f',\n 'yum':'\\ud83d\\ude0b',\n 'zap':'\\u26a1\\ufe0f',\n 'zipper_mouth_face':'\\ud83e\\udd10',\n 'zzz':'\\ud83d\\udca4',\n\n /* special emojis :P */\n 'octocat': '',\n 'showdown': 'S'\n};\n\r\n/**\n * Created by Estevao on 31-05-2015.\n */\n\n/**\n * Showdown Converter class\n * @class\n * @param {object} [converterOptions]\n * @returns {Converter}\n */\nshowdown.Converter = function (converterOptions) {\n 'use strict';\n\n var\n /**\n * Options used by this converter\n * @private\n * @type {{}}\n */\n options = {},\n\n /**\n * Language extensions used by this converter\n * @private\n * @type {Array}\n */\n langExtensions = [],\n\n /**\n * Output modifiers extensions used by this converter\n * @private\n * @type {Array}\n */\n outputModifiers = [],\n\n /**\n * Event listeners\n * @private\n * @type {{}}\n */\n listeners = {},\n\n /**\n * The flavor set in this converter\n */\n setConvFlavor = setFlavor,\n\n /**\n * Metadata of the document\n * @type {{parsed: {}, raw: string, format: string}}\n */\n metadata = {\n parsed: {},\n raw: '',\n format: ''\n };\n\n _constructor();\n\n /**\n * Converter constructor\n * @private\n */\n function _constructor () {\n converterOptions = converterOptions || {};\n\n for (var gOpt in globalOptions) {\n if (globalOptions.hasOwnProperty(gOpt)) {\n options[gOpt] = globalOptions[gOpt];\n }\n }\n\n // Merge options\n if (typeof converterOptions === 'object') {\n for (var opt in converterOptions) {\n if (converterOptions.hasOwnProperty(opt)) {\n options[opt] = converterOptions[opt];\n }\n }\n } else {\n throw Error('Converter expects the passed parameter to be an object, but ' + typeof converterOptions +\n ' was passed instead.');\n }\n\n if (options.extensions) {\n showdown.helper.forEach(options.extensions, _parseExtension);\n }\n }\n\n /**\n * Parse extension\n * @param {*} ext\n * @param {string} [name='']\n * @private\n */\n function _parseExtension (ext, name) {\n\n name = name || null;\n // If it's a string, the extension was previously loaded\n if (showdown.helper.isString(ext)) {\n ext = showdown.helper.stdExtName(ext);\n name = ext;\n\n // LEGACY_SUPPORT CODE\n if (showdown.extensions[ext]) {\n console.warn('DEPRECATION WARNING: ' + ext + ' is an old extension that uses a deprecated loading method.' +\n 'Please inform the developer that the extension should be updated!');\n legacyExtensionLoading(showdown.extensions[ext], ext);\n return;\n // END LEGACY SUPPORT CODE\n\n } else if (!showdown.helper.isUndefined(extensions[ext])) {\n ext = extensions[ext];\n\n } else {\n throw Error('Extension \"' + ext + '\" could not be loaded. It was either not found or is not a valid extension.');\n }\n }\n\n if (typeof ext === 'function') {\n ext = ext();\n }\n\n if (!showdown.helper.isArray(ext)) {\n ext = [ext];\n }\n\n var validExt = validate(ext, name);\n if (!validExt.valid) {\n throw Error(validExt.error);\n }\n\n for (var i = 0; i < ext.length; ++i) {\n switch (ext[i].type) {\n\n case 'lang':\n langExtensions.push(ext[i]);\n break;\n\n case 'output':\n outputModifiers.push(ext[i]);\n break;\n }\n if (ext[i].hasOwnProperty('listeners')) {\n for (var ln in ext[i].listeners) {\n if (ext[i].listeners.hasOwnProperty(ln)) {\n listen(ln, ext[i].listeners[ln]);\n }\n }\n }\n }\n\n }\n\n /**\n * LEGACY_SUPPORT\n * @param {*} ext\n * @param {string} name\n */\n function legacyExtensionLoading (ext, name) {\n if (typeof ext === 'function') {\n ext = ext(new showdown.Converter());\n }\n if (!showdown.helper.isArray(ext)) {\n ext = [ext];\n }\n var valid = validate(ext, name);\n\n if (!valid.valid) {\n throw Error(valid.error);\n }\n\n for (var i = 0; i < ext.length; ++i) {\n switch (ext[i].type) {\n case 'lang':\n langExtensions.push(ext[i]);\n break;\n case 'output':\n outputModifiers.push(ext[i]);\n break;\n default:// should never reach here\n throw Error('Extension loader error: Type unrecognized!!!');\n }\n }\n }\n\n /**\n * Listen to an event\n * @param {string} name\n * @param {function} callback\n */\n function listen (name, callback) {\n if (!showdown.helper.isString(name)) {\n throw Error('Invalid argument in converter.listen() method: name must be a string, but ' + typeof name + ' given');\n }\n\n if (typeof callback !== 'function') {\n throw Error('Invalid argument in converter.listen() method: callback must be a function, but ' + typeof callback + ' given');\n }\n\n if (!listeners.hasOwnProperty(name)) {\n listeners[name] = [];\n }\n listeners[name].push(callback);\n }\n\n function rTrimInputText (text) {\n var rsp = text.match(/^\\s*/)[0].length,\n rgx = new RegExp('^\\\\s{0,' + rsp + '}', 'gm');\n return text.replace(rgx, '');\n }\n\n /**\n * Dispatch an event\n * @private\n * @param {string} evtName Event name\n * @param {string} text Text\n * @param {{}} options Converter Options\n * @param {{}} globals\n * @returns {string}\n */\n this._dispatch = function dispatch (evtName, text, options, globals) {\n if (listeners.hasOwnProperty(evtName)) {\n for (var ei = 0; ei < listeners[evtName].length; ++ei) {\n var nText = listeners[evtName][ei](evtName, text, this, options, globals);\n if (nText && typeof nText !== 'undefined') {\n text = nText;\n }\n }\n }\n return text;\n };\n\n /**\n * Listen to an event\n * @param {string} name\n * @param {function} callback\n * @returns {showdown.Converter}\n */\n this.listen = function (name, callback) {\n listen(name, callback);\n return this;\n };\n\n /**\n * Converts a markdown string into HTML\n * @param {string} text\n * @returns {*}\n */\n this.makeHtml = function (text) {\n //check if text is not falsy\n if (!text) {\n return text;\n }\n\n var globals = {\n gHtmlBlocks: [],\n gHtmlMdBlocks: [],\n gHtmlSpans: [],\n gUrls: {},\n gTitles: {},\n gDimensions: {},\n gListLevel: 0,\n hashLinkCounts: {},\n langExtensions: langExtensions,\n outputModifiers: outputModifiers,\n converter: this,\n ghCodeBlocks: [],\n metadata: {\n parsed: {},\n raw: '',\n format: ''\n }\n };\n\n // This lets us use ¨ trema as an escape char to avoid md5 hashes\n // The choice of character is arbitrary; anything that isn't\n // magic in Markdown will work.\n text = text.replace(/¨/g, '¨T');\n\n // Replace $ with ¨D\n // RegExp interprets $ as a special character\n // when it's in a replacement string\n text = text.replace(/\\$/g, '¨D');\n\n // Standardize line endings\n text = text.replace(/\\r\\n/g, '\\n'); // DOS to Unix\n text = text.replace(/\\r/g, '\\n'); // Mac to Unix\n\n // Stardardize line spaces\n text = text.replace(/\\u00A0/g, ' ');\n\n if (options.smartIndentationFix) {\n text = rTrimInputText(text);\n }\n\n // Make sure text begins and ends with a couple of newlines:\n text = '\\n\\n' + text + '\\n\\n';\n\n // detab\n text = showdown.subParser('detab')(text, options, globals);\n\n /**\n * Strip any lines consisting only of spaces and tabs.\n * This makes subsequent regexs easier to write, because we can\n * match consecutive blank lines with /\\n+/ instead of something\n * contorted like /[ \\t]*\\n+/\n */\n text = text.replace(/^[ \\t]+$/mg, '');\n\n //run languageExtensions\n showdown.helper.forEach(langExtensions, function (ext) {\n text = showdown.subParser('runExtension')(ext, text, options, globals);\n });\n\n // run the sub parsers\n text = showdown.subParser('metadata')(text, options, globals);\n text = showdown.subParser('hashPreCodeTags')(text, options, globals);\n text = showdown.subParser('githubCodeBlocks')(text, options, globals);\n text = showdown.subParser('hashHTMLBlocks')(text, options, globals);\n text = showdown.subParser('hashCodeTags')(text, options, globals);\n text = showdown.subParser('stripLinkDefinitions')(text, options, globals);\n text = showdown.subParser('blockGamut')(text, options, globals);\n text = showdown.subParser('unhashHTMLSpans')(text, options, globals);\n text = showdown.subParser('unescapeSpecialChars')(text, options, globals);\n\n // attacklab: Restore dollar signs\n text = text.replace(/¨D/g, '$$');\n\n // attacklab: Restore tremas\n text = text.replace(/¨T/g, '¨');\n\n // render a complete html document instead of a partial if the option is enabled\n text = showdown.subParser('completeHTMLDocument')(text, options, globals);\n\n // Run output modifiers\n showdown.helper.forEach(outputModifiers, function (ext) {\n text = showdown.subParser('runExtension')(ext, text, options, globals);\n });\n\n // update metadata\n metadata = globals.metadata;\n return text;\n };\n\n /**\n * Converts an HTML string into a markdown string\n * @param src\n * @param [HTMLParser] A WHATWG DOM and HTML parser, such as JSDOM. If none is supplied, window.document will be used.\n * @returns {string}\n */\n this.makeMarkdown = this.makeMd = function (src, HTMLParser) {\n\n // replace \\r\\n with \\n\n src = src.replace(/\\r\\n/g, '\\n');\n src = src.replace(/\\r/g, '\\n'); // old macs\n\n // due to an edge case, we need to find this: > <\n // to prevent removing of non silent white spaces\n // ex: this is sparta\n src = src.replace(/>[ \\t]+¨NBSP;<');\n\n if (!HTMLParser) {\n if (window && window.document) {\n HTMLParser = window.document;\n } else {\n throw new Error('HTMLParser is undefined. If in a webworker or nodejs environment, you need to provide a WHATWG DOM and HTML such as JSDOM');\n }\n }\n\n var doc = HTMLParser.createElement('div');\n doc.innerHTML = src;\n\n var globals = {\n preList: substitutePreCodeTags(doc)\n };\n\n // remove all newlines and collapse spaces\n clean(doc);\n\n // some stuff, like accidental reference links must now be escaped\n // TODO\n // doc.innerHTML = doc.innerHTML.replace(/\\[[\\S\\t ]]/);\n\n var nodes = doc.childNodes,\n mdDoc = '';\n\n for (var i = 0; i < nodes.length; i++) {\n mdDoc += showdown.subParser('makeMarkdown.node')(nodes[i], globals);\n }\n\n function clean (node) {\n for (var n = 0; n < node.childNodes.length; ++n) {\n var child = node.childNodes[n];\n if (child.nodeType === 3) {\n if (!/\\S/.test(child.nodeValue)) {\n node.removeChild(child);\n --n;\n } else {\n child.nodeValue = child.nodeValue.split('\\n').join(' ');\n child.nodeValue = child.nodeValue.replace(/(\\s)+/g, '$1');\n }\n } else if (child.nodeType === 1) {\n clean(child);\n }\n }\n }\n\n // find all pre tags and replace contents with placeholder\n // we need this so that we can remove all indentation from html\n // to ease up parsing\n function substitutePreCodeTags (doc) {\n\n var pres = doc.querySelectorAll('pre'),\n presPH = [];\n\n for (var i = 0; i < pres.length; ++i) {\n\n if (pres[i].childElementCount === 1 && pres[i].firstChild.tagName.toLowerCase() === 'code') {\n var content = pres[i].firstChild.innerHTML.trim(),\n language = pres[i].firstChild.getAttribute('data-language') || '';\n\n // if data-language attribute is not defined, then we look for class language-*\n if (language === '') {\n var classes = pres[i].firstChild.className.split(' ');\n for (var c = 0; c < classes.length; ++c) {\n var matches = classes[c].match(/^language-(.+)$/);\n if (matches !== null) {\n language = matches[1];\n break;\n }\n }\n }\n\n // unescape html entities in content\n content = showdown.helper.unescapeHTMLEntities(content);\n\n presPH.push(content);\n pres[i].outerHTML = ' tags around block-level tags.\n text = showdown.subParser('hashHTMLBlocks')(text, options, globals);\n text = showdown.subParser('paragraphs')(text, options, globals);\n\n text = globals.converter._dispatch('blockGamut.after', text, options, globals);\n\n return text;\n});\n\r\nshowdown.subParser('blockQuotes', function (text, options, globals) {\n 'use strict';\n\n text = globals.converter._dispatch('blockQuotes.before', text, options, globals);\n\n // add a couple extra lines after the text and endtext mark\n text = text + '\\n\\n';\n\n var rgx = /(^ {0,3}>[ \\t]?.+\\n(.+\\n)*\\n*)+/gm;\n\n if (options.splitAdjacentBlockquotes) {\n rgx = /^ {0,3}>[\\s\\S]*?(?:\\n\\n)/gm;\n }\n\n text = text.replace(rgx, function (bq) {\n // attacklab: hack around Konqueror 3.5.4 bug:\n // \"----------bug\".replace(/^-/g,\"\") == \"bug\"\n bq = bq.replace(/^[ \\t]*>[ \\t]?/gm, ''); // trim one level of quoting\n\n // attacklab: clean up hack\n bq = bq.replace(/¨0/g, '');\n\n bq = bq.replace(/^[ \\t]+$/gm, ''); // trim whitespace-only lines\n bq = showdown.subParser('githubCodeBlocks')(bq, options, globals);\n bq = showdown.subParser('blockGamut')(bq, options, globals); // recurse\n\n bq = bq.replace(/(^|\\n)/g, '$1 ');\n // These leading spaces screw with
content, so we need to fix that:\n bq = bq.replace(/(\\s*[^\\r]+?<\\/pre>)/gm, function (wholeMatch, m1) {\n var pre = m1;\n // attacklab: hack around Konqueror 3.5.4 bug:\n pre = pre.replace(/^ /mg, '¨0');\n pre = pre.replace(/¨0/g, '');\n return pre;\n });\n\n return showdown.subParser('hashBlock')('\\n' + bq + '\\n
', options, globals);\n });\n\n text = globals.converter._dispatch('blockQuotes.after', text, options, globals);\n return text;\n});\n\r\n/**\n * Process Markdown `` blocks.\n */\nshowdown.subParser('codeBlocks', function (text, options, globals) {\n 'use strict';\n\n text = globals.converter._dispatch('codeBlocks.before', text, options, globals);\n\n // sentinel workarounds for lack of \\A and \\Z, safari\\khtml bug\n text += '¨0';\n\n var pattern = /(?:\\n\\n|^)((?:(?:[ ]{4}|\\t).*\\n+)+)(\\n*[ ]{0,3}[^ \\t\\n]|(?=¨0))/g;\n text = text.replace(pattern, function (wholeMatch, m1, m2) {\n var codeblock = m1,\n nextChar = m2,\n end = '\\n';\n\n codeblock = showdown.subParser('outdent')(codeblock, options, globals);\n codeblock = showdown.subParser('encodeCode')(codeblock, options, globals);\n codeblock = showdown.subParser('detab')(codeblock, options, globals);\n codeblock = codeblock.replace(/^\\n+/g, ''); // trim leading newlines\n codeblock = codeblock.replace(/\\n+$/g, ''); // trim trailing newlines\n\n if (options.omitExtraWLInCodeBlocks) {\n end = '';\n }\n\n codeblock = '' + codeblock + end + '
';\n\n return showdown.subParser('hashBlock')(codeblock, options, globals) + nextChar;\n });\n\n // strip sentinel\n text = text.replace(/¨0/, '');\n\n text = globals.converter._dispatch('codeBlocks.after', text, options, globals);\n return text;\n});\n\r\n/**\n *\n * * Backtick quotes are used for Just type foo `bar` baz at the prompt.
\n *\n * There's no arbitrary limit to the number of backticks you\n * can use as delimters. If you need three consecutive backticks\n * in your code, use four for delimiters, etc.\n *\n * * You can use spaces to get literal backticks at the edges:\n *\n * ... type `` `bar` `` ...\n *\n * Turns to:\n *\n * ... type `bar` ...\n */\nshowdown.subParser('codeSpans', function (text, options, globals) {\n 'use strict';\n\n text = globals.converter._dispatch('codeSpans.before', text, options, globals);\n\n if (typeof text === 'undefined') {\n text = '';\n }\n text = text.replace(/(^|[^\\\\])(`+)([^\\r]*?[^`])\\2(?!`)/gm,\n function (wholeMatch, m1, m2, m3) {\n var c = m3;\n c = c.replace(/^([ \\t]*)/g, '');\t// leading whitespace\n c = c.replace(/[ \\t]*$/g, '');\t// trailing whitespace\n c = showdown.subParser('encodeCode')(c, options, globals);\n c = m1 + '' + c + '';\n c = showdown.subParser('hashHTMLSpans')(c, options, globals);\n return c;\n }\n );\n\n text = globals.converter._dispatch('codeSpans.after', text, options, globals);\n return text;\n});\n\r\n/**\n * Create a full HTML document from the processed markdown\n */\nshowdown.subParser('completeHTMLDocument', function (text, options, globals) {\n 'use strict';\n\n if (!options.completeHTMLDocument) {\n return text;\n }\n\n text = globals.converter._dispatch('completeHTMLDocument.before', text, options, globals);\n\n var doctype = 'html',\n doctypeParsed = '\\n',\n title = '',\n charset = '\\n',\n lang = '',\n metadata = '';\n\n if (typeof globals.metadata.parsed.doctype !== 'undefined') {\n doctypeParsed = '\\n';\n doctype = globals.metadata.parsed.doctype.toString().toLowerCase();\n if (doctype === 'html' || doctype === 'html5') {\n charset = '';\n }\n }\n\n for (var meta in globals.metadata.parsed) {\n if (globals.metadata.parsed.hasOwnProperty(meta)) {\n switch (meta.toLowerCase()) {\n case 'doctype':\n break;\n\n case 'title':\n title = '' + globals.metadata.parsed.title + ' \\n';\n break;\n\n case 'charset':\n if (doctype === 'html' || doctype === 'html5') {\n charset = '\\n';\n } else {\n charset = '\\n';\n }\n break;\n\n case 'language':\n case 'lang':\n lang = ' lang=\"' + globals.metadata.parsed[meta] + '\"';\n metadata += '\\n';\n break;\n\n default:\n metadata += '\\n';\n }\n }\n }\n\n text = doctypeParsed + '\\n\\n' + title + charset + metadata + '\\n\\n' + text.trim() + '\\n\\n';\n\n text = globals.converter._dispatch('completeHTMLDocument.after', text, options, globals);\n return text;\n});\n\r\n/**\n * Convert all tabs to spaces\n */\nshowdown.subParser('detab', function (text, options, globals) {\n 'use strict';\n text = globals.converter._dispatch('detab.before', text, options, globals);\n\n // expand first n-1 tabs\n text = text.replace(/\\t(?=\\t)/g, ' '); // g_tab_width\n\n // replace the nth with two sentinels\n text = text.replace(/\\t/g, '¨A¨B');\n\n // use the sentinel to anchor our regex so it doesn't explode\n text = text.replace(/¨B(.+?)¨A/g, function (wholeMatch, m1) {\n var leadingText = m1,\n numSpaces = 4 - leadingText.length % 4; // g_tab_width\n\n // there *must* be a better way to do this:\n for (var i = 0; i < numSpaces; i++) {\n leadingText += ' ';\n }\n\n return leadingText;\n });\n\n // clean up sentinels\n text = text.replace(/¨A/g, ' '); // g_tab_width\n text = text.replace(/¨B/g, '');\n\n text = globals.converter._dispatch('detab.after', text, options, globals);\n return text;\n});\n\r\nshowdown.subParser('ellipsis', function (text, options, globals) {\n 'use strict';\n\n text = globals.converter._dispatch('ellipsis.before', text, options, globals);\n\n text = text.replace(/\\.\\.\\./g, '…');\n\n text = globals.converter._dispatch('ellipsis.after', text, options, globals);\n\n return text;\n});\n\r\n/**\n * Turn emoji codes into emojis\n *\n * List of supported emojis: https://github.com/showdownjs/showdown/wiki/Emojis\n */\nshowdown.subParser('emoji', function (text, options, globals) {\n 'use strict';\n\n if (!options.emoji) {\n return text;\n }\n\n text = globals.converter._dispatch('emoji.before', text, options, globals);\n\n var emojiRgx = /:([\\S]+?):/g;\n\n text = text.replace(emojiRgx, function (wm, emojiCode) {\n if (showdown.helper.emojis.hasOwnProperty(emojiCode)) {\n return showdown.helper.emojis[emojiCode];\n }\n return wm;\n });\n\n text = globals.converter._dispatch('emoji.after', text, options, globals);\n\n return text;\n});\n\r\n/**\n * Smart processing for ampersands and angle brackets that need to be encoded.\n */\nshowdown.subParser('encodeAmpsAndAngles', function (text, options, globals) {\n 'use strict';\n text = globals.converter._dispatch('encodeAmpsAndAngles.before', text, options, globals);\n\n // Ampersand-encoding based entirely on Nat Irons's Amputator MT plugin:\n // http://bumppo.net/projects/amputator/\n text = text.replace(/&(?!#?[xX]?(?:[0-9a-fA-F]+|\\w+);)/g, '&');\n\n // Encode naked <'s\n text = text.replace(/<(?![a-z\\/?$!])/gi, '<');\n\n // Encode <\n text = text.replace(/\n text = text.replace(/>/g, '>');\n\n text = globals.converter._dispatch('encodeAmpsAndAngles.after', text, options, globals);\n return text;\n});\n\r\n/**\n * Returns the string, with after processing the following backslash escape sequences.\n *\n * attacklab: The polite way to do this is with the new escapeCharacters() function:\n *\n * text = escapeCharacters(text,\"\\\\\",true);\n * text = escapeCharacters(text,\"`*_{}[]()>#+-.!\",true);\n *\n * ...but we're sidestepping its use of the (slow) RegExp constructor\n * as an optimization for Firefox. This function gets called a LOT.\n */\nshowdown.subParser('encodeBackslashEscapes', function (text, options, globals) {\n 'use strict';\n text = globals.converter._dispatch('encodeBackslashEscapes.before', text, options, globals);\n\n text = text.replace(/\\\\(\\\\)/g, showdown.helper.escapeCharactersCallback);\n text = text.replace(/\\\\([`*_{}\\[\\]()>#+.!~=|-])/g, showdown.helper.escapeCharactersCallback);\n\n text = globals.converter._dispatch('encodeBackslashEscapes.after', text, options, globals);\n return text;\n});\n\r\n/**\n * Encode/escape certain characters inside Markdown code runs.\n * The point is that in code, these characters are literals,\n * and lose their special Markdown meanings.\n */\nshowdown.subParser('encodeCode', function (text, options, globals) {\n 'use strict';\n\n text = globals.converter._dispatch('encodeCode.before', text, options, globals);\n\n // Encode all ampersands; HTML entities are not\n // entities within a Markdown code span.\n text = text\n .replace(/&/g, '&')\n // Do the angle bracket song and dance:\n .replace(//g, '>')\n // Now, escape characters that are magic in Markdown:\n .replace(/([*_{}\\[\\]\\\\=~-])/g, showdown.helper.escapeCharactersCallback);\n\n text = globals.converter._dispatch('encodeCode.after', text, options, globals);\n return text;\n});\n\r\n/**\n * Within tags -- meaning between < and > -- encode [\\ ` * _ ~ =] so they\n * don't conflict with their use in Markdown for code, italics and strong.\n */\nshowdown.subParser('escapeSpecialCharsWithinTagAttributes', function (text, options, globals) {\n 'use strict';\n text = globals.converter._dispatch('escapeSpecialCharsWithinTagAttributes.before', text, options, globals);\n\n // Build a regex to find HTML tags.\n var tags = /<\\/?[a-z\\d_:-]+(?:[\\s]+[\\s\\S]+?)?>/gi,\n comments = /-]|-[^>])(?:[^-]|-[^-])*)--)>/gi;\n\n text = text.replace(tags, function (wholeMatch) {\n return wholeMatch\n .replace(/(.)<\\/?code>(?=.)/g, '$1`')\n .replace(/([\\\\`*_~=|])/g, showdown.helper.escapeCharactersCallback);\n });\n\n text = text.replace(comments, function (wholeMatch) {\n return wholeMatch\n .replace(/([\\\\`*_~=|])/g, showdown.helper.escapeCharactersCallback);\n });\n\n text = globals.converter._dispatch('escapeSpecialCharsWithinTagAttributes.after', text, options, globals);\n return text;\n});\n\r\n/**\n * Handle github codeblocks prior to running HashHTML so that\n * HTML contained within the codeblock gets escaped properly\n * Example:\n * ```ruby\n * def hello_world(x)\n * puts \"Hello, #{x}\"\n * end\n * ```\n */\nshowdown.subParser('githubCodeBlocks', function (text, options, globals) {\n 'use strict';\n\n // early exit if option is not enabled\n if (!options.ghCodeBlocks) {\n return text;\n }\n\n text = globals.converter._dispatch('githubCodeBlocks.before', text, options, globals);\n\n text += '¨0';\n\n text = text.replace(/(?:^|\\n)(?: {0,3})(```+|~~~+)(?: *)([^\\s`~]*)\\n([\\s\\S]*?)\\n(?: {0,3})\\1/g, function (wholeMatch, delim, language, codeblock) {\n var end = (options.omitExtraWLInCodeBlocks) ? '' : '\\n';\n\n // First parse the github code block\n codeblock = showdown.subParser('encodeCode')(codeblock, options, globals);\n codeblock = showdown.subParser('detab')(codeblock, options, globals);\n codeblock = codeblock.replace(/^\\n+/g, ''); // trim leading newlines\n codeblock = codeblock.replace(/\\n+$/g, ''); // trim trailing whitespace\n\n codeblock = '' + codeblock + end + '
';\n\n codeblock = showdown.subParser('hashBlock')(codeblock, options, globals);\n\n // Since GHCodeblocks can be false positives, we need to\n // store the primitive text and the parsed text in a global var,\n // and then return a token\n return '\\n\\n¨G' + (globals.ghCodeBlocks.push({text: wholeMatch, codeblock: codeblock}) - 1) + 'G\\n\\n';\n });\n\n // attacklab: strip sentinel\n text = text.replace(/¨0/, '');\n\n return globals.converter._dispatch('githubCodeBlocks.after', text, options, globals);\n});\n\r\nshowdown.subParser('hashBlock', function (text, options, globals) {\n 'use strict';\n text = globals.converter._dispatch('hashBlock.before', text, options, globals);\n text = text.replace(/(^\\n+|\\n+$)/g, '');\n text = '\\n\\n¨K' + (globals.gHtmlBlocks.push(text) - 1) + 'K\\n\\n';\n text = globals.converter._dispatch('hashBlock.after', text, options, globals);\n return text;\n});\n\r\n/**\n * Hash and escape elements that should not be parsed as markdown\n */\nshowdown.subParser('hashCodeTags', function (text, options, globals) {\n 'use strict';\n text = globals.converter._dispatch('hashCodeTags.before', text, options, globals);\n\n var repFunc = function (wholeMatch, match, left, right) {\n var codeblock = left + showdown.subParser('encodeCode')(match, options, globals) + right;\n return '¨C' + (globals.gHtmlSpans.push(codeblock) - 1) + 'C';\n };\n\n // Hash naked \n text = showdown.helper.replaceRecursiveRegExp(text, repFunc, ']*>', ' ', 'gim');\n\n text = globals.converter._dispatch('hashCodeTags.after', text, options, globals);\n return text;\n});\n\r\nshowdown.subParser('hashElement', function (text, options, globals) {\n 'use strict';\n\n return function (wholeMatch, m1) {\n var blockText = m1;\n\n // Undo double lines\n blockText = blockText.replace(/\\n\\n/g, '\\n');\n blockText = blockText.replace(/^\\n/, '');\n\n // strip trailing blank lines\n blockText = blockText.replace(/\\n+$/g, '');\n\n // Replace the element text with a marker (\"¨KxK\" where x is its key)\n blockText = '\\n\\n¨K' + (globals.gHtmlBlocks.push(blockText) - 1) + 'K\\n\\n';\n\n return blockText;\n };\n});\n\r\nshowdown.subParser('hashHTMLBlocks', function (text, options, globals) {\n 'use strict';\n text = globals.converter._dispatch('hashHTMLBlocks.before', text, options, globals);\n\n var blockTags = [\n 'pre',\n 'div',\n 'h1',\n 'h2',\n 'h3',\n 'h4',\n 'h5',\n 'h6',\n 'blockquote',\n 'table',\n 'dl',\n 'ol',\n 'ul',\n 'script',\n 'noscript',\n 'form',\n 'fieldset',\n 'iframe',\n 'math',\n 'style',\n 'section',\n 'header',\n 'footer',\n 'nav',\n 'article',\n 'aside',\n 'address',\n 'audio',\n 'canvas',\n 'figure',\n 'hgroup',\n 'output',\n 'video',\n 'p'\n ],\n repFunc = function (wholeMatch, match, left, right) {\n var txt = wholeMatch;\n // check if this html element is marked as markdown\n // if so, it's contents should be parsed as markdown\n if (left.search(/\\bmarkdown\\b/) !== -1) {\n txt = left + globals.converter.makeHtml(match) + right;\n }\n return '\\n\\n¨K' + (globals.gHtmlBlocks.push(txt) - 1) + 'K\\n\\n';\n };\n\n if (options.backslashEscapesHTMLTags) {\n // encode backslash escaped HTML tags\n text = text.replace(/\\\\<(\\/?[^>]+?)>/g, function (wm, inside) {\n return '<' + inside + '>';\n });\n }\n\n // hash HTML Blocks\n for (var i = 0; i < blockTags.length; ++i) {\n\n var opTagPos,\n rgx1 = new RegExp('^ {0,3}(<' + blockTags[i] + '\\\\b[^>]*>)', 'im'),\n patLeft = '<' + blockTags[i] + '\\\\b[^>]*>',\n patRight = '';\n // 1. Look for the first position of the first opening HTML tag in the text\n while ((opTagPos = showdown.helper.regexIndexOf(text, rgx1)) !== -1) {\n\n // if the HTML tag is \\ escaped, we need to escape it and break\n\n\n //2. Split the text in that position\n var subTexts = showdown.helper.splitAtIndex(text, opTagPos),\n //3. Match recursively\n newSubText1 = showdown.helper.replaceRecursiveRegExp(subTexts[1], repFunc, patLeft, patRight, 'im');\n\n // prevent an infinite loop\n if (newSubText1 === subTexts[1]) {\n break;\n }\n text = subTexts[0].concat(newSubText1);\n }\n }\n // HR SPECIAL CASE\n text = text.replace(/(\\n {0,3}(<(hr)\\b([^<>])*?\\/?>)[ \\t]*(?=\\n{2,}))/g,\n showdown.subParser('hashElement')(text, options, globals));\n\n // Special case for standalone HTML comments\n text = showdown.helper.replaceRecursiveRegExp(text, function (txt) {\n return '\\n\\n¨K' + (globals.gHtmlBlocks.push(txt) - 1) + 'K\\n\\n';\n }, '^ {0,3}', 'gm');\n\n // PHP and ASP-style processor instructions ( and <%...%>)\n text = text.replace(/(?:\\n\\n)( {0,3}(?:<([?%])[^\\r]*?\\2>)[ \\t]*(?=\\n{2,}))/g,\n showdown.subParser('hashElement')(text, options, globals));\n\n text = globals.converter._dispatch('hashHTMLBlocks.after', text, options, globals);\n return text;\n});\n\r\n/**\n * Hash span elements that should not be parsed as markdown\n */\nshowdown.subParser('hashHTMLSpans', function (text, options, globals) {\n 'use strict';\n text = globals.converter._dispatch('hashHTMLSpans.before', text, options, globals);\n\n function hashHTMLSpan (html) {\n return '¨C' + (globals.gHtmlSpans.push(html) - 1) + 'C';\n }\n\n // Hash Self Closing tags\n text = text.replace(/<[^>]+?\\/>/gi, function (wm) {\n return hashHTMLSpan(wm);\n });\n\n // Hash tags without properties\n text = text.replace(/<([^>]+?)>[\\s\\S]*?<\\/\\1>/g, function (wm) {\n return hashHTMLSpan(wm);\n });\n\n // Hash tags with properties\n text = text.replace(/<([^>]+?)\\s[^>]+?>[\\s\\S]*?<\\/\\1>/g, function (wm) {\n return hashHTMLSpan(wm);\n });\n\n // Hash self closing tags without />\n text = text.replace(/<[^>]+?>/gi, function (wm) {\n return hashHTMLSpan(wm);\n });\n\n /*showdown.helper.matchRecursiveRegExp(text, ']*>', ' ', 'gi');*/\n\n text = globals.converter._dispatch('hashHTMLSpans.after', text, options, globals);\n return text;\n});\n\n/**\n * Unhash HTML spans\n */\nshowdown.subParser('unhashHTMLSpans', function (text, options, globals) {\n 'use strict';\n text = globals.converter._dispatch('unhashHTMLSpans.before', text, options, globals);\n\n for (var i = 0; i < globals.gHtmlSpans.length; ++i) {\n var repText = globals.gHtmlSpans[i],\n // limiter to prevent infinite loop (assume 10 as limit for recurse)\n limit = 0;\n\n while (/¨C(\\d+)C/.test(repText)) {\n var num = RegExp.$1;\n repText = repText.replace('¨C' + num + 'C', globals.gHtmlSpans[num]);\n if (limit === 10) {\n console.error('maximum nesting of 10 spans reached!!!');\n break;\n }\n ++limit;\n }\n text = text.replace('¨C' + i + 'C', repText);\n }\n\n text = globals.converter._dispatch('unhashHTMLSpans.after', text, options, globals);\n return text;\n});\n\r\n/**\n * Hash and escape elements that should not be parsed as markdown\n */\nshowdown.subParser('hashPreCodeTags', function (text, options, globals) {\n 'use strict';\n text = globals.converter._dispatch('hashPreCodeTags.before', text, options, globals);\n\n var repFunc = function (wholeMatch, match, left, right) {\n // encode html entities\n var codeblock = left + showdown.subParser('encodeCode')(match, options, globals) + right;\n return '\\n\\n¨G' + (globals.ghCodeBlocks.push({text: wholeMatch, codeblock: codeblock}) - 1) + 'G\\n\\n';\n };\n\n // Hash \n text = showdown.helper.replaceRecursiveRegExp(text, repFunc, '^ {0,3}]*>\\\\s*]*>', '^ {0,3} \\\\s*
', 'gim');\n\n text = globals.converter._dispatch('hashPreCodeTags.after', text, options, globals);\n return text;\n});\n\r\nshowdown.subParser('headers', function (text, options, globals) {\n 'use strict';\n\n text = globals.converter._dispatch('headers.before', text, options, globals);\n\n var headerLevelStart = (isNaN(parseInt(options.headerLevelStart))) ? 1 : parseInt(options.headerLevelStart),\n\n // Set text-style headers:\n //\tHeader 1\n //\t========\n //\n //\tHeader 2\n //\t--------\n //\n setextRegexH1 = (options.smoothLivePreview) ? /^(.+)[ \\t]*\\n={2,}[ \\t]*\\n+/gm : /^(.+)[ \\t]*\\n=+[ \\t]*\\n+/gm,\n setextRegexH2 = (options.smoothLivePreview) ? /^(.+)[ \\t]*\\n-{2,}[ \\t]*\\n+/gm : /^(.+)[ \\t]*\\n-+[ \\t]*\\n+/gm;\n\n text = text.replace(setextRegexH1, function (wholeMatch, m1) {\n\n var spanGamut = showdown.subParser('spanGamut')(m1, options, globals),\n hID = (options.noHeaderId) ? '' : ' id=\"' + headerId(m1) + '\"',\n hLevel = headerLevelStart,\n hashBlock = '' + spanGamut + ' ';\n return showdown.subParser('hashBlock')(hashBlock, options, globals);\n });\n\n text = text.replace(setextRegexH2, function (matchFound, m1) {\n var spanGamut = showdown.subParser('spanGamut')(m1, options, globals),\n hID = (options.noHeaderId) ? '' : ' id=\"' + headerId(m1) + '\"',\n hLevel = headerLevelStart + 1,\n hashBlock = '' + spanGamut + ' ';\n return showdown.subParser('hashBlock')(hashBlock, options, globals);\n });\n\n // atx-style headers:\n // # Header 1\n // ## Header 2\n // ## Header 2 with closing hashes ##\n // ...\n // ###### Header 6\n //\n var atxStyle = (options.requireSpaceBeforeHeadingText) ? /^(#{1,6})[ \\t]+(.+?)[ \\t]*#*\\n+/gm : /^(#{1,6})[ \\t]*(.+?)[ \\t]*#*\\n+/gm;\n\n text = text.replace(atxStyle, function (wholeMatch, m1, m2) {\n var hText = m2;\n if (options.customizedHeaderId) {\n hText = m2.replace(/\\s?\\{([^{]+?)}\\s*$/, '');\n }\n\n var span = showdown.subParser('spanGamut')(hText, options, globals),\n hID = (options.noHeaderId) ? '' : ' id=\"' + headerId(m2) + '\"',\n hLevel = headerLevelStart - 1 + m1.length,\n header = '' + span + ' ';\n\n return showdown.subParser('hashBlock')(header, options, globals);\n });\n\n function headerId (m) {\n var title,\n prefix;\n\n // It is separate from other options to allow combining prefix and customized\n if (options.customizedHeaderId) {\n var match = m.match(/\\{([^{]+?)}\\s*$/);\n if (match && match[1]) {\n m = match[1];\n }\n }\n\n title = m;\n\n // Prefix id to prevent causing inadvertent pre-existing style matches.\n if (showdown.helper.isString(options.prefixHeaderId)) {\n prefix = options.prefixHeaderId;\n } else if (options.prefixHeaderId === true) {\n prefix = 'section-';\n } else {\n prefix = '';\n }\n\n if (!options.rawPrefixHeaderId) {\n title = prefix + title;\n }\n\n if (options.ghCompatibleHeaderId) {\n title = title\n .replace(/ /g, '-')\n // replace previously escaped chars (&, ¨ and $)\n .replace(/&/g, '')\n .replace(/¨T/g, '')\n .replace(/¨D/g, '')\n // replace rest of the chars (&~$ are repeated as they might have been escaped)\n // borrowed from github's redcarpet (some they should produce similar results)\n .replace(/[&+$,\\/:;=?@\"#{}|^¨~\\[\\]`\\\\*)(%.!'<>]/g, '')\n .toLowerCase();\n } else if (options.rawHeaderId) {\n title = title\n .replace(/ /g, '-')\n // replace previously escaped chars (&, ¨ and $)\n .replace(/&/g, '&')\n .replace(/¨T/g, '¨')\n .replace(/¨D/g, '$')\n // replace \" and '\n .replace(/[\"']/g, '-')\n .toLowerCase();\n } else {\n title = title\n .replace(/[^\\w]/g, '')\n .toLowerCase();\n }\n\n if (options.rawPrefixHeaderId) {\n title = prefix + title;\n }\n\n if (globals.hashLinkCounts[title]) {\n title = title + '-' + (globals.hashLinkCounts[title]++);\n } else {\n globals.hashLinkCounts[title] = 1;\n }\n return title;\n }\n\n text = globals.converter._dispatch('headers.after', text, options, globals);\n return text;\n});\n\r\n/**\n * Turn Markdown link shortcuts into XHTML tags.\n */\nshowdown.subParser('horizontalRule', function (text, options, globals) {\n 'use strict';\n text = globals.converter._dispatch('horizontalRule.before', text, options, globals);\n\n var key = showdown.subParser('hashBlock')('
', options, globals);\n text = text.replace(/^ {0,2}( ?-){3,}[ \\t]*$/gm, key);\n text = text.replace(/^ {0,2}( ?\\*){3,}[ \\t]*$/gm, key);\n text = text.replace(/^ {0,2}( ?_){3,}[ \\t]*$/gm, key);\n\n text = globals.converter._dispatch('horizontalRule.after', text, options, globals);\n return text;\n});\n\r\n/**\n * Turn Markdown image shortcuts into ![]()
tags.\n */\nshowdown.subParser('images', function (text, options, globals) {\n 'use strict';\n\n text = globals.converter._dispatch('images.before', text, options, globals);\n\n var inlineRegExp = /!\\[([^\\]]*?)][ \\t]*()\\([ \\t]??(?: =([*\\d]+[A-Za-z%]{0,4})x([*\\d]+[A-Za-z%]{0,4}))?[ \\t]*(?:([\"'])([^\"]*?)\\6)?[ \\t]?\\)/g,\n crazyRegExp = /!\\[([^\\]]*?)][ \\t]*()\\([ \\t]?<([^>]*)>(?: =([*\\d]+[A-Za-z%]{0,4})x([*\\d]+[A-Za-z%]{0,4}))?[ \\t]*(?:(?:([\"'])([^\"]*?)\\6))?[ \\t]?\\)/g,\n base64RegExp = /!\\[([^\\]]*?)][ \\t]*()\\([ \\t]??(?: =([*\\d]+[A-Za-z%]{0,4})x([*\\d]+[A-Za-z%]{0,4}))?[ \\t]*(?:([\"'])([^\"]*?)\\6)?[ \\t]?\\)/g,\n referenceRegExp = /!\\[([^\\]]*?)] ?(?:\\n *)?\\[([\\s\\S]*?)]()()()()()/g,\n refShortcutRegExp = /!\\[([^\\[\\]]+)]()()()()()/g;\n\n function writeImageTagBase64 (wholeMatch, altText, linkId, url, width, height, m5, title) {\n url = url.replace(/\\s/g, '');\n return writeImageTag (wholeMatch, altText, linkId, url, width, height, m5, title);\n }\n\n function writeImageTag (wholeMatch, altText, linkId, url, width, height, m5, title) {\n\n var gUrls = globals.gUrls,\n gTitles = globals.gTitles,\n gDims = globals.gDimensions;\n\n linkId = linkId.toLowerCase();\n\n if (!title) {\n title = '';\n }\n // Special case for explicit empty url\n if (wholeMatch.search(/\\(? ?(['\"].*['\"])?\\)$/m) > -1) {\n url = '';\n\n } else if (url === '' || url === null) {\n if (linkId === '' || linkId === null) {\n // lower-case and turn embedded newlines into spaces\n linkId = altText.toLowerCase().replace(/ ?\\n/g, ' ');\n }\n url = '#' + linkId;\n\n if (!showdown.helper.isUndefined(gUrls[linkId])) {\n url = gUrls[linkId];\n if (!showdown.helper.isUndefined(gTitles[linkId])) {\n title = gTitles[linkId];\n }\n if (!showdown.helper.isUndefined(gDims[linkId])) {\n width = gDims[linkId].width;\n height = gDims[linkId].height;\n }\n } else {\n return wholeMatch;\n }\n }\n\n altText = altText\n .replace(/\"/g, '"')\n //altText = showdown.helper.escapeCharacters(altText, '*_', false);\n .replace(showdown.helper.regexes.asteriskDashAndColon, showdown.helper.escapeCharactersCallback);\n //url = showdown.helper.escapeCharacters(url, '*_', false);\n url = url.replace(showdown.helper.regexes.asteriskDashAndColon, showdown.helper.escapeCharactersCallback);\n var result = 'x \"optional title\")\n\n // base64 encoded images\n text = text.replace(base64RegExp, writeImageTagBase64);\n\n // cases with crazy urls like ./image/cat1).png\n text = text.replace(crazyRegExp, writeImageTag);\n\n // normal cases\n text = text.replace(inlineRegExp, writeImageTag);\n\n // handle reference-style shortcuts: ![img text]\n text = text.replace(refShortcutRegExp, writeImageTag);\n\n text = globals.converter._dispatch('images.after', text, options, globals);\n return text;\n});\n\r\nshowdown.subParser('italicsAndBold', function (text, options, globals) {\n 'use strict';\n\n text = globals.converter._dispatch('italicsAndBold.before', text, options, globals);\n\n // it's faster to have 3 separate regexes for each case than have just one\n // because of backtracing, in some cases, it could lead to an exponential effect\n // called \"catastrophic backtrace\". Ominous!\n\n function parseInside (txt, left, right) {\n /*\n if (options.simplifiedAutoLink) {\n txt = showdown.subParser('simplifiedAutoLinks')(txt, options, globals);\n }\n */\n return left + txt + right;\n }\n\n // Parse underscores\n if (options.literalMidWordUnderscores) {\n text = text.replace(/\\b___(\\S[\\s\\S]*?)___\\b/g, function (wm, txt) {\n return parseInside (txt, '', '');\n });\n text = text.replace(/\\b__(\\S[\\s\\S]*?)__\\b/g, function (wm, txt) {\n return parseInside (txt, '', '');\n });\n text = text.replace(/\\b_(\\S[\\s\\S]*?)_\\b/g, function (wm, txt) {\n return parseInside (txt, '', '');\n });\n } else {\n text = text.replace(/___(\\S[\\s\\S]*?)___/g, function (wm, m) {\n return (/\\S$/.test(m)) ? parseInside (m, '', '') : wm;\n });\n text = text.replace(/__(\\S[\\s\\S]*?)__/g, function (wm, m) {\n return (/\\S$/.test(m)) ? parseInside (m, '', '') : wm;\n });\n text = text.replace(/_([^\\s_][\\s\\S]*?)_/g, function (wm, m) {\n // !/^_[^_]/.test(m) - test if it doesn't start with __ (since it seems redundant, we removed it)\n return (/\\S$/.test(m)) ? parseInside (m, '', '') : wm;\n });\n }\n\n // Now parse asterisks\n if (options.literalMidWordAsterisks) {\n text = text.replace(/([^*]|^)\\B\\*\\*\\*(\\S[\\s\\S]*?)\\*\\*\\*\\B(?!\\*)/g, function (wm, lead, txt) {\n return parseInside (txt, lead + '', '');\n });\n text = text.replace(/([^*]|^)\\B\\*\\*(\\S[\\s\\S]*?)\\*\\*\\B(?!\\*)/g, function (wm, lead, txt) {\n return parseInside (txt, lead + '', '');\n });\n text = text.replace(/([^*]|^)\\B\\*(\\S[\\s\\S]*?)\\*\\B(?!\\*)/g, function (wm, lead, txt) {\n return parseInside (txt, lead + '', '');\n });\n } else {\n text = text.replace(/\\*\\*\\*(\\S[\\s\\S]*?)\\*\\*\\*/g, function (wm, m) {\n return (/\\S$/.test(m)) ? parseInside (m, '', '') : wm;\n });\n text = text.replace(/\\*\\*(\\S[\\s\\S]*?)\\*\\*/g, function (wm, m) {\n return (/\\S$/.test(m)) ? parseInside (m, '', '') : wm;\n });\n text = text.replace(/\\*([^\\s*][\\s\\S]*?)\\*/g, function (wm, m) {\n // !/^\\*[^*]/.test(m) - test if it doesn't start with ** (since it seems redundant, we removed it)\n return (/\\S$/.test(m)) ? parseInside (m, '', '') : wm;\n });\n }\n\n\n text = globals.converter._dispatch('italicsAndBold.after', text, options, globals);\n return text;\n});\n\r\n/**\n * Form HTML ordered (numbered) and unordered (bulleted) lists.\n */\nshowdown.subParser('lists', function (text, options, globals) {\n 'use strict';\n\n /**\n * Process the contents of a single ordered or unordered list, splitting it\n * into individual list items.\n * @param {string} listStr\n * @param {boolean} trimTrailing\n * @returns {string}\n */\n function processListItems (listStr, trimTrailing) {\n // The $g_list_level global keeps track of when we're inside a list.\n // Each time we enter a list, we increment it; when we leave a list,\n // we decrement. If it's zero, we're not in a list anymore.\n //\n // We do this because when we're not inside a list, we want to treat\n // something like this:\n //\n // I recommend upgrading to version\n // 8. Oops, now this line is treated\n // as a sub-list.\n //\n // As a single paragraph, despite the fact that the second line starts\n // with a digit-period-space sequence.\n //\n // Whereas when we're inside a list (or sub-list), that line will be\n // treated as the start of a sub-list. What a kludge, huh? This is\n // an aspect of Markdown's syntax that's hard to parse perfectly\n // without resorting to mind-reading. Perhaps the solution is to\n // change the syntax rules such that sub-lists must start with a\n // starting cardinal number; e.g. \"1.\" or \"a.\".\n globals.gListLevel++;\n\n // trim trailing blank lines:\n listStr = listStr.replace(/\\n{2,}$/, '\\n');\n\n // attacklab: add sentinel to emulate \\z\n listStr += '¨0';\n\n var rgx = /(\\n)?(^ {0,3})([*+-]|\\d+[.])[ \\t]+((\\[(x|X| )?])?[ \\t]*[^\\r]+?(\\n{1,2}))(?=\\n*(¨0| {0,3}([*+-]|\\d+[.])[ \\t]+))/gm,\n isParagraphed = (/\\n[ \\t]*\\n(?!¨0)/.test(listStr));\n\n // Since version 1.5, nesting sublists requires 4 spaces (or 1 tab) indentation,\n // which is a syntax breaking change\n // activating this option reverts to old behavior\n if (options.disableForced4SpacesIndentedSublists) {\n rgx = /(\\n)?(^ {0,3})([*+-]|\\d+[.])[ \\t]+((\\[(x|X| )?])?[ \\t]*[^\\r]+?(\\n{1,2}))(?=\\n*(¨0|\\2([*+-]|\\d+[.])[ \\t]+))/gm;\n }\n\n listStr = listStr.replace(rgx, function (wholeMatch, m1, m2, m3, m4, taskbtn, checked) {\n checked = (checked && checked.trim() !== '');\n\n var item = showdown.subParser('outdent')(m4, options, globals),\n bulletStyle = '';\n\n // Support for github tasklists\n if (taskbtn && options.tasklists) {\n bulletStyle = ' class=\"task-list-item\" style=\"list-style-type: none;\"';\n item = item.replace(/^[ \\t]*\\[(x|X| )?]/m, function () {\n var otp = 'a \n // instead of:\n // - - - a
\n // So, to prevent it, we will put a marker (¨A)in the beginning of the line\n // Kind of hackish/monkey patching, but seems more effective than overcomplicating the list parser\n item = item.replace(/^([-*+]|\\d\\.)[ \\t]+[\\S\\n ]*/g, function (wm2) {\n return '¨A' + wm2;\n });\n\n // m1 - Leading line or\n // Has a double return (multi paragraph) or\n // Has sublist\n if (m1 || (item.search(/\\n{2,}/) > -1)) {\n item = showdown.subParser('githubCodeBlocks')(item, options, globals);\n item = showdown.subParser('blockGamut')(item, options, globals);\n } else {\n // Recursion for sub-lists:\n item = showdown.subParser('lists')(item, options, globals);\n item = item.replace(/\\n$/, ''); // chomp(item)\n item = showdown.subParser('hashHTMLBlocks')(item, options, globals);\n\n // Colapse double linebreaks\n item = item.replace(/\\n\\n+/g, '\\n\\n');\n if (isParagraphed) {\n item = showdown.subParser('paragraphs')(item, options, globals);\n } else {\n item = showdown.subParser('spanGamut')(item, options, globals);\n }\n }\n\n // now we need to remove the marker (¨A)\n item = item.replace('¨A', '');\n // we can finally wrap the line in list item tags\n item = '' + item + '\\n';\n\n return item;\n });\n\n // attacklab: strip sentinel\n listStr = listStr.replace(/¨0/g, '');\n\n globals.gListLevel--;\n\n if (trimTrailing) {\n listStr = listStr.replace(/\\s+$/, '');\n }\n\n return listStr;\n }\n\n function styleStartNumber (list, listType) {\n // check if ol and starts by a number different than 1\n if (listType === 'ol') {\n var res = list.match(/^ *(\\d+)\\./);\n if (res && res[1] !== '1') {\n return ' start=\"' + res[1] + '\"';\n }\n }\n return '';\n }\n\n /**\n * Check and parse consecutive lists (better fix for issue #142)\n * @param {string} list\n * @param {string} listType\n * @param {boolean} trimTrailing\n * @returns {string}\n */\n function parseConsecutiveLists (list, listType, trimTrailing) {\n // check if we caught 2 or more consecutive lists by mistake\n // we use the counterRgx, meaning if listType is UL we look for OL and vice versa\n var olRgx = (options.disableForced4SpacesIndentedSublists) ? /^ ?\\d+\\.[ \\t]/gm : /^ {0,3}\\d+\\.[ \\t]/gm,\n ulRgx = (options.disableForced4SpacesIndentedSublists) ? /^ ?[*+-][ \\t]/gm : /^ {0,3}[*+-][ \\t]/gm,\n counterRxg = (listType === 'ul') ? olRgx : ulRgx,\n result = '';\n\n if (list.search(counterRxg) !== -1) {\n (function parseCL (txt) {\n var pos = txt.search(counterRxg),\n style = styleStartNumber(list, listType);\n if (pos !== -1) {\n // slice\n result += '\\n\\n<' + listType + style + '>\\n' + processListItems(txt.slice(0, pos), !!trimTrailing) + '\\n';\n\n // invert counterType and listType\n listType = (listType === 'ul') ? 'ol' : 'ul';\n counterRxg = (listType === 'ul') ? olRgx : ulRgx;\n\n //recurse\n parseCL(txt.slice(pos));\n } else {\n result += '\\n\\n<' + listType + style + '>\\n' + processListItems(txt, !!trimTrailing) + '\\n';\n }\n })(list);\n } else {\n var style = styleStartNumber(list, listType);\n result = '\\n\\n<' + listType + style + '>\\n' + processListItems(list, !!trimTrailing) + '\\n';\n }\n\n return result;\n }\n\n /** Start of list parsing **/\n text = globals.converter._dispatch('lists.before', text, options, globals);\n // add sentinel to hack around khtml/safari bug:\n // http://bugs.webkit.org/show_bug.cgi?id=11231\n text += '¨0';\n\n if (globals.gListLevel) {\n text = text.replace(/^(( {0,3}([*+-]|\\d+[.])[ \\t]+)[^\\r]+?(¨0|\\n{2,}(?=\\S)(?![ \\t]*(?:[*+-]|\\d+[.])[ \\t]+)))/gm,\n function (wholeMatch, list, m2) {\n var listType = (m2.search(/[*+-]/g) > -1) ? 'ul' : 'ol';\n return parseConsecutiveLists(list, listType, true);\n }\n );\n } else {\n text = text.replace(/(\\n\\n|^\\n?)(( {0,3}([*+-]|\\d+[.])[ \\t]+)[^\\r]+?(¨0|\\n{2,}(?=\\S)(?![ \\t]*(?:[*+-]|\\d+[.])[ \\t]+)))/gm,\n function (wholeMatch, m1, list, m3) {\n var listType = (m3.search(/[*+-]/g) > -1) ? 'ul' : 'ol';\n return parseConsecutiveLists(list, listType, false);\n }\n );\n }\n\n // strip sentinel\n text = text.replace(/¨0/, '');\n text = globals.converter._dispatch('lists.after', text, options, globals);\n return text;\n});\n\r\n/**\n * Parse metadata at the top of the document\n */\nshowdown.subParser('metadata', function (text, options, globals) {\n 'use strict';\n\n if (!options.metadata) {\n return text;\n }\n\n text = globals.converter._dispatch('metadata.before', text, options, globals);\n\n function parseMetadataContents (content) {\n // raw is raw so it's not changed in any way\n globals.metadata.raw = content;\n\n // escape chars forbidden in html attributes\n // double quotes\n content = content\n // ampersand first\n .replace(/&/g, '&')\n // double quotes\n .replace(/\"/g, '"');\n\n content = content.replace(/\\n {4}/g, ' ');\n content.replace(/^([\\S ]+): +([\\s\\S]+?)$/gm, function (wm, key, value) {\n globals.metadata.parsed[key] = value;\n return '';\n });\n }\n\n text = text.replace(/^\\s*«««+(\\S*?)\\n([\\s\\S]+?)\\n»»»+\\n/, function (wholematch, format, content) {\n parseMetadataContents(content);\n return '¨M';\n });\n\n text = text.replace(/^\\s*---+(\\S*?)\\n([\\s\\S]+?)\\n---+\\n/, function (wholematch, format, content) {\n if (format) {\n globals.metadata.format = format;\n }\n parseMetadataContents(content);\n return '¨M';\n });\n\n text = text.replace(/¨M/g, '');\n\n text = globals.converter._dispatch('metadata.after', text, options, globals);\n return text;\n});\n\r\n/**\n * Remove one level of line-leading tabs or spaces\n */\nshowdown.subParser('outdent', function (text, options, globals) {\n 'use strict';\n text = globals.converter._dispatch('outdent.before', text, options, globals);\n\n // attacklab: hack around Konqueror 3.5.4 bug:\n // \"----------bug\".replace(/^-/g,\"\") == \"bug\"\n text = text.replace(/^(\\t|[ ]{1,4})/gm, '¨0'); // attacklab: g_tab_width\n\n // attacklab: clean up hack\n text = text.replace(/¨0/g, '');\n\n text = globals.converter._dispatch('outdent.after', text, options, globals);\n return text;\n});\n\r\n/**\n *\n */\nshowdown.subParser('paragraphs', function (text, options, globals) {\n 'use strict';\n\n text = globals.converter._dispatch('paragraphs.before', text, options, globals);\n // Strip leading and trailing lines:\n text = text.replace(/^\\n+/g, '');\n text = text.replace(/\\n+$/g, '');\n\n var grafs = text.split(/\\n{2,}/g),\n grafsOut = [],\n end = grafs.length; // Wrap tags\n\n for (var i = 0; i < end; i++) {\n var str = grafs[i];\n // if this is an HTML marker, copy it\n if (str.search(/¨(K|G)(\\d+)\\1/g) >= 0) {\n grafsOut.push(str);\n\n // test for presence of characters to prevent empty lines being parsed\n // as paragraphs (resulting in undesired extra empty paragraphs)\n } else if (str.search(/\\S/) >= 0) {\n str = showdown.subParser('spanGamut')(str, options, globals);\n str = str.replace(/^([ \\t]*)/g, '
');\n str += '
';\n grafsOut.push(str);\n }\n }\n\n /** Unhashify HTML blocks */\n end = grafsOut.length;\n for (i = 0; i < end; i++) {\n var blockText = '',\n grafsOutIt = grafsOut[i],\n codeFlag = false;\n // if this is a marker for an html block...\n // use RegExp.test instead of string.search because of QML bug\n while (/¨(K|G)(\\d+)\\1/.test(grafsOutIt)) {\n var delim = RegExp.$1,\n num = RegExp.$2;\n\n if (delim === 'K') {\n blockText = globals.gHtmlBlocks[num];\n } else {\n // we need to check if ghBlock is a false positive\n if (codeFlag) {\n // use encoded version of all text\n blockText = showdown.subParser('encodeCode')(globals.ghCodeBlocks[num].text, options, globals);\n } else {\n blockText = globals.ghCodeBlocks[num].codeblock;\n }\n }\n blockText = blockText.replace(/\\$/g, '$$$$'); // Escape any dollar signs\n\n grafsOutIt = grafsOutIt.replace(/(\\n\\n)?¨(K|G)\\d+\\2(\\n\\n)?/, blockText);\n // Check if grafsOutIt is a pre->code\n if (/^]*>\\s*]*>/.test(grafsOutIt)) {\n codeFlag = true;\n }\n }\n grafsOut[i] = grafsOutIt;\n }\n text = grafsOut.join('\\n');\n // Strip leading and trailing lines:\n text = text.replace(/^\\n+/g, '');\n text = text.replace(/\\n+$/g, '');\n return globals.converter._dispatch('paragraphs.after', text, options, globals);\n});\n\r\n/**\n * Run extension\n */\nshowdown.subParser('runExtension', function (ext, text, options, globals) {\n 'use strict';\n\n if (ext.filter) {\n text = ext.filter(text, globals.converter, options);\n\n } else if (ext.regex) {\n // TODO remove this when old extension loading mechanism is deprecated\n var re = ext.regex;\n if (!(re instanceof RegExp)) {\n re = new RegExp(re, 'g');\n }\n text = text.replace(re, ext.replace);\n }\n\n return text;\n});\n\r\n/**\n * These are all the transformations that occur *within* block-level\n * tags like paragraphs, headers, and list items.\n */\nshowdown.subParser('spanGamut', function (text, options, globals) {\n 'use strict';\n\n text = globals.converter._dispatch('spanGamut.before', text, options, globals);\n text = showdown.subParser('codeSpans')(text, options, globals);\n text = showdown.subParser('escapeSpecialCharsWithinTagAttributes')(text, options, globals);\n text = showdown.subParser('encodeBackslashEscapes')(text, options, globals);\n\n // Process anchor and image tags. Images must come first,\n // because ![foo][f] looks like an anchor.\n text = showdown.subParser('images')(text, options, globals);\n text = showdown.subParser('anchors')(text, options, globals);\n\n // Make links out of things like `).\n text = showdown.subParser('autoLinks')(text, options, globals);\n text = showdown.subParser('simplifiedAutoLinks')(text, options, globals);\n text = showdown.subParser('emoji')(text, options, globals);\n text = showdown.subParser('underline')(text, options, globals);\n text = showdown.subParser('italicsAndBold')(text, options, globals);\n text = showdown.subParser('strikethrough')(text, options, globals);\n text = showdown.subParser('ellipsis')(text, options, globals);\n\n // we need to hash HTML tags inside spans\n text = showdown.subParser('hashHTMLSpans')(text, options, globals);\n\n // now we encode amps and angles\n text = showdown.subParser('encodeAmpsAndAngles')(text, options, globals);\n\n // Do hard breaks\n if (options.simpleLineBreaks) {\n // GFM style hard breaks\n // only add line breaks if the text does not contain a block (special case for lists)\n if (!/\\n\\n¨K/.test(text)) {\n text = text.replace(/\\n+/g, '
\\n');\n }\n } else {\n // Vanilla hard breaks\n text = text.replace(/ +\\n/g, '
\\n');\n }\n\n text = globals.converter._dispatch('spanGamut.after', text, options, globals);\n return text;\n});\n\r\nshowdown.subParser('strikethrough', function (text, options, globals) {\n 'use strict';\n\n function parseInside (txt) {\n if (options.simplifiedAutoLink) {\n txt = showdown.subParser('simplifiedAutoLinks')(txt, options, globals);\n }\n return '' + txt + '';\n }\n\n if (options.strikethrough) {\n text = globals.converter._dispatch('strikethrough.before', text, options, globals);\n text = text.replace(/(?:~){2}([\\s\\S]+?)(?:~){2}/g, function (wm, txt) { return parseInside(txt); });\n text = globals.converter._dispatch('strikethrough.after', text, options, globals);\n }\n\n return text;\n});\n\r\n/**\n * Strips link definitions from text, stores the URLs and titles in\n * hash references.\n * Link defs are in the form: ^[id]: url \"optional title\"\n */\nshowdown.subParser('stripLinkDefinitions', function (text, options, globals) {\n 'use strict';\n\n var regex = /^ {0,3}\\[(.+)]:[ \\t]*\\n?[ \\t]*\\s]+)>?(?: =([*\\d]+[A-Za-z%]{0,4})x([*\\d]+[A-Za-z%]{0,4}))?[ \\t]*\\n?[ \\t]*(?:(\\n*)[\"|'(](.+?)[\"|')][ \\t]*)?(?:\\n+|(?=¨0))/gm,\n base64Regex = /^ {0,3}\\[(.+)]:[ \\t]*\\n?[ \\t]*?(?: =([*\\d]+[A-Za-z%]{0,4})x([*\\d]+[A-Za-z%]{0,4}))?[ \\t]*\\n?[ \\t]*(?:(\\n*)[\"|'(](.+?)[\"|')][ \\t]*)?(?:\\n\\n|(?=¨0)|(?=\\n\\[))/gm;\n\n // attacklab: sentinel workarounds for lack of \\A and \\Z, safari\\khtml bug\n text += '¨0';\n\n var replaceFunc = function (wholeMatch, linkId, url, width, height, blankLines, title) {\n linkId = linkId.toLowerCase();\n if (url.match(/^data:.+?\\/.+?;base64,/)) {\n // remove newlines\n globals.gUrls[linkId] = url.replace(/\\s/g, '');\n } else {\n globals.gUrls[linkId] = showdown.subParser('encodeAmpsAndAngles')(url, options, globals); // Link IDs are case-insensitive\n }\n\n if (blankLines) {\n // Oops, found blank lines, so it's not a title.\n // Put back the parenthetical statement we stole.\n return blankLines + title;\n\n } else {\n if (title) {\n globals.gTitles[linkId] = title.replace(/\"|'/g, '"');\n }\n if (options.parseImgDimensions && width && height) {\n globals.gDimensions[linkId] = {\n width: width,\n height: height\n };\n }\n }\n // Completely remove the definition from the text\n return '';\n };\n\n // first we try to find base64 link references\n text = text.replace(base64Regex, replaceFunc);\n\n text = text.replace(regex, replaceFunc);\n\n // attacklab: strip sentinel\n text = text.replace(/¨0/, '');\n\n return text;\n});\n\r\nshowdown.subParser('tables', function (text, options, globals) {\n 'use strict';\n\n if (!options.tables) {\n return text;\n }\n\n var tableRgx = /^ {0,3}\\|?.+\\|.+\\n {0,3}\\|?[ \\t]*:?[ \\t]*(?:[-=]){2,}[ \\t]*:?[ \\t]*\\|[ \\t]*:?[ \\t]*(?:[-=]){2,}[\\s\\S]+?(?:\\n\\n|¨0)/gm,\n //singeColTblRgx = /^ {0,3}\\|.+\\|\\n {0,3}\\|[ \\t]*:?[ \\t]*(?:[-=]){2,}[ \\t]*:?[ \\t]*\\|[ \\t]*\\n(?: {0,3}\\|.+\\|\\n)+(?:\\n\\n|¨0)/gm;\n singeColTblRgx = /^ {0,3}\\|.+\\|[ \\t]*\\n {0,3}\\|[ \\t]*:?[ \\t]*(?:[-=]){2,}[ \\t]*:?[ \\t]*\\|[ \\t]*\\n( {0,3}\\|.+\\|[ \\t]*\\n)*(?:\\n|¨0)/gm;\n\n function parseStyles (sLine) {\n if (/^:[ \\t]*--*$/.test(sLine)) {\n return ' style=\"text-align:left;\"';\n } else if (/^--*[ \\t]*:[ \\t]*$/.test(sLine)) {\n return ' style=\"text-align:right;\"';\n } else if (/^:[ \\t]*--*[ \\t]*:$/.test(sLine)) {\n return ' style=\"text-align:center;\"';\n } else {\n return '';\n }\n }\n\n function parseHeaders (header, style) {\n var id = '';\n header = header.trim();\n // support both tablesHeaderId and tableHeaderId due to error in documentation so we don't break backwards compatibility\n if (options.tablesHeaderId || options.tableHeaderId) {\n id = ' id=\"' + header.replace(/ /g, '_').toLowerCase() + '\"';\n }\n header = showdown.subParser('spanGamut')(header, options, globals);\n\n return '' + header + '\\n';\n }\n\n function parseCells (cell, style) {\n var subText = showdown.subParser('spanGamut')(cell, options, globals);\n return '' + subText + '\\n';\n }\n\n function buildTable (headers, cells) {\n var tb = '\\n\\n\\n',\n tblLgn = headers.length;\n\n for (var i = 0; i < tblLgn; ++i) {\n tb += headers[i];\n }\n tb += ' \\n\\n\\n';\n\n for (i = 0; i < cells.length; ++i) {\n tb += '\\n';\n for (var ii = 0; ii < tblLgn; ++ii) {\n tb += cells[i][ii];\n }\n tb += ' \\n';\n }\n tb += '\\n
\\n';\n return tb;\n }\n\n function parseTable (rawTable) {\n var i, tableLines = rawTable.split('\\n');\n\n for (i = 0; i < tableLines.length; ++i) {\n // strip wrong first and last column if wrapped tables are used\n if (/^ {0,3}\\|/.test(tableLines[i])) {\n tableLines[i] = tableLines[i].replace(/^ {0,3}\\|/, '');\n }\n if (/\\|[ \\t]*$/.test(tableLines[i])) {\n tableLines[i] = tableLines[i].replace(/\\|[ \\t]*$/, '');\n }\n // parse code spans first, but we only support one line code spans\n tableLines[i] = showdown.subParser('codeSpans')(tableLines[i], options, globals);\n }\n\n var rawHeaders = tableLines[0].split('|').map(function (s) { return s.trim();}),\n rawStyles = tableLines[1].split('|').map(function (s) { return s.trim();}),\n rawCells = [],\n headers = [],\n styles = [],\n cells = [];\n\n tableLines.shift();\n tableLines.shift();\n\n for (i = 0; i < tableLines.length; ++i) {\n if (tableLines[i].trim() === '') {\n continue;\n }\n rawCells.push(\n tableLines[i]\n .split('|')\n .map(function (s) {\n return s.trim();\n })\n );\n }\n\n if (rawHeaders.length < rawStyles.length) {\n return rawTable;\n }\n\n for (i = 0; i < rawStyles.length; ++i) {\n styles.push(parseStyles(rawStyles[i]));\n }\n\n for (i = 0; i < rawHeaders.length; ++i) {\n if (showdown.helper.isUndefined(styles[i])) {\n styles[i] = '';\n }\n headers.push(parseHeaders(rawHeaders[i], styles[i]));\n }\n\n for (i = 0; i < rawCells.length; ++i) {\n var row = [];\n for (var ii = 0; ii < headers.length; ++ii) {\n if (showdown.helper.isUndefined(rawCells[i][ii])) {\n\n }\n row.push(parseCells(rawCells[i][ii], styles[ii]));\n }\n cells.push(row);\n }\n\n return buildTable(headers, cells);\n }\n\n text = globals.converter._dispatch('tables.before', text, options, globals);\n\n // find escaped pipe characters\n text = text.replace(/\\\\(\\|)/g, showdown.helper.escapeCharactersCallback);\n\n // parse multi column tables\n text = text.replace(tableRgx, parseTable);\n\n // parse one column tables\n text = text.replace(singeColTblRgx, parseTable);\n\n text = globals.converter._dispatch('tables.after', text, options, globals);\n\n return text;\n});\n\r\nshowdown.subParser('underline', function (text, options, globals) {\n 'use strict';\n\n if (!options.underline) {\n return text;\n }\n\n text = globals.converter._dispatch('underline.before', text, options, globals);\n\n if (options.literalMidWordUnderscores) {\n text = text.replace(/\\b___(\\S[\\s\\S]*?)___\\b/g, function (wm, txt) {\n return '' + txt + '';\n });\n text = text.replace(/\\b__(\\S[\\s\\S]*?)__\\b/g, function (wm, txt) {\n return '' + txt + '';\n });\n } else {\n text = text.replace(/___(\\S[\\s\\S]*?)___/g, function (wm, m) {\n return (/\\S$/.test(m)) ? '' + m + '' : wm;\n });\n text = text.replace(/__(\\S[\\s\\S]*?)__/g, function (wm, m) {\n return (/\\S$/.test(m)) ? '' + m + '' : wm;\n });\n }\n\n // escape remaining underscores to prevent them being parsed by italic and bold\n text = text.replace(/(_)/g, showdown.helper.escapeCharactersCallback);\n\n text = globals.converter._dispatch('underline.after', text, options, globals);\n\n return text;\n});\n\r\n/**\n * Swap back in all the special characters we've hidden.\n */\nshowdown.subParser('unescapeSpecialChars', function (text, options, globals) {\n 'use strict';\n text = globals.converter._dispatch('unescapeSpecialChars.before', text, options, globals);\n\n text = text.replace(/¨E(\\d+)E/g, function (wholeMatch, m1) {\n var charCodeToReplace = parseInt(m1);\n return String.fromCharCode(charCodeToReplace);\n });\n\n text = globals.converter._dispatch('unescapeSpecialChars.after', text, options, globals);\n return text;\n});\n\r\nshowdown.subParser('makeMarkdown.blockquote', function (node, globals) {\n 'use strict';\n\n var txt = '';\n if (node.hasChildNodes()) {\n var children = node.childNodes,\n childrenLength = children.length;\n\n for (var i = 0; i < childrenLength; ++i) {\n var innerTxt = showdown.subParser('makeMarkdown.node')(children[i], globals);\n\n if (innerTxt === '') {\n continue;\n }\n txt += innerTxt;\n }\n }\n // cleanup\n txt = txt.trim();\n txt = '> ' + txt.split('\\n').join('\\n> ');\n return txt;\n});\n\r\nshowdown.subParser('makeMarkdown.codeBlock', function (node, globals) {\n 'use strict';\n\n var lang = node.getAttribute('language'),\n num = node.getAttribute('precodenum');\n return '```' + lang + '\\n' + globals.preList[num] + '\\n```';\n});\n\r\nshowdown.subParser('makeMarkdown.codeSpan', function (node) {\n 'use strict';\n\n return '`' + node.innerHTML + '`';\n});\n\r\nshowdown.subParser('makeMarkdown.emphasis', function (node, globals) {\n 'use strict';\n\n var txt = '';\n if (node.hasChildNodes()) {\n txt += '*';\n var children = node.childNodes,\n childrenLength = children.length;\n for (var i = 0; i < childrenLength; ++i) {\n txt += showdown.subParser('makeMarkdown.node')(children[i], globals);\n }\n txt += '*';\n }\n return txt;\n});\n\r\nshowdown.subParser('makeMarkdown.header', function (node, globals, headerLevel) {\n 'use strict';\n\n var headerMark = new Array(headerLevel + 1).join('#'),\n txt = '';\n\n if (node.hasChildNodes()) {\n txt = headerMark + ' ';\n var children = node.childNodes,\n childrenLength = children.length;\n\n for (var i = 0; i < childrenLength; ++i) {\n txt += showdown.subParser('makeMarkdown.node')(children[i], globals);\n }\n }\n return txt;\n});\n\r\nshowdown.subParser('makeMarkdown.hr', function () {\n 'use strict';\n\n return '---';\n});\n\r\nshowdown.subParser('makeMarkdown.image', function (node) {\n 'use strict';\n\n var txt = '';\n if (node.hasAttribute('src')) {\n txt += ' + '>';\n if (node.hasAttribute('width') && node.hasAttribute('height')) {\n txt += ' =' + node.getAttribute('width') + 'x' + node.getAttribute('height');\n }\n\n if (node.hasAttribute('title')) {\n txt += ' \"' + node.getAttribute('title') + '\"';\n }\n txt += ')';\n }\n return txt;\n});\n\r\nshowdown.subParser('makeMarkdown.links', function (node, globals) {\n 'use strict';\n\n var txt = '';\n if (node.hasChildNodes() && node.hasAttribute('href')) {\n var children = node.childNodes,\n childrenLength = children.length;\n txt = '[';\n for (var i = 0; i < childrenLength; ++i) {\n txt += showdown.subParser('makeMarkdown.node')(children[i], globals);\n }\n txt += '](';\n txt += '<' + node.getAttribute('href') + '>';\n if (node.hasAttribute('title')) {\n txt += ' \"' + node.getAttribute('title') + '\"';\n }\n txt += ')';\n }\n return txt;\n});\n\r\nshowdown.subParser('makeMarkdown.list', function (node, globals, type) {\n 'use strict';\n\n var txt = '';\n if (!node.hasChildNodes()) {\n return '';\n }\n var listItems = node.childNodes,\n listItemsLenght = listItems.length,\n listNum = node.getAttribute('start') || 1;\n\n for (var i = 0; i < listItemsLenght; ++i) {\n if (typeof listItems[i].tagName === 'undefined' || listItems[i].tagName.toLowerCase() !== 'li') {\n continue;\n }\n\n // define the bullet to use in list\n var bullet = '';\n if (type === 'ol') {\n bullet = listNum.toString() + '. ';\n } else {\n bullet = '- ';\n }\n\n // parse list item\n txt += bullet + showdown.subParser('makeMarkdown.listItem')(listItems[i], globals);\n ++listNum;\n }\n\n // add comment at the end to prevent consecutive lists to be parsed as one\n txt += '\\n\\n';\n return txt.trim();\n});\n\r\nshowdown.subParser('makeMarkdown.listItem', function (node, globals) {\n 'use strict';\n\n var listItemTxt = '';\n\n var children = node.childNodes,\n childrenLenght = children.length;\n\n for (var i = 0; i < childrenLenght; ++i) {\n listItemTxt += showdown.subParser('makeMarkdown.node')(children[i], globals);\n }\n // if it's only one liner, we need to add a newline at the end\n if (!/\\n$/.test(listItemTxt)) {\n listItemTxt += '\\n';\n } else {\n // it's multiparagraph, so we need to indent\n listItemTxt = listItemTxt\n .split('\\n')\n .join('\\n ')\n .replace(/^ {4}$/gm, '')\n .replace(/\\n\\n+/g, '\\n\\n');\n }\n\n return listItemTxt;\n});\n\r\n\n\nshowdown.subParser('makeMarkdown.node', function (node, globals, spansOnly) {\n 'use strict';\n\n spansOnly = spansOnly || false;\n\n var txt = '';\n\n // edge case of text without wrapper paragraph\n if (node.nodeType === 3) {\n return showdown.subParser('makeMarkdown.txt')(node, globals);\n }\n\n // HTML comment\n if (node.nodeType === 8) {\n return '\\n\\n';\n }\n\n // process only node elements\n if (node.nodeType !== 1) {\n return '';\n }\n\n var tagName = node.tagName.toLowerCase();\n\n switch (tagName) {\n\n //\n // BLOCKS\n //\n case 'h1':\n if (!spansOnly) { txt = showdown.subParser('makeMarkdown.header')(node, globals, 1) + '\\n\\n'; }\n break;\n case 'h2':\n if (!spansOnly) { txt = showdown.subParser('makeMarkdown.header')(node, globals, 2) + '\\n\\n'; }\n break;\n case 'h3':\n if (!spansOnly) { txt = showdown.subParser('makeMarkdown.header')(node, globals, 3) + '\\n\\n'; }\n break;\n case 'h4':\n if (!spansOnly) { txt = showdown.subParser('makeMarkdown.header')(node, globals, 4) + '\\n\\n'; }\n break;\n case 'h5':\n if (!spansOnly) { txt = showdown.subParser('makeMarkdown.header')(node, globals, 5) + '\\n\\n'; }\n break;\n case 'h6':\n if (!spansOnly) { txt = showdown.subParser('makeMarkdown.header')(node, globals, 6) + '\\n\\n'; }\n break;\n\n case 'p':\n if (!spansOnly) { txt = showdown.subParser('makeMarkdown.paragraph')(node, globals) + '\\n\\n'; }\n break;\n\n case 'blockquote':\n if (!spansOnly) { txt = showdown.subParser('makeMarkdown.blockquote')(node, globals) + '\\n\\n'; }\n break;\n\n case 'hr':\n if (!spansOnly) { txt = showdown.subParser('makeMarkdown.hr')(node, globals) + '\\n\\n'; }\n break;\n\n case 'ol':\n if (!spansOnly) { txt = showdown.subParser('makeMarkdown.list')(node, globals, 'ol') + '\\n\\n'; }\n break;\n\n case 'ul':\n if (!spansOnly) { txt = showdown.subParser('makeMarkdown.list')(node, globals, 'ul') + '\\n\\n'; }\n break;\n\n case 'precode':\n if (!spansOnly) { txt = showdown.subParser('makeMarkdown.codeBlock')(node, globals) + '\\n\\n'; }\n break;\n\n case 'pre':\n if (!spansOnly) { txt = showdown.subParser('makeMarkdown.pre')(node, globals) + '\\n\\n'; }\n break;\n\n case 'table':\n if (!spansOnly) { txt = showdown.subParser('makeMarkdown.table')(node, globals) + '\\n\\n'; }\n break;\n\n //\n // SPANS\n //\n case 'code':\n txt = showdown.subParser('makeMarkdown.codeSpan')(node, globals);\n break;\n\n case 'em':\n case 'i':\n txt = showdown.subParser('makeMarkdown.emphasis')(node, globals);\n break;\n\n case 'strong':\n case 'b':\n txt = showdown.subParser('makeMarkdown.strong')(node, globals);\n break;\n\n case 'del':\n txt = showdown.subParser('makeMarkdown.strikethrough')(node, globals);\n break;\n\n case 'a':\n txt = showdown.subParser('makeMarkdown.links')(node, globals);\n break;\n\n case 'img':\n txt = showdown.subParser('makeMarkdown.image')(node, globals);\n break;\n\n default:\n txt = node.outerHTML + '\\n\\n';\n }\n\n // common normalization\n // TODO eventually\n\n return txt;\n});\n\r\nshowdown.subParser('makeMarkdown.paragraph', function (node, globals) {\n 'use strict';\n\n var txt = '';\n if (node.hasChildNodes()) {\n var children = node.childNodes,\n childrenLength = children.length;\n for (var i = 0; i < childrenLength; ++i) {\n txt += showdown.subParser('makeMarkdown.node')(children[i], globals);\n }\n }\n\n // some text normalization\n txt = txt.trim();\n\n return txt;\n});\n\r\nshowdown.subParser('makeMarkdown.pre', function (node, globals) {\n 'use strict';\n\n var num = node.getAttribute('prenum');\n return '' + globals.preList[num] + '
';\n});\n\r\nshowdown.subParser('makeMarkdown.strikethrough', function (node, globals) {\n 'use strict';\n\n var txt = '';\n if (node.hasChildNodes()) {\n txt += '~~';\n var children = node.childNodes,\n childrenLength = children.length;\n for (var i = 0; i < childrenLength; ++i) {\n txt += showdown.subParser('makeMarkdown.node')(children[i], globals);\n }\n txt += '~~';\n }\n return txt;\n});\n\r\nshowdown.subParser('makeMarkdown.strong', function (node, globals) {\n 'use strict';\n\n var txt = '';\n if (node.hasChildNodes()) {\n txt += '**';\n var children = node.childNodes,\n childrenLength = children.length;\n for (var i = 0; i < childrenLength; ++i) {\n txt += showdown.subParser('makeMarkdown.node')(children[i], globals);\n }\n txt += '**';\n }\n return txt;\n});\n\r\nshowdown.subParser('makeMarkdown.table', function (node, globals) {\n 'use strict';\n\n var txt = '',\n tableArray = [[], []],\n headings = node.querySelectorAll('thead>tr>th'),\n rows = node.querySelectorAll('tbody>tr'),\n i, ii;\n for (i = 0; i < headings.length; ++i) {\n var headContent = showdown.subParser('makeMarkdown.tableCell')(headings[i], globals),\n allign = '---';\n\n if (headings[i].hasAttribute('style')) {\n var style = headings[i].getAttribute('style').toLowerCase().replace(/\\s/g, '');\n switch (style) {\n case 'text-align:left;':\n allign = ':---';\n break;\n case 'text-align:right;':\n allign = '---:';\n break;\n case 'text-align:center;':\n allign = ':---:';\n break;\n }\n }\n tableArray[0][i] = headContent.trim();\n tableArray[1][i] = allign;\n }\n\n for (i = 0; i < rows.length; ++i) {\n var r = tableArray.push([]) - 1,\n cols = rows[i].getElementsByTagName('td');\n\n for (ii = 0; ii < headings.length; ++ii) {\n var cellContent = ' ';\n if (typeof cols[ii] !== 'undefined') {\n cellContent = showdown.subParser('makeMarkdown.tableCell')(cols[ii], globals);\n }\n tableArray[r].push(cellContent);\n }\n }\n\n var cellSpacesCount = 3;\n for (i = 0; i < tableArray.length; ++i) {\n for (ii = 0; ii < tableArray[i].length; ++ii) {\n var strLen = tableArray[i][ii].length;\n if (strLen > cellSpacesCount) {\n cellSpacesCount = strLen;\n }\n }\n }\n\n for (i = 0; i < tableArray.length; ++i) {\n for (ii = 0; ii < tableArray[i].length; ++ii) {\n if (i === 1) {\n if (tableArray[i][ii].slice(-1) === ':') {\n tableArray[i][ii] = showdown.helper.padEnd(tableArray[i][ii].slice(-1), cellSpacesCount - 1, '-') + ':';\n } else {\n tableArray[i][ii] = showdown.helper.padEnd(tableArray[i][ii], cellSpacesCount, '-');\n }\n } else {\n tableArray[i][ii] = showdown.helper.padEnd(tableArray[i][ii], cellSpacesCount);\n }\n }\n txt += '| ' + tableArray[i].join(' | ') + ' |\\n';\n }\n\n return txt.trim();\n});\n\r\nshowdown.subParser('makeMarkdown.tableCell', function (node, globals) {\n 'use strict';\n\n var txt = '';\n if (!node.hasChildNodes()) {\n return '';\n }\n var children = node.childNodes,\n childrenLength = children.length;\n\n for (var i = 0; i < childrenLength; ++i) {\n txt += showdown.subParser('makeMarkdown.node')(children[i], globals, true);\n }\n return txt.trim();\n});\n\r\nshowdown.subParser('makeMarkdown.txt', function (node) {\n 'use strict';\n\n var txt = node.nodeValue;\n\n // multiple spaces are collapsed\n txt = txt.replace(/ +/g, ' ');\n\n // replace the custom ¨NBSP; with a space\n txt = txt.replace(/¨NBSP;/g, ' ');\n\n // \", <, > and & should replace escaped html entities\n txt = showdown.helper.unescapeHTMLEntities(txt);\n\n // escape markdown magic characters\n // emphasis, strong and strikethrough - can appear everywhere\n // we also escape pipe (|) because of tables\n // and escape ` because of code blocks and spans\n txt = txt.replace(/([*_~|`])/g, '\\\\$1');\n\n // escape > because of blockquotes\n txt = txt.replace(/^(\\s*)>/g, '\\\\$1>');\n\n // hash character, only troublesome at the beginning of a line because of headers\n txt = txt.replace(/^#/gm, '\\\\#');\n\n // horizontal rules\n txt = txt.replace(/^(\\s*)([-=]{3,})(\\s*)$/, '$1\\\\$2$3');\n\n // dot, because of ordered lists, only troublesome at the beginning of a line when preceded by an integer\n txt = txt.replace(/^( {0,3}\\d+)\\./gm, '$1\\\\.');\n\n // +, * and -, at the beginning of a line becomes a list, so we need to escape them also (asterisk was already escaped)\n txt = txt.replace(/^( {0,3})([+-])/gm, '$1\\\\$2');\n\n // images and links, ] followed by ( is problematic, so we escape it\n txt = txt.replace(/]([\\s]*)\\(/g, '\\\\]$1\\\\(');\n\n // reference URIs must also be escaped\n txt = txt.replace(/^ {0,3}\\[([\\S \\t]*?)]:/gm, '\\\\[$1]:');\n\n return txt;\n});\n\r\nvar root = this;\n\n// AMD Loader\nif (typeof define === 'function' && define.amd) {\n define(function () {\n 'use strict';\n return showdown;\n });\n\n// CommonJS/nodeJS Loader\n} else if (typeof module !== 'undefined' && module.exports) {\n module.exports = showdown;\n\n// Regular Browser loader\n} else {\n root.showdown = showdown;\n}\n}).call(this);\r\n\n//# sourceMappingURL=showdown.js.map\r\n\n\n\n// WEBPACK FOOTER //\n// ../node_modules/showdown/dist/showdown.js","// removed by extract-text-webpack-plugin\nmodule.exports = {\"thesis\":\"thesis__3uAQ4\"};\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./components/thesis.css\n// module id = J9SO\n// module chunks = 0","import { Component, cloneElement, h } from 'preact';\n\nvar EMPTY$1 = {};\n\nfunction assign(obj, props) {\n\t// eslint-disable-next-line guard-for-in\n\tfor (var i in props) {\n\t\tobj[i] = props[i];\n\t}\n\treturn obj;\n}\n\nfunction exec(url, route, opts) {\n\tvar reg = /(?:\\?([^#]*))?(#.*)?$/,\n\t\tc = url.match(reg),\n\t\tmatches = {},\n\t\tret;\n\tif (c && c[1]) {\n\t\tvar p = c[1].split('&');\n\t\tfor (var i=0; i b.rank) ? -1 :\n\t\t(a.index - b.index)\n\t);\n}\n\n// filter out VNodes without attributes (which are unrankeable), and add `index`/`rank` properties to be used in sorting.\nfunction prepareVNodeForRanking(vnode, index) {\n\tvnode.index = index;\n\tvnode.rank = rankChild(vnode);\n\treturn vnode.attributes;\n}\n\nfunction segmentize(url) {\n\treturn url.replace(/(^\\/+|\\/+$)/g, '').split('/');\n}\n\nfunction rankSegment(segment) {\n\treturn segment.charAt(0)==':' ? (1 + '*+?'.indexOf(segment.charAt(segment.length-1))) || 4 : 5;\n}\n\nfunction rank(path) {\n\treturn segmentize(path).map(rankSegment).join('');\n}\n\nfunction rankChild(vnode) {\n\treturn vnode.attributes.default ? 0 : rank(vnode.attributes.path);\n}\n\nvar customHistory = null;\n\nvar ROUTERS = [];\n\nvar subscribers = [];\n\nvar EMPTY = {};\n\nfunction isPreactElement(node) {\n\treturn node.__preactattr_!=null || typeof Symbol!=='undefined' && node[Symbol.for('preactattr')]!=null;\n}\n\nfunction setUrl(url, type) {\n\tif ( type === void 0 ) type='push';\n\n\tif (customHistory && customHistory[type]) {\n\t\tcustomHistory[type](url);\n\t}\n\telse if (typeof history!=='undefined' && history[type+'State']) {\n\t\thistory[type+'State'](null, null, url);\n\t}\n}\n\n\nfunction getCurrentUrl() {\n\tvar url;\n\tif (customHistory && customHistory.location) {\n\t\turl = customHistory.location;\n\t}\n\telse if (customHistory && customHistory.getCurrentLocation) {\n\t\turl = customHistory.getCurrentLocation();\n\t}\n\telse {\n\t\turl = typeof location!=='undefined' ? location : EMPTY;\n\t}\n\treturn (\"\" + (url.pathname || '') + (url.search || ''));\n}\n\n\n\nfunction route(url, replace) {\n\tif ( replace === void 0 ) replace=false;\n\n\tif (typeof url!=='string' && url.url) {\n\t\treplace = url.replace;\n\t\turl = url.url;\n\t}\n\n\t// only push URL into history if we can handle it\n\tif (canRoute(url)) {\n\t\tsetUrl(url, replace ? 'replace' : 'push');\n\t}\n\n\treturn routeTo(url);\n}\n\n\n/** Check if the given URL can be handled by any router instances. */\nfunction canRoute(url) {\n\tfor (var i=ROUTERS.length; i--; ) {\n\t\tif (ROUTERS[i].canRoute(url)) { return true; }\n\t}\n\treturn false;\n}\n\n\n/** Tell all router instances to handle the given URL. */\nfunction routeTo(url) {\n\tvar didRoute = false;\n\tfor (var i=0; i 0;\n\t};\n\n\t/** Re-render children with a new URL to match against. */\n\tRouter.prototype.routeTo = function routeTo (url) {\n\t\tthis._didRoute = false;\n\t\tthis.setState({ url: url });\n\n\t\t// if we're in the middle of an update, don't synchronously re-route.\n\t\tif (this.updating) { return this.canRoute(url); }\n\n\t\tthis.forceUpdate();\n\t\treturn this._didRoute;\n\t};\n\n\tRouter.prototype.componentWillMount = function componentWillMount () {\n\t\tROUTERS.push(this);\n\t\tthis.updating = true;\n\t};\n\n\tRouter.prototype.componentDidMount = function componentDidMount () {\n\t\tvar this$1 = this;\n\n\t\tif (customHistory) {\n\t\t\tthis.unlisten = customHistory.listen(function (location) {\n\t\t\t\tthis$1.routeTo((\"\" + (location.pathname || '') + (location.search || '')));\n\t\t\t});\n\t\t}\n\t\tthis.updating = false;\n\t};\n\n\tRouter.prototype.componentWillUnmount = function componentWillUnmount () {\n\t\tif (typeof this.unlisten==='function') { this.unlisten(); }\n\t\tROUTERS.splice(ROUTERS.indexOf(this), 1);\n\t};\n\n\tRouter.prototype.componentWillUpdate = function componentWillUpdate () {\n\t\tthis.updating = true;\n\t};\n\n\tRouter.prototype.componentDidUpdate = function componentDidUpdate () {\n\t\tthis.updating = false;\n\t};\n\n\tRouter.prototype.getMatchingChildren = function getMatchingChildren (children, url, invoke) {\n\t\treturn children\n\t\t\t.filter(prepareVNodeForRanking)\n\t\t\t.sort(pathRankSort)\n\t\t\t.map( function (vnode) {\n\t\t\t\tvar matches = exec(url, vnode.attributes.path, vnode.attributes);\n\t\t\t\tif (matches) {\n\t\t\t\t\tif (invoke !== false) {\n\t\t\t\t\t\tvar newProps = { url: url, matches: matches };\n\t\t\t\t\t\tassign(newProps, matches);\n\t\t\t\t\t\tdelete newProps.ref;\n\t\t\t\t\t\tdelete newProps.key;\n\t\t\t\t\t\treturn cloneElement(vnode, newProps);\n\t\t\t\t\t}\n\t\t\t\t\treturn vnode;\n\t\t\t\t}\n\t\t\t}).filter(Boolean);\n\t};\n\n\tRouter.prototype.render = function render (ref, ref$1) {\n\t\tvar children = ref.children;\n\t\tvar onChange = ref.onChange;\n\t\tvar url = ref$1.url;\n\n\t\tvar active = this.getMatchingChildren(children, url, true);\n\n\t\tvar current = active[0] || null;\n\t\tthis._didRoute = !!current;\n\n\t\tvar previous = this.previousUrl;\n\t\tif (url!==previous) {\n\t\t\tthis.previousUrl = url;\n\t\t\tif (typeof onChange==='function') {\n\t\t\t\tonChange({\n\t\t\t\t\trouter: this,\n\t\t\t\t\turl: url,\n\t\t\t\t\tprevious: previous,\n\t\t\t\t\tactive: active,\n\t\t\t\t\tcurrent: current\n\t\t\t\t});\n\t\t\t}\n\t\t}\n\n\t\treturn current;\n\t};\n\n\treturn Router;\n}(Component));\n\nvar Link = function (props) { return (\n\th('a', assign({ onClick: handleLinkClick }, props))\n); };\n\nvar Route = function (props) { return h(props.component, props); };\n\nRouter.subscribers = subscribers;\nRouter.getCurrentUrl = getCurrentUrl;\nRouter.route = route;\nRouter.Router = Router;\nRouter.Route = Route;\nRouter.Link = Link;\n\nexport { subscribers, getCurrentUrl, route, Router, Route, Link };export default Router;\n//# sourceMappingURL=preact-router.es.js.map\n\n\n\n// WEBPACK FOOTER //\n// ../node_modules/preact-router/dist/preact-router.es.js","import style from \"./panel.css\";\nimport { Component } from 'preact';\n\nexport default class Panel extends Component {\n\tgetStyle() {\n\t\treturn style.panel;\n\t};\n\n\trender() {\n\t\tlet title = null;\n\t\tif(this.props.title !== undefined) {\n\t\t\ttitle = ({this.props.title}
);\n\t\t}\n\n\t\treturn (\n\t\t\t\n\t\t\t\t{title}\n\t\t\t\t{this.props.children}\n\t\t\t\n\t\t);\n\t}\n}\n\n\n\n// WEBPACK FOOTER //\n// ./components/panel.js","import style from \"./split.css\";\nimport { Component } from 'preact';\n\nexport default class Split extends Component {\n\trender() {\n\t let title = null;\n\t if(this.props.title !== undefined) {\n title = ({this.props.title}
)\n }\n\n let children;\n if(Array.isArray(this.props.children)) {\n children = this.props.children.map(element => {\n return ({element});\n });\n }\n else {\n children = {this.props.children};\n }\n\t\treturn (\n\t \n {title}\n {children}\n \n );\n\t}\n}\n\n\n\n// WEBPACK FOOTER //\n// ./components/split.js","import style from \"./todo.css\";\r\nimport { Component } from 'preact';\r\n\r\nexport default class Todo extends Component {\r\n\trender() {\r\n\t\treturn {this.props.children};\r\n\t}\r\n}\r\n\n\n\n// WEBPACK FOOTER //\n// ./components/todo.js","import style from './home.css'\r\nimport { Component } from 'preact';\r\nimport Panel from '../components/panel';\r\nimport Split from '../components/split';\r\nimport Todo from '../components/todo';\r\n\r\nexport default class Home extends Component {\r\n render() {\r\n return (\r\n \r\n Indice
\r\n \r\n Statistica ed elementi di probabilità}>\r\n \r\n Appunti scritti mentre studiavo per l'esame di Statistica ed elementi di probabilità del corso triennale di Informatica all'Unimore del Prof. Luca La Rocca.\r\n
\r\n \r\n Cleaver}>\r\n \r\n Progetto in Java sviluppato per l'esame di Programmazione ad Oggetti del corso triennale di Informatica all'Unimore, tenuto dai Prof. Giacomo Cabri e Nicola Capodieci.\r\n
\r\n \r\n Fisica}>\r\n \r\n Appunti delle lezioni di Fisica del corso triennale di Informatica all'Unimore, tenute dalla Prof.ssa Rossella Brunetti nel primo semestre dell'Anno Accademico 2019/2020.\r\n
\r\n \r\n Sistemi Operativi}>\r\n \r\n Soluzioni agli Arzigogoli proposti dal Prof. Mauro Andreolini durante le lezioni di Sistemi Operativi del corso triennale di Informatica all'Unimore tenutesi nel primo semestre dell'Anno Accademico 2019/2020.\r\n
\r\n \r\n Algoritmi e Strutture Dati}>\r\n \r\n Appunti delle lezioni di Algoritmi e Strutture Dati del corso triennale di Informatica all'Unimore, tenute dalla Prof.ssa Manuela Montangero nel secondo semestre dell'Anno Accademico 2018/2019.\r\n
\r\n \r\n Videolezioni di Geometria}>\r\n \r\n Ottime videolezioni di Geometria con licenza CC BY-NC-SA 4.0 che ho trovato sul portale Dolly 2018 dell'Unimore.\r\n
\r\n \r\n Come installare MinGW}>\r\n \r\n Un breve tutorial con immagini su come installare e configurare MinGW per compilare programmi C e C++ su Windows.\r\n
\r\n \r\n \r\n \r\n @unimoreinfo}>\r\n \r\n Il gruppo Telegram del corso di Informatica dell'Unimore!\r\n
\r\n \r\n Calendario Lezioni}>\r\n \r\n Calendario Google quasi sempre aggiornato delle lezioni e degli esami del secondo anno dell'Unimore durante l'Anno Accademico 2019/2020.\r\n
\r\n \r\n Erre2}>\r\n \r\n Portale contenente appunti e riassunti mantenuto da Lorenzo Balugani.\r\n
\r\n \r\n vezzalinistefano/Appunti-Algoritmi}>\r\n \r\n Appunti di Algoritmi e Strutture Dati mantenuti da Vezzalini Stefano.\r\n
\r\n \r\n \r\n \r\n )\r\n }\r\n}\r\n\n\n\n// WEBPACK FOOTER //\n// ./pages/home.js","import style from './latex.css';\nimport { Component } from 'preact';\n\nexport default class Latex extends Component {\n\trender() {\n\t\tlet equation = `{\\\\color{White} ${this.props.children} }`;\n\t\treturn (\n\t\t\t
);\n\t}\n}\n\n\n// WEBPACK FOOTER //\n// ./components/latex.js","import style from \"./plus.css\";\r\nimport { Component } from 'preact';\r\n\r\nexport default class Plus extends Component {\r\n\trender() {\r\n\t\treturn {this.props.children};\r\n\t}\r\n}\r\n\n\n\n// WEBPACK FOOTER //\n// ./components/plus.js","import style from \"./minus.css\";\r\nimport { Component } from 'preact';\r\n\r\nexport default class Minus extends Component {\r\n\trender() {\r\n\t\treturn {this.props.children};\r\n\t}\r\n}\r\n\n\n\n// WEBPACK FOOTER //\n// ./components/minus.js","import style from './fisica.css';\nimport { Component } from 'preact';\nimport Latex from '../components/latex';\nimport Panel from '../components/panel';\nimport Split from '../components/split';\nimport Plus from '../components/plus';\nimport Minus from '../components/minus';\nimport Todo from '../components/todo';\n\nconst r = String.raw;\n\nexport default class Fisica extends Component {\n\trender() {\n return (\n \n Fisica
\n \n \n \n Usa le regole base della trigonometria:\n
\n \n {r`\\vec{v} = \\vec{v}_x + \\vec{v}_y`} \n
\n \n {r`\\left | \\vec{v}_x \\right | = \\left | \\vec{v} \\right | \\sin \\alpha`} \n
\n \n {r`\\left | \\vec{v}_y \\right | = \\left | \\vec{v} \\right | \\cos \\alpha`} \n
\n \n \n \n Scomponi in componenti, poi sommali:\n
\n \n {r`\\vec{v} + \\vec{w} = (\\vec{v}_x + \\vec{w}_x) + (\\vec{v}_y + \\vec{w}_y)`} \n
\n \n Produce il vettore risultante dall'applicazione della regola del parallelogramma.\n
\n \n \n \n Alla fine è sempre una somma:\n
\n \n {r`\\vec{v} - \\vec{w} = (\\vec{v}_x - \\vec{w}_x) + (\\vec{v}_y - \\vec{w}_y)`} \n
\n \n Produce il vettore che parte da w e arriva a v .\n
\n \n \n \n Si chiama scalare perchè il risultato è uno scalare, non un vettore.\n
\n \n {r`\\vec{v} \\cdot \\vec{w} = \\left | \\vec{v} \\right | \\left | \\vec{w} \\right | \\cos \\alpha`} \n
\n \n Produce il modulo della proiezione di {r`\\vec{a}`} su {r`\\vec{b}`} .\n
\n \n \n \n Si chiama vettoriale perchè il risultato è un altro vettore.\n
\n \n {r`\\vec{c} = \\vec{a} \\times \\vec{b}`} {r`\\left | \\vec{c} \\right | = \\left | \\vec{a} \\right | \\cdot \\left | \\vec{b} \\right | \\cdot \\sin(\\alpha)`} - Regola della mano destra
\n
\n \n Non è commutativo!\n
\n \n \n \n \n \n Se un corpo puntiforme ha forza risultante nulla, allora la sua velocità non cambia.\n
\n \n {r`\\Sigma \\vec{F} = 0 \\Longleftrightarrow \\Delta v = 0`} \n
\n \n \n \n La forza risultante di un corpo è direttamente proporzionale alla sua accelerazione, e la costante di proporzionalità è la massa.\n
\n \n {r`\\Sigma \\vec{F} = m \\vec{a}`} \n
\n \n \n \n Due corpi esercitano forze uguali e opposte uno sull'altro. \n
\n \n {r`\\vec{F}_{21} = -\\vec{F}_{12}`} \n
\n \n \n \n \n \n Due corpi puntiformi si attirano uno verso l'altro con forza:\n
\n \n {r`\\left | \\vec{F} \\right | = G \\frac{m_1 m_2}{s^2}`} \n
\n \n G è la costante di gravitazione universale e vale:\n
\n \n {r`G = 6.67 \\cdot 10^{-11} \\frac{N m^2}{{kg}^2}`} \n
\n \n \n \n Se nel sistema di riferimento consideriamo la Terra ferma, allora un corpo è attratto verso la Terra con forza peso uguale a:\n
\n \n {r`\\left | \\vec{F} \\right | = g m`} \n
\n \n g è la costante di gravità della Terra, e vale:\n
\n \n {r`g = 9.81 \\frac{m}{s^2}`} \n
\n \n \n \n Per pianeti diversi dalla Terra vale la stessa regola:\n
\n \n {r`\\left | \\vec{F} \\right | = g m`} \n
\n \n L'unica differenza è che cambia la costante di gravità:\n
\n \n {r`g_{luna} = 1.62 \\frac{m}{s^2}`} \n
\n \n {r`g_{marte} = 3.71 \\frac{m}{s^2}`} \n
\n \n \n \n \n \n Si oppone alle forze applicate alla superficie di contatto.\n
\n \n Un libro appoggiato su un tavolo ha la forza di gravità che lo attira verso il terreno e la forza normale che lo trattiene dal cadere. \n
\n \n \n \n Impedisce a un corpo di muoversi se non viene spinto da una forza che supera una certa soglia:\n
\n \n {r`\\left | \\vec{F} \\right | \\leq \\mu_{s} \\left | \\vec{F}_{normale} \\right |`} \n
\n \n \n \n Rallenta i corpi che si stanno muovendo finchè essi non si fermano:\n
\n \n {r`\\left | \\vec{F} \\right | \\leq \\mu_{d} \\left | \\vec{F}_{normale} \\right |`} \n
\n \n \n \n E' forza trasmessa tra due estremi di una fune.\n
\n \n Può essere redirezionata per mezzo di carrucole.\n
\n \n \n \n Una molla cerca sempre di tornare alla sua posizione indeformata con forza:\n
\n \n {r`F = -k x`} \n
\n \n (E' negativa perchè la forza è opposta a quella applicata per deformarla.)\n
\n \n \n \n \n \n È un vettore che indica la posizione di un corpo rispetto a un'origine.\n
\n \n {r`\\Delta \\vec{s} = \\vec{s}(fine) - \\vec{s}(inizio)`} \n
\n \n \n \n È un vettore che misura la variazione di posizione nel tempo.\n
\n \n {r`\\vec{v} = \\frac{\\Delta \\vec{s}}{\\Delta t}`} \n
\n \n Se si considera un intervallo di tempo infinitesimale si dice velocità istantanea:\n
\n \n {r`\\vec{v} = \\lim_{\\Delta t \\to 0} \\frac{\\Delta \\vec{s}}{\\Delta t} = \\frac{d \\vec{s}}{dt}`} \n
\n \n \n \n È un vettore che misura la variazione di velocità nel tempo.\n
\n \n {r`\\vec{a} = \\frac{\\Delta \\vec{v}}{\\Delta t}`} \n
\n \n Se si considera un intervallo di tempo infinitesimale si dice accelerazione istantanea:\n
\n \n {r`\\vec{a} = \\lim_{\\Delta v \\to 0} \\frac{\\Delta \\vec{v}}{\\Delta t} = \\frac{d \\vec{v}}{d t} = \\frac{d^2 \\vec{s}}{d t^2}`} \n
\n \n Quantità di moto (momento lineare)}>\n \n La quantità di moto è una proprietà vettoriale dei corpi:\n
\n \n {r`\\vec{p} = m \\vec{v}`} \n
\n \n Se la forza risultante è nulla, la quantità di moto non cambia.\n
\n \n {r`\\Sigma \\vec{F} = 0 \\Longleftrightarrow \\Delta \\vec{p} = 0`} \n
\n \n \n \n \n \n La legge oraria è:\n
\n \n {r`s(t) = v \\cdot \\Delta t + s(0)`} \n
\n \n \n \n È costante:\n
\n \n {r`v(t) = k`} \n
\n \n \n \n La velocità non varia:\n
\n \n {r`a(t) = 0`} \n
\n \n \n \n Si applica la prima legge di Newton:\n
\n \n f(t) = 0 \n
\n \n \n \n \n \n La legge oraria è:\n
\n \n {r`s(t) = \\frac{1}{2} a \\cdot (\\Delta t)^2 + v(0) \\cdot (\\Delta t) + s(0)`} \n
\n \n \n \n È una retta:\n
\n \n {r`v(t) = a \\Delta t + v(0)`} \n
\n \n \n \n È costante:\n
\n \n {r`a(t) = k`} \n
\n \n \n \n Si applica la prima legge di Newton:\n
\n \n f(t) = m a \n
\n \n \n \n \n \n E' la distanza dal centro massima che raggiunge il corpo.\n
\n \n (L'ampiezza di una sinusoide.)\n
\n \n \n \n Indica quanto in fretta cambia la posizione del corpo. \n
\n \n Dipende dal periodo:\n
\n \n {r`\\omega = \\frac{2 \\pi}{T}`} \n
\n \n \n \n E' una sinusoide:\n
\n \n {r`s(t) = A \\sin (\\omega \\cdot t + \\phi)`} \n
\n \n \n \n E' la sinusoide dello spostamento, sfasata di {r`\\frac{\\pi}{2}`} :\n
\n \n {r`v(t) = A \\sin (\\omega \\cdot t + \\phi + \\frac{\\pi}{2})`} \n
\n \n \n \n E' la sinusoide della velocità, sfasata di {r`\\pi`} :\n
\n \n {r`a(t) = A \\sin (\\omega \\cdot t + \\phi + \\pi)`} \n
\n \n \n \n Si applica la prima legge di Newton:\n
\n \n f(t) = m a \n
\n \n \n \n \n \n Il moto parabolico è dato sommando un moto rettilineo uniforme sull'asse orizzontale e un moto rettilineo uniformemente accelerato sull'asse verticale.\n
\n \n \n \n Il moto parabolico è dato sommando due moti armonici semplici: uno sull'asse X, e l'altro, sfasato di {r`\\frac{\\pi}{2}`} , sull'asse Y.\n
\n \n \n \n \n \n Velocità angolare\n
\n \n Quanto cambia la fase nel tempo.\n
\n \n {r`\\omega = \\frac{2 \\pi}{T}`} \n
\n \n \n \n E' l'angolo percorso dal corpo rispetto alla posizione iniziale.\n
\n \n Si indica con {r`\\phi`} , e generalmente si usa in radianti.\n
\n \n \n \n Si applicano le formule per la circonferenza:\n
\n \n {r`v = \\frac{\\Delta s}{t} = \\frac{2 \\pi \\cdot r}{T} = \\omega r`} \n
\n \n \n \n Il corpo ha sempre un accelerazione verso il centro che gli impedisce di abbandonare il moto: \n
\n \n {r`a = \\frac{v^2}{r} = r \\cdot \\omega^2 = v \\cdot \\omega`} \n
\n \n \n \n È verso il centro e si calcola con:\n
\n \n {r`F = m \\cdot a`} \n
\n \n \n \n \n \n E' compiuto da una forza che sposta un corpo.\n
\n \n {r`W = \\vec{F} \\cdot \\vec{s} = F \\cdot \\Delta s \\cdot cos(\\alpha )`} \n
\n \n (Se la forza non è parallela allo spostamento, il prodotto scalare ci fa considerare solo la componente parallela.)\n
\n \n \n \n Un corpo ha energia cinetica in ogni momento uguale a:\n
\n \n {r`E_c = \\frac{1}{2} m v^2`} \n
\n \n Se una forza effettua lavoro su un corpo, cambia la sua energia cinetica pari al lavoro effettuato:\n
\n \n {r`\\Delta E_c = W`} \n
\n \n \n \n Un corpo ha energia potenziale in ogni momento pari a: \n
\n \n {r`E_{p_g} = m \\cdot g \\cdot h`} \n
\n \n (Con h uguale a un altezza scelta come punto di riferimento.)\n
\n \n \n \n Una molla ha sempre energia potenziale elastica pari a:\n
\n \n {r`E_{p_e} = \\frac{1}{2} k x^2`} \n
\n \n \n \n Sono conservative le forze per le quali il lavoro compiuto non dipende dal percorso seguito per andare dalla partenza all'arrivo.\n
\n \n Ad esempio, è conservativa la forza di gravità, ma non è conservativa la forza di attrito.\n
\n \n Se in un sistema ci sono solo forze conservative, allora l'energia meccanica totale si conserva:\n
\n \n {r`E = E_k + E_p`} \n
\n \n \n \n È la velocità di trasferimento di energia:\n
\n \n {r`P = \\frac{\\Delta E}{\\Delta t}`} \n
\n \n \n \n \n \n È una proprietà dei corpi che può essere positiva o negativa .\n
\n \n Si conserva: in un sistema chiuso la carica totale è costante.\n
\n \n Esiste un'unità elementare: {r`C_{elettrone} = 1.602 \\cdot 10^{-19}`} .\n
\n \n Cariche opp oste si attraggono; cariche uguali si respingono.\n
\n \n \n \n Più ioni ha un corpo, meglio la carica si muove attraverso di esso.\n
\n \n I corpi in cui la carica si muove bene sono conduttori, mentre quelli in cui si muove difficilmente sono isolanti.\n
\n \n Il corpo umano è un buon conduttore.\n
\n \n \n \n \n \n E' possibile polarizzare un corpo per accumulare la carica di un segno in una certa zona.\n
\n \n \n \n \n \n Se un corpo conduttore è in contatto con la Terra, le cariche su di esso saranno equilibrate e il corpo diventerà elettricamente neutro (con stesso numero di cariche positive e negative all'interno).\n
\n \n \n \n \n \n Strofinando tra loro due corpi isolanti, essi si polarizzeranno per strofinio.\n
\n \n \n \n Toccando un conduttore con un corpo carico, il conduttore potrà polarizzarsi per contatto.\n
\n \n \n \n Se un corpo conduttore ha cariche \"esterne\" di un certo segno vicino, esso avrà tutte le cariche del segno opposto in equilibrio vicino alle cariche esterne, e tutte le cariche dello stesso segno più lontano possibile da esse.\n
\n \n Mettendo a terra il conduttore, nuove cariche del segno opposto saranno attratte all'interno del corpo per equilibrare le cariche che si sono allontanate.\n
\n \n Staccando il conduttore da terra e rimuovendo le cariche esterne, esso si ritroverà caricato del segno opposto rispetto alle cariche esterne.\n
\n \n \n \n \n \n Due corpi carichi si attraggono tra loro con forza: \n
\n \n {r`\\left | \\vec{F}_{elettrica} \\right | = \\frac{-k \\cdot q_1 \\cdot q_2}{s^2}`} \n
\n \n {r`k`} è la costante di Coulomb, e vale {r`k = 8.99 \\cdot 10^9 \\frac{N \\cdot m^2}{C^2}`} .\n
\n \n \n \n La costante {r`k`} è in realtà dipendente da un altra costante, {r`\\epsilon_0`} , la permeabilità del vuoto.\n
\n \n {r`k = \\frac{1}{4 \\pi \\cdot \\epsilon_0}`} \n
\n \n {r`\\left | \\vec{F}_{elettrica} \\right | = \\frac{q_1 \\cdot q_2}{4 \\pi \\cdot \\epsilon_0 \\cdot s^2}`} \n
\n \n \n \n Misura che forza viene applicata in ogni punto su una carica unitaria:\n
\n \n {r`\\vec{E} = \\frac{\\vec{F}_{elettrica}}{q} = \\frac{-k \\cdot q}{s^2}`} \n
\n \n \n \n È la differenza tra \"quanto\" campo elettrico entra e quanto campo elettrico esce da una certa area.\n
\n \n In qualsiasi superficie chiusa, il flusso elettrico è uguale alla componente perpendicolare del campo elettrico moltiplicato per l'area.\n
\n \n {r`\\Phi_E = \\vec{E} \\cdot \\vec{A}`} \n
\n \n Se il campo elettrico è uniforme, se ne può calcolare facilmente il valore:\n
\n \n {r`\\Phi_E = \\vec{E} \\cdot \\vec{A} = E_\\perp \\cdot A \\cdot \\cos(\\alpha)`} \n
\n \n Circa. E' una specie di integrale... \n
\n \n \n \n Il flusso elettrico è direttamente proporzionale alla carica presente all'interno della superficie.\n
\n \n {r`\\Phi_E = 4 \\pi \\cdot k \\cdot q = \\frac{q}{\\epsilon_0}`} \n
\n \n Ovvero, i campi elettrostatici sono generati dalle cariche elettriche.\n
\n \n \n \n \n \n Un corpo carico vicino ad altre cariche possiede un'energia potenziale elettrica {r`U_e`} .\n
\n \n \n \n Potenziale elettrico (tensione)}>\n \n È il valore dell'energia potenziale elettrica per una carica unitaria.\n
\n \n {r`V = \\frac{U_e}{q}`} \n
\n \n La sua unità di misura è il Volt ({r`V`} ).\n
\n \n In una batteria è detto forza elettromotrice, e corrisponde al lavoro compiuto da una batteria ideale per spostare una carica unitaria tra i due poli.\n
\n \n Corrente elettrica (intensità)}>\n \n Quanta carica passa attraverso un'area (perpendicolare al flusso) nel tempo.\n
\n \n {r`I = \\frac{\\Delta q}{\\Delta t}`} \n
\n \n Fintanto che c'è differenza di potenziale, ci sarà anche intensità non nulla.\n
\n \n La sua unità di misura è l'Ampere ({r`A`} ).\n
\n \n Corrente continua (DC)}>\n \n Quando in un circuito la direzione della corrente è costante.\n
\n \n Corrente alternata (AC)}>\n \n Quando in un circuito la direzione della corrente si alterna periodicamente.\n
\n \n \n \n Possiamo calcolare la potenza di un circuito:\n
\n \n {r`P = \\frac{\\Delta U_e}{\\Delta t} = I \\cdot \\Delta V = I^2 \\cdot R = \\frac{(\\Delta V)^2}{R}`} \n
\n \n \n \n \n \n Riduce l'intensità di corrente, e converte parte del potenziale in calore.\n
\n \n Il potenziale utilizzato è pari a:\n
\n \n {r`V = R \\cdot I`} \n
\n \n Dove {r`R`} è una costante detta resistenza con unità di misura Ohm ({r`\\Omega`} ).\n
\n \n La resistenza di un conduttore vale:\n
\n \n {r`R = \\rho \\frac{L_{unghezza}}{A_{rea}}`} \n
\n \n {r`\\rho`} è la resistività del materiale, e varia in base alla temperatura:\n
\n \n {r`\\rho = \\rho_0 (1 + \\alpha(T - T_0))`} \n
\n \n \n \n Immagazzina potenziale elettrico, permettendo di riutilizzarla in seguito.\n
\n \n Per farlo, cattura cariche positive e negative sulle sue due armature; perchè questo avvenga, deve essere compiuto lavoro.\n
\n \n Ha una capacità caratteristica, che in un condensatore a facce piane parallele è:\n
\n \n {r`C = \\frac{q_{massima}}{\\Delta V}`} \n
\n \n Condensatori di capacità maggiore immagazzinano più potenziale con meno carica.\n
\n \n La capacità aumenta se viene messo qualcosa tra le armature:\n
\n \n {r`C_{nuova} = \\kappa \\cdot \\frac{\\epsilon_0 \\cdot A}{s}`} \n
\n \n Dove {r`\\kappa`} è la costante dielettrica relativa del materiale inserito, {r`A`} l'area di una armatura e {r`s`} la distanza tra le due armature.\n
\n \n Se il campo elettrico creatosi tra le due armature supera la rigidità dielettrica del condensatore, la carica immagazzinata viene persa e ha luogo un breakdown.\n
\n \n La sua unità di misura è il Farad ({r`Fa`} )\n
\n \n \n \n Misura la corrente elettrica se messo in serie.\n
\n \n (Funzionamento: ha una resistenza interna bassisima in modo da non influire significativamente sulla corrente.)\n
\n \n \n \n Misura la differenza di potenziale se messo in parallelo.\n
\n \n (Funzionamento: ha una resistenza altissima in modo da non influire significativamente sulla tensione.)\n
\n \n \n \n \n \n Per nodo si intende un qualsiasi punto del circuito.\n
\n \n Da un nodo entra ed esce la stessa corrente.\n
\n \n \n \n Per maglia si intende un qualsiasi percorso chiuso all'interno del circuito.\n
\n \n In una maglia chiusa, la somma delle differenze di potenziale è 0.\n
\n \n \n \n \n \n Più parti di circuito sono in serie se sono consecutive e senza biforcazioni.\n
\n \n Parti di circuito in serie sono attraversate dalla stessa corrente.\n
\n \n \n \n Più parti di circuito sono in parallelo tra loro se hanno lo stesso punto di partenza e lo stesso punto di arrivo. \n
\n \n Parti di circuito in parallelo hanno la stessa differenza di potenziale.\n
\n \n \n \n \n \n Nei circuiti in serie, tutte le resistenze possono essere sostituite con una equivalente dalla resistenza della somma di tutte le quelle sostituite:\n
\n \n {r`R_{serie} = \\sum_{i=1}^{n} R_i`} \n
\n \n \n \n Nei circuiti in parallelo, tutte le resistenze possono essere sostituite con una equivalente dalla resistenza di:\n
\n \n {r`R_{parallelo} = \\frac{1}{\\sum_{i=1}^{n} \\frac{1}{R_i}}`} \n
\n \n \n \n \n \n Nei circuiti in serie, tutti i condensatori possono essere sostituiti con uno equivalente dalla capacità di:\n
\n \n {r`C_{serie} = \\frac{1}{\\sum_{i=1}^{n} \\frac{1}{C_i}}`} \n
\n \n \n \n Nei circuiti in parallelo, tutte i condensatori possono essere sostituite con uno equivalente dalla capacità della somma di tutti quelli sostituiti:\n
\n \n {r`C_{parallelo} = \\sum_{i=1}^{n} C_n`} \n
\n \n \n \n \n \n E' una costante fisica fondamentale che rappresenta quanto un materiale si magnetizza facilmente.\n
\n \n {r`\\mu_0 = 4 \\pi \\cdot 10^{-7} \\frac{H}{m}`} ({r`\\frac{N}{A^2}`} )\n
\n \n \n \n Come un campo elettrico, ma per i magneti.\n
\n \n Il suo simbolo è {r`B`} , e la sua unità di misura è il Tesla (T ).\n
\n \n \n \n È \"quanto\" campo magnetico attraversa un percorso chiuso.\n
\n \n Per qualsiasi percorso chiuso, il flusso magnetico è uguale alla somma di tutti i \"sottoflussi\" magnetici calcolati sui suoi lati.\n
\n \n {r`\\Phi_{B_{i}} = \\vec{B} \\cdot \\vec{L}_n = B \\cdot L_i \\cdot \\sin(\\alpha) = B_\\parallel \\cdot L_i`} \n
\n \n {r`\\Phi_{B} = \\sum_{i=0}^{n_{lati}} \\Phi_{Bn}`} \n
\n \n La sua unità di misura è il Weber ({r`Wb = T \\cdot m^2`} ).\n
\n \n \n \n Il flusso magnetico attraverso qualsiasi superficie chiusa è sempre nullo.\n
\n \n Ovvero, non esistono monopoli magnetici.\n
\n \n \n \n L'intensità di corrente che attraversa un percorso chiuso è direttamente proporzionale al flusso magnetico dello stesso percorso.\n
\n \n {r`\\Phi_B = \\mu_0 \\cdot I`} \n
\n \n \n \n Forza magnetica su carica puntiforme (Forza di Lorentz)}>\n \n I campi magnetici applicano una forza sulle cariche vicine:\n
\n \n {r`\\vec{F}_{B} = q \\cdot (\\vec{v} \\times \\vec{B})`} \n
\n \n Dove {r`\\vec{B}`} è l'intensità del campo magnetico e {r`\\vec{v}`} la velocità della carica considerata.\n
\n \n Si ha una forza massima se la velocità è perpendicolare al campo magnetico.\n
\n \n In un campo magnetico uniforme, una velocità perpendicolare al campo porta alla creazione di un moto circolare uniforme.\n
\n \n \n \n I campi magnetici influenzano ovviamente anche le cariche presenti in un conduttore:\n
\n \n {r`\\vec{F}_{magnetica} = I \\cdot (\\vec{L} \\times \\vec{B})`} [1]\n
\n \n Dove {r`I`} è la corrente elettrica, {r`\\vec{L}`} è un vettore che punta nella direzione di scorrimento della corrente e ha come modulo la lunghezza del conduttore.\n
\n \n \n \n \n \n Una spira in cui passa corrente produce un campo magnetico perpendicolare al piano creato dalla spira.\n
\n \n \n \n Un solenoide sono tante spire avvolte in modo da formare una specie di cilindro.\n
\n \n All'interno del solenoide si crea un campo (quasi) uniforme:\n
\n \n {r`\\left | \\vec{B} \\right | = \\mu_0 \\cdot I \\cdot \\frac{A_{vvolgimenti}}{L_{unghezzafilo}}`} \n
\n \n \n \n Caso particolare della Legge di Ampère.\n
\n \n Il modulo del campo magnetico B prodotto da un filo in cui passa una corrente continua I alla distanza s è:\n
\n \n {r`\\left | \\vec{B} \\right | = \\frac{\\mu \\cdot I}{2 \\pi r}`} \n
\n \n Il campo magnetico così creato gira attorno al filo in senso antiorario.\n
\n \n Due fili attraversati dalla stessa corrente si attraggono, due fili attraversati da corr enti opp oste si respingono.\n
\n \n \n \n \n \n Un conduttore perpendicolare ad un campo magnetico può ottenere una differenza di potenziale se messo in movimento in un direzione perpendicolare alla direzione del conduttore e del campo. \n
\n \n La differenza di potenziale si crea a causa della forza magnetica, che fa spostare tutti gli elettroni verso un capo del conduttore. \n
\n \n Essa vale:\n
\n \n {r`\\Delta V_{indotta} = v \\cdot B \\cdot L`} \n
\n \n Dove v è la velocità del conduttore, B è l'intensità del campo magnetico ed L è la lunghezza del conduttore.\n
\n \n \n \n In un campo magnetico {r`B`} uniforme e perpendicolare al piano di una spira di area {r`A`} , il flusso magnetico si può determinare con la Legge di Faraday-Neumann-Lenz:\n
\n \n {r`\\Phi_B = \\vec{B} \\cdot \\vec{A} = B \\cdot A \\cdot \\cos(\\alpha)`} \n
\n \n \n \n \n \n Dice che la forza elettromotrice media indotta in un percorso dipende dalla variazione nel tempo del flusso magnetico nello stesso percorso.\n
\n \n {r`\\Delta V_{indotta} = - \\frac{\\Delta \\Phi_B}{\\Delta t}`} \n
\n \n Il meno è dovuto alla Legge di Lenz, che specifica qualitativamente il verso della forza elettromotrice indotta.\n
\n \n \n \n In un solenoide, la forza elettromotrice indotta è uguale a:\n
\n \n {r`\\Delta V_{indotta} = - \\frac{N \\cdot \\Delta \\Phi_{B_{spira}}}{\\Delta t} = - \\frac{N \\cdot B \\cdot A \\cdot cos(\\alpha)}{\\Delta t}`} \n
\n \n Dove {r`N`} è il numero delle spire del solenoide.\n
\n \n \n \n Correnti o campi elettrici variabili creano un campo magnetico.\n
\n \n \n \n \n \n Nel vuoto, il campo elettrico {r`E`} e il campo magnetico {r`B`} sono perpendicolari tra loro e la direzione di propagazione, e sono entrambe funzioni del tempo.\n
\n \n Si dice quindi che sono onde elettromagnetiche.\n
\n \n Esse sono legate dalla relazione:\n
\n \n {r`E = c \\cdot B`} \n
\n \n Dove {r`c`} è la velocità delle onde (luce) nel vuoto, e a sua volta è uguale a:\n
\n \n {r`c = \\frac{1}{\\sqrt{\\epsilon_0 \\cdot \\mu_0}} = 3.00 \\cdot 10^8 \\frac{m}{s}`} \n
\n \n \n \n {r`A(t) = A_{max} \\cdot \\sin \\left ( \\frac{2 \\pi}{\\lambda} - \\omega t + \\phi \\right )`} \n
\n \n Dove {r`A_{max}`} è l'ampiezza massima che può avere l'onda, {r`\\frac{2 \\pi}{\\lambda} = \\left | \\vec{k} \\right |`} è il vettore d'onda, {r`\\omega`} la frequenza angolare e {r`\\phi`} la fase.\n
\n \n \n \n \n \n I solidi, se portati ad alta temperatura, emettono luce con uno spettro continuo.\n
\n \n I gas, invece, ad alta temperatura emettono luce solo con particolari lunghezze d'onda. \n
\n \n In un gas di idrogeno, le lunghezze d'onda emesse sono ricavabili con:\n
\n \n {r`\\frac{1}{\\lambda} = R \\left ( \\frac{1}{4} - \\frac{1}{n^2} \\right )`} \n
\n \n Con {r`R = 1.097 \\cdot 10^7 \\frac{1}{m}`} , detta costante di Rydberg, e {r`n`} un numero intero.\n
\n \n \n \n Una grandezza si dice quantizzata (o discreta) se può assumere solo determinati valori. \n
\n \n Una grandezza si dice continua se può assumere qualsiasi valore e quindi se non è quantizzata.\n
\n \n Energia, momento angolare e raggio sono quantizzati.\n
\n \n Nota costante quantica è {r`h`} , la costante di Planck, ovvero il valore minimo possibile per la carica (talvolta espressa come {r`\\hbar = \\left ( \\frac{h}{2 \\pi} \\right )`} .\n
\n \n \n \n \n \n L'energia degli elettroni è quantizzata.\n
\n \n Inoltre, per essi è valido che:\n
\n \n {r`m \\cdot v_n \\cdot 2 \\pi \\cdot r = n \\cdot h`} \n
\n \n Ancora, il raggio delle orbite è uguale a:\n
\n \n {r`r_n = n^2 \\cdot a_0 = n^2 \\cdot \\frac{\\hbar}{m_{elettrone} \\cdot k \\cdot e^2} `} \n
\n \n Con {r`a_0 = \\left ( \\frac{h}{2 \\pi} \\right )^2 \\cdot \\frac{1}{m_{elettrone} \\cdot k \\cdot e^2} = 5.29 \\cdot 10^{-11} m`} .\n
\n \n Infine, in ogni stato, l'energia è pari a:\n
\n \n {r`E_n = \\frac{1}{n^2} \\cdot E_1 = - \\frac{1}{n^2} \\cdot \\frac{a_0^2}{2 \\cdot m \\cdot \\hbar^4} = - \\frac{1}{n^2} \\cdot \\frac{m_{elettrone} \\cdot k^2 \\cdot e^4}{2 \\cdot \\hbar^2}`} \n
\n \n Due elettroni non possono occupare lo stesso stato.\n
\n \n Questo modello funziona solo per atomi con numero atomico basso. Atomi con molti elettroni hanno comportamenti diversi, descritti dal modello di\n
\n \n \n \n \n \n Nei solidi, le lunghezze d'onda sono talmente tanto vicine da poter essere considerate una banda.\n
\n \n Possono però comunque avere dei gap dovuti agli intervalli di energia non ammessi.\n
\n \n \n \n \n \n Refactor this \n
\n \n Se la banda di emissione con energia più alta di un corpo è assente o è separata da un gap dell'ordine di grandezza maggiore di {r`10^1 eV`} , allora il corpo è un isolante.\n
\n \n Se invece la banda di emissione si sovrappone a un altra, allora il corpo è un conduttore.\n
\n \n Se il gap è invece dell'ordine di grandezza di {r`1 eV`} , allora il corpo è un semiconduttore.\n
\n \n \n \n Legami in cui mancano elettroni .\n
\n \n Elettroni di altri legami possono spostarsi per colmare le lacune , creandone altre, e spostandole in direzione opposta a quella della corrente.\n
\n \n \n \n Se si inserisce in un cristallo semiconduttore si inserisce un atomo con numero atomico diverso, si otterrà:\n
\n \n - Con numero atomico maggiore, un semiconduttore di
tipo N con elettroni in eccesso liberi di scorrere. \n - Con numero atomico minore, un semiconduttore di
tipo P con lacune in eccesso libere di catturare elettroni da altri legami. \n
\n \n Maggiore impurezza porta a maggiore conduttività.\n
\n \n \n \n Aumentando la temperatura di un semiconduttore si aumenta la conduttività, perchè eccita le particelle e favorisce il movimento di elettroni e lacune .\n
\n \n \n Ottica (non l'abbiamo fatta)}>\n \n \n I corpi possono assorbire o riflettere le onde elettromagnetiche che li colpiscono.\n
\n \n \n \n Un corpo nero è un corpo che assorbe tutte le onde elettromagnetiche che riceve senza rifletterne nessuna.\n
\n \n Le onde assorbite vengono poi riemesse sotto forma di un onda di {r`\\lambda`} variabile in base alla temperatura.\n
\n \n {r`\\lambda_{max} \\cdot T`} è costante.\n
\n \n \n \n L'energia assorbita e emessa dai corpi neri è quantizzata.\n
\n \n \n \n Un onda magnetica con un quanto di energia è detta fotone:\n
\n \n {r`E_{fotone} = h \\cdot f`} \n
\n \n \n \n A volte, i fotoni che colpiscono un metallo possono estrarvi degli elettroni e creare una differenza di potenziale.\n
\n \n Perchè avvenga, la frequenza deve essere maggiore di una certa soglia.\n
\n \n Il numero di elettroni estratti dipende dall'intensità dell'onda, mentre l'energia cinetica degli elettroni dipende dalla frequenza.\n
\n \n Non c'è nessun ritardo tra l'assorbimento del fotone e l'estrazione di elettroni.\n
\n \n \n \n )\n\t}\n}\n\n\n// WEBPACK FOOTER //\n// ./pages/fisica.js","import style from \"./markdown.css\";\nimport { Component } from 'preact';\nimport showdown from \"showdown\";\n\nexport default class Markdown extends Component {\n\trender() {\n let converter = new showdown.Converter();\n converter.setFlavor(\"github\");\n let html = converter.makeHtml(`${this.props.children}`);\n // noinspection CheckTagEmptyBody\n return ;\n\t}\n}\n\n\n\n// WEBPACK FOOTER //\n// ./components/markdown.js","import style from './vldigeometria.css';\r\nimport { Component } from 'preact';\r\nimport Markdown from '../components/markdown';\r\nimport Panel from '../components/panel';\r\n\r\nconst r = String.raw;\r\n\r\nexport default class VlDiGeometria extends Component {\r\n\trender() {\r\n\t\t//Imported from unimore-info-wiki\r\n\t\treturn (\r\n\t\t\t\r\n Videolezioni di Geometria
\r\n \r\n {r`\r\nTutte le videolezioni sono state pubblicate sotto licenza [CC BY-NC-SA 4.0](https://creativecommons.org/licenses/by-nc-sa/4.0/) dalla Prof.ssa Beatrice Ruini nell'anno accademico 2018/2019 sul [portale Dolly 2018](https://dolly.fim.unimore.it/2018/course/view.php?id=14#section-0) (Moodle).\r\n\r\nPer comodità, ho estratto l'url sorgente del video dall'embed presente nella rispettiva pagina.\r\n\r\n1. [Definizione di Spazio Vettoriale](https://www.youtube.com/watch?v=7eHEzf4403c) (1:17:29)\r\n2. [Sottospazi vettoriali I](https://www.youtube.com/watch?v=FPqrULk5HBU) (37:15)\r\n3. [Sottospazi vettoriali II](https://www.youtube.com/watch?v=ubDWUw9hk0k) (43:26)\r\n4. [Sottospazi vettoriali III](https://www.youtube.com/watch?v=381n4NPb6Oc) (40:29)\r\n5. [Lineare dipendenza e indipendenza](https://www.youtube.com/watch?v=9YVQ5olYrh0) (56:12)\r\n6. [Basi di uno spazio vettoriale I](https://www.youtube.com/watch?v=mEF_lcTzEoE) (25:52)\r\n7. [Basi di uno spazio vettoriale II](https://www.youtube.com/watch?v=k1r9JfXY53k) (48:24)\r\n8. [Teorema di Grassmann](https://www.youtube.com/watch?v=3sqB-MMyCWM) (32:36)\r\n9. [Basi e Matrici](https://www.youtube.com/watch?v=Rd6AB_jE7YI) (27:06)\r\n10. [Definizione di Applicazioni Lineari](https://www.youtube.com/watch?v=rmd7ffZeVYk) (16:23)\r\n11. [Proprietà delle Applicazioni Lineari](https://www.youtube.com/watch?v=MH7ztQGkqmw) (31:58)\r\n12. [Definizione di determinante](https://www.youtube.com/watch?v=EwubcLwBdzk) (36:43)\r\n13. [Proprietà e metodo di triangolazione](https://www.youtube.com/watch?v=SFusGarV6HI) (22:36)\r\n14. [Teorema di Laplace](https://www.youtube.com/watch?v=BqZDWnKl2nQ) (29:03)\r\n15. [4 applicazioni del Teorema di Laplace](https://www.youtube.com/watch?v=2tr3y725GY0) (47:53)\r\n16. [Spazi vettoriali euclidei reali - Parte 1](https://www.youtube.com/watch?v=W7Z1hm-jwMM) (28:46)\r\n17. [Spazi vettoriali euclidei reali - Parte 2](https://www.youtube.com/watch?v=zjmKE9TMGm8) (27:17)\r\n18. [Autovalori e autovettori](https://www.youtube.com/watch?v=XlrlcnvcTtQ) (33:00)\r\n19. [Polinomio caratteristico](https://www.youtube.com/watch?v=61icRbgWTdI) (31:31)\r\n20. [Teorema diagonalizzabilità](https://www.youtube.com/watch?v=wm5V6en9OFo) (18:49)\r\n21. [Spazi affini](https://player.vimeo.com/video/291457587) (20:46)\r\n22. [Sottospazi affini](https://player.vimeo.com/video/291458991) (21:32)\r\n23. [Parallelismo e Riferimenti Affini](https://player.vimeo.com/video/291510181) (16:57)\r\n24. [Rappresentazione di Sottospazi Affini](https://player.vimeo.com/video/291510296) (31:17)\r\n25. [Spazi Euclidei](https://player.vimeo.com/video/291510612) (35:57)\r\n26. [Teoria dei ranghi](https://player.vimeo.com/video/291510964) (9:44)\r\n27. [Teoria dei ranghi 2](https://player.vimeo.com/video/291510862) (14:44)\r\n\r\nNell'anno accademico 2018/2019 non sono stati trattati gli argomenti nei video 21, 22 e 23.\r\n `} \r\n \r\n\t\t\t\r\n\t\t);\r\n\t}\r\n}\r\n\r\n\n\n\n// WEBPACK FOOTER //\n// ./pages/vldigeometria.js","import style from './mingwinstall.css';\r\nimport { Component } from 'preact';\r\nimport Panel from '../components/panel';\r\n\r\nexport default class MingwInstall extends Component {\r\n\trender() {\r\n\t\t//Imported from unimore-info-wiki\r\n\t\treturn (\r\n\t\t\t\r\n Come installare MinGW
\r\n \r\n\t\t\t\t\t Scaricate l'installer ufficiale,\r\n\t\t\t\t\t\ted eseguitelo.
![\"\"/](\"https://i.imgur.com/mDZSqjV.png\")
\r\n\t\t\t\t\t Dovrebbe comparire questa schermata. Cliccate su Install, poi scegliete una cartella di installazione\r\n\t\t\t\t\t\t(ricordatevela!) e poi Continue. Lasciate stare le altre opzioni, dovrebbero essere tutte spuntate,\r\n\t\t\t\t\t\ttranne For all users, che dovrebbe essere disattivato.
![\"\"/](\"https://i.imgur.com/brdw8Xy.png\")
\r\n\t\t\t\t\t Aspettate che finisca il download. Pochi secondi dopo, dovrebbe finire e dovrebbe apparire un tasto\r\n\t\t\t\t\t\tContinue. Premetelo.
![\"\"/](\"https://i.imgur.com/aPTwrxz.png\")
\r\n\t\t\t\t\t Dovrebbe apparirvi questa finestra. L'installer di MinGW è una specie di gestore pacchetti (tipo apt su\r\n\t\t\t\t\t\tUbuntu); potete scegliere quali pacchetti installare, e quindi quali funzionalità.
![\"\"/](\"https://i.imgur.com/5QLSkFN.png\")
\r\n\t\t\t\t\t Nel nostro caso, dovrebbero servirci mingw32-base-bin (per il C e alcune librerie C++) e\r\n\t\t\t\t\t\tmingw32-gcc-g++-bin (per il C++). Cliccate, quindi, sui due quadratini corrispondenti, e premete\r\n\t\t\t\t\t\tMark for Installation. Dovrebbe comparire una freccia gialla sul quadratino.
![\"\"/](\"https://i.imgur.com/zP74nks.png\")
\r\n\t\t\t\t\t Ora, è il momento di installare i pacchetti. Aprite il menù Installation, poi premete\r\n\t\t\t\t\t\tApply Changes, e di nuovo Apply.
![\"\"/](\"https://i.imgur.com/jp4uz5B.png\")
\r\n\t\t\t\t\t Lasciate che scarichi, ci vorrà un po'. Guardatevi un video nel frattempo, fatevi una partitina a qualcosa, tornate\r\n\t\t\t\t\t\tdopo circa 10 minuti.
![\"\"/](\"https://i.imgur.com/Lq9IepY.png\")
\r\n\t\t\t\t\t Una volta installato, dobbiamo aggiungere g++ ai programmi eseguibili da Prompt dei Comandi: premete il\r\n\t\t\t\t\t\ttasto Windows, e scrivete PATH. Windows dovrebbe trovarvi automaticamente quell'opzione.
\r\n\t\t\t\t\t![\"\"/](\"https://i.imgur.com/dy3b5Ub.png\")
\r\n\t\t\t\t\t Dentro la finestra di Proprietà del Sistema, premete Variabili d'ambiente.
![\"\"/](\"https://i.imgur.com/FjYpT1n.png\")
\r\n\t\t\t\t\t Trovate la variabile d'ambiente globale Path, e fateci doppio click per modificarla.
![\"\"/](\"https://i.imgur.com/klZQ9So.png\")
\r\n\t\t\t\t\t Ora dovreste vedere l'elenco di tutte le cartelle contenenti programmi eseguibili da terminale: dobbiamo aggiungere\r\n\t\t\t\t\t\tquella di MinGW! Premete Sfoglia.
![\"\"/](\"https://i.imgur.com/F6lBCqS.png\")
\r\n\t\t\t\t\t Trovate la cartella in cui avete installato MinGW (vi avevo detto di ricordarvela!); entrateci, poi selezionate la\r\n\t\t\t\t\t\tsottocartella bin e premete OK su tutte le finestre che avete aperto fino ad ora,\r\n\t\t\t\t\t\tchiudendole.
\r\n\t\t\t\t\t Complimenti! Avete installato MinGW e potete compilare programmi C e C++ da Windows! Avete a disposizione\r\n\t\t\t\t\t\tgcc e g++ sul Prompt dei Comandi, e potete finalmente creare dei file .exe!
\r\n\t\t\t\t \r\n\t\t\t\r\n\t\t);\r\n\t}\r\n}\r\n\r\n\n\n\n// WEBPACK FOOTER //\n// ./pages/mingwinstall.js","import style from './copyright.css';\r\nimport { Component } from 'preact';\r\n\r\nexport default class Copyright extends Component {\r\n\trender() {\r\n\t\treturn © 2019 - Stefano Pigozzi - CC BY-SA 4.0 - Codice sorgente;\r\n\t}\r\n}\n\n\n// WEBPACK FOOTER //\n// ./components/copyright.js","import style from \"./theorem.css\";\r\nimport Panel from \"./panel.js\";\r\n\r\nexport default class Theorem extends Panel {\r\n getStyle() {\r\n return super.getStyle() + \" \" + style.theorem;\r\n }\r\n}\r\n\n\n\n// WEBPACK FOOTER //\n// ./components/theorem.js","import style from \"./hypothesis.css\";\r\nimport {Component} from \"preact\";\r\n\r\nexport default class Hypothesis extends Component {\r\n render() {\r\n return (\r\n \r\n \r\n Ipotesi\r\n
\r\n {this.props.children}\r\n \r\n )\r\n }\r\n}\r\n\n\n\n// WEBPACK FOOTER //\n// ./components/hypothesis.js","import style from \"./thesis.css\";\r\nimport {Component} from \"preact\";\r\n\r\nexport default class Thesis extends Component {\r\n render() {\r\n return (\r\n \r\n \r\n Tesi\r\n
\r\n {this.props.children}\r\n \r\n )\r\n }\r\n}\r\n\n\n\n// WEBPACK FOOTER //\n// ./components/thesis.js","import style from \"./proof.css\";\r\nimport {Component} from \"preact\";\r\n\r\nexport default class Proof extends Component {\r\n render() {\r\n return (\r\n \r\n \r\n Dimostrazione\r\n
\r\n {this.props.children}\r\n \r\n )\r\n }\r\n}\r\n\n\n\n// WEBPACK FOOTER //\n// ./components/proof.js","import style from \"./example.css\";\nimport {Component} from \"preact\";\n\nexport default class Example extends Component {\n render() {\n return (\n \n {this.props.children}\n
\n )\n }\n}\n\n\n\n// WEBPACK FOOTER //\n// ./components/example.js","import style from './statistica.css';\nimport { Component } from 'preact';\nimport Latex from '../components/latex';\nimport Panel from '../components/panel';\nimport Split from '../components/split';\nimport Todo from '../components/todo';\nimport Theorem from \"../components/theorem\";\nimport Hypothesis from \"../components/hypothesis\";\nimport Thesis from \"../components/thesis\";\nimport Proof from \"../components/proof\";\nimport Example from \"../components/example\";\nimport Plus from \"../components/plus\";\nimport Minus from \"../components/minus\";\n\nconst r = String.raw;\n\nexport default class Statistica extends Component {\n\trender() {\n\t /*\n \n \n \n Gruppo intero di oggetti di cui si cercano informazioni.\n
\n \n \n \n Popolazione finita di oggetti concreti che possono essere campionati ciascuno solo una volta.\n
\n \n \n \n Popolazione di valori ottenuti da prove sperimentali indipendenti ripetute più volte.\n
\n \n \n \n \n \n Sottoinsieme della popolazione che contiene gli oggetti che si sono osservati.\n
\n \n Simple random sample}>\n \n Campione di una data dimensione in cui qualsiasi selezione di n elementi ha la stessa probabilità di costituire il campione.\n
\n \n Sample of convenience}>\n \n Campione ottenuto in un modo casuale non ben definito.\n
\n \n Sample with replacement}>\n \n Campione ottenuto sostituendo nella popolazione gli elementi estratti con dei nuovi elementi.\n
\n \n Dire che un campione è ottenuto with replacement è equivalente a dire che la popolazione che si sta campionando è infinita, e quindi che tutti gli elementi sono indipendenti.\n
\n \n \n \n Campione ottenuto da una popolazione in cui certi elementi hanno più probabilità di essere stati selezionati di altri.\n
\n \n Stratified random sample}>\n \n Campione ottenuto da un sottoinsieme della popolazione detto strato.\n
\n \n Cluster sample}>\n \n Campione ottenuto selezionando più cluster di elementi alla volta.\n
\n \n \n \n Sampling variation}>\n \n Differenza di informazioni presente tra due campioni diversi della stessa popolazione.\n
\n \n \n \n Gli elementi in un campione sono indipendenti se gli elementi estratti in precedenza non influsicono significativamente sulle probabilità di estrazione dell'elemento successivo.\n
\n \n \n \n \n \n Esperimento in cui c'è una sola popolazione da cui vengono estratti campioni.\n
\n \n Serve per verificare delle condizioni.\n
\n \n \n \n Esperimento in cui sono presenti più popolazioni (aventi caratteristiche differenti una dall'altra dette fattori) da cui vengono estratti campioni.\n
\n \n Serve per capire quali fattori influenzano il risultato dell'esperimento.\n
\n \n \n \n Numerico o quantitativo}>\n Il dato descrive un valore numerico relativo all'elemento, come ad esempio una quantità fisica.\n \n Categorico o qualitativo}>\n Il dato indica una categoria a cui appartiene l'elemento, come ad esempio il suo colore.\n \n \n\t */\n return (\n \n Statistica ed Elementi di Probabilità
\n \n \n \n {r`P(E) = \\frac{casi\\ favorevoli}{casi\\ possibili}`} \n
\n \n \n \n {r`P(E) = \\frac{successi}{prove\\ totali}`} \n
\n \n \n \n Il prezzo che un individuo coerente riterrebbe equo per ricevere 1 nel caso l'evento si verificasse e 0 nel caso l'evento non si verificasse.\n
\n \n \n \n \n \n \"omegone\"\n
\n \n L'insieme di tutti gli esiti possibili di un esperimento.\n
\n \n {r`\\Omega = \\left \\{ 1, 2, 3, 4, 5, 6 \\right \\}`} \n
\n \n \n \n \"omeghino\"\n
\n \n Un elemento dello spazio campionario.\n
\n \n {r`\\omega = 1`} \n
\n \n \n \n \"e\"\n
\n \n Un sottoinsieme dello spazio campionario.\n
\n \n {r`E = \\left \\{ 1, 2 \\right \\}`} \n
\n \n Lo spazio campionario stesso è un evento certo.\n
\n \n \n \n \"not e\"\n
\n \n Il complementare di un sottoinsieme.\n
\n \n {r`\\bar{E} = \\left \\{ 3, 4, 5, 6 \\right \\}`} \n
\n \n \n \n \"e intersecato effe\"\n
\n \n L'intersezione di più sottoinsiemi.\n
\n \n {r`E \\cap F = \\left \\{ 1 \\right \\}`} \n
\n \n \n \n \"e unito a effe\"\n
\n \n L'unione di più sottoinsiemi.\n
\n \n {r`E \\cup F = \\left \\{ 1, 2, 3, 4 \\right \\}`} \n
\n \n \n \n \"e meno effe\"\n
\n \n {r`E \\setminus F = E \\cap \\bar{F}`} \n
\n \n \n \n \"e contenuto in effe\"\n
\n \n L'inclusione del primo insieme in un altro.\n
\n \n {r`E \\subseteq F`} \n
\n \n Se si verifica E , allora si verifica anche F .\n
\n \n \n \n \"e è impossibile\"\n
\n \n Un sottoinsieme vuoto.\n
\n \n {r`E = \\emptyset`} \n
\n \n \n \n \"e ed effe si escludono mutualmente\"\n
\n \n La disgiunzione di due insiemi.\n
\n \n {r`E \\cap F = \\emptyset`} \n
\n \n \n \n \n \n \"famiglia effe\"\n
\n \n I sottoinsiemi dello spazio campionario formano una famiglia di sottoinsiemi detta famiglia degli eventi.\n
\n \n {r`\\mathcal{F}`} \n
\n \n Qualsiasi sottoinsieme appartenente a {r`\\mathcal{F}`} è considerato un evento.\n
\n \n {r`\\sigma`} -algebra}>\n \n \"sigma algebra\"\n
\n \n Se la famiglia degli eventi soddisfa questi tre requisiti, allora viene detta {r`\\sigma`} -algebra:\n
\n \n - \n Lo spazio campionario è un evento:
{r`\\Omega \\in \\mathcal{F}`} \n \n - \n Se un sottoinsieme è un evento, allora anche il suo complementare lo è:
{r`E \\in \\mathcal{F} \\implies \\bar{E} \\in \\mathcal{F}`} \n \n - \n Se due sottoinsiemi sono eventi, allora lo sono anche la loro unione e intersezione:
{r`(E, F) \\in \\mathcal{F} \\implies (E \\cup F, E \\cap F) \\in \\mathcal{F}`} \n \n
\n \n Un esempio: {r`E \\in \\mathcal{F} \\implies \\mathcal{F} = \\{ \\emptyset, E, \\bar{E}, \\Omega \\}`} \n
\n \n \n \n \n \"la partizione e composta da e uno, e due, e tre...\"\n
\n \n Un insieme di esiti e eventi:\n
\n \n - Finito.
\n - In cui tutti gli eventi hanno probabilità diversa da 0.
\n - In cui tutti gli eventi sono mutualmente esclusivi.
\n - In cui l'unione di tutti i suoi elementi copre lo spazio campionario.
\n
\n \n La partizione {r`E_i`} è composta dagli eventi {r`E_1`} , {r`E_2`} , {r`E_3`} , fino a {r`E_n`} .\n
\n \n Se lo spazio campionario fosse una torta, una sua partizione sarebbe l'insieme delle fette di uno dei modi in cui si potrebbe tagliare.\n \n \n \n \n \n \n La probabilità di un evento è un numero tra 0 e 1.\n
\n \n {r`\\forall E \\in \\mathcal{F}, 0 \\leq P(E) \\leq 1`} \n
\n \n \n \n La probabilità dello spazio campionario è sempre 1.\n
\n \n {r`P(\\Omega) = 1`} \n
\n \n \n \n La probabilità dell'unione di eventi indipendenti è uguale alla somma delle loro probabilità.\n
\n \n {r`P \\left ( \\bigcup_i E_i \\right ) = \\sum_i P ( E_i )`} \n
\n \n \n \n \n \n La probabilità di un evento negato è uguale a 1 meno la probabilità dell'evento non negato.\n
\n \n {r`P(\\bar{E}) = 1 - P({E})`} \n
\n \n \n \n La probabilità di un evento incluso in un altro è sempre minore o uguale alla probabilità dell'evento in cui è incluso.\n
\n \n {r`F \\subseteq E \\implies P(F) \\leq P(E)`} \n
\n \n \n \n La probabilità di un evento unito a un altro è uguale alla somma delle probabilità dei due eventi meno la probabilità della loro intersezione.\n
\n \n {r`P(E \\cup F) = P(E) + P(F) - P(E \\cap F)`} \n
\n \n Sommando le probabilità dei due eventi, l'intersezione viene contata due volte, e va quindi rimossa!\n \n \n \n \n \n \n Spazi campionari in cui ci sono un numero finito di esiti e ogni esito ha la stessa probabilità di verificarsi.\n
\n \n {r`P(E) = \\frac{len(E)}{len(\\Omega)}`} \n
\n \n \n \n Gli spazi campionari possono avere un numero infinito di esiti: sono equiprobabili geometrici se nessun esito è privilegiato rispetto agli altri.\n
\n \n \n \n \n \n Estraggo un numero, da un sacchetto con n numeri, mi segno che numero ho estratto e lo tengo fuori dal sacchetto. Ripeto per k volte.\n
\n \n Tengo conto dell'ordine in cui ho estratto i numeri.\n
\n \n {r`\\boldsymbol{D}_{n, k} = \\frac{n!}{(n - k)!}`} \n
\n \n \n \n Estraggo un numero, da un sacchetto con n numeri, mi segno che numero ho estratto e lo rimetto nel sacchetto. Ripeto per k volte.\n
\n \n Tengo conto dell'ordine in cui ho estratto i numeri.\n
\n \n {r`\\boldsymbol{D}^{r}_{n, k} = n^k`} \n
\n \n \n \n Estraggo un numero, da un sacchetto con n numeri, mi segno che numero ho estratto e lo tengo fuori dal sacchetto. Ripeto per k volte.\n
\n \n Non mi interessa l'ordine in cui ho estratto i numeri.\n
\n \n {r`\\boldsymbol{C}_{n, k} = \\binom{n}{k} = \\frac{n!}{(k)! \\cdot (n - k)!}`} \n
\n \n \n \n Estraggo un numero, da un sacchetto con n numeri, mi segno che numero ho estratto e lo rimetto nel sacchetto. Ripeto per k volte.\n
\n \n Non mi interessa l'ordine in cui ho estratto i numeri.\n
\n \n {r`\\boldsymbol{C}^{r}_{n, k} = \\binom{n + k - 1}{k} = \\frac{(n + k - 1)!}{(k)! \\cdot (n - 1)!}`} \n
\n \n \n \n Estraggo n numeri e guardo in quanti ordini diversi li posso mettere.\n
\n \n {r`\\boldsymbol{P}_n = n!`} \n
\n \n \n \n \n \n \"E dato F\"\n
\n \n La probabilità che si verifichi E sapendo che si è già verificato F .\n
\n \n {r`P(E|F) = \\frac{P(E \\cap F)}{P(F)}`} \n
\n \n Ricorda vagamente le pipe di bash, però al contrario...\n \n \n \n \n Se due eventi sono mutualmente esclusivi, entrambe le loro probabilità condizionate saranno uguali a 0.\n
\n \n {r`E \\cap F = \\emptyset \\Longleftrightarrow P(E|F) = P(F|E) = 0`} \n
\n \n \n \n \n \n Si può sfruttare la formula inversa della probabilità condizionata per calcolare catene di intersezioni:\n
\n \n {r`P(E_1 \\cap \\times \\cap E_n) = P(E_1) \\times P(E_2 | E_1) \\times \\dots \\times P(E_n | E_1 \\cap E_2 \\cap \\dots \\cap E_{n-1})`} \n
\n \n \n \n \n \n La probabilità che si verifichi un evento è pari alla somma delle probabilità dell'evento stesso dati tutti gli eventi di una partizione.\n
\n \n {r`P(F) = \\sum_{i} P(F|E_i) \\cdot P(E_i)`} \n
\n \n \n \n La legge delle alternative funziona anche quando ad essere partizionato è un evento:\n
\n \n {r`P(F|G) = \\sum_i P(F|E_i \\cap G) \\cdot P(E_i | G)`} \n
\n \n \n \n Tramite la formula di Bayes possiamo risalire alla probabilità di un evento condizionato a un altro partendo dalla probabilità di quest'ultimo condizionato al primo:\n
\n \n {r`P(E_h | F) = \\frac{P(F | E_h) \\cdot P(E_h)}{P(F)}`} \n
\n \n In pratica, invertiamo gli eventi.\n \n \n \n \n \n \n \"eventi indipendenti a due a due\"\n
\n \n Se due eventi sono indipendenti, sapere che uno dei due si è verificato non influisce sulle probabilità che si sia verificato l'altro.\n
\n \n {r`P(E \\cap F) = P(E) \\cdot P(F) \\Longleftrightarrow P(E|F) = P(E) \\Longleftrightarrow P(F|E) = P(F)`} \n
\n \n \n \n \"eventi indipendenti a tre a tre, a quattro a quattro, a cinque a cinque...\"\n
\n \n Si può verificare l'indipendenza di più eventi alla volta:\n
\n \n {r`P(E \\cap F \\cap G) = P(E) \\cdot P(F) \\cdot P(G)`} \n
\n \n Eventi indipendenti a due a due non sono per forza indipendenti a tre a tre, e viceversa.\n
\n \n \n \n Un insieme di n eventi è una famiglia di eventi indipendenti se, preso un qualsiasi numero di eventi da essa, essi risulteranno indipendenti.\n
\n \n Tutti gli eventi provenienti da essa saranno indipendenti sia a due a due, sia a tre a tre, sia a quattro a quattro, e così via!\n \n \n \n \n \n \n Una funzione che fa corrispondere un numero reale a ogni possibile esito dello spazio campionario. {r`X(\\omega) : \\Omega \\to \\mathbb{R}`} .\n
\n \n Insieme di ripartizione}>\n \n Ad ogni variabile aleatoria sono associati gli eventi {r`A_t = \\{ \\omega | X(\\omega) \\leq t \\}`} , che contengono tutti gli esiti a cui la variabile aleatoria associa un valore minore o uguale a t .\n
\n \n Per definizione, tutte le variabili aleatorie devono rispettare questa condizione:\n
\n \n {r`\\forall t \\in \\mathbb{R}, A_t \\in \\mathcal{F}`} \n
\n \n All'aumentare di t, l'insieme conterrà sempre più elementi.\n \n \n \n \n \"supporto di X\"\n
\n \n Il codominio della variabile aleatoria è il suo supporto.\n
\n \n Per indicare che un valore x_0 appartiene al supporto di X , si usa la notazione X \\mapsto x_0 .\n
\n \n \n \n \n \n La funzione probabilità {r`p_X : X \\to [0, 1]`} di una variabile aleatoria discreta X è la funzione che associa ad ogni esito la sua probabilità:\n
\n \n {r`p_X (x) = \\begin{cases}\n P([X = x]) \\quad se\\ X \\mapsto x \\\\\n 0 \\qquad \\qquad \\quad se\\ X \\not\\mapsto x\n \\end{cases}`} \n
\n \n \n \n La funzione densità {r`f_X : X \\to [0, 1]`} di una variabile aleatoria continua X è l'equivalente continuo della funzione probabilità:\n
\n \n {r`P([a < X \\leq b]) = \\int_a^b f_X (x) dx`} \n
\n \n A differenza della funzione probabilità, è possibile che la funzione densità non esista per una certa variabile aleatoria.\n
\n \n Rappresenta \"quanta\" probabilità c'è in un'unità di x!\n \n \n \n \n \n \n Ogni variabile aleatoria ha una funzione di ripartizione {r`F_X : \\mathbb{R} \\to [0, 1]`} associata, che rappresenta la probabilità che la variabile aleatoria assuma un valore minore o uguale a t :\n
\n \n Si può dire che essa rappresenti la probabilità dell'evento {r`A_t`} :\n
\n \n {r`F_X (t) = P(A_t) = \\begin{cases}\n \\sum_{i = 0}^{t} p_X (x_i) \\quad nel\\ discreto\\\\\n \\\\\n \\int_{-\\infty}^t f_X (x) dx \\quad nel\\ continuo\n \\end{cases}`} \n
\n \n \n \n - È sempre monotona crescente (non strettamente).
\n - Vale 0 a
-\\infty e 1 a +\\infty .
\n - È continua da destra:
{r`\\forall x_0 \\in \\mathbb{R}, F_X (x_0) = \\lim_{t \\to x^+_0} F_X (t)`} \n
\n \n \n \n Possiamo usare la funzione di ripartizione per calcolare la probabilità di un certo valore reale:\n
\n \n {r`P([X = x_0]) = \\lim_{t \\to x^+_0} F_X (t) - \\lim_{t \\to x^-_0} F_X (t)`} \n
\n \n \n \n \n \n Nel discreto basta abbinare un nuovo valore a ogni valore della variabile originale.\n
\n \n \n \n Nel continuo applichiamo la formula dell'integrazione per sostituzione:\n
\n \n {r`f_Y (y) = \\int_{g(a)}^{g(b)} f_X ( g^{-1} (x) ) g^{-2} (x)`} \n
\n \n \n \n Trasformare variabili aleatorie è molto utile nell'informatica per creare distribuzioni partendo da una funzione random() che restituisce numeri da 0 a 1 con una distribuzione lineare.\n
\n \n \n \n \n \n Ogni variabile aleatoria che ha una funzione di ripartizione e un supporto finito ha anche una media (o valore medio o atteso):\n
\n \n {r`E(X) = \\int_0^{+infty} (1 - F_X (t)) dt - \\int_{-\\infty}^{0} F_X (t) dt`} \n
\n \n Nel discreto, si può calcolare con:\n
\n \n {r`E(X) = \\sum_i P(X = x_i) \\cdot x_i`} \n
\n \n Nel continuo, si può calcolare con:\n
\n \n {r`E(X) = \\int_{-\\infty}^{+\\infty} f_X (x) \\cdot x \\cdot dx`} \n
\n \n \n \n \n \n Valore per cui la funzione probabilità o funzione densità è massima.\n
\n \n \n \n Il quantile {r`x_{\\alpha}`} di ordine {r`0 \\leq \\alpha \\leq 1`} della variabile aleatoria X è il più piccolo numero tale che:\n
\n \n \n {r`P([X < x_{\\alpha}]) \\leq \\alpha \\leq P([X \\leq x_{\\alpha}])`}\n \n
\n \n\n
\n \n Il quantile di ordine 0.5 {r`x_{0.5}`} è detto mediana.\n
\n \n I quantili di ordine 0.25 {r`x_{0.25}`} e 0.75 {r`x_{0.75}`} sono detti quartili.\n
\n \n I quantili di ordine {r`\\frac{n}{100}`} sono detti n -esima percentile.\n
\n \n \n \n È un valore che indica quanto la variabile aleatoria si discosta generalmente dalla media:\n
\n \n {r`Var(X) = E( (X - E(X) )^2 ) = E ( X^2 ) - (E(X))^2`} \n
\n \n \n \n \n \n Data una variabile aleatoria non-negativa:\n
\n \n {r`\\forall k > 0, P([X \\geq k]) \\leq \\frac{E(X)}{k}`} \n
\n \n Divide in due parti ({r`P(X < k)`} e {r`P(X \\geq k)`} ) la funzione X, la cui media risulterà uguale a:\n
\n \n {r`E(X) = \\overline{k} \\cdot P(X < k) + k \\cdot P(X \\geq k)`} \n
\n \n \n \n \"disuguaglianza di cebicev\"\n
\n \n Se la variabile aleatoria X ha media e varianza, allora la probabilità che essa abbia un valore a più di {r`\\epsilon`} di distanza dal valore medio è minore o uguale a {r`\\frac{Var(X)}{\\epsilon^2}`} .\n
\n \n {r`\\forall \\epsilon > 0, P([ \\left| X - E(X) \\right| \\geq \\epsilon]) \\leq \\frac{Var(X)}{\\epsilon^2}`} \n
\n \n E anche:\n
\n \n {r`\\forall \\epsilon > 0, P([ \\left| X - E(X) \\right| < \\epsilon]) \\geq 1 - \\frac{Var(X)}{\\epsilon^2}`} \n
\n \n Serve per semplificare i calcoli quando la funzione di ripartizione è difficile da calcolare!\n \n \n \n \n \n \n Il momento k -esimo di una variabile aleatoria è:\n
\n \n \n {r`\\mu_k = E ( X^k ) = \\begin{cases}\n \\sum_i x_i^k p_X (x_i) \\qquad nel\\ discreto\\\\\n \\\\\n \\int_{-\\infty}^{+\\infty} x^k f_X (x) dx \\qquad nel\\ continuo\n \\end{cases}`}\n \n
\n \n La media di una variabile aleatoria è anche il suo primo momento.\n \n \n \n \n La funzione generatrice dei momenti è:\n
\n \n {r`m_X (t) = E( e^{t \\cdot X} )`} \n
\n \n Se due variabile aleatorie hanno la stessa funzione generatrice dei momenti, allora esse hanno la stessa distribuzione.\n
\n \n E' la trasformata di Laplace della variabile aleatoria di X.\n
\n \n \n \n La funzione caratteristica è:\n
\n \n {r`H_X (t) = E ( e^{i \\cdot t \\cdot X} )`} \n
\n \n Se due variabile aleatorie hanno la stessa funzione caratteristica, allora esse hanno la stessa distribuzione.\n
\n \n E' la trasformata di Fourier della variabile aleatoria di X.\n
\n \n \n \n \n \n Per dire che una variabile ha una certa distribuzione, si usa la notazione:\n
\n \n {r`X \\sim Distribuzione()`} \n
\n \n \n \n Una prova con solo due possibili esiti: successo e insuccesso .\n
\n \n \n \n Una sequenza di prove di Bernoulli per le quali le probabilità di successo e fallimento rimangono invariate.\n
\n \n \n \n \n \n Una variabile aleatoria che rappresenta una prova di Bernoulli:\n
\n \n - vale
1 in caso di successo . \n - vale
0 in caso di insuccesso . \n
\n \n Il suo simbolo è {r`Ber(p)`} \n
\n \n \n \n La distribuzione bernoulliana ha come densità:\n
\n \n {r`f_X (k) : \\{0, 1\\} = \\begin{cases}\n p \\quad se\\ k = 1\\\\\n q \\quad se\\ k = 0\\\\\n 0 \\quad altrimenti\n \\end{cases} = p^x \\cdot q^{1 - k}`} \n
\n \n \n \n \n \n Una variabile aleatoria che conta il numero di successi di n prove di uno schema di Bernoulli.\n
\n \n Il suo simbolo è {r`Bin(n, p)`} .\n
\n \n \n \n La binomiale ha come densità:\n
\n \n {r`f_X (k) : \\{0..n\\} = \\binom{n}{k} \\cdot p^k \\cdot q^{n - k}`} \n
\n \n \n \n La funzione generatrice dei momenti della binomiale è:\n
\n \n {r`m_X (t) = (q + p \\cdot e^t) ^ n`} \n
\n \n La media di una binomiale è:\n
\n \n {r`E(X) = n \\cdot p`} \n
\n \n La varianza di una binomiale è:\n
\n \n {r`Var(X) = n \\cdot p \\cdot q`} \n
\n \n \n \n \n \n Una variabile aleatoria che conta il numero di prove in uno schema di Bernoulli fino alla comparsa del primo successo.\n
\n \n Il suo simbolo è Geo(p) .\n
\n \n \n \n La geometrica ha come densità:\n
\n \n {r`f_X (k) : \\mathbb{N} = q^{k - 1} p`} \n
\n \n \n \n La funzione generatrice dei momenti della geometrica è:\n
\n \n {r`m_X (t) = \\frac{p \\cdot e^t}{1 - q \\cdot e^t}`} \n
\n \n La media della geometrica è:\n
\n \n {r`E(X) = \\frac{1}{p}`} \n
\n \n La varianza della geometrica è:\n
\n \n {r`Var(X) = \\frac{q}{p^2}`} \n
\n \n \n \n La geometrica non tiene conto degli eventi avvenuti in passato: ha la proprietà dell'assenza di memoria:\n
\n \n {r`P([X = i + j | X > i ]) = P([X = j])`} \n
\n \n Ovvero, riscalando opportunamente l'asse Y posso prendere come 0 qualsiasi punto dell'asse X.\n \n \n \n \n \n \n Una variabile aleatoria che conta il numero di prove in uno schema di Bernoulli necessarie perchè si verifichi l'n -esimo successo.\n
\n \n Il suo simbolo è {r`\\overline{Bin}(n, p)`} .\n
\n \n \n \n La binomiale negativa ha come densità:\n
\n \n {r`f_X (k) : \\{ n .. +\\infty \\} \\in \\mathbb{N} = \\binom{k - 1}{n - 1} \\cdot p^n \\cdot q^{k - n} `} \n
\n \n \n \n
\n La funzione generatrice dei momenti della binomiale negativa è:\n
\n \n {r`m_X (t) : \\{ t < ln(\\frac{1}{q}) \\} = \\left( \\frac{p \\cdot e^t}{1 - q \\cdot e^t} \\right) ^n`} \n
\n \n La media della binomiale negativa è:\n
\n \n {r`E(X) = \\frac{n}{p}`} \n
\n \n La varianza della binomiale negativa è:\n
\n \n {r`Var(X) = \\frac{n \\cdot q}{p^2}`} \n
\n \n \n \n \n \n \n Una variabile aleatoria che conta il numero k di insuccessi consecutivi in uno schema di Bernoulli:\n
\n \n Il suo simbolo rimane {r`Geo(p)`} .\n
\n \n \n \n La geometrica traslata ha come densità:\n
\n \n {r`f_X (k) : \\mathbb{N} = p \\cdot q^k `} \n
\n \n \n \n La funzione generatrice dei momenti della geometrica traslata è:\n
\n \n {r`m_X (t) : \\left\\{ t < ln \\left( \\frac{1}{q} \\right) \\right\\} = \\frac{p}{1 - q \\cdot e^t}`} \n
\n \n La media della geometrica traslata è:\n
\n \n {r`E(X) = \\frac{q}{p}`} \n
\n \n La varianza della geometrica è:\n
\n \n {r`Var(X) = \\frac{q}{p^2}`} \n
\n \n \n \n La geometrica traslata non tiene conto degli eventi avvenuti in passato: ha la proprietà dell'assenza di memoria:\n
\n \n {r`P([X = i + j | X > i ]) = P([X = j])`} \n
\n \n Ovvero, riscalando opportunamente l'asse Y posso prendere come 0 qualsiasi punto dell'asse X.\n \n \n \n \n \n \n Una variabile aleatoria che conta il numero di insuccessi in uno schema di Bernoulli prima che si verifichi l'n -esimo successo.\n
\n \n Il suo simbolo rimane {r`\\overline{Bin}(n, p)`} .\n
\n \n \n \n La binomiale negativa traslata ha come densità:\n
\n \n {r`f_X (k) : \\mathbb{N} = \\binom{k + n - 1}{n - 1} \\cdot p^n \\cdot q^k `} \n
\n \n \n \n
\n La funzione generatrice dei momenti della binomiale negativa traslata è:\n
\n \n {r`m_X (t) : \\left\\{ t < ln \\left( \\frac{1}{q} \\right) \\right\\} = \\left( \\frac{p \\cdot e^t}{1 - q \\cdot e^t} \\right) ^n`} \n
\n \n La media della binomiale negativa traslata è:\n
\n \n {r`E(X) = \\frac{n \\cdot q}{p}`} \n
\n \n La varianza della binomiale negativa traslata è:\n
\n \n {r`Var(X) = \\frac{n \\cdot q}{p^2}`} \n
\n \n \n \n \n \n \n Una variabile aleatoria che, sapendo il numero di successi K e di insuccessi N-K , conta quanti successi si otterrebbero se se ne estraessero n in blocco.\n
\n \n Il suo simbolo è Ipe(N, K, n) .\n
\n \n \n \n La ipergeometrica ha come densità:\n
\n \n {r`f_X (k) : \\{0..n\\} \\in \\mathbb{N} = \\frac{\\binom{K}{k} \\cdot \\binom{N - K}{n - k}}{\\binom{N}{n}}`} \n
\n \n \n \n
\n La funzione generatrice dei momenti della ipergeometrica è trascurabile.\n
\n \n La media della ipergeometrica è:\n
\n \n {r`E(X) = n \\cdot \\frac{K}{N}`} \n
\n \n La varianza della ipergeometrica è:\n
\n \n {r`Var(X) = n \\cdot \\frac{K}{N} \\cdot \\frac{N - K}{N} \\cdot \\frac{N - n}{N - 1}`} \n
\n \n \n \n \n \n \n Una variabile aleatoria che soddisfa tutte le seguenti caratteristiche:\n
\n \n - Binomiale:
{r`X \\sim Bin(n, p)`} \n - Il numero di prove tende a infinito:
{r`n \\to +\\infty`} \n - La probabilità di successo tende a 0:
{r`p \\to 0`} \n - La media è finita:
{r`E(X) = n \\cdot p \\to \\mu \\neq 0`} \n
\n \n Il suo simbolo è {r`Poi(\\mu)`} \n
\n \n \n \n La poissoniana ha come densità:\n
\n \n {r`f_X (k) : \\mathbb{N} = \\frac{e^{-\\mu} \\cdot \\mu^k}{k!}`} \n
\n \n \n \n
\n La funzione generatrice dei momenti della poissoniana è:\n
\n \n {r`m_X (t) = e^{\\mu \\cdot (e^t - 1)}`} \n
\n \n La media della poissoniana è:\n
\n \n {r`E(X) = \\mu`} \n
\n \n La varianza della poissoniana è:\n
\n \n {r`Var(X) = \\mu`} \n
\n \n Gli altri momenti della poissoniana sono:\n
\n \n {r`E(X^2) = \\mu^2 + \\mu`}
\n \n \n \n \n \n \n Una successione di arrivi avvenuti in un certo arco temporale che:\n
\n \n - non sono sovrapposti.
\n - hanno intensità
{r`\\lambda`} costante. \n - avvengono indipendentemente gli uni dagli altri.
\n
\n \n \n \n Una variabile aleatoria N_t che conta il numero di arrivi di uno schema di Poisson di intensità {r`\\lambda`} in un intervallo di tempo di durata t .\n
\n \n E' una distribuzione poissoniana con {r`\\mu = t \\cdot \\lambda`} : {r`Poi(t \\cdot \\lambda)`} \n
\n \n E' paragonabile a una bernoulliana: ogni successo corrisponde a un arrivo, mentre il tempo è il numero di prove effettuate (ma nel continuo).\n \n \n \n \n \n \n Una variabile aleatoria che conta il tempo diwidehattesa prima del primo arrivo di un processo di Poisson di intensità {r`\\lambda`} .\n
\n \n Il suo simbolo è {r`Esp(\\lambda)`} .\n
\n \n \n \n L'esponenziale ha come densità:\n
\n \n {r`f_X (x) = \\begin{cases}\n 0 \\qquad \\qquad x < 0\\\\\n \\lambda \\cdot e^{-\\lambda \\cdot x} \\quad x > 0\n \\end{cases}`} \n
\n \n L'esponenziale ha come funzione di ripartizione:\n
\n \n {r`F_X (t) = \\begin{cases}\n 0 \\qquad \\qquad t < 0\\\\\n 1 - e^{-\\lambda \\cdot t} \\quad t \\geq 0\n \\end{cases}`} \n
\n \n \n \n La funzione generatrice dei momenti dell'esponenziale è:\n
\n \n {r`m_X (t) : \\{ t | t < \\lambda \\} \\in \\mathbb{R} = \\frac{\\lambda}{\\lambda - t}`} \n
\n \n La media dell'esponenziale è:\n
\n \n {r`E(X) = \\frac{1}{\\lambda}`} \n
\n \n La varianza dell'esponenziale è:\n
\n \n {r`Var(X) = \\frac{1}{\\lambda^2}`} \n
\n \n \n \n L'esponenziale non tiene conto degli eventi avvenuti in passato: ha la proprietà dell'assenza di memoria:\n
\n \n {r`P([X > s + t | X > s]) = P([X > t])`} \n
\n \n Ovvero, riscalando opportunamente l'asse Y posso prendere come 0 qualsiasi punto dell'asse X.\n \n \n \n \n \n \n Una variabile aleatoria che conta il tempo diwidehattesa prima dell'n -esimo arrivo di un processo di Poisson di intensità {r`\\lambda`} .\n
\n \n Il suo simbolo è {r`\\Gamma(n, \\lambda)`} .\n
\n \n \n \n La legge gamma ha come densità:\n
\n \n {r`f_X (x) = \\begin{cases}\n 0 \\qquad \\qquad \\qquad \\qquad \\qquad x < 0\\\\\n \\frac{1}{(n-1)!} \\cdot \\lambda^n \\cdot x^{n-1} \\cdot e^{-\\lambda \\cdot x} \\quad k > 0\n \\end{cases}`} \n
\n \n \n \n
\n La funzione generatrice dei momenti della legge gamma è:\n
\n \n {r`m_X (t) : ( t < \\lambda ) \\in \\mathbb{R} = \\left( \\frac{\\lambda}{\\lambda - t} \\right) ^\\alpha`} \n
\n \n La media della legge gamma è:\n
\n \n {r`E(X) = \\frac{\\alpha}{\\lambda}`} \n
\n \n La varianza della legge gamma è:\n
\n \n {r`Var(X) = \\frac{\\alpha}{\\lambda^2}`} \n
\n \n \n \n \n \n \n Una variabile aleatoria che può assumere qualsiasi valore in un intervallo {r`[a, b]`} in modo equiprobabile.\n
\n \n Il suo simbolo è {r`Uni(a, b)`} \n
\n \n Su di essa vale la seguente proprietà:\n
\n \n {r`P(X \\in (c, d)) = \\frac{d - c}{b - a}`} \n
\n \n \n \n La distribuzione uniforme ha come densità:\n
\n \n {r`f_X (x) = \\begin{cases}\n \\frac{1}{b - a} \\qquad a \\leq x \\leq b\\\\\n 0 \\qquad \\quad altrimenti \n \\end{cases}`} \n
\n \n La distribuzione uniforme ha come funzione di ripartizione:\n
\n \n {r`f_X (x) = \\begin{cases}\n 0 \\qquad \\quad x < a \n \\frac{1}{b - a} \\qquad a \\leq x \\leq b\\\\\n 1 \\qquad \\quad x > b\n \\end{cases}`} \n
\n \n \n \n
\n La funzione generatrice dei momenti della distribuzione uniforme è:\n
\n \n {r`m_X (t) = \\frac{e^{b \\cdot t} - e^{a \\cdot t}}{(b - a) \\cdot t}`} \n
\n \n La media della distribuzione uniforme è:\n
\n \n {r`E(X) = \\frac{a + b}{2}`} \n
\n \n La varianza della distribuzione uniforme è:\n
\n \n {r`Var(X) = \\frac{(b - a)^2}{12}`} \n
\n \n \n \n \n \n \n Una variabile aleatoria con una specifica distribuzione.\n
\n \n Il suo simbolo è {r`Nor(\\mu, \\sigma^2)`} .\n
\n \n \\mu e \\sigma^2 sono rispettivamente la media e la varianza della distribuzione!\n \n \n \n \n La distribuzione normale ha come densità:\n
\n \n {r`f_X (x) = \\frac{e^{-\\frac{(x - \\mu)^2}{2 \\sigma^2}}}{\\sqrt{2 \\pi \\cdot \\sigma^2}}`} \n
\n \n \n \n
\n La funzione generatrice dei momenti della distribuzione normale è:\n
\n \n {r`m_X (t) = e^{\\mu \\cdot t + \\frac{\\sigma^2 \\cdot t^2}{2}}`} \n
\n \n La media della distribuzione normale è:\n
\n \n {r`E(X) = \\mu`} \n
\n \n La varianza della distribuzione normale è:\n
\n \n {r`Var(X) = \\sigma^2`} \n
\n \n \n \n \n \n \n Qualsiasi normale può essere trasformata in qualsiasi altra normale:\n
\n \n {r`X \\sim Nor(m, v^2) \\implies \\alpha X + \\beta \\sim Nor(\\alpha m + \\beta, (\\alpha v)^2)`} \n
\n \n \n \n La distribuzione normale standard Z è:\n
\n \n Z \\sim Nor(0, 1) \n
\n \n La sua funzione di ripartizione è detta {r`\\phi(z)`} e vale:\n
\n \n {r`F_Z(z) = \\phi(z) = \\frac{1}{\\sqrt{2 \\pi}} \\int_{-\\infty}^{z} e^{-\\frac{x^2}{2}} dx`} \n
\n \n \n \n Da un quantile {r`z_\\alpha`} della normale standard è possibile risalire allo stesso quantile di qualsiasi altra normale:\n
\n \n {r`x_\\alpha = \\mu + z_\\alpha \\cdot \\sqrt{\\sigma^2}`} \n
\n \n \n \n \n \n La distribuzione normale ha una particolare relazione con la distribuzione Gamma:\n
\n \n {r`Z^2 \\sim \\chi^2 (v = 1)`} \n
\n \n \n \n \"chi-quadro a un grado di libertà\"\n
\n \n Esiste una distribuzione Gamma particolare:\n
\n \n {r`\\Gamma \\left( \\frac{1}{2}, \\frac{1}{2} \\right) = \\chi^2 (v = 1)`} \n
\n \n Più chi-quadro possono essere sommate per aumentare i loro gradi di libertà:\n
\n \n {r`\\chi^2 (n) + \\chi^2 (m) = \\chi^2 (n + m)`} \n
\n \n \n \n Un'altra funzione particolare è la funzione T di Student:\n
\n \n {r`T(v) = \\frac{Nor(0, 1)}{\\sqrt{\\frac{\\chi^2(v)}{v}}}`} \n
\n \n \n \n \n \n La binomiale è come una ipergeometrica ma con ripetizioni, quindi per valori molto grandi di N rispetto a n , si può dire che:\n
\n \n {r`Ipe(N, K, n) \\approx Bin(n, \\frac{K}{N})`} \n
\n \n \n \n La binomiale non è altro che una poissoniana a tempo discreto, quindi, se n è grande e n \\cdot p è nell'ordine di grandezza delle unità, allora:\n
\n \n {r`Bin(n, p) \\approx Poi(n \\cdot p)`} \n
\n \n \n \n Per il Teorema di De Moivre-Laplace, se una binomiale ha una n grande e p non vicina a 0 o 1, si può approssimare con:\n
\n \n {r`Bin(n, p) \\approx Nor(n \\cdot p, n \\cdot p \\cdot q)`} \n
\n \n \n \n Passando da una variabile discreta X a una continua Y , per ogni valore discreto k la probabilità viene \"spalmata\" su tutto l'intervallo {r`(k - \\frac{1}{2}, k + \\frac{1}{2})`} :\n
\n \n {r`P(X < k) \\simeq P(Y \\leq k - \\frac{1}{2})`} {r`P(X \\leq k) \\simeq P(Y \\leq k + \\frac{1}{2})`} {r`P(X \\geq k) \\simeq P(Y \\geq k - \\frac{1}{2})`} {r`P(X > k) \\simeq P(Y \\geq k + \\frac{1}{2})`}
\n \n \n \n \n \n Un vettore composto da variabili aleatorie.\n
\n \n Il suo simbolo generalmente è {r`\\boldsymbol{X}`} oppure {r`X, Y`} .\n
\n \n \n \n I vettori aleatori hanno più funzioni di ripartizione che si differenziano in base al numero di parametri.\n
\n \n Se il numero di parametri coincide con la dimensione del vettore aleatorio, allora la funzione sarà una funzione di ripartizione congiunta:\n
\n \n {r`F_{X, Y} (x, y) = P(X \\leq x, Y \\leq y)`} \n
\n \n Se il numero di parametri è minore della dimensione del vettore aleatorio, allora la funzione sarà una funzione di ripartizione marginale:\n
\n \n {r`F_X (x) = P(X \\leq x) = \\lim_{y \\to +\\infty} F_{X, Y} (x, y)`} \n
\n \n \n \n I vettori aleatori discreti hanno più densità che si differenziano in base al numero di parametri.\n
\n \n Se il numero di parametri coincide con la dimensione del vettore aleatorio, allora la funzione sarà una densità congiunta:\n
\n \n {r`p_{X, Y} (x, y) = P(X = x, Y = y)`} \n
\n \n Se il numero di parametri è minore della dimensione del vettore aleatorio, allora la funzione sarà una densità marginale:\n
\n \n {r`p_X (x) = \\sum_j p_{X, Y} (x_i, y_j)`} \n
\n \n \n \n \n \n Più variabili aleatorie sono indipendenti se, per qualsiasi scelta di intervalli A_i :\n
\n \n {r`P(X_1 \\in A_1, \\dots, X_n \\in A_n) = P(X_1 \\in A_1) \\times \\dots \\times P(X_n \\in A_n)`} \n
\n \n \n \n E' possibile calcolare la media di qualsiasi funzione g(X, Y) avente elementi del vettore come variabili:\n
\n \n {r`E(g(X, Y)) = \\sum_{i, j} g(x_i, y_i) \\cdot p_{X, Y} (x_i, y_i)`} \n
\n \n Solitamente si calcola la media di x \\cdot y .\n \n \n Le medie di più variabili aleatorie si possono sommare:\n
\n \n {r`E(X + Y) = E(X) + E(Y)`} \n
\n \n \n \n \n \n Un operatore che misura la correlazione di due variabili aleatorie.\n
\n \n Si calcola con il valore atteso dei prodotti delle distanze dalla media:\n
\n \n {r`Cov(X, Y) = E((X - E(X) \\cdot (Y - E(Y)) = E(XY) - E(X) \\cdot E(Y)`} \n
\n \n Ha diverse proprietà:\n
\n \n - Il suo valore nullo è 0:
{r`Cov(X, \\alpha) = 0`} \n - E' commutativa:
{r`Cov(X, Y) = Cov(Y, X)`} \n - E' semplificabile:
{r`Cov(X, X) = Var(X)`} \n - E' lineare:
{r`Cov(\\alpha X, \\beta Y) = \\alpha \\cdot \\beta \\cdot Cov(X, Y)`} \n - E' distributiva:
{r`Cov(X + Y, V + W) = Cov(X, Y) + Cov(X, W) + Cov(Y, V) + Cov(Y, W)`} \n
\n \n \n \n Due variabili sono variabili incorrelate se:\n
\n \n {r`Cov(X, Y) = 0`} \n
\n \n Variabili indipendenti sono sempre incorrelate.\n
\n \n \n \n Una matrice {r`\\boldsymbol{C_X}`} che contiene la covarianza tra tutte le variabili di un vettore aleatorio {r`\\boldsymbol{X}`} :\n
\n \n {r`\n \\boldsymbol{C_X} = \n \\begin{bmatrix}\n Var(X_1) & Cov(X_1, X_2) & Cov(X_1, X_3)\\\\\n Cov(X_2, X_1) & Var(X_2) & Cov(X_2, X_3)\\\\\n Cov(X_3, X_1) & Cov(X_3, X_2) & Var(X_3)\n \\end{bmatrix}\n `} \n
\n \n E' sempre simmetrica e semidefinita positiva (tutti gli autovalori sono \\geq 0 .\n
\n \n \n \n Un valore che misura come due variabili aleatorie sono correlate:\n
\n \n {r`\\rho_{X, Y} = \\frac{Cov(X, Y)}{\\sqrt{Var(X)} \\cdot \\sqrt{Var(Y)}}`} \n
\n \n E' sempre compreso tra -1 e 1:\n
\n \n {r`-1 \\leq \\rho_{X, Y} \\leq 1`} \n
\n \n Vale esattamente -1 o 1 solo se esiste un legame lineare tra le due variaibli:\n
\n \n {r`Y = a X + b \\Longleftrightarrow | \\rho_{X, Y} | = 1`} \n
\n \n \n \n La varianza di due variabili aleatorie sommate è:\n
\n \n {r`Var(X + Y) = Var(X) + Var(Y) + 2 \\cdot Cov(X, Y)`} \n
\n \n Si dimostra applicando le proprietà della covarianza!\n \n \n Se più variabili aleatorie X_i sono indipendenti ({r`Cov(X, Y) = 0`} ), allora:\n
\n \n {r`Var \\left( \\sum_i X_i \\right) = \\sum_i Var(X_i)`} \n
\n \n \n \n \n \n Una n-pla di variabili aleatorie con la stessa distribuzione della variabile aleatoria X (\"popolazione\") ma indipendenti tra loro.\n
\n \n Le variabili aleatorie sono come un lazy-load in programmazione; quando ci sarà bisogno del loro valore numerico, esse si realizzeranno nel loro valore.\n \n \n \n \n Il valore dato dalla media aritmetica degli n elementi del campione elevati alla potenza k :\n
\n \n {r`M^{(k)}_n = \\frac{1}{n} \\cdot \\sum_{i = 1}^n X_i^k `} \n
\n \n Il momento campionario di primo ordine è la media campionaria {r`\\overline{X}_n`} .\n
\n \n \n \n La media aritmetica dello scarto quadratico medio degli elementi del campione.\n
\n \n Se è noto il valore medio {r`m = E(X)`} di X:\n
\n \n {r`S_0^2 = \\frac{1}{n} \\cdot \\sum_{i = 1}^n (X_i - m)^2 = M_n^(2) - 2 \\cdot m \\cdot \\overline{X}_n + m^2`} \n
\n \n Altrimenti:\n
\n \n {r`S_n^2 = \\frac{1}{n - 1} \\cdot \\sum_{i = 1}^n (X_i - \\overline{X}_n)^2 = \\frac{1}{n - 1} \\cdot ( n \\cdot M_2^{(2)} - n \\cdot \\overline{X}_n^2)`} \n
\n \n \n \n \n \n Se calcoliamo la media della media campionaria, risulterà vero che:\n
\n \n {r`E(\\overline{X}_n) = E(X)`} \n
\n \n Quindi, è possibile usare i campioni per trovare la media di una variabile aleatoria!\n \n \n \n \n Se calcoliamo la varianza della media campionaria, risulterà vero che:\n
\n \n {r`Var(\\overline{X}_n) = \\frac{Var(X)}{n}`} \n
\n \n Quindi, possiamo stimare l'errore della media calcolata tramite campioni!\n \n \n \n \n Se calcoliamo la media della varianza campionaria, risulterà vero che:\n
\n \n {r`E(S_0^2) = E(S_n^2) = Var(X)`} \n
\n \n Quindi, possiamo stimare l'errore della media calcolata tramite campioni!\n \n \n \n \n \n \n Se la popolazione X ha una distribuzione normale ({r`X \\sim Nor(\\mu, \\sigma^2)`} )...\n
\n \n \n \n ...allora sappiamo anche la distribuzione della media campionaria!\n
\n \n {r`\\overline{X}_n \\sim Nor \\left( \\mu, \\frac{\\sigma^2}{n} \\right)`} \n
\n \n \n \n ...e anche della varianza campionaria!\n
\n \n {r`S_0^2 \\sim \\frac{\\sigma^2}{n} \\cdot \\chi^2 (n)`} \n
\n \n {r`S_n^2 \\sim \\frac{\\sigma^2}{n - 1} \\cdot \\chi^2 (n-1)`} \n
\n \n \n \n ...e che media campionaria e varianza campionaria sono indipendenti tra loro!\n
\n \n \n \n \n \n Se la successione di variabili aleatorie X_n all'infinito ha la stessa funzione di ripartizione della popolazione X , allora essa converge in distribuzione.\n
\n \n {`\\\\lim_{n \\\\to +\\\\infty} F_{X_n} (x) = F_X (x) \\\\implies X_n \\\\xrightarrow{d} X`} \n
\n \n \n \n Se la successione di variabili aleatorie X_n all'infinito ha la stessa probabilità della popolazione X , allora essa converge in probabilità.\n
\n \n {`\\\\forall \\\\epsilon > 0, \\\\lim_{n \\\\to +\\\\infty} P( | X_n - X | < \\\\epsilon) = 1 \\\\implies X_n \\\\xrightarrow{p} X`} \n
\n \n \n \n Se la successione di variabili aleatorie X_n all'infinito ha la stessa probabilità a della popolazione X , allora essa converge quasi certamente.\n
\n \n {`\\\\forall \\\\epsilon > 0, P \\left( \\\\lim_{n \\\\to +\\\\infty} | X_n - X | < \\\\epsilon) \\right) = 1 \\\\implies X_n \\\\xrightarrow{qc} X`} \n
\n \n \n \n Se la successione di variabili aleatorie X_n all'infinito ha la media del quadrato della distanza tra la successione e la popolazione X uguale a 0, allora essa converge in media quadratica.\n
\n \n {`\\\\lim_{n \\\\to +\\\\infty} E( | X_n - X |^2 = 0 \\\\implies X_n \\\\xrightarrow{mq} X`} \n
\n \n \n \n {`\n \\\\begin{matrix}\n X_n \\\\xrightarrow{mq} X\\\\\\\\\n X_n \\\\xrightarrow{qc} X\n \\\\end{matrix} \\\\implies X_n \\\\xrightarrow{p} X \\\\implies X_n \\\\xrightarrow{d} X`\n } \n
\n \n In più:\n
\n \n {`X_n \\\\xrightarrow{p} x \\\\Longleftrightarrow X_n \\\\xrightarrow{d} x`} \n
\n \n \n \n \n \n La successione delle medie campionarie {r`\\overline{X}_n`} converge in probabilità alla media della popolazione {r`E(X)`} , se essa esiste.\n
\n \n {`\\\\overline{X}_n \\\\xrightarrow{p} X`} \n
\n \n Ovvero:\n
\n \n {r`\\forall \\epsilon > 0, \\lim_{n \\to +\\infty} P( | \\overline{X}_n - E(X) | < \\epsilon) = 1`} \n
\n \n {r`P( | \\overline{X}_n - E(X) | < \\epsilon) \\to 1`} \n
\n \n \n \n La successione delle medie campionarie {r`\\overline{X}_n`} converge quasi certamente alla media della popolazione {r`E(X)`} , se essa esiste.\n
\n \n {`\\\\overline{X}_n \\\\xrightarrow{qc} X`} \n
\n \n Ovvero:\n
\n \n {r`\\forall \\epsilon > 0, P \\left( \\lim_{n \\to +\\infty} | \\overline{X}_n - E(X) | < \\epsilon \\right) = 1`} \n
\n \n Dimostra che l'interpretazione frequentista della probabilità è valida!\n \n \n \n \n \n \n La successione delle medie campionarie {r`\\overline{X}_n`} converge in distribuzione a {r`Nor(0, 1) = \\Phi()`} .\n
\n \n {r`\\overline{X}_n \\approx Nor \\left(E(X), \\frac{Var(X)}{n} \\right)`} \n
\n \n Ovvero:\n
\n \n {r`\\forall x \\in \\mathbb{R}, \\lim_{n \\to +\\infty} P \\left( \\frac{\\overline{X}_n - E(X)}{\\sqrt{\\frac{Var(X)}{n}}} \\leq x \\right) = \\Phi(x)`} \n
\n \n \n \n \n \n E' una somma di bernoulliane, e quindi si approssima a una normale:\n
\n \n {r`Bin(n, p) \\approx Nor(n \\cdot p, n \\cdot p \\cdot q)`} \n
\n \n \n \n E' una somma di geometriche, e quindi si approssima a una normale:\n
\n \n {r`\\overline{Bin} (n, p) \\approx Nor \\left( \\frac{n}{p}, \\frac{n \\cdot (1 - p)}{p^2} \\right)`} \n
\n \n \n \n E' una somma di altre poissoniane, e quindi si approssima a una normale:\n
\n \n {r`Poi(\\lambda) \\approx Nor(\\lambda, \\lambda)`} \n
\n \n \n \n E' una somma di esponenziali, e quindi si approssima a una normale:\n
\n \n {r`\\Gamma (\\alpha, \\lambda) \\approx Nor \\left( \\frac{\\alpha}{\\lambda}, \\frac{\\alpha}{\\lambda^2} \\right)`} \n
\n \n \n \n Se n è grande, allora:\n
\n \n {r`Y = \\sum_{i=1}^{n} X_i`} \n
\n \n \n \n \n \n Per indicare parametri sconosciuti di una legge si usa \\theta .\n
\n \n \n \n Una variabile aleatoria funzione di un campione:\n
\n \n {r`T(\\boldsymbol{X})`} \n
\n \n Ad esempio, sono statistiche media e varianza campionaria, così come il campione stesso {r`T(\\boldsymbol{X}) = \\boldsymbol{X}`} .\n \n \n \n \n \n \n Una statistica T_n ottenuta da n osservazioni, che stimi i parametri di una legge e sia indipendente da essi.\n
\n \n \n \n Uno stimatore è corretto se il suo valore atteso coincide con quello dei parametri che stima:\n
\n \n {r`E(T_n) = \\theta`} \n
\n \n \n \n Uno stimatore è asintoticamente corretto se, per infinite osservazioni, il suo valore atteso coincide con quello dei parametri che stima:\n
\n \n {r`\\lim_{n \\to +\\infty} E(T_n) = \\theta`} \n
\n \n \n \n Uno stimatore è consistente in media quadratica se:\n
\n \n {r`\\lim_{n \\to +\\infty} E((T_n - \\theta)^2) = 0`} \n
\n \n \n \n Uno stimatore è consistente in probabilità se:\n
\n \n {r`\\forall \\epsilon > 0, \\lim_{n \\to +\\infty} P( |T_n - \\theta| < \\epsilon) = 1`} \n
\n \n \n \n Uno stimatore è asintoticamente normale se:\n
\n \n {r`\\lim_{n \\to +\\infty} \\frac{T_n - E(T_n)}{\\sqrt{Var(T_n)}} \\sim Nor(0, 1)`} \n
\n \n \n \n \n \n Si può usare il metodo dei momenti per ottenere uno stimatore di una popolazione X .\n
\n \n Lo stimatore di {r`\\theta`} così ottenuto sarà indicato aggiungendo un cappellino e una M a \\theta : {r`\\widehat{\\theta}_M`} \n
\n \n Visto che:\n
\n \n {r`\\theta = g(E(X))`} {r`\\widehat{E(X)} = \\overline{X}_n`}
\n \n Allora:\n
\n \n {r`\\widehat{\\theta}_M = g( \\overline{X}_n )`} \n
\n \n Se {r`\\theta`} non è esprimibile in termini di {r`E(X)`} , si possono usare i momenti successivi {r`M_n^2`} , {r`M_n^3`} , {r`M_n^3`} ...\n
\n \n \n \n \n \n Si può usare il metodo della massima verosomiglianza per ottenere uno stimatore di una popolazione X .\n
\n \n Lo stimatore di {r`\\theta`} così ottenuto sarà indicato aggiungendo un cappellino e una L a \\theta : {r`\\widehat{\\theta}_L`} \n
\n \n Consiste nel trovare il massimo assoluto {r`\\widehat{\\theta}_L`} della la funzione di verosomiglianza {r`L`} :\n
\n \n {r`L(x_1, ..., x_n; \\theta) = \\prod_{i=1}^n f_X(x_i; \\theta)`} \n
\n \n Gli stimatori di massima verosomiglianza sono asintoticamente corretti, consistenti in probabilità e asintoticamente normali.\n
\n \n \n \n Gli stimatori di massima verosomiglianza godono delle seguenti proprietà:\n
\n \n - Sono asintoticamente corretti.
\n - Sono consistenti in probabilità.
\n - Sono asintoticamente normali.
\n - Sono invarianti:
{r`\\widehat{g(\\theta)}_L = g(\\widehat{\\theta}_L)`} \n
\n \n \n \n \n \n Per il metodo dei momenti oppure per il metodo della massima verosomiglianza:\n
\n \n {r`\\widehat{p}_M = \\widehat{p}_L = \\overline{X}_n`} \n
\n \n \n \n Per il metodo dei momenti oppure per il metodo della massima verosomiglianza:\n
\n \n {r`\\widehat{\\mu}_M = \\widehat{\\mu}_L = \\overline{X}_n`} \n
\n \n \n \n Per il metodo dei momenti oppure per il metodo della massima verosomiglianza:\n
\n \n {r`\\widehat{\\lambda}_M = \\widehat{\\lambda}_L = \\frac{1}{\\overline{X}_n}`} \n
\n \n \n \n Per il metodo della massima verosomiglianza:\n
\n \n {r`\\widehat{\\mu}_L = \\overline{X}_n`}
\n {r`\\widehat{\\sigma^2}_L = \\frac{\\sum (X_i - \\overline{X}_n)^2 }{n}`}
\n \n \n \n \n \n \"intervallo di confidenza al 95%\"\n
\n \n L'intervallo di valori di \\theta all'interno del quale siamo \"più o meno sicuri\" si trovi il valore effettivo:\n
\n \n L'intervallo di confidenza a N della stima {r`\\widehat{W}`} è l'intervallo ]a, b[ tale che:\n
\n \n {r`P( a < W < b ) = N`} \n
\n \n Può anche essere unilatero nel caso limiti la stima in una sola direzione, positiva o negativa.\n
\n \n \n \n \n \n Se conosciamo la varianza di una normale, allora possiamo ricavare velocemente gli intervalli di confidenza all'\\alpha % con queste formule:\n
\n \n - Intervalli bilateri:
{r`\\mu \\in \\left[ \\overline{x}_n - z_{1 - \\frac{\\alpha}{2}} \\cdot \\sqrt{\\frac{\\sigma^2}{n}}, \\overline{x}_n + z_{1 - \\frac{\\alpha}{2}} \\cdot \\sqrt{\\frac{\\sigma^2}{n}} \\right]`} \n - Intervallo unilatero da sinistra:
{r`\\mu \\in \\left( -\\infty, \\overline{x}_n + z_{1 - \\frac{\\alpha}{2}} \\cdot \\sqrt{\\frac{\\sigma^2}{n}} \\right]`} \n - Intervallo unilatero da destra:
{r`\\mu \\in \\left[ \\overline{x}_n - z_{1 - \\frac{\\alpha}{2}} \\cdot \\sqrt{\\frac{\\sigma^2}{n}}, +\\infty \\right)`} \n
\n \n \n \n Se non conosciamo la varianza di una normale, allora possiamo ricavare velocemente gli intervalli di confidenza all'\\alpha % con queste formule:\n
\n \n - Intervalli bilateri:
{r`\\mu \\in \\left[ \\overline{x}_n - t_{1 - \\frac{\\alpha}{2}; n-1} \\cdot \\sqrt{\\frac{s_n^2}{n}}, \\overline{x}_n + t_{1 - \\frac{\\alpha}{2}; n-1} \\cdot \\sqrt{\\frac{s_n^2}{n}} \\right]`} \n - Intervallo unilatero da sinistra:
{r`\\mu \\in \\left( -\\infty, \\overline{x}_n + t_{1 - \\frac{\\alpha}{2}; n-1} \\cdot \\sqrt{\\frac{s_n^2}{n}} \\right]`} \n - Intervallo unilatero da destra:
{r`\\mu \\in \\left[ \\overline{x}_n - t_{1 - \\frac{\\alpha}{2}; n-1} \\cdot \\sqrt{\\frac{s_n^2}{n}}, +\\infty \\right)`} \n
\n \n {r`t_{\\alpha, v}`} è un quantile della distribuzione di Student di parametro v .\n
\n \n \n \n \n \n L'intervallo di confidenza per la proprorzione di una bernoulliana qualsiasi si ottiene da questa formula:\n
\n \n {r`p \\in \\left[ \\overline{p} - z_{1 - \\frac{\\alpha}{2}} \\cdot \\sqrt{\\frac{\\overline{p} \\cdot (1 - \\overline{p})}{n+4}}, \\overline{p} + z_{1 - \\frac{\\alpha}{2}} \\cdot \\sqrt{\\frac{\\overline{p} \\cdot (1 - \\overline{p})}{n+4}} \\right]`} \n
\n \n \n \n \n \n L'intervallo di confidenza per la media di una qualsiasi popolazione si ottiene da questa formula:\n
\n \n {r`m \\in \\left[ \\overline{x}_n - z_{1 - \\frac{\\alpha}{2}} \\cdot \\sqrt{\\frac{s^2_n}{n}}, \\overline{x}_n + z_{1 - \\frac{\\alpha}{2}} \\cdot \\sqrt{\\frac{s^2_n}{n}} \\right]`} \n
\n \n \n \n )\n\t}\n}\n\n\n// WEBPACK FOOTER //\n// ./pages/statistica.js","import './index.css';\nimport './manifest.json';\nimport { Component } from 'preact';\nimport Router from 'preact-router';\nimport Home from './pages/home';\nimport Fisica from './pages/fisica';\nimport VlDiGeometria from './pages/vldigeometria';\nimport MingwInstall from './pages/mingwinstall';\nimport Copyright from './components/copyright';\nimport Statistica from './pages/statistica';\n\n// noinspection JSUnusedGlobalSymbols\nexport default class App extends Component {\n\trender() {\n\t\treturn (\n\t\t\t\n\t\t\t\tAppuntiweb di Steffo
\n\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t \n\t\t\t\t m && m.default ? m.default : m;\n\nlet app = interopDefault(require('preact-cli-entrypoint'));\n\nif (typeof app === 'function') {\n\tlet root = document.body.firstElementChild;\n\n\tlet init = () => {\n\t\tlet app = interopDefault(require('preact-cli-entrypoint'));\n\t\troot = (0, _preact.render)((0, _preact.h)(app), document.body, root);\n\t};\n\n\tif (module.hot) module.hot.accept('preact-cli-entrypoint', init);\n\n\tinit();\n}\n\n\n// WEBPACK FOOTER //\n// ../node_modules/preact-cli/lib/lib/entry.js","// removed by extract-text-webpack-plugin\nmodule.exports = {\"copyright\":\"copyright__TBGn1\"};\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./components/copyright.css\n// module id = qMTX\n// module chunks = 0","// removed by extract-text-webpack-plugin\nmodule.exports = {\"todo\":\"todo__5Soco\"};\n\n\n//////////////////\n// WEBPACK FOOTER\n// ./components/todo.css\n// module id = tO1d\n// module chunks = 0"],"sourceRoot":""}