axyseo 2.1.12 → 2.1.13

package/build/parse/build/private/adapt.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"adapt.js","names":["combineIntoImplicitParagraphs","adaptAttributes","isPhrasingContent","isEmpty","Paragraph","Text","Heading","Node","isParagraph","nodeName","isHeading","includes","isText","isBlockElement","isOverarchingParagraph","children","some","node","index","childNodes","nextNode","length","name","adapt","tree","isOverarching","map","sourceCodeLocation","attributes","attrs","headingLevel","parseInt"],"sources":["../../../../src/parse/build/private/adapt.js"],"sourcesContent":["import combineIntoImplicitParagraphs from \"./combineIntoImplicitParagraphs\";\nimport adaptAttributes from \"./adaptAttributes\";\nimport isPhrasingContent from \"./isPhrasingContent\";\nimport { isEmpty } from \"lodash\";\nimport { Paragraph, Text, Heading, Node } from \"../../structure\";\n\n/**\n * Whether the element with the specified name is a paragraph.\n *\n * @param {string} nodeName The name/tag of the node.\n *\n * @returns {boolean} Whether the element is considered a paragraph.\n */\nfunction isParagraph( nodeName ) {\n\treturn nodeName === \"p\";\n}\n\n/**\n * Whether the element with the specified name is a heading.\n *\n * @param {string} nodeName The name/tag of the node.\n *\n * @returns {boolean} Whether the element is considered a heading.\n */\nfunction isHeading( nodeName ) {\n\treturn [ \"h1\", \"h2\", \"h3\", \"h4\", \"h5\", \"h6\" ].includes( nodeName );\n}\n\n/**\n * Whether the element is text.\n *\n * @param {string} nodeName The name/tag of the node.\n *\n * @returns {boolean} Whether the element is considered text.\n */\nfunction isText( nodeName ) {\n\treturn nodeName === \"#text\";\n}\n\n/**\n * Whether the element with the specified name is a block level element.\n *\n * @param {string} nodeName The name/tag of the node.\n *\n * @returns {boolean} Whether the element is considered a block level element.\n */\nfunction isBlockElement( nodeName ) {\n\treturn ! (\n\t\tisParagraph( nodeName ) ||\n\t\tisPhrasingContent( nodeName ) ||\n\t\tisHeading( nodeName )\n\t);\n}\n\n/**\n * Checks whether the current node is an overarching paragraph.\n * Overarching paragraphs have double `<br>` nodes (line breaks) in their children.\n * We consider those to be indicating the end and start of an implicit paragraph, similar to the `autop` function in WordPress.\n *\n * @param {string} nodeName The name of the current node.\n * @param {Node[]} children The children of the current nodes.\n *\n * @returns {boolean} Whether the current node is an overarching paragraph.\n */\nfunction isOverarchingParagraph( nodeName, children ) {\n\treturn isParagraph( nodeName ) && children.some( ( node, index, childNodes ) => {\n\t\tconst nextNode = childNodes.length - 1 !== index && childNodes[ index + 1 ];\n\t\treturn node.name === \"br\" && nextNode && nextNode.name === \"br\";\n\t} );\n}\n\n/**\n * Adapts the `parse5` tree to our own tree representation.\n *\n * By adapting the external `parse5` structure to our own tree representation\n * we reduce the coupling between our code and theirs, which makes our code\n * more robust against changes in the `parse5` library. [See also this blog post about coupling](https://mrpicky.dev/six-shades-of-coupling/)\n *\n * @param {Object} tree The parse5 tree representation.\n *\n * @returns {Node} The adapted tree.\n */\nexport default function adapt( tree ) {\n\tif ( isText( tree.nodeName ) ) {\n\t\treturn new Text( tree );\n\t}\n\n\tlet children = [];\n\tlet isOverarching = false;\n\tif ( ! isEmpty( tree.childNodes ) ) {\n\t\tchildren = tree.childNodes.map( adapt );\n\t\tif ( isBlockElement( tree.nodeName ) ) {\n\t\t\tchildren = combineIntoImplicitParagraphs( children, tree.sourceCodeLocation );\n\t\t}\n\t\tif ( isOverarchingParagraph( tree.nodeName, children ) ) {\n\t\t\tisOverarching = true;\n\t\t\tchildren = combineIntoImplicitParagraphs( children, tree.sourceCodeLocation );\n\t\t}\n\t}\n\n\tconst attributes = adaptAttributes( tree.attrs );\n\n\tif ( isParagraph( tree.nodeName ) ) {\n\t\treturn new Paragraph( attributes, children, tree.sourceCodeLocation, false, isOverarching );\n\t}\n\n\tif ( isHeading( tree.nodeName ) ) {\n\t\tconst headingLevel = parseInt( tree.nodeName[ 1 ], 10 );\n\t\treturn new Heading( headingLevel, attributes, children, tree.sourceCodeLocation );\n\t}\n\n\treturn new Node( tree.nodeName, attributes, children, tree.sourceCodeLocation );\n}\n"],"mappings":"AAAA,OAAOA,6BAA6B;AACpC,OAAOC,eAAe;AACtB,OAAOC,iBAAiB;AACxB,SAASC,OAAO,QAAQ,QAAQ;AAChC,SAASC,SAAS,EAAEC,IAAI,EAAEC,OAAO,EAAEC,IAAI;;AAEvC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,WAAWA,CAAEC,QAAQ,EAAG;EAChC,OAAOA,QAAQ,KAAK,GAAG;AACxB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,SAASA,CAAED,QAAQ,EAAG;EAC9B,OAAO,CAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAE,CAACE,QAAQ,CAAEF,QAAS,CAAC;AACnE;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASG,MAAMA,CAAEH,QAAQ,EAAG;EAC3B,OAAOA,QAAQ,KAAK,OAAO;AAC5B;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASI,cAAcA,CAAEJ,QAAQ,EAAG;EACnC,OAAO,EACND,WAAW,CAAEC,QAAS,CAAC,IACvBP,iBAAiB,CAAEO,QAAS,CAAC,IAC7BC,SAAS,CAAED,QAAS,CAAC,CACrB;AACF;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASK,sBAAsBA,CAAEL,QAAQ,EAAEM,QAAQ,EAAG;EACrD,OAAOP,WAAW,CAAEC,QAAS,CAAC,IAAIM,QAAQ,CAACC,IAAI,CAAE,CAAEC,IAAI,EAAEC,KAAK,EAAEC,UAAU,KAAM;IAC/E,MAAMC,QAAQ,GAAGD,UAAU,CAACE,MAAM,GAAG,CAAC,KAAKH,KAAK,IAAIC,UAAU,CAAED,KAAK,GAAG,CAAC,CAAE;IAC3E,OAAOD,IAAI,CAACK,IAAI,KAAK,IAAI,IAAIF,QAAQ,IAAIA,QAAQ,CAACE,IAAI,KAAK,IAAI;EAChE,CAAE,CAAC;AACJ;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAASC,KAAKA,CAAEC,IAAI,EAAG;EACrC,IAAKZ,MAAM,CAAEY,IAAI,CAACf,QAAS,CAAC,EAAG;IAC9B,OAAO,IAAIJ,IAAI,CAAEmB,IAAK,CAAC;EACxB;EAEA,IAAIT,QAAQ,GAAG,EAAE;EACjB,IAAIU,aAAa,GAAG,KAAK;EACzB,IAAK,CAAEtB,OAAO,CAAEqB,IAAI,CAACL,UAAW,CAAC,EAAG;IACnCJ,QAAQ,GAAGS,IAAI,CAACL,UAAU,CAACO,GAAG,CAAEH,KAAM,CAAC;IACvC,IAAKV,cAAc,CAAEW,IAAI,CAACf,QAAS,CAAC,EAAG;MACtCM,QAAQ,GAAGf,6BAA6B,CAAEe,QAAQ,EAAES,IAAI,CAACG,kBAAmB,CAAC;IAC9E;IACA,IAAKb,sBAAsB,CAAEU,IAAI,CAACf,QAAQ,EAAEM,QAAS,CAAC,EAAG;MACxDU,aAAa,GAAG,IAAI;MACpBV,QAAQ,GAAGf,6BAA6B,CAAEe,QAAQ,EAAES,IAAI,CAACG,kBAAmB,CAAC;IAC9E;EACD;EAEA,MAAMC,UAAU,GAAG3B,eAAe,CAAEuB,IAAI,CAACK,KAAM,CAAC;EAEhD,IAAKrB,WAAW,CAAEgB,IAAI,CAACf,QAAS,CAAC,EAAG;IACnC,OAAO,IAAIL,SAAS,CAAEwB,UAAU,EAAEb,QAAQ,EAAES,IAAI,CAACG,kBAAkB,EAAE,KAAK,EAAEF,aAAc,CAAC;EAC5F;EAEA,IAAKf,SAAS,CAAEc,IAAI,CAACf,QAAS,CAAC,EAAG;IACjC,MAAMqB,YAAY,GAAGC,QAAQ,CAAEP,IAAI,CAACf,QAAQ,CAAE,CAAC,CAAE,EAAE,EAAG,CAAC;IACvD,OAAO,IAAIH,OAAO,CAAEwB,YAAY,EAAEF,UAAU,EAAEb,QAAQ,EAAES,IAAI,CAACG,kBAAmB,CAAC;EAClF;EAEA,OAAO,IAAIpB,IAAI,CAAEiB,IAAI,CAACf,QAAQ,EAAEmB,UAAU,EAAEb,QAAQ,EAAES,IAAI,CAACG,kBAAmB,CAAC;AAChF","ignoreList":[]}

package/build/parse/build/private/adaptAttributes.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"adaptAttributes.js","names":["parseClassAttribute","adaptAttributes","parse5attributes","attributes","forEach","name","value"],"sources":["../../../../src/parse/build/private/adaptAttributes.js"],"sourcesContent":["import parseClassAttribute from \"./helpers/parseClassAttribute\";\n\n/**\n * @typedef Parse5Attribute\n * @property {string} name The name of the attribute.\n * @property {string} value The value of the attribute.\n */\n\n/**\n * Adapts name-value attribute pairs as output by `parse5`\n * and transforms it into an easier to use object mapping attribute names\n * to values.\n *\n * @param {Parse5Attribute[]|null} parse5attributes The attributes as name-value pairs.\n *\n * @returns {Object} The attributes as an object mapping attribute name to value.\n */\nfunction adaptAttributes( parse5attributes ) {\n\tif ( ! parse5attributes ) {\n\t\treturn {};\n\t}\n\n\tconst attributes = {};\n\n\tparse5attributes.forEach( ( { name, value } ) => {\n\t\tif ( name === \"class\" ) {\n\t\t\tvalue = parseClassAttribute( value );\n\t\t}\n\t\tattributes[ name ] = value;\n\t} );\n\n\n\treturn attributes;\n}\n\nexport default adaptAttributes;\n"],"mappings":"AAAA,OAAOA,mBAAmB;;AAE1B;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,eAAeA,CAAEC,gBAAgB,EAAG;EAC5C,IAAK,CAAEA,gBAAgB,EAAG;IACzB,OAAO,CAAC,CAAC;EACV;EAEA,MAAMC,UAAU,GAAG,CAAC,CAAC;EAErBD,gBAAgB,CAACE,OAAO,CAAE,CAAE;IAAEC,IAAI;IAAEC;EAAM,CAAC,KAAM;IAChD,IAAKD,IAAI,KAAK,OAAO,EAAG;MACvBC,KAAK,GAAGN,mBAAmB,CAAEM,KAAM,CAAC;IACrC;IACAH,UAAU,CAAEE,IAAI,CAAE,GAAGC,KAAK;EAC3B,CAAE,CAAC;EAGH,OAAOH,UAAU;AAClB;AAEA,eAAeF,eAAe","ignoreList":[]}

package/build/parse/build/private/alwaysFilterElements.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"alwaysFilterElements.js","names":["elementHasName","elementHasClass","elementHasID","canBeChildOfParagraph","permanentFilters"],"sources":["../../../../src/parse/build/private/alwaysFilterElements.js"],"sourcesContent":["/**\n * A config file that contains filters that should always apply.\n */\n\nimport { elementHasName, elementHasClass, elementHasID } from \"./filterHelpers\";\n\n// These are elements that we don't want to include in the analysis and that can be child nodes of paragraphs or headings.\nexport const canBeChildOfParagraph = [ \"code\", \"kbd\", \"math\", \"q\", \"samp\", \"script\", \"var\", \"#comment\", \"cite\", \"form\",\n\t\"map\", \"noscript\", \"output\" ];\n\nconst permanentFilters = [\n\t// Filters out Yoast blocks that don't need to be part of the analysis.\n\t// The only Yoast blocks that are not filtered out are the FAQ and the How-to block.\n\t// The other Yoast blocks we want to filter (i.e. Yoast siblings, Yoast subpages, Yoast breadcrumbs) enter the Paper as HTML comments.\n\t// Comments are filtered out in `filterBeforeTokenizing.js` step.\n\telementHasClass( \"yoast-table-of-contents\" ),\n\telementHasClass( \"yoast-reading-time__wrapper\" ),\n\t// Filters for Elementor widgets\n\telementHasID( \"breadcrumbs\" ),\n\telementHasClass( \"elementor-button-wrapper\" ),\n\telementHasClass( \"elementor-divider\" ),\n\telementHasClass( \"elementor-spacer\" ),\n\telementHasClass( \"elementor-custom-embed\" ),\n\telementHasClass( \"elementor-icon-wrapper\" ),\n\telementHasClass( \"elementor-icon-box-wrapper\" ),\n\telementHasClass( \"elementor-counter\" ),\n\telementHasClass( \"elementor-progress-wrapper\" ),\n\t// This element is used for the progress bar widget title.\n\telementHasClass( \"elementor-title\" ),\n\telementHasClass( \"elementor-alert\" ),\n\telementHasClass( \"elementor-soundcloud-wrapper\" ),\n\telementHasClass( \"elementor-shortcode\" ),\n\telementHasClass( \"elementor-menu-anchor\" ),\n\telementHasClass( \"e-rating\" ),\n\t// Filters out HTML elements.\n\t/* Elements are filtered out when: they contain content outside of the author's control (incl. quotes and embedded\n\tcontent); their content isn't natural language (e.g. code); they contain metadata hidden from the page visitor\n\t(e.g. <style>); they are used to accept input from the visitor. Deprecated HTML elements are not included.*/\n\telementHasName( \"base\" ),\n\telementHasName( \"blockquote\" ),\n\telementHasName( \"canvas\" ),\n\telementHasName( \"code\" ),\n\t// It seems that the <head> element is filtered out by the parser we employ, but it's included here for completeness.\n\telementHasName( \"head\" ),\n\telementHasName( \"iframe\" ),\n\telementHasName( \"input\" ),\n\telementHasName( \"kbd\" ),\n\telementHasName( \"link\" ),\n\telementHasName( \"math\" ),\n\telementHasName( \"meta\" ),\n\telementHasName( \"meter\" ),\n\telementHasName( \"noscript\" ),\n\telementHasName( \"object\" ),\n\telementHasName( \"portal\" ),\n\telementHasName( \"pre\" ),\n\telementHasName( \"progress\" ),\n\telementHasName( \"q\" ),\n\telementHasName( \"samp\" ),\n\telementHasName( \"script\" ),\n\telementHasName( \"slot\" ),\n\telementHasName( \"style\" ),\n\telementHasName( \"svg\" ),\n\telementHasName( \"template\" ),\n\telementHasName( \"textarea\" ),\n\telementHasName( \"title\" ),\n\telementHasName( \"var\" ),\n\telementHasName( \"#comment\" ),\n\telementHasName( \"cite\" ),\n\telementHasName( \"form\" ),\n\telementHasName( \"map\" ),\n\telementHasName( \"noscript\" ),\n\telementHasName( \"output\" ),\n];\n\nexport default permanentFilters;\n"],"mappings":"AAAA;AACA;AACA;;AAEA,SAASA,cAAc,EAAEC,eAAe,EAAEC,YAAY;;AAEtD;AACA,OAAO,MAAMC,qBAAqB,GAAG,CAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,EACrH,KAAK,EAAE,UAAU,EAAE,QAAQ,CAAE;AAE9B,MAAMC,gBAAgB,GAAG;AACxB;AACA;AACA;AACA;AACAH,eAAe,CAAE,yBAA0B,CAAC,EAC5CA,eAAe,CAAE,6BAA8B,CAAC;AAChD;AACAC,YAAY,CAAE,aAAc,CAAC,EAC7BD,eAAe,CAAE,0BAA2B,CAAC,EAC7CA,eAAe,CAAE,mBAAoB,CAAC,EACtCA,eAAe,CAAE,kBAAmB,CAAC,EACrCA,eAAe,CAAE,wBAAyB,CAAC,EAC3CA,eAAe,CAAE,wBAAyB,CAAC,EAC3CA,eAAe,CAAE,4BAA6B,CAAC,EAC/CA,eAAe,CAAE,mBAAoB,CAAC,EACtCA,eAAe,CAAE,4BAA6B,CAAC;AAC/C;AACAA,eAAe,CAAE,iBAAkB,CAAC,EACpCA,eAAe,CAAE,iBAAkB,CAAC,EACpCA,eAAe,CAAE,8BAA+B,CAAC,EACjDA,eAAe,CAAE,qBAAsB,CAAC,EACxCA,eAAe,CAAE,uBAAwB,CAAC,EAC1CA,eAAe,CAAE,UAAW,CAAC;AAC7B;AACA;AACD;AACA;AACCD,cAAc,CAAE,MAAO,CAAC,EACxBA,cAAc,CAAE,YAAa,CAAC,EAC9BA,cAAc,CAAE,QAAS,CAAC,EAC1BA,cAAc,CAAE,MAAO,CAAC;AACxB;AACAA,cAAc,CAAE,MAAO,CAAC,EACxBA,cAAc,CAAE,QAAS,CAAC,EAC1BA,cAAc,CAAE,OAAQ,CAAC,EACzBA,cAAc,CAAE,KAAM,CAAC,EACvBA,cAAc,CAAE,MAAO,CAAC,EACxBA,cAAc,CAAE,MAAO,CAAC,EACxBA,cAAc,CAAE,MAAO,CAAC,EACxBA,cAAc,CAAE,OAAQ,CAAC,EACzBA,cAAc,CAAE,UAAW,CAAC,EAC5BA,cAAc,CAAE,QAAS,CAAC,EAC1BA,cAAc,CAAE,QAAS,CAAC,EAC1BA,cAAc,CAAE,KAAM,CAAC,EACvBA,cAAc,CAAE,UAAW,CAAC,EAC5BA,cAAc,CAAE,GAAI,CAAC,EACrBA,cAAc,CAAE,MAAO,CAAC,EACxBA,cAAc,CAAE,QAAS,CAAC,EAC1BA,cAAc,CAAE,MAAO,CAAC,EACxBA,cAAc,CAAE,OAAQ,CAAC,EACzBA,cAAc,CAAE,KAAM,CAAC,EACvBA,cAAc,CAAE,UAAW,CAAC,EAC5BA,cAAc,CAAE,UAAW,CAAC,EAC5BA,cAAc,CAAE,OAAQ,CAAC,EACzBA,cAAc,CAAE,KAAM,CAAC,EACvBA,cAAc,CAAE,UAAW,CAAC,EAC5BA,cAAc,CAAE,MAAO,CAAC,EACxBA,cAAc,CAAE,MAAO,CAAC,EACxBA,cAAc,CAAE,KAAM,CAAC,EACvBA,cAAc,CAAE,UAAW,CAAC,EAC5BA,cAAc,CAAE,QAAS,CAAC,CAC1B;AAED,eAAeI,gBAAgB","ignoreList":[]}

package/build/parse/build/private/combineIntoImplicitParagraphs.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"combineIntoImplicitParagraphs.js","names":["isPhrasingContent","Paragraph","isEmpty","SourceCodeLocation","isInterElementWhitespace","node","name","value","match","hasChildren","childNodes","length","updateImplicitParagraphLocation","implicitParagraph","firstChild","slice","lastChild","sourceCodeRange","sourceCodeLocation","startOffset","endOffset","isPartOfDoubleBreak","currentNode","prevNode","nextNode","prevNodeIsBreak","nextNodeIsBreak","combineIntoImplicitParagraphs","nodes","parentSourceCodeLocation","newNodes","currentSourceCodeLocation","firstNode","lastNode","startTag","endTag","createImplicit","forEach","index","allNodes","push"],"sources":["../../../../src/parse/build/private/combineIntoImplicitParagraphs.js"],"sourcesContent":["import isPhrasingContent from \"./isPhrasingContent\";\nimport { Paragraph } from \"../../structure\";\nimport { isEmpty } from \"lodash\";\nimport SourceCodeLocation from \"../../structure/SourceCodeLocation\";\n\n/**\n * Checks whether a node is inter-element whitespace.\n *\n * @see https://html.spec.whatwg.org/#inter-element-whitespace\n *\n * @param {Object} node The node to check.\n *\n * @returns {boolean} Whether the node is inter-element whitespace.\n */\nfunction isInterElementWhitespace( node ) {\n\treturn node.name === \"#text\" && node.value && node.value.match( /^[\\n\\s]+$/g );\n}\n\n/**\n * Checks whether a node has any children.\n *\n * @param {Object} node The node to check.\n *\n * @returns {boolean} Whether the node has any children.\n */\nfunction hasChildren( node ) {\n\treturn node && node.childNodes.length > 0;\n}\n\n/**\n * Updates the source code location of an implicit paragraph based on its children.\n * @param {Paragraph} implicitParagraph The implicit paragraph to update.\n * @returns {void}\n */\nconst updateImplicitParagraphLocation = ( implicitParagraph ) => {\n\tconst [ firstChild ] = implicitParagraph.childNodes.slice( 0 );\n\tconst [ lastChild ] = implicitParagraph.childNodes.slice( -1 );\n\tif ( ( firstChild.sourceCodeRange || firstChild.sourceCodeLocation ) && ( lastChild.sourceCodeRange || lastChild.sourceCodeLocation ) ) {\n\t\tconst startOffset = firstChild.sourceCodeRange ? firstChild.sourceCodeRange.startOffset : firstChild.sourceCodeLocation.startOffset;\n\t\tconst endOffset = lastChild.sourceCodeRange ? lastChild.sourceCodeRange.endOffset : lastChild.sourceCodeLocation.endOffset;\n\t\timplicitParagraph.sourceCodeLocation = new SourceCodeLocation( { startOffset: startOffset, endOffset: endOffset } );\n\t}\n};\n\n/**\n * Checks whether the current node is part of a double line break.\n * @param {Node} currentNode The current node.\n * @param {Node} prevNode The previous node (if available).\n * @param {Node} nextNode The next node (if available).\n * @returns {boolean} Whether the current node is part of a double line break\n */\nconst isPartOfDoubleBreak = ( currentNode, prevNode, nextNode ) => {\n\tconst prevNodeIsBreak = prevNode && prevNode.name === \"br\";\n\tconst nextNodeIsBreak = nextNode && nextNode.name === \"br\";\n\treturn currentNode.name === \"br\" && ( prevNodeIsBreak || nextNodeIsBreak );\n};\n\n/**\n * Combines series of consecutive phrasing content (\"inline\" tags like `a` and `span`, and text) into implicit paragraphs.\n *\n * @see https://html.spec.whatwg.org/#paragraphs\n *\n * @param {Array} nodes The nodes to combine where able to.\n * @param {Object} parentSourceCodeLocation This parent node's location in the source code, from parse5.\n *\n * @returns {Array} The combined nodes.\n */\nfunction combineIntoImplicitParagraphs( nodes, parentSourceCodeLocation = {} ) {\n\tconst newNodes = [];\n\tlet currentSourceCodeLocation = {};\n\t// For implicit paragraphs, strip off the start and end tag information from the parent's source code location.\n\tif ( isEmpty( parentSourceCodeLocation ) ) {\n\t\tconst firstNode = nodes[ 0 ];\n\t\tconst lastNode = nodes[ nodes.length - 1 ];\n\n\t\tif ( firstNode && lastNode && firstNode.sourceCodeLocation && lastNode.sourceCodeLocation ) {\n\t\t\tcurrentSourceCodeLocation = new SourceCodeLocation( {\n\t\t\t\tstartOffset: firstNode.sourceCodeLocation.startOffset,\n\t\t\t\tendOffset: lastNode.sourceCodeLocation.endOffset,\n\t\t\t} );\n\t\t}\n\t} else {\n\t\tcurrentSourceCodeLocation = new SourceCodeLocation( {\n\t\t\tstartOffset: parentSourceCodeLocation.startTag\n\t\t\t\t? parentSourceCodeLocation.startTag.endOffset\n\t\t\t\t: parentSourceCodeLocation.startOffset,\n\t\t\tendOffset: parentSourceCodeLocation.endTag\n\t\t\t\t? parentSourceCodeLocation.endTag.startOffset\n\t\t\t\t: parentSourceCodeLocation.endOffset,\n\t\t} );\n\t}\n\n\tlet implicitParagraph = Paragraph.createImplicit( {}, [], currentSourceCodeLocation );\n\tnodes.forEach( ( node, index, allNodes ) => {\n\t\tconst prevNode = 0 !== index && allNodes[ index - 1 ];\n\t\tconst nextNode = allNodes.length - 1 !== index && allNodes[ index + 1 ];\n\n\t\tif ( isPhrasingContent( node.name ) && ! isInterElementWhitespace( node ) && ! isPartOfDoubleBreak( node, prevNode, nextNode ) ) {\n\t\t\t// If the node is phrasing content, add it to the implicit paragraph.\n\t\t\timplicitParagraph.childNodes.push( node );\n\t\t} else {\n\t\t\t// If the node is not phrasing content, this means that the implicit paragraph has ended.\n\t\t\tif ( hasChildren( implicitParagraph ) ) {\n\t\t\t\t// If the implicit paragraph has children this means an implicit paragraph was created:\n\t\t\t\t// end the current implicit paragraph and start a new one.\n\n\t\t\t\t// But before pushing, we need to update the source code location of the implicit paragraph based on its child nodes.\n\t\t\t\tupdateImplicitParagraphLocation( implicitParagraph );\n\n\t\t\t\t// Update the startOffset of the next implicit paragraph to be the end of the current node.\n\t\t\t\tif ( node.sourceCodeLocation ) {\n\t\t\t\t\tcurrentSourceCodeLocation.startOffset = node.sourceCodeLocation.endOffset;\n\t\t\t\t}\n\n\t\t\t\tnewNodes.push( implicitParagraph );\n\t\t\t\timplicitParagraph = Paragraph.createImplicit( {}, [], currentSourceCodeLocation );\n\t\t\t}\n\t\t\tnewNodes.push( node );\n\t\t}\n\t} );\n\n\tif ( hasChildren( implicitParagraph ) ) {\n\t\tupdateImplicitParagraphLocation( implicitParagraph );\n\n\t\tnewNodes.push( implicitParagraph );\n\t}\n\treturn newNodes;\n}\n\nexport default combineIntoImplicitParagraphs;\n"],"mappings":"AAAA,OAAOA,iBAAiB;AACxB,SAASC,SAAS;AAClB,SAASC,OAAO,QAAQ,QAAQ;AAChC,OAAOC,kBAAkB;;AAEzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,wBAAwBA,CAAEC,IAAI,EAAG;EACzC,OAAOA,IAAI,CAACC,IAAI,KAAK,OAAO,IAAID,IAAI,CAACE,KAAK,IAAIF,IAAI,CAACE,KAAK,CAACC,KAAK,CAAE,YAAa,CAAC;AAC/E;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,WAAWA,CAAEJ,IAAI,EAAG;EAC5B,OAAOA,IAAI,IAAIA,IAAI,CAACK,UAAU,CAACC,MAAM,GAAG,CAAC;AAC1C;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAMC,+BAA+B,GAAKC,iBAAiB,IAAM;EAChE,MAAM,CAAEC,UAAU,CAAE,GAAGD,iBAAiB,CAACH,UAAU,CAACK,KAAK,CAAE,CAAE,CAAC;EAC9D,MAAM,CAAEC,SAAS,CAAE,GAAGH,iBAAiB,CAACH,UAAU,CAACK,KAAK,CAAE,CAAC,CAAE,CAAC;EAC9D,IAAK,CAAED,UAAU,CAACG,eAAe,IAAIH,UAAU,CAACI,kBAAkB,MAAQF,SAAS,CAACC,eAAe,IAAID,SAAS,CAACE,kBAAkB,CAAE,EAAG;IACvI,MAAMC,WAAW,GAAGL,UAAU,CAACG,eAAe,GAAGH,UAAU,CAACG,eAAe,CAACE,WAAW,GAAGL,UAAU,CAACI,kBAAkB,CAACC,WAAW;IACnI,MAAMC,SAAS,GAAGJ,SAAS,CAACC,eAAe,GAAGD,SAAS,CAACC,eAAe,CAACG,SAAS,GAAGJ,SAAS,CAACE,kBAAkB,CAACE,SAAS;IAC1HP,iBAAiB,CAACK,kBAAkB,GAAG,IAAIf,kBAAkB,CAAE;MAAEgB,WAAW,EAAEA,WAAW;MAAEC,SAAS,EAAEA;IAAU,CAAE,CAAC;EACpH;AACD,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,mBAAmB,GAAGA,CAAEC,WAAW,EAAEC,QAAQ,EAAEC,QAAQ,KAAM;EAClE,MAAMC,eAAe,GAAGF,QAAQ,IAAIA,QAAQ,CAACjB,IAAI,KAAK,IAAI;EAC1D,MAAMoB,eAAe,GAAGF,QAAQ,IAAIA,QAAQ,CAAClB,IAAI,KAAK,IAAI;EAC1D,OAAOgB,WAAW,CAAChB,IAAI,KAAK,IAAI,KAAMmB,eAAe,IAAIC,eAAe,CAAE;AAC3E,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,6BAA6BA,CAAEC,KAAK,EAAEC,wBAAwB,GAAG,CAAC,CAAC,EAAG;EAC9E,MAAMC,QAAQ,GAAG,EAAE;EACnB,IAAIC,yBAAyB,GAAG,CAAC,CAAC;EAClC;EACA,IAAK7B,OAAO,CAAE2B,wBAAyB,CAAC,EAAG;IAC1C,MAAMG,SAAS,GAAGJ,KAAK,CAAE,CAAC,CAAE;IAC5B,MAAMK,QAAQ,GAAGL,KAAK,CAAEA,KAAK,CAACjB,MAAM,GAAG,CAAC,CAAE;IAE1C,IAAKqB,SAAS,IAAIC,QAAQ,IAAID,SAAS,CAACd,kBAAkB,IAAIe,QAAQ,CAACf,kBAAkB,EAAG;MAC3Fa,yBAAyB,GAAG,IAAI5B,kBAAkB,CAAE;QACnDgB,WAAW,EAAEa,SAAS,CAACd,kBAAkB,CAACC,WAAW;QACrDC,SAAS,EAAEa,QAAQ,CAACf,kBAAkB,CAACE;MACxC,CAAE,CAAC;IACJ;EACD,CAAC,MAAM;IACNW,yBAAyB,GAAG,IAAI5B,kBAAkB,CAAE;MACnDgB,WAAW,EAAEU,wBAAwB,CAACK,QAAQ,GAC3CL,wBAAwB,CAACK,QAAQ,CAACd,SAAS,GAC3CS,wBAAwB,CAACV,WAAW;MACvCC,SAAS,EAAES,wBAAwB,CAACM,MAAM,GACvCN,wBAAwB,CAACM,MAAM,CAAChB,WAAW,GAC3CU,wBAAwB,CAACT;IAC7B,CAAE,CAAC;EACJ;EAEA,IAAIP,iBAAiB,GAAGZ,SAAS,CAACmC,cAAc,CAAE,CAAC,CAAC,EAAE,EAAE,EAAEL,yBAA0B,CAAC;EACrFH,KAAK,CAACS,OAAO,CAAE,CAAEhC,IAAI,EAAEiC,KAAK,EAAEC,QAAQ,KAAM;IAC3C,MAAMhB,QAAQ,GAAG,CAAC,KAAKe,KAAK,IAAIC,QAAQ,CAAED,KAAK,GAAG,CAAC,CAAE;IACrD,MAAMd,QAAQ,GAAGe,QAAQ,CAAC5B,MAAM,GAAG,CAAC,KAAK2B,KAAK,IAAIC,QAAQ,CAAED,KAAK,GAAG,CAAC,CAAE;IAEvE,IAAKtC,iBAAiB,CAAEK,IAAI,CAACC,IAAK,CAAC,IAAI,CAAEF,wBAAwB,CAAEC,IAAK,CAAC,IAAI,CAAEgB,mBAAmB,CAAEhB,IAAI,EAAEkB,QAAQ,EAAEC,QAAS,CAAC,EAAG;MAChI;MACAX,iBAAiB,CAACH,UAAU,CAAC8B,IAAI,CAAEnC,IAAK,CAAC;IAC1C,CAAC,MAAM;MACN;MACA,IAAKI,WAAW,CAAEI,iBAAkB,CAAC,EAAG;QACvC;QACA;;QAEA;QACAD,+BAA+B,CAAEC,iBAAkB,CAAC;;QAEpD;QACA,IAAKR,IAAI,CAACa,kBAAkB,EAAG;UAC9Ba,yBAAyB,CAACZ,WAAW,GAAGd,IAAI,CAACa,kBAAkB,CAACE,SAAS;QAC1E;QAEAU,QAAQ,CAACU,IAAI,CAAE3B,iBAAkB,CAAC;QAClCA,iBAAiB,GAAGZ,SAAS,CAACmC,cAAc,CAAE,CAAC,CAAC,EAAE,EAAE,EAAEL,yBAA0B,CAAC;MAClF;MACAD,QAAQ,CAACU,IAAI,CAAEnC,IAAK,CAAC;IACtB;EACD,CAAE,CAAC;EAEH,IAAKI,WAAW,CAAEI,iBAAkB,CAAC,EAAG;IACvCD,+BAA+B,CAAEC,iBAAkB,CAAC;IAEpDiB,QAAQ,CAACU,IAAI,CAAE3B,iBAAkB,CAAC;EACnC;EACA,OAAOiB,QAAQ;AAChB;AAEA,eAAeH,6BAA6B","ignoreList":[]}

package/build/parse/build/private/filterBeforeTokenizing.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"filterBeforeTokenizing.js","names":["isEmpty","canBeChildOfParagraph","excludeFromAnalysis","filterBeforeTokenizing","node","includes","name","childNodes","map"],"sources":["../../../../src/parse/build/private/filterBeforeTokenizing.js"],"sourcesContent":["import { isEmpty } from \"lodash\";\nimport { canBeChildOfParagraph as excludeFromAnalysis } from \"./alwaysFilterElements\";\n\n/**\n * Removes all child nodes from nodes that we want to exclude from the analysis, and that can be children of a paragraph\n * or heading.\n *\n * The child nodes are removed because we don't want to include any text between those nodes in the analysis.\n * If we don't remove them here, the text between those nodes will be considered as part of the paragraph's\n * inner text and will be tokenized.\n *\n * These changes are only necessary for elements that can be children of paragraphs or headings. For example, we also\n * don't want to analyze content in between `blockquote` tags, but these cannot be children of paragraphs/headings.\n * Because of that, they wouldn't interfere with tokenizing the text inside paragraphs and headings and calculating\n * the positions.\n *\n * @param {Node} node The node to check.\n *\n * @returns {Node} The filtered out node that's ready to be tokenized.\n */\nexport function filterBeforeTokenizing( node ) {\n\tif ( excludeFromAnalysis.includes( node.name ) ) {\n\t\tnode.childNodes = [];\n\t}\n\n\t// Recursively filters the node's children.\n\tif ( ! isEmpty( node.childNodes ) ) {\n\t\tnode.childNodes.map( filterBeforeTokenizing );\n\t}\n\n\treturn node;\n}\n"],"mappings":"AAAA,SAASA,OAAO,QAAQ,QAAQ;AAChC,SAASC,qBAAqB,IAAIC,mBAAmB;;AAErD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASC,sBAAsBA,CAAEC,IAAI,EAAG;EAC9C,IAAKF,mBAAmB,CAACG,QAAQ,CAAED,IAAI,CAACE,IAAK,CAAC,EAAG;IAChDF,IAAI,CAACG,UAAU,GAAG,EAAE;EACrB;;EAEA;EACA,IAAK,CAAEP,OAAO,CAAEI,IAAI,CAACG,UAAW,CAAC,EAAG;IACnCH,IAAI,CAACG,UAAU,CAACC,GAAG,CAAEL,sBAAuB,CAAC;EAC9C;EAEA,OAAOC,IAAI;AACZ","ignoreList":[]}

package/build/parse/build/private/filterHelpers.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"filterHelpers.js","names":["elementHasName","name","element","elementHasClass","className","blockElement","attributes","class","has","elementHasID","id"],"sources":["../../../../src/parse/build/private/filterHelpers.js"],"sourcesContent":["/**\n * Filter helpers for the html tree filter.\n * All helpers are functions that return a callback with the element as the only argument.\n */\n\n\n/**\n * Creates a callback that checks if an element has a specific name.\n *\n * @param {string} name The name to check.\n *\n * @returns {function(*)} A function that returns true if the element has a specific name.\n */\nexport function elementHasName( name ) {\n\treturn ( element ) => {\n\t\treturn element.name === name;\n\t};\n}\n\n/**\n * Creates a callback that checks the class of an element.\n *\n * @param {string} className The classname to filter out.\n *\n * @returns {function(*): boolean} A function that returns true if a Node has a certain class.\n */\nexport function elementHasClass( className ) {\n\treturn ( blockElement ) => {\n\t\treturn !! blockElement.attributes.class && blockElement.attributes.class.has( className );\n\t};\n}\n\n/**\n * Creates a callback that checks if an element has a certain ID.\n *\n * @param {string} id The ID we want to check against.\n *\n * @returns {function(*): boolean}  A function that returns true if an element has a certain ID.\n */\nexport function elementHasID( id ) {\n\treturn ( element ) => {\n\t\treturn element.attributes.id === id;\n\t};\n}\n"],"mappings":"AAAA;AACA;AACA;AACA;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASA,cAAcA,CAAEC,IAAI,EAAG;EACtC,OAASC,OAAO,IAAM;IACrB,OAAOA,OAAO,CAACD,IAAI,KAAKA,IAAI;EAC7B,CAAC;AACF;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASE,eAAeA,CAAEC,SAAS,EAAG;EAC5C,OAASC,YAAY,IAAM;IAC1B,OAAO,CAAC,CAAEA,YAAY,CAACC,UAAU,CAACC,KAAK,IAAIF,YAAY,CAACC,UAAU,CAACC,KAAK,CAACC,GAAG,CAAEJ,SAAU,CAAC;EAC1F,CAAC;AACF;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASK,YAAYA,CAAEC,EAAE,EAAG;EAClC,OAASR,OAAO,IAAM;IACrB,OAAOA,OAAO,CAACI,UAAU,CAACI,EAAE,KAAKA,EAAE;EACpC,CAAC;AACF","ignoreList":[]}

package/build/parse/build/private/filterTree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"filterTree.js","names":["Paragraph","shouldRemoveNode","node","filters","name","some","filter","filterTree","childNodes","childNode","length","isImplicit"],"sources":["../../../../src/parse/build/private/filterTree.js"],"sourcesContent":["import { Paragraph } from \"../../structure\";\n\n/**\n * Checks if a node should be kept or discarded.\n * @param {Node} \t\tnode \t\tA node.\n * @param {Function[]} \tfilters \tAn array of filter callbacks.\n * @returns {boolean} True if the node should be kept, false if the node should be discarded.\n */\nfunction shouldRemoveNode( node, filters ) {\n\t// Always keep text nodes.\n\tif ( node.name === \"#text\" ) {\n\t\treturn false;\n\t}\n\n\t// If any of the filters returns true, the node will be discarded.\n\treturn filters.some( filter => filter( node ) );\n}\n\n/**\n * A recursive function that removes all nodes based on an array of filters.\n * @param {Node} \t\tnode \t\tA node. (Could be the entire tree.)\n * @param {Function[]} \tfilters \tAn array of callbacks. If a callback returns true, the node is discarded.\n * @returns {Node|undefined} A Node with all undesired subtrees removed.\n */\nexport default function filterTree( node, filters ) {\n\t// Returns undefined when the node should be disregarded.\n\tif ( shouldRemoveNode( node, filters ) ) {\n\t\treturn;\n\t}\n\n\t// Recursively filters the node's children.\n\tif ( node.childNodes ) {\n\t\tnode.childNodes = node.childNodes.filter( childNode => filterTree( childNode, filters ) );\n\n\t\t// Drops implicit paragraphs if all their child nodes have been removed.\n\t\tif ( node.childNodes.length === 0 && node instanceof Paragraph && node.isImplicit ) {\n\t\t\treturn;\n\t\t}\n\t}\n\n\treturn node;\n}\n"],"mappings":"AAAA,SAASA,SAAS;;AAElB;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,gBAAgBA,CAAEC,IAAI,EAAEC,OAAO,EAAG;EAC1C;EACA,IAAKD,IAAI,CAACE,IAAI,KAAK,OAAO,EAAG;IAC5B,OAAO,KAAK;EACb;;EAEA;EACA,OAAOD,OAAO,CAACE,IAAI,CAAEC,MAAM,IAAIA,MAAM,CAAEJ,IAAK,CAAE,CAAC;AAChD;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAASK,UAAUA,CAAEL,IAAI,EAAEC,OAAO,EAAG;EACnD;EACA,IAAKF,gBAAgB,CAAEC,IAAI,EAAEC,OAAQ,CAAC,EAAG;IACxC;EACD;;EAEA;EACA,IAAKD,IAAI,CAACM,UAAU,EAAG;IACtBN,IAAI,CAACM,UAAU,GAAGN,IAAI,CAACM,UAAU,CAACF,MAAM,CAAEG,SAAS,IAAIF,UAAU,CAAEE,SAAS,EAAEN,OAAQ,CAAE,CAAC;;IAEzF;IACA,IAAKD,IAAI,CAACM,UAAU,CAACE,MAAM,KAAK,CAAC,IAAIR,IAAI,YAAYF,SAAS,IAAIE,IAAI,CAACS,UAAU,EAAG;MACnF;IACD;EACD;EAEA,OAAOT,IAAI;AACZ","ignoreList":[]}

package/build/parse/build/private/getTextElementPositions.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"getTextElementPositions.js","names":["Paragraph","canBeChildOfParagraph","excludeFromAnalysis","getDescendantPositions","descendantNodes","descendantTagPositions","forEach","node","includes","name","push","sourceCodeLocation","startTag","startRange","startOffset","endOffset","endTag","sort","a","b","adjustElementEnd","textElementStart","textElementEnd","position","adjustTextElementStart","getTextElementStart","isImplicit","getTextElementPositions","textElements","length","findAll","descendantNode","textElement","text","sourceCodeRange"],"sources":["../../../../src/parse/build/private/getTextElementPositions.js"],"sourcesContent":["import { Paragraph } from \"../../structure\";\nimport { canBeChildOfParagraph as excludeFromAnalysis } from \"./alwaysFilterElements\";\n\n/**\n * Gets the start and end positions of all descendant nodes' tags and stores them in an array.\n * Each object in the array represents an opening or closing tag for nodes that have tags, or the full node for nodes\n * without tags (such as 'comment' nodes).\n * The startOffset and endOffset properties of the objects correspond to the start and end positions of the tags, or the\n * start and end positions of the full node for nodes without tags.\n * Extracting this data into a separate array makes it easier to work with it (e.g. sort it and loop over it).\n *\n * @param {Node[]} descendantNodes\tThe descendant nodes to get positions from.\n *\n * @returns {SourceCodeRange[]}\tAn array of the locations of each start and end tag in the source code, or the start and\n * \t\t\t\t\t\t\t\tend locations of the full node for nodes without tags.\n *\n */\nfunction getDescendantPositions( descendantNodes ) {\n\tconst descendantTagPositions = [];\n\tdescendantNodes.forEach( ( node ) => {\n\t\t/*\n\t\t * For nodes whose content we don't want to analyze, we should add the length of the full node to the array, to\n\t\t * still take into account the whole element's length when calculating positions.\n\t\t */\n\t\tif ( excludeFromAnalysis.includes( node.name ) ) {\n\t\t\tdescendantTagPositions.push( node.sourceCodeLocation );\n\t\t} else {\n\t\t\tif ( node.sourceCodeLocation.startTag ) {\n\t\t\t\tconst startRange = {\n\t\t\t\t\tstartOffset: node.sourceCodeLocation.startTag.startOffset,\n\t\t\t\t\tendOffset: node.sourceCodeLocation.startTag.endOffset,\n\t\t\t\t};\n\t\t\t\t/*\n\t\t\t\t * Here, we need to account for the fact that earlier (in innerText.js), we treated a <br> as a newline character.\n\t\t\t\t * Therefore, we need to subtract 1 from the endOffset to not count it twice.\n\t\t\t\t */\n\t\t\t\tif ( node.name === \"br\" ) {\n\t\t\t\t\tstartRange.endOffset = startRange.endOffset - 1;\n\t\t\t\t}\n\t\t\t\tdescendantTagPositions.push( startRange );\n\t\t\t}\n\t\t\t/*\n\t\t\t * Check whether node has an end tag before adding it to the array.\n\t\t\t * Some nodes, such as the 'img' node, only have a start tag.\n\t\t\t */\n\t\t\tif ( node.sourceCodeLocation.endTag ) {\n\t\t\t\tdescendantTagPositions.push( node.sourceCodeLocation.endTag );\n\t\t\t}\n\t\t}\n\t} );\n\t// Sort the tag position objects by the start tag position in ascending order.\n\tdescendantTagPositions.sort( ( a, b ) => a.startOffset - b.startOffset );\n\n\treturn descendantTagPositions;\n}\n\n/**\n * Adjusts the end position of the text element to account for descendant node tags that overlap with the text element.\n * We want to add the length of tags that are directly preceding the start of the text, or that are between the start\n * and end of the text, to the end position of the text element.\n * For example, if the text is \"<span><em>Hello</em>, world!</span>\", the length of all tags except for the closing\n * </span> tag should be added to the end position of the sentence.\n *\n * @param {SourceCodeRange[]}\tdescendantTagPositions\tThe positions of the descendant nodes' tags.\n * @param {number}\t\t\t\ttextElementStart\t\tThe start position of a text element.\n * @param {number}\t\t\t\ttextElementEnd\t\t\tThe end position of a text element.\n *\n * @returns {number}\tThe adjusted end position of the text element.\n */\nfunction adjustElementEnd( descendantTagPositions, textElementStart, textElementEnd ) {\n\t/*\n\t * If the start position of a descendant's node tag is between the start and end position of the text element, or is\n\t * the same as the start position of the text element, add the tag's length to the end position of the text element.\n\t */\n\tdescendantTagPositions.forEach( ( position ) => {\n\t\tif ( position.startOffset >= textElementStart && position.startOffset < textElementEnd ) {\n\t\t\ttextElementEnd += ( position.endOffset - position.startOffset );\n\t\t}\n\t} );\n\n\treturn textElementEnd;\n}\n\n/**\n * Adjusts the start position of the text element to exclude descendant node tags at the beginning of the text element.\n * For example, the start position of the text element `<span>Hello!</span>`\n * should be adjusted to start at the `H`, not at the start tag of the opening `<span>` tag.\n * @param {SourceCodeRange[]} descendantTagPositions The positions of the descendant nodes' tags.\n * @param {Number} textElementStart The start position of a text element.\n *\n * @returns {Number} The adjusted start position of the text element.\n */\nfunction adjustTextElementStart( descendantTagPositions, textElementStart ) {\n\t/*\n\t * If the start position of a descendant's node tag is between the start and end position of the text element, or is\n\t * the same as the start/end position of the text element, add the tag's length to the end position of the text element.\n\t */\n\tdescendantTagPositions.forEach( ( position ) => {\n\t\tif ( position.startOffset === textElementStart ) {\n\t\t\ttextElementStart += ( position.endOffset - position.startOffset );\n\t\t}\n\t} );\n\n\treturn textElementStart;\n}\n\n/**\n * Retrieves the initial start offset for the first text element.\n * Normally, that is the end offset of the start tag of the parent node.\n * In case of implicit paragraphs, we use the start offset of the node as a whole.\n *\n * @param {Paragraph|Heading} node The node to retrieve the start position from.\n * @returns {number} The start offset for the first text element.\n */\nconst getTextElementStart = ( node ) => {\n\treturn node instanceof Paragraph && node.isImplicit\n\t\t? node.sourceCodeLocation.startOffset\n\t\t: node.sourceCodeLocation.startTag.endOffset;\n};\n\n/**\n * Gets the start and end positions of text elements (sentences or tokens) in the source code.\n *\n * @param {Paragraph|Heading} \t\tnode  \t\t\tThe paragraph or heading node.\n * @param {Sentence[]|Token[]} \t\ttextElements \tThe sentences or tokens in the node.\n * @param {number} \t\t\t\t\tstartOffset \tThe start position of the node in the source code.\n * Defaults to -1 which signals that it should not be used.\n *\n * @returns {Sentence[]|Token[]} The sentences or tokens, with their positions in the source code.\n */\nexport default function getTextElementPositions( node, textElements, startOffset = -1 ) {\n\t// We cannot calculate positions if there are no text elements, or if we don't know the node's source code location.\n\tif (  textElements.length === 0 || ! node.sourceCodeLocation ) {\n\t\treturn textElements;\n\t}\n\n\t/*\n\t * Set the (initial) start offset of the first text element.\n\t * If the start offset has been provided (in the case of Tokens), use that.\n\t * Otherwise, determine the start offset from the parent Paragraph or Heading node.\n\t */\n\tlet textElementStart = startOffset >= 0 ? startOffset : getTextElementStart( node );\n\n\tlet textElementEnd;\n\tlet descendantTagPositions = [];\n\n\t/*\n\t * Check if the node has any descendant nodes that have a sourceCodeLocation property (all nodes other than Text nodes\n\t * should have this property). If such nodes exist, store the positions of each node's opening and closing tags in\n\t * an array. These positions will have to be taken into account when calculating the position of the text elements.\n\t */\n\tif ( node.findAll ) {\n\t\tconst descendantNodes = node.findAll( descendantNode => descendantNode.sourceCodeLocation, true );\n\t\tif ( descendantNodes.length > 0 ) {\n\t\t\tdescendantTagPositions = getDescendantPositions( descendantNodes );\n\t\t}\n\t}\n\n\ttextElements.forEach( ( textElement ) => {\n\t\t// Set the end position to the start position + the length of the textElement.\n\t\ttextElementEnd = textElementStart + textElement.text.length;\n\n\t\t/*\n\t\t * If there are descendant tags, possibly adjust the textElementEnd and textElementStart.\n\t\t * The textElementEnd should be adjusted to include the length of any descendant tags until the end of the text, in\n\t\t * addition to the length of the text itself. Descendant tags AFTER the end of the text should not be included.\n\t\t * The textElementStart should be adjusted so that it is where the actual text starts, not including any descendant\n\t\t * tags preceding the text.\n\t\t */\n\t\tif ( descendantTagPositions.length > 0 ) {\n\t\t\ttextElementEnd = adjustElementEnd( descendantTagPositions, textElementStart, textElementEnd );\n\n\t\t\ttextElementStart = adjustTextElementStart( descendantTagPositions, textElementStart );\n\t\t}\n\n\t\t// Add the start and end positions to the textElement object.\n\t\ttextElement.sourceCodeRange = { startOffset: textElementStart, endOffset: textElementEnd };\n\n\t\t// Start position of the next textElement is the end position of current textElement.\n\t\ttextElementStart = textElementEnd;\n\t} );\n\n\treturn textElements;\n}\n"],"mappings":"AAAA,SAASA,SAAS;AAClB,SAASC,qBAAqB,IAAIC,mBAAmB;;AAErD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,sBAAsBA,CAAEC,eAAe,EAAG;EAClD,MAAMC,sBAAsB,GAAG,EAAE;EACjCD,eAAe,CAACE,OAAO,CAAIC,IAAI,IAAM;IACpC;AACF;AACA;AACA;IACE,IAAKL,mBAAmB,CAACM,QAAQ,CAAED,IAAI,CAACE,IAAK,CAAC,EAAG;MAChDJ,sBAAsB,CAACK,IAAI,CAAEH,IAAI,CAACI,kBAAmB,CAAC;IACvD,CAAC,MAAM;MACN,IAAKJ,IAAI,CAACI,kBAAkB,CAACC,QAAQ,EAAG;QACvC,MAAMC,UAAU,GAAG;UAClBC,WAAW,EAAEP,IAAI,CAACI,kBAAkB,CAACC,QAAQ,CAACE,WAAW;UACzDC,SAAS,EAAER,IAAI,CAACI,kBAAkB,CAACC,QAAQ,CAACG;QAC7C,CAAC;QACD;AACJ;AACA;AACA;QACI,IAAKR,IAAI,CAACE,IAAI,KAAK,IAAI,EAAG;UACzBI,UAAU,CAACE,SAAS,GAAGF,UAAU,CAACE,SAAS,GAAG,CAAC;QAChD;QACAV,sBAAsB,CAACK,IAAI,CAAEG,UAAW,CAAC;MAC1C;MACA;AACH;AACA;AACA;MACG,IAAKN,IAAI,CAACI,kBAAkB,CAACK,MAAM,EAAG;QACrCX,sBAAsB,CAACK,IAAI,CAAEH,IAAI,CAACI,kBAAkB,CAACK,MAAO,CAAC;MAC9D;IACD;EACD,CAAE,CAAC;EACH;EACAX,sBAAsB,CAACY,IAAI,CAAE,CAAEC,CAAC,EAAEC,CAAC,KAAMD,CAAC,CAACJ,WAAW,GAAGK,CAAC,CAACL,WAAY,CAAC;EAExE,OAAOT,sBAAsB;AAC9B;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASe,gBAAgBA,CAAEf,sBAAsB,EAAEgB,gBAAgB,EAAEC,cAAc,EAAG;EACrF;AACD;AACA;AACA;EACCjB,sBAAsB,CAACC,OAAO,CAAIiB,QAAQ,IAAM;IAC/C,IAAKA,QAAQ,CAACT,WAAW,IAAIO,gBAAgB,IAAIE,QAAQ,CAACT,WAAW,GAAGQ,cAAc,EAAG;MACxFA,cAAc,IAAMC,QAAQ,CAACR,SAAS,GAAGQ,QAAQ,CAACT,WAAa;IAChE;EACD,CAAE,CAAC;EAEH,OAAOQ,cAAc;AACtB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASE,sBAAsBA,CAAEnB,sBAAsB,EAAEgB,gBAAgB,EAAG;EAC3E;AACD;AACA;AACA;EACChB,sBAAsB,CAACC,OAAO,CAAIiB,QAAQ,IAAM;IAC/C,IAAKA,QAAQ,CAACT,WAAW,KAAKO,gBAAgB,EAAG;MAChDA,gBAAgB,IAAME,QAAQ,CAACR,SAAS,GAAGQ,QAAQ,CAACT,WAAa;IAClE;EACD,CAAE,CAAC;EAEH,OAAOO,gBAAgB;AACxB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMI,mBAAmB,GAAKlB,IAAI,IAAM;EACvC,OAAOA,IAAI,YAAYP,SAAS,IAAIO,IAAI,CAACmB,UAAU,GAChDnB,IAAI,CAACI,kBAAkB,CAACG,WAAW,GACnCP,IAAI,CAACI,kBAAkB,CAACC,QAAQ,CAACG,SAAS;AAC9C,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAASY,uBAAuBA,CAAEpB,IAAI,EAAEqB,YAAY,EAAEd,WAAW,GAAG,CAAC,CAAC,EAAG;EACvF;EACA,IAAMc,YAAY,CAACC,MAAM,KAAK,CAAC,IAAI,CAAEtB,IAAI,CAACI,kBAAkB,EAAG;IAC9D,OAAOiB,YAAY;EACpB;;EAEA;AACD;AACA;AACA;AACA;EACC,IAAIP,gBAAgB,GAAGP,WAAW,IAAI,CAAC,GAAGA,WAAW,GAAGW,mBAAmB,CAAElB,IAAK,CAAC;EAEnF,IAAIe,cAAc;EAClB,IAAIjB,sBAAsB,GAAG,EAAE;;EAE/B;AACD;AACA;AACA;AACA;EACC,IAAKE,IAAI,CAACuB,OAAO,EAAG;IACnB,MAAM1B,eAAe,GAAGG,IAAI,CAACuB,OAAO,CAAEC,cAAc,IAAIA,cAAc,CAACpB,kBAAkB,EAAE,IAAK,CAAC;IACjG,IAAKP,eAAe,CAACyB,MAAM,GAAG,CAAC,EAAG;MACjCxB,sBAAsB,GAAGF,sBAAsB,CAAEC,eAAgB,CAAC;IACnE;EACD;EAEAwB,YAAY,CAACtB,OAAO,CAAI0B,WAAW,IAAM;IACxC;IACAV,cAAc,GAAGD,gBAAgB,GAAGW,WAAW,CAACC,IAAI,CAACJ,MAAM;;IAE3D;AACF;AACA;AACA;AACA;AACA;AACA;IACE,IAAKxB,sBAAsB,CAACwB,MAAM,GAAG,CAAC,EAAG;MACxCP,cAAc,GAAGF,gBAAgB,CAAEf,sBAAsB,EAAEgB,gBAAgB,EAAEC,cAAe,CAAC;MAE7FD,gBAAgB,GAAGG,sBAAsB,CAAEnB,sBAAsB,EAAEgB,gBAAiB,CAAC;IACtF;;IAEA;IACAW,WAAW,CAACE,eAAe,GAAG;MAAEpB,WAAW,EAAEO,gBAAgB;MAAEN,SAAS,EAAEO;IAAe,CAAC;;IAE1F;IACAD,gBAAgB,GAAGC,cAAc;EAClC,CAAE,CAAC;EAEH,OAAOM,YAAY;AACpB","ignoreList":[]}

package/build/parse/build/private/helpers/parseClassAttribute.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"parseClassAttribute.js","names":["parseClassAttribute","classString","Set","split"],"sources":["../../../../../src/parse/build/private/helpers/parseClassAttribute.js"],"sourcesContent":["\n/**\n * When splits a string of html classes into a set html classes.\n * @param {string} classString The value of the class attribute.\n * @returns {Set} A set containing all individual values of the class.\n */\nexport default function parseClassAttribute( classString ) {\n\treturn new Set( classString.split( \" \" ) );\n}\n"],"mappings":"AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAASA,mBAAmBA,CAAEC,WAAW,EAAG;EAC1D,OAAO,IAAIC,GAAG,CAAED,WAAW,CAACE,KAAK,CAAE,GAAI,CAAE,CAAC;AAC3C","ignoreList":[]}

package/build/parse/build/private/isPhrasingContent.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"isPhrasingContent.js","names":["phrasingContentTags","isPhrasingContent","nodeName","includes"],"sources":["../../../../src/parse/build/private/isPhrasingContent.js"],"sourcesContent":["/**\n * Tag names of HTML elements that are considered phrasing content\n * in the HTML content model.\n *\n * @see https://html.spec.whatwg.org/#phrasing-content\n *\n * @type {string[]}\n */\nconst phrasingContentTags = [\n\t\"b\", \"big\", \"i\", \"small\", \"tt\", \"abbr\", \"acronym\", \"cite\", \"code\", \"dfn\", \"em\", \"kbd\", \"strong\",\n\t\"samp\", \"time\", \"var\", \"a\", \"bdo\", \"br\", \"img\", \"map\", \"object\", \"q\", \"script\", \"span\", \"sub\", \"sup\", \"button\",\n\t\"input\", \"label\", \"select\", \"textarea\",\n];\n\n/**\n * Checks whether a node is considered phrasing content.\n *\n * @see https://html.spec.whatwg.org/#phrasing-content\n *\n * @param {string} nodeName The name/tag of the node to check if it is phrasing content.\n *\n * @returns {boolean} Whether the node is phrasing content.\n */\nfunction isPhrasingContent( nodeName ) {\n\treturn phrasingContentTags.includes( nodeName ) || nodeName === \"#text\";\n}\n\nexport default isPhrasingContent;\n"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMA,mBAAmB,GAAG,CAC3B,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAC/F,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAC9G,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,UAAU,CACtC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,iBAAiBA,CAAEC,QAAQ,EAAG;EACtC,OAAOF,mBAAmB,CAACG,QAAQ,CAAED,QAAS,CAAC,IAAIA,QAAQ,KAAK,OAAO;AACxE;AAEA,eAAeD,iBAAiB","ignoreList":[]}

package/build/parse/build/private/parseBlocks.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"parseBlocks.js","names":["isUndefined","blockTokenizer","getAllBlocks","paper","blocks","_attributes","wpBlocks","flattenBlocks","length","forEach","block","innerBlocks","push","updateBlocksOffset","text","currentBlock","index","matches","exec","name","previousBlock","previousBlockEndOffset","endOffset","startedAt","startOffset","blockLength","contentOffset","match","updateClientIdAndAttrIdForSubtree","rootNode","clientId","currentClientId","sourceCodeLocation","foundBlock","find","childNodes","node","attributes","id","attributeId","isFirstSection","lastIndex","getText","rawBlocks","undefined"],"sources":["../../../../src/parse/build/private/parseBlocks.js"],"sourcesContent":["import { isUndefined } from \"lodash\";\nconst blockTokenizer = /<!--\\s+wp:([a-z][a-z0-9_-]*\\/)?([a-z][a-z0-9_-]*)\\s+({(?:(?=([^}]+|}+(?=})|(?!}\\s+\\/?-->)[^])*)\\5|[^]*?)}\\s+)?(\\/)?-->/g;\n\n/**\n * Get all the blocks including the inner blocks.\n *\n * @param {Paper} paper The paper to get all the blocks from.\n *\n * @returns {Object[]} An array of blocks.\n */\nconst getAllBlocks = ( paper ) => {\n\tconst blocks = paper._attributes.wpBlocks;\n\tconst flattenBlocks = [];\n\tif ( ! ( blocks && blocks.length > 0 ) ) {\n\t\treturn [];\n\t}\n\tblocks.forEach( ( block ) => {\n\t\tif ( block.innerBlocks.length > 0 ) {\n\t\t\tconst innerBlocks = block.innerBlocks;\n\t\t\tflattenBlocks.push(\n\t\t\t\tblock, ...innerBlocks\n\t\t\t);\n\t\t} else {\n\t\t\tflattenBlocks.push( block );\n\t\t}\n\t} );\n\treturn flattenBlocks;\n};\n\n\n/**\n * Gets the offset of each block and set it to the tree.\n *\n * @param {Object[]}\tblocks An array of blocks.\n * @param {string}\t\ttext The text.\n *\n * @returns {void}\n */\nexport function updateBlocksOffset( blocks, text ) {\n\tif ( blocks.length === 0 ) {\n\t\treturn;\n\t}\n\tblocks.forEach( ( currentBlock, index ) => {\n\t\tconst matches = blockTokenizer.exec( text );\n\t\tif ( currentBlock.name === \"core/freeform\" ) {\n\t\t\tconst previousBlock = blocks[ index - 1 ];\n\t\t\tif ( previousBlock ) {\n\t\t\t\tconst previousBlockEndOffset = previousBlock.endOffset;\n\t\t\t\tconst startedAt = previousBlockEndOffset + 2;\n\t\t\t\tcurrentBlock.startOffset = startedAt;\n\t\t\t\tcurrentBlock.endOffset = startedAt + currentBlock.blockLength;\n\t\t\t\tcurrentBlock.contentOffset = startedAt;\n\t\t\t} else {\n\t\t\t\tcurrentBlock.startOffset = 0;\n\t\t\t\tcurrentBlock.endOffset = 0 + currentBlock.blockLength;\n\t\t\t\tcurrentBlock.contentOffset = 0;\n\t\t\t}\n\t\t} else {\n\t\t\tif ( null === matches ) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tconst [ match ] = matches;\n\t\t\tconst startedAt = matches.index;\n\t\t\tconst length = match.length;\n\t\t\tcurrentBlock.startOffset = startedAt;\n\t\t\tcurrentBlock.endOffset = startedAt + currentBlock.blockLength;\n\t\t\tcurrentBlock.contentOffset = startedAt + length + 1;\n\t\t}\n\n\t\tif ( currentBlock.innerBlocks && currentBlock.innerBlocks.length > 0 ) {\n\t\t\tupdateBlocksOffset( currentBlock.innerBlocks, text );\n\t\t}\n\t} );\n}\n\n\n/**\n * Gets the client id for each block and set it to the child nodes.\n * Additionally, when a node has an attribute with 'id' key, also set this id to the first.\n *\n * @param {Node}\t\trootNode The root node.\n * @param {Object[]}\tblocks An array of blocks.\n * @param {string}\t\tclientId The client id to set.\n *\n * @returns {void}\n */\nfunction updateClientIdAndAttrIdForSubtree( rootNode, blocks, clientId ) {\n\tif ( ! rootNode ) {\n\t\treturn;\n\t}\n\n\tlet currentClientId = clientId;\n\tif ( rootNode.sourceCodeLocation && ! isUndefined( rootNode.sourceCodeLocation.startOffset ) ) {\n\t\tconst foundBlock = blocks.find( block => block.contentOffset === rootNode.sourceCodeLocation.startOffset );\n\t\tif ( foundBlock ) {\n\t\t\tcurrentClientId = foundBlock.clientId;\n\t\t}\n\t}\n\n\t// If the clientId is not undefined, also set this to the root node.\n\tif ( currentClientId ) {\n\t\trootNode.clientId = currentClientId;\n\t}\n\n\t// If the node has children, update the clientId for them.\n\t( rootNode.childNodes || [] ).forEach( ( node ) => {\n\t\tif ( node.attributes && node.attributes.id ) {\n\t\t\t/*\n\t\t\t * If the node's child has an attribute with 'id' key, also set this id to the first and third child node.\n\t\t\t * This step is specifically for parsing the Yoast blocks.\n\t\t\t *\n\t\t\t * For Yoast blocks, if a node has attribute with 'id' key, this means that this node represents a sub-block.\n\t\t\t * A sub-block has four child nodes:\n\t\t\t * 1. The first child node of the sub-block, represents the first section of that sub-block.\n\t\t\t *    - For example, in Yoast FAQ block, the first child node would represent the \"question\" section.\n\t\t\t * 2. The second child node of the sub-block, only contains a new line.\n\t\t\t * 3. The third child node of the sub-block, represents the second section of that sub-block.\n\t\t\t *    - For example, in Yoast FAQ block, the second child node would represent the \"answer\" section.\n\t\t\t * 4. The fourth child node of the sub-block, only contains a new line.\n\t\t\t */\n\t\t\tif ( node.childNodes && node.childNodes.length > 3 ) {\n\t\t\t\tnode.childNodes[ 0 ].attributeId = node.attributes.id;\n\t\t\t\tnode.childNodes[ 0 ].isFirstSection = true;\n\n\t\t\t\tnode.childNodes[ 2 ].attributeId = node.attributes.id;\n\t\t\t\tnode.childNodes[ 2 ].isFirstSection = false;\n\t\t\t}\n\t\t}\n\t\tupdateClientIdAndAttrIdForSubtree( node, blocks, currentClientId );\n\t} );\n}\n\n/**\n * Parses blocks and updates the clientId for the subtree.\n * Additionally, when a node has an attribute with 'id' key, also set this id to the first and third child node of that node.\n *\n * @param {Paper} paper The paper to parse.\n * @param {Node} node\tThe node to parse.\n *\n * @returns {void}\n */\nexport default function( paper, node ) {\n\tconst blocks = paper._attributes.wpBlocks || [];\n\tblockTokenizer.lastIndex = 0;\n\tupdateBlocksOffset( blocks, paper.getText() );\n\n\tconst rawBlocks = getAllBlocks( paper );\n\n\t// eslint-disable-next-line no-undefined\n\tupdateClientIdAndAttrIdForSubtree( node, rawBlocks, undefined );\n}\n"],"mappings":"AAAA,SAASA,WAAW,QAAQ,QAAQ;AACpC,MAAMC,cAAc,GAAG,yHAAyH;;AAEhJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,YAAY,GAAKC,KAAK,IAAM;EACjC,MAAMC,MAAM,GAAGD,KAAK,CAACE,WAAW,CAACC,QAAQ;EACzC,MAAMC,aAAa,GAAG,EAAE;EACxB,IAAK,EAAIH,MAAM,IAAIA,MAAM,CAACI,MAAM,GAAG,CAAC,CAAE,EAAG;IACxC,OAAO,EAAE;EACV;EACAJ,MAAM,CAACK,OAAO,CAAIC,KAAK,IAAM;IAC5B,IAAKA,KAAK,CAACC,WAAW,CAACH,MAAM,GAAG,CAAC,EAAG;MACnC,MAAMG,WAAW,GAAGD,KAAK,CAACC,WAAW;MACrCJ,aAAa,CAACK,IAAI,CACjBF,KAAK,EAAE,GAAGC,WACX,CAAC;IACF,CAAC,MAAM;MACNJ,aAAa,CAACK,IAAI,CAAEF,KAAM,CAAC;IAC5B;EACD,CAAE,CAAC;EACH,OAAOH,aAAa;AACrB,CAAC;;AAGD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASM,kBAAkBA,CAAET,MAAM,EAAEU,IAAI,EAAG;EAClD,IAAKV,MAAM,CAACI,MAAM,KAAK,CAAC,EAAG;IAC1B;EACD;EACAJ,MAAM,CAACK,OAAO,CAAE,CAAEM,YAAY,EAAEC,KAAK,KAAM;IAC1C,MAAMC,OAAO,GAAGhB,cAAc,CAACiB,IAAI,CAAEJ,IAAK,CAAC;IAC3C,IAAKC,YAAY,CAACI,IAAI,KAAK,eAAe,EAAG;MAC5C,MAAMC,aAAa,GAAGhB,MAAM,CAAEY,KAAK,GAAG,CAAC,CAAE;MACzC,IAAKI,aAAa,EAAG;QACpB,MAAMC,sBAAsB,GAAGD,aAAa,CAACE,SAAS;QACtD,MAAMC,SAAS,GAAGF,sBAAsB,GAAG,CAAC;QAC5CN,YAAY,CAACS,WAAW,GAAGD,SAAS;QACpCR,YAAY,CAACO,SAAS,GAAGC,SAAS,GAAGR,YAAY,CAACU,WAAW;QAC7DV,YAAY,CAACW,aAAa,GAAGH,SAAS;MACvC,CAAC,MAAM;QACNR,YAAY,CAACS,WAAW,GAAG,CAAC;QAC5BT,YAAY,CAACO,SAAS,GAAG,CAAC,GAAGP,YAAY,CAACU,WAAW;QACrDV,YAAY,CAACW,aAAa,GAAG,CAAC;MAC/B;IACD,CAAC,MAAM;MACN,IAAK,IAAI,KAAKT,OAAO,EAAG;QACvB;MACD;MACA,MAAM,CAAEU,KAAK,CAAE,GAAGV,OAAO;MACzB,MAAMM,SAAS,GAAGN,OAAO,CAACD,KAAK;MAC/B,MAAMR,MAAM,GAAGmB,KAAK,CAACnB,MAAM;MAC3BO,YAAY,CAACS,WAAW,GAAGD,SAAS;MACpCR,YAAY,CAACO,SAAS,GAAGC,SAAS,GAAGR,YAAY,CAACU,WAAW;MAC7DV,YAAY,CAACW,aAAa,GAAGH,SAAS,GAAGf,MAAM,GAAG,CAAC;IACpD;IAEA,IAAKO,YAAY,CAACJ,WAAW,IAAII,YAAY,CAACJ,WAAW,CAACH,MAAM,GAAG,CAAC,EAAG;MACtEK,kBAAkB,CAAEE,YAAY,CAACJ,WAAW,EAAEG,IAAK,CAAC;IACrD;EACD,CAAE,CAAC;AACJ;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASc,iCAAiCA,CAAEC,QAAQ,EAAEzB,MAAM,EAAE0B,QAAQ,EAAG;EACxE,IAAK,CAAED,QAAQ,EAAG;IACjB;EACD;EAEA,IAAIE,eAAe,GAAGD,QAAQ;EAC9B,IAAKD,QAAQ,CAACG,kBAAkB,IAAI,CAAEhC,WAAW,CAAE6B,QAAQ,CAACG,kBAAkB,CAACR,WAAY,CAAC,EAAG;IAC9F,MAAMS,UAAU,GAAG7B,MAAM,CAAC8B,IAAI,CAAExB,KAAK,IAAIA,KAAK,CAACgB,aAAa,KAAKG,QAAQ,CAACG,kBAAkB,CAACR,WAAY,CAAC;IAC1G,IAAKS,UAAU,EAAG;MACjBF,eAAe,GAAGE,UAAU,CAACH,QAAQ;IACtC;EACD;;EAEA;EACA,IAAKC,eAAe,EAAG;IACtBF,QAAQ,CAACC,QAAQ,GAAGC,eAAe;EACpC;;EAEA;EACA,CAAEF,QAAQ,CAACM,UAAU,IAAI,EAAE,EAAG1B,OAAO,CAAI2B,IAAI,IAAM;IAClD,IAAKA,IAAI,CAACC,UAAU,IAAID,IAAI,CAACC,UAAU,CAACC,EAAE,EAAG;MAC5C;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;MACG,IAAKF,IAAI,CAACD,UAAU,IAAIC,IAAI,CAACD,UAAU,CAAC3B,MAAM,GAAG,CAAC,EAAG;QACpD4B,IAAI,CAACD,UAAU,CAAE,CAAC,CAAE,CAACI,WAAW,GAAGH,IAAI,CAACC,UAAU,CAACC,EAAE;QACrDF,IAAI,CAACD,UAAU,CAAE,CAAC,CAAE,CAACK,cAAc,GAAG,IAAI;QAE1CJ,IAAI,CAACD,UAAU,CAAE,CAAC,CAAE,CAACI,WAAW,GAAGH,IAAI,CAACC,UAAU,CAACC,EAAE;QACrDF,IAAI,CAACD,UAAU,CAAE,CAAC,CAAE,CAACK,cAAc,GAAG,KAAK;MAC5C;IACD;IACAZ,iCAAiC,CAAEQ,IAAI,EAAEhC,MAAM,EAAE2B,eAAgB,CAAC;EACnE,CAAE,CAAC;AACJ;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,UAAU5B,KAAK,EAAEiC,IAAI,EAAG;EACtC,MAAMhC,MAAM,GAAGD,KAAK,CAACE,WAAW,CAACC,QAAQ,IAAI,EAAE;EAC/CL,cAAc,CAACwC,SAAS,GAAG,CAAC;EAC5B5B,kBAAkB,CAAET,MAAM,EAAED,KAAK,CAACuC,OAAO,CAAC,CAAE,CAAC;EAE7C,MAAMC,SAAS,GAAGzC,YAAY,CAAEC,KAAM,CAAC;;EAEvC;EACAyB,iCAAiC,CAAEQ,IAAI,EAAEO,SAAS,EAAEC,SAAU,CAAC;AAChE","ignoreList":[]}

package/build/parse/build/private/tokenize.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"tokenize.js","names":["Heading","Paragraph","getTextElementPositions","hashedHtmlEntities","getTokens","node","sentence","languageProcessor","tokens","splitIntoTokens","sourceCodeRange","startOffset","getSentences","sentences","splitIntoSentences","innerText","map","forEach","character","hashedHtmlEntity","hashedHtmlEntityRegex","RegExp","text","replace","token","tokenize","tree","name","childNodes","child"],"sources":["../../../../src/parse/build/private/tokenize.js"],"sourcesContent":["import { Heading, Paragraph } from \"../../structure\";\nimport getTextElementPositions from \"./getTextElementPositions\";\nimport { hashedHtmlEntities } from \"../../../helpers/htmlEntities\";\n\n/**\n * Splits the sentence into tokens, determines their positions in the source code, and puts them on the sentence.\n *\n * @param {Paragraph|Heading} node The paragraph or heading node to split into sentences.\n * @param {Sentence} sentence The sentence.\n * @param {LanguageProcessor} languageProcessor The language processor for the current language.\n *\n * @returns {Sentence} The sentence, with tokens.\n */\nfunction getTokens( node, sentence, languageProcessor ) {\n\tsentence.tokens = languageProcessor.splitIntoTokens( sentence );\n\tsentence.tokens = getTextElementPositions( node, sentence.tokens, sentence.sourceCodeRange.startOffset );\n\treturn sentence;\n}\n\n/**\n * Splits the node's inner text into sentences, and the sentences into tokens,\n * using the language processor.\n *\n * @param {Paragraph|Heading} node \t\t\t\tThe paragraph or heading node to split into sentences.\n * @param {LanguageProcessor} languageProcessor The language processor to use.\n *\n * @returns {Sentence[]} The node's sentences.\n */\nfunction getSentences( node, languageProcessor ) {\n\t// Split text into sentences.\n\tlet sentences = languageProcessor.splitIntoSentences( node.innerText() );\n\t// Add position information to the sentences.\n\tsentences = getTextElementPositions( node, sentences );\n\t// Tokenize sentences into tokens.\n\treturn sentences.map( sentence => {\n\t\tsentence = getTokens( node, sentence, languageProcessor );\n\t\t// Now positions have been determined, change HTML entities that had earlier been converted to hashed versions back to their short version.\n\t\t// For example, \"&\" was earlier converted into \"#amp;\" and is now converted into \"&\".\n\t\t// We make this change in both the Sentence and the accompanying Tokens.\n\t\thashedHtmlEntities.forEach( ( character, hashedHtmlEntity ) => {\n\t\t\t// We use a global regex instead of replaceAll to support older browsers.\n\t\t\tconst hashedHtmlEntityRegex = new RegExp( hashedHtmlEntity, \"g\" );\n\t\t\tsentence.text = sentence.text.replace( hashedHtmlEntityRegex, character );\n\t\t\tsentence.tokens.map( token => {\n\t\t\t\ttoken.text = token.text.replace( hashedHtmlEntityRegex, character );\n\t\t\t\treturn token;\n\t\t\t} );\n\t\t} );\n\t\treturn sentence;\n\t} );\n}\n\n/**\n * Splits any Paragraph and Heading nodes in the tree into sentences and tokens.\n * Excludes overarching Paragraphs, as those will have (implicit) paragraphs as their children.\n *\n * @param {Node} tree The tree to process.\n * @param {LanguageProcessor} languageProcessor The language processor to use.\n *\n * @returns {Node} The processed tree.\n */\nfunction tokenize( tree, languageProcessor ) {\n\tif ( ( tree instanceof Paragraph && tree.name !== \"p-overarching\" ) || tree instanceof Heading ) {\n\t\ttree.sentences = getSentences( tree, languageProcessor );\n\t}\n\n\tif ( tree.childNodes ) {\n\t\ttree.childNodes = tree.childNodes.map( child => tokenize( child, languageProcessor ) );\n\t}\n\n\treturn tree;\n}\n\nexport default tokenize;\n"],"mappings":"AAAA,SAASA,OAAO,EAAEC,SAAS;AAC3B,OAAOC,uBAAuB;AAC9B,SAASC,kBAAkB;;AAE3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,SAASA,CAAEC,IAAI,EAAEC,QAAQ,EAAEC,iBAAiB,EAAG;EACvDD,QAAQ,CAACE,MAAM,GAAGD,iBAAiB,CAACE,eAAe,CAAEH,QAAS,CAAC;EAC/DA,QAAQ,CAACE,MAAM,GAAGN,uBAAuB,CAAEG,IAAI,EAAEC,QAAQ,CAACE,MAAM,EAAEF,QAAQ,CAACI,eAAe,CAACC,WAAY,CAAC;EACxG,OAAOL,QAAQ;AAChB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASM,YAAYA,CAAEP,IAAI,EAAEE,iBAAiB,EAAG;EAChD;EACA,IAAIM,SAAS,GAAGN,iBAAiB,CAACO,kBAAkB,CAAET,IAAI,CAACU,SAAS,CAAC,CAAE,CAAC;EACxE;EACAF,SAAS,GAAGX,uBAAuB,CAAEG,IAAI,EAAEQ,SAAU,CAAC;EACtD;EACA,OAAOA,SAAS,CAACG,GAAG,CAAEV,QAAQ,IAAI;IACjCA,QAAQ,GAAGF,SAAS,CAAEC,IAAI,EAAEC,QAAQ,EAAEC,iBAAkB,CAAC;IACzD;IACA;IACA;IACAJ,kBAAkB,CAACc,OAAO,CAAE,CAAEC,SAAS,EAAEC,gBAAgB,KAAM;MAC9D;MACA,MAAMC,qBAAqB,GAAG,IAAIC,MAAM,CAAEF,gBAAgB,EAAE,GAAI,CAAC;MACjEb,QAAQ,CAACgB,IAAI,GAAGhB,QAAQ,CAACgB,IAAI,CAACC,OAAO,CAAEH,qBAAqB,EAAEF,SAAU,CAAC;MACzEZ,QAAQ,CAACE,MAAM,CAACQ,GAAG,CAAEQ,KAAK,IAAI;QAC7BA,KAAK,CAACF,IAAI,GAAGE,KAAK,CAACF,IAAI,CAACC,OAAO,CAAEH,qBAAqB,EAAEF,SAAU,CAAC;QACnE,OAAOM,KAAK;MACb,CAAE,CAAC;IACJ,CAAE,CAAC;IACH,OAAOlB,QAAQ;EAChB,CAAE,CAAC;AACJ;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASmB,QAAQA,CAAEC,IAAI,EAAEnB,iBAAiB,EAAG;EAC5C,IAAOmB,IAAI,YAAYzB,SAAS,IAAIyB,IAAI,CAACC,IAAI,KAAK,eAAe,IAAMD,IAAI,YAAY1B,OAAO,EAAG;IAChG0B,IAAI,CAACb,SAAS,GAAGD,YAAY,CAAEc,IAAI,EAAEnB,iBAAkB,CAAC;EACzD;EAEA,IAAKmB,IAAI,CAACE,UAAU,EAAG;IACtBF,IAAI,CAACE,UAAU,GAAGF,IAAI,CAACE,UAAU,CAACZ,GAAG,CAAEa,KAAK,IAAIJ,QAAQ,CAAEI,KAAK,EAAEtB,iBAAkB,CAAE,CAAC;EACvF;EAEA,OAAOmB,IAAI;AACZ;AAEA,eAAeD,QAAQ","ignoreList":[]}

package/build/parse/language/LanguageProcessor.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"LanguageProcessor.js","names":["Sentence","Token","splitIntoTokens","whitespaceRegex","LanguageProcessor","constructor","researcher","splitIntoSentences","text","memoizedTokenizer","getHelper","sentences","test","length","pop","map","sentence","sentenceText","tokenTextsCustom","tokensCustom","tokenText","tokenTexts"],"sources":["../../../src/parse/language/LanguageProcessor.js"],"sourcesContent":["import Sentence from \"../structure/Sentence\";\nimport Token from \"../structure/Token\";\nimport splitIntoTokens from \"../../languageProcessing/helpers/word/splitIntoTokens\";\n\nconst whitespaceRegex = /^\\s+$/;\n\n\n/**\n * Contains language-specific logic for splitting a text into sentences and tokens.\n */\nclass LanguageProcessor {\n\t/**\n\t * Creates a new language processor.\n\t *\n\t * @param {Researcher} researcher The researcher to use.\n\t */\n\tconstructor( researcher ) {\n\t\tthis.researcher = researcher;\n\t}\n\n\t/**\n\t * Split text into sentences.\n\t *\n\t * @param {string} text The text to split into sentences.\n\t *\n\t * @returns {Sentence[]} The sentences.\n\t */\n\tsplitIntoSentences( text ) {\n\t\tconst memoizedTokenizer = this.researcher.getHelper( \"memoizedTokenizer\" );\n\t\t/*\n\t\t * Set the `trimSentences` flag to false. We want to keep whitespaces to be able to correctly assess the\n\t\t * position of sentences within the source code.\n\t\t */\n\t\tconst sentences = memoizedTokenizer( text, false );\n\n\t\t/*\n\t\t * If the last element in the array of sentences contains only whitespaces, remove it.\n\t\t * This will be the case if the text ends in a whitespace - that whitespace ends up being tokenized as a\n\t\t * separate sentence. A space at the end of the text is not needed for calculating the position of\n\t\t * sentences, so it can be safely removed.\n\t\t */\n\t\tif ( whitespaceRegex.test( sentences[ sentences.length - 1 ] ) ) {\n\t\t\tsentences.pop();\n\t\t}\n\n\t\treturn sentences.map( function( sentence ) {\n\t\t\treturn new Sentence( sentence );\n\t\t} );\n\t}\n\n\t/**\n\t * Split sentence into tokens.\n\t *\n\t * @param {Sentence} sentence The sentence to split.\n\t *\n\t * @returns {Token[]} The tokens.\n\t */\n\tsplitIntoTokens( sentence ) {\n\t\t// Retrieve sentence from sentence class\n\t\tconst sentenceText = sentence.text;\n\n\t\t// If there is a custom splitIntoTokens helper use its output for retrieving tokens.\n\t\tconst tokenTextsCustom = this.researcher.getHelper( \"splitIntoTokensCustom\" );\n\t\tif ( tokenTextsCustom ) {\n\t\t\tconst tokensCustom = tokenTextsCustom( sentenceText );\n\t\t\treturn tokensCustom.map( tokenText => new Token( tokenText ) );\n\t\t}\n\n\t\tconst tokenTexts = splitIntoTokens( sentenceText );\n\n\t\treturn tokenTexts.map( tokenText => new Token( tokenText ) );\n\t}\n}\nexport default LanguageProcessor;\n"],"mappings":"AAAA,OAAOA,QAAQ;AACf,OAAOC,KAAK;AACZ,OAAOC,eAAe;AAEtB,MAAMC,eAAe,GAAG,OAAO;;AAG/B;AACA;AACA;AACA,MAAMC,iBAAiB,CAAC;EACvB;AACD;AACA;AACA;AACA;EACCC,WAAWA,CAAEC,UAAU,EAAG;IACzB,IAAI,CAACA,UAAU,GAAGA,UAAU;EAC7B;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;EACCC,kBAAkBA,CAAEC,IAAI,EAAG;IAC1B,MAAMC,iBAAiB,GAAG,IAAI,CAACH,UAAU,CAACI,SAAS,CAAE,mBAAoB,CAAC;IAC1E;AACF;AACA;AACA;IACE,MAAMC,SAAS,GAAGF,iBAAiB,CAAED,IAAI,EAAE,KAAM,CAAC;;IAElD;AACF;AACA;AACA;AACA;AACA;IACE,IAAKL,eAAe,CAACS,IAAI,CAAED,SAAS,CAAEA,SAAS,CAACE,MAAM,GAAG,CAAC,CAAG,CAAC,EAAG;MAChEF,SAAS,CAACG,GAAG,CAAC,CAAC;IAChB;IAEA,OAAOH,SAAS,CAACI,GAAG,CAAE,UAAUC,QAAQ,EAAG;MAC1C,OAAO,IAAIhB,QAAQ,CAAEgB,QAAS,CAAC;IAChC,CAAE,CAAC;EACJ;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;EACCd,eAAeA,CAAEc,QAAQ,EAAG;IAC3B;IACA,MAAMC,YAAY,GAAGD,QAAQ,CAACR,IAAI;;IAElC;IACA,MAAMU,gBAAgB,GAAG,IAAI,CAACZ,UAAU,CAACI,SAAS,CAAE,uBAAwB,CAAC;IAC7E,IAAKQ,gBAAgB,EAAG;MACvB,MAAMC,YAAY,GAAGD,gBAAgB,CAAED,YAAa,CAAC;MACrD,OAAOE,YAAY,CAACJ,GAAG,CAAEK,SAAS,IAAI,IAAInB,KAAK,CAAEmB,SAAU,CAAE,CAAC;IAC/D;IAEA,MAAMC,UAAU,GAAGnB,eAAe,CAAEe,YAAa,CAAC;IAElD,OAAOI,UAAU,CAACN,GAAG,CAAEK,SAAS,IAAI,IAAInB,KAAK,CAAEmB,SAAU,CAAE,CAAC;EAC7D;AACD;AACA,eAAehB,iBAAiB","ignoreList":[]}

package/build/parse/structure/Heading.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"Heading.js","names":["Node","Heading","constructor","level","attributes","childNodes","sourceCodeLocationInfo"],"sources":["../../../src/parse/structure/Heading.js"],"sourcesContent":["import Node from \"./Node\";\n\n/**\n * A heading in the tree.\n */\nclass Heading extends Node {\n\t/**\n\t * Creates a new heading.\n\t *\n\t * @param {1|2|3|4|5|6} level The heading level (e.g. `1` for `h1` up to `6` for `h6`).\n\t * @param {Object} attributes This heading's attributes.\n\t * @param {(Node|Text)[]} childNodes This heading's child nodes.\n\t * @param {Object} sourceCodeLocationInfo This heading's location in the source code, from parse5.\n\t */\n\tconstructor( level, attributes = {}, childNodes = [], sourceCodeLocationInfo = {} ) {\n\t\tsuper( `h${level}`, attributes, childNodes, sourceCodeLocationInfo );\n\t\t/**\n\t\t * This heading's level (e.g. `1` for `h1`, `2` for `h2` etc.).\n\t\t *\n\t\t * @type {1|2|3|4|5|6}\n\t\t */\n\t\tthis.level = level;\n\t}\n}\n\nexport default Heading;\n"],"mappings":"AAAA,OAAOA,IAAI;;AAEX;AACA;AACA;AACA,MAAMC,OAAO,SAASD,IAAI,CAAC;EAC1B;AACD;AACA;AACA;AACA;AACA;AACA;AACA;EACCE,WAAWA,CAAEC,KAAK,EAAEC,UAAU,GAAG,CAAC,CAAC,EAAEC,UAAU,GAAG,EAAE,EAAEC,sBAAsB,GAAG,CAAC,CAAC,EAAG;IACnF,KAAK,CAAE,IAAIH,KAAK,EAAE,EAAEC,UAAU,EAAEC,UAAU,EAAEC,sBAAuB,CAAC;IACpE;AACF;AACA;AACA;AACA;IACE,IAAI,CAACH,KAAK,GAAGA,KAAK;EACnB;AACD;AAEA,eAAeF,OAAO","ignoreList":[]}

package/build/parse/structure/Node.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"Node.js","names":["findAllInTree","innerText","SourceCodeLocation","isEmpty","Node","constructor","name","attributes","childNodes","sourceCodeLocationInfo","sourceCodeLocation","findAll","condition","recurseFoundNodes"],"sources":["../../../src/parse/structure/Node.js"],"sourcesContent":["import { findAllInTree, innerText } from \"../traverse\";\nimport SourceCodeLocation from \"./SourceCodeLocation\";\nimport { isEmpty } from \"lodash\";\n\n/**\n * A node in the tree.\n */\nclass Node {\n\t/**\n\t * Creates a new node.\n\t *\n\t * @param {string} \t\t\tname \t\t\t\t\tThe node's name or tag.\n\t * @param {Object} \t\t\tattributes \t\t\t\tThis node's attributes.\n\t * @param {(Node|Text)[]} \tchildNodes \t\t\t\tThis node's child nodes.\n\t * @param {Object} \t\t\tsourceCodeLocationInfo \tThis node's location in the source code, from parse5.\n\t */\n\tconstructor( name, attributes = {}, childNodes = [], sourceCodeLocationInfo = {} ) {\n\t\t/**\n\t\t * This node's name or tag.\n\t\t * @type {string}\n\t\t */\n\t\tthis.name = name;\n\n\t\t/**\n\t\t * This node's attributes.\n\t\t * @type {Object}\n\t\t */\n\t\tthis.attributes = attributes;\n\n\t\t/**\n\t\t * This node's child nodes.\n\t\t * @type {(Node|Text)[]}\n\t\t */\n\t\tthis.childNodes = childNodes;\n\n\t\t// Don't add the source code location when unavailable.\n\t\tif ( ! isEmpty( sourceCodeLocationInfo ) ) {\n\t\t\t/**\n\t\t\t * The location of this node inside the HTML.\n\t\t\t * @type {SourceCodeLocation}\n\t\t\t */\n\t\t\tthis.sourceCodeLocation = new SourceCodeLocation( sourceCodeLocationInfo );\n\t\t}\n\t}\n\n\t/**\n\t * Finds all nodes in the tree that satisfies the given condition.\n\t *\n\t * @param {function} \tcondition \t\t\t\t\tThe condition that a node should satisfy to end up in the list.\n\t * @param {boolean} \trecurseFoundNodes=false \tWhether to recurse into found nodes to see if the condition\n\t *  also applies to sub-nodes of the found node.\n\t *\n\t * @returns {(Node|Text|Paragraph|Heading)[]} The list of nodes that satisfy the condition.\n\t */\n\tfindAll( condition, recurseFoundNodes = false ) {\n\t\treturn findAllInTree( this, condition, recurseFoundNodes );\n\t}\n\n\t/**\n\t * Returns the inner text (text without any markup) from this node.\n\t *\n\t * @returns {string} The inner text from this node.\n\t */\n\tinnerText() {\n\t\treturn innerText( this );\n\t}\n}\n\nexport default Node;\n"],"mappings":"AAAA,SAASA,aAAa,EAAEC,SAAS;AACjC,OAAOC,kBAAkB;AACzB,SAASC,OAAO,QAAQ,QAAQ;;AAEhC;AACA;AACA;AACA,MAAMC,IAAI,CAAC;EACV;AACD;AACA;AACA;AACA;AACA;AACA;AACA;EACCC,WAAWA,CAAEC,IAAI,EAAEC,UAAU,GAAG,CAAC,CAAC,EAAEC,UAAU,GAAG,EAAE,EAAEC,sBAAsB,GAAG,CAAC,CAAC,EAAG;IAClF;AACF;AACA;AACA;IACE,IAAI,CAACH,IAAI,GAAGA,IAAI;;IAEhB;AACF;AACA;AACA;IACE,IAAI,CAACC,UAAU,GAAGA,UAAU;;IAE5B;AACF;AACA;AACA;IACE,IAAI,CAACC,UAAU,GAAGA,UAAU;;IAE5B;IACA,IAAK,CAAEL,OAAO,CAAEM,sBAAuB,CAAC,EAAG;MAC1C;AACH;AACA;AACA;MACG,IAAI,CAACC,kBAAkB,GAAG,IAAIR,kBAAkB,CAAEO,sBAAuB,CAAC;IAC3E;EACD;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACCE,OAAOA,CAAEC,SAAS,EAAEC,iBAAiB,GAAG,KAAK,EAAG;IAC/C,OAAOb,aAAa,CAAE,IAAI,EAAEY,SAAS,EAAEC,iBAAkB,CAAC;EAC3D;;EAEA;AACD;AACA;AACA;AACA;EACCZ,SAASA,CAAA,EAAG;IACX,OAAOA,SAAS,CAAE,IAAK,CAAC;EACzB;AACD;AAEA,eAAeG,IAAI","ignoreList":[]}

package/build/parse/structure/Paragraph.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"Paragraph.js","names":["Node","Paragraph","constructor","attributes","childNodes","sourceCodeLocationInfo","isImplicit","isOverarching","name","createImplicit"],"sources":["../../../src/parse/structure/Paragraph.js"],"sourcesContent":["import Node from \"./Node\";\n\n/**\n * A paragraph in the tree.\n *\n * @see https://html.spec.whatwg.org/dev/dom.html#paragraphs\n */\nclass Paragraph extends Node {\n\t/**\n\t * Creates a new paragraph.\n\t *\n\t * @param {Object} attributes The paragraph's attributes.\n\t * @param {(Node|Text)[]} childNodes This paragraph's child nodes.\n\t * @param {Object} sourceCodeLocationInfo This paragraph's location in the source code, from parse5.\n\t * @param {boolean} isImplicit Whether this paragraph is an implicit paragraph, or an explicit paragraph.\n\t * @param {boolean} isOverarching Whether this paragraph is overarching text that is separated by double line breaks.\n\t */\n\tconstructor( attributes = {}, childNodes = [], sourceCodeLocationInfo = {},\n\t\tisImplicit = false, isOverarching = false ) {\n\t\t// We rename any overarching `<p>` element to not match it as a stand-alone paragraph downstream.\n\t\tconst name = isOverarching ? \"p-overarching\" : \"p\";\n\t\tsuper( name, attributes, childNodes, sourceCodeLocationInfo );\n\t\t/**\n\t\t * Whether this paragraph is explicit (defined by an explicit `<p>` tag within the markup),\n\t\t * or implicit (defined by a run of phrasing content).\n\t\t *\n\t\t * @see https://html.spec.whatwg.org/dev/dom.html#paragraphs\n\t\t *\n\t\t * @type {boolean}\n\t\t */\n\t\tthis.isImplicit = isImplicit;\n\t}\n\n\t/**\n\t * Creates and returns a new implicit paragraph.\n\t *\n\t * @param {Object} attributes The paragraph's attributes.\n\t * @param {(Node|Text)[]} childNodes This paragraph's child nodes.\n\t * @param {Object} sourceCodeLocationInfo This paragraph's location in the source code, from parse5.\n\t *\n\t * @returns {Paragraph} A new implicit paragraph.\n\t */\n\tstatic createImplicit( attributes = {}, childNodes = [], sourceCodeLocationInfo = {} ) {\n\t\treturn new Paragraph( attributes, childNodes, sourceCodeLocationInfo, true );\n\t}\n}\n\nexport default Paragraph;\n"],"mappings":"AAAA,OAAOA,IAAI;;AAEX;AACA;AACA;AACA;AACA;AACA,MAAMC,SAAS,SAASD,IAAI,CAAC;EAC5B;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACCE,WAAWA,CAAEC,UAAU,GAAG,CAAC,CAAC,EAAEC,UAAU,GAAG,EAAE,EAAEC,sBAAsB,GAAG,CAAC,CAAC,EACzEC,UAAU,GAAG,KAAK,EAAEC,aAAa,GAAG,KAAK,EAAG;IAC5C;IACA,MAAMC,IAAI,GAAGD,aAAa,GAAG,eAAe,GAAG,GAAG;IAClD,KAAK,CAAEC,IAAI,EAAEL,UAAU,EAAEC,UAAU,EAAEC,sBAAuB,CAAC;IAC7D;AACF;AACA;AACA;AACA;AACA;AACA;AACA;IACE,IAAI,CAACC,UAAU,GAAGA,UAAU;EAC7B;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACC,OAAOG,cAAcA,CAAEN,UAAU,GAAG,CAAC,CAAC,EAAEC,UAAU,GAAG,EAAE,EAAEC,sBAAsB,GAAG,CAAC,CAAC,EAAG;IACtF,OAAO,IAAIJ,SAAS,CAAEE,UAAU,EAAEC,UAAU,EAAEC,sBAAsB,EAAE,IAAK,CAAC;EAC7E;AACD;AAEA,eAAeJ,SAAS","ignoreList":[]}

package/build/parse/structure/Sentence.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"Sentence.js","names":["Sentence","constructor","text","tokens","sourceCodeRange"],"sources":["../../../src/parse/structure/Sentence.js"],"sourcesContent":["/**\n * A sentence within a text.\n */\nclass Sentence {\n\t/**\n\t * Creates a sentence.\n\t *\n\t * @param {string} text The sentence's text.\n\t */\n\tconstructor( text ) {\n\t\t/**\n\t\t * The text in this sentence.\n\t\t *\n\t\t * @type {string}\n\t\t */\n\t\tthis.text = text;\n\t\t/**\n\t\t * The tokens in this sentence.\n\t\t * @type {Token[]}\n\t\t */\n\t\tthis.tokens = [];\n\t\t/**\n\t\t * The start and end positions of the sentence in the source code.\n\t\t * @type {SourceCodeRange}\n\t\t */\n\t\tthis.sourceCodeRange = {};\n\t}\n}\n\nexport default Sentence;\n"],"mappings":"AAAA;AACA;AACA;AACA,MAAMA,QAAQ,CAAC;EACd;AACD;AACA;AACA;AACA;EACCC,WAAWA,CAAEC,IAAI,EAAG;IACnB;AACF;AACA;AACA;AACA;IACE,IAAI,CAACA,IAAI,GAAGA,IAAI;IAChB;AACF;AACA;AACA;IACE,IAAI,CAACC,MAAM,GAAG,EAAE;IAChB;AACF;AACA;AACA;IACE,IAAI,CAACC,eAAe,GAAG,CAAC,CAAC;EAC1B;AACD;AAEA,eAAeJ,QAAQ","ignoreList":[]}

package/build/parse/structure/SourceCodeLocation.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"SourceCodeLocation.js","names":["SourceCodeLocation","constructor","sourceCodeLocationInfo","startTag","startOffset","endOffset","endTag"],"sources":["../../../src/parse/structure/SourceCodeLocation.js"],"sourcesContent":["/**\n * Represents a range in the source code.\n *\n * @typedef {Object} SourceCodeRange\n * @property {number} startOffset The start position of the range.\n * @property {number} endOffset The end position of the range.\n */\n\n/**\n * Represents a location of a node in the HTML tree.\n *\n * @extends SourceCodeRange\n * @property {SourceCodeRange?} startTag The location of the start tag of the element, if it has one.\n * @property {SourceCodeRange?} endTag The location of the end tag of the element, if it has one.\n */\nclass SourceCodeLocation {\n\t/**\n\t * Creates a new SourceCodeLocation.\n\t *\n\t * @param {Object} sourceCodeLocationInfo This node's location in the source code, from parse5.\n\t */\n\tconstructor( sourceCodeLocationInfo ) {\n\t\tif ( sourceCodeLocationInfo.startTag ) {\n\t\t\tthis.startTag = {\n\t\t\t\tstartOffset: sourceCodeLocationInfo.startTag.startOffset,\n\t\t\t\tendOffset: sourceCodeLocationInfo.startTag.endOffset,\n\t\t\t};\n\t\t}\n\t\tif ( sourceCodeLocationInfo.endTag ) {\n\t\t\tthis.endTag = {\n\t\t\t\tstartOffset: sourceCodeLocationInfo.endTag.startOffset,\n\t\t\t\tendOffset: sourceCodeLocationInfo.endTag.endOffset,\n\t\t\t};\n\t\t}\n\n\t\tthis.startOffset = sourceCodeLocationInfo.startOffset;\n\t\tthis.endOffset = sourceCodeLocationInfo.endOffset;\n\t}\n}\n\nexport default SourceCodeLocation;\n"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMA,kBAAkB,CAAC;EACxB;AACD;AACA;AACA;AACA;EACCC,WAAWA,CAAEC,sBAAsB,EAAG;IACrC,IAAKA,sBAAsB,CAACC,QAAQ,EAAG;MACtC,IAAI,CAACA,QAAQ,GAAG;QACfC,WAAW,EAAEF,sBAAsB,CAACC,QAAQ,CAACC,WAAW;QACxDC,SAAS,EAAEH,sBAAsB,CAACC,QAAQ,CAACE;MAC5C,CAAC;IACF;IACA,IAAKH,sBAAsB,CAACI,MAAM,EAAG;MACpC,IAAI,CAACA,MAAM,GAAG;QACbF,WAAW,EAAEF,sBAAsB,CAACI,MAAM,CAACF,WAAW;QACtDC,SAAS,EAAEH,sBAAsB,CAACI,MAAM,CAACD;MAC1C,CAAC;IACF;IAEA,IAAI,CAACD,WAAW,GAAGF,sBAAsB,CAACE,WAAW;IACrD,IAAI,CAACC,SAAS,GAAGH,sBAAsB,CAACG,SAAS;EAClD;AACD;AAEA,eAAeL,kBAAkB","ignoreList":[]}

package/build/parse/structure/Text.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"Text.js","names":["SourceCodeLocation","Text","constructor","textNode","name","value","sourceCodeRange","startOffset","sourceCodeLocation","endOffset"],"sources":["../../../src/parse/structure/Text.js"],"sourcesContent":["import SourceCodeLocation from \"./SourceCodeLocation\";\n/**\n * A text.\n */\nclass Text {\n\t/**\n\t * Creates a new Text object, that consist of some text and a source code range.\n\t *\n\t * @param {object} textNode The current #text node in the parse5 tree.\n\t */\n\tconstructor( textNode ) {\n\t\tthis.name = \"#text\";\n\t\t/**\n\t\t * This text's content.\n\t\t *\n\t\t * @type {string}\n\t\t */\n\t\tthis.value = textNode.value;\n\n\t\tthis.sourceCodeRange = new SourceCodeLocation( {\n\t\t\tstartOffset: textNode.sourceCodeLocation.startOffset,\n\t\t\tendOffset: textNode.sourceCodeLocation.endOffset,\n\t\t} );\n\t}\n}\n\nexport default Text;\n"],"mappings":"AAAA,OAAOA,kBAAkB;AACzB;AACA;AACA;AACA,MAAMC,IAAI,CAAC;EACV;AACD;AACA;AACA;AACA;EACCC,WAAWA,CAAEC,QAAQ,EAAG;IACvB,IAAI,CAACC,IAAI,GAAG,OAAO;IACnB;AACF;AACA;AACA;AACA;IACE,IAAI,CAACC,KAAK,GAAGF,QAAQ,CAACE,KAAK;IAE3B,IAAI,CAACC,eAAe,GAAG,IAAIN,kBAAkB,CAAE;MAC9CO,WAAW,EAAEJ,QAAQ,CAACK,kBAAkB,CAACD,WAAW;MACpDE,SAAS,EAAEN,QAAQ,CAACK,kBAAkB,CAACC;IACxC,CAAE,CAAC;EACJ;AACD;AAEA,eAAeR,IAAI","ignoreList":[]}

package/build/parse/structure/Token.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"Token.js","names":["normalizeSingle","Token","constructor","text","sourceCodeRange"],"sources":["../../../src/parse/structure/Token.js"],"sourcesContent":["import { normalizeSingle } from \"../../languageProcessing\";\n\n/**\n * A token representing a word, whitespace or punctuation in the sentence.\n */\nclass Token {\n\t/**\n\t * Creates a new token.\n\t *\n\t * @param {string} text The token's text.\n\t * @param {SourceCodeRange} sourceCodeRange The start and end positions of the token in the source code.\n\t */\n\tconstructor( text, sourceCodeRange = {} ) {\n\t\t// Normalize single quotes so that tokens can be matched with strings regardless of single quote type.\n\t\tthis.text = normalizeSingle( text );\n\t\t/**\n\t\t * The start and end positions of the token in the source code.\n\t\t * @type {SourceCodeRange}\n\t\t */\n\t\tthis.sourceCodeRange = sourceCodeRange;\n\t}\n}\n\nexport default Token;\n"],"mappings":"AAAA,SAASA,eAAe;;AAExB;AACA;AACA;AACA,MAAMC,KAAK,CAAC;EACX;AACD;AACA;AACA;AACA;AACA;EACCC,WAAWA,CAAEC,IAAI,EAAEC,eAAe,GAAG,CAAC,CAAC,EAAG;IACzC;IACA,IAAI,CAACD,IAAI,GAAGH,eAAe,CAAEG,IAAK,CAAC;IACnC;AACF;AACA;AACA;IACE,IAAI,CAACC,eAAe,GAAGA,eAAe;EACvC;AACD;AAEA,eAAeH,KAAK","ignoreList":[]}

package/build/parse/structure/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","names":["Node","Heading","Paragraph","Text"],"sources":["../../../src/parse/structure/index.js"],"sourcesContent":["import Node from \"./Node\";\nimport Heading from \"./Heading\";\nimport Paragraph from \"./Paragraph\";\nimport Text from \"./Text\";\n\n/**\n * @module parse/structure\n *\n * Contains elements out of which a tree structure can be built.\n */\nexport {\n\tNode,\n\tHeading,\n\tParagraph,\n\tText,\n};\n"],"mappings":"AAAA,OAAOA,IAAI;AACX,OAAOC,OAAO;AACd,OAAOC,SAAS;AAChB,OAAOC,IAAI;;AAEX;AACA;AACA;AACA;AACA;AACA,SACCH,IAAI,EACJC,OAAO,EACPC,SAAS,EACTC,IAAI","ignoreList":[]}

package/build/parse/traverse/findAllInTree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"findAllInTree.js","names":["findAllInTree","tree","condition","recurseFoundNodes","nodes","childNodes","forEach","child","push"],"sources":["../../../src/parse/traverse/findAllInTree.js"],"sourcesContent":["/**\n * Finds all nodes in the tree that satisfies the given condition.\n *\n * @param {Object} \t\ttree \t\t\t\t\t\tThe tree.\n * @param {function} \tcondition \t\t\t\t\tThe condition that a node should satisfy to end up in the list.\n * @param {boolean} \trecurseFoundNodes=false \tWhether to recurse into found nodes to see if the condition also applies to\n * sub-nodes of the found node.\n * If false, as soon as a node is found that satisfies the condition, it is added to the list and no further recursion is done through its children.\n * If true, the node is added to the list and its children are also checked for the condition.\n * If they satisfy the condition, they are also added to the list.\n * This comes with the risk of adding the same node multiple times to the list.\n *\n * Example:\n * HTML: <div><div><div>foo</div></div></div>\n * Condition: node => node.nodeName === 'div'\n * If recurseFoundNodes is false, this will return: [ <div><div><div>foo</div></div></div> ]\n *\n * If recurseFoundNodes is true, this will return: [ <div><div><div>foo</div></div></div>, <div><div>foo</div></div>, <div>foo</div> ]\n *\n * In assessments where you want to count the number of occurrences of a certain type of node, you should set recurseFoundNodes to false.\n * For example in the list assessment with a nested list: you only want to count the outer list.\n *\n * <ul>\n *   <li>Coffee</li>\n *   <li>Tea\n *     <ul>\n *       <li>Black tea</li>\n *       <li>Green tea</li>\n *     </ul>\n *   </li>\n *   <li>Milk</li>\n * </ul>\n *\n * In getTextElementPositions, you want to find all descendant nodes that have position information.\n * In this case you want to recurse into found nodes.\n *\n * @returns {Object[]} The list of nodes that satisfy the condition.\n */\nexport default function findAllInTree( tree, condition, recurseFoundNodes = false ) {\n\tconst nodes = [];\n\n\tif ( ! tree.childNodes ) {\n\t\treturn nodes;\n\t}\n\n\ttree.childNodes.forEach( child => {\n\t\tif ( condition( child ) ) {\n\t\t\tnodes.push( child );\n\t\t\tif ( recurseFoundNodes ) {\n\t\t\t\tnodes.push( ...findAllInTree( child, condition, recurseFoundNodes ) );\n\t\t\t}\n\t\t} else {\n\t\t\tnodes.push( ...findAllInTree( child, condition, recurseFoundNodes ) );\n\t\t}\n\t} );\n\n\treturn nodes;\n}\n"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAASA,aAAaA,CAAEC,IAAI,EAAEC,SAAS,EAAEC,iBAAiB,GAAG,KAAK,EAAG;EACnF,MAAMC,KAAK,GAAG,EAAE;EAEhB,IAAK,CAAEH,IAAI,CAACI,UAAU,EAAG;IACxB,OAAOD,KAAK;EACb;EAEAH,IAAI,CAACI,UAAU,CAACC,OAAO,CAAEC,KAAK,IAAI;IACjC,IAAKL,SAAS,CAAEK,KAAM,CAAC,EAAG;MACzBH,KAAK,CAACI,IAAI,CAAED,KAAM,CAAC;MACnB,IAAKJ,iBAAiB,EAAG;QACxBC,KAAK,CAACI,IAAI,CAAE,GAAGR,aAAa,CAAEO,KAAK,EAAEL,SAAS,EAAEC,iBAAkB,CAAE,CAAC;MACtE;IACD,CAAC,MAAM;MACNC,KAAK,CAACI,IAAI,CAAE,GAAGR,aAAa,CAAEO,KAAK,EAAEL,SAAS,EAAEC,iBAAkB,CAAE,CAAC;IACtE;EACD,CAAE,CAAC;EAEH,OAAOC,KAAK;AACb","ignoreList":[]}

package/build/parse/traverse/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","names":["findAllInTree","innerText"],"sources":["../../../src/parse/traverse/index.js"],"sourcesContent":["import findAllInTree from \"./findAllInTree\";\nimport innerText from \"./innerText\";\n\n/**\n * @module parse/traverse\n *\n * Module containing functions to traverse and gather information from the tree.\n */\nexport {\n\tfindAllInTree,\n\tinnerText,\n};\n"],"mappings":"AAAA,OAAOA,aAAa;AACpB,OAAOC,SAAS;;AAEhB;AACA;AACA;AACA;AACA;AACA,SACCD,aAAa,EACbC,SAAS","ignoreList":[]}

package/build/parse/traverse/innerText.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"innerText.js","names":["isEmpty","innerText","node","text","childNodes","forEach","child","name","value"],"sources":["../../../src/parse/traverse/innerText.js"],"sourcesContent":["import { isEmpty } from \"lodash\";\n\n/**\n * Gathers the text content of the given node.\n *\n * @param {Object} node The node to gather the text content from.\n *\n * @returns {string} The text content.\n */\nexport default function innerText( node ) {\n\tlet text = \"\";\n\n\tif ( ! isEmpty( node.childNodes ) ) {\n\t\tnode.childNodes.forEach( child => {\n\t\t\tif ( child.name === \"#text\" ) {\n\t\t\t\ttext += child.value;\n\t\t\t} else if ( child.name === \"br\" ) {\n\t\t\t\ttext += \"\\n\";\n\t\t\t} else {\n\t\t\t\ttext += innerText( child );\n\t\t\t}\n\t\t} );\n\t}\n\n\treturn text;\n}\n"],"mappings":"AAAA,SAASA,OAAO,QAAQ,QAAQ;;AAEhC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAASC,SAASA,CAAEC,IAAI,EAAG;EACzC,IAAIC,IAAI,GAAG,EAAE;EAEb,IAAK,CAAEH,OAAO,CAAEE,IAAI,CAACE,UAAW,CAAC,EAAG;IACnCF,IAAI,CAACE,UAAU,CAACC,OAAO,CAAEC,KAAK,IAAI;MACjC,IAAKA,KAAK,CAACC,IAAI,KAAK,OAAO,EAAG;QAC7BJ,IAAI,IAAIG,KAAK,CAACE,KAAK;MACpB,CAAC,MAAM,IAAKF,KAAK,CAACC,IAAI,KAAK,IAAI,EAAG;QACjCJ,IAAI,IAAI,IAAI;MACb,CAAC,MAAM;QACNA,IAAI,IAAIF,SAAS,CAAEK,KAAM,CAAC;MAC3B;IACD,CAAE,CAAC;EACJ;EAEA,OAAOH,IAAI;AACZ","ignoreList":[]}

package/build/parsedPaper/ParsedPaper.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"ParsedPaper.js","names":["ParsedPaper","constructor","_metaData","_tree","setTree","tree","getTree","setMetaProperty","key","value","getMetaProperty","setMetaData","metaData","getMetaData"],"sources":["../../src/parsedPaper/ParsedPaper.js"],"sourcesContent":["/**\n * A parsed version of the paper, containing a tree representation of the text,\n * and parsed metaData pertaining to the tree's context.\n *\n * @class ParsedPaper\n *\n * @memberOf module:parsedPaper\n * */\nexport default class ParsedPaper {\n\t/**\n\t * Creates a new ParsedPaper.\n\t */\n\tconstructor() {\n\t\t/**\n\t\t * Stores the metadata (e.g. the keywords, metadescription, title of the document).\n\t\t *\n\t\t * @type{Object}\n\t\t * @private\n\t\t */\n\t\tthis._metaData = {};\n\n\t\t/**\n\t\t * Stores the tree representation of a Paper's text.\n\t\t *\n\t\t * @type{module:parsedPaper/structure.Node|Object}\n\t\t * @private\n\t\t */\n\t\tthis._tree = {};\n\t}\n\n\t/**\n\t * Sets a tree structure on the ParsedPaper.\n\t *\n\t * @param {module:parsedPaper/structure.Node} tree A tree representation of the paper's text.\n\t *\n\t * @returns {void}\n\t */\n\tsetTree( tree ) {\n\t\tthis._tree = tree;\n\t}\n\n\t/**\n\t * Returns the tree from the ParsedPaper.\n\t *\n\t * @returns {module:parsedPaper/structure.Node|Object} The tree.\n\t */\n\tgetTree() {\n\t\treturn this._tree;\n\t}\n\n\t/**\n\t * Sets a metadata value on the ParsedPaper under the passed key.\n\t *\n\t * @param {string} key   The key for the metaData key-value pair.\n\t * @param {*}      value The value for the metaData key-value pair.\n\t *\n\t * @returns {void}\n\t */\n\tsetMetaProperty( key, value ) {\n\t\tthis._metaData[ key ] = value;\n\t}\n\n\t/**\n\t * Returns the metadata value for a specific key from the ParsedPaper.\n\t *\n\t * @param   {string} key The key to return the value for.\n\t * @returns {*}          The value belonging to this key.\n\t */\n\tgetMetaProperty( key ) {\n\t\treturn this._metaData[ key ];\n\t}\n\n\t/**\n\t * Sets the metaData on the ParsedPaper.\n\t *\n\t * @param {Object} metaData The metaData pertaining to tree.\n\t *\n\t * @returns {void}\n\t */\n\tsetMetaData( metaData ) {\n\t\tthis._metaData = metaData;\n\t}\n\n\t/**\n\t * Returns the current metaData of the ParsedPaper.\n\t *\n\t * @returns {Object} The metaData.\n\t */\n\tgetMetaData() {\n\t\treturn this._metaData;\n\t}\n}\n"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAMA,WAAW,CAAC;EAChC;AACD;AACA;EACCC,WAAWA,CAAA,EAAG;IACb;AACF;AACA;AACA;AACA;AACA;IACE,IAAI,CAACC,SAAS,GAAG,CAAC,CAAC;;IAEnB;AACF;AACA;AACA;AACA;AACA;IACE,IAAI,CAACC,KAAK,GAAG,CAAC,CAAC;EAChB;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;EACCC,OAAOA,CAAEC,IAAI,EAAG;IACf,IAAI,CAACF,KAAK,GAAGE,IAAI;EAClB;;EAEA;AACD;AACA;AACA;AACA;EACCC,OAAOA,CAAA,EAAG;IACT,OAAO,IAAI,CAACH,KAAK;EAClB;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;AACA;EACCI,eAAeA,CAAEC,GAAG,EAAEC,KAAK,EAAG;IAC7B,IAAI,CAACP,SAAS,CAAEM,GAAG,CAAE,GAAGC,KAAK;EAC9B;;EAEA;AACD;AACA;AACA;AACA;AACA;EACCC,eAAeA,CAAEF,GAAG,EAAG;IACtB,OAAO,IAAI,CAACN,SAAS,CAAEM,GAAG,CAAE;EAC7B;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;EACCG,WAAWA,CAAEC,QAAQ,EAAG;IACvB,IAAI,CAACV,SAAS,GAAGU,QAAQ;EAC1B;;EAEA;AACD;AACA;AACA;AACA;EACCC,WAAWA,CAAA,EAAG;IACb,OAAO,IAAI,CAACX,SAAS;EACtB;AACD","ignoreList":[]}

package/build/parsedPaper/assess/TreeAssessor.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"TreeAssessor.js","names":["__","sprintf","AssessmentResult","TreeAssessor","constructor","options","researcher","scoreAggregator","_assessments","assessments","forEach","assessment","setResearcher","getAssessments","assess","paper","node","applicableAssessments","getApplicableAssessments","results","Promise","all","map","applyAssessment","validResults","filter","result","getScore","score","aggregate","apply","catch","text","name","registerAssessment","push","removeAssessment","index","findIndex","deleted","splice","getAssessment","assessmentToReturn","find","setAssessments","promises","isApplicable","then","applicable"],"sources":["../../../src/parsedPaper/assess/TreeAssessor.js"],"sourcesContent":["import { __, sprintf } from \"@wordpress/i18n\";\nimport AssessmentResult from \"../../values/AssessmentResult\";\n\n/**\n * Analyzes a paper by doing a list of assessments on a tree representation of a text and its metadata.\n * Aggregates the scores on each individual assessment into an overall score.\n *\n * This score can represent anything from the readability to the SEO of the given text and metadata.\n *\n * @memberOf module:parsedPaper/assess\n */\nclass TreeAssessor {\n\t/**\n\t * Creates a new assessor.\n\t *\n\t * @param {Object}                                     options                 Assessor options.\n\t * @param {module:parsedPaper/research.TreeResearcher} options.researcher      Supplies the assessments with researches and their\n\t *                                                                             (cached) results.\n\t * @param {module:parsedPaper/assess.ScoreAggregator}  options.scoreAggregator Aggregates the scores on the individual assessments into one.\n\t * @param {module:parsedPaper/assess.Assessment[]}     [options.assessments]   The list of assessments to apply.\n\t */\n\tconstructor( options ) {\n\t\t/**\n\t\t * Supplies the assessments with researches and their (cached) results.\n\t\t * @type {module:parsedPaper/research.TreeResearcher}\n\t\t */\n\t\tthis.researcher = options.researcher;\n\t\t/**\n\t\t * Aggregates the scores on the individual assessments into one overall score.\n\t\t * @type {module:parsedPaper/assess.ScoreAggregator}\n\t\t */\n\t\tthis.scoreAggregator = options.scoreAggregator;\n\t\t/**\n\t\t * The list of assessments to apply.\n\t\t * @type {module:parsedPaper/assess.Assessment[]}\n\t\t */\n\t\tthis._assessments = options.assessments || [];\n\t\t// Make sure that all of the assessments have the researcher.\n\t\tthis._assessments.forEach( assessment => assessment.setResearcher( this.researcher ) );\n\t}\n\n\t/**\n\t * Returns the list of available assessments.\n\t *\n\t * @returns {module:parsedPaper/assess.Assessment[]} The list of all available assessments.\n\t */\n\tgetAssessments() {\n\t\treturn this._assessments;\n\t}\n\n\t/**\n\t * Assesses the given text by applying all the assessments to it\n\t * and aggregating the resulting scores.\n\t *\n\t * @param {Paper}                      paper The paper to assess. This contains metadata about the text.\n\t * @param {module:parsedPaper/structure.Node} node  The root node of the tree to check.\n\t *\n\t * @returns {Promise<{results: AssessmentResult[], score: number}>} The assessment results and the overall score.\n\t */\n\tasync assess( paper, node ) {\n\t\tconst applicableAssessments = await this.getApplicableAssessments( paper, node );\n\t\t/*\n\t\t  Apply every applicable assessment on the document.\n\t\t  Wait before they are done before aggregating the results\n\t\t  and returning the results and final score.\n\t\t */\n\t\tconst results = await Promise.all(\n\t\t\tapplicableAssessments.map( assessment => this.applyAssessment( assessment, paper, node ) )\n\t\t);\n\t\t// Filter out errored assessments.\n\t\tconst validResults = results.filter( result => result.getScore() !== -1 );\n\t\t// Compute overall score.\n\t\tconst score = this.scoreAggregator.aggregate( validResults );\n\n\t\treturn { results, score };\n\t}\n\n\t/**\n\t * Applies the given assessment to the paper-node combination.\n\t *\n\t * @param {module:parsedPaper/assess.Assessment} assessment The assessment to apply.\n\t * @param {Paper}                         paper      The paper to apply the assessment to.\n\t * @param {module:parsedPaper/structure.Node}    node       The root node of the tree to apply the assessment to.\n\t *\n\t * @returns {Promise<AssessmentResult>} The result of the assessment.\n\t */\n\tasync applyAssessment( assessment, paper, node ) {\n\t\treturn assessment.apply( paper, node ).catch(\n\t\t\t() => {\n\t\t\t\treturn new AssessmentResult( {\n\t\t\t\t\ttext: sprintf(\n\t\t\t\t\t\t/* translators: %1$s expands to the name of the assessment. */\n\t\t\t\t\t\t__( \"An error occurred in the '%1$s' assessment\", \"wordpress-seo\" ),\n\t\t\t\t\t\tassessment.name\n\t\t\t\t\t),\n\t\t\t\t\tscore: -1,\n\t\t\t\t} );\n\t\t\t}\n\t\t);\n\t}\n\n\t/**\n\t * Adds the assessment to the list of assessments to apply.\n\t *\n\t * @param {string}                        name       The name to register the assessment under.\n\t * @param {module:parsedPaper/assess.Assessment} assessment The assessment to add.\n\t *\n\t * @returns {void}\n\t */\n\tregisterAssessment( name, assessment ) {\n\t\tassessment.name = name;\n\t\tassessment.setResearcher( this.researcher );\n\t\tthis._assessments.push( assessment );\n\t}\n\n\t/**\n\t * Removes the assessment registered under the given name, if it exists.\n\t *\n\t * @param {string} name The name of the assessment to remove.\n\t *\n\t * @returns {module:parsedPaper/assess.Assessment|null} The deleted assessment, or null if no assessment has been deleted.\n\t */\n\tremoveAssessment( name ) {\n\t\tconst index = this._assessments.findIndex( assessment => assessment.name === name );\n\t\tif ( index > -1 ) {\n\t\t\tconst deleted = this._assessments.splice( index, 1 );\n\t\t\treturn deleted[ 0 ];\n\t\t}\n\t\treturn null;\n\t}\n\n\t/**\n\t * Returns the assessment registered under the given name.\n\t * Returns `null` if no assessment is registered under the given name.\n\t *\n\t * @param {string} name The name of the assessment to get.\n\t *\n\t * @returns {Assessment|null} The assessment.\n\t */\n\tgetAssessment( name ) {\n\t\tconst assessmentToReturn = this._assessments.find( assessment => assessment.name === name );\n\t\treturn assessmentToReturn ? assessmentToReturn : null;\n\t}\n\n\t/**\n\t * Sets the assessments that this assessor needs to apply.\n\t *\n\t * @param {module:parsedPaper/assess.Assessment[]} assessments The assessments to set.\n\t *\n\t * @returns {void}\n\t */\n\tsetAssessments( assessments ) {\n\t\tthis._assessments = assessments;\n\t}\n\n\t/**\n\t * Returns the list of applicable assessments.\n\t *\n\t * @param {Paper}                      paper The paper to check.\n\t * @param {module:parsedPaper/structure.Node} node  The tree to check.\n\t *\n\t * @returns {Promise<Array>} The list of applicable assessments.\n\t */\n\tasync getApplicableAssessments( paper, node ) {\n\t\t// List to store the applicable assessments in (empty for now).\n\t\tconst applicableAssessments = [];\n\n\t\t// Asynchronously add each assessment to the list if they are applicable.\n\t\tconst promises = this._assessments.map( assessment =>\n\t\t\tassessment.isApplicable( paper, node ).then(\n\t\t\t\tapplicable => {\n\t\t\t\t\tif ( applicable ) {\n\t\t\t\t\t\tapplicableAssessments.push( assessment );\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t)\n\t\t);\n\n\t\t// Wait before all the applicable assessments have been added before returning them.\n\t\treturn Promise.all( promises ).then( () => applicableAssessments );\n\t}\n}\n\nexport default TreeAssessor;\n"],"mappings":"AAAA,SAASA,EAAE,EAAEC,OAAO,QAAQ,iBAAiB;AAC7C,OAAOC,gBAAgB;;AAEvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,YAAY,CAAC;EAClB;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACCC,WAAWA,CAAEC,OAAO,EAAG;IACtB;AACF;AACA;AACA;IACE,IAAI,CAACC,UAAU,GAAGD,OAAO,CAACC,UAAU;IACpC;AACF;AACA;AACA;IACE,IAAI,CAACC,eAAe,GAAGF,OAAO,CAACE,eAAe;IAC9C;AACF;AACA;AACA;IACE,IAAI,CAACC,YAAY,GAAGH,OAAO,CAACI,WAAW,IAAI,EAAE;IAC7C;IACA,IAAI,CAACD,YAAY,CAACE,OAAO,CAAEC,UAAU,IAAIA,UAAU,CAACC,aAAa,CAAE,IAAI,CAACN,UAAW,CAAE,CAAC;EACvF;;EAEA;AACD;AACA;AACA;AACA;EACCO,cAAcA,CAAA,EAAG;IAChB,OAAO,IAAI,CAACL,YAAY;EACzB;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACC,MAAMM,MAAMA,CAAEC,KAAK,EAAEC,IAAI,EAAG;IAC3B,MAAMC,qBAAqB,GAAG,MAAM,IAAI,CAACC,wBAAwB,CAAEH,KAAK,EAAEC,IAAK,CAAC;IAChF;AACF;AACA;AACA;AACA;IACE,MAAMG,OAAO,GAAG,MAAMC,OAAO,CAACC,GAAG,CAChCJ,qBAAqB,CAACK,GAAG,CAAEX,UAAU,IAAI,IAAI,CAACY,eAAe,CAAEZ,UAAU,EAAEI,KAAK,EAAEC,IAAK,CAAE,CAC1F,CAAC;IACD;IACA,MAAMQ,YAAY,GAAGL,OAAO,CAACM,MAAM,CAAEC,MAAM,IAAIA,MAAM,CAACC,QAAQ,CAAC,CAAC,KAAK,CAAC,CAAE,CAAC;IACzE;IACA,MAAMC,KAAK,GAAG,IAAI,CAACrB,eAAe,CAACsB,SAAS,CAAEL,YAAa,CAAC;IAE5D,OAAO;MAAEL,OAAO;MAAES;IAAM,CAAC;EAC1B;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACC,MAAML,eAAeA,CAAEZ,UAAU,EAAEI,KAAK,EAAEC,IAAI,EAAG;IAChD,OAAOL,UAAU,CAACmB,KAAK,CAAEf,KAAK,EAAEC,IAAK,CAAC,CAACe,KAAK,CAC3C,MAAM;MACL,OAAO,IAAI7B,gBAAgB,CAAE;QAC5B8B,IAAI,EAAE/B,OAAO,CACZ;QACAD,EAAE,CAAE,4CAA4C,EAAE,eAAgB,CAAC,EACnEW,UAAU,CAACsB,IACZ,CAAC;QACDL,KAAK,EAAE,CAAC;MACT,CAAE,CAAC;IACJ,CACD,CAAC;EACF;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;AACA;EACCM,kBAAkBA,CAAED,IAAI,EAAEtB,UAAU,EAAG;IACtCA,UAAU,CAACsB,IAAI,GAAGA,IAAI;IACtBtB,UAAU,CAACC,aAAa,CAAE,IAAI,CAACN,UAAW,CAAC;IAC3C,IAAI,CAACE,YAAY,CAAC2B,IAAI,CAAExB,UAAW,CAAC;EACrC;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;EACCyB,gBAAgBA,CAAEH,IAAI,EAAG;IACxB,MAAMI,KAAK,GAAG,IAAI,CAAC7B,YAAY,CAAC8B,SAAS,CAAE3B,UAAU,IAAIA,UAAU,CAACsB,IAAI,KAAKA,IAAK,CAAC;IACnF,IAAKI,KAAK,GAAG,CAAC,CAAC,EAAG;MACjB,MAAME,OAAO,GAAG,IAAI,CAAC/B,YAAY,CAACgC,MAAM,CAAEH,KAAK,EAAE,CAAE,CAAC;MACpD,OAAOE,OAAO,CAAE,CAAC,CAAE;IACpB;IACA,OAAO,IAAI;EACZ;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;AACA;EACCE,aAAaA,CAAER,IAAI,EAAG;IACrB,MAAMS,kBAAkB,GAAG,IAAI,CAAClC,YAAY,CAACmC,IAAI,CAAEhC,UAAU,IAAIA,UAAU,CAACsB,IAAI,KAAKA,IAAK,CAAC;IAC3F,OAAOS,kBAAkB,GAAGA,kBAAkB,GAAG,IAAI;EACtD;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;EACCE,cAAcA,CAAEnC,WAAW,EAAG;IAC7B,IAAI,CAACD,YAAY,GAAGC,WAAW;EAChC;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;AACA;EACC,MAAMS,wBAAwBA,CAAEH,KAAK,EAAEC,IAAI,EAAG;IAC7C;IACA,MAAMC,qBAAqB,GAAG,EAAE;;IAEhC;IACA,MAAM4B,QAAQ,GAAG,IAAI,CAACrC,YAAY,CAACc,GAAG,CAAEX,UAAU,IACjDA,UAAU,CAACmC,YAAY,CAAE/B,KAAK,EAAEC,IAAK,CAAC,CAAC+B,IAAI,CAC1CC,UAAU,IAAI;MACb,IAAKA,UAAU,EAAG;QACjB/B,qBAAqB,CAACkB,IAAI,CAAExB,UAAW,CAAC;MACzC;IACD,CACD,CACD,CAAC;;IAED;IACA,OAAOS,OAAO,CAACC,GAAG,CAAEwB,QAAS,CAAC,CAACE,IAAI,CAAE,MAAM9B,qBAAsB,CAAC;EACnE;AACD;AAEA,eAAed,YAAY","ignoreList":[]}

package/build/parsedPaper/assess/assessmentListFactories.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"assessmentListFactories.js","names":["constructSEOAssessments","constructReadabilityAssessments","constructTaxonomyAssessments","constructRelatedKeyphraseAssessments","constructRelatedKeyphraseTaxonomyAssessments"],"sources":["../../../src/parsedPaper/assess/assessmentListFactories.js"],"sourcesContent":["/**\n * Factory functions for creating lists of assessments.\n *\n * To be used in creating the different kinds of assessors.\n */\n\n/**\n * Creates a new list of SEO assessments.\n *\n * @returns {module:parsedPaper/assess.Assessment[]} The list of SEO assessments.\n *\n * @private\n * @memberOf module:parsedPaper/assess\n */\nconst constructSEOAssessments = () => [\n\t// Needs to be populated by fancy new assessments that work on the tree representation of the text.\n];\n\n/**\n * Creates a new list of readability assessments.\n *\n * @returns {module:parsedPaper/assess.Assessment[]} The list of readability assessments.\n *\n * @private\n * @memberOf module:parsedPaper/assess\n */\nconst constructReadabilityAssessments = () => [\n\t// Needs to be populated by fancy new assessments that work on the tree representation of the text.\n];\n\n/**\n * Creates a new list of SEO assessments for taxonomy pages.\n *\n * @returns {module:parsedPaper/assess.Assessment[]} The list of SEO assessments.\n *\n * @private\n * @memberOf module:parsedPaper/assess\n */\nconst constructTaxonomyAssessments = () => [\n\t// Needs to be populated by fancy new assessments that work on the tree representation of the text.\n];\n\n/**\n * Creates a new list of SEO assessments for related keyphrases.\n *\n * @returns {module:parsedPaper/assess.Assessment[]} The list of SEO assessments.\n *\n * @private\n * @memberOf module:parsedPaper/assess\n */\nconst constructRelatedKeyphraseAssessments = () => [\n\t// Needs to be populated by fancy new assessments that work on the tree representation of the text.\n];\n\n/**\n * Creates a new list of SEO assessments for related keyphrases on taxonomy pages.\n *\n * @returns {module:parsedPaper/assess.Assessment[]} The list of SEO assessments.\n *\n * @private\n * @memberOf module:parsedPaper/assess\n */\nconst constructRelatedKeyphraseTaxonomyAssessments = () => [\n\t// Needs to be populated by fancy new assessments that work on the tree representation of the text.\n];\n\nexport {\n\tconstructSEOAssessments,\n\tconstructReadabilityAssessments,\n\tconstructTaxonomyAssessments,\n\tconstructRelatedKeyphraseAssessments,\n\tconstructRelatedKeyphraseTaxonomyAssessments,\n};\n"],"mappings":"AAAA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMA,uBAAuB,GAAGA,CAAA,KAAM;EACrC;AAAA,CACA;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,+BAA+B,GAAGA,CAAA,KAAM;EAC7C;AAAA,CACA;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,4BAA4B,GAAGA,CAAA,KAAM;EAC1C;AAAA,CACA;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,oCAAoC,GAAGA,CAAA,KAAM;EAClD;AAAA,CACA;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,4CAA4C,GAAGA,CAAA,KAAM;EAC1D;AAAA,CACA;AAED,SACCJ,uBAAuB,EACvBC,+BAA+B,EAC/BC,4BAA4B,EAC5BC,oCAAoC,EACpCC,4CAA4C","ignoreList":[]}

package/build/parsedPaper/assess/assessments/Assessment.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"Assessment.js","names":["Assessment","constructor","name","researcher","_researcher","_config","id","docUrl","priority","fixPosition","title","content","good","improve","bad","setResearcher","getResearcher","isApplicable","parsedPaper","console","warn","apply"],"sources":["../../../../src/parsedPaper/assess/assessments/Assessment.js"],"sourcesContent":["/**\n * An assessment that can be applied to a formatted text and its meta data.\n *\n * @memberOf module:parsedPaper/assess\n *\n * @abstract\n */\nclass Assessment {\n  /**\n   * Creates a new assessment.\n   *\n   * @param {string}                              name       The name to give this assessment.\n   * @param {module:parsedPaper/research.TreeResearcher} researcher The researcher to do researches with.\n   *\n   * @abstract\n   */\n  constructor(name, researcher) {\n    /**\n     * This assessment's name.\n     * @type {string}\n     */\n    this.name = name;\n    /**\n     * The researcher to do researches with.\n     * @type {module:parsedPaper/research.TreeResearcher}\n     * @private\n     */\n    this._researcher = researcher;\n\n    this._config = {\n      id: '',\n      docUrl: '',\n      priority: '',\n      fixPosition: '',\n      title: '',\n      content: {\n        good: '',\n        improve: '',\n        bad: ''\n      }\n    };\n  }\n\n  /**\n   * Sets a new researcher on this assessment.\n   *\n   * @param {module:parsedPaper/research.TreeResearcher} researcher The researcher to do researches with.\n   *\n   * @returns {void}\n   */\n  setResearcher(researcher) {\n    this._researcher = researcher;\n  }\n\n  /**\n   * Returns the researcher used by this assessment.\n   *\n   * @returns {module:parsedPaper/research.TreeResearcher} The researcher used by this assessment.\n   */\n  getResearcher() {\n    return this._researcher;\n  }\n\n  /**\n   * Checks whether this assessment is applicable to the given paper and tree combination.\n   *\n   * @param {ParsedPaper} parsedPaper The parsedPaper to check.\n   *\n   * @returns {Promise<boolean>} Whether this assessment is applicable to the given paper and tree combination (wrapped in a promise).\n   *\n   * @abstract\n   */\n  async isApplicable(parsedPaper) {\n    // eslint-disable-line no-unused-vars\n    console.warn('`isApplicable` should be implemented by a child class of `Assessment`.');\n  }\n\n  /**\n   * Applies this assessment to the given combination of parsedPaper and tree.\n   *\n   * @param {ParsedPaper} parsedPaper The parsedPaper to check.\n   *\n   * @returns {Promise<AssessmentResult>} The result of this assessment (wrapped in a promise).\n   *\n   * @abstract\n   */\n  async apply(parsedPaper) {\n    // eslint-disable-line no-unused-vars\n    console.warn('`apply` should be implemented by a child class of `Assessment`.');\n  }\n}\n\nexport default Assessment;\n"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMA,UAAU,CAAC;EACf;AACF;AACA;AACA;AACA;AACA;AACA;AACA;EACEC,WAAWA,CAACC,IAAI,EAAEC,UAAU,EAAE;IAC5B;AACJ;AACA;AACA;IACI,IAAI,CAACD,IAAI,GAAGA,IAAI;IAChB;AACJ;AACA;AACA;AACA;IACI,IAAI,CAACE,WAAW,GAAGD,UAAU;IAE7B,IAAI,CAACE,OAAO,GAAG;MACbC,EAAE,EAAE,EAAE;MACNC,MAAM,EAAE,EAAE;MACVC,QAAQ,EAAE,EAAE;MACZC,WAAW,EAAE,EAAE;MACfC,KAAK,EAAE,EAAE;MACTC,OAAO,EAAE;QACPC,IAAI,EAAE,EAAE;QACRC,OAAO,EAAE,EAAE;QACXC,GAAG,EAAE;MACP;IACF,CAAC;EACH;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;EACEC,aAAaA,CAACZ,UAAU,EAAE;IACxB,IAAI,CAACC,WAAW,GAAGD,UAAU;EAC/B;;EAEA;AACF;AACA;AACA;AACA;EACEa,aAAaA,CAAA,EAAG;IACd,OAAO,IAAI,CAACZ,WAAW;EACzB;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACE,MAAMa,YAAYA,CAACC,WAAW,EAAE;IAC9B;IACAC,OAAO,CAACC,IAAI,CAAC,wEAAwE,CAAC;EACxF;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACE,MAAMC,KAAKA,CAACH,WAAW,EAAE;IACvB;IACAC,OAAO,CAACC,IAAI,CAAC,iEAAiE,CAAC;EACjF;AACF;AAEA,eAAepB,UAAU","ignoreList":[]}

package/build/parsedPaper/assess/assessments/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","names":["default","Assessment"],"sources":["../../../../src/parsedPaper/assess/assessments/index.js"],"sourcesContent":["/**\n * Contains the logic to assess a tree.\n *\n * @module module:parsedPaper/assess\n */\nexport { default as Assessment } from \"./Assessment\";\n"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA,SAASA,OAAO,IAAIC,UAAU","ignoreList":[]}

package/build/parsedPaper/assess/assessorFactories.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"assessorFactories.js","names":["constructReadabilityAssessments","constructRelatedKeyphraseAssessments","constructRelatedKeyphraseTaxonomyAssessments","constructSEOAssessments","constructTaxonomyAssessments","constructCornerstoneSEOAssessments","constructCornerstoneRelatedKeyphraseAssessments","constructCornerstoneReadabilityAssessments","ReadabilityScoreAggregator","SEOScoreAggregator","TreeAssessor","SEO_ASSESSMENTS_MAP","Default","RelatedKeyphrase","Taxonomy","RelatedKeyphraseTaxonomy","Cornerstone","CornerstoneRelatedKeyphrase","constructSEOAssessor","researcher","config","cornerstone","relatedKeyphrase","taxonomy","key","join","assessmentFactory","Error","assessments","scoreAggregator","constructReadabilityAssessor","isCornerstoneContent"],"sources":["../../../src/parsedPaper/assess/assessorFactories.js"],"sourcesContent":["/* Assessment list factories. */\nimport {\n\tconstructReadabilityAssessments,\n\tconstructRelatedKeyphraseAssessments,\n\tconstructRelatedKeyphraseTaxonomyAssessments,\n\tconstructSEOAssessments,\n\tconstructTaxonomyAssessments,\n} from \"./assessmentListFactories\";\n\nimport {\n\tconstructSEOAssessments as constructCornerstoneSEOAssessments,\n\tconstructRelatedKeyphraseAssessments as constructCornerstoneRelatedKeyphraseAssessments,\n\tconstructReadabilityAssessments as constructCornerstoneReadabilityAssessments,\n} from \"./cornerstone/assessmentListFactories\";\n\n/* Score aggregators */\nimport { ReadabilityScoreAggregator, SEOScoreAggregator } from \"../../scoring/scoreAggregators\";\n\n/* Base TreeAssessor class */\nimport TreeAssessor from \"./TreeAssessor\";\n\n/**\n * Maps combinations of assessor parameters (if the assessor is for related keyphrases, cornerstone content and/or taxonomy pages)\n * to functions that generate a list of applicable assessments.\n *\n * @const\n * @private\n * @type {Object}\n */\nconst SEO_ASSESSMENTS_MAP = {\n\tDefault: constructSEOAssessments,\n\n\tRelatedKeyphrase: constructRelatedKeyphraseAssessments,\n\tTaxonomy: constructTaxonomyAssessments,\n\tRelatedKeyphraseTaxonomy: constructRelatedKeyphraseTaxonomyAssessments,\n\n\tCornerstone: constructCornerstoneSEOAssessments,\n\tCornerstoneRelatedKeyphrase: constructCornerstoneRelatedKeyphraseAssessments,\n};\n\n/**\n * Constructs a new SEO assessor.\n *\n * @param {module:parsedPaper/research.TreeResearcher} researcher The researcher the assessments need to use to get information about the text.\n *\n * @param {Object}                              config                    The assessor configuration.\n * @param {boolean}                             [config.relatedKeyphrase] If this assessor is for a related keyphrase, instead of the main one.\n * @param {boolean}                             [config.taxonomy]         If this assessor is for a taxonomy page, instead of a regular page.\n * @param {boolean}                             [config.cornerstone]      If this assessor is for cornerstone content.\n *\n * @returns {module:parsedPaper/assess.TreeAssessor} The created SEO assessor.\n *\n * @throws {Error} An error when no assessor exists for the given combination of configuration options.\n *\n * @memberOf module:parsedPaper/assess\n */\nconst constructSEOAssessor = function( researcher, config ) {\n\t/*\n\t * Construct the key to retrieve the right assessment list factory.\n\t * E.g. \"RelatedKeyphraseTaxonomy\" for related keyphrase + taxonomy;\n\t */\n\tconst cornerstone = config.cornerstone ? \"Cornerstone\" : \"\";\n\tconst relatedKeyphrase = config.relatedKeyphrase ? \"RelatedKeyphrase\" : \"\";\n\tconst taxonomy = config.taxonomy ? \"Taxonomy\" : \"\";\n\n\t// (Empty key defaults to \"Default\" key)\n\tconst key = [ cornerstone, relatedKeyphrase, taxonomy ].join( \"\" ) || \"Default\";\n\n\t// Retrieve the assessment list factory.\n\tconst assessmentFactory = SEO_ASSESSMENTS_MAP[ key ];\n\n\t// This specific combination of cornerstone, taxonomy and related keyphrase does not exist.\n\tif ( ! assessmentFactory ) {\n\t\tthrow new Error( \"Cannot make an assessor based on the provided combination of configuration options\" );\n\t}\n\n\t// Construct assessor.\n\tconst assessments = assessmentFactory();\n\tconst scoreAggregator = new SEOScoreAggregator();\n\treturn new TreeAssessor( { researcher, assessments, scoreAggregator } );\n};\n\n/**\n * Constructs a new readability assessor.\n *\n * @param {module:parsedPaper/research.TreeResearcher} researcher           The researcher the assessments need to use to\n *                                                                          get information about the text.\n * @param {boolean}                                    isCornerstoneContent If the to be analyzed content is considered cornerstone content\n * (which uses stricter boundaries).\n *\n * @returns {module:parsedPaper/assess.TreeAssessor} The created readability assessor.\n *\n * @memberOf module:parsedPaper/assess\n */\nconst constructReadabilityAssessor = function( researcher, isCornerstoneContent = false ) {\n\tconst assessments = isCornerstoneContent ? constructReadabilityAssessments() : constructCornerstoneReadabilityAssessments();\n\tconst scoreAggregator = new ReadabilityScoreAggregator();\n\treturn new TreeAssessor( { researcher, assessments, scoreAggregator } );\n};\n\nexport {\n\tconstructSEOAssessor,\n\tconstructReadabilityAssessor,\n};\n"],"mappings":"AAAA;AACA,SACCA,+BAA+B,EAC/BC,oCAAoC,EACpCC,4CAA4C,EAC5CC,uBAAuB,EACvBC,4BAA4B;AAG7B,SACCD,uBAAuB,IAAIE,kCAAkC,EAC7DJ,oCAAoC,IAAIK,+CAA+C,EACvFN,+BAA+B,IAAIO,0CAA0C;;AAG9E;AACA,SAASC,0BAA0B,EAAEC,kBAAkB;;AAEvD;AACA,OAAOC,YAAY;;AAEnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,mBAAmB,GAAG;EAC3BC,OAAO,EAAET,uBAAuB;EAEhCU,gBAAgB,EAAEZ,oCAAoC;EACtDa,QAAQ,EAAEV,4BAA4B;EACtCW,wBAAwB,EAAEb,4CAA4C;EAEtEc,WAAW,EAAEX,kCAAkC;EAC/CY,2BAA2B,EAAEX;AAC9B,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMY,oBAAoB,GAAG,SAAAA,CAAUC,UAAU,EAAEC,MAAM,EAAG;EAC3D;AACD;AACA;AACA;EACC,MAAMC,WAAW,GAAGD,MAAM,CAACC,WAAW,GAAG,aAAa,GAAG,EAAE;EAC3D,MAAMC,gBAAgB,GAAGF,MAAM,CAACE,gBAAgB,GAAG,kBAAkB,GAAG,EAAE;EAC1E,MAAMC,QAAQ,GAAGH,MAAM,CAACG,QAAQ,GAAG,UAAU,GAAG,EAAE;;EAElD;EACA,MAAMC,GAAG,GAAG,CAAEH,WAAW,EAAEC,gBAAgB,EAAEC,QAAQ,CAAE,CAACE,IAAI,CAAE,EAAG,CAAC,IAAI,SAAS;;EAE/E;EACA,MAAMC,iBAAiB,GAAGf,mBAAmB,CAAEa,GAAG,CAAE;;EAEpD;EACA,IAAK,CAAEE,iBAAiB,EAAG;IAC1B,MAAM,IAAIC,KAAK,CAAE,oFAAqF,CAAC;EACxG;;EAEA;EACA,MAAMC,WAAW,GAAGF,iBAAiB,CAAC,CAAC;EACvC,MAAMG,eAAe,GAAG,IAAIpB,kBAAkB,CAAC,CAAC;EAChD,OAAO,IAAIC,YAAY,CAAE;IAAES,UAAU;IAAES,WAAW;IAAEC;EAAgB,CAAE,CAAC;AACxE,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,4BAA4B,GAAG,SAAAA,CAAUX,UAAU,EAAEY,oBAAoB,GAAG,KAAK,EAAG;EACzF,MAAMH,WAAW,GAAGG,oBAAoB,GAAG/B,+BAA+B,CAAC,CAAC,GAAGO,0CAA0C,CAAC,CAAC;EAC3H,MAAMsB,eAAe,GAAG,IAAIrB,0BAA0B,CAAC,CAAC;EACxD,OAAO,IAAIE,YAAY,CAAE;IAAES,UAAU;IAAES,WAAW;IAAEC;EAAgB,CAAE,CAAC;AACxE,CAAC;AAED,SACCX,oBAAoB,EACpBY,4BAA4B","ignoreList":[]}

package/build/parsedPaper/assess/cornerstone/assessmentListFactories.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"assessmentListFactories.js","names":["constructSEOAssessments","constructReadabilityAssessments","constructRelatedKeyphraseAssessments"],"sources":["../../../../src/parsedPaper/assess/cornerstone/assessmentListFactories.js"],"sourcesContent":["/**\n * Factory functions for creating lists of assessments for cornerstone content.\n *\n * To be used in creating the different kinds of assessors.\n */\n\n/**\n * Creates a new list of SEO assessments.\n *\n * @returns {module:parsedPaper/assess.Assessment[]} The list of SEO assessments.\n *\n * @private\n * @memberOf module:parsedPaper/assess\n */\nconst constructSEOAssessments = () => [\n\t// Needs to be populated by fancy new assessments that work on the tree representation of the text.\n];\n\n/**\n * Creates a new list of readability assessments.\n *\n * @returns {module:parsedPaper/assess.Assessment[]} The list of readability assessments.\n *\n * @private\n * @memberOf module:parsedPaper/assess\n */\nconst constructReadabilityAssessments = () => [\n\t// Needs to be populated by fancy new assessments that work on the tree representation of the text.\n];\n\n/**\n * Creates a new list of SEO assessments for related keyphrases.\n *\n * @returns {module:parsedPaper/assess.Assessment[]} The list of SEO assessments.\n *\n * @private\n * @memberOf module:parsedPaper/assess\n */\nconst constructRelatedKeyphraseAssessments = () => [\n\t// Needs to be populated by fancy new assessments that work on the tree representation of the text.\n];\n\nexport {\n\tconstructSEOAssessments,\n\tconstructReadabilityAssessments,\n\tconstructRelatedKeyphraseAssessments,\n};\n"],"mappings":"AAAA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMA,uBAAuB,GAAGA,CAAA,KAAM;EACrC;AAAA,CACA;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,+BAA+B,GAAGA,CAAA,KAAM;EAC7C;AAAA,CACA;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,oCAAoC,GAAGA,CAAA,KAAM;EAClD;AAAA,CACA;AAED,SACCF,uBAAuB,EACvBC,+BAA+B,EAC/BC,oCAAoC","ignoreList":[]}

package/build/parsedPaper/assess/cornerstone/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","names":["cornerstoneAssessmentListFactories"],"sources":["../../../../src/parsedPaper/assess/cornerstone/index.js"],"sourcesContent":["import * as cornerstoneAssessmentListFactories from \"./assessmentListFactories\";\n\nexport {\n\tcornerstoneAssessmentListFactories,\n};\n"],"mappings":"AAAA,OAAO,KAAKA,kCAAkC;AAE9C,SACCA,kCAAkC","ignoreList":[]}

package/build/parsedPaper/assess/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","names":["TreeAssessor","ScoreAggregators","Assessments","assessorFactories","cornerstoneAssessmentListFactories"],"sources":["../../../src/parsedPaper/assess/index.js"],"sourcesContent":["import TreeAssessor from \"./TreeAssessor\";\nimport * as ScoreAggregators from \"../../scoring/scoreAggregators\";\nimport * as Assessments from \"./assessments\";\nimport * as assessorFactories from \"./assessorFactories\";\nimport { cornerstoneAssessmentListFactories } from \"./cornerstone\";\n\n/**\n * Contains the logic to assess a tree representation of a text.\n *\n * @module tree/assess\n *\n * @see module:parsedPaper/structure\n */\nexport {\n\tTreeAssessor,\n\tScoreAggregators,\n\tAssessments,\n\tassessorFactories,\n\tcornerstoneAssessmentListFactories,\n};\n"],"mappings":"AAAA,OAAOA,YAAY;AACnB,OAAO,KAAKC,gBAAgB;AAC5B,OAAO,KAAKC,WAAW;AACvB,OAAO,KAAKC,iBAAiB;AAC7B,SAASC,kCAAkC;;AAE3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SACCJ,YAAY,EACZC,gBAAgB,EAChBC,WAAW,EACXC,iBAAiB,EACjBC,kCAAkC","ignoreList":[]}

package/build/parsedPaper/build/PaperParser.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"PaperParser.js","names":["ParsedPaper","forEach","PaperParser","constructor","treeBuilder","_parsedPaper","_treeBuilder","_metaDataModifiers","parse","paper","setTree","getText","setMetaData","constructMetaData","metaData","Object","assign","runMetaDataModifiers","registerMetaDataModifier","modifierName","modifierFunction","modifiedMetaData","previousMetaData","modifierError","console","warn","message"],"sources":["../../../src/parsedPaper/build/PaperParser.js"],"sourcesContent":["import ParsedPaper from \"../ParsedPaper\";\nimport { forEach } from \"lodash\";\n\n/**\n * A class responsible for pre-processing the Paper, returning a ParsedPaper.\n *\n * @module parsedPaper\n *\n * @see module:parsedPaper/builder\n * @see module:parsedPaper/structure\n */\nclass PaperParser {\n\t/**\n\t * Constructs a PaperParser class.\n\t *\n\t * @param {Function} treeBuilder A function that receives text and returns a tree.\n\t *\n\t * @constructor\n\t */\n\tconstructor( treeBuilder ) {\n\t\tthis._parsedPaper = new ParsedPaper();\n\t\tthis._treeBuilder = treeBuilder;\n\n\t\tthis._metaDataModifiers = {};\n\t}\n\n\t/**\n\t * Processes a Paper resulting in a ParsedPaper.\n\t *\n\t * @param {Paper} paper The Paper to parse.\n\t *\n\t * @returns {ParsedPaper} A parsedPaper instance.\n\t */\n\tparse( paper ) {\n\t\t// Build tree and set it to the ParsedPaper.\n\t\tthis._parsedPaper.setTree(\n\t\t\tthis._treeBuilder( paper.getText() )\n\t\t);\n\n\t\t// Build metaData and set it to the ParsedPaper.\n\t\tthis._parsedPaper.setMetaData(\n\t\t\tthis.constructMetaData( paper )\n\t\t);\n\n\t\treturn this._parsedPaper;\n\t}\n\n\t/**\n\t * Constructs the metaData from the Paper.\n\t *\n\t * @param {Paper} paper The paper to construct the metaData from.\n\t *\n\t * @returns {Object} The metaData.\n\t */\n\tconstructMetaData( paper ) {\n\t\tlet metaData = {};\n\n\t\t// Map things to metaData.\n\n\t\t// Run additional modifiers;\n\t\tmetaData = Object.assign( {}, this.runMetaDataModifiers( metaData, paper ) );\n\n\t\treturn metaData;\n\t}\n\n\t/**\n\t * Sets a metaData modifying function behind a function name on the internal metaDataModifiers object.\n\t *\n\t * @param {string}   modifierName       The name of the to be registered function.\n\t * @param {Function} modifierFunction   The function that modifies the metaData. Should accept a metaData object\n\t * \t\t\t\t\t\t\t\t\t    and optionally the paper.\n\t * @returns {void}\n\t */\n\tregisterMetaDataModifier( modifierName, modifierFunction ) {\n\t\t/*\n\t\t * The metaDataModifier should accept the metaData and return the altered metaData.\n\t\t */\n\t\tthis._metaDataModifiers[ modifierName ] = modifierFunction;\n\t}\n\n\t/**\n\t * Runs all registered metaDataModifiers.\n\t * If one of the functions errors, it is skipped and its metaData changes are discarded.\n\t *\n\t * @param {Object} metaData The initial state of the metaData, that should be modified.\n\t * @param {Paper}  paper    The paper.\n\t *\n\t * @returns {Object} A modified metaData object.\n\t */\n\trunMetaDataModifiers( metaData, paper ) {\n\t\tlet modifiedMetaData = metaData;\n\t\tforEach( this._metaDataModifiers, ( modifierFunction, modifierName ) => {\n\t\t\ttry {\n\t\t\t\tconst previousMetaData = Object.assign( {}, modifiedMetaData );\n\t\t\t\tmodifiedMetaData = modifierFunction( previousMetaData, paper );\n\t\t\t} catch ( modifierError ) {\n\t\t\t\tconsole.warn( `An error with message \"${ modifierError.message}\" occurred in metaData modifier ` +\n\t\t\t\t`function called ${ modifierName }. Skipping that function...` );\n\t\t\t}\n\t\t} );\n\t\treturn modifiedMetaData;\n\t}\n}\n\nexport default PaperParser;\n"],"mappings":"AAAA,OAAOA,WAAW;AAClB,SAASC,OAAO,QAAQ,QAAQ;;AAEhC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,WAAW,CAAC;EACjB;AACD;AACA;AACA;AACA;AACA;AACA;EACCC,WAAWA,CAAEC,WAAW,EAAG;IAC1B,IAAI,CAACC,YAAY,GAAG,IAAIL,WAAW,CAAC,CAAC;IACrC,IAAI,CAACM,YAAY,GAAGF,WAAW;IAE/B,IAAI,CAACG,kBAAkB,GAAG,CAAC,CAAC;EAC7B;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;EACCC,KAAKA,CAAEC,KAAK,EAAG;IACd;IACA,IAAI,CAACJ,YAAY,CAACK,OAAO,CACxB,IAAI,CAACJ,YAAY,CAAEG,KAAK,CAACE,OAAO,CAAC,CAAE,CACpC,CAAC;;IAED;IACA,IAAI,CAACN,YAAY,CAACO,WAAW,CAC5B,IAAI,CAACC,iBAAiB,CAAEJ,KAAM,CAC/B,CAAC;IAED,OAAO,IAAI,CAACJ,YAAY;EACzB;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;EACCQ,iBAAiBA,CAAEJ,KAAK,EAAG;IAC1B,IAAIK,QAAQ,GAAG,CAAC,CAAC;;IAEjB;;IAEA;IACAA,QAAQ,GAAGC,MAAM,CAACC,MAAM,CAAE,CAAC,CAAC,EAAE,IAAI,CAACC,oBAAoB,CAAEH,QAAQ,EAAEL,KAAM,CAAE,CAAC;IAE5E,OAAOK,QAAQ;EAChB;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;AACA;EACCI,wBAAwBA,CAAEC,YAAY,EAAEC,gBAAgB,EAAG;IAC1D;AACF;AACA;IACE,IAAI,CAACb,kBAAkB,CAAEY,YAAY,CAAE,GAAGC,gBAAgB;EAC3D;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACCH,oBAAoBA,CAAEH,QAAQ,EAAEL,KAAK,EAAG;IACvC,IAAIY,gBAAgB,GAAGP,QAAQ;IAC/Bb,OAAO,CAAE,IAAI,CAACM,kBAAkB,EAAE,CAAEa,gBAAgB,EAAED,YAAY,KAAM;MACvE,IAAI;QACH,MAAMG,gBAAgB,GAAGP,MAAM,CAACC,MAAM,CAAE,CAAC,CAAC,EAAEK,gBAAiB,CAAC;QAC9DA,gBAAgB,GAAGD,gBAAgB,CAAEE,gBAAgB,EAAEb,KAAM,CAAC;MAC/D,CAAC,CAAC,OAAQc,aAAa,EAAG;QACzBC,OAAO,CAACC,IAAI,CAAE,0BAA2BF,aAAa,CAACG,OAAO,kCAAkC,GAChG,mBAAoBP,YAAY,6BAA+B,CAAC;MACjE;IACD,CAAE,CAAC;IACH,OAAOE,gBAAgB;EACxB;AACD;AAEA,eAAenB,WAAW","ignoreList":[]}

package/build/parsedPaper/build/linguisticParsing/Sentence.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"Sentence.js","names":["Sentence","constructor","text","startIndex","endIndex","words","setText","appendText","getText","setStartIndex","setEndIndex","getStartIndex","getEndIndex"],"sources":["../../../../src/parsedPaper/build/linguisticParsing/Sentence.js"],"sourcesContent":["/**\n * Represents a sentence in a text.\n */\nclass Sentence {\n\t/**\n\t * Represents a sentence within a text.\n\t *\n\t * @param {string} text     The text of this sentence.\n\t * @param {number} startIndex   The start index of this sentence.\n\t * @param {number} endIndex     The end index of this sentence.\n\t */\n\tconstructor( text, startIndex = 0, endIndex = 0 ) {\n\t\tthis.text = text;\n\t\tthis.words = [];\n\t\tthis.startIndex = startIndex;\n\t\tthis.endIndex = endIndex;\n\t}\n\n\t/**\n\t * Sets a text for this sentence.\n\t *\n\t * @param {string} text The text to be set for the sentence.\n\t *\n\t * @returns {void}\n\t */\n\tsetText( text ) {\n\t\tthis.text = text;\n\t}\n\n\t/**\n\t * Appends text to this sentence.\n\t *\n\t * @param {string} text The text to be added to the sentence.\n\t *\n\t * @returns {void}\n\t */\n\tappendText( text ) {\n\t\tthis.text += text;\n\t}\n\n\t/**\n\t * Returns the text of this sentence.\n\t *\n\t * @returns {string} The text of this senence.\n\t */\n\tgetText() {\n\t\treturn this.text;\n\t}\n\n\t/**\n\t * Sets the start index of this sentence.\n\t *\n\t * @param {number} startIndex The start index of this sentence.\n\t * @returns {void}\n\t */\n\tsetStartIndex( startIndex ) {\n\t\tthis.startIndex = startIndex;\n\t}\n\n\t/**\n\t * Sets the end index of this sentence.\n\t *\n\t * @param {number} endIndex The end index of this sentence.\n\t * @returns {void}\n\t */\n\tsetEndIndex( endIndex ) {\n\t\tthis.endIndex = endIndex;\n\t}\n\n\t/**\n\t * Returns the start index of this sentence.\n\t *\n\t * @returns {number} The start index of this sentence.\n\t */\n\tgetStartIndex() {\n\t\treturn this.startIndex;\n\t}\n\n\t/**\n\t * Returns the end index of this sentence.\n\t *\n\t * @returns {number} The end index of this sentence.\n\t */\n\tgetEndIndex() {\n\t\treturn this.endIndex;\n\t}\n}\n\nexport default Sentence;\n"],"mappings":"AAAA;AACA;AACA;AACA,MAAMA,QAAQ,CAAC;EACd;AACD;AACA;AACA;AACA;AACA;AACA;EACCC,WAAWA,CAAEC,IAAI,EAAEC,UAAU,GAAG,CAAC,EAAEC,QAAQ,GAAG,CAAC,EAAG;IACjD,IAAI,CAACF,IAAI,GAAGA,IAAI;IAChB,IAAI,CAACG,KAAK,GAAG,EAAE;IACf,IAAI,CAACF,UAAU,GAAGA,UAAU;IAC5B,IAAI,CAACC,QAAQ,GAAGA,QAAQ;EACzB;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;EACCE,OAAOA,CAAEJ,IAAI,EAAG;IACf,IAAI,CAACA,IAAI,GAAGA,IAAI;EACjB;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;EACCK,UAAUA,CAAEL,IAAI,EAAG;IAClB,IAAI,CAACA,IAAI,IAAIA,IAAI;EAClB;;EAEA;AACD;AACA;AACA;AACA;EACCM,OAAOA,CAAA,EAAG;IACT,OAAO,IAAI,CAACN,IAAI;EACjB;;EAEA;AACD;AACA;AACA;AACA;AACA;EACCO,aAAaA,CAAEN,UAAU,EAAG;IAC3B,IAAI,CAACA,UAAU,GAAGA,UAAU;EAC7B;;EAEA;AACD;AACA;AACA;AACA;AACA;EACCO,WAAWA,CAAEN,QAAQ,EAAG;IACvB,IAAI,CAACA,QAAQ,GAAGA,QAAQ;EACzB;;EAEA;AACD;AACA;AACA;AACA;EACCO,aAAaA,CAAA,EAAG;IACf,OAAO,IAAI,CAACR,UAAU;EACvB;;EAEA;AACD;AACA;AACA;AACA;EACCS,WAAWA,CAAA,EAAG;IACb,OAAO,IAAI,CAACR,QAAQ;EACrB;AACD;AAEA,eAAeJ,QAAQ","ignoreList":[]}

package/build/parsedPaper/build/linguisticParsing/SentenceTokenizer.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"SentenceTokenizer.js","names":["isNaN","isUndefined","core","normalize","normalizeQuotes","Sentence","fullStop","sentenceDelimiters","fullStopRegex","RegExp","sentenceDelimiterRegex","sentenceRegex","blockStartRegex","blockEndRegex","whiteSpaceStartRegex","whiteSpaceEndRegex","SentenceTokenizer","isNumber","character","parseInt","isQuotation","isPunctuation","removeDuplicateWhitespace","text","replace","isCapitalLetter","toLocaleLowerCase","getNextTwoCharacters","nextTokens","next","src","isValidSentenceBeginning","sentenceBeginning","isSentenceStart","token","type","createTokenizer","tokens","tokenizer","push","addRule","tokenize","onText","end","e","console","error","tokenizer2","determineIndices","sentences","currentIndex","sentence","startIndex","setStartIndex","endIndex","length","setEndIndex","trimWhiteSpaceAtStart","whiteSpaceLength","match","setText","getText","slice","getStartIndex","trimWhiteSpaceAtEnd","getEndIndex","trimWhiteSpaces","getSentencesFromTokens","tokenArray","tokenSentences","currentSentence","nextSentenceStart","forEach","i","hasNextSentence","nextCharacters","nextToken","secondToNextToken","appendText"],"sources":["../../../../src/parsedPaper/build/linguisticParsing/SentenceTokenizer.js"],"sourcesContent":["import { isNaN, isUndefined } from \"lodash\";\n\nimport core from \"tokenizer2/core\";\nimport { normalize as normalizeQuotes } from \"@axyseo/languageProcessing/helpers/sanitize/quotes\";\n\nimport Sentence from \"./Sentence\";\n\n// All characters that indicate a sentence delimiter.\nconst fullStop = \".\";\n// The \\u2026 character is an ellipsis\nconst sentenceDelimiters = \"?!;\\u2026\";\n\nconst fullStopRegex = new RegExp( \"^[\" + fullStop + \"]$\" );\nconst sentenceDelimiterRegex = new RegExp( \"^[\" + sentenceDelimiters + \"]$\" );\nconst sentenceRegex = new RegExp( \"^[^\" + fullStop + sentenceDelimiters + \"\\\\(\\\\)\\\\[\\\\]]+$\" );\n\nconst blockStartRegex = /^\\s*[[({]\\s*$/;\nconst blockEndRegex = /^\\s*[\\])}]\\s*$/;\n\nconst whiteSpaceStartRegex = /^\\s*/;\nconst whiteSpaceEndRegex = /\\s*$/;\n\n/**\n * Class for tokenizing a (html) text into sentences.\n */\nexport default class SentenceTokenizer {\n\t/**\n\t * Returns whether or not a certain character is a number.\n\t *\n\t * @param {string} character The character to check.\n\t * @returns {boolean} Whether or not the character is a capital letter.\n\t */\n\tisNumber( character ) {\n\t\treturn ! isNaN( parseInt( character, 10 ) );\n\t}\n\n\t/**\n\t * Returns whether or not a given character is quotation mark.\n\t *\n\t * @param {string} character The character to check.\n\t *\n\t * @returns {boolean} Whether or not the given character is a quotation mark.\n\t */\n\tisQuotation( character ) {\n\t\tcharacter = normalizeQuotes( character );\n\n\t\treturn \"'\" === character ||\n\t\t\t\"\\\"\" === character;\n\t}\n\n\t/**\n\t * Returns whether or not a given character is a punctuation mark that can be at the beginning\n\t * of a sentence, like ¿ and ¡ used in Spanish.\n\t *\n\t * @param {string} character The character to check.\n\t *\n\t * @returns {boolean} Whether or not the given character is a punctuation mark.\n\t */\n\tisPunctuation( character ) {\n\t\treturn \"¿\" === character ||\n\t\t\t\"¡\" === character;\n\t}\n\n\t/**\n\t * Removes duplicate whitespace from a given text.\n\t *\n\t * @param {string} text The text with duplicate whitespace.\n\t * @returns {string} The text without duplicate whitespace.\n\t */\n\tremoveDuplicateWhitespace( text ) {\n\t\treturn text.replace( /\\s+/, \" \" );\n\t}\n\n\t/**\n\t * Returns whether or not a certain character is a capital letter.\n\t *\n\t * @param {string} character The character to check.\n\t *\n\t * @returns {boolean} Whether or not the character is a capital letter.\n\t */\n\tisCapitalLetter( character ) {\n\t\treturn character !== character.toLocaleLowerCase();\n\t}\n\n\t/**\n\t * Retrieves the next two characters from an array with the two next tokens.\n\t *\n\t * @param {Array} nextTokens The two next tokens. Might be undefined.\n\t *\n\t * @returns {string} The next two characters.\n\t */\n\tgetNextTwoCharacters( nextTokens ) {\n\t\tlet next = \"\";\n\n\t\tif ( ! isUndefined( nextTokens[ 0 ] ) ) {\n\t\t\tnext += nextTokens[ 0 ].src;\n\t\t}\n\n\t\tif ( ! isUndefined( nextTokens[ 1 ] ) ) {\n\t\t\tnext += nextTokens[ 1 ].src;\n\t\t}\n\n\t\tnext = this.removeDuplicateWhitespace( next );\n\n\t\treturn next;\n\t}\n\n\t/**\n\t * Checks if the sentenceBeginning beginning is a valid beginning.\n\t *\n\t * @param {string} sentenceBeginning The beginning of the sentence to validate.\n\t *\n\t * @returns {boolean} Returns true if it is a valid beginning, false if it is not.\n\t */\n\tisValidSentenceBeginning( sentenceBeginning ) {\n\t\treturn (\n\t\t\tthis.isCapitalLetter( sentenceBeginning ) ||\n\t\t\tthis.isNumber( sentenceBeginning ) ||\n\t\t\tthis.isQuotation( sentenceBeginning ) ||\n\t\t\tthis.isPunctuation( sentenceBeginning )\n\t\t);\n\t}\n\n\t/**\n\t * Checks if the token is a valid sentence ending.\n\t *\n\t * @param {Object} token The token to validate.\n\t *\n\t * @returns {boolean} Returns true if the token is valid ending, false if it is not.\n\t */\n\tisSentenceStart( token ) {\n\t\treturn ( ! isUndefined( token ) && (\n\t\t\t\"html-start\" === token.type ||\n\t\t\t\"html-end\" === token.type ||\n\t\t\t\"block-start\" === token.type\n\t\t) );\n\t}\n\n\t/**\n\t * Creates a tokenizer.\n\t *\n\t * @returns {Object} The tokenizer and the tokens.\n\t */\n\tcreateTokenizer() {\n\t\tconst tokens = [];\n\t\tconst tokenizer = core( function( token ) {\n\t\t\ttokens.push( token );\n\t\t} );\n\n\t\ttokenizer.addRule( fullStopRegex, \"full-stop\" );\n\t\ttokenizer.addRule( blockStartRegex, \"block-start\" );\n\t\ttokenizer.addRule( blockEndRegex, \"block-end\" );\n\t\ttokenizer.addRule( sentenceDelimiterRegex, \"sentence-delimiter\" );\n\t\ttokenizer.addRule( sentenceRegex, \"sentence\" );\n\n\t\treturn {\n\t\t\ttokenizer,\n\t\t\ttokens,\n\t\t};\n\t}\n\n\t/**\n\t * Tokenizes the given text using the given tokenizer.\n\t *\n\t * @param {Tokenizer} tokenizer The tokenizer to use.\n\t * @param {string}    text      The text to tokenize.\n\t *\n\t * @returns {void}\n\t */\n\ttokenize( tokenizer, text ) {\n\t\ttokenizer.onText( text );\n\n\t\ttry {\n\t\t\ttokenizer.end();\n\t\t} catch ( e ) {\n\t\t\tconsole.error( \"Tokenizer end error:\", e, e.tokenizer2 );\n\t\t}\n\t}\n\n\t/**\n\t * Determines the start and end indices of a set of sentences form a text.\n\t *\n\t * @param {Sentence[]} sentences A set of sentences for which to determine indices.\n\t *\n\t * @returns {void}\n\t */\n\tdetermineIndices( sentences ) {\n\t\tlet currentIndex = 0;\n\n\t\tfor ( const sentence of sentences ) {\n\t\t\tconst startIndex = currentIndex;\n\t\t\tsentence.setStartIndex( currentIndex );\n\t\t\tconst endIndex = startIndex + sentence.text.length - 1;\n\t\t\tsentence.setEndIndex( endIndex );\n\t\t\tcurrentIndex = endIndex + 1;\n\t\t}\n\t}\n\n\t/**\n\t * Trims the white space from the beginning of a sentence and adjusts the sentence start index accordingly.\n\t *\n\t * @param {Sentence} sentence The sentence for which to trim the white space at the start.\n\t *\n\t * @returns {void}\n\t */\n\ttrimWhiteSpaceAtStart( sentence ) {\n\t\tconst whiteSpaceLength = sentence.text.match( whiteSpaceStartRegex )[ 0 ].length;\n\t\tsentence.setText( sentence.getText().slice( whiteSpaceLength ) );\n\t\tsentence.setStartIndex( sentence.getStartIndex() + whiteSpaceLength  );\n\t}\n\n\t/**\n\t * Trims the white space from the end of a sentence and adjusts the sentence end index accordingly.\n\t *\n\t * @param {Sentence} sentence The sentence for which to trim the white space at the end.\n\t *\n\t * @returns {void}\n\t */\n\ttrimWhiteSpaceAtEnd( sentence ) {\n\t\tconst whiteSpaceLength = sentence.text.match( whiteSpaceEndRegex )[ 0 ].length;\n\t\tsentence.setText( sentence.getText().slice( 0, sentence.getText().length - whiteSpaceLength ) );\n\t\tsentence.setEndIndex( sentence.getEndIndex() - whiteSpaceLength );\n\t}\n\n\t/**\n\t * Trims white space from the beginning and end of sentences and adjusts the indices\n\t * of the sentence beginnings and ends accordingly.\n\t *\n\t * @param {Sentence[]} sentences The sentences for which to trim the whitespace.\n\t *\n\t * @returns {void}\n\t */\n\ttrimWhiteSpaces( sentences ) {\n\t\tfor ( const sentence of sentences ) {\n\t\t\tthis.trimWhiteSpaceAtStart( sentence );\n\t\t\tthis.trimWhiteSpaceAtEnd( sentence );\n\t\t}\n\t}\n\n\t/**\n\t * Returns an array of sentence objects for a given array of tokens; assumes that the text has already been split into blocks.\n\t *\n\t * @param {Object[]} tokenArray The tokens from the sentence tokenizer.\n\t *\n\t * @returns {Sentence[]} An array of sentence objects.\n\t */\n\tgetSentencesFromTokens( tokenArray ) {\n\t\tconst tokenSentences = [];\n\t\tlet currentSentence = new Sentence( \"\", 0, 0 ),\n\t\t\tnextSentenceStart;\n\n\t\ttokenArray.forEach( ( token, i ) => {\n\t\t\tlet hasNextSentence, nextCharacters;\n\t\t\tconst nextToken = tokenArray[ i + 1 ];\n\t\t\tconst secondToNextToken = tokenArray[ i + 2 ];\n\n\t\t\tswitch ( token.type ) {\n\t\t\t\tcase \"sentence\":\n\t\t\t\t\tcurrentSentence.appendText( token.src );\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase \"sentence-delimiter\":\n\t\t\t\t\tcurrentSentence.appendText( token.src );\n\t\t\t\t\tif ( ! isUndefined( nextToken ) && \"block-end\" !== nextToken.type && \"sentence-delimiter\" !== nextToken.type ) {\n\t\t\t\t\t\ttokenSentences.push( currentSentence );\n\t\t\t\t\t\tcurrentSentence = new Sentence( \"\" );\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase \"full-stop\":\n\t\t\t\t\tcurrentSentence.appendText( token.src );\n\n\t\t\t\t\tnextCharacters = this.getNextTwoCharacters( [ nextToken, secondToNextToken ] );\n\n\t\t\t\t\t// For a new sentence we need to check the next two characters.\n\t\t\t\t\thasNextSentence = nextCharacters.length >= 2;\n\t\t\t\t\tnextSentenceStart = hasNextSentence ? nextCharacters[ 1 ] : \"\";\n\t\t\t\t\t// If the next character is a number, never split. For example: IPv4-numbers.\n\t\t\t\t\tif ( hasNextSentence && this.isNumber( nextCharacters[ 0 ] ) ) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\t// Only split on sentence delimiters when the next sentence looks like the start of a sentence.\n\t\t\t\t\tif ( ( hasNextSentence && this.isValidSentenceBeginning( nextSentenceStart ) ) || this.isSentenceStart( nextToken ) ) {\n\t\t\t\t\t\ttokenSentences.push( currentSentence );\n\t\t\t\t\t\tcurrentSentence = new Sentence( \"\" );\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase \"block-start\":\n\t\t\t\t\tcurrentSentence.appendText( token.src );\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase \"block-end\":\n\t\t\t\t\tcurrentSentence.appendText( token.src );\n\t\t\t\t\tnextCharacters = this.getNextTwoCharacters( [ nextToken, secondToNextToken ] );\n\n\t\t\t\t\t// For a new sentence we need to check the next two characters.\n\t\t\t\t\thasNextSentence = nextCharacters.length >= 2;\n\t\t\t\t\tnextSentenceStart = hasNextSentence ? nextCharacters[ 0 ] : \"\";\n\t\t\t\t\t// If the next character is a number, never split. For example: IPv4-numbers.\n\t\t\t\t\tif ( hasNextSentence && this.isNumber( nextCharacters[ 0 ] ) ) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\n\t\t\t\t\tif ( ( hasNextSentence && this.isValidSentenceBeginning( nextSentenceStart ) ) || this.isSentenceStart( nextToken ) ) {\n\t\t\t\t\t\ttokenSentences.push( currentSentence );\n\t\t\t\t\t\tcurrentSentence = new Sentence( \"\" );\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t} );\n\n\t\tif ( currentSentence.getText()  !== \"\"  ) {\n\t\t\ttokenSentences.push( currentSentence );\n\t\t}\n\n\t\tthis.determineIndices( tokenSentences );\n\n\t\tthis.trimWhiteSpaces( tokenSentences );\n\n\t\treturn tokenSentences;\n\t}\n}\n"],"mappings":"AAAA,SAASA,KAAK,EAAEC,WAAW,QAAQ,QAAQ;AAE3C,OAAOC,IAAI,MAAM,iBAAiB;AAClC,SAASC,SAAS,IAAIC,eAAe;AAErC,OAAOC,QAAQ;;AAEf;AACA,MAAMC,QAAQ,GAAG,GAAG;AACpB;AACA,MAAMC,kBAAkB,GAAG,WAAW;AAEtC,MAAMC,aAAa,GAAG,IAAIC,MAAM,CAAE,IAAI,GAAGH,QAAQ,GAAG,IAAK,CAAC;AAC1D,MAAMI,sBAAsB,GAAG,IAAID,MAAM,CAAE,IAAI,GAAGF,kBAAkB,GAAG,IAAK,CAAC;AAC7E,MAAMI,aAAa,GAAG,IAAIF,MAAM,CAAE,KAAK,GAAGH,QAAQ,GAAGC,kBAAkB,GAAG,iBAAkB,CAAC;AAE7F,MAAMK,eAAe,GAAG,eAAe;AACvC,MAAMC,aAAa,GAAG,gBAAgB;AAEtC,MAAMC,oBAAoB,GAAG,MAAM;AACnC,MAAMC,kBAAkB,GAAG,MAAM;;AAEjC;AACA;AACA;AACA,eAAe,MAAMC,iBAAiB,CAAC;EACtC;AACD;AACA;AACA;AACA;AACA;EACCC,QAAQA,CAAEC,SAAS,EAAG;IACrB,OAAO,CAAElB,KAAK,CAAEmB,QAAQ,CAAED,SAAS,EAAE,EAAG,CAAE,CAAC;EAC5C;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;EACCE,WAAWA,CAAEF,SAAS,EAAG;IACxBA,SAAS,GAAGd,eAAe,CAAEc,SAAU,CAAC;IAExC,OAAO,GAAG,KAAKA,SAAS,IACvB,IAAI,KAAKA,SAAS;EACpB;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;AACA;EACCG,aAAaA,CAAEH,SAAS,EAAG;IAC1B,OAAO,GAAG,KAAKA,SAAS,IACvB,GAAG,KAAKA,SAAS;EACnB;;EAEA;AACD;AACA;AACA;AACA;AACA;EACCI,yBAAyBA,CAAEC,IAAI,EAAG;IACjC,OAAOA,IAAI,CAACC,OAAO,CAAE,KAAK,EAAE,GAAI,CAAC;EAClC;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;EACCC,eAAeA,CAAEP,SAAS,EAAG;IAC5B,OAAOA,SAAS,KAAKA,SAAS,CAACQ,iBAAiB,CAAC,CAAC;EACnD;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;EACCC,oBAAoBA,CAAEC,UAAU,EAAG;IAClC,IAAIC,IAAI,GAAG,EAAE;IAEb,IAAK,CAAE5B,WAAW,CAAE2B,UAAU,CAAE,CAAC,CAAG,CAAC,EAAG;MACvCC,IAAI,IAAID,UAAU,CAAE,CAAC,CAAE,CAACE,GAAG;IAC5B;IAEA,IAAK,CAAE7B,WAAW,CAAE2B,UAAU,CAAE,CAAC,CAAG,CAAC,EAAG;MACvCC,IAAI,IAAID,UAAU,CAAE,CAAC,CAAE,CAACE,GAAG;IAC5B;IAEAD,IAAI,GAAG,IAAI,CAACP,yBAAyB,CAAEO,IAAK,CAAC;IAE7C,OAAOA,IAAI;EACZ;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;EACCE,wBAAwBA,CAAEC,iBAAiB,EAAG;IAC7C,OACC,IAAI,CAACP,eAAe,CAAEO,iBAAkB,CAAC,IACzC,IAAI,CAACf,QAAQ,CAAEe,iBAAkB,CAAC,IAClC,IAAI,CAACZ,WAAW,CAAEY,iBAAkB,CAAC,IACrC,IAAI,CAACX,aAAa,CAAEW,iBAAkB,CAAC;EAEzC;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;EACCC,eAAeA,CAAEC,KAAK,EAAG;IACxB,OAAS,CAAEjC,WAAW,CAAEiC,KAAM,CAAC,KAC9B,YAAY,KAAKA,KAAK,CAACC,IAAI,IAC3B,UAAU,KAAKD,KAAK,CAACC,IAAI,IACzB,aAAa,KAAKD,KAAK,CAACC,IAAI,CAC5B;EACF;;EAEA;AACD;AACA;AACA;AACA;EACCC,eAAeA,CAAA,EAAG;IACjB,MAAMC,MAAM,GAAG,EAAE;IACjB,MAAMC,SAAS,GAAGpC,IAAI,CAAE,UAAUgC,KAAK,EAAG;MACzCG,MAAM,CAACE,IAAI,CAAEL,KAAM,CAAC;IACrB,CAAE,CAAC;IAEHI,SAAS,CAACE,OAAO,CAAEhC,aAAa,EAAE,WAAY,CAAC;IAC/C8B,SAAS,CAACE,OAAO,CAAE5B,eAAe,EAAE,aAAc,CAAC;IACnD0B,SAAS,CAACE,OAAO,CAAE3B,aAAa,EAAE,WAAY,CAAC;IAC/CyB,SAAS,CAACE,OAAO,CAAE9B,sBAAsB,EAAE,oBAAqB,CAAC;IACjE4B,SAAS,CAACE,OAAO,CAAE7B,aAAa,EAAE,UAAW,CAAC;IAE9C,OAAO;MACN2B,SAAS;MACTD;IACD,CAAC;EACF;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;AACA;EACCI,QAAQA,CAAEH,SAAS,EAAEf,IAAI,EAAG;IAC3Be,SAAS,CAACI,MAAM,CAAEnB,IAAK,CAAC;IAExB,IAAI;MACHe,SAAS,CAACK,GAAG,CAAC,CAAC;IAChB,CAAC,CAAC,OAAQC,CAAC,EAAG;MACbC,OAAO,CAACC,KAAK,CAAE,sBAAsB,EAAEF,CAAC,EAAEA,CAAC,CAACG,UAAW,CAAC;IACzD;EACD;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;EACCC,gBAAgBA,CAAEC,SAAS,EAAG;IAC7B,IAAIC,YAAY,GAAG,CAAC;IAEpB,KAAM,MAAMC,QAAQ,IAAIF,SAAS,EAAG;MACnC,MAAMG,UAAU,GAAGF,YAAY;MAC/BC,QAAQ,CAACE,aAAa,CAAEH,YAAa,CAAC;MACtC,MAAMI,QAAQ,GAAGF,UAAU,GAAGD,QAAQ,CAAC5B,IAAI,CAACgC,MAAM,GAAG,CAAC;MACtDJ,QAAQ,CAACK,WAAW,CAAEF,QAAS,CAAC;MAChCJ,YAAY,GAAGI,QAAQ,GAAG,CAAC;IAC5B;EACD;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;EACCG,qBAAqBA,CAAEN,QAAQ,EAAG;IACjC,MAAMO,gBAAgB,GAAGP,QAAQ,CAAC5B,IAAI,CAACoC,KAAK,CAAE7C,oBAAqB,CAAC,CAAE,CAAC,CAAE,CAACyC,MAAM;IAChFJ,QAAQ,CAACS,OAAO,CAAET,QAAQ,CAACU,OAAO,CAAC,CAAC,CAACC,KAAK,CAAEJ,gBAAiB,CAAE,CAAC;IAChEP,QAAQ,CAACE,aAAa,CAAEF,QAAQ,CAACY,aAAa,CAAC,CAAC,GAAGL,gBAAkB,CAAC;EACvE;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;EACCM,mBAAmBA,CAAEb,QAAQ,EAAG;IAC/B,MAAMO,gBAAgB,GAAGP,QAAQ,CAAC5B,IAAI,CAACoC,KAAK,CAAE5C,kBAAmB,CAAC,CAAE,CAAC,CAAE,CAACwC,MAAM;IAC9EJ,QAAQ,CAACS,OAAO,CAAET,QAAQ,CAACU,OAAO,CAAC,CAAC,CAACC,KAAK,CAAE,CAAC,EAAEX,QAAQ,CAACU,OAAO,CAAC,CAAC,CAACN,MAAM,GAAGG,gBAAiB,CAAE,CAAC;IAC/FP,QAAQ,CAACK,WAAW,CAAEL,QAAQ,CAACc,WAAW,CAAC,CAAC,GAAGP,gBAAiB,CAAC;EAClE;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;AACA;EACCQ,eAAeA,CAAEjB,SAAS,EAAG;IAC5B,KAAM,MAAME,QAAQ,IAAIF,SAAS,EAAG;MACnC,IAAI,CAACQ,qBAAqB,CAAEN,QAAS,CAAC;MACtC,IAAI,CAACa,mBAAmB,CAAEb,QAAS,CAAC;IACrC;EACD;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;EACCgB,sBAAsBA,CAAEC,UAAU,EAAG;IACpC,MAAMC,cAAc,GAAG,EAAE;IACzB,IAAIC,eAAe,GAAG,IAAIjE,QAAQ,CAAE,EAAE,EAAE,CAAC,EAAE,CAAE,CAAC;MAC7CkE,iBAAiB;IAElBH,UAAU,CAACI,OAAO,CAAE,CAAEtC,KAAK,EAAEuC,CAAC,KAAM;MACnC,IAAIC,eAAe,EAAEC,cAAc;MACnC,MAAMC,SAAS,GAAGR,UAAU,CAAEK,CAAC,GAAG,CAAC,CAAE;MACrC,MAAMI,iBAAiB,GAAGT,UAAU,CAAEK,CAAC,GAAG,CAAC,CAAE;MAE7C,QAASvC,KAAK,CAACC,IAAI;QAClB,KAAK,UAAU;UACdmC,eAAe,CAACQ,UAAU,CAAE5C,KAAK,CAACJ,GAAI,CAAC;UACvC;QAED,KAAK,oBAAoB;UACxBwC,eAAe,CAACQ,UAAU,CAAE5C,KAAK,CAACJ,GAAI,CAAC;UACvC,IAAK,CAAE7B,WAAW,CAAE2E,SAAU,CAAC,IAAI,WAAW,KAAKA,SAAS,CAACzC,IAAI,IAAI,oBAAoB,KAAKyC,SAAS,CAACzC,IAAI,EAAG;YAC9GkC,cAAc,CAAC9B,IAAI,CAAE+B,eAAgB,CAAC;YACtCA,eAAe,GAAG,IAAIjE,QAAQ,CAAE,EAAG,CAAC;UACrC;UACA;QAED,KAAK,WAAW;UACfiE,eAAe,CAACQ,UAAU,CAAE5C,KAAK,CAACJ,GAAI,CAAC;UAEvC6C,cAAc,GAAG,IAAI,CAAChD,oBAAoB,CAAE,CAAEiD,SAAS,EAAEC,iBAAiB,CAAG,CAAC;;UAE9E;UACAH,eAAe,GAAGC,cAAc,CAACpB,MAAM,IAAI,CAAC;UAC5CgB,iBAAiB,GAAGG,eAAe,GAAGC,cAAc,CAAE,CAAC,CAAE,GAAG,EAAE;UAC9D;UACA,IAAKD,eAAe,IAAI,IAAI,CAACzD,QAAQ,CAAE0D,cAAc,CAAE,CAAC,CAAG,CAAC,EAAG;YAC9D;UACD;UACA;UACA,IAAOD,eAAe,IAAI,IAAI,CAAC3C,wBAAwB,CAAEwC,iBAAkB,CAAC,IAAM,IAAI,CAACtC,eAAe,CAAE2C,SAAU,CAAC,EAAG;YACrHP,cAAc,CAAC9B,IAAI,CAAE+B,eAAgB,CAAC;YACtCA,eAAe,GAAG,IAAIjE,QAAQ,CAAE,EAAG,CAAC;UACrC;UACA;QAED,KAAK,aAAa;UACjBiE,eAAe,CAACQ,UAAU,CAAE5C,KAAK,CAACJ,GAAI,CAAC;UACvC;QAED,KAAK,WAAW;UACfwC,eAAe,CAACQ,UAAU,CAAE5C,KAAK,CAACJ,GAAI,CAAC;UACvC6C,cAAc,GAAG,IAAI,CAAChD,oBAAoB,CAAE,CAAEiD,SAAS,EAAEC,iBAAiB,CAAG,CAAC;;UAE9E;UACAH,eAAe,GAAGC,cAAc,CAACpB,MAAM,IAAI,CAAC;UAC5CgB,iBAAiB,GAAGG,eAAe,GAAGC,cAAc,CAAE,CAAC,CAAE,GAAG,EAAE;UAC9D;UACA,IAAKD,eAAe,IAAI,IAAI,CAACzD,QAAQ,CAAE0D,cAAc,CAAE,CAAC,CAAG,CAAC,EAAG;YAC9D;UACD;UAEA,IAAOD,eAAe,IAAI,IAAI,CAAC3C,wBAAwB,CAAEwC,iBAAkB,CAAC,IAAM,IAAI,CAACtC,eAAe,CAAE2C,SAAU,CAAC,EAAG;YACrHP,cAAc,CAAC9B,IAAI,CAAE+B,eAAgB,CAAC;YACtCA,eAAe,GAAG,IAAIjE,QAAQ,CAAE,EAAG,CAAC;UACrC;UACA;MACF;IACD,CAAE,CAAC;IAEH,IAAKiE,eAAe,CAACT,OAAO,CAAC,CAAC,KAAM,EAAE,EAAI;MACzCQ,cAAc,CAAC9B,IAAI,CAAE+B,eAAgB,CAAC;IACvC;IAEA,IAAI,CAACtB,gBAAgB,CAAEqB,cAAe,CAAC;IAEvC,IAAI,CAACH,eAAe,CAAEG,cAAe,CAAC;IAEtC,OAAOA,cAAc;EACtB;AACD","ignoreList":[]}

package/build/parsedPaper/build/linguisticParsing/parseText.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"parseText.js","names":["SentenceTokenizer","parseTextIntoSentences","text","sentenceTokenizer","tokenizer","tokens","createTokenizer","tokenize","getSentencesFromTokens"],"sources":["../../../../src/parsedPaper/build/linguisticParsing/parseText.js"],"sourcesContent":["import SentenceTokenizer from \"./SentenceTokenizer\";\n\n/**\n * Parses a text into sentences.\n *\n * @param {string} text The text to parse.\n *\n * @returns {string[]} An array of sentence objects.\n */\nconst parseTextIntoSentences = function( text ) {\n\tconst  sentenceTokenizer = new SentenceTokenizer();\n\tconst { tokenizer, tokens } = sentenceTokenizer.createTokenizer();\n\n\tsentenceTokenizer.tokenize( tokenizer, text );\n\treturn sentenceTokenizer.getSentencesFromTokens( tokens );\n};\n\nexport {\n\tparseTextIntoSentences,\n};\n"],"mappings":"AAAA,OAAOA,iBAAiB;;AAExB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,sBAAsB,GAAG,SAAAA,CAAUC,IAAI,EAAG;EAC/C,MAAOC,iBAAiB,GAAG,IAAIH,iBAAiB,CAAC,CAAC;EAClD,MAAM;IAAEI,SAAS;IAAEC;EAAO,CAAC,GAAGF,iBAAiB,CAACG,eAAe,CAAC,CAAC;EAEjEH,iBAAiB,CAACI,QAAQ,CAAEH,SAAS,EAAEF,IAAK,CAAC;EAC7C,OAAOC,iBAAiB,CAACK,sBAAsB,CAAEH,MAAO,CAAC;AAC1D,CAAC;AAED,SACCJ,sBAAsB","ignoreList":[]}

package/build/parsedPaper/build/tree/TreeBuilder.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"TreeBuilder.js","names":["buildTree","TreeBuilder","constructor","_buildFunctions","html","build","bind","register","sourceText","options","language","buildFunction"],"sources":["../../../../src/parsedPaper/build/tree/TreeBuilder.js"],"sourcesContent":["import buildTree from \"./html/buildTree\";\n\n/**\n * Builds a tree representation of a source text.\n *\n * Currently supported languages:\n *  - HTML (`\"html\"`)\n *\n * @memberOf module:parsedPaper/builder\n */\nclass TreeBuilder {\n\t/**\n\t * Creates a new TreeBuilder.\n\t */\n\tconstructor() {\n\t\t/**\n\t\t * A registry holding the parse function to be called\n\t\t * for each supported formatting language.\n\t\t *\n\t\t * @type {Object<string,Function>}\n\t\t * @private\n\t\t */\n\t\tthis._buildFunctions = {\n\t\t\thtml: buildTree,\n\t\t};\n\n\t\tthis.build = this.build.bind( this );\n\t\tthis.register = this.register.bind( this );\n\t}\n\n\t/**\n\t * Parses the given source text to a tree representation.\n\t *\n\t * Chooses the right parser depending on the given formatting language in which the text has been written (defaults to HTML).\n\t *\n\t * @param {string} sourceText                The source text that needs to be parsed to a tree representation.\n\t * @param {Object} [options]                 Parse options.\n\t * @param {string} [options.language=\"html\"] The formatting language in which the source text has been written, e.g. `\"html\"` for HTML.\n\t *\n\t * @returns {module:parsedPaper/structure.Node} The tree representation as parsed from the source text.\n\t */\n\tbuild( sourceText, options = { language: \"html\" } ) {\n\t\treturn this._buildFunctions[ options.language ]( sourceText );\n\t}\n\n\t/**\n\t * Registers a build function for the given formatting language.\n\t *\n\t * Call this method if you want to add support for another formatting language.\n\t *\n\t * @example\n\t *   // Create a new build function.\n\t *   const myBuilder = sourceText => {\n\t *       const node = new Paragraph();\n\t *       node.textContainer.appendText( sourceText );\n\t *       return node;\n\t *   };\n\t *\n\t *   // Register the build function for the language \"my-language\".\n\t *   treeBuilder.register( \"my-language\", myBuilder );\n\t *\n\t *   // Build the tree using the registered builder.\n\t *   const tree = treeBuilder.build( \"some input\", { language: \"my-language\" } );\n\t *\n\t * @param {string}                                                            language      The language to register.\n\t * @param {function( sourceText: string ): module:parsedPaper/structure.Node} buildFunction The build function for the given language.\n\t *\n\t * @returns {void}\n\t */\n\tregister( language, buildFunction ) {\n\t\tthis._buildFunctions[ language ] = buildFunction;\n\t}\n}\n\nexport default TreeBuilder;\n"],"mappings":"AAAA,OAAOA,SAAS;;AAEhB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,WAAW,CAAC;EACjB;AACD;AACA;EACCC,WAAWA,CAAA,EAAG;IACb;AACF;AACA;AACA;AACA;AACA;AACA;IACE,IAAI,CAACC,eAAe,GAAG;MACtBC,IAAI,EAAEJ;IACP,CAAC;IAED,IAAI,CAACK,KAAK,GAAG,IAAI,CAACA,KAAK,CAACC,IAAI,CAAE,IAAK,CAAC;IACpC,IAAI,CAACC,QAAQ,GAAG,IAAI,CAACA,QAAQ,CAACD,IAAI,CAAE,IAAK,CAAC;EAC3C;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACCD,KAAKA,CAAEG,UAAU,EAAEC,OAAO,GAAG;IAAEC,QAAQ,EAAE;EAAO,CAAC,EAAG;IACnD,OAAO,IAAI,CAACP,eAAe,CAAEM,OAAO,CAACC,QAAQ,CAAE,CAAEF,UAAW,CAAC;EAC9D;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACCD,QAAQA,CAAEG,QAAQ,EAAEC,aAAa,EAAG;IACnC,IAAI,CAACR,eAAe,CAAEO,QAAQ,CAAE,GAAGC,aAAa;EACjD;AACD;AAEA,eAAeV,WAAW","ignoreList":[]}

package/build/parsedPaper/build/tree/cleanup/calculateTextIndices.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"calculateTextIndices.js","names":["pullAll","ignoredHtmlElements","elementsThatCanBeClosed","currentElement","openElements","filter","el","endTag","sourceCodeLocation","endOffset","startOffset","closeElements","elementsToClose","currentOffset","sort","a","b","forEach","elementToClose","textEndIndex","endTagLength","handleIgnoredContent","element","textStartIndex","end","start","startTag","computeCommentStartEndTextIndices","computeElementStartTextIndex","startTagLength","calculateTextIndices","node","textContainer","formatting","length","type","push","includes"],"sources":["../../../../../src/parsedPaper/build/tree/cleanup/calculateTextIndices.js"],"sourcesContent":["import { pullAll } from \"lodash\";\n\nimport { ignoredHtmlElements } from \"../html/htmlConstants\";\n\n/**\n * Gathers all elements that can be closed given the position of the current element in the source code.\n *\n * Elements that can be closed are all elements that are opened before this element, but in which this element is\n * not nested.\n * E.g.\n * ```html\n * <strong>Hello</strong><em>World<b>!!!</b></em>`\n * ```\n * with `<b>!!!</b>` as the current element,\n * means that the `<strong>` needs to be closed, but `<em>` **not**.\n *\n * @param {module:parsedPaper/structure.FormattingElement} currentElement The current element.\n * @param {module:parsedPaper/structure.FormattingElement[]} openElements The elements that are currently open.\n *\n * @returns {module:parsedPaper/structure.FormattingElement[]} The elements that can be closed.\n */\nconst elementsThatCanBeClosed = function( currentElement, openElements ) {\n\treturn openElements.filter( el => {\n\t\tconst endTag = el.sourceCodeLocation.endTag;\n\t\treturn endTag.endOffset <= currentElement.sourceCodeLocation.startOffset;\n\t} );\n};\n\n/**\n * Closes the elements that can be closed given the position of the current element within the source code.\n *\n * This does two things:\n *  1. The closed element's text end index is calculated based on the current offset.\n *  2. The closed element's end tag lengths are counted towards the current offset, to make sure that the computed position\n * of the formatting elements are still correct.\n *\n * @param {module:parsedPaper/structure.FormattingElement[]} elementsToClose The list of open elements that need to be closed\n * @param {number} currentOffset                                      The current offset when parsing the formatting elements\n *\n * @returns {number} The updated current offset\n *\n * @private\n */\nconst closeElements = function( elementsToClose, currentOffset ) {\n\t// Sort, so we close all elements in the right order.\n\telementsToClose.sort( ( a, b ) => a.sourceCodeLocation.endTag.endOffset - b.sourceCodeLocation.endTag.endOffset );\n\n\telementsToClose.forEach( elementToClose => {\n\t\tconst endTag = elementToClose.sourceCodeLocation.endTag;\n\t\t// Set the end position as seen in the text.\n\t\telementToClose.textEndIndex = endTag.startOffset - currentOffset;\n\t\t/*\n\t\t  Add the end tag length of the to be closed element to the total offset.\n\t\t */\n\t\tconst endTagLength = endTag.endOffset - endTag.startOffset;\n\t\tcurrentOffset += endTagLength;\n\t} );\n\n\treturn currentOffset;\n};\n\n/**\n * Adds the content length of the given element (the part between the tags) to the current offset\n * and adds the content to the element as a parameter.\n *\n * @param {module:parsedPaper/structure.FormattingElement} element The element of which to add the content length.\n * @param {number} currentOffset                            The current offset to which to add the length to.\n *\n * @returns {number} The updated current offset\n */\nconst handleIgnoredContent = function( element, currentOffset ) {\n\t// Has 0 length in text, so end = start.\n\telement.textEndIndex = element.textStartIndex;\n\n\t// Update current offset.\n\tconst end = element.sourceCodeLocation.endTag ? element.sourceCodeLocation.endTag.startOffset : element.sourceCodeLocation.endOffset;\n\tconst start = element.sourceCodeLocation.startTag ? element.sourceCodeLocation.startTag.endOffset : element.sourceCodeLocation.startOffset;\n\n\tcurrentOffset += end - start;\n\n\treturn currentOffset;\n};\n\n\n/**\n * Sets the start and end text positions of a comment.\n *\n * @param {module:parsedPaper/structure.FormattingElement}\telement\t\t\tThe formatting element to assign start and end text positions to.\n * @param {int}\t\t\t\t\t\t\t\t\t\t\t\tcurrentOffset\tA sum of all characters in the source code that don't get rendered\n * \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t(e.g., tags, comments).\n *\n * @returns {number} The length of the comment.\n *\n * @private\n */\nconst computeCommentStartEndTextIndices = function( element, currentOffset ) {\n\telement.textStartIndex = element.sourceCodeLocation.startOffset - currentOffset;\n\telement.textEndIndex = element.textStartIndex;\n\n\treturn element.sourceCodeLocation.endOffset - element.sourceCodeLocation.startOffset;\n};\n\n/**\n * Sets the start and end text positions of one formatting element.\n *\n * @param {module:parsedPaper/structure.FormattingElement}\telement\t\t\tThe formatting element to assign start and end text positions to.\n * @param {int}\t\t\t\t\t\t\t\t\t\t\t\tcurrentOffset\tA sum of all characters in the source code that don't get rendered\n * \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t(e.g., tags, comments).\n *\n * @returns {int} The updated currentOffset.\n *\n * @private\n */\nconst computeElementStartTextIndex = function( element, currentOffset ) {\n\tconst startTag = element.sourceCodeLocation.startTag;\n\n\t// For example: \"<strong>\".length\n\tconst startTagLength = startTag.endOffset - startTag.startOffset;\n\n\tcurrentOffset += startTagLength;\n\n\t// Set start position of element in heading's / paragraph's text.\n\telement.textStartIndex = startTag.endOffset - currentOffset;\n\n\t/*\n\t  Elements that have no end tags (e.g., void element like <img/> or self-closing elements) can be closed immediately.\n\t  The text length of those elements will be automatically 0.\n\t */\n\tif ( ! element.sourceCodeLocation.endTag ) {\n\t\telement.textEndIndex = element.textStartIndex;\n\t}\n\n\treturn currentOffset;\n};\n\n/**\n * Sets the start and end position of the text in formatting elements of the given node.\n *\n * @param {module:parsedPaper/structure.LeafNode} node The node containing a TextContainer\n *\n * @returns {void}\n *\n * @private\n */\nconst calculateTextIndices = function( node ) {\n\tif ( ! node.textContainer.formatting || node.textContainer.formatting.length === 0 ) {\n\t\treturn;\n\t}\n\n\tconst openElements = [];\n\n\t/*\n\t  Keeps track of the current total size of the start and end tags (and the ignored content)\n\t  These should not be counted towards the start and end position of the elements in the text.\n\t */\n\tlet currentOffset = node.sourceCodeLocation.startTag ? node.sourceCodeLocation.startTag.endOffset : node.sourceCodeLocation.startOffset;\n\n\tnode.textContainer.formatting.forEach( element => {\n\t\t// Close elements that can be closed and remove them from the list of open elements.\n\t\tconst elementsToClose = elementsThatCanBeClosed( element, openElements );\n\t\tcurrentOffset = closeElements( elementsToClose, currentOffset );\n\t\tpullAll( openElements, elementsToClose );\n\n\t\t// Comments are self-closing formatting elements that are completely ignored in rendering.\n\t\tif ( element.type === \"#comment\" ) {\n\t\t\tcurrentOffset += computeCommentStartEndTextIndices( element, currentOffset );\n\t\t\treturn;\n\t\t}\n\n\t\tcurrentOffset = computeElementStartTextIndex( element, currentOffset );\n\n\t\t// If there is an endTag, the element should be closed in one of the next iterations of the loop.\n\t\tif (  element.sourceCodeLocation.endTag ) {\n\t\t\topenElements.push( element );\n\t\t}\n\n\t\t/*\n\t\t  If this element is an ignored element its contents are not in the text,\n\t\t  so its content should be added to the respective formatting element instead,\n\t\t  and the current offset should be updated.\n\t\t */\n\t\tif ( ignoredHtmlElements.includes( element.type ) ) {\n\t\t\tcurrentOffset = handleIgnoredContent( element, currentOffset );\n\t\t}\n\t} );\n\t// Close all remaining elements.\n\tcloseElements( openElements, currentOffset );\n};\n\nexport default calculateTextIndices;\n"],"mappings":"AAAA,SAASA,OAAO,QAAQ,QAAQ;AAEhC,SAASC,mBAAmB;;AAE5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,uBAAuB,GAAG,SAAAA,CAAUC,cAAc,EAAEC,YAAY,EAAG;EACxE,OAAOA,YAAY,CAACC,MAAM,CAAEC,EAAE,IAAI;IACjC,MAAMC,MAAM,GAAGD,EAAE,CAACE,kBAAkB,CAACD,MAAM;IAC3C,OAAOA,MAAM,CAACE,SAAS,IAAIN,cAAc,CAACK,kBAAkB,CAACE,WAAW;EACzE,CAAE,CAAC;AACJ,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,aAAa,GAAG,SAAAA,CAAUC,eAAe,EAAEC,aAAa,EAAG;EAChE;EACAD,eAAe,CAACE,IAAI,CAAE,CAAEC,CAAC,EAAEC,CAAC,KAAMD,CAAC,CAACP,kBAAkB,CAACD,MAAM,CAACE,SAAS,GAAGO,CAAC,CAACR,kBAAkB,CAACD,MAAM,CAACE,SAAU,CAAC;EAEjHG,eAAe,CAACK,OAAO,CAAEC,cAAc,IAAI;IAC1C,MAAMX,MAAM,GAAGW,cAAc,CAACV,kBAAkB,CAACD,MAAM;IACvD;IACAW,cAAc,CAACC,YAAY,GAAGZ,MAAM,CAACG,WAAW,GAAGG,aAAa;IAChE;AACF;AACA;IACE,MAAMO,YAAY,GAAGb,MAAM,CAACE,SAAS,GAAGF,MAAM,CAACG,WAAW;IAC1DG,aAAa,IAAIO,YAAY;EAC9B,CAAE,CAAC;EAEH,OAAOP,aAAa;AACrB,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMQ,oBAAoB,GAAG,SAAAA,CAAUC,OAAO,EAAET,aAAa,EAAG;EAC/D;EACAS,OAAO,CAACH,YAAY,GAAGG,OAAO,CAACC,cAAc;;EAE7C;EACA,MAAMC,GAAG,GAAGF,OAAO,CAACd,kBAAkB,CAACD,MAAM,GAAGe,OAAO,CAACd,kBAAkB,CAACD,MAAM,CAACG,WAAW,GAAGY,OAAO,CAACd,kBAAkB,CAACC,SAAS;EACpI,MAAMgB,KAAK,GAAGH,OAAO,CAACd,kBAAkB,CAACkB,QAAQ,GAAGJ,OAAO,CAACd,kBAAkB,CAACkB,QAAQ,CAACjB,SAAS,GAAGa,OAAO,CAACd,kBAAkB,CAACE,WAAW;EAE1IG,aAAa,IAAIW,GAAG,GAAGC,KAAK;EAE5B,OAAOZ,aAAa;AACrB,CAAC;;AAGD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMc,iCAAiC,GAAG,SAAAA,CAAUL,OAAO,EAAET,aAAa,EAAG;EAC5ES,OAAO,CAACC,cAAc,GAAGD,OAAO,CAACd,kBAAkB,CAACE,WAAW,GAAGG,aAAa;EAC/ES,OAAO,CAACH,YAAY,GAAGG,OAAO,CAACC,cAAc;EAE7C,OAAOD,OAAO,CAACd,kBAAkB,CAACC,SAAS,GAAGa,OAAO,CAACd,kBAAkB,CAACE,WAAW;AACrF,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMkB,4BAA4B,GAAG,SAAAA,CAAUN,OAAO,EAAET,aAAa,EAAG;EACvE,MAAMa,QAAQ,GAAGJ,OAAO,CAACd,kBAAkB,CAACkB,QAAQ;;EAEpD;EACA,MAAMG,cAAc,GAAGH,QAAQ,CAACjB,SAAS,GAAGiB,QAAQ,CAAChB,WAAW;EAEhEG,aAAa,IAAIgB,cAAc;;EAE/B;EACAP,OAAO,CAACC,cAAc,GAAGG,QAAQ,CAACjB,SAAS,GAAGI,aAAa;;EAE3D;AACD;AACA;AACA;EACC,IAAK,CAAES,OAAO,CAACd,kBAAkB,CAACD,MAAM,EAAG;IAC1Ce,OAAO,CAACH,YAAY,GAAGG,OAAO,CAACC,cAAc;EAC9C;EAEA,OAAOV,aAAa;AACrB,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMiB,oBAAoB,GAAG,SAAAA,CAAUC,IAAI,EAAG;EAC7C,IAAK,CAAEA,IAAI,CAACC,aAAa,CAACC,UAAU,IAAIF,IAAI,CAACC,aAAa,CAACC,UAAU,CAACC,MAAM,KAAK,CAAC,EAAG;IACpF;EACD;EAEA,MAAM9B,YAAY,GAAG,EAAE;;EAEvB;AACD;AACA;AACA;EACC,IAAIS,aAAa,GAAGkB,IAAI,CAACvB,kBAAkB,CAACkB,QAAQ,GAAGK,IAAI,CAACvB,kBAAkB,CAACkB,QAAQ,CAACjB,SAAS,GAAGsB,IAAI,CAACvB,kBAAkB,CAACE,WAAW;EAEvIqB,IAAI,CAACC,aAAa,CAACC,UAAU,CAAChB,OAAO,CAAEK,OAAO,IAAI;IACjD;IACA,MAAMV,eAAe,GAAGV,uBAAuB,CAAEoB,OAAO,EAAElB,YAAa,CAAC;IACxES,aAAa,GAAGF,aAAa,CAAEC,eAAe,EAAEC,aAAc,CAAC;IAC/Db,OAAO,CAAEI,YAAY,EAAEQ,eAAgB,CAAC;;IAExC;IACA,IAAKU,OAAO,CAACa,IAAI,KAAK,UAAU,EAAG;MAClCtB,aAAa,IAAIc,iCAAiC,CAAEL,OAAO,EAAET,aAAc,CAAC;MAC5E;IACD;IAEAA,aAAa,GAAGe,4BAA4B,CAAEN,OAAO,EAAET,aAAc,CAAC;;IAEtE;IACA,IAAMS,OAAO,CAACd,kBAAkB,CAACD,MAAM,EAAG;MACzCH,YAAY,CAACgC,IAAI,CAAEd,OAAQ,CAAC;IAC7B;;IAEA;AACF;AACA;AACA;AACA;IACE,IAAKrB,mBAAmB,CAACoC,QAAQ,CAAEf,OAAO,CAACa,IAAK,CAAC,EAAG;MACnDtB,aAAa,GAAGQ,oBAAoB,CAAEC,OAAO,EAAET,aAAc,CAAC;IAC/D;EACD,CAAE,CAAC;EACH;EACAF,aAAa,CAAEP,YAAY,EAAES,aAAc,CAAC;AAC7C,CAAC;AAED,eAAeiB,oBAAoB","ignoreList":[]}

package/build/parsedPaper/build/tree/cleanup/getElementContent.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"getElementContent.js","names":["getElementContent","element","html","location","start","startTag","endOffset","startOffset","end","endTag","slice"],"sources":["../../../../../src/parsedPaper/build/tree/cleanup/getElementContent.js"],"sourcesContent":["/**\n * Gets the content of an element (the part _between_ the opening and closing tag) from the HTML source code.\n *\n * @param {module:parsedPaper/structure.Node|module:parsedPaper/structure.FormattingElement} element The element to parse the contents of\n * @param {string} html                                                                The source code to parse the contents from\n *\n * @returns {string} The element's contents.\n *\n * @private\n */\nconst getElementContent = function( element, html ) {\n\tconst location = element.location;\n\tif ( location ) {\n\t\tconst start = location.startTag ? location.startTag.endOffset : location.startOffset;\n\t\tconst end = location.endTag ? location.endTag.startOffset : location.endOffset;\n\t\treturn html.slice( start, end );\n\t}\n\treturn \"\";\n};\n\nexport default getElementContent;\n"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMA,iBAAiB,GAAG,SAAAA,CAAUC,OAAO,EAAEC,IAAI,EAAG;EACnD,MAAMC,QAAQ,GAAGF,OAAO,CAACE,QAAQ;EACjC,IAAKA,QAAQ,EAAG;IACf,MAAMC,KAAK,GAAGD,QAAQ,CAACE,QAAQ,GAAGF,QAAQ,CAACE,QAAQ,CAACC,SAAS,GAAGH,QAAQ,CAACI,WAAW;IACpF,MAAMC,GAAG,GAAGL,QAAQ,CAACM,MAAM,GAAGN,QAAQ,CAACM,MAAM,CAACF,WAAW,GAAGJ,QAAQ,CAACG,SAAS;IAC9E,OAAOJ,IAAI,CAACQ,KAAK,CAAEN,KAAK,EAAEI,GAAI,CAAC;EAChC;EACA,OAAO,EAAE;AACV,CAAC;AAED,eAAeR,iBAAiB","ignoreList":[]}

package/build/parsedPaper/build/tree/cleanup/postParsing.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"postParsing.js","names":["LeafNode","calculateTextIndices","cleanUpNode","node","cleanUpTree","tree","map"],"sources":["../../../../../src/parsedPaper/build/tree/cleanup/postParsing.js"],"sourcesContent":["import { LeafNode } from \"../../../structure/tree\";\nimport calculateTextIndices from \"./calculateTextIndices\";\n\n/**\n * Cleans up a node in the tree.\n *\n * @param {module:parsedPaper/structure.Node} node The node that needs to be cleaned.\n *\n * @returns {module:parsedPaper/structure.Node} The cleaned up node.\n *\n * @private\n */\nconst cleanUpNode = function( node ) {\n\t// Clean up formatting elements in headings and paragraphs.\n\tif ( node instanceof LeafNode ) {\n\t\t// Start and end position in leaf node's (header's or paragraph's) text without formatting.\n\t\tcalculateTextIndices( node );\n\t}\n\treturn node;\n};\n\n/**\n * Cleans up the given tree after parsing of the HTML source code\n * by setting the start and end index of each formatting element in a leaf node's text.\n *\n * @param {module:parsedPaper/structure.Node} tree The tree structure to be cleaned.\n *\n * @returns {module:parsedPaper/structure.Node} The cleaned up tree.\n *\n * @private\n */\nconst cleanUpTree = function( tree ) {\n\ttree.map( node => cleanUpNode( node ) );\n\treturn tree;\n};\n\nexport default cleanUpTree;\n"],"mappings":"AAAA,SAASA,QAAQ;AACjB,OAAOC,oBAAoB;;AAE3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,WAAW,GAAG,SAAAA,CAAUC,IAAI,EAAG;EACpC;EACA,IAAKA,IAAI,YAAYH,QAAQ,EAAG;IAC/B;IACAC,oBAAoB,CAAEE,IAAK,CAAC;EAC7B;EACA,OAAOA,IAAI;AACZ,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,WAAW,GAAG,SAAAA,CAAUC,IAAI,EAAG;EACpCA,IAAI,CAACC,GAAG,CAAEH,IAAI,IAAID,WAAW,CAAEC,IAAK,CAAE,CAAC;EACvC,OAAOE,IAAI;AACZ,CAAC;AAED,eAAeD,WAAW","ignoreList":[]}

package/build/parsedPaper/build/tree/html/HTMLTreeConverter.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"HTMLTreeConverter.js","names":["FormattingElement","Heading","Paragraph","StructuredNode","List","ListItem","LeafNode","formattingElements","headings","ignoredHtmlElements","HTMLTreeConverter","convert","parse5Tree","root","_convert","parent","includes","nodeName","childNodes","node","child","_createChild","addChild","parse5Node","parentNode","nodeType","formatting","sourceCodeLocation","_parseAttributes","attrs","_addLeafNodeContent","_addFormatting","parseInt","value","_addText","contentToAdd","add","location","previousChild","_previousChild","leafNodeAncestor","_leafNodeAncestor","isImplicit","exec","text","appendText","addFormatting","parse5attributes","length","reduce","attributes","attribute","name","children","element"],"sources":["../../../../../src/parsedPaper/build/tree/html/HTMLTreeConverter.js"],"sourcesContent":["import { FormattingElement, Heading, Paragraph, StructuredNode, List, ListItem } from \"../../../structure/tree\";\nimport LeafNode from \"../../../structure/tree/nodes/LeafNode\";\nimport { formattingElements, headings, ignoredHtmlElements } from \"./htmlConstants\";\n\n/**\n * Converts a parse5 tree to a tree that can be analyzed.\n */\nclass HTMLTreeConverter {\n\t/**\n\t * Converts the parse5 tree to a Yoast tree.\n\t *\n\t * @param {Object} parse5Tree The parse5 tree to convert.\n\t *\n\t * @returns {module:parsedPaper/structure.Node} The converted tree.\n\t */\n\tconvert( parse5Tree ) {\n\t\tconst root = new StructuredNode( \"root\", null );\n\t\tthis._convert( parse5Tree, root );\n\t\treturn root;\n\t}\n\n\t/**\n\t * Converts the tree from a parse5 implementation to a Yoast tree.\n\t *\n\t * @param {Object}                                parse5Tree    The parse5 tree to convert.\n\t * @param {module:parsedPaper/structure.Node}     parent        The tree in progress.\n\t *\n\t * @returns {void}\n\t *\n\t * @private\n\t */\n\t_convert( parse5Tree, parent ) {\n\t\tif ( ignoredHtmlElements.includes( parse5Tree.nodeName ) ) {\n\t\t\treturn;\n\t\t}\n\t\tif ( parse5Tree.childNodes ) {\n\t\t\tfor ( const node of parse5Tree.childNodes ) {\n\t\t\t\tconst child = this._createChild( node, parent );\n\n\t\t\t\tif ( child ) {\n\t\t\t\t\tparent.addChild( child );\n\t\t\t\t\tthis._convert( node, child );\n\t\t\t\t} else {\n\t\t\t\t\tthis._convert( node, parent );\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t * Creates a new node for in the structured tree from the given parse 5 node.\n\t * Returns `null` if no node should be added to the tree.\n\t *\n\t * @param {Object}                            parse5Node The parse5 node that should be parsed.\n\t * @param {module:parsedPaper/structure.Node} parentNode The parent node.\n\t *\n\t * @returns {module:parsedPaper/structure.Node|null} The node that should be added to the tree, or `null` if no node should be added.\n\t *\n\t * @private\n\t */\n\t_createChild( parse5Node, parentNode ) {\n\t\tlet child = null;\n\n\t\tconst nodeType = parse5Node.nodeName;\n\n\t\tif ( ignoredHtmlElements.includes( nodeType ) ) {\n\t\t\tconst formatting = new FormattingElement( nodeType, parse5Node.sourceCodeLocation, this._parseAttributes( parse5Node.attrs ) );\n\t\t\tthis._addLeafNodeContent( formatting, this._addFormatting, parentNode, parse5Node.sourceCodeLocation );\n\t\t} else if ( nodeType === \"p\" ) {\n\t\t\t// Paragraph.\n\t\t\tchild = new Paragraph( parse5Node.sourceCodeLocation );\n\t\t} else if ( headings.includes( nodeType ) ) {\n\t\t\t// Heading.\n\t\t\tchild = new Heading( parseInt( nodeType[ 1 ], 10 ), parse5Node.sourceCodeLocation );\n\t\t} else if ( nodeType === \"li\" ) {\n\t\t\t// List item.\n\t\t\tchild = new ListItem( parse5Node.sourceCodeLocation );\n\t\t} else if ( nodeType === \"ol\" || nodeType === \"ul\" ) {\n\t\t\t// List node.\n\t\t\tchild = new List( nodeType === \"ol\", parse5Node.sourceCodeLocation );\n\t\t} else if ( nodeType === \"#text\" ) {\n\t\t\t// Text (outside of an ignored element).\n\t\t\tchild = this._addLeafNodeContent( parse5Node.value, this._addText, parentNode, parse5Node.sourceCodeLocation );\n\t\t} else if ( formattingElements.includes( nodeType ) ) {\n\t\t\t// Formatting element.\n\t\t\tconst formatting = new FormattingElement( nodeType, parse5Node.sourceCodeLocation, this._parseAttributes( parse5Node.attrs ) );\n\t\t\tchild = this._addLeafNodeContent( formatting, this._addFormatting, parentNode, parse5Node.sourceCodeLocation );\n\t\t} else {\n\t\t\t// Other element (`div`, `section`, `article`, etc.).\n\t\t\tchild = new StructuredNode( nodeType, parse5Node.sourceCodeLocation );\n\t\t}\n\n\t\treturn child;\n\t}\n\n\t/**\n\t * Adds leaf node content (text or formatting) to the tree according to a predefined strategy:\n\t *\n\t * If the content has a leaf node (paragraph, heading, list item) parent or ancestor: add it to this leaf node.\n\t * Else: wrap the content in an implicit paragraph, and add the content to it in such a way that runs\n\t * of phrasing content make up one implicit paragraph.\n\t *\n\t * @param {string|module:parsedPaper/structure.FormattingElement} contentToAdd The content to add.\n\t * @param {function}                                              add          A function that adds the content to the specified leaf node.\n\t * @param {module:parsedPaper/structure.Node}                     parent       The parent to which to try to add the content.\n\t * @param {Object}                                                location     The location of the content as parsed by parse5.\n\t *\n\t * @returns {null|module:parsedPaper/structure.Paragraph|null} The implicit paragraph, if one was created.\n\t *\n\t * @private\n\t */\n\t_addLeafNodeContent( contentToAdd, add, parent, location ) {\n\t\tif ( parent instanceof LeafNode ) {\n\t\t\tadd( parent, contentToAdd );\n\t\t\treturn null;\n\t\t}\n\n\t\tconst previousChild = this._previousChild( parent );\n\t\tconst leafNodeAncestor = this._leafNodeAncestor( parent );\n\n\t\tif ( leafNodeAncestor instanceof Paragraph ) {\n\t\t\tadd( leafNodeAncestor, contentToAdd );\n\t\t\treturn null;\n\t\t} else if ( previousChild && previousChild instanceof Paragraph && previousChild.isImplicit ) {\n\t\t\tadd( previousChild, contentToAdd );\n\t\t\treturn null;\n\t\t}\n\n\t\t// Don't create an implicit paragraph when the content is whitespace only.\n\t\tif ( /^\\s*$/.exec( contentToAdd ) ) {\n\t\t\treturn null;\n\t\t}\n\n\t\tconst child = new Paragraph( location, true );\n\t\tadd( child, contentToAdd );\n\t\treturn child;\n\t}\n\n\t/**\n\t * Add text to the parent leaf node.\n\t *\n\t * @param {module:parsedPaper/structure.LeafNode} parent The leaf node to which to add the text.\n\t * @param {string}                                text   The text to add to the node.\n\t *\n\t * @returns {void}\n\t *\n\t * @private\n\t */\n\t_addText( parent, text ) {\n\t\tparent.appendText( text );\n\t}\n\n\t/**\n\t * Add a formatting element to the parent leaf node.\n\t *\n\t * @param {module:parsedPaper/structure.LeafNode}          parent     The leaf node to which to add the formatting.\n\t * @param {module:parsedPaper/structure.FormattingElement} formatting The formatting element to add.\n\t *\n\t * @returns {void}\n\t *\n\t * @private\n\t */\n\t_addFormatting( parent, formatting ) {\n\t\tparent.addFormatting( formatting );\n\t}\n\n\t/**\n\t * Parses the HTML element attributes from parse5's format to a plain JS object.\n\t *\n\t * @example\n\t *\n\t * const attributes = _parseAttributes( { name: \"id\", value: \"an-id\" } ) // becomes { id: \"an-id\" }.\n\t *\n\t * @param {Array<{ name: string, value: string }>} parse5attributes The attributes as parsed by parse5.\n\t *\n\t * @returns {Object} The parsed attributes.\n\t *\n\t * @private\n\t */\n\t_parseAttributes( parse5attributes ) {\n\t\tif ( parse5attributes && parse5attributes.length > 0 ) {\n\t\t\treturn parse5attributes.reduce( ( attributes, attribute ) => {\n\t\t\t\tattributes[ attribute.name ] = attribute.value;\n\t\t\t\treturn attributes;\n\t\t\t}, {} );\n\t\t}\n\t\treturn null;\n\t}\n\n\t/**\n\t * Returns the last child of the given parent.\n\t *\n\t * @param {module:parsedPaper/structure.StructuredNode} parent The parent.\n\t *\n\t * @returns {module:parsedPaper/structure.Node} The parent's last child.\n\t *\n\t * @private\n\t */\n\t_previousChild( parent ) {\n\t\tif ( parent.children ) {\n\t\t\treturn parent.children[ parent.children.length - 1 ];\n\t\t}\n\t\treturn null;\n\t}\n\n\t/**\n\t * Try to find the leaf node ancestor of this node. Returns `null` if the node does not have one.\n\t *\n\t * @param {module:parsedPaper/structure.Node} element The node for which to find the leaf node ancestor.\n\t *\n\t * @returns {null|module:parsedPaper/structure.Node} The leaf node ancestor, if it has one, `null` if not.\n\t *\n\t * @private\n\t */\n\t_leafNodeAncestor( element ) {\n\t\tconst parent = element.parent;\n\n\t\tif ( ! parent ) {\n\t\t\treturn null;\n\t\t}\n\n\t\tif ( element instanceof LeafNode ) {\n\t\t\treturn parent;\n\t\t}\n\n\t\treturn this._leafNodeAncestor( parent );\n\t}\n}\n\nexport default HTMLTreeConverter;\n"],"mappings":"AAAA,SAASA,iBAAiB,EAAEC,OAAO,EAAEC,SAAS,EAAEC,cAAc,EAAEC,IAAI,EAAEC,QAAQ;AAC9E,OAAOC,QAAQ;AACf,SAASC,kBAAkB,EAAEC,QAAQ,EAAEC,mBAAmB;;AAE1D;AACA;AACA;AACA,MAAMC,iBAAiB,CAAC;EACvB;AACD;AACA;AACA;AACA;AACA;AACA;EACCC,OAAOA,CAAEC,UAAU,EAAG;IACrB,MAAMC,IAAI,GAAG,IAAIV,cAAc,CAAE,MAAM,EAAE,IAAK,CAAC;IAC/C,IAAI,CAACW,QAAQ,CAAEF,UAAU,EAAEC,IAAK,CAAC;IACjC,OAAOA,IAAI;EACZ;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACCC,QAAQA,CAAEF,UAAU,EAAEG,MAAM,EAAG;IAC9B,IAAKN,mBAAmB,CAACO,QAAQ,CAAEJ,UAAU,CAACK,QAAS,CAAC,EAAG;MAC1D;IACD;IACA,IAAKL,UAAU,CAACM,UAAU,EAAG;MAC5B,KAAM,MAAMC,IAAI,IAAIP,UAAU,CAACM,UAAU,EAAG;QAC3C,MAAME,KAAK,GAAG,IAAI,CAACC,YAAY,CAAEF,IAAI,EAAEJ,MAAO,CAAC;QAE/C,IAAKK,KAAK,EAAG;UACZL,MAAM,CAACO,QAAQ,CAAEF,KAAM,CAAC;UACxB,IAAI,CAACN,QAAQ,CAAEK,IAAI,EAAEC,KAAM,CAAC;QAC7B,CAAC,MAAM;UACN,IAAI,CAACN,QAAQ,CAAEK,IAAI,EAAEJ,MAAO,CAAC;QAC9B;MACD;IACD;EACD;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACCM,YAAYA,CAAEE,UAAU,EAAEC,UAAU,EAAG;IACtC,IAAIJ,KAAK,GAAG,IAAI;IAEhB,MAAMK,QAAQ,GAAGF,UAAU,CAACN,QAAQ;IAEpC,IAAKR,mBAAmB,CAACO,QAAQ,CAAES,QAAS,CAAC,EAAG;MAC/C,MAAMC,UAAU,GAAG,IAAI1B,iBAAiB,CAAEyB,QAAQ,EAAEF,UAAU,CAACI,kBAAkB,EAAE,IAAI,CAACC,gBAAgB,CAAEL,UAAU,CAACM,KAAM,CAAE,CAAC;MAC9H,IAAI,CAACC,mBAAmB,CAAEJ,UAAU,EAAE,IAAI,CAACK,cAAc,EAAEP,UAAU,EAAED,UAAU,CAACI,kBAAmB,CAAC;IACvG,CAAC,MAAM,IAAKF,QAAQ,KAAK,GAAG,EAAG;MAC9B;MACAL,KAAK,GAAG,IAAIlB,SAAS,CAAEqB,UAAU,CAACI,kBAAmB,CAAC;IACvD,CAAC,MAAM,IAAKnB,QAAQ,CAACQ,QAAQ,CAAES,QAAS,CAAC,EAAG;MAC3C;MACAL,KAAK,GAAG,IAAInB,OAAO,CAAE+B,QAAQ,CAAEP,QAAQ,CAAE,CAAC,CAAE,EAAE,EAAG,CAAC,EAAEF,UAAU,CAACI,kBAAmB,CAAC;IACpF,CAAC,MAAM,IAAKF,QAAQ,KAAK,IAAI,EAAG;MAC/B;MACAL,KAAK,GAAG,IAAIf,QAAQ,CAAEkB,UAAU,CAACI,kBAAmB,CAAC;IACtD,CAAC,MAAM,IAAKF,QAAQ,KAAK,IAAI,IAAIA,QAAQ,KAAK,IAAI,EAAG;MACpD;MACAL,KAAK,GAAG,IAAIhB,IAAI,CAAEqB,QAAQ,KAAK,IAAI,EAAEF,UAAU,CAACI,kBAAmB,CAAC;IACrE,CAAC,MAAM,IAAKF,QAAQ,KAAK,OAAO,EAAG;MAClC;MACAL,KAAK,GAAG,IAAI,CAACU,mBAAmB,CAAEP,UAAU,CAACU,KAAK,EAAE,IAAI,CAACC,QAAQ,EAAEV,UAAU,EAAED,UAAU,CAACI,kBAAmB,CAAC;IAC/G,CAAC,MAAM,IAAKpB,kBAAkB,CAACS,QAAQ,CAAES,QAAS,CAAC,EAAG;MACrD;MACA,MAAMC,UAAU,GAAG,IAAI1B,iBAAiB,CAAEyB,QAAQ,EAAEF,UAAU,CAACI,kBAAkB,EAAE,IAAI,CAACC,gBAAgB,CAAEL,UAAU,CAACM,KAAM,CAAE,CAAC;MAC9HT,KAAK,GAAG,IAAI,CAACU,mBAAmB,CAAEJ,UAAU,EAAE,IAAI,CAACK,cAAc,EAAEP,UAAU,EAAED,UAAU,CAACI,kBAAmB,CAAC;IAC/G,CAAC,MAAM;MACN;MACAP,KAAK,GAAG,IAAIjB,cAAc,CAAEsB,QAAQ,EAAEF,UAAU,CAACI,kBAAmB,CAAC;IACtE;IAEA,OAAOP,KAAK;EACb;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACCU,mBAAmBA,CAAEK,YAAY,EAAEC,GAAG,EAAErB,MAAM,EAAEsB,QAAQ,EAAG;IAC1D,IAAKtB,MAAM,YAAYT,QAAQ,EAAG;MACjC8B,GAAG,CAAErB,MAAM,EAAEoB,YAAa,CAAC;MAC3B,OAAO,IAAI;IACZ;IAEA,MAAMG,aAAa,GAAG,IAAI,CAACC,cAAc,CAAExB,MAAO,CAAC;IACnD,MAAMyB,gBAAgB,GAAG,IAAI,CAACC,iBAAiB,CAAE1B,MAAO,CAAC;IAEzD,IAAKyB,gBAAgB,YAAYtC,SAAS,EAAG;MAC5CkC,GAAG,CAAEI,gBAAgB,EAAEL,YAAa,CAAC;MACrC,OAAO,IAAI;IACZ,CAAC,MAAM,IAAKG,aAAa,IAAIA,aAAa,YAAYpC,SAAS,IAAIoC,aAAa,CAACI,UAAU,EAAG;MAC7FN,GAAG,CAAEE,aAAa,EAAEH,YAAa,CAAC;MAClC,OAAO,IAAI;IACZ;;IAEA;IACA,IAAK,OAAO,CAACQ,IAAI,CAAER,YAAa,CAAC,EAAG;MACnC,OAAO,IAAI;IACZ;IAEA,MAAMf,KAAK,GAAG,IAAIlB,SAAS,CAAEmC,QAAQ,EAAE,IAAK,CAAC;IAC7CD,GAAG,CAAEhB,KAAK,EAAEe,YAAa,CAAC;IAC1B,OAAOf,KAAK;EACb;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACCc,QAAQA,CAAEnB,MAAM,EAAE6B,IAAI,EAAG;IACxB7B,MAAM,CAAC8B,UAAU,CAAED,IAAK,CAAC;EAC1B;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACCb,cAAcA,CAAEhB,MAAM,EAAEW,UAAU,EAAG;IACpCX,MAAM,CAAC+B,aAAa,CAAEpB,UAAW,CAAC;EACnC;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACCE,gBAAgBA,CAAEmB,gBAAgB,EAAG;IACpC,IAAKA,gBAAgB,IAAIA,gBAAgB,CAACC,MAAM,GAAG,CAAC,EAAG;MACtD,OAAOD,gBAAgB,CAACE,MAAM,CAAE,CAAEC,UAAU,EAAEC,SAAS,KAAM;QAC5DD,UAAU,CAAEC,SAAS,CAACC,IAAI,CAAE,GAAGD,SAAS,CAAClB,KAAK;QAC9C,OAAOiB,UAAU;MAClB,CAAC,EAAE,CAAC,CAAE,CAAC;IACR;IACA,OAAO,IAAI;EACZ;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACCX,cAAcA,CAAExB,MAAM,EAAG;IACxB,IAAKA,MAAM,CAACsC,QAAQ,EAAG;MACtB,OAAOtC,MAAM,CAACsC,QAAQ,CAAEtC,MAAM,CAACsC,QAAQ,CAACL,MAAM,GAAG,CAAC,CAAE;IACrD;IACA,OAAO,IAAI;EACZ;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACCP,iBAAiBA,CAAEa,OAAO,EAAG;IAC5B,MAAMvC,MAAM,GAAGuC,OAAO,CAACvC,MAAM;IAE7B,IAAK,CAAEA,MAAM,EAAG;MACf,OAAO,IAAI;IACZ;IAEA,IAAKuC,OAAO,YAAYhD,QAAQ,EAAG;MAClC,OAAOS,MAAM;IACd;IAEA,OAAO,IAAI,CAAC0B,iBAAiB,CAAE1B,MAAO,CAAC;EACxC;AACD;AAEA,eAAeL,iBAAiB","ignoreList":[]}