axyseo 2.0.0-alpha.0.0.4 → 2.0.0-alpha.0.0.40

package/build/languageProcessing/helpers/transliterate/specialCharacterMappings.js.map

@@ -1 +1 @@
-{"version":3,"file":"specialCharacterMappings.js","names":["_lodash","require","_getWords","_interopRequireDefault","e","__esModule","default","getIndicesOfWords","text","indices","words","getWords","startSearchFrom","forEach","word","currentIndex","indexOf","push","length","getIndicesOfCharacter","characterToFind","i","arraysDifference","bigArray","subarray","filter","element","includes","arraysOverlap","firstArray","secondArray","combinations","collection","acc","xs","array","x","l","concat","slice","replaceCharactersByIndex","substitute","modifiedTextSplitByLetter","split","index","splice","join","replaceTurkishIs","indicesOfAllIs","sort","indicesOfIsInWordBeginnings","results","combinationsDottedI","oneCombinationDottedI","isEqual","indicesNotDottedI","combinationsDotlessI","oneCombinationDotlessI","indicesSmalli","combinationsDottedi","oneCombinationDottedi","oneCombinationDotlessi","textAlternations","result","toDottedI","toDotlessI","toDottedi","toDotlessi","replaceTurkishIsMemoized","exports","memoize"],"sources":["../../../../src/languageProcessing/helpers/transliterate/specialCharacterMappings.js"],"sourcesContent":["import { filter, includes, isEqual, memoize } from \"lodash\";\nimport getWords from \"../word/getWords\";\n\n/**\n * Gets positions of the first character of a word in the input text.\n *\n * @param {string} text The original text, for which the indices of word beginnings need to be determined.\n *\n * @returns {Array} indices The array of indices in the text at which words start.\n */\nfunction getIndicesOfWords( text ) {\n\tconst indices = [];\n\tconst words = getWords( text );\n\tlet startSearchFrom = 0;\n\n\twords.forEach( function( word ) {\n\t\tconst currentIndex = text.indexOf( word, startSearchFrom );\n\t\tindices.push( currentIndex );\n\t\tstartSearchFrom = currentIndex + word.length;\n\t} );\n\n\treturn indices;\n}\n\n\n/**\n * Gets indices of a specific character in the input text.\n *\n * @param {string} text             The original text, for which the indices of specific characters have to be determined.\n * @param {string} characterToFind  The character that needs to be found in the text.\n *\n * @returns {Array} indices The array of indices in the text at which the characterToFind occurs.\n */\nfunction getIndicesOfCharacter( text, characterToFind ) {\n\tconst indices = [];\n\n\tif ( text.indexOf( characterToFind ) > -1 ) {\n\t\tfor ( let i = 0; i < text.length; i++ ) {\n\t\t\tif ( text[ i ] === characterToFind ) {\n\t\t\t\tindices.push( i );\n\t\t\t}\n\t\t}\n\t}\n\n\treturn indices;\n}\n\n/**\n * Compares two arrays of which the second array is the sub-array of the first array.\n * Returns the array of elements of the first array which are not in the second array.\n *\n * @param {Array} bigArray The array with all elements.\n * @param {Array} subarray The array with some elements from the bigArray.\n *\n * @returns {Array} difference An array of all elements of bigArray which are not in subarray.\n */\nfunction arraysDifference( bigArray, subarray ) {\n\treturn filter( bigArray, function( element ) {\n\t\treturn ( ! includes( subarray, element ) );\n\t} );\n}\n\n/**\n * Compares two arrays and returns the array of elements that occur in both arrays.\n *\n * @param {Array} firstArray    The first array with elements to compare.\n * @param {Array} secondArray   The second array with elements to compare.\n *\n * @returns {Array} overlap An array of all elements of firstArray which are also in secondArray.\n */\nfunction arraysOverlap( firstArray, secondArray ) {\n\treturn filter( firstArray, function( element ) {\n\t\treturn ( includes( secondArray, element ) );\n\t} );\n}\n\n\n/**\n * Generates all possible combinations of the elements of an array (treated as unique).\n * https://gist.github.com/jpillora/4435759\n *\n * @param {Array} collection The array with elements that should be combined.\n *\n * @returns {Array} result An array of all possible combinations of elements of the original array.\n */\nfunction combinations( collection ) {\n\t/**\n\t * A recursive function that iterates through all elements of an array to produce its combinations.\n\t *\n\t * @param {Array} xs        The array to start accumulating with.\n\t * @param {Array} array     The array with elements that should be combined.\n\t *\n\t * @returns {Array} result An array of all possible combinations of elements of the original array.\n\t */\n\tfunction acc( xs, array ) {\n\t\tconst x = xs[ 0 ];\n\n\t\tif ( typeof x === \"undefined\" ) {\n\t\t\treturn array;\n\t\t}\n\n\t\tfor ( let i = 0, l = array.length; i < l; ++i ) {\n\t\t\tarray.push( array[ i ].concat( x ) );\n\t\t}\n\t\treturn acc( xs.slice( 1 ), array );\n\t}\n\treturn acc( collection, [ [ ] ] ).slice( 1 ).concat( [ [] ] );\n}\n\n\n/**\n * Replaces characters on specified indices in the input text.\n *\n * @param {string} text         The original text, for which the characters have to be substituted.\n * @param {Array} indices       The array of indices that have to be substituted.\n * @param {string} substitute   The character that is used to substitute in the text.\n *\n * @returns {string} result The string of the original text with the characters on specified indices are substituted with the substitute character.\n */\nfunction replaceCharactersByIndex( text, indices, substitute ) {\n\tconst modifiedTextSplitByLetter = text.split( \"\" );\n\n\tindices.forEach( function( index ) {\n\t\tmodifiedTextSplitByLetter.splice( index, 1, substitute );\n\t} );\n\n\treturn modifiedTextSplitByLetter.join( \"\" );\n}\n\n/**\n * Generates upper and lower case for Turkish strings that contain characters İ or ı, which appear to not be processed correctly by regexes.\n *\n * @param {string} text The text to build possible upper and lower case alternatives.\n *\n * @returns {Array} An array of strings that contains all possible upper and lower case alternatives of the original string\n */\nfunction replaceTurkishIs( text ) {\n\t// Get indices of all occurrences of İ, I, i, or ı.\n\tconst indicesOfAllIs = getIndicesOfCharacter( text, \"İ\" ).concat(\n\t\tgetIndicesOfCharacter( text, \"I\" ),\n\t\tgetIndicesOfCharacter( text, \"i\" ),\n\t\tgetIndicesOfCharacter( text, \"ı\" )\n\t);\n\tindicesOfAllIs.sort();\n\n\t// If there are no Is return the text\n\tif ( indicesOfAllIs.length === 0 ) {\n\t\treturn [ text ];\n\t}\n\tconst indicesOfIsInWordBeginnings = arraysOverlap( getIndicesOfWords( text ), indicesOfAllIs );\n\n\tconst results = [];\n\n\t// First round of creating combinations: assign which indices will be replaced by İ\n\tconst combinationsDottedI = combinations( indicesOfIsInWordBeginnings );\n\n\tcombinationsDottedI.forEach( function( oneCombinationDottedI ) {\n\t\t// If the combination is full array, just add it to results immediately without going through the rest of iterations.\n\t\tif ( isEqual( oneCombinationDottedI, indicesOfIsInWordBeginnings ) ) {\n\t\t\tresults.push( [ oneCombinationDottedI, [], [], [] ] );\n\t\t} else {\n\t\t\tconst indicesNotDottedI = arraysDifference( indicesOfIsInWordBeginnings, oneCombinationDottedI );\n\n\t\t\t// Second round of creating combinations: assign which indices will be replaced by I\n\t\t\tconst combinationsDotlessI = combinations( indicesNotDottedI );\n\t\t\tcombinationsDotlessI.forEach( function( oneCombinationDotlessI ) {\n\t\t\t\t// If the combination is full array, just add it to results immediately without going through the rest of iterations.\n\t\t\t\tif ( isEqual( oneCombinationDotlessI, indicesNotDottedI ) ) {\n\t\t\t\t\tresults.push( [ oneCombinationDottedI, oneCombinationDotlessI, [], [] ] );\n\t\t\t\t} else {\n\t\t\t\t\tconst indicesSmalli = arraysDifference( indicesNotDottedI, oneCombinationDotlessI );\n\n\t\t\t\t\t// Third round of creating combinations: assign which indices will be replaced by i\n\t\t\t\t\tconst combinationsDottedi = combinations( indicesSmalli );\n\n\t\t\t\t\tcombinationsDottedi.forEach( function( oneCombinationDottedi ) {\n\t\t\t\t\t\t// If the combination is full array, just add it to results immediately without going through the rest of iterations.\n\t\t\t\t\t\tif ( isEqual( oneCombinationDottedi, indicesSmalli ) ) {\n\t\t\t\t\t\t\tresults.push( [ oneCombinationDottedI, oneCombinationDotlessI, oneCombinationDottedi, [] ] );\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tconst oneCombinationDotlessi = arraysDifference( indicesSmalli, oneCombinationDottedi );\n\n\t\t\t\t\t\t\tresults.push( [ oneCombinationDottedI, oneCombinationDotlessI, oneCombinationDottedi, oneCombinationDotlessi ] );\n\t\t\t\t\t\t}\n\t\t\t\t\t} );\n\t\t\t\t}\n\t\t\t} );\n\t\t}\n\t} );\n\n\tconst textAlternations = [];\n\n\tresults.forEach( function( result ) {\n\t\tconst toDottedI = replaceCharactersByIndex( text, result[ 0 ], \"İ\" );\n\t\tconst toDotlessI = replaceCharactersByIndex( toDottedI, result[ 1 ], \"I\" );\n\t\tconst toDottedi = replaceCharactersByIndex( toDotlessI, result[ 2 ], \"i\" );\n\t\tconst toDotlessi = replaceCharactersByIndex( toDottedi, result[ 3 ], \"ı\" );\n\t\ttextAlternations.push( toDotlessi );\n\t} );\n\n\treturn textAlternations;\n}\n\nconst replaceTurkishIsMemoized = memoize( replaceTurkishIs );\n\nexport {\n\tgetIndicesOfWords,\n\tgetIndicesOfCharacter,\n\tarraysDifference,\n\tarraysOverlap,\n\tcombinations,\n\treplaceTurkishIs,\n\treplaceTurkishIsMemoized,\n};\n"],"mappings":";;;;;;;;;;;;AAAA,IAAAA,OAAA,GAAAC,OAAA;AACA,IAAAC,SAAA,GAAAC,sBAAA,CAAAF,OAAA;AAAwC,SAAAE,uBAAAC,CAAA,WAAAA,CAAA,IAAAA,CAAA,CAAAC,UAAA,GAAAD,CAAA,KAAAE,OAAA,EAAAF,CAAA;AAExC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASG,iBAAiBA,CAAEC,IAAI,EAAG;EAClC,MAAMC,OAAO,GAAG,EAAE;EAClB,MAAMC,KAAK,GAAG,IAAAC,iBAAQ,EAAEH,IAAK,CAAC;EAC9B,IAAII,eAAe,GAAG,CAAC;EAEvBF,KAAK,CAACG,OAAO,CAAE,UAAUC,IAAI,EAAG;IAC/B,MAAMC,YAAY,GAAGP,IAAI,CAACQ,OAAO,CAAEF,IAAI,EAAEF,eAAgB,CAAC;IAC1DH,OAAO,CAACQ,IAAI,CAAEF,YAAa,CAAC;IAC5BH,eAAe,GAAGG,YAAY,GAAGD,IAAI,CAACI,MAAM;EAC7C,CAAE,CAAC;EAEH,OAAOT,OAAO;AACf;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASU,qBAAqBA,CAAEX,IAAI,EAAEY,eAAe,EAAG;EACvD,MAAMX,OAAO,GAAG,EAAE;EAElB,IAAKD,IAAI,CAACQ,OAAO,CAAEI,eAAgB,CAAC,GAAG,CAAC,CAAC,EAAG;IAC3C,KAAM,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGb,IAAI,CAACU,MAAM,EAAEG,CAAC,EAAE,EAAG;MACvC,IAAKb,IAAI,CAAEa,CAAC,CAAE,KAAKD,eAAe,EAAG;QACpCX,OAAO,CAACQ,IAAI,CAAEI,CAAE,CAAC;MAClB;IACD;EACD;EAEA,OAAOZ,OAAO;AACf;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASa,gBAAgBA,CAAEC,QAAQ,EAAEC,QAAQ,EAAG;EAC/C,OAAO,IAAAC,cAAM,EAAEF,QAAQ,EAAE,UAAUG,OAAO,EAAG;IAC5C,OAAS,CAAE,IAAAC,gBAAQ,EAAEH,QAAQ,EAAEE,OAAQ,CAAC;EACzC,CAAE,CAAC;AACJ;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASE,aAAaA,CAAEC,UAAU,EAAEC,WAAW,EAAG;EACjD,OAAO,IAAAL,cAAM,EAAEI,UAAU,EAAE,UAAUH,OAAO,EAAG;IAC9C,OAAS,IAAAC,gBAAQ,EAAEG,WAAW,EAAEJ,OAAQ,CAAC;EAC1C,CAAE,CAAC;AACJ;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASK,YAAYA,CAAEC,UAAU,EAAG;EACnC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;EACC,SAASC,GAAGA,CAAEC,EAAE,EAAEC,KAAK,EAAG;IACzB,MAAMC,CAAC,GAAGF,EAAE,CAAE,CAAC,CAAE;IAEjB,IAAK,OAAOE,CAAC,KAAK,WAAW,EAAG;MAC/B,OAAOD,KAAK;IACb;IAEA,KAAM,IAAId,CAAC,GAAG,CAAC,EAAEgB,CAAC,GAAGF,KAAK,CAACjB,MAAM,EAAEG,CAAC,GAAGgB,CAAC,EAAE,EAAEhB,CAAC,EAAG;MAC/Cc,KAAK,CAAClB,IAAI,CAAEkB,KAAK,CAAEd,CAAC,CAAE,CAACiB,MAAM,CAAEF,CAAE,CAAE,CAAC;IACrC;IACA,OAAOH,GAAG,CAAEC,EAAE,CAACK,KAAK,CAAE,CAAE,CAAC,EAAEJ,KAAM,CAAC;EACnC;EACA,OAAOF,GAAG,CAAED,UAAU,EAAE,CAAE,EAAG,CAAG,CAAC,CAACO,KAAK,CAAE,CAAE,CAAC,CAACD,MAAM,CAAE,CAAE,EAAE,CAAG,CAAC;AAC9D;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASE,wBAAwBA,CAAEhC,IAAI,EAAEC,OAAO,EAAEgC,UAAU,EAAG;EAC9D,MAAMC,yBAAyB,GAAGlC,IAAI,CAACmC,KAAK,CAAE,EAAG,CAAC;EAElDlC,OAAO,CAACI,OAAO,CAAE,UAAU+B,KAAK,EAAG;IAClCF,yBAAyB,CAACG,MAAM,CAAED,KAAK,EAAE,CAAC,EAAEH,UAAW,CAAC;EACzD,CAAE,CAAC;EAEH,OAAOC,yBAAyB,CAACI,IAAI,CAAE,EAAG,CAAC;AAC5C;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,gBAAgBA,CAAEvC,IAAI,EAAG;EACjC;EACA,MAAMwC,cAAc,GAAG7B,qBAAqB,CAAEX,IAAI,EAAE,GAAI,CAAC,CAAC8B,MAAM,CAC/DnB,qBAAqB,CAAEX,IAAI,EAAE,GAAI,CAAC,EAClCW,qBAAqB,CAAEX,IAAI,EAAE,GAAI,CAAC,EAClCW,qBAAqB,CAAEX,IAAI,EAAE,GAAI,CAClC,CAAC;EACDwC,cAAc,CAACC,IAAI,CAAC,CAAC;;EAErB;EACA,IAAKD,cAAc,CAAC9B,MAAM,KAAK,CAAC,EAAG;IAClC,OAAO,CAAEV,IAAI,CAAE;EAChB;EACA,MAAM0C,2BAA2B,GAAGtB,aAAa,CAAErB,iBAAiB,CAAEC,IAAK,CAAC,EAAEwC,cAAe,CAAC;EAE9F,MAAMG,OAAO,GAAG,EAAE;;EAElB;EACA,MAAMC,mBAAmB,GAAGrB,YAAY,CAAEmB,2BAA4B,CAAC;EAEvEE,mBAAmB,CAACvC,OAAO,CAAE,UAAUwC,qBAAqB,EAAG;IAC9D;IACA,IAAK,IAAAC,eAAO,EAAED,qBAAqB,EAAEH,2BAA4B,CAAC,EAAG;MACpEC,OAAO,CAAClC,IAAI,CAAE,CAAEoC,qBAAqB,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAG,CAAC;IACtD,CAAC,MAAM;MACN,MAAME,iBAAiB,GAAGjC,gBAAgB,CAAE4B,2BAA2B,EAAEG,qBAAsB,CAAC;;MAEhG;MACA,MAAMG,oBAAoB,GAAGzB,YAAY,CAAEwB,iBAAkB,CAAC;MAC9DC,oBAAoB,CAAC3C,OAAO,CAAE,UAAU4C,sBAAsB,EAAG;QAChE;QACA,IAAK,IAAAH,eAAO,EAAEG,sBAAsB,EAAEF,iBAAkB,CAAC,EAAG;UAC3DJ,OAAO,CAAClC,IAAI,CAAE,CAAEoC,qBAAqB,EAAEI,sBAAsB,EAAE,EAAE,EAAE,EAAE,CAAG,CAAC;QAC1E,CAAC,MAAM;UACN,MAAMC,aAAa,GAAGpC,gBAAgB,CAAEiC,iBAAiB,EAAEE,sBAAuB,CAAC;;UAEnF;UACA,MAAME,mBAAmB,GAAG5B,YAAY,CAAE2B,aAAc,CAAC;UAEzDC,mBAAmB,CAAC9C,OAAO,CAAE,UAAU+C,qBAAqB,EAAG;YAC9D;YACA,IAAK,IAAAN,eAAO,EAAEM,qBAAqB,EAAEF,aAAc,CAAC,EAAG;cACtDP,OAAO,CAAClC,IAAI,CAAE,CAAEoC,qBAAqB,EAAEI,sBAAsB,EAAEG,qBAAqB,EAAE,EAAE,CAAG,CAAC;YAC7F,CAAC,MAAM;cACN,MAAMC,sBAAsB,GAAGvC,gBAAgB,CAAEoC,aAAa,EAAEE,qBAAsB,CAAC;cAEvFT,OAAO,CAAClC,IAAI,CAAE,CAAEoC,qBAAqB,EAAEI,sBAAsB,EAAEG,qBAAqB,EAAEC,sBAAsB,CAAG,CAAC;YACjH;UACD,CAAE,CAAC;QACJ;MACD,CAAE,CAAC;IACJ;EACD,CAAE,CAAC;EAEH,MAAMC,gBAAgB,GAAG,EAAE;EAE3BX,OAAO,CAACtC,OAAO,CAAE,UAAUkD,MAAM,EAAG;IACnC,MAAMC,SAAS,GAAGxB,wBAAwB,CAAEhC,IAAI,EAAEuD,MAAM,CAAE,CAAC,CAAE,EAAE,GAAI,CAAC;IACpE,MAAME,UAAU,GAAGzB,wBAAwB,CAAEwB,SAAS,EAAED,MAAM,CAAE,CAAC,CAAE,EAAE,GAAI,CAAC;IAC1E,MAAMG,SAAS,GAAG1B,wBAAwB,CAAEyB,UAAU,EAAEF,MAAM,CAAE,CAAC,CAAE,EAAE,GAAI,CAAC;IAC1E,MAAMI,UAAU,GAAG3B,wBAAwB,CAAE0B,SAAS,EAAEH,MAAM,CAAE,CAAC,CAAE,EAAE,GAAI,CAAC;IAC1ED,gBAAgB,CAAC7C,IAAI,CAAEkD,UAAW,CAAC;EACpC,CAAE,CAAC;EAEH,OAAOL,gBAAgB;AACxB;AAEA,MAAMM,wBAAwB,GAAAC,OAAA,CAAAD,wBAAA,GAAG,IAAAE,eAAO,EAAEvB,gBAAiB,CAAC","ignoreList":[]}
+{"version":3,"file":"specialCharacterMappings.js","names":["filter","includes","isEqual","memoize","getWords","getIndicesOfWords","text","indices","words","startSearchFrom","forEach","word","currentIndex","indexOf","push","length","getIndicesOfCharacter","characterToFind","i","arraysDifference","bigArray","subarray","element","arraysOverlap","firstArray","secondArray","combinations","collection","acc","xs","array","x","l","concat","slice","replaceCharactersByIndex","substitute","modifiedTextSplitByLetter","split","index","splice","join","replaceTurkishIs","indicesOfAllIs","sort","indicesOfIsInWordBeginnings","results","combinationsDottedI","oneCombinationDottedI","indicesNotDottedI","combinationsDotlessI","oneCombinationDotlessI","indicesSmalli","combinationsDottedi","oneCombinationDottedi","oneCombinationDotlessi","textAlternations","result","toDottedI","toDotlessI","toDottedi","toDotlessi","replaceTurkishIsMemoized"],"sources":["../../../../src/languageProcessing/helpers/transliterate/specialCharacterMappings.js"],"sourcesContent":["import { filter, includes, isEqual, memoize } from \"lodash\";\nimport getWords from \"../word/getWords\";\n\n/**\n * Gets positions of the first character of a word in the input text.\n *\n * @param {string} text The original text, for which the indices of word beginnings need to be determined.\n *\n * @returns {Array} indices The array of indices in the text at which words start.\n */\nfunction getIndicesOfWords( text ) {\n\tconst indices = [];\n\tconst words = getWords( text );\n\tlet startSearchFrom = 0;\n\n\twords.forEach( function( word ) {\n\t\tconst currentIndex = text.indexOf( word, startSearchFrom );\n\t\tindices.push( currentIndex );\n\t\tstartSearchFrom = currentIndex + word.length;\n\t} );\n\n\treturn indices;\n}\n\n\n/**\n * Gets indices of a specific character in the input text.\n *\n * @param {string} text             The original text, for which the indices of specific characters have to be determined.\n * @param {string} characterToFind  The character that needs to be found in the text.\n *\n * @returns {Array} indices The array of indices in the text at which the characterToFind occurs.\n */\nfunction getIndicesOfCharacter( text, characterToFind ) {\n\tconst indices = [];\n\n\tif ( text.indexOf( characterToFind ) > -1 ) {\n\t\tfor ( let i = 0; i < text.length; i++ ) {\n\t\t\tif ( text[ i ] === characterToFind ) {\n\t\t\t\tindices.push( i );\n\t\t\t}\n\t\t}\n\t}\n\n\treturn indices;\n}\n\n/**\n * Compares two arrays of which the second array is the sub-array of the first array.\n * Returns the array of elements of the first array which are not in the second array.\n *\n * @param {Array} bigArray The array with all elements.\n * @param {Array} subarray The array with some elements from the bigArray.\n *\n * @returns {Array} difference An array of all elements of bigArray which are not in subarray.\n */\nfunction arraysDifference( bigArray, subarray ) {\n\treturn filter( bigArray, function( element ) {\n\t\treturn ( ! includes( subarray, element ) );\n\t} );\n}\n\n/**\n * Compares two arrays and returns the array of elements that occur in both arrays.\n *\n * @param {Array} firstArray    The first array with elements to compare.\n * @param {Array} secondArray   The second array with elements to compare.\n *\n * @returns {Array} overlap An array of all elements of firstArray which are also in secondArray.\n */\nfunction arraysOverlap( firstArray, secondArray ) {\n\treturn filter( firstArray, function( element ) {\n\t\treturn ( includes( secondArray, element ) );\n\t} );\n}\n\n\n/**\n * Generates all possible combinations of the elements of an array (treated as unique).\n * https://gist.github.com/jpillora/4435759\n *\n * @param {Array} collection The array with elements that should be combined.\n *\n * @returns {Array} result An array of all possible combinations of elements of the original array.\n */\nfunction combinations( collection ) {\n\t/**\n\t * A recursive function that iterates through all elements of an array to produce its combinations.\n\t *\n\t * @param {Array} xs        The array to start accumulating with.\n\t * @param {Array} array     The array with elements that should be combined.\n\t *\n\t * @returns {Array} result An array of all possible combinations of elements of the original array.\n\t */\n\tfunction acc( xs, array ) {\n\t\tconst x = xs[ 0 ];\n\n\t\tif ( typeof x === \"undefined\" ) {\n\t\t\treturn array;\n\t\t}\n\n\t\tfor ( let i = 0, l = array.length; i < l; ++i ) {\n\t\t\tarray.push( array[ i ].concat( x ) );\n\t\t}\n\t\treturn acc( xs.slice( 1 ), array );\n\t}\n\treturn acc( collection, [ [ ] ] ).slice( 1 ).concat( [ [] ] );\n}\n\n\n/**\n * Replaces characters on specified indices in the input text.\n *\n * @param {string} text         The original text, for which the characters have to be substituted.\n * @param {Array} indices       The array of indices that have to be substituted.\n * @param {string} substitute   The character that is used to substitute in the text.\n *\n * @returns {string} result The string of the original text with the characters on specified indices are substituted with the substitute character.\n */\nfunction replaceCharactersByIndex( text, indices, substitute ) {\n\tconst modifiedTextSplitByLetter = text.split( \"\" );\n\n\tindices.forEach( function( index ) {\n\t\tmodifiedTextSplitByLetter.splice( index, 1, substitute );\n\t} );\n\n\treturn modifiedTextSplitByLetter.join( \"\" );\n}\n\n/**\n * Generates upper and lower case for Turkish strings that contain characters İ or ı, which appear to not be processed correctly by regexes.\n *\n * @param {string} text The text to build possible upper and lower case alternatives.\n *\n * @returns {Array} An array of strings that contains all possible upper and lower case alternatives of the original string\n */\nfunction replaceTurkishIs( text ) {\n\t// Get indices of all occurrences of İ, I, i, or ı.\n\tconst indicesOfAllIs = getIndicesOfCharacter( text, \"İ\" ).concat(\n\t\tgetIndicesOfCharacter( text, \"I\" ),\n\t\tgetIndicesOfCharacter( text, \"i\" ),\n\t\tgetIndicesOfCharacter( text, \"ı\" )\n\t);\n\tindicesOfAllIs.sort();\n\n\t// If there are no Is return the text\n\tif ( indicesOfAllIs.length === 0 ) {\n\t\treturn [ text ];\n\t}\n\tconst indicesOfIsInWordBeginnings = arraysOverlap( getIndicesOfWords( text ), indicesOfAllIs );\n\n\tconst results = [];\n\n\t// First round of creating combinations: assign which indices will be replaced by İ\n\tconst combinationsDottedI = combinations( indicesOfIsInWordBeginnings );\n\n\tcombinationsDottedI.forEach( function( oneCombinationDottedI ) {\n\t\t// If the combination is full array, just add it to results immediately without going through the rest of iterations.\n\t\tif ( isEqual( oneCombinationDottedI, indicesOfIsInWordBeginnings ) ) {\n\t\t\tresults.push( [ oneCombinationDottedI, [], [], [] ] );\n\t\t} else {\n\t\t\tconst indicesNotDottedI = arraysDifference( indicesOfIsInWordBeginnings, oneCombinationDottedI );\n\n\t\t\t// Second round of creating combinations: assign which indices will be replaced by I\n\t\t\tconst combinationsDotlessI = combinations( indicesNotDottedI );\n\t\t\tcombinationsDotlessI.forEach( function( oneCombinationDotlessI ) {\n\t\t\t\t// If the combination is full array, just add it to results immediately without going through the rest of iterations.\n\t\t\t\tif ( isEqual( oneCombinationDotlessI, indicesNotDottedI ) ) {\n\t\t\t\t\tresults.push( [ oneCombinationDottedI, oneCombinationDotlessI, [], [] ] );\n\t\t\t\t} else {\n\t\t\t\t\tconst indicesSmalli = arraysDifference( indicesNotDottedI, oneCombinationDotlessI );\n\n\t\t\t\t\t// Third round of creating combinations: assign which indices will be replaced by i\n\t\t\t\t\tconst combinationsDottedi = combinations( indicesSmalli );\n\n\t\t\t\t\tcombinationsDottedi.forEach( function( oneCombinationDottedi ) {\n\t\t\t\t\t\t// If the combination is full array, just add it to results immediately without going through the rest of iterations.\n\t\t\t\t\t\tif ( isEqual( oneCombinationDottedi, indicesSmalli ) ) {\n\t\t\t\t\t\t\tresults.push( [ oneCombinationDottedI, oneCombinationDotlessI, oneCombinationDottedi, [] ] );\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tconst oneCombinationDotlessi = arraysDifference( indicesSmalli, oneCombinationDottedi );\n\n\t\t\t\t\t\t\tresults.push( [ oneCombinationDottedI, oneCombinationDotlessI, oneCombinationDottedi, oneCombinationDotlessi ] );\n\t\t\t\t\t\t}\n\t\t\t\t\t} );\n\t\t\t\t}\n\t\t\t} );\n\t\t}\n\t} );\n\n\tconst textAlternations = [];\n\n\tresults.forEach( function( result ) {\n\t\tconst toDottedI = replaceCharactersByIndex( text, result[ 0 ], \"İ\" );\n\t\tconst toDotlessI = replaceCharactersByIndex( toDottedI, result[ 1 ], \"I\" );\n\t\tconst toDottedi = replaceCharactersByIndex( toDotlessI, result[ 2 ], \"i\" );\n\t\tconst toDotlessi = replaceCharactersByIndex( toDottedi, result[ 3 ], \"ı\" );\n\t\ttextAlternations.push( toDotlessi );\n\t} );\n\n\treturn textAlternations;\n}\n\nconst replaceTurkishIsMemoized = memoize( replaceTurkishIs );\n\nexport {\n\tgetIndicesOfWords,\n\tgetIndicesOfCharacter,\n\tarraysDifference,\n\tarraysOverlap,\n\tcombinations,\n\treplaceTurkishIs,\n\treplaceTurkishIsMemoized,\n};\n"],"mappings":"AAAA,SAASA,MAAM,EAAEC,QAAQ,EAAEC,OAAO,EAAEC,OAAO,QAAQ,QAAQ;AAC3D,OAAOC,QAAQ;;AAEf;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,iBAAiBA,CAAEC,IAAI,EAAG;EAClC,MAAMC,OAAO,GAAG,EAAE;EAClB,MAAMC,KAAK,GAAGJ,QAAQ,CAAEE,IAAK,CAAC;EAC9B,IAAIG,eAAe,GAAG,CAAC;EAEvBD,KAAK,CAACE,OAAO,CAAE,UAAUC,IAAI,EAAG;IAC/B,MAAMC,YAAY,GAAGN,IAAI,CAACO,OAAO,CAAEF,IAAI,EAAEF,eAAgB,CAAC;IAC1DF,OAAO,CAACO,IAAI,CAAEF,YAAa,CAAC;IAC5BH,eAAe,GAAGG,YAAY,GAAGD,IAAI,CAACI,MAAM;EAC7C,CAAE,CAAC;EAEH,OAAOR,OAAO;AACf;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASS,qBAAqBA,CAAEV,IAAI,EAAEW,eAAe,EAAG;EACvD,MAAMV,OAAO,GAAG,EAAE;EAElB,IAAKD,IAAI,CAACO,OAAO,CAAEI,eAAgB,CAAC,GAAG,CAAC,CAAC,EAAG;IAC3C,KAAM,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGZ,IAAI,CAACS,MAAM,EAAEG,CAAC,EAAE,EAAG;MACvC,IAAKZ,IAAI,CAAEY,CAAC,CAAE,KAAKD,eAAe,EAAG;QACpCV,OAAO,CAACO,IAAI,CAAEI,CAAE,CAAC;MAClB;IACD;EACD;EAEA,OAAOX,OAAO;AACf;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASY,gBAAgBA,CAAEC,QAAQ,EAAEC,QAAQ,EAAG;EAC/C,OAAOrB,MAAM,CAAEoB,QAAQ,EAAE,UAAUE,OAAO,EAAG;IAC5C,OAAS,CAAErB,QAAQ,CAAEoB,QAAQ,EAAEC,OAAQ,CAAC;EACzC,CAAE,CAAC;AACJ;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,aAAaA,CAAEC,UAAU,EAAEC,WAAW,EAAG;EACjD,OAAOzB,MAAM,CAAEwB,UAAU,EAAE,UAAUF,OAAO,EAAG;IAC9C,OAASrB,QAAQ,CAAEwB,WAAW,EAAEH,OAAQ,CAAC;EAC1C,CAAE,CAAC;AACJ;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASI,YAAYA,CAAEC,UAAU,EAAG;EACnC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;EACC,SAASC,GAAGA,CAAEC,EAAE,EAAEC,KAAK,EAAG;IACzB,MAAMC,CAAC,GAAGF,EAAE,CAAE,CAAC,CAAE;IAEjB,IAAK,OAAOE,CAAC,KAAK,WAAW,EAAG;MAC/B,OAAOD,KAAK;IACb;IAEA,KAAM,IAAIZ,CAAC,GAAG,CAAC,EAAEc,CAAC,GAAGF,KAAK,CAACf,MAAM,EAAEG,CAAC,GAAGc,CAAC,EAAE,EAAEd,CAAC,EAAG;MAC/CY,KAAK,CAAChB,IAAI,CAAEgB,KAAK,CAAEZ,CAAC,CAAE,CAACe,MAAM,CAAEF,CAAE,CAAE,CAAC;IACrC;IACA,OAAOH,GAAG,CAAEC,EAAE,CAACK,KAAK,CAAE,CAAE,CAAC,EAAEJ,KAAM,CAAC;EACnC;EACA,OAAOF,GAAG,CAAED,UAAU,EAAE,CAAE,EAAG,CAAG,CAAC,CAACO,KAAK,CAAE,CAAE,CAAC,CAACD,MAAM,CAAE,CAAE,EAAE,CAAG,CAAC;AAC9D;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASE,wBAAwBA,CAAE7B,IAAI,EAAEC,OAAO,EAAE6B,UAAU,EAAG;EAC9D,MAAMC,yBAAyB,GAAG/B,IAAI,CAACgC,KAAK,CAAE,EAAG,CAAC;EAElD/B,OAAO,CAACG,OAAO,CAAE,UAAU6B,KAAK,EAAG;IAClCF,yBAAyB,CAACG,MAAM,CAAED,KAAK,EAAE,CAAC,EAAEH,UAAW,CAAC;EACzD,CAAE,CAAC;EAEH,OAAOC,yBAAyB,CAACI,IAAI,CAAE,EAAG,CAAC;AAC5C;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,gBAAgBA,CAAEpC,IAAI,EAAG;EACjC;EACA,MAAMqC,cAAc,GAAG3B,qBAAqB,CAAEV,IAAI,EAAE,GAAI,CAAC,CAAC2B,MAAM,CAC/DjB,qBAAqB,CAAEV,IAAI,EAAE,GAAI,CAAC,EAClCU,qBAAqB,CAAEV,IAAI,EAAE,GAAI,CAAC,EAClCU,qBAAqB,CAAEV,IAAI,EAAE,GAAI,CAClC,CAAC;EACDqC,cAAc,CAACC,IAAI,CAAC,CAAC;;EAErB;EACA,IAAKD,cAAc,CAAC5B,MAAM,KAAK,CAAC,EAAG;IAClC,OAAO,CAAET,IAAI,CAAE;EAChB;EACA,MAAMuC,2BAA2B,GAAGtB,aAAa,CAAElB,iBAAiB,CAAEC,IAAK,CAAC,EAAEqC,cAAe,CAAC;EAE9F,MAAMG,OAAO,GAAG,EAAE;;EAElB;EACA,MAAMC,mBAAmB,GAAGrB,YAAY,CAAEmB,2BAA4B,CAAC;EAEvEE,mBAAmB,CAACrC,OAAO,CAAE,UAAUsC,qBAAqB,EAAG;IAC9D;IACA,IAAK9C,OAAO,CAAE8C,qBAAqB,EAAEH,2BAA4B,CAAC,EAAG;MACpEC,OAAO,CAAChC,IAAI,CAAE,CAAEkC,qBAAqB,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAG,CAAC;IACtD,CAAC,MAAM;MACN,MAAMC,iBAAiB,GAAG9B,gBAAgB,CAAE0B,2BAA2B,EAAEG,qBAAsB,CAAC;;MAEhG;MACA,MAAME,oBAAoB,GAAGxB,YAAY,CAAEuB,iBAAkB,CAAC;MAC9DC,oBAAoB,CAACxC,OAAO,CAAE,UAAUyC,sBAAsB,EAAG;QAChE;QACA,IAAKjD,OAAO,CAAEiD,sBAAsB,EAAEF,iBAAkB,CAAC,EAAG;UAC3DH,OAAO,CAAChC,IAAI,CAAE,CAAEkC,qBAAqB,EAAEG,sBAAsB,EAAE,EAAE,EAAE,EAAE,CAAG,CAAC;QAC1E,CAAC,MAAM;UACN,MAAMC,aAAa,GAAGjC,gBAAgB,CAAE8B,iBAAiB,EAAEE,sBAAuB,CAAC;;UAEnF;UACA,MAAME,mBAAmB,GAAG3B,YAAY,CAAE0B,aAAc,CAAC;UAEzDC,mBAAmB,CAAC3C,OAAO,CAAE,UAAU4C,qBAAqB,EAAG;YAC9D;YACA,IAAKpD,OAAO,CAAEoD,qBAAqB,EAAEF,aAAc,CAAC,EAAG;cACtDN,OAAO,CAAChC,IAAI,CAAE,CAAEkC,qBAAqB,EAAEG,sBAAsB,EAAEG,qBAAqB,EAAE,EAAE,CAAG,CAAC;YAC7F,CAAC,MAAM;cACN,MAAMC,sBAAsB,GAAGpC,gBAAgB,CAAEiC,aAAa,EAAEE,qBAAsB,CAAC;cAEvFR,OAAO,CAAChC,IAAI,CAAE,CAAEkC,qBAAqB,EAAEG,sBAAsB,EAAEG,qBAAqB,EAAEC,sBAAsB,CAAG,CAAC;YACjH;UACD,CAAE,CAAC;QACJ;MACD,CAAE,CAAC;IACJ;EACD,CAAE,CAAC;EAEH,MAAMC,gBAAgB,GAAG,EAAE;EAE3BV,OAAO,CAACpC,OAAO,CAAE,UAAU+C,MAAM,EAAG;IACnC,MAAMC,SAAS,GAAGvB,wBAAwB,CAAE7B,IAAI,EAAEmD,MAAM,CAAE,CAAC,CAAE,EAAE,GAAI,CAAC;IACpE,MAAME,UAAU,GAAGxB,wBAAwB,CAAEuB,SAAS,EAAED,MAAM,CAAE,CAAC,CAAE,EAAE,GAAI,CAAC;IAC1E,MAAMG,SAAS,GAAGzB,wBAAwB,CAAEwB,UAAU,EAAEF,MAAM,CAAE,CAAC,CAAE,EAAE,GAAI,CAAC;IAC1E,MAAMI,UAAU,GAAG1B,wBAAwB,CAAEyB,SAAS,EAAEH,MAAM,CAAE,CAAC,CAAE,EAAE,GAAI,CAAC;IAC1ED,gBAAgB,CAAC1C,IAAI,CAAE+C,UAAW,CAAC;EACpC,CAAE,CAAC;EAEH,OAAOL,gBAAgB;AACxB;AAEA,MAAMM,wBAAwB,GAAG3D,OAAO,CAAEuC,gBAAiB,CAAC;AAE5D,SACCrC,iBAAiB,EACjBW,qBAAqB,EACrBG,gBAAgB,EAChBI,aAAa,EACbG,YAAY,EACZgB,gBAAgB,EAChBoB,wBAAwB","ignoreList":[]}

package/build/languageProcessing/helpers/transliterate/transliterate.js

@@ -1,11 +1,5 @@
-"use strict";
+import transliterationsMap from "../../../config/getTransliterations.js";
 
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = _default;
-var _getTransliterations = _interopRequireDefault(require("../../../config/getTransliterations.js"));
-function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e }; }
 /**
  * Replaces all special characters from the text based on the transliterations map.
  *
@@ -14,8 +8,8 @@ function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e
  *
  * @returns {string} The text with all special characters replaced.
  */
-function _default(text, locale) {
-  const map = (0, _getTransliterations.default)(locale);
+export default function (text, locale) {
+  const map = transliterationsMap(locale);
   for (let i = 0; i < map.length; i++) {
     text = text.replace(map[i].letter, map[i].alternative);
   }

package/build/languageProcessing/helpers/transliterate/transliterate.js.map

@@ -1 +1 @@
-{"version":3,"file":"transliterate.js","names":["_getTransliterations","_interopRequireDefault","require","e","__esModule","default","_default","text","locale","map","transliterationsMap","i","length","replace","letter","alternative"],"sources":["../../../../src/languageProcessing/helpers/transliterate/transliterate.js"],"sourcesContent":["import transliterationsMap from \"../../../config/getTransliterations.js\";\n\n/**\n * Replaces all special characters from the text based on the transliterations map.\n *\n * @param {string} text     The text to remove special characters from.\n * @param {string} locale   The locale.\n *\n * @returns {string} The text with all special characters replaced.\n */\nexport default function( text, locale ) {\n\tconst map = transliterationsMap( locale );\n\tfor ( let i = 0; i < map.length; i++ ) {\n\t\ttext = text.replace(\n\t\t\tmap[ i ].letter,\n\t\t\tmap[ i ].alternative\n\t\t);\n\t}\n\treturn text;\n}\n"],"mappings":";;;;;;AAAA,IAAAA,oBAAA,GAAAC,sBAAA,CAAAC,OAAA;AAAyE,SAAAD,uBAAAE,CAAA,WAAAA,CAAA,IAAAA,CAAA,CAAAC,UAAA,GAAAD,CAAA,KAAAE,OAAA,EAAAF,CAAA;AAEzE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACe,SAAAG,SAAUC,IAAI,EAAEC,MAAM,EAAG;EACvC,MAAMC,GAAG,GAAG,IAAAC,4BAAmB,EAAEF,MAAO,CAAC;EACzC,KAAM,IAAIG,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGF,GAAG,CAACG,MAAM,EAAED,CAAC,EAAE,EAAG;IACtCJ,IAAI,GAAGA,IAAI,CAACM,OAAO,CAClBJ,GAAG,CAAEE,CAAC,CAAE,CAACG,MAAM,EACfL,GAAG,CAAEE,CAAC,CAAE,CAACI,WACV,CAAC;EACF;EACA,OAAOR,IAAI;AACZ","ignoreList":[]}
+{"version":3,"file":"transliterate.js","names":["transliterationsMap","text","locale","map","i","length","replace","letter","alternative"],"sources":["../../../../src/languageProcessing/helpers/transliterate/transliterate.js"],"sourcesContent":["import transliterationsMap from \"../../../config/getTransliterations.js\";\n\n/**\n * Replaces all special characters from the text based on the transliterations map.\n *\n * @param {string} text     The text to remove special characters from.\n * @param {string} locale   The locale.\n *\n * @returns {string} The text with all special characters replaced.\n */\nexport default function( text, locale ) {\n\tconst map = transliterationsMap( locale );\n\tfor ( let i = 0; i < map.length; i++ ) {\n\t\ttext = text.replace(\n\t\t\tmap[ i ].letter,\n\t\t\tmap[ i ].alternative\n\t\t);\n\t}\n\treturn text;\n}\n"],"mappings":"AAAA,OAAOA,mBAAmB;;AAE1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,UAAUC,IAAI,EAAEC,MAAM,EAAG;EACvC,MAAMC,GAAG,GAAGH,mBAAmB,CAAEE,MAAO,CAAC;EACzC,KAAM,IAAIE,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGD,GAAG,CAACE,MAAM,EAAED,CAAC,EAAE,EAAG;IACtCH,IAAI,GAAGA,IAAI,CAACK,OAAO,CAClBH,GAAG,CAAEC,CAAC,CAAE,CAACG,MAAM,EACfJ,GAAG,CAAEC,CAAC,CAAE,CAACI,WACV,CAAC;EACF;EACA,OAAOP,IAAI;AACZ","ignoreList":[]}

package/build/languageProcessing/helpers/transliterate/transliterateWPstyle.js

@@ -1,11 +1,5 @@
-"use strict";
+import transliterationsMap from "../../../config/transliterationsWPstyle.js";
 
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = _default;
-var _transliterationsWPstyle = _interopRequireDefault(require("../../../config/transliterationsWPstyle.js"));
-function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e }; }
 /**
  * Replaces all special characters from the text based on the transliterations map specific for WP
  * (and different from the one used by YoastSEO.js).
@@ -15,8 +9,8 @@ function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e
  *
  * @returns {string} The text with all special characters replaced.
  */
-function _default(text, locale) {
-  const map = (0, _transliterationsWPstyle.default)(locale);
+export default function (text, locale) {
+  const map = transliterationsMap(locale);
   for (let i = map.length - 1; i >= 0; i--) {
     text = text.replace(map[i].letter, map[i].alternative);
   }

package/build/languageProcessing/helpers/transliterate/transliterateWPstyle.js.map

@@ -1 +1 @@
-{"version":3,"file":"transliterateWPstyle.js","names":["_transliterationsWPstyle","_interopRequireDefault","require","e","__esModule","default","_default","text","locale","map","transliterationsMap","i","length","replace","letter","alternative"],"sources":["../../../../src/languageProcessing/helpers/transliterate/transliterateWPstyle.js"],"sourcesContent":["import transliterationsMap from \"../../../config/transliterationsWPstyle.js\";\n\n/**\n * Replaces all special characters from the text based on the transliterations map specific for WP\n * (and different from the one used by YoastSEO.js).\n *\n * @param {string} text     The text to remove special characters from.\n * @param {string} locale   The locale.\n *\n * @returns {string} The text with all special characters replaced.\n */\nexport default function( text, locale ) {\n\tconst map = transliterationsMap( locale );\n\tfor ( let i = map.length - 1; i >= 0; i-- ) {\n\t\ttext = text.replace(\n\t\t\tmap[ i ].letter,\n\t\t\tmap[ i ].alternative\n\t\t);\n\t}\n\treturn text;\n}\n"],"mappings":";;;;;;AAAA,IAAAA,wBAAA,GAAAC,sBAAA,CAAAC,OAAA;AAA6E,SAAAD,uBAAAE,CAAA,WAAAA,CAAA,IAAAA,CAAA,CAAAC,UAAA,GAAAD,CAAA,KAAAE,OAAA,EAAAF,CAAA;AAE7E;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACe,SAAAG,SAAUC,IAAI,EAAEC,MAAM,EAAG;EACvC,MAAMC,GAAG,GAAG,IAAAC,gCAAmB,EAAEF,MAAO,CAAC;EACzC,KAAM,IAAIG,CAAC,GAAGF,GAAG,CAACG,MAAM,GAAG,CAAC,EAAED,CAAC,IAAI,CAAC,EAAEA,CAAC,EAAE,EAAG;IAC3CJ,IAAI,GAAGA,IAAI,CAACM,OAAO,CAClBJ,GAAG,CAAEE,CAAC,CAAE,CAACG,MAAM,EACfL,GAAG,CAAEE,CAAC,CAAE,CAACI,WACV,CAAC;EACF;EACA,OAAOR,IAAI;AACZ","ignoreList":[]}
+{"version":3,"file":"transliterateWPstyle.js","names":["transliterationsMap","text","locale","map","i","length","replace","letter","alternative"],"sources":["../../../../src/languageProcessing/helpers/transliterate/transliterateWPstyle.js"],"sourcesContent":["import transliterationsMap from \"../../../config/transliterationsWPstyle.js\";\n\n/**\n * Replaces all special characters from the text based on the transliterations map specific for WP\n * (and different from the one used by YoastSEO.js).\n *\n * @param {string} text     The text to remove special characters from.\n * @param {string} locale   The locale.\n *\n * @returns {string} The text with all special characters replaced.\n */\nexport default function( text, locale ) {\n\tconst map = transliterationsMap( locale );\n\tfor ( let i = map.length - 1; i >= 0; i-- ) {\n\t\ttext = text.replace(\n\t\t\tmap[ i ].letter,\n\t\t\tmap[ i ].alternative\n\t\t);\n\t}\n\treturn text;\n}\n"],"mappings":"AAAA,OAAOA,mBAAmB;;AAE1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,UAAUC,IAAI,EAAEC,MAAM,EAAG;EACvC,MAAMC,GAAG,GAAGH,mBAAmB,CAAEE,MAAO,CAAC;EACzC,KAAM,IAAIE,CAAC,GAAGD,GAAG,CAACE,MAAM,GAAG,CAAC,EAAED,CAAC,IAAI,CAAC,EAAEA,CAAC,EAAE,EAAG;IAC3CH,IAAI,GAAGA,IAAI,CAACK,OAAO,CAClBH,GAAG,CAAEC,CAAC,CAAE,CAACG,MAAM,EACfJ,GAAG,CAAEC,CAAC,CAAE,CAACI,WACV,CAAC;EACF;EACA,OAAOP,IAAI;AACZ","ignoreList":[]}

package/build/languageProcessing/helpers/url/parseSlug.js

@@ -1,9 +1,3 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = _default;
 /**
  * Parses the slug by transforming hyphens and underscores into white space.
  *
@@ -11,7 +5,7 @@ exports.default = _default;
  *
  * @returns {string} The parsed slug.
  */
-function _default(slug) {
+export default function (slug) {
   return slug.replace(/[-_]/ig, " ");
 }
 //# sourceMappingURL=parseSlug.js.map

package/build/languageProcessing/helpers/url/parseSlug.js.map

@@ -1 +1 @@
-{"version":3,"file":"parseSlug.js","names":["_default","slug","replace"],"sources":["../../../../src/languageProcessing/helpers/url/parseSlug.js"],"sourcesContent":["/**\n * Parses the slug by transforming hyphens and underscores into white space.\n *\n * @param {string} slug The slug to parse\n *\n * @returns {string} The parsed slug.\n */\nexport default function( slug ) {\n\treturn slug.replace( /[-_]/ig, \" \" );\n}\n"],"mappings":";;;;;;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACe,SAAAA,SAAUC,IAAI,EAAG;EAC/B,OAAOA,IAAI,CAACC,OAAO,CAAE,QAAQ,EAAE,GAAI,CAAC;AACrC","ignoreList":[]}
+{"version":3,"file":"parseSlug.js","names":["slug","replace"],"sources":["../../../../src/languageProcessing/helpers/url/parseSlug.js"],"sourcesContent":["/**\n * Parses the slug by transforming hyphens and underscores into white space.\n *\n * @param {string} slug The slug to parse\n *\n * @returns {string} The parsed slug.\n */\nexport default function( slug ) {\n\treturn slug.replace( /[-_]/ig, \" \" );\n}\n"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,UAAUA,IAAI,EAAG;EAC/B,OAAOA,IAAI,CAACC,OAAO,CAAE,QAAQ,EAAE,GAAI,CAAC;AACrC","ignoreList":[]}

package/build/languageProcessing/helpers/url/url.js

@@ -1,12 +1,6 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = void 0;
-var _url = _interopRequireDefault(require("url"));
-function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e }; }
 const urlFromAnchorRegex = /href=(["'])([^"']+)\1/i;
+import urlMethods from "url";
+
 /**
  * Removes a hash from a URL, assumes a well formed URL.
  *
@@ -80,7 +74,7 @@ function areEqual(urlA, urlB) {
  * @returns {string} The domain name of the URL.
  */
 function getHostname(url) {
-  url = _url.default.parse(url);
+  url = urlMethods.parse(url);
   return url.hostname;
 }
 
@@ -93,7 +87,7 @@ function getHostname(url) {
  * @returns {string|null} The protocol of the URL or null if no protocol is present.
  */
 function getProtocol(url) {
-  return _url.default.parse(url).protocol;
+  return urlMethods.parse(url).protocol;
 }
 
 /**
@@ -105,7 +99,7 @@ function getProtocol(url) {
  * @returns {boolean} Whether or not the anchor URL is internal.
  */
 function isInternalLink(anchorUrl, siteUrlOrDomain) {
-  const parsedAnchorUrl = _url.default.parse(anchorUrl, false, true);
+  const parsedAnchorUrl = urlMethods.parse(anchorUrl, false, true);
   const anchorUrlHostName = parsedAnchorUrl.hostname;
 
   // Check if the anchor URL starts with a single slash.
@@ -129,7 +123,7 @@ function isInternalLink(anchorUrl, siteUrlOrDomain) {
   }
 
   // If the siteUrlOrDomain variable is a URL and it shares the hostname with the anchor URL, it's an internal link.
-  const parsedSiteUrlOrDomain = _url.default.parse(siteUrlOrDomain);
+  const parsedSiteUrlOrDomain = urlMethods.parse(siteUrlOrDomain);
   const siteUrlOrDomainHostName = parsedSiteUrlOrDomain.hostname;
   return anchorUrlHostName === siteUrlOrDomainHostName;
 }
@@ -158,7 +152,7 @@ function protocolIsHttpScheme(protocol) {
 function isRelativeFragmentURL(url) {
   return url.indexOf("#") === 0;
 }
-var _default = exports.default = {
+export default {
   removeHash: removeHash,
   removeQueryArgs: removeQueryArgs,
   removeTrailingSlash: removeTrailingSlash,

package/build/languageProcessing/helpers/url/url.js.map

@@ -1 +1 @@
-{"version":3,"file":"url.js","names":["_url","_interopRequireDefault","require","e","__esModule","default","urlFromAnchorRegex","removeHash","url","split","removeQueryArgs","removeTrailingSlash","replace","addTrailingSlash","getFromAnchorTag","anchorTag","urlMatch","exec","areEqual","urlA","urlB","getHostname","urlMethods","parse","hostname","getProtocol","protocol","isInternalLink","anchorUrl","siteUrlOrDomain","parsedAnchorUrl","anchorUrlHostName","indexOf","parsedSiteUrlOrDomain","siteUrlOrDomainHostName","protocolIsHttpScheme","isRelativeFragmentURL","_default","exports"],"sources":["../../../../src/languageProcessing/helpers/url/url.js"],"sourcesContent":["const urlFromAnchorRegex = /href=([\"'])([^\"']+)\\1/i;\nimport urlMethods from \"url\";\n\n/**\n * Removes a hash from a URL, assumes a well formed URL.\n *\n * @param {string} url The URL to remove a hash from.\n * @returns {string} The URL without the hash.\n */\nfunction removeHash( url ) {\n\treturn url.split( \"#\" )[ 0 ];\n}\n\n/**\n * Removes all query args from a URL, assumes a well formed URL.\n *\n * @param {string} url The URL to remove the query args from.\n * @returns {string} The URL without the query args.\n */\nfunction removeQueryArgs( url ) {\n\treturn url.split( \"?\" )[ 0 ];\n}\n\n/**\n * Removes the trailing slash of a URL.\n *\n * @param {string} url The URL to remove the trailing slash from.\n * @returns {string} A URL without a trailing slash.\n */\nfunction removeTrailingSlash( url ) {\n\treturn url.replace( /\\/$/, \"\" );\n}\n\n/**\n * Adds a trailing slash to a URL if it is not present.\n *\n * @param {string} url The URL to add a trailing slash to.\n * @returns {string} A URL with a trailing slash.\n */\nfunction addTrailingSlash( url ) {\n\treturn removeTrailingSlash( url ) + \"/\";\n}\n\n/**\n * Retrieves the URL from an anchor tag.\n *\n * @param {string} anchorTag An anchor tag.\n * @returns {string} The URL in the anchor tag.\n */\nfunction getFromAnchorTag( anchorTag ) {\n\tconst urlMatch = urlFromAnchorRegex.exec( anchorTag );\n\n\treturn ( urlMatch === null ) ? \"\" : urlMatch[ 2 ];\n}\n\n/**\n * Returns whether or not the given URLs are equal.\n *\n * @param {string} urlA The first URL to compare.\n * @param {string} urlB The second URL to compare.\n *\n * @returns {boolean} Whether or not the given URLs are equal.\n */\nfunction areEqual( urlA, urlB ) {\n\t// Make sure we are comparing URLs without query arguments and hashes.\n\turlA = removeQueryArgs( removeHash( urlA ) );\n\turlB = removeQueryArgs( removeHash( urlB ) );\n\n\treturn addTrailingSlash( urlA ) === addTrailingSlash( urlB );\n}\n\n/**\n * Returns the domain name of a URL.\n *\n * @param {string} url The URL to retrieve the domain name of.\n * @returns {string} The domain name of the URL.\n */\nfunction getHostname( url ) {\n\turl = urlMethods.parse( url );\n\n\treturn url.hostname;\n}\n\n/**\n * Returns the protocol of a URL.\n *\n * Note that the colon (http:) is also part of the protocol, conform to node's url.parse api.\n *\n * @param {string} url The URL to retrieve the protocol of.\n * @returns {string|null} The protocol of the URL or null if no protocol is present.\n */\nfunction getProtocol( url ) {\n\treturn urlMethods.parse( url ).protocol;\n}\n\n/**\n * Determine whether an anchor URL is internal.\n *\n * @param {string} anchorUrl \t\tThe anchor URL to test.\n * @param {string} siteUrlOrDomain  The current site's URL or domain.\n *\n * @returns {boolean} Whether or not the anchor URL is internal.\n */\nfunction isInternalLink( anchorUrl, siteUrlOrDomain ) {\n\tconst parsedAnchorUrl = urlMethods.parse( anchorUrl, false, true );\n\tconst anchorUrlHostName = parsedAnchorUrl.hostname;\n\n\t// Check if the anchor URL starts with a single slash.\n\tif ( anchorUrl.indexOf( \"//\" ) === -1 && anchorUrl.indexOf( \"/\" ) === 0 ) {\n\t\treturn true;\n\t}\n\n\t// Check if the anchor URL starts with a # indicating a fragment.\n\tif ( anchorUrl.indexOf( \"#\" ) === 0 ) {\n\t\treturn false;\n\t}\n\n\t// No host of the anchor URL indicates an internal link.\n\tif ( ! anchorUrlHostName ) {\n\t\treturn true;\n\t}\n\n\t// If the siteUrlOrDomain variable is a domain, it would be idential to the anchor URL's hostname in case of an internal link.\n\tif ( anchorUrlHostName === siteUrlOrDomain ) {\n\t\treturn true;\n\t}\n\n\t// If the siteUrlOrDomain variable is a URL and it shares the hostname with the anchor URL, it's an internal link.\n\tconst parsedSiteUrlOrDomain = urlMethods.parse( siteUrlOrDomain );\n\tconst siteUrlOrDomainHostName = parsedSiteUrlOrDomain.hostname;\n\treturn anchorUrlHostName === siteUrlOrDomainHostName;\n}\n\n/**\n * Checks whether the protocol is either HTTP: or HTTPS:.\n *\n * @param {string} protocol The protocol to test.\n *\n * @returns {boolean} Whether the protocol is http(s):.\n */\nfunction protocolIsHttpScheme( protocol ) {\n\tif ( ! protocol ) {\n\t\treturn false;\n\t}\n\n\treturn ( protocol === \"http:\" || protocol === \"https:\" );\n}\n\n/**\n * Determines whether the link is a relative fragment URL.\n *\n * @param {string} url The URL to test.\n *\n * @returns {boolean} Whether the link is a relative fragment URL.\n */\nfunction isRelativeFragmentURL( url ) {\n\treturn url.indexOf( \"#\" ) === 0;\n}\n\nexport default {\n\tremoveHash: removeHash,\n\tremoveQueryArgs: removeQueryArgs,\n\tremoveTrailingSlash: removeTrailingSlash,\n\taddTrailingSlash: addTrailingSlash,\n\tgetFromAnchorTag: getFromAnchorTag,\n\tareEqual: areEqual,\n\tgetHostname: getHostname,\n\tgetProtocol: getProtocol,\n\tisInternalLink: isInternalLink,\n\tprotocolIsHttpScheme: protocolIsHttpScheme,\n\tisRelativeFragmentURL: isRelativeFragmentURL,\n};\n"],"mappings":";;;;;;AACA,IAAAA,IAAA,GAAAC,sBAAA,CAAAC,OAAA;AAA6B,SAAAD,uBAAAE,CAAA,WAAAA,CAAA,IAAAA,CAAA,CAAAC,UAAA,GAAAD,CAAA,KAAAE,OAAA,EAAAF,CAAA;AAD7B,MAAMG,kBAAkB,GAAG,wBAAwB;AAGnD;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,UAAUA,CAAEC,GAAG,EAAG;EAC1B,OAAOA,GAAG,CAACC,KAAK,CAAE,GAAI,CAAC,CAAE,CAAC,CAAE;AAC7B;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,eAAeA,CAAEF,GAAG,EAAG;EAC/B,OAAOA,GAAG,CAACC,KAAK,CAAE,GAAI,CAAC,CAAE,CAAC,CAAE;AAC7B;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,SAASE,mBAAmBA,CAAEH,GAAG,EAAG;EACnC,OAAOA,GAAG,CAACI,OAAO,CAAE,KAAK,EAAE,EAAG,CAAC;AAChC;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,gBAAgBA,CAAEL,GAAG,EAAG;EAChC,OAAOG,mBAAmB,CAAEH,GAAI,CAAC,GAAG,GAAG;AACxC;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,SAASM,gBAAgBA,CAAEC,SAAS,EAAG;EACtC,MAAMC,QAAQ,GAAGV,kBAAkB,CAACW,IAAI,CAAEF,SAAU,CAAC;EAErD,OAASC,QAAQ,KAAK,IAAI,GAAK,EAAE,GAAGA,QAAQ,CAAE,CAAC,CAAE;AAClD;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASE,QAAQA,CAAEC,IAAI,EAAEC,IAAI,EAAG;EAC/B;EACAD,IAAI,GAAGT,eAAe,CAAEH,UAAU,CAAEY,IAAK,CAAE,CAAC;EAC5CC,IAAI,GAAGV,eAAe,CAAEH,UAAU,CAAEa,IAAK,CAAE,CAAC;EAE5C,OAAOP,gBAAgB,CAAEM,IAAK,CAAC,KAAKN,gBAAgB,CAAEO,IAAK,CAAC;AAC7D;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,WAAWA,CAAEb,GAAG,EAAG;EAC3BA,GAAG,GAAGc,YAAU,CAACC,KAAK,CAAEf,GAAI,CAAC;EAE7B,OAAOA,GAAG,CAACgB,QAAQ;AACpB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,WAAWA,CAAEjB,GAAG,EAAG;EAC3B,OAAOc,YAAU,CAACC,KAAK,CAAEf,GAAI,CAAC,CAACkB,QAAQ;AACxC;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,cAAcA,CAAEC,SAAS,EAAEC,eAAe,EAAG;EACrD,MAAMC,eAAe,GAAGR,YAAU,CAACC,KAAK,CAAEK,SAAS,EAAE,KAAK,EAAE,IAAK,CAAC;EAClE,MAAMG,iBAAiB,GAAGD,eAAe,CAACN,QAAQ;;EAElD;EACA,IAAKI,SAAS,CAACI,OAAO,CAAE,IAAK,CAAC,KAAK,CAAC,CAAC,IAAIJ,SAAS,CAACI,OAAO,CAAE,GAAI,CAAC,KAAK,CAAC,EAAG;IACzE,OAAO,IAAI;EACZ;;EAEA;EACA,IAAKJ,SAAS,CAACI,OAAO,CAAE,GAAI,CAAC,KAAK,CAAC,EAAG;IACrC,OAAO,KAAK;EACb;;EAEA;EACA,IAAK,CAAED,iBAAiB,EAAG;IAC1B,OAAO,IAAI;EACZ;;EAEA;EACA,IAAKA,iBAAiB,KAAKF,eAAe,EAAG;IAC5C,OAAO,IAAI;EACZ;;EAEA;EACA,MAAMI,qBAAqB,GAAGX,YAAU,CAACC,KAAK,CAAEM,eAAgB,CAAC;EACjE,MAAMK,uBAAuB,GAAGD,qBAAqB,CAACT,QAAQ;EAC9D,OAAOO,iBAAiB,KAAKG,uBAAuB;AACrD;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,oBAAoBA,CAAET,QAAQ,EAAG;EACzC,IAAK,CAAEA,QAAQ,EAAG;IACjB,OAAO,KAAK;EACb;EAEA,OAASA,QAAQ,KAAK,OAAO,IAAIA,QAAQ,KAAK,QAAQ;AACvD;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASU,qBAAqBA,CAAE5B,GAAG,EAAG;EACrC,OAAOA,GAAG,CAACwB,OAAO,CAAE,GAAI,CAAC,KAAK,CAAC;AAChC;AAAC,IAAAK,QAAA,GAAAC,OAAA,CAAAjC,OAAA,GAEc;EACdE,UAAU,EAAEA,UAAU;EACtBG,eAAe,EAAEA,eAAe;EAChCC,mBAAmB,EAAEA,mBAAmB;EACxCE,gBAAgB,EAAEA,gBAAgB;EAClCC,gBAAgB,EAAEA,gBAAgB;EAClCI,QAAQ,EAAEA,QAAQ;EAClBG,WAAW,EAAEA,WAAW;EACxBI,WAAW,EAAEA,WAAW;EACxBE,cAAc,EAAEA,cAAc;EAC9BQ,oBAAoB,EAAEA,oBAAoB;EAC1CC,qBAAqB,EAAEA;AACxB,CAAC","ignoreList":[]}
+{"version":3,"file":"url.js","names":["urlFromAnchorRegex","urlMethods","removeHash","url","split","removeQueryArgs","removeTrailingSlash","replace","addTrailingSlash","getFromAnchorTag","anchorTag","urlMatch","exec","areEqual","urlA","urlB","getHostname","parse","hostname","getProtocol","protocol","isInternalLink","anchorUrl","siteUrlOrDomain","parsedAnchorUrl","anchorUrlHostName","indexOf","parsedSiteUrlOrDomain","siteUrlOrDomainHostName","protocolIsHttpScheme","isRelativeFragmentURL"],"sources":["../../../../src/languageProcessing/helpers/url/url.js"],"sourcesContent":["const urlFromAnchorRegex = /href=([\"'])([^\"']+)\\1/i;\nimport urlMethods from \"url\";\n\n/**\n * Removes a hash from a URL, assumes a well formed URL.\n *\n * @param {string} url The URL to remove a hash from.\n * @returns {string} The URL without the hash.\n */\nfunction removeHash( url ) {\n\treturn url.split( \"#\" )[ 0 ];\n}\n\n/**\n * Removes all query args from a URL, assumes a well formed URL.\n *\n * @param {string} url The URL to remove the query args from.\n * @returns {string} The URL without the query args.\n */\nfunction removeQueryArgs( url ) {\n\treturn url.split( \"?\" )[ 0 ];\n}\n\n/**\n * Removes the trailing slash of a URL.\n *\n * @param {string} url The URL to remove the trailing slash from.\n * @returns {string} A URL without a trailing slash.\n */\nfunction removeTrailingSlash( url ) {\n\treturn url.replace( /\\/$/, \"\" );\n}\n\n/**\n * Adds a trailing slash to a URL if it is not present.\n *\n * @param {string} url The URL to add a trailing slash to.\n * @returns {string} A URL with a trailing slash.\n */\nfunction addTrailingSlash( url ) {\n\treturn removeTrailingSlash( url ) + \"/\";\n}\n\n/**\n * Retrieves the URL from an anchor tag.\n *\n * @param {string} anchorTag An anchor tag.\n * @returns {string} The URL in the anchor tag.\n */\nfunction getFromAnchorTag( anchorTag ) {\n\tconst urlMatch = urlFromAnchorRegex.exec( anchorTag );\n\n\treturn ( urlMatch === null ) ? \"\" : urlMatch[ 2 ];\n}\n\n/**\n * Returns whether or not the given URLs are equal.\n *\n * @param {string} urlA The first URL to compare.\n * @param {string} urlB The second URL to compare.\n *\n * @returns {boolean} Whether or not the given URLs are equal.\n */\nfunction areEqual( urlA, urlB ) {\n\t// Make sure we are comparing URLs without query arguments and hashes.\n\turlA = removeQueryArgs( removeHash( urlA ) );\n\turlB = removeQueryArgs( removeHash( urlB ) );\n\n\treturn addTrailingSlash( urlA ) === addTrailingSlash( urlB );\n}\n\n/**\n * Returns the domain name of a URL.\n *\n * @param {string} url The URL to retrieve the domain name of.\n * @returns {string} The domain name of the URL.\n */\nfunction getHostname( url ) {\n\turl = urlMethods.parse( url );\n\n\treturn url.hostname;\n}\n\n/**\n * Returns the protocol of a URL.\n *\n * Note that the colon (http:) is also part of the protocol, conform to node's url.parse api.\n *\n * @param {string} url The URL to retrieve the protocol of.\n * @returns {string|null} The protocol of the URL or null if no protocol is present.\n */\nfunction getProtocol( url ) {\n\treturn urlMethods.parse( url ).protocol;\n}\n\n/**\n * Determine whether an anchor URL is internal.\n *\n * @param {string} anchorUrl \t\tThe anchor URL to test.\n * @param {string} siteUrlOrDomain  The current site's URL or domain.\n *\n * @returns {boolean} Whether or not the anchor URL is internal.\n */\nfunction isInternalLink( anchorUrl, siteUrlOrDomain ) {\n\tconst parsedAnchorUrl = urlMethods.parse( anchorUrl, false, true );\n\tconst anchorUrlHostName = parsedAnchorUrl.hostname;\n\n\t// Check if the anchor URL starts with a single slash.\n\tif ( anchorUrl.indexOf( \"//\" ) === -1 && anchorUrl.indexOf( \"/\" ) === 0 ) {\n\t\treturn true;\n\t}\n\n\t// Check if the anchor URL starts with a # indicating a fragment.\n\tif ( anchorUrl.indexOf( \"#\" ) === 0 ) {\n\t\treturn false;\n\t}\n\n\t// No host of the anchor URL indicates an internal link.\n\tif ( ! anchorUrlHostName ) {\n\t\treturn true;\n\t}\n\n\t// If the siteUrlOrDomain variable is a domain, it would be idential to the anchor URL's hostname in case of an internal link.\n\tif ( anchorUrlHostName === siteUrlOrDomain ) {\n\t\treturn true;\n\t}\n\n\t// If the siteUrlOrDomain variable is a URL and it shares the hostname with the anchor URL, it's an internal link.\n\tconst parsedSiteUrlOrDomain = urlMethods.parse( siteUrlOrDomain );\n\tconst siteUrlOrDomainHostName = parsedSiteUrlOrDomain.hostname;\n\treturn anchorUrlHostName === siteUrlOrDomainHostName;\n}\n\n/**\n * Checks whether the protocol is either HTTP: or HTTPS:.\n *\n * @param {string} protocol The protocol to test.\n *\n * @returns {boolean} Whether the protocol is http(s):.\n */\nfunction protocolIsHttpScheme( protocol ) {\n\tif ( ! protocol ) {\n\t\treturn false;\n\t}\n\n\treturn ( protocol === \"http:\" || protocol === \"https:\" );\n}\n\n/**\n * Determines whether the link is a relative fragment URL.\n *\n * @param {string} url The URL to test.\n *\n * @returns {boolean} Whether the link is a relative fragment URL.\n */\nfunction isRelativeFragmentURL( url ) {\n\treturn url.indexOf( \"#\" ) === 0;\n}\n\nexport default {\n\tremoveHash: removeHash,\n\tremoveQueryArgs: removeQueryArgs,\n\tremoveTrailingSlash: removeTrailingSlash,\n\taddTrailingSlash: addTrailingSlash,\n\tgetFromAnchorTag: getFromAnchorTag,\n\tareEqual: areEqual,\n\tgetHostname: getHostname,\n\tgetProtocol: getProtocol,\n\tisInternalLink: isInternalLink,\n\tprotocolIsHttpScheme: protocolIsHttpScheme,\n\tisRelativeFragmentURL: isRelativeFragmentURL,\n};\n"],"mappings":"AAAA,MAAMA,kBAAkB,GAAG,wBAAwB;AACnD,OAAOC,UAAU,MAAM,KAAK;;AAE5B;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,UAAUA,CAAEC,GAAG,EAAG;EAC1B,OAAOA,GAAG,CAACC,KAAK,CAAE,GAAI,CAAC,CAAE,CAAC,CAAE;AAC7B;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,eAAeA,CAAEF,GAAG,EAAG;EAC/B,OAAOA,GAAG,CAACC,KAAK,CAAE,GAAI,CAAC,CAAE,CAAC,CAAE;AAC7B;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,SAASE,mBAAmBA,CAAEH,GAAG,EAAG;EACnC,OAAOA,GAAG,CAACI,OAAO,CAAE,KAAK,EAAE,EAAG,CAAC;AAChC;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,gBAAgBA,CAAEL,GAAG,EAAG;EAChC,OAAOG,mBAAmB,CAAEH,GAAI,CAAC,GAAG,GAAG;AACxC;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,SAASM,gBAAgBA,CAAEC,SAAS,EAAG;EACtC,MAAMC,QAAQ,GAAGX,kBAAkB,CAACY,IAAI,CAAEF,SAAU,CAAC;EAErD,OAASC,QAAQ,KAAK,IAAI,GAAK,EAAE,GAAGA,QAAQ,CAAE,CAAC,CAAE;AAClD;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASE,QAAQA,CAAEC,IAAI,EAAEC,IAAI,EAAG;EAC/B;EACAD,IAAI,GAAGT,eAAe,CAAEH,UAAU,CAAEY,IAAK,CAAE,CAAC;EAC5CC,IAAI,GAAGV,eAAe,CAAEH,UAAU,CAAEa,IAAK,CAAE,CAAC;EAE5C,OAAOP,gBAAgB,CAAEM,IAAK,CAAC,KAAKN,gBAAgB,CAAEO,IAAK,CAAC;AAC7D;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,WAAWA,CAAEb,GAAG,EAAG;EAC3BA,GAAG,GAAGF,UAAU,CAACgB,KAAK,CAAEd,GAAI,CAAC;EAE7B,OAAOA,GAAG,CAACe,QAAQ;AACpB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,WAAWA,CAAEhB,GAAG,EAAG;EAC3B,OAAOF,UAAU,CAACgB,KAAK,CAAEd,GAAI,CAAC,CAACiB,QAAQ;AACxC;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,cAAcA,CAAEC,SAAS,EAAEC,eAAe,EAAG;EACrD,MAAMC,eAAe,GAAGvB,UAAU,CAACgB,KAAK,CAAEK,SAAS,EAAE,KAAK,EAAE,IAAK,CAAC;EAClE,MAAMG,iBAAiB,GAAGD,eAAe,CAACN,QAAQ;;EAElD;EACA,IAAKI,SAAS,CAACI,OAAO,CAAE,IAAK,CAAC,KAAK,CAAC,CAAC,IAAIJ,SAAS,CAACI,OAAO,CAAE,GAAI,CAAC,KAAK,CAAC,EAAG;IACzE,OAAO,IAAI;EACZ;;EAEA;EACA,IAAKJ,SAAS,CAACI,OAAO,CAAE,GAAI,CAAC,KAAK,CAAC,EAAG;IACrC,OAAO,KAAK;EACb;;EAEA;EACA,IAAK,CAAED,iBAAiB,EAAG;IAC1B,OAAO,IAAI;EACZ;;EAEA;EACA,IAAKA,iBAAiB,KAAKF,eAAe,EAAG;IAC5C,OAAO,IAAI;EACZ;;EAEA;EACA,MAAMI,qBAAqB,GAAG1B,UAAU,CAACgB,KAAK,CAAEM,eAAgB,CAAC;EACjE,MAAMK,uBAAuB,GAAGD,qBAAqB,CAACT,QAAQ;EAC9D,OAAOO,iBAAiB,KAAKG,uBAAuB;AACrD;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,oBAAoBA,CAAET,QAAQ,EAAG;EACzC,IAAK,CAAEA,QAAQ,EAAG;IACjB,OAAO,KAAK;EACb;EAEA,OAASA,QAAQ,KAAK,OAAO,IAAIA,QAAQ,KAAK,QAAQ;AACvD;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASU,qBAAqBA,CAAE3B,GAAG,EAAG;EACrC,OAAOA,GAAG,CAACuB,OAAO,CAAE,GAAI,CAAC,KAAK,CAAC;AAChC;AAEA,eAAe;EACdxB,UAAU,EAAEA,UAAU;EACtBG,eAAe,EAAEA,eAAe;EAChCC,mBAAmB,EAAEA,mBAAmB;EACxCE,gBAAgB,EAAEA,gBAAgB;EAClCC,gBAAgB,EAAEA,gBAAgB;EAClCI,QAAQ,EAAEA,QAAQ;EAClBG,WAAW,EAAEA,WAAW;EACxBG,WAAW,EAAEA,WAAW;EACxBE,cAAc,EAAEA,cAAc;EAC9BQ,oBAAoB,EAAEA,oBAAoB;EAC1CC,qBAAqB,EAAEA;AACxB,CAAC","ignoreList":[]}

package/build/languageProcessing/helpers/word/addWordboundary.js

@@ -1,9 +1,3 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = _default;
 /**
  * Returns a string that can be used in a regex to match a matchString with word boundaries.
  *
@@ -15,7 +9,7 @@ exports.default = _default;
  *
  * @returns {string} A regex string that matches the matchString with word boundaries.
  */
-function _default(matchString, positiveLookAhead = false, extraWordBoundary = "", language = "") {
+export default function (matchString, positiveLookAhead = false, extraWordBoundary = "", language = "") {
   let wordBoundary, wordBoundaryEnd;
   if (language === "id") {
     wordBoundary = "[ \\u00a0\\n\\r\\t.,()”“〝〞〟‟„\"+;!¡?¿:/»«‹›" + extraWordBoundary + "<>";

package/build/languageProcessing/helpers/word/addWordboundary.js.map

@@ -1 +1 @@
-{"version":3,"file":"addWordboundary.js","names":["_default","matchString","positiveLookAhead","extraWordBoundary","language","wordBoundary","wordBoundaryEnd","wordBoundaryStart"],"sources":["../../../../src/languageProcessing/helpers/word/addWordboundary.js"],"sourcesContent":["/**\n * Returns a string that can be used in a regex to match a matchString with word boundaries.\n *\n * @param {string}  matchString                 The string to generate a regex string for.\n * @param {boolean} [positiveLookAhead=false]   Boolean indicating whether or not to include a positive look ahead\n * for the word boundaries at the end.\n * @param {string} [extraWordBoundary=\"\"]       Extra characters to match a word boundary on.\n * @param {string} [language=\"\"]                The language used to determine the word boundary.\n *\n * @returns {string} A regex string that matches the matchString with word boundaries.\n */\nexport default function( matchString, positiveLookAhead = false, extraWordBoundary = \"\", language = \"\" ) {\n\tlet wordBoundary, wordBoundaryEnd;\n\n\tif ( language === \"id\" ) {\n\t\twordBoundary = \"[ \\\\u00a0\\\\n\\\\r\\\\t.,()”“〝〞〟‟„\\\"+;!¡?¿:/»«‹›\" + extraWordBoundary + \"<>\";\n\t} else {\n\t\t/*\n\t\t * \\u00a0 - no-break space\n\t\t * \\u2014 - em dash\n         * \\u06d4 - Urdu full stop\n         * \\u061f - Arabic question mark\n         * \\u060C - Arabic comma\n         * \\u061B - Arabic semicolon\n         */\n\t\twordBoundary = \"[ \\\\u00a0\\\\u2014\\\\u06d4\\\\u061f\\\\u060C\\\\u061B\\\\n\\\\r\\\\t.,()”“〝〞〟‟„\\\"+\\\\-;!¡?¿:/»«‹›\" + extraWordBoundary + \"<>\";\n\t}\n\n\tconst wordBoundaryStart = \"(^|\" + wordBoundary + \"'‘’‛`])\";\n\tif ( positiveLookAhead ) {\n\t\twordBoundaryEnd = \"($|((?=\" + wordBoundary + \"]))|((['‘’‛`])(\" + wordBoundary + \"])))\";\n\t} else {\n\t\twordBoundaryEnd = \"($|(\" + wordBoundary + \"])|((['‘’‛`])(\" + wordBoundary + \"])))\";\n\t}\n\n\treturn wordBoundaryStart + matchString + wordBoundaryEnd;\n}\n"],"mappings":";;;;;;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACe,SAAAA,SAAUC,WAAW,EAAEC,iBAAiB,GAAG,KAAK,EAAEC,iBAAiB,GAAG,EAAE,EAAEC,QAAQ,GAAG,EAAE,EAAG;EACxG,IAAIC,YAAY,EAAEC,eAAe;EAEjC,IAAKF,QAAQ,KAAK,IAAI,EAAG;IACxBC,YAAY,GAAG,6CAA6C,GAAGF,iBAAiB,GAAG,IAAI;EACxF,CAAC,MAAM;IACN;AACF;AACA;AACA;AACA;AACA;AACA;AACA;IACEE,YAAY,GAAG,mFAAmF,GAAGF,iBAAiB,GAAG,IAAI;EAC9H;EAEA,MAAMI,iBAAiB,GAAG,KAAK,GAAGF,YAAY,GAAG,SAAS;EAC1D,IAAKH,iBAAiB,EAAG;IACxBI,eAAe,GAAG,SAAS,GAAGD,YAAY,GAAG,iBAAiB,GAAGA,YAAY,GAAG,MAAM;EACvF,CAAC,MAAM;IACNC,eAAe,GAAG,MAAM,GAAGD,YAAY,GAAG,gBAAgB,GAAGA,YAAY,GAAG,MAAM;EACnF;EAEA,OAAOE,iBAAiB,GAAGN,WAAW,GAAGK,eAAe;AACzD","ignoreList":[]}
+{"version":3,"file":"addWordboundary.js","names":["matchString","positiveLookAhead","extraWordBoundary","language","wordBoundary","wordBoundaryEnd","wordBoundaryStart"],"sources":["../../../../src/languageProcessing/helpers/word/addWordboundary.js"],"sourcesContent":["/**\n * Returns a string that can be used in a regex to match a matchString with word boundaries.\n *\n * @param {string}  matchString                 The string to generate a regex string for.\n * @param {boolean} [positiveLookAhead=false]   Boolean indicating whether or not to include a positive look ahead\n * for the word boundaries at the end.\n * @param {string} [extraWordBoundary=\"\"]       Extra characters to match a word boundary on.\n * @param {string} [language=\"\"]                The language used to determine the word boundary.\n *\n * @returns {string} A regex string that matches the matchString with word boundaries.\n */\nexport default function( matchString, positiveLookAhead = false, extraWordBoundary = \"\", language = \"\" ) {\n\tlet wordBoundary, wordBoundaryEnd;\n\n\tif ( language === \"id\" ) {\n\t\twordBoundary = \"[ \\\\u00a0\\\\n\\\\r\\\\t.,()”“〝〞〟‟„\\\"+;!¡?¿:/»«‹›\" + extraWordBoundary + \"<>\";\n\t} else {\n\t\t/*\n\t\t * \\u00a0 - no-break space\n\t\t * \\u2014 - em dash\n         * \\u06d4 - Urdu full stop\n         * \\u061f - Arabic question mark\n         * \\u060C - Arabic comma\n         * \\u061B - Arabic semicolon\n         */\n\t\twordBoundary = \"[ \\\\u00a0\\\\u2014\\\\u06d4\\\\u061f\\\\u060C\\\\u061B\\\\n\\\\r\\\\t.,()”“〝〞〟‟„\\\"+\\\\-;!¡?¿:/»«‹›\" + extraWordBoundary + \"<>\";\n\t}\n\n\tconst wordBoundaryStart = \"(^|\" + wordBoundary + \"'‘’‛`])\";\n\tif ( positiveLookAhead ) {\n\t\twordBoundaryEnd = \"($|((?=\" + wordBoundary + \"]))|((['‘’‛`])(\" + wordBoundary + \"])))\";\n\t} else {\n\t\twordBoundaryEnd = \"($|(\" + wordBoundary + \"])|((['‘’‛`])(\" + wordBoundary + \"])))\";\n\t}\n\n\treturn wordBoundaryStart + matchString + wordBoundaryEnd;\n}\n"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,UAAUA,WAAW,EAAEC,iBAAiB,GAAG,KAAK,EAAEC,iBAAiB,GAAG,EAAE,EAAEC,QAAQ,GAAG,EAAE,EAAG;EACxG,IAAIC,YAAY,EAAEC,eAAe;EAEjC,IAAKF,QAAQ,KAAK,IAAI,EAAG;IACxBC,YAAY,GAAG,6CAA6C,GAAGF,iBAAiB,GAAG,IAAI;EACxF,CAAC,MAAM;IACN;AACF;AACA;AACA;AACA;AACA;AACA;AACA;IACEE,YAAY,GAAG,mFAAmF,GAAGF,iBAAiB,GAAG,IAAI;EAC9H;EAEA,MAAMI,iBAAiB,GAAG,KAAK,GAAGF,YAAY,GAAG,SAAS;EAC1D,IAAKH,iBAAiB,EAAG;IACxBI,eAAe,GAAG,SAAS,GAAGD,YAAY,GAAG,iBAAiB,GAAGA,YAAY,GAAG,MAAM;EACvF,CAAC,MAAM;IACNC,eAAe,GAAG,MAAM,GAAGD,YAAY,GAAG,gBAAgB,GAAGA,YAAY,GAAG,MAAM;EACnF;EAEA,OAAOE,iBAAiB,GAAGN,WAAW,GAAGK,eAAe;AACzD","ignoreList":[]}

package/build/languageProcessing/helpers/word/areWordsInSentence.js

@@ -1,12 +1,6 @@
-"use strict";
+import { filter } from "lodash";
+import getWords from "./getWords.js";
 
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = areWordsInSentence;
-var _lodash = require("lodash");
-var _getWords = _interopRequireDefault(require("./getWords.js"));
-function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e }; }
 /**
  * Checks if one or more words of a list occur in a sentence.
  *
@@ -14,8 +8,8 @@ function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e
  * @param {string} sentence The sentence to match against.
  * @returns {Boolean} Whether the sentence contains the word.
  */
-function areWordsInSentence(words, sentence) {
-  const matches = (0, _lodash.filter)((0, _getWords.default)(sentence), function (word) {
+export default function areWordsInSentence(words, sentence) {
+  const matches = filter(getWords(sentence), function (word) {
     return words.includes(word.toLocaleLowerCase());
   });
   return matches.length !== 0;

package/build/languageProcessing/helpers/word/areWordsInSentence.js.map

@@ -1 +1 @@
-{"version":3,"file":"areWordsInSentence.js","names":["_lodash","require","_getWords","_interopRequireDefault","e","__esModule","default","areWordsInSentence","words","sentence","matches","filter","getWords","word","includes","toLocaleLowerCase","length"],"sources":["../../../../src/languageProcessing/helpers/word/areWordsInSentence.js"],"sourcesContent":["import { filter } from \"lodash\";\nimport getWords from \"./getWords.js\";\n\n/**\n * Checks if one or more words of a list occur in a sentence.\n *\n * @param {Array} words The list of words.\n * @param {string} sentence The sentence to match against.\n * @returns {Boolean} Whether the sentence contains the word.\n */\nexport default function areWordsInSentence( words, sentence ) {\n\tconst matches = filter( getWords( sentence ), function( word ) {\n\t\treturn words.includes( word.toLocaleLowerCase() );\n\t} );\n\treturn matches.length !== 0;\n}\n"],"mappings":";;;;;;AAAA,IAAAA,OAAA,GAAAC,OAAA;AACA,IAAAC,SAAA,GAAAC,sBAAA,CAAAF,OAAA;AAAqC,SAAAE,uBAAAC,CAAA,WAAAA,CAAA,IAAAA,CAAA,CAAAC,UAAA,GAAAD,CAAA,KAAAE,OAAA,EAAAF,CAAA;AAErC;AACA;AACA;AACA;AACA;AACA;AACA;AACe,SAASG,kBAAkBA,CAAEC,KAAK,EAAEC,QAAQ,EAAG;EAC7D,MAAMC,OAAO,GAAG,IAAAC,cAAM,EAAE,IAAAC,iBAAQ,EAAEH,QAAS,CAAC,EAAE,UAAUI,IAAI,EAAG;IAC9D,OAAOL,KAAK,CAACM,QAAQ,CAAED,IAAI,CAACE,iBAAiB,CAAC,CAAE,CAAC;EAClD,CAAE,CAAC;EACH,OAAOL,OAAO,CAACM,MAAM,KAAK,CAAC;AAC5B","ignoreList":[]}
+{"version":3,"file":"areWordsInSentence.js","names":["filter","getWords","areWordsInSentence","words","sentence","matches","word","includes","toLocaleLowerCase","length"],"sources":["../../../../src/languageProcessing/helpers/word/areWordsInSentence.js"],"sourcesContent":["import { filter } from \"lodash\";\nimport getWords from \"./getWords.js\";\n\n/**\n * Checks if one or more words of a list occur in a sentence.\n *\n * @param {Array} words The list of words.\n * @param {string} sentence The sentence to match against.\n * @returns {Boolean} Whether the sentence contains the word.\n */\nexport default function areWordsInSentence( words, sentence ) {\n\tconst matches = filter( getWords( sentence ), function( word ) {\n\t\treturn words.includes( word.toLocaleLowerCase() );\n\t} );\n\treturn matches.length !== 0;\n}\n"],"mappings":"AAAA,SAASA,MAAM,QAAQ,QAAQ;AAC/B,OAAOC,QAAQ;;AAEf;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAASC,kBAAkBA,CAAEC,KAAK,EAAEC,QAAQ,EAAG;EAC7D,MAAMC,OAAO,GAAGL,MAAM,CAAEC,QAAQ,CAAEG,QAAS,CAAC,EAAE,UAAUE,IAAI,EAAG;IAC9D,OAAOH,KAAK,CAACI,QAAQ,CAAED,IAAI,CAACE,iBAAiB,CAAC,CAAE,CAAC;EAClD,CAAE,CAAC;EACH,OAAOH,OAAO,CAACI,MAAM,KAAK,CAAC;AAC5B","ignoreList":[]}

package/build/languageProcessing/helpers/word/countMetaDescriptionLength.js

@@ -1,9 +1,3 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = _default;
 /**
  * Check the length of the description.
  *
@@ -12,7 +6,7 @@ exports.default = _default;
  *
  * @returns {number} The length of the description.
  */
-function _default(date, description) {
+export default function (date, description) {
   let descriptionLength = description.length;
   /* If the meta description is preceded by a date, two spaces and a hyphen (" - ") are added as well. Therefore,
   three needs to be added to the total length. */

package/build/languageProcessing/helpers/word/countMetaDescriptionLength.js.map

@@ -1 +1 @@
-{"version":3,"file":"countMetaDescriptionLength.js","names":["_default","date","description","descriptionLength","length"],"sources":["../../../../src/languageProcessing/helpers/word/countMetaDescriptionLength.js"],"sourcesContent":["/**\n * Check the length of the description.\n *\n * @param {string}  date          The date.\n * @param {string}  description   The meta description.\n *\n * @returns {number} The length of the description.\n */\nexport default function( date, description ) {\n\tlet descriptionLength = description.length;\n\t/* If the meta description is preceded by a date, two spaces and a hyphen (\" - \") are added as well. Therefore,\n\tthree needs to be added to the total length. */\n\tif ( date !== \"\" && descriptionLength > 0 ) {\n\t\tdescriptionLength += date.length + 3;\n\t}\n\n\treturn descriptionLength;\n}\n"],"mappings":";;;;;;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACe,SAAAA,SAAUC,IAAI,EAAEC,WAAW,EAAG;EAC5C,IAAIC,iBAAiB,GAAGD,WAAW,CAACE,MAAM;EAC1C;AACD;EACC,IAAKH,IAAI,KAAK,EAAE,IAAIE,iBAAiB,GAAG,CAAC,EAAG;IAC3CA,iBAAiB,IAAIF,IAAI,CAACG,MAAM,GAAG,CAAC;EACrC;EAEA,OAAOD,iBAAiB;AACzB","ignoreList":[]}
+{"version":3,"file":"countMetaDescriptionLength.js","names":["date","description","descriptionLength","length"],"sources":["../../../../src/languageProcessing/helpers/word/countMetaDescriptionLength.js"],"sourcesContent":["/**\n * Check the length of the description.\n *\n * @param {string}  date          The date.\n * @param {string}  description   The meta description.\n *\n * @returns {number} The length of the description.\n */\nexport default function( date, description ) {\n\tlet descriptionLength = description.length;\n\t/* If the meta description is preceded by a date, two spaces and a hyphen (\" - \") are added as well. Therefore,\n\tthree needs to be added to the total length. */\n\tif ( date !== \"\" && descriptionLength > 0 ) {\n\t\tdescriptionLength += date.length + 3;\n\t}\n\n\treturn descriptionLength;\n}\n"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,UAAUA,IAAI,EAAEC,WAAW,EAAG;EAC5C,IAAIC,iBAAiB,GAAGD,WAAW,CAACE,MAAM;EAC1C;AACD;EACC,IAAKH,IAAI,KAAK,EAAE,IAAIE,iBAAiB,GAAG,CAAC,EAAG;IAC3CA,iBAAiB,IAAIF,IAAI,CAACG,MAAM,GAAG,CAAC;EACrC;EAEA,OAAOD,iBAAiB;AACzB","ignoreList":[]}

package/build/languageProcessing/helpers/word/countWords.js

@@ -1,13 +1,7 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = _default;
-var _getWords = _interopRequireDefault(require("./getWords.js"));
-function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e }; }
 /** @module stringProcessing/countWords */
 
+import getWords from "./getWords.js";
+
 /**
  * Calculates the word count of a certain text.
  *
@@ -15,7 +9,7 @@ function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e
  *
  * @returns {number} The word count of the given text.
  */
-function _default(text) {
-  return (0, _getWords.default)(text).length;
+export default function (text) {
+  return getWords(text).length;
 }
 //# sourceMappingURL=countWords.js.map

package/build/languageProcessing/helpers/word/countWords.js.map

@@ -1 +1 @@
-{"version":3,"file":"countWords.js","names":["_getWords","_interopRequireDefault","require","e","__esModule","default","_default","text","getWords","length"],"sources":["../../../../src/languageProcessing/helpers/word/countWords.js"],"sourcesContent":["/** @module stringProcessing/countWords */\n\nimport getWords from \"./getWords.js\";\n\n/**\n * Calculates the word count of a certain text.\n *\n * @param {string} text The text to be counted.\n *\n * @returns {number} The word count of the given text.\n */\nexport default function( text ) {\n\treturn getWords( text ).length;\n}\n"],"mappings":";;;;;;AAEA,IAAAA,SAAA,GAAAC,sBAAA,CAAAC,OAAA;AAAqC,SAAAD,uBAAAE,CAAA,WAAAA,CAAA,IAAAA,CAAA,CAAAC,UAAA,GAAAD,CAAA,KAAAE,OAAA,EAAAF,CAAA;AAFrC;;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;AACe,SAAAG,SAAUC,IAAI,EAAG;EAC/B,OAAO,IAAAC,iBAAQ,EAAED,IAAK,CAAC,CAACE,MAAM;AAC/B","ignoreList":[]}
+{"version":3,"file":"countWords.js","names":["getWords","text","length"],"sources":["../../../../src/languageProcessing/helpers/word/countWords.js"],"sourcesContent":["/** @module stringProcessing/countWords */\n\nimport getWords from \"./getWords.js\";\n\n/**\n * Calculates the word count of a certain text.\n *\n * @param {string} text The text to be counted.\n *\n * @returns {number} The word count of the given text.\n */\nexport default function( text ) {\n\treturn getWords( text ).length;\n}\n"],"mappings":"AAAA;;AAEA,OAAOA,QAAQ;;AAEf;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,UAAUC,IAAI,EAAG;EAC/B,OAAOD,QAAQ,CAAEC,IAAK,CAAC,CAACC,MAAM;AAC/B","ignoreList":[]}

package/build/languageProcessing/helpers/word/createPunctuationTokens.js

@@ -1,11 +1,6 @@
-"use strict";
+import { punctuationRegexEnd, punctuationRegexStart } from "../sanitize/removePunctuation";
+import { hashedHtmlEntitiesRegexEnd, hashedHtmlEntitiesRegexStart } from "../../../helpers/htmlEntities";
 
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = void 0;
-var _removePunctuation = require("../sanitize/removePunctuation");
-var _htmlEntities = require("../../../helpers/htmlEntities");
 /**
  * Removes punctuation from the beginning and end of a word token, and creates separate tokens from them.
  *
@@ -23,13 +18,13 @@ const createPunctuationTokens = rawTokens => {
 
     // Add all punctuation marks that occur before the first letter of the token to the pretokens array.
     // Also, prevent matching with a hashed HTML entity in the beginning of the token.
-    while (_removePunctuation.punctuationRegexStart.test(token) && !_htmlEntities.hashedHtmlEntitiesRegexStart.test(token)) {
+    while (punctuationRegexStart.test(token) && !hashedHtmlEntitiesRegexStart.test(token)) {
       preTokens.push(token[0]);
       token = token.slice(1);
     }
     // Add all punctuation marks that occur after the last letter of the token to the posttokens array.
     // Also, prevent matching with a hashed HTML entity at the end of the token.
-    while (_removePunctuation.punctuationRegexEnd.test(token) && !_htmlEntities.hashedHtmlEntitiesRegexEnd.test(token)) {
+    while (punctuationRegexEnd.test(token) && !hashedHtmlEntitiesRegexEnd.test(token)) {
       // Using unshift here because we are iterating from the end of the string to the beginning,
       // and we want to keep the order of the punctuation marks.
       // Therefore, we add them to the start of the array.
@@ -42,5 +37,5 @@ const createPunctuationTokens = rawTokens => {
   });
   return tokenTexts;
 };
-var _default = exports.default = createPunctuationTokens;
+export default createPunctuationTokens;
 //# sourceMappingURL=createPunctuationTokens.js.map

package/build/languageProcessing/helpers/word/createPunctuationTokens.js.map

@@ -1 +1 @@
-{"version":3,"file":"createPunctuationTokens.js","names":["_removePunctuation","require","_htmlEntities","createPunctuationTokens","rawTokens","tokenTexts","forEach","token","preTokens","postTokens","punctuationRegexStart","test","hashedHtmlEntitiesRegexStart","push","slice","punctuationRegexEnd","hashedHtmlEntitiesRegexEnd","unshift","length","currentTokens","filter","x","_default","exports","default"],"sources":["../../../../src/languageProcessing/helpers/word/createPunctuationTokens.js"],"sourcesContent":["import { punctuationRegexEnd, punctuationRegexStart } from \"../sanitize/removePunctuation\";\nimport { hashedHtmlEntitiesRegexEnd, hashedHtmlEntitiesRegexStart } from \"../../../helpers/htmlEntities\";\n\n/**\n * Removes punctuation from the beginning and end of a word token, and creates separate tokens from them.\n *\n * @param {string[]} rawTokens\tThe tokens that may contain punctuation at the beginning and end of words.\n *\n * @returns {string[]} The tokens with the punctuation moved into separate tokens.\n */\nconst createPunctuationTokens = ( rawTokens ) => {\n\tconst tokenTexts = [];\n\trawTokens.forEach( token => {\n\t\t// Pretokens contains all that occurs before the first letter of the token.\n\t\tconst preTokens = [];\n\t\t// Posttokens contains all that occurs after the last letter of the token.\n\t\tconst postTokens = [];\n\n\t\t// Add all punctuation marks that occur before the first letter of the token to the pretokens array.\n\t\t// Also, prevent matching with a hashed HTML entity in the beginning of the token.\n\t\twhile ( punctuationRegexStart.test( token ) && ! hashedHtmlEntitiesRegexStart.test( token ) ) {\n\t\t\tpreTokens.push( token[ 0 ] );\n\t\t\ttoken = token.slice( 1 );\n\t\t}\n\t\t// Add all punctuation marks that occur after the last letter of the token to the posttokens array.\n\t\t// Also, prevent matching with a hashed HTML entity at the end of the token.\n\t\twhile ( punctuationRegexEnd.test( token ) && ! hashedHtmlEntitiesRegexEnd.test( token ) ) {\n\t\t\t// Using unshift here because we are iterating from the end of the string to the beginning,\n\t\t\t// and we want to keep the order of the punctuation marks.\n\t\t\t// Therefore, we add them to the start of the array.\n\t\t\tpostTokens.unshift( token[ token.length - 1 ] );\n\t\t\ttoken = token.slice( 0, -1 );\n\t\t}\n\n\t\tlet currentTokens = [ ...preTokens, token, ...postTokens ];\n\t\tcurrentTokens = currentTokens.filter( x => x !== \"\" );\n\t\ttokenTexts.push( ...currentTokens );\n\t} );\n\treturn tokenTexts;\n};\n\nexport default createPunctuationTokens;\n"],"mappings":";;;;;;AAAA,IAAAA,kBAAA,GAAAC,OAAA;AACA,IAAAC,aAAA,GAAAD,OAAA;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAME,uBAAuB,GAAKC,SAAS,IAAM;EAChD,MAAMC,UAAU,GAAG,EAAE;EACrBD,SAAS,CAACE,OAAO,CAAEC,KAAK,IAAI;IAC3B;IACA,MAAMC,SAAS,GAAG,EAAE;IACpB;IACA,MAAMC,UAAU,GAAG,EAAE;;IAErB;IACA;IACA,OAAQC,wCAAqB,CAACC,IAAI,CAAEJ,KAAM,CAAC,IAAI,CAAEK,0CAA4B,CAACD,IAAI,CAAEJ,KAAM,CAAC,EAAG;MAC7FC,SAAS,CAACK,IAAI,CAAEN,KAAK,CAAE,CAAC,CAAG,CAAC;MAC5BA,KAAK,GAAGA,KAAK,CAACO,KAAK,CAAE,CAAE,CAAC;IACzB;IACA;IACA;IACA,OAAQC,sCAAmB,CAACJ,IAAI,CAAEJ,KAAM,CAAC,IAAI,CAAES,wCAA0B,CAACL,IAAI,CAAEJ,KAAM,CAAC,EAAG;MACzF;MACA;MACA;MACAE,UAAU,CAACQ,OAAO,CAAEV,KAAK,CAAEA,KAAK,CAACW,MAAM,GAAG,CAAC,CAAG,CAAC;MAC/CX,KAAK,GAAGA,KAAK,CAACO,KAAK,CAAE,CAAC,EAAE,CAAC,CAAE,CAAC;IAC7B;IAEA,IAAIK,aAAa,GAAG,CAAE,GAAGX,SAAS,EAAED,KAAK,EAAE,GAAGE,UAAU,CAAE;IAC1DU,aAAa,GAAGA,aAAa,CAACC,MAAM,CAAEC,CAAC,IAAIA,CAAC,KAAK,EAAG,CAAC;IACrDhB,UAAU,CAACQ,IAAI,CAAE,GAAGM,aAAc,CAAC;EACpC,CAAE,CAAC;EACH,OAAOd,UAAU;AAClB,CAAC;AAAC,IAAAiB,QAAA,GAAAC,OAAA,CAAAC,OAAA,GAEarB,uBAAuB","ignoreList":[]}
+{"version":3,"file":"createPunctuationTokens.js","names":["punctuationRegexEnd","punctuationRegexStart","hashedHtmlEntitiesRegexEnd","hashedHtmlEntitiesRegexStart","createPunctuationTokens","rawTokens","tokenTexts","forEach","token","preTokens","postTokens","test","push","slice","unshift","length","currentTokens","filter","x"],"sources":["../../../../src/languageProcessing/helpers/word/createPunctuationTokens.js"],"sourcesContent":["import { punctuationRegexEnd, punctuationRegexStart } from \"../sanitize/removePunctuation\";\nimport { hashedHtmlEntitiesRegexEnd, hashedHtmlEntitiesRegexStart } from \"../../../helpers/htmlEntities\";\n\n/**\n * Removes punctuation from the beginning and end of a word token, and creates separate tokens from them.\n *\n * @param {string[]} rawTokens\tThe tokens that may contain punctuation at the beginning and end of words.\n *\n * @returns {string[]} The tokens with the punctuation moved into separate tokens.\n */\nconst createPunctuationTokens = ( rawTokens ) => {\n\tconst tokenTexts = [];\n\trawTokens.forEach( token => {\n\t\t// Pretokens contains all that occurs before the first letter of the token.\n\t\tconst preTokens = [];\n\t\t// Posttokens contains all that occurs after the last letter of the token.\n\t\tconst postTokens = [];\n\n\t\t// Add all punctuation marks that occur before the first letter of the token to the pretokens array.\n\t\t// Also, prevent matching with a hashed HTML entity in the beginning of the token.\n\t\twhile ( punctuationRegexStart.test( token ) && ! hashedHtmlEntitiesRegexStart.test( token ) ) {\n\t\t\tpreTokens.push( token[ 0 ] );\n\t\t\ttoken = token.slice( 1 );\n\t\t}\n\t\t// Add all punctuation marks that occur after the last letter of the token to the posttokens array.\n\t\t// Also, prevent matching with a hashed HTML entity at the end of the token.\n\t\twhile ( punctuationRegexEnd.test( token ) && ! hashedHtmlEntitiesRegexEnd.test( token ) ) {\n\t\t\t// Using unshift here because we are iterating from the end of the string to the beginning,\n\t\t\t// and we want to keep the order of the punctuation marks.\n\t\t\t// Therefore, we add them to the start of the array.\n\t\t\tpostTokens.unshift( token[ token.length - 1 ] );\n\t\t\ttoken = token.slice( 0, -1 );\n\t\t}\n\n\t\tlet currentTokens = [ ...preTokens, token, ...postTokens ];\n\t\tcurrentTokens = currentTokens.filter( x => x !== \"\" );\n\t\ttokenTexts.push( ...currentTokens );\n\t} );\n\treturn tokenTexts;\n};\n\nexport default createPunctuationTokens;\n"],"mappings":"AAAA,SAASA,mBAAmB,EAAEC,qBAAqB;AACnD,SAASC,0BAA0B,EAAEC,4BAA4B;;AAEjE;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,uBAAuB,GAAKC,SAAS,IAAM;EAChD,MAAMC,UAAU,GAAG,EAAE;EACrBD,SAAS,CAACE,OAAO,CAAEC,KAAK,IAAI;IAC3B;IACA,MAAMC,SAAS,GAAG,EAAE;IACpB;IACA,MAAMC,UAAU,GAAG,EAAE;;IAErB;IACA;IACA,OAAQT,qBAAqB,CAACU,IAAI,CAAEH,KAAM,CAAC,IAAI,CAAEL,4BAA4B,CAACQ,IAAI,CAAEH,KAAM,CAAC,EAAG;MAC7FC,SAAS,CAACG,IAAI,CAAEJ,KAAK,CAAE,CAAC,CAAG,CAAC;MAC5BA,KAAK,GAAGA,KAAK,CAACK,KAAK,CAAE,CAAE,CAAC;IACzB;IACA;IACA;IACA,OAAQb,mBAAmB,CAACW,IAAI,CAAEH,KAAM,CAAC,IAAI,CAAEN,0BAA0B,CAACS,IAAI,CAAEH,KAAM,CAAC,EAAG;MACzF;MACA;MACA;MACAE,UAAU,CAACI,OAAO,CAAEN,KAAK,CAAEA,KAAK,CAACO,MAAM,GAAG,CAAC,CAAG,CAAC;MAC/CP,KAAK,GAAGA,KAAK,CAACK,KAAK,CAAE,CAAC,EAAE,CAAC,CAAE,CAAC;IAC7B;IAEA,IAAIG,aAAa,GAAG,CAAE,GAAGP,SAAS,EAAED,KAAK,EAAE,GAAGE,UAAU,CAAE;IAC1DM,aAAa,GAAGA,aAAa,CAACC,MAAM,CAAEC,CAAC,IAAIA,CAAC,KAAK,EAAG,CAAC;IACrDZ,UAAU,CAACM,IAAI,CAAE,GAAGI,aAAc,CAAC;EACpC,CAAE,CAAC;EACH,OAAOV,UAAU;AAClB,CAAC;AAED,eAAeF,uBAAuB","ignoreList":[]}

package/build/languageProcessing/helpers/word/filterWordsFromArray.js

@@ -1,10 +1,5 @@
-"use strict";
+import { filter, includes } from "lodash";
 
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = filterWordsFromArray;
-var _lodash = require("lodash");
 /**
  * Filters certain words from an array of words.
  *
@@ -13,9 +8,9 @@ var _lodash = require("lodash");
  *
  * @returns {Array} The original array with the certain words filtered out.
  */
-function filterWordsFromArray(array, words = []) {
-  return (0, _lodash.filter)(array, function (word) {
-    return !(0, _lodash.includes)(words, word.trim().toLocaleLowerCase());
+export default function filterWordsFromArray(array, words = []) {
+  return filter(array, function (word) {
+    return !includes(words, word.trim().toLocaleLowerCase());
   });
 }
 //# sourceMappingURL=filterWordsFromArray.js.map

package/build/languageProcessing/helpers/word/filterWordsFromArray.js.map

@@ -1 +1 @@
-{"version":3,"file":"filterWordsFromArray.js","names":["_lodash","require","filterWordsFromArray","array","words","filter","word","includes","trim","toLocaleLowerCase"],"sources":["../../../../src/languageProcessing/helpers/word/filterWordsFromArray.js"],"sourcesContent":["import { filter, includes } from \"lodash\";\n\n/**\n * Filters certain words from an array of words.\n *\n * @param {Array} array The words to check.\n * @param {Array} words The words to filter.\n *\n * @returns {Array} The original array with the certain words filtered out.\n */\nexport default function filterWordsFromArray( array, words = [] ) {\n\treturn filter( array, function( word ) {\n\t\treturn ( ! includes( words, word.trim().toLocaleLowerCase() ) );\n\t} );\n}\n"],"mappings":";;;;;;AAAA,IAAAA,OAAA,GAAAC,OAAA;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACe,SAASC,oBAAoBA,CAAEC,KAAK,EAAEC,KAAK,GAAG,EAAE,EAAG;EACjE,OAAO,IAAAC,cAAM,EAAEF,KAAK,EAAE,UAAUG,IAAI,EAAG;IACtC,OAAS,CAAE,IAAAC,gBAAQ,EAAEH,KAAK,EAAEE,IAAI,CAACE,IAAI,CAAC,CAAC,CAACC,iBAAiB,CAAC,CAAE,CAAC;EAC9D,CAAE,CAAC;AACJ","ignoreList":[]}
+{"version":3,"file":"filterWordsFromArray.js","names":["filter","includes","filterWordsFromArray","array","words","word","trim","toLocaleLowerCase"],"sources":["../../../../src/languageProcessing/helpers/word/filterWordsFromArray.js"],"sourcesContent":["import { filter, includes } from \"lodash\";\n\n/**\n * Filters certain words from an array of words.\n *\n * @param {Array} array The words to check.\n * @param {Array} words The words to filter.\n *\n * @returns {Array} The original array with the certain words filtered out.\n */\nexport default function filterWordsFromArray( array, words = [] ) {\n\treturn filter( array, function( word ) {\n\t\treturn ( ! includes( words, word.trim().toLocaleLowerCase() ) );\n\t} );\n}\n"],"mappings":"AAAA,SAASA,MAAM,EAAEC,QAAQ,QAAQ,QAAQ;;AAEzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAASC,oBAAoBA,CAAEC,KAAK,EAAEC,KAAK,GAAG,EAAE,EAAG;EACjE,OAAOJ,MAAM,CAAEG,KAAK,EAAE,UAAUE,IAAI,EAAG;IACtC,OAAS,CAAEJ,QAAQ,CAAEG,KAAK,EAAEC,IAAI,CAACC,IAAI,CAAC,CAAC,CAACC,iBAAiB,CAAC,CAAE,CAAC;EAC9D,CAAE,CAAC;AACJ","ignoreList":[]}

package/build/languageProcessing/helpers/word/followsIndex.js

@@ -1,10 +1,5 @@
-"use strict";
+import { isEmpty, forEach, includes } from "lodash";
 
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = _default;
-var _lodash = require("lodash");
 /**
  * Checks whether a given word is followed by any word from a given list.
  *
@@ -13,17 +8,17 @@ var _lodash = require("lodash");
  *
  * @returns {boolean} Returns true if the match is followed by a given word, otherwise returns false.
  */
-function _default(followingWords, match) {
-  if ((0, _lodash.isEmpty)(followingWords)) {
+export default function (followingWords, match) {
+  if (isEmpty(followingWords)) {
     return false;
   }
 
   // The followingWordIndices include the preceding space.
   const wordAfterMatchIndex = match.index + match.match.length;
   const followingWordsIndices = [];
-  (0, _lodash.forEach)(followingWords, function (followingWord) {
+  forEach(followingWords, function (followingWord) {
     followingWordsIndices.push(followingWord.index);
   });
-  return (0, _lodash.includes)(followingWordsIndices, wordAfterMatchIndex);
+  return includes(followingWordsIndices, wordAfterMatchIndex);
 }
 //# sourceMappingURL=followsIndex.js.map

package/build/languageProcessing/helpers/word/followsIndex.js.map

@@ -1 +1 @@
-{"version":3,"file":"followsIndex.js","names":["_lodash","require","_default","followingWords","match","isEmpty","wordAfterMatchIndex","index","length","followingWordsIndices","forEach","followingWord","push","includes"],"sources":["../../../../src/languageProcessing/helpers/word/followsIndex.js"],"sourcesContent":["import { isEmpty, forEach, includes } from \"lodash\";\n\n/**\n * Checks whether a given word is followed by any word from a given list.\n *\n * @param {Array} followingWords    The array of objects with matches and indices.\n * @param {Object} match            The object with the match and index to test the following words for.\n *\n * @returns {boolean} Returns true if the match is followed by a given word, otherwise returns false.\n */\nexport default function( followingWords, match ) {\n\tif ( isEmpty( followingWords ) ) {\n\t\treturn false;\n\t}\n\n\t// The followingWordIndices include the preceding space.\n\tconst wordAfterMatchIndex = match.index + match.match.length;\n\tconst followingWordsIndices = [];\n\n\tforEach( followingWords, function( followingWord ) {\n\t\tfollowingWordsIndices.push( followingWord.index );\n\t} );\n\n\treturn includes( followingWordsIndices, wordAfterMatchIndex );\n}\n"],"mappings":";;;;;;AAAA,IAAAA,OAAA,GAAAC,OAAA;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACe,SAAAC,SAAUC,cAAc,EAAEC,KAAK,EAAG;EAChD,IAAK,IAAAC,eAAO,EAAEF,cAAe,CAAC,EAAG;IAChC,OAAO,KAAK;EACb;;EAEA;EACA,MAAMG,mBAAmB,GAAGF,KAAK,CAACG,KAAK,GAAGH,KAAK,CAACA,KAAK,CAACI,MAAM;EAC5D,MAAMC,qBAAqB,GAAG,EAAE;EAEhC,IAAAC,eAAO,EAAEP,cAAc,EAAE,UAAUQ,aAAa,EAAG;IAClDF,qBAAqB,CAACG,IAAI,CAAED,aAAa,CAACJ,KAAM,CAAC;EAClD,CAAE,CAAC;EAEH,OAAO,IAAAM,gBAAQ,EAAEJ,qBAAqB,EAAEH,mBAAoB,CAAC;AAC9D","ignoreList":[]}
+{"version":3,"file":"followsIndex.js","names":["isEmpty","forEach","includes","followingWords","match","wordAfterMatchIndex","index","length","followingWordsIndices","followingWord","push"],"sources":["../../../../src/languageProcessing/helpers/word/followsIndex.js"],"sourcesContent":["import { isEmpty, forEach, includes } from \"lodash\";\n\n/**\n * Checks whether a given word is followed by any word from a given list.\n *\n * @param {Array} followingWords    The array of objects with matches and indices.\n * @param {Object} match            The object with the match and index to test the following words for.\n *\n * @returns {boolean} Returns true if the match is followed by a given word, otherwise returns false.\n */\nexport default function( followingWords, match ) {\n\tif ( isEmpty( followingWords ) ) {\n\t\treturn false;\n\t}\n\n\t// The followingWordIndices include the preceding space.\n\tconst wordAfterMatchIndex = match.index + match.match.length;\n\tconst followingWordsIndices = [];\n\n\tforEach( followingWords, function( followingWord ) {\n\t\tfollowingWordsIndices.push( followingWord.index );\n\t} );\n\n\treturn includes( followingWordsIndices, wordAfterMatchIndex );\n}\n"],"mappings":"AAAA,SAASA,OAAO,EAAEC,OAAO,EAAEC,QAAQ,QAAQ,QAAQ;;AAEnD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,UAAUC,cAAc,EAAEC,KAAK,EAAG;EAChD,IAAKJ,OAAO,CAAEG,cAAe,CAAC,EAAG;IAChC,OAAO,KAAK;EACb;;EAEA;EACA,MAAME,mBAAmB,GAAGD,KAAK,CAACE,KAAK,GAAGF,KAAK,CAACA,KAAK,CAACG,MAAM;EAC5D,MAAMC,qBAAqB,GAAG,EAAE;EAEhCP,OAAO,CAAEE,cAAc,EAAE,UAAUM,aAAa,EAAG;IAClDD,qBAAqB,CAACE,IAAI,CAAED,aAAa,CAACH,KAAM,CAAC;EAClD,CAAE,CAAC;EAEH,OAAOJ,QAAQ,CAAEM,qBAAqB,EAAEH,mBAAoB,CAAC;AAC9D","ignoreList":[]}

package/build/languageProcessing/helpers/word/getAllWordsFromTree.js

@@ -1,13 +1,7 @@
-"use strict";
+import getSentencesFromTree from "../sentence/getSentencesFromTree";
+import { flatMap } from "lodash";
+import removePunctuation from "../sanitize/removePunctuation";
 
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = _default;
-var _getSentencesFromTree = _interopRequireDefault(require("../sentence/getSentencesFromTree"));
-var _lodash = require("lodash");
-var _removePunctuation = _interopRequireDefault(require("../sanitize/removePunctuation"));
-function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e }; }
 /**
  * Gets the words from the tree, i.e. from the paragraph and heading nodes.
  * These two node types are the nodes that should contain words for the analysis.
@@ -16,13 +10,13 @@ function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e
  *
  * @returns {String[]} Array of words retrieved from the tree.
  */
-function _default(paper) {
-  const sentences = (0, _getSentencesFromTree.default)(paper);
+export default function (paper) {
+  const sentences = getSentencesFromTree(paper);
   // Get all the tokens from each sentence.
   const tokens = sentences.map(sentence => sentence.tokens);
-  let words = (0, _lodash.flatMap)(tokens).map(token => token.text);
+  let words = flatMap(tokens).map(token => token.text);
   // Remove punctuation and spaces.
-  words = words.map(token => (0, _removePunctuation.default)(token));
+  words = words.map(token => removePunctuation(token));
 
   // Filter out empty tokens.
   return words.filter(word => word.trim() !== "");

package/build/languageProcessing/helpers/word/getAllWordsFromTree.js.map

@@ -1 +1 @@
-{"version":3,"file":"getAllWordsFromTree.js","names":["_getSentencesFromTree","_interopRequireDefault","require","_lodash","_removePunctuation","e","__esModule","default","_default","paper","sentences","getSentencesFromTree","tokens","map","sentence","words","flatMap","token","text","removePunctuation","filter","word","trim"],"sources":["../../../../src/languageProcessing/helpers/word/getAllWordsFromTree.js"],"sourcesContent":["import getSentencesFromTree from \"../sentence/getSentencesFromTree\";\nimport { flatMap } from \"lodash\";\nimport removePunctuation from \"../sanitize/removePunctuation\";\n\n/**\n * Gets the words from the tree, i.e. from the paragraph and heading nodes.\n * These two node types are the nodes that should contain words for the analysis.\n *\n * @param {Paper} paper The paper to get the tree and words from.\n *\n * @returns {String[]} Array of words retrieved from the tree.\n */\nexport default function( paper ) {\n\tconst sentences = getSentencesFromTree( paper );\n\t// Get all the tokens from each sentence.\n\tconst tokens = sentences.map( sentence => sentence.tokens );\n\tlet words = flatMap( tokens ).map( token => token.text );\n\t// Remove punctuation and spaces.\n\twords = words.map( token => removePunctuation( token ) );\n\n\t// Filter out empty tokens.\n\treturn words.filter( word => word.trim() !== \"\" );\n}\n"],"mappings":";;;;;;AAAA,IAAAA,qBAAA,GAAAC,sBAAA,CAAAC,OAAA;AACA,IAAAC,OAAA,GAAAD,OAAA;AACA,IAAAE,kBAAA,GAAAH,sBAAA,CAAAC,OAAA;AAA8D,SAAAD,uBAAAI,CAAA,WAAAA,CAAA,IAAAA,CAAA,CAAAC,UAAA,GAAAD,CAAA,KAAAE,OAAA,EAAAF,CAAA;AAE9D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACe,SAAAG,SAAUC,KAAK,EAAG;EAChC,MAAMC,SAAS,GAAG,IAAAC,6BAAoB,EAAEF,KAAM,CAAC;EAC/C;EACA,MAAMG,MAAM,GAAGF,SAAS,CAACG,GAAG,CAAEC,QAAQ,IAAIA,QAAQ,CAACF,MAAO,CAAC;EAC3D,IAAIG,KAAK,GAAG,IAAAC,eAAO,EAAEJ,MAAO,CAAC,CAACC,GAAG,CAAEI,KAAK,IAAIA,KAAK,CAACC,IAAK,CAAC;EACxD;EACAH,KAAK,GAAGA,KAAK,CAACF,GAAG,CAAEI,KAAK,IAAI,IAAAE,0BAAiB,EAAEF,KAAM,CAAE,CAAC;;EAExD;EACA,OAAOF,KAAK,CAACK,MAAM,CAAEC,IAAI,IAAIA,IAAI,CAACC,IAAI,CAAC,CAAC,KAAK,EAAG,CAAC;AAClD","ignoreList":[]}
+{"version":3,"file":"getAllWordsFromTree.js","names":["getSentencesFromTree","flatMap","removePunctuation","paper","sentences","tokens","map","sentence","words","token","text","filter","word","trim"],"sources":["../../../../src/languageProcessing/helpers/word/getAllWordsFromTree.js"],"sourcesContent":["import getSentencesFromTree from \"../sentence/getSentencesFromTree\";\nimport { flatMap } from \"lodash\";\nimport removePunctuation from \"../sanitize/removePunctuation\";\n\n/**\n * Gets the words from the tree, i.e. from the paragraph and heading nodes.\n * These two node types are the nodes that should contain words for the analysis.\n *\n * @param {Paper} paper The paper to get the tree and words from.\n *\n * @returns {String[]} Array of words retrieved from the tree.\n */\nexport default function( paper ) {\n\tconst sentences = getSentencesFromTree( paper );\n\t// Get all the tokens from each sentence.\n\tconst tokens = sentences.map( sentence => sentence.tokens );\n\tlet words = flatMap( tokens ).map( token => token.text );\n\t// Remove punctuation and spaces.\n\twords = words.map( token => removePunctuation( token ) );\n\n\t// Filter out empty tokens.\n\treturn words.filter( word => word.trim() !== \"\" );\n}\n"],"mappings":"AAAA,OAAOA,oBAAoB;AAC3B,SAASC,OAAO,QAAQ,QAAQ;AAChC,OAAOC,iBAAiB;;AAExB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,UAAUC,KAAK,EAAG;EAChC,MAAMC,SAAS,GAAGJ,oBAAoB,CAAEG,KAAM,CAAC;EAC/C;EACA,MAAME,MAAM,GAAGD,SAAS,CAACE,GAAG,CAAEC,QAAQ,IAAIA,QAAQ,CAACF,MAAO,CAAC;EAC3D,IAAIG,KAAK,GAAGP,OAAO,CAAEI,MAAO,CAAC,CAACC,GAAG,CAAEG,KAAK,IAAIA,KAAK,CAACC,IAAK,CAAC;EACxD;EACAF,KAAK,GAAGA,KAAK,CAACF,GAAG,CAAEG,KAAK,IAAIP,iBAAiB,CAAEO,KAAM,CAAE,CAAC;;EAExD;EACA,OAAOD,KAAK,CAACG,MAAM,CAAEC,IAAI,IAAIA,IAAI,CAACC,IAAI,CAAC,CAAC,KAAK,EAAG,CAAC;AAClD","ignoreList":[]}