axyseo 2.1.12 → 2.1.19

package/build/cjs/languageProcessing/helpers/syllables/syllableCountIterator.js

@@ -0,0 +1,63 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = void 0;
+var _syllableCountStep = _interopRequireDefault(require("./syllableCountStep.js"));
+var _lodash = require("lodash");
+function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e }; }
+/**
+ * A SyllableCountIterator contains individual SyllableCountSteps.
+ */
+class SyllableCountIterator {
+  /**
+   * Creates a syllable count iterator.
+   *
+   * @param {object} config The config object containing an array with syllable exclusions.
+   * @constructor
+   */
+  constructor(config) {
+    this.countSteps = [];
+    if (!(0, _lodash.isUndefined)(config)) {
+      this.createSyllableCountSteps(config.deviations.vowels);
+    }
+  }
+
+  /**
+   * Creates a syllable count step object for each exclusion.
+   *
+   * @param {object} syllableCounts The object containing all exclusion syllables including the multipliers.
+   * @returns {void}
+   */
+  createSyllableCountSteps(syllableCounts) {
+    (0, _lodash.forEach)(syllableCounts, function (syllableCountStep) {
+      this.countSteps.push(new _syllableCountStep.default(syllableCountStep));
+    }.bind(this));
+  }
+
+  /**
+   * Returns all available count steps.
+   *
+   * @returns {Array} All available count steps.
+   */
+  getAvailableSyllableCountSteps() {
+    return this.countSteps;
+  }
+
+  /**
+   * Counts the syllables for all the steps and returns the total syllable count.
+   *
+   * @param {String} word The word to count syllables in.
+   * @returns {number} The number of syllables found based on exclusions.
+   */
+  countSyllables(word) {
+    let syllableCount = 0;
+    (0, _lodash.forEach)(this.countSteps, function (step) {
+      syllableCount += step.countSyllables(word);
+    });
+    return syllableCount;
+  }
+}
+exports.default = SyllableCountIterator;
+//# sourceMappingURL=syllableCountIterator.js.map

package/build/cjs/languageProcessing/helpers/syllables/syllableCountIterator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"syllableCountIterator.js","names":["_syllableCountStep","_interopRequireDefault","require","_lodash","e","__esModule","default","SyllableCountIterator","constructor","config","countSteps","isUndefined","createSyllableCountSteps","deviations","vowels","syllableCounts","forEach","syllableCountStep","push","SyllableCountStep","bind","getAvailableSyllableCountSteps","countSyllables","word","syllableCount","step","exports"],"sources":["../../../../../src/languageProcessing/helpers/syllables/syllableCountIterator.js"],"sourcesContent":["import SyllableCountStep from \"./syllableCountStep.js\";\n\nimport { forEach, isUndefined } from \"lodash\";\n\n/**\n * A SyllableCountIterator contains individual SyllableCountSteps.\n */\nexport default class SyllableCountIterator {\n\t/**\n\t * Creates a syllable count iterator.\n\t *\n\t * @param {object} config The config object containing an array with syllable exclusions.\n\t * @constructor\n\t */\n\tconstructor( config ) {\n\t\tthis.countSteps = [];\n\t\tif ( ! isUndefined( config ) ) {\n\t\t\tthis.createSyllableCountSteps( config.deviations.vowels );\n\t\t}\n\t}\n\n\t/**\n\t * Creates a syllable count step object for each exclusion.\n\t *\n\t * @param {object} syllableCounts The object containing all exclusion syllables including the multipliers.\n\t * @returns {void}\n\t */\n\tcreateSyllableCountSteps( syllableCounts ) {\n\t\tforEach( syllableCounts, function( syllableCountStep ) {\n\t\t\tthis.countSteps.push( new SyllableCountStep( syllableCountStep ) );\n\t\t}.bind( this ) );\n\t}\n\n\t/**\n\t * Returns all available count steps.\n\t *\n\t * @returns {Array} All available count steps.\n\t */\n\tgetAvailableSyllableCountSteps() {\n\t\treturn this.countSteps;\n\t}\n\n\t/**\n\t * Counts the syllables for all the steps and returns the total syllable count.\n\t *\n\t * @param {String} word The word to count syllables in.\n\t * @returns {number} The number of syllables found based on exclusions.\n\t */\n\tcountSyllables( word ) {\n\t\tlet syllableCount = 0;\n\t\tforEach( this.countSteps, function( step ) {\n\t\t\tsyllableCount += step.countSyllables( word );\n\t\t} );\n\t\treturn syllableCount;\n\t}\n}\n"],"mappings":";;;;;;AAAA,IAAAA,kBAAA,GAAAC,sBAAA,CAAAC,OAAA;AAEA,IAAAC,OAAA,GAAAD,OAAA;AAA8C,SAAAD,uBAAAG,CAAA,WAAAA,CAAA,IAAAA,CAAA,CAAAC,UAAA,GAAAD,CAAA,KAAAE,OAAA,EAAAF,CAAA;AAE9C;AACA;AACA;AACe,MAAMG,qBAAqB,CAAC;EAC1C;AACD;AACA;AACA;AACA;AACA;EACCC,WAAWA,CAAEC,MAAM,EAAG;IACrB,IAAI,CAACC,UAAU,GAAG,EAAE;IACpB,IAAK,CAAE,IAAAC,mBAAW,EAAEF,MAAO,CAAC,EAAG;MAC9B,IAAI,CAACG,wBAAwB,CAAEH,MAAM,CAACI,UAAU,CAACC,MAAO,CAAC;IAC1D;EACD;;EAEA;AACD;AACA;AACA;AACA;AACA;EACCF,wBAAwBA,CAAEG,cAAc,EAAG;IAC1C,IAAAC,eAAO,EAAED,cAAc,EAAE,UAAUE,iBAAiB,EAAG;MACtD,IAAI,CAACP,UAAU,CAACQ,IAAI,CAAE,IAAIC,0BAAiB,CAAEF,iBAAkB,CAAE,CAAC;IACnE,CAAC,CAACG,IAAI,CAAE,IAAK,CAAE,CAAC;EACjB;;EAEA;AACD;AACA;AACA;AACA;EACCC,8BAA8BA,CAAA,EAAG;IAChC,OAAO,IAAI,CAACX,UAAU;EACvB;;EAEA;AACD;AACA;AACA;AACA;AACA;EACCY,cAAcA,CAAEC,IAAI,EAAG;IACtB,IAAIC,aAAa,GAAG,CAAC;IACrB,IAAAR,eAAO,EAAE,IAAI,CAACN,UAAU,EAAE,UAAUe,IAAI,EAAG;MAC1CD,aAAa,IAAIC,IAAI,CAACH,cAAc,CAAEC,IAAK,CAAC;IAC7C,CAAE,CAAC;IACH,OAAOC,aAAa;EACrB;AACD;AAACE,OAAA,CAAApB,OAAA,GAAAC,qBAAA","ignoreList":[]}

package/build/cjs/languageProcessing/helpers/syllables/syllableCountStep.js

@@ -0,0 +1,75 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = void 0;
+var _lodash = require("lodash");
+var _createRegexFromArray = _interopRequireDefault(require("../regex/createRegexFromArray.js"));
+function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e }; }
+/**
+ * A SyllableCountStep is an individual step in a SyllableCountIterator.
+ */
+class SyllableCountStep {
+  /**
+   * Constructs a language syllable regex that contains a regex for matching syllable exclusion.
+   *
+   * @param {object} syllableRegex The object containing the syllable exclusions.
+   * @constructor
+   */
+  constructor(syllableRegex) {
+    this._hasRegex = false;
+    this._regex = "";
+    this._multiplier = "";
+    this.createRegex(syllableRegex);
+  }
+
+  /**
+   * Checks whether a valid regex has been set.
+   *
+   * @returns {boolean} True if a regex has been set, false if not.
+   */
+  hasRegex() {
+    return this._hasRegex;
+  }
+
+  /**
+   * Creates a regex based on the given syllable exclusions, and sets the multiplier to use.
+   *
+   * @param {object} syllableRegex The object containing the syllable exclusions and multiplier.
+   * @returns {void}
+   */
+  createRegex(syllableRegex) {
+    if (!(0, _lodash.isUndefined)(syllableRegex) && !(0, _lodash.isUndefined)(syllableRegex.fragments)) {
+      this._hasRegex = true;
+      this._regex = (0, _createRegexFromArray.default)(syllableRegex.fragments, true);
+      this._multiplier = syllableRegex.countModifier;
+    }
+  }
+
+  /**
+   * Returns the stored regular expression.
+   *
+   * @returns {RegExp} The stored regular expression.
+   */
+  getRegex() {
+    return this._regex;
+  }
+
+  /**
+   * Matches syllable exclusions in a given word and returns the number found multiplied by the
+   * given multiplier. The result of this multiplication is the syllable count.
+   *
+   * @param {String} word The word to match for syllable exclusions.
+   * @returns {number} The amount of syllables found.
+   */
+  countSyllables(word) {
+    if (this._hasRegex) {
+      const match = word.match(this._regex) || [];
+      return match.length * this._multiplier;
+    }
+    return 0;
+  }
+}
+exports.default = SyllableCountStep;
+//# sourceMappingURL=syllableCountStep.js.map

package/build/cjs/languageProcessing/helpers/syllables/syllableCountStep.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"syllableCountStep.js","names":["_lodash","require","_createRegexFromArray","_interopRequireDefault","e","__esModule","default","SyllableCountStep","constructor","syllableRegex","_hasRegex","_regex","_multiplier","createRegex","hasRegex","isUndefined","fragments","arrayToRegex","countModifier","getRegex","countSyllables","word","match","length","exports"],"sources":["../../../../../src/languageProcessing/helpers/syllables/syllableCountStep.js"],"sourcesContent":["import { isUndefined } from \"lodash\";\n\nimport arrayToRegex from \"../regex/createRegexFromArray.js\";\n\n/**\n * A SyllableCountStep is an individual step in a SyllableCountIterator.\n */\nexport default class SyllableCountStep {\n\t/**\n\t * Constructs a language syllable regex that contains a regex for matching syllable exclusion.\n\t *\n\t * @param {object} syllableRegex The object containing the syllable exclusions.\n\t * @constructor\n\t */\n\tconstructor( syllableRegex ) {\n\t\tthis._hasRegex = false;\n\t\tthis._regex = \"\";\n\t\tthis._multiplier = \"\";\n\t\tthis.createRegex( syllableRegex );\n\t}\n\n\t/**\n\t * Checks whether a valid regex has been set.\n\t *\n\t * @returns {boolean} True if a regex has been set, false if not.\n\t */\n\thasRegex() {\n\t\treturn this._hasRegex;\n\t}\n\n\t/**\n\t * Creates a regex based on the given syllable exclusions, and sets the multiplier to use.\n\t *\n\t * @param {object} syllableRegex The object containing the syllable exclusions and multiplier.\n\t * @returns {void}\n\t */\n\tcreateRegex( syllableRegex ) {\n\t\tif ( ! isUndefined( syllableRegex ) && ! isUndefined( syllableRegex.fragments ) ) {\n\t\t\tthis._hasRegex = true;\n\t\t\tthis._regex = arrayToRegex( syllableRegex.fragments, true );\n\t\t\tthis._multiplier = syllableRegex.countModifier;\n\t\t}\n\t}\n\n\t/**\n\t * Returns the stored regular expression.\n\t *\n\t * @returns {RegExp} The stored regular expression.\n\t */\n\tgetRegex() {\n\t\treturn this._regex;\n\t}\n\n\t/**\n\t * Matches syllable exclusions in a given word and returns the number found multiplied by the\n\t * given multiplier. The result of this multiplication is the syllable count.\n\t *\n\t * @param {String} word The word to match for syllable exclusions.\n\t * @returns {number} The amount of syllables found.\n\t */\n\tcountSyllables( word ) {\n\t\tif ( this._hasRegex ) {\n\t\t\tconst match = word.match( this._regex ) || [];\n\t\t\treturn match.length * this._multiplier;\n\t\t}\n\t\treturn 0;\n\t}\n}\n"],"mappings":";;;;;;AAAA,IAAAA,OAAA,GAAAC,OAAA;AAEA,IAAAC,qBAAA,GAAAC,sBAAA,CAAAF,OAAA;AAA4D,SAAAE,uBAAAC,CAAA,WAAAA,CAAA,IAAAA,CAAA,CAAAC,UAAA,GAAAD,CAAA,KAAAE,OAAA,EAAAF,CAAA;AAE5D;AACA;AACA;AACe,MAAMG,iBAAiB,CAAC;EACtC;AACD;AACA;AACA;AACA;AACA;EACCC,WAAWA,CAAEC,aAAa,EAAG;IAC5B,IAAI,CAACC,SAAS,GAAG,KAAK;IACtB,IAAI,CAACC,MAAM,GAAG,EAAE;IAChB,IAAI,CAACC,WAAW,GAAG,EAAE;IACrB,IAAI,CAACC,WAAW,CAAEJ,aAAc,CAAC;EAClC;;EAEA;AACD;AACA;AACA;AACA;EACCK,QAAQA,CAAA,EAAG;IACV,OAAO,IAAI,CAACJ,SAAS;EACtB;;EAEA;AACD;AACA;AACA;AACA;AACA;EACCG,WAAWA,CAAEJ,aAAa,EAAG;IAC5B,IAAK,CAAE,IAAAM,mBAAW,EAAEN,aAAc,CAAC,IAAI,CAAE,IAAAM,mBAAW,EAAEN,aAAa,CAACO,SAAU,CAAC,EAAG;MACjF,IAAI,CAACN,SAAS,GAAG,IAAI;MACrB,IAAI,CAACC,MAAM,GAAG,IAAAM,6BAAY,EAAER,aAAa,CAACO,SAAS,EAAE,IAAK,CAAC;MAC3D,IAAI,CAACJ,WAAW,GAAGH,aAAa,CAACS,aAAa;IAC/C;EACD;;EAEA;AACD;AACA;AACA;AACA;EACCC,QAAQA,CAAA,EAAG;IACV,OAAO,IAAI,CAACR,MAAM;EACnB;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;EACCS,cAAcA,CAAEC,IAAI,EAAG;IACtB,IAAK,IAAI,CAACX,SAAS,EAAG;MACrB,MAAMY,KAAK,GAAGD,IAAI,CAACC,KAAK,CAAE,IAAI,CAACX,MAAO,CAAC,IAAI,EAAE;MAC7C,OAAOW,KAAK,CAACC,MAAM,GAAG,IAAI,CAACX,WAAW;IACvC;IACA,OAAO,CAAC;EACT;AACD;AAACY,OAAA,CAAAlB,OAAA,GAAAC,iBAAA","ignoreList":[]}

package/build/cjs/languageProcessing/helpers/transform/transformWordsWithHyphens.js

@@ -0,0 +1,24 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = _default;
+/**
+ * Splits words from an array that contain hyphens and adds the elements to the array if they are not yet there.
+ *
+ * @param {Array} array The array to check and modify.
+ *
+ * @returns {Array} A new array with the elements containing hyphens split.
+ */
+function _default(array) {
+  let newArray = array;
+  array.forEach(element => {
+    element = element.split("-");
+    if (element.length > 0 && element.filter(unit => !array.includes(unit)).length > 0) {
+      newArray = newArray.concat(element);
+    }
+  });
+  return newArray;
+}
+//# sourceMappingURL=transformWordsWithHyphens.js.map

package/build/cjs/languageProcessing/helpers/transform/transformWordsWithHyphens.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"transformWordsWithHyphens.js","names":["_default","array","newArray","forEach","element","split","length","filter","unit","includes","concat"],"sources":["../../../../../src/languageProcessing/helpers/transform/transformWordsWithHyphens.js"],"sourcesContent":["/**\n * Splits words from an array that contain hyphens and adds the elements to the array if they are not yet there.\n *\n * @param {Array} array The array to check and modify.\n *\n * @returns {Array} A new array with the elements containing hyphens split.\n */\nexport default function( array ) {\n\tlet newArray = array;\n\tarray.forEach( element => {\n\t\telement = element.split( \"-\" );\n\t\tif ( element.length > 0 && element.filter( unit => ! array.includes( unit ) ).length > 0 ) {\n\t\t\tnewArray = newArray.concat( element );\n\t\t}\n\t} );\n\treturn newArray;\n}\n"],"mappings":";;;;;;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACe,SAAAA,SAAUC,KAAK,EAAG;EAChC,IAAIC,QAAQ,GAAGD,KAAK;EACpBA,KAAK,CAACE,OAAO,CAAEC,OAAO,IAAI;IACzBA,OAAO,GAAGA,OAAO,CAACC,KAAK,CAAE,GAAI,CAAC;IAC9B,IAAKD,OAAO,CAACE,MAAM,GAAG,CAAC,IAAIF,OAAO,CAACG,MAAM,CAAEC,IAAI,IAAI,CAAEP,KAAK,CAACQ,QAAQ,CAAED,IAAK,CAAE,CAAC,CAACF,MAAM,GAAG,CAAC,EAAG;MAC1FJ,QAAQ,GAAGA,QAAQ,CAACQ,MAAM,CAAEN,OAAQ,CAAC;IACtC;EACD,CAAE,CAAC;EACH,OAAOF,QAAQ;AAChB","ignoreList":[]}

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

@@ -0,0 +1,25 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = _default;
+var _diacritics = _interopRequireDefault(require("../../../config/diacritics.js"));
+function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e }; }
+/** @module stringProcessing/replaceDiacritics */
+
+/**
+ * Replaces all diacritics from the text based on the diacritics removal map.
+ *
+ * @param {string} text The text to remove diacritics from.
+ *
+ * @returns {string} The text with all diacritics replaced.
+ */
+function _default(text) {
+  const map = (0, _diacritics.default)();
+  for (let i = 0; i < map.length; i++) {
+    text = text.replace(map[i].letters, map[i].base);
+  }
+  return text;
+}
+//# sourceMappingURL=replaceDiacritics.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"replaceDiacritics.js","names":["_diacritics","_interopRequireDefault","require","e","__esModule","default","_default","text","map","diacriticsRemovalMap","i","length","replace","letters","base"],"sources":["../../../../../src/languageProcessing/helpers/transliterate/replaceDiacritics.js"],"sourcesContent":["/** @module stringProcessing/replaceDiacritics */\n\nimport diacriticsRemovalMap from \"../../../config/diacritics.js\";\n\n/**\n * Replaces all diacritics from the text based on the diacritics removal map.\n *\n * @param {string} text The text to remove diacritics from.\n *\n * @returns {string} The text with all diacritics replaced.\n */\nexport default function( text ) {\n\tconst map = diacriticsRemovalMap();\n\n\tfor ( let i = 0; i < map.length; i++ ) {\n\t\ttext = text.replace(\n\t\t\tmap[ i ].letters,\n\t\t\tmap[ i ].base\n\t\t);\n\t}\n\treturn text;\n}\n"],"mappings":";;;;;;AAEA,IAAAA,WAAA,GAAAC,sBAAA,CAAAC,OAAA;AAAiE,SAAAD,uBAAAE,CAAA,WAAAA,CAAA,IAAAA,CAAA,CAAAC,UAAA,GAAAD,CAAA,KAAAE,OAAA,EAAAF,CAAA;AAFjE;;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;AACe,SAAAG,SAAUC,IAAI,EAAG;EAC/B,MAAMC,GAAG,GAAG,IAAAC,mBAAoB,EAAC,CAAC;EAElC,KAAM,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGF,GAAG,CAACG,MAAM,EAAED,CAAC,EAAE,EAAG;IACtCH,IAAI,GAAGA,IAAI,CAACK,OAAO,CAClBJ,GAAG,CAAEE,CAAC,CAAE,CAACG,OAAO,EAChBL,GAAG,CAAEE,CAAC,CAAE,CAACI,IACV,CAAC;EACF;EACA,OAAOP,IAAI;AACZ","ignoreList":[]}

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

@@ -0,0 +1,194 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.arraysDifference = arraysDifference;
+exports.arraysOverlap = arraysOverlap;
+exports.combinations = combinations;
+exports.getIndicesOfCharacter = getIndicesOfCharacter;
+exports.getIndicesOfWords = getIndicesOfWords;
+exports.replaceTurkishIs = replaceTurkishIs;
+exports.replaceTurkishIsMemoized = void 0;
+var _lodash = require("lodash");
+var _getWords = _interopRequireDefault(require("../word/getWords"));
+function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e }; }
+/**
+ * Gets positions of the first character of a word in the input text.
+ *
+ * @param {string} text The original text, for which the indices of word beginnings need to be determined.
+ *
+ * @returns {Array} indices The array of indices in the text at which words start.
+ */
+function getIndicesOfWords(text) {
+  const indices = [];
+  const words = (0, _getWords.default)(text);
+  let startSearchFrom = 0;
+  words.forEach(function (word) {
+    const currentIndex = text.indexOf(word, startSearchFrom);
+    indices.push(currentIndex);
+    startSearchFrom = currentIndex + word.length;
+  });
+  return indices;
+}
+
+/**
+ * Gets indices of a specific character in the input text.
+ *
+ * @param {string} text             The original text, for which the indices of specific characters have to be determined.
+ * @param {string} characterToFind  The character that needs to be found in the text.
+ *
+ * @returns {Array} indices The array of indices in the text at which the characterToFind occurs.
+ */
+function getIndicesOfCharacter(text, characterToFind) {
+  const indices = [];
+  if (text.indexOf(characterToFind) > -1) {
+    for (let i = 0; i < text.length; i++) {
+      if (text[i] === characterToFind) {
+        indices.push(i);
+      }
+    }
+  }
+  return indices;
+}
+
+/**
+ * Compares two arrays of which the second array is the sub-array of the first array.
+ * Returns the array of elements of the first array which are not in the second array.
+ *
+ * @param {Array} bigArray The array with all elements.
+ * @param {Array} subarray The array with some elements from the bigArray.
+ *
+ * @returns {Array} difference An array of all elements of bigArray which are not in subarray.
+ */
+function arraysDifference(bigArray, subarray) {
+  return (0, _lodash.filter)(bigArray, function (element) {
+    return !(0, _lodash.includes)(subarray, element);
+  });
+}
+
+/**
+ * Compares two arrays and returns the array of elements that occur in both arrays.
+ *
+ * @param {Array} firstArray    The first array with elements to compare.
+ * @param {Array} secondArray   The second array with elements to compare.
+ *
+ * @returns {Array} overlap An array of all elements of firstArray which are also in secondArray.
+ */
+function arraysOverlap(firstArray, secondArray) {
+  return (0, _lodash.filter)(firstArray, function (element) {
+    return (0, _lodash.includes)(secondArray, element);
+  });
+}
+
+/**
+ * Generates all possible combinations of the elements of an array (treated as unique).
+ * https://gist.github.com/jpillora/4435759
+ *
+ * @param {Array} collection The array with elements that should be combined.
+ *
+ * @returns {Array} result An array of all possible combinations of elements of the original array.
+ */
+function combinations(collection) {
+  /**
+   * A recursive function that iterates through all elements of an array to produce its combinations.
+   *
+   * @param {Array} xs        The array to start accumulating with.
+   * @param {Array} array     The array with elements that should be combined.
+   *
+   * @returns {Array} result An array of all possible combinations of elements of the original array.
+   */
+  function acc(xs, array) {
+    const x = xs[0];
+    if (typeof x === "undefined") {
+      return array;
+    }
+    for (let i = 0, l = array.length; i < l; ++i) {
+      array.push(array[i].concat(x));
+    }
+    return acc(xs.slice(1), array);
+  }
+  return acc(collection, [[]]).slice(1).concat([[]]);
+}
+
+/**
+ * Replaces characters on specified indices in the input text.
+ *
+ * @param {string} text         The original text, for which the characters have to be substituted.
+ * @param {Array} indices       The array of indices that have to be substituted.
+ * @param {string} substitute   The character that is used to substitute in the text.
+ *
+ * @returns {string} result The string of the original text with the characters on specified indices are substituted with the substitute character.
+ */
+function replaceCharactersByIndex(text, indices, substitute) {
+  const modifiedTextSplitByLetter = text.split("");
+  indices.forEach(function (index) {
+    modifiedTextSplitByLetter.splice(index, 1, substitute);
+  });
+  return modifiedTextSplitByLetter.join("");
+}
+
+/**
+ * Generates upper and lower case for Turkish strings that contain characters İ or ı, which appear to not be processed correctly by regexes.
+ *
+ * @param {string} text The text to build possible upper and lower case alternatives.
+ *
+ * @returns {Array} An array of strings that contains all possible upper and lower case alternatives of the original string
+ */
+function replaceTurkishIs(text) {
+  // Get indices of all occurrences of İ, I, i, or ı.
+  const indicesOfAllIs = getIndicesOfCharacter(text, "İ").concat(getIndicesOfCharacter(text, "I"), getIndicesOfCharacter(text, "i"), getIndicesOfCharacter(text, "ı"));
+  indicesOfAllIs.sort();
+
+  // If there are no Is return the text
+  if (indicesOfAllIs.length === 0) {
+    return [text];
+  }
+  const indicesOfIsInWordBeginnings = arraysOverlap(getIndicesOfWords(text), indicesOfAllIs);
+  const results = [];
+
+  // First round of creating combinations: assign which indices will be replaced by İ
+  const combinationsDottedI = combinations(indicesOfIsInWordBeginnings);
+  combinationsDottedI.forEach(function (oneCombinationDottedI) {
+    // If the combination is full array, just add it to results immediately without going through the rest of iterations.
+    if ((0, _lodash.isEqual)(oneCombinationDottedI, indicesOfIsInWordBeginnings)) {
+      results.push([oneCombinationDottedI, [], [], []]);
+    } else {
+      const indicesNotDottedI = arraysDifference(indicesOfIsInWordBeginnings, oneCombinationDottedI);
+
+      // Second round of creating combinations: assign which indices will be replaced by I
+      const combinationsDotlessI = combinations(indicesNotDottedI);
+      combinationsDotlessI.forEach(function (oneCombinationDotlessI) {
+        // If the combination is full array, just add it to results immediately without going through the rest of iterations.
+        if ((0, _lodash.isEqual)(oneCombinationDotlessI, indicesNotDottedI)) {
+          results.push([oneCombinationDottedI, oneCombinationDotlessI, [], []]);
+        } else {
+          const indicesSmalli = arraysDifference(indicesNotDottedI, oneCombinationDotlessI);
+
+          // Third round of creating combinations: assign which indices will be replaced by i
+          const combinationsDottedi = combinations(indicesSmalli);
+          combinationsDottedi.forEach(function (oneCombinationDottedi) {
+            // If the combination is full array, just add it to results immediately without going through the rest of iterations.
+            if ((0, _lodash.isEqual)(oneCombinationDottedi, indicesSmalli)) {
+              results.push([oneCombinationDottedI, oneCombinationDotlessI, oneCombinationDottedi, []]);
+            } else {
+              const oneCombinationDotlessi = arraysDifference(indicesSmalli, oneCombinationDottedi);
+              results.push([oneCombinationDottedI, oneCombinationDotlessI, oneCombinationDottedi, oneCombinationDotlessi]);
+            }
+          });
+        }
+      });
+    }
+  });
+  const textAlternations = [];
+  results.forEach(function (result) {
+    const toDottedI = replaceCharactersByIndex(text, result[0], "İ");
+    const toDotlessI = replaceCharactersByIndex(toDottedI, result[1], "I");
+    const toDottedi = replaceCharactersByIndex(toDotlessI, result[2], "i");
+    const toDotlessi = replaceCharactersByIndex(toDottedi, result[3], "ı");
+    textAlternations.push(toDotlessi);
+  });
+  return textAlternations;
+}
+const replaceTurkishIsMemoized = exports.replaceTurkishIsMemoized = (0, _lodash.memoize)(replaceTurkishIs);
+//# sourceMappingURL=specialCharacterMappings.js.map

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

@@ -0,0 +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":[]}

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

@@ -0,0 +1,24 @@
+"use strict";
+
+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.
+ *
+ * @param {string} text     The text to remove special characters from.
+ * @param {string} locale   The locale.
+ *
+ * @returns {string} The text with all special characters replaced.
+ */
+function _default(text, locale) {
+  const map = (0, _getTransliterations.default)(locale);
+  for (let i = 0; i < map.length; i++) {
+    text = text.replace(map[i].letter, map[i].alternative);
+  }
+  return text;
+}
+//# sourceMappingURL=transliterate.js.map

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

@@ -0,0 +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":[]}

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

@@ -0,0 +1,25 @@
+"use strict";
+
+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).
+ *
+ * @param {string} text     The text to remove special characters from.
+ * @param {string} locale   The locale.
+ *
+ * @returns {string} The text with all special characters replaced.
+ */
+function _default(text, locale) {
+  const map = (0, _transliterationsWPstyle.default)(locale);
+  for (let i = map.length - 1; i >= 0; i--) {
+    text = text.replace(map[i].letter, map[i].alternative);
+  }
+  return text;
+}
+//# sourceMappingURL=transliterateWPstyle.js.map

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

@@ -0,0 +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":[]}

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

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

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

@@ -0,0 +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":[]}