axyseo 2.0.0-alpha.0.0.37 → 2.0.0-alpha.0.0.39

package/build/languageProcessing/researches/wordComplexity.js

@@ -0,0 +1,122 @@
+import { flatMap, get } from "lodash";
+import getSentences from "../helpers/sentence/getSentences";
+import getWords from "../helpers/word/getWords";
+import removeHtmlBlocks from "../helpers/html/htmlParser";
+import { filterShortcodesFromHTML } from "../helpers";
+import { findTopicFormsInString } from "../helpers/match/findKeywordFormsInString";
+
+/**
+ * An object containing the results of the complex words research for a single sentence.
+ *
+ * The structure of the data is:
+ * @example
+ * {
+ * complexWords: ["word1", "word2", "word3" ],
+ * sentence: "the sentence"
+ * }
+ *
+ * @typedef {Object} 	ComplexWordsResult
+ * @property {string[]}	complexWords	The complex words in the sentence.
+ * @property {string}	sentence		The sentence.
+ */
+
+/**
+ * Retrieves all complex words in a sentence.
+ *
+ * @param {string} 		currentSentence	The current sentence.
+ * @param {Researcher} 	researcher		The researcher object.
+ * @param {Object}      topicForms       The object with word forms of all (content) words from the keyphrase and eventually synonyms,
+ * comes in a shape {
+ *                     keyphraseForms: [[ form1, form2, ... ], [ form1, form2, ... ]],
+ *                     synonymsForms: [
+ *                          [[ form1, form2, ... ], [ form1, form2, ... ]],
+ *                          [[ form1, form2, ... ], [ form1, form2, ... ]],
+ *                          [[ form1, form2, ... ], [ form1, form2, ... ]],
+ *                     ],
+ *                  }
+ *
+ * @returns {ComplexWordsResult} An object containing all complex words in a given sentence.
+ */
+const getComplexWords = function (currentSentence, researcher, topicForms) {
+  const language = researcher.getConfig("language");
+  const checkIfWordIsComplex = researcher.getHelper("checkIfWordIsComplex");
+  const functionWords = researcher.getConfig("functionWords");
+  const wordComplexityConfig = researcher.getConfig("wordComplexity");
+  const checkIfWordIsFunction = researcher.getHelper("checkIfWordIsFunction");
+  const premiumData = get(researcher.getData("morphology"), language, false);
+
+  // Retrieve all words from the sentence.
+  let words = getWords(currentSentence);
+
+  // Filters out keyphrase forms (but not synonyms) because we consider them not to be complex.
+  const matchWordCustomHelper = researcher.getHelper("matchWordCustomHelper");
+  const foundTopicForms = findTopicFormsInString(topicForms, currentSentence, false, researcher.paper.getLocale(), matchWordCustomHelper);
+  words = words.filter(word => !foundTopicForms.matches.includes(word));
+
+  // Filters out function words because function words are not complex.
+  // Words are converted to lowercase before processing to avoid excluding function words that start with a capital letter.
+  words = words.filter(word => !(checkIfWordIsFunction ? checkIfWordIsFunction(word) : functionWords.includes(word)));
+  const result = {
+    complexWords: [],
+    sentence: currentSentence
+  };
+  if (!premiumData) {
+    return result;
+  }
+  words.forEach(word => {
+    if (checkIfWordIsComplex(wordComplexityConfig, word, premiumData)) {
+      result.complexWords.push(word);
+    }
+  });
+  return result;
+};
+
+/**
+ * Calculates the percentage of the complex words compared to the total words in the text.
+ *
+ * @param {ComplexWordsResult[]}	complexWordsResults	The array of complex words results.
+ * @param {string[]} 				words    			The array of words retrieved from the text.
+ *
+ * @returns {number} The percentage of the complex words compared to the total words in the text.
+ */
+const calculateComplexWordsPercentage = function (complexWordsResults, words) {
+  const totalComplexWords = flatMap(complexWordsResults, result => result.complexWords);
+  const percentage = totalComplexWords.length / words.length * 100;
+
+  // If the number is a decimal, round it to two numbers after the period, e.g. 5.12345 -> 5.12.
+  // This approach is inspired from this thread: https://stackoverflow.com/questions/11832914/how-to-round-to-at-most-2-decimal-places-if-necessary.
+  return +percentage.toFixed(2);
+};
+
+/**
+ * Gets the complex words from the sentences and calculates the percentage of complex words compared to the total words in the text.
+ * This is a research for the Word Complexity assessment. As such, this research is not part of the AbstractResearcher, and not bundled in Yoast SEO.
+ *
+ * @param {Paper}       paper       The Paper object to get the text from.
+ * @param {Researcher}  researcher  The researcher object.
+ *
+ * @returns {{complexWords: ComplexWordsResult[], percentage: number}}
+ * The complex words found and their percentage compared to the total words in the text.
+ */
+export default function wordComplexity(paper, researcher) {
+  const memoizedTokenizer = researcher.getHelper("memoizedTokenizer");
+  let text = paper.getText();
+  text = removeHtmlBlocks(text);
+  text = filterShortcodesFromHTML(text, paper._attributes && paper._attributes.shortcodes);
+  const sentences = getSentences(text, memoizedTokenizer);
+  const topicForms = researcher.getResearch("morphology");
+  // Find the complex words in each sentence.
+  let results = sentences.map(sentence => getComplexWords(sentence, researcher, topicForms));
+
+  // Remove sentences without complex words.
+  results = results.filter(result => result.complexWords.length !== 0);
+
+  // Calculate the percentage of complex words in the text as a whole.
+  const words = getWords(text);
+  const percentage = calculateComplexWordsPercentage(results, words);
+  return {
+    complexWords: results,
+    percentage: percentage
+  };
+}
+//# sourceMappingURL=wordComplexity.js.map

package/build/languageProcessing/researches/wordComplexity.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"wordComplexity.js","names":["flatMap","get","getSentences","getWords","removeHtmlBlocks","filterShortcodesFromHTML","findTopicFormsInString","getComplexWords","currentSentence","researcher","topicForms","language","getConfig","checkIfWordIsComplex","getHelper","functionWords","wordComplexityConfig","checkIfWordIsFunction","premiumData","getData","words","matchWordCustomHelper","foundTopicForms","paper","getLocale","filter","word","matches","includes","result","complexWords","sentence","forEach","push","calculateComplexWordsPercentage","complexWordsResults","totalComplexWords","percentage","length","toFixed","wordComplexity","memoizedTokenizer","text","getText","_attributes","shortcodes","sentences","getResearch","results","map"],"sources":["../../../src/languageProcessing/researches/wordComplexity.js"],"sourcesContent":["import { flatMap, get } from \"lodash\";\n\nimport getSentences from \"../helpers/sentence/getSentences\";\nimport getWords from \"../helpers/word/getWords\";\nimport removeHtmlBlocks from \"../helpers/html/htmlParser\";\nimport { filterShortcodesFromHTML } from \"../helpers\";\nimport { findTopicFormsInString } from \"../helpers/match/findKeywordFormsInString\";\n\n/**\n * An object containing the results of the complex words research for a single sentence.\n *\n * The structure of the data is:\n * @example\n * {\n * complexWords: [\"word1\", \"word2\", \"word3\" ],\n * sentence: \"the sentence\"\n * }\n *\n * @typedef {Object} \tComplexWordsResult\n * @property {string[]}\tcomplexWords\tThe complex words in the sentence.\n * @property {string}\tsentence\t\tThe sentence.\n */\n\n/**\n * Retrieves all complex words in a sentence.\n *\n * @param {string} \t\tcurrentSentence\tThe current sentence.\n * @param {Researcher} \tresearcher\t\tThe researcher object.\n * @param {Object}      topicForms       The object with word forms of all (content) words from the keyphrase and eventually synonyms,\n * comes in a shape {\n *                     keyphraseForms: [[ form1, form2, ... ], [ form1, form2, ... ]],\n *                     synonymsForms: [\n *                          [[ form1, form2, ... ], [ form1, form2, ... ]],\n *                          [[ form1, form2, ... ], [ form1, form2, ... ]],\n *                          [[ form1, form2, ... ], [ form1, form2, ... ]],\n *                     ],\n *                  }\n *\n * @returns {ComplexWordsResult} An object containing all complex words in a given sentence.\n */\nconst getComplexWords = function( currentSentence, researcher, topicForms ) {\n\tconst language = researcher.getConfig( \"language\" );\n\tconst checkIfWordIsComplex = researcher.getHelper( \"checkIfWordIsComplex\" );\n\tconst functionWords = researcher.getConfig( \"functionWords\" );\n\tconst wordComplexityConfig = researcher.getConfig( \"wordComplexity\" );\n\tconst checkIfWordIsFunction = researcher.getHelper( \"checkIfWordIsFunction\" );\n\tconst premiumData = get( researcher.getData( \"morphology\" ), language, false );\n\n\t// Retrieve all words from the sentence.\n\tlet words = getWords( currentSentence );\n\n\t// Filters out keyphrase forms (but not synonyms) because we consider them not to be complex.\n\tconst matchWordCustomHelper = researcher.getHelper( \"matchWordCustomHelper\" );\n\tconst foundTopicForms = findTopicFormsInString( topicForms, currentSentence, false, researcher.paper.getLocale(), matchWordCustomHelper );\n\twords = words.filter( word => ! foundTopicForms.matches.includes( word ) );\n\n\t// Filters out function words because function words are not complex.\n\t// Words are converted to lowercase before processing to avoid excluding function words that start with a capital letter.\n\twords = words.filter( word => ! ( checkIfWordIsFunction ? checkIfWordIsFunction( word ) : functionWords.includes( word ) ) );\n\n\tconst result = {\n\t\tcomplexWords: [],\n\t\tsentence: currentSentence,\n\t};\n\n\tif ( ! premiumData ) {\n\t\treturn result;\n\t}\n\n\twords.forEach( word => {\n\t\tif ( checkIfWordIsComplex( wordComplexityConfig, word, premiumData ) ) {\n\t\t\tresult.complexWords.push( word );\n\t\t}\n\t} );\n\n\treturn result;\n};\n\n/**\n * Calculates the percentage of the complex words compared to the total words in the text.\n *\n * @param {ComplexWordsResult[]}\tcomplexWordsResults\tThe array of complex words results.\n * @param {string[]} \t\t\t\twords    \t\t\tThe array of words retrieved from the text.\n *\n * @returns {number} The percentage of the complex words compared to the total words in the text.\n */\nconst calculateComplexWordsPercentage = function( complexWordsResults, words ) {\n\tconst totalComplexWords = flatMap( complexWordsResults, result => result.complexWords );\n\tconst percentage = ( totalComplexWords.length / words.length ) * 100;\n\n\t// If the number is a decimal, round it to two numbers after the period, e.g. 5.12345 -> 5.12.\n\t// This approach is inspired from this thread: https://stackoverflow.com/questions/11832914/how-to-round-to-at-most-2-decimal-places-if-necessary.\n\treturn +percentage.toFixed( 2 );\n};\n\n/**\n * Gets the complex words from the sentences and calculates the percentage of complex words compared to the total words in the text.\n * This is a research for the Word Complexity assessment. As such, this research is not part of the AbstractResearcher, and not bundled in Yoast SEO.\n *\n * @param {Paper}       paper       The Paper object to get the text from.\n * @param {Researcher}  researcher  The researcher object.\n *\n * @returns {{complexWords: ComplexWordsResult[], percentage: number}}\n * The complex words found and their percentage compared to the total words in the text.\n */\nexport default function wordComplexity( paper, researcher ) {\n\tconst memoizedTokenizer = researcher.getHelper( \"memoizedTokenizer\" );\n\tlet text = paper.getText();\n\ttext = removeHtmlBlocks( text );\n\ttext = filterShortcodesFromHTML( text, paper._attributes && paper._attributes.shortcodes );\n\tconst sentences = getSentences( text, memoizedTokenizer );\n\n\tconst topicForms = researcher.getResearch( \"morphology\" );\n\t// Find the complex words in each sentence.\n\tlet results = sentences.map( sentence => getComplexWords( sentence, researcher, topicForms ) );\n\n\t// Remove sentences without complex words.\n\tresults = results.filter( result => result.complexWords.length !== 0 );\n\n\t// Calculate the percentage of complex words in the text as a whole.\n\tconst words = getWords( text );\n\tconst percentage = calculateComplexWordsPercentage( results, words );\n\n\treturn {\n\t\tcomplexWords: results,\n\t\tpercentage: percentage,\n\t};\n}\n\n"],"mappings":"AAAA,SAASA,OAAO,EAAEC,GAAG,QAAQ,QAAQ;AAErC,OAAOC,YAAY;AACnB,OAAOC,QAAQ;AACf,OAAOC,gBAAgB;AACvB,SAASC,wBAAwB;AACjC,SAASC,sBAAsB;;AAE/B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,eAAe,GAAG,SAAAA,CAAUC,eAAe,EAAEC,UAAU,EAAEC,UAAU,EAAG;EAC3E,MAAMC,QAAQ,GAAGF,UAAU,CAACG,SAAS,CAAE,UAAW,CAAC;EACnD,MAAMC,oBAAoB,GAAGJ,UAAU,CAACK,SAAS,CAAE,sBAAuB,CAAC;EAC3E,MAAMC,aAAa,GAAGN,UAAU,CAACG,SAAS,CAAE,eAAgB,CAAC;EAC7D,MAAMI,oBAAoB,GAAGP,UAAU,CAACG,SAAS,CAAE,gBAAiB,CAAC;EACrE,MAAMK,qBAAqB,GAAGR,UAAU,CAACK,SAAS,CAAE,uBAAwB,CAAC;EAC7E,MAAMI,WAAW,GAAGjB,GAAG,CAAEQ,UAAU,CAACU,OAAO,CAAE,YAAa,CAAC,EAAER,QAAQ,EAAE,KAAM,CAAC;;EAE9E;EACA,IAAIS,KAAK,GAAGjB,QAAQ,CAAEK,eAAgB,CAAC;;EAEvC;EACA,MAAMa,qBAAqB,GAAGZ,UAAU,CAACK,SAAS,CAAE,uBAAwB,CAAC;EAC7E,MAAMQ,eAAe,GAAGhB,sBAAsB,CAAEI,UAAU,EAAEF,eAAe,EAAE,KAAK,EAAEC,UAAU,CAACc,KAAK,CAACC,SAAS,CAAC,CAAC,EAAEH,qBAAsB,CAAC;EACzID,KAAK,GAAGA,KAAK,CAACK,MAAM,CAAEC,IAAI,IAAI,CAAEJ,eAAe,CAACK,OAAO,CAACC,QAAQ,CAAEF,IAAK,CAAE,CAAC;;EAE1E;EACA;EACAN,KAAK,GAAGA,KAAK,CAACK,MAAM,CAAEC,IAAI,IAAI,EAAIT,qBAAqB,GAAGA,qBAAqB,CAAES,IAAK,CAAC,GAAGX,aAAa,CAACa,QAAQ,CAAEF,IAAK,CAAC,CAAG,CAAC;EAE5H,MAAMG,MAAM,GAAG;IACdC,YAAY,EAAE,EAAE;IAChBC,QAAQ,EAAEvB;EACX,CAAC;EAED,IAAK,CAAEU,WAAW,EAAG;IACpB,OAAOW,MAAM;EACd;EAEAT,KAAK,CAACY,OAAO,CAAEN,IAAI,IAAI;IACtB,IAAKb,oBAAoB,CAAEG,oBAAoB,EAAEU,IAAI,EAAER,WAAY,CAAC,EAAG;MACtEW,MAAM,CAACC,YAAY,CAACG,IAAI,CAAEP,IAAK,CAAC;IACjC;EACD,CAAE,CAAC;EAEH,OAAOG,MAAM;AACd,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMK,+BAA+B,GAAG,SAAAA,CAAUC,mBAAmB,EAAEf,KAAK,EAAG;EAC9E,MAAMgB,iBAAiB,GAAGpC,OAAO,CAAEmC,mBAAmB,EAAEN,MAAM,IAAIA,MAAM,CAACC,YAAa,CAAC;EACvF,MAAMO,UAAU,GAAKD,iBAAiB,CAACE,MAAM,GAAGlB,KAAK,CAACkB,MAAM,GAAK,GAAG;;EAEpE;EACA;EACA,OAAO,CAACD,UAAU,CAACE,OAAO,CAAE,CAAE,CAAC;AAChC,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAASC,cAAcA,CAAEjB,KAAK,EAAEd,UAAU,EAAG;EAC3D,MAAMgC,iBAAiB,GAAGhC,UAAU,CAACK,SAAS,CAAE,mBAAoB,CAAC;EACrE,IAAI4B,IAAI,GAAGnB,KAAK,CAACoB,OAAO,CAAC,CAAC;EAC1BD,IAAI,GAAGtC,gBAAgB,CAAEsC,IAAK,CAAC;EAC/BA,IAAI,GAAGrC,wBAAwB,CAAEqC,IAAI,EAAEnB,KAAK,CAACqB,WAAW,IAAIrB,KAAK,CAACqB,WAAW,CAACC,UAAW,CAAC;EAC1F,MAAMC,SAAS,GAAG5C,YAAY,CAAEwC,IAAI,EAAED,iBAAkB,CAAC;EAEzD,MAAM/B,UAAU,GAAGD,UAAU,CAACsC,WAAW,CAAE,YAAa,CAAC;EACzD;EACA,IAAIC,OAAO,GAAGF,SAAS,CAACG,GAAG,CAAElB,QAAQ,IAAIxB,eAAe,CAAEwB,QAAQ,EAAEtB,UAAU,EAAEC,UAAW,CAAE,CAAC;;EAE9F;EACAsC,OAAO,GAAGA,OAAO,CAACvB,MAAM,CAAEI,MAAM,IAAIA,MAAM,CAACC,YAAY,CAACQ,MAAM,KAAK,CAAE,CAAC;;EAEtE;EACA,MAAMlB,KAAK,GAAGjB,QAAQ,CAAEuC,IAAK,CAAC;EAC9B,MAAML,UAAU,GAAGH,+BAA+B,CAAEc,OAAO,EAAE5B,KAAM,CAAC;EAEpE,OAAO;IACNU,YAAY,EAAEkB,OAAO;IACrBX,UAAU,EAAEA;EACb,CAAC;AACF","ignoreList":[]}

package/build/languageProcessing/researches/wordCountInText.js

@@ -0,0 +1,30 @@
+import wordCount from "../helpers/word/countWords.js";
+import removeHtmlBlocks from "../helpers/html/htmlParser";
+import { filterShortcodesFromHTML } from "../helpers";
+
+/**
+ * A result of the word count calculation.
+ *
+ * @typedef WordCountResult
+ * @param {number} count The number of words found in the text.
+ * @param {"word"} unit The unit used in the text length calculations, always "word".
+ */
+
+/**
+ * Count the words in the text.
+ *
+ * @param {Paper} paper The Paper object.
+ *
+ * @returns {WordCountResult} The number of words found in the text, plus "word" as the unit used in calculating the text length.
+ */
+export default function (paper) {
+  let text = paper.getText();
+  text = removeHtmlBlocks(text);
+  text = filterShortcodesFromHTML(text, paper._attributes && paper._attributes.shortcodes);
+  return {
+    text: text,
+    count: wordCount(text),
+    unit: "word"
+  };
+}
+//# sourceMappingURL=wordCountInText.js.map

package/build/languageProcessing/researches/wordCountInText.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"wordCountInText.js","names":["wordCount","removeHtmlBlocks","filterShortcodesFromHTML","paper","text","getText","_attributes","shortcodes","count","unit"],"sources":["../../../src/languageProcessing/researches/wordCountInText.js"],"sourcesContent":["import wordCount from \"../helpers/word/countWords.js\";\nimport removeHtmlBlocks from \"../helpers/html/htmlParser\";\nimport { filterShortcodesFromHTML } from \"../helpers\";\n\n/**\n * A result of the word count calculation.\n *\n * @typedef WordCountResult\n * @param {number} count The number of words found in the text.\n * @param {\"word\"} unit The unit used in the text length calculations, always \"word\".\n */\n\n/**\n * Count the words in the text.\n *\n * @param {Paper} paper The Paper object.\n *\n * @returns {WordCountResult} The number of words found in the text, plus \"word\" as the unit used in calculating the text length.\n */\nexport default function( paper ) {\n\tlet text = paper.getText();\n\ttext = removeHtmlBlocks( text );\n\ttext = filterShortcodesFromHTML( text, paper._attributes && paper._attributes.shortcodes );\n\treturn {\n\t\ttext: text,\n\t\tcount: wordCount( text ),\n\t\tunit: \"word\",\n\t};\n}\n"],"mappings":"AAAA,OAAOA,SAAS;AAChB,OAAOC,gBAAgB;AACvB,SAASC,wBAAwB;;AAEjC;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,UAAUC,KAAK,EAAG;EAChC,IAAIC,IAAI,GAAGD,KAAK,CAACE,OAAO,CAAC,CAAC;EAC1BD,IAAI,GAAGH,gBAAgB,CAAEG,IAAK,CAAC;EAC/BA,IAAI,GAAGF,wBAAwB,CAAEE,IAAI,EAAED,KAAK,CAACG,WAAW,IAAIH,KAAK,CAACG,WAAW,CAACC,UAAW,CAAC;EAC1F,OAAO;IACNH,IAAI,EAAEA,IAAI;IACVI,KAAK,EAAER,SAAS,CAAEI,IAAK,CAAC;IACxBK,IAAI,EAAE;EACP,CAAC;AACF","ignoreList":[]}

package/build/languageProcessing/values/Clause.js

@@ -0,0 +1,107 @@
+/**
+ * Sentence clause which should be checked for passiveness.
+ *
+ */
+class Clause {
+  /**
+   * Constructs a clause object.
+   *
+   * @param {string} clauseText The text in the clause.
+   * @param {Array} auxiliaries The auxiliaries in the clause.
+   *
+   * @constructor
+   */
+  constructor(clauseText, auxiliaries) {
+    this._clauseText = clauseText;
+    this._auxiliaries = auxiliaries;
+    this._isPassive = false;
+    this._participles = [];
+  }
+  /**
+   * Returns the clause text.
+   *
+   * @returns {string} The clause text.
+   */
+  getClauseText() {
+    return this._clauseText;
+  }
+
+  /**
+   * Returns true if the clause is passive.
+   *
+   * @returns {boolean} Whether the clause is passive.
+   */
+  isPassive() {
+    return this._isPassive;
+  }
+
+  /**
+   * Returns the auxiliaries of the clause.
+   *
+   * @returns {Array} The auxiliaries present in the clause.
+   */
+  getAuxiliaries() {
+    return this._auxiliaries;
+  }
+
+  /**
+   * Sets the passiveness of the clause.
+   *
+   * @param {boolean} passive	 Whether the clause is passive.
+   *
+   * @returns {void}
+   */
+  setPassive(passive) {
+    this._isPassive = passive;
+  }
+
+  /**
+   * Sets the participles.
+   *
+   * @param {Array} participles	The participles.
+   *
+   * @returns {void}
+   */
+  setParticiples(participles) {
+    this._participles = participles;
+  }
+
+  /**
+   * Returns the found participles.
+   *
+   * @returns {Array} The participles
+   */
+  getParticiples() {
+    return this._participles;
+  }
+
+  /**
+   * Serializes the Clause instance to an object.
+   *
+   * @returns {Object} The serialized Clause.
+   */
+  serialize() {
+    return {
+      _parseClass: "Clause",
+      clauseText: this._clauseText,
+      auxiliaries: this._auxiliaries,
+      isPassive: this._isPassive,
+      participles: this._participles
+    };
+  }
+
+  /**
+   * Parses the object to a Clause.
+   *
+   * @param {Object} serialized The serialized object.
+   *
+   * @returns {Clause} The parsed Clause.
+   */
+  static parse(serialized) {
+    const clause = new Clause(serialized.clauseText, serialized.auxiliaries);
+    clause.setPassive(serialized.isPassive);
+    return clause;
+  }
+}
+export default Clause;
+//# sourceMappingURL=Clause.js.map

package/build/languageProcessing/values/Clause.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Clause.js","names":["Clause","constructor","clauseText","auxiliaries","_clauseText","_auxiliaries","_isPassive","_participles","getClauseText","isPassive","getAuxiliaries","setPassive","passive","setParticiples","participles","getParticiples","serialize","_parseClass","parse","serialized","clause"],"sources":["../../../src/languageProcessing/values/Clause.js"],"sourcesContent":["/**\n * Sentence clause which should be checked for passiveness.\n *\n */\nclass Clause {\n\t/**\n\t * Constructs a clause object.\n\t *\n\t * @param {string} clauseText The text in the clause.\n\t * @param {Array} auxiliaries The auxiliaries in the clause.\n\t *\n\t * @constructor\n\t */\n\tconstructor( clauseText, auxiliaries ) {\n\t\tthis._clauseText = clauseText;\n\t\tthis._auxiliaries = auxiliaries;\n\t\tthis._isPassive = false;\n\t\tthis._participles = [];\n\t}\n\t/**\n\t * Returns the clause text.\n\t *\n\t * @returns {string} The clause text.\n\t */\n\tgetClauseText() {\n\t\treturn this._clauseText;\n\t}\n\n\t/**\n\t * Returns true if the clause is passive.\n\t *\n\t * @returns {boolean} Whether the clause is passive.\n\t */\n\tisPassive() {\n\t\treturn this._isPassive;\n\t}\n\n\t/**\n\t * Returns the auxiliaries of the clause.\n\t *\n\t * @returns {Array} The auxiliaries present in the clause.\n\t */\n\tgetAuxiliaries() {\n\t\treturn this._auxiliaries;\n\t}\n\n\t/**\n\t * Sets the passiveness of the clause.\n\t *\n\t * @param {boolean} passive\t Whether the clause is passive.\n\t *\n\t * @returns {void}\n\t */\n\tsetPassive( passive ) {\n\t\tthis._isPassive = passive;\n\t}\n\n\t/**\n\t * Sets the participles.\n\t *\n\t * @param {Array} participles\tThe participles.\n\t *\n\t * @returns {void}\n\t */\n\tsetParticiples( participles ) {\n\t\tthis._participles = participles;\n\t}\n\n\t/**\n\t * Returns the found participles.\n\t *\n\t * @returns {Array} The participles\n\t */\n\tgetParticiples() {\n\t\treturn this._participles;\n\t}\n\n\t/**\n\t * Serializes the Clause instance to an object.\n\t *\n\t * @returns {Object} The serialized Clause.\n\t */\n\tserialize() {\n\t\treturn {\n\t\t\t_parseClass: \"Clause\",\n\t\t\tclauseText: this._clauseText,\n\t\t\tauxiliaries: this._auxiliaries,\n\t\t\tisPassive: this._isPassive,\n\t\t\tparticiples: this._participles,\n\t\t};\n\t}\n\n\t/**\n\t * Parses the object to a Clause.\n\t *\n\t * @param {Object} serialized The serialized object.\n\t *\n\t * @returns {Clause} The parsed Clause.\n\t */\n\tstatic parse( serialized ) {\n\t\tconst clause = new Clause( serialized.clauseText, serialized.auxiliaries );\n\t\tclause.setPassive( serialized.isPassive );\n\n\t\treturn clause;\n\t}\n}\n\nexport default Clause;\n"],"mappings":"AAAA;AACA;AACA;AACA;AACA,MAAMA,MAAM,CAAC;EACZ;AACD;AACA;AACA;AACA;AACA;AACA;AACA;EACCC,WAAWA,CAAEC,UAAU,EAAEC,WAAW,EAAG;IACtC,IAAI,CAACC,WAAW,GAAGF,UAAU;IAC7B,IAAI,CAACG,YAAY,GAAGF,WAAW;IAC/B,IAAI,CAACG,UAAU,GAAG,KAAK;IACvB,IAAI,CAACC,YAAY,GAAG,EAAE;EACvB;EACA;AACD;AACA;AACA;AACA;EACCC,aAAaA,CAAA,EAAG;IACf,OAAO,IAAI,CAACJ,WAAW;EACxB;;EAEA;AACD;AACA;AACA;AACA;EACCK,SAASA,CAAA,EAAG;IACX,OAAO,IAAI,CAACH,UAAU;EACvB;;EAEA;AACD;AACA;AACA;AACA;EACCI,cAAcA,CAAA,EAAG;IAChB,OAAO,IAAI,CAACL,YAAY;EACzB;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;EACCM,UAAUA,CAAEC,OAAO,EAAG;IACrB,IAAI,CAACN,UAAU,GAAGM,OAAO;EAC1B;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;EACCC,cAAcA,CAAEC,WAAW,EAAG;IAC7B,IAAI,CAACP,YAAY,GAAGO,WAAW;EAChC;;EAEA;AACD;AACA;AACA;AACA;EACCC,cAAcA,CAAA,EAAG;IAChB,OAAO,IAAI,CAACR,YAAY;EACzB;;EAEA;AACD;AACA;AACA;AACA;EACCS,SAASA,CAAA,EAAG;IACX,OAAO;MACNC,WAAW,EAAE,QAAQ;MACrBf,UAAU,EAAE,IAAI,CAACE,WAAW;MAC5BD,WAAW,EAAE,IAAI,CAACE,YAAY;MAC9BI,SAAS,EAAE,IAAI,CAACH,UAAU;MAC1BQ,WAAW,EAAE,IAAI,CAACP;IACnB,CAAC;EACF;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;EACC,OAAOW,KAAKA,CAAEC,UAAU,EAAG;IAC1B,MAAMC,MAAM,GAAG,IAAIpB,MAAM,CAAEmB,UAAU,CAACjB,UAAU,EAAEiB,UAAU,CAAChB,WAAY,CAAC;IAC1EiB,MAAM,CAACT,UAAU,CAAEQ,UAAU,CAACV,SAAU,CAAC;IAEzC,OAAOW,MAAM;EACd;AACD;AAEA,eAAepB,MAAM","ignoreList":[]}

package/build/languageProcessing/values/ProminentWord.js

@@ -0,0 +1,95 @@
+/**
+ * Represents a prominent word in the context of relevant words.
+*/
+class ProminentWord {
+  /**
+   * Constructs Prominent word object.
+   *
+   * @constructor
+   *
+   * @param {string} word             The word.
+   * @param {string} [stem]           The stem / base form of the word, defaults to the word.
+   * @param {number} [occurrences]    The number of occurrences, defaults to 0.
+   */
+  constructor(word, stem, occurrences) {
+    this._word = word;
+    this._stem = stem ? stem : word;
+    this._occurrences = occurrences || 0;
+  }
+
+  /**
+   * Sets the word.
+   *
+   * @param {string} word The word to set.
+   *
+   * @returns {void}.
+   */
+  setWord(word) {
+    this._word = word;
+  }
+
+  /**
+   * Returns the word.
+   *
+   * @returns {string} The word.
+   */
+  getWord() {
+    return this._word;
+  }
+
+  /**
+   * Returns the stem of the word.
+   *
+   * @returns {string} The stem.
+   */
+  getStem() {
+    return this._stem;
+  }
+
+  /**
+   * Sets the number of occurrences to the word.
+   *
+   * @param {int} numberOfOccurrences The number of occurrences to set.
+   *
+   * @returns {void}.
+   */
+  setOccurrences(numberOfOccurrences) {
+    this._occurrences = numberOfOccurrences;
+  }
+
+  /**
+   * Returns the amount of occurrences of this word.
+   *
+   * @returns {number} The number of occurrences.
+   */
+  getOccurrences() {
+    return this._occurrences;
+  }
+
+  /**
+   * Serializes the ProminentWord instance to an object.
+   *
+   * @returns {Object} The serialized ProminentWord.
+   */
+  serialize() {
+    return {
+      _parseClass: "ProminentWord",
+      word: this._word,
+      stem: this._stem,
+      occurrences: this._occurrences
+    };
+  }
+
+  /**
+   * Parses the object to a ProminentWord.
+   *
+   * @param {Object} serialized The serialized object.
+   *
+   * @returns {ProminentWord} The parsed ProminentWord.
+   */
+  static parse(serialized) {
+    return new ProminentWord(serialized.word, serialized.stem, serialized.occurrences);
+  }
+}
+export default ProminentWord;
+//# sourceMappingURL=ProminentWord.js.map

package/build/languageProcessing/values/ProminentWord.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ProminentWord.js","names":["ProminentWord","constructor","word","stem","occurrences","_word","_stem","_occurrences","setWord","getWord","getStem","setOccurrences","numberOfOccurrences","getOccurrences","serialize","_parseClass","parse","serialized"],"sources":["../../../src/languageProcessing/values/ProminentWord.js"],"sourcesContent":["/**\n * Represents a prominent word in the context of relevant words.\n*/\nclass ProminentWord {\n\t/**\n\t * Constructs Prominent word object.\n\t *\n\t * @constructor\n\t *\n\t * @param {string} word             The word.\n\t * @param {string} [stem]           The stem / base form of the word, defaults to the word.\n\t * @param {number} [occurrences]    The number of occurrences, defaults to 0.\n\t */\n\tconstructor( word, stem, occurrences ) {\n\t\tthis._word = word;\n\t\tthis._stem = stem ? stem : word;\n\t\tthis._occurrences = occurrences || 0;\n\t}\n\n\t/**\n\t * Sets the word.\n\t *\n\t * @param {string} word The word to set.\n\t *\n\t * @returns {void}.\n\t */\n\tsetWord( word ) {\n\t\tthis._word = word;\n\t}\n\n\t/**\n\t * Returns the word.\n\t *\n\t * @returns {string} The word.\n\t */\n\tgetWord() {\n\t\treturn this._word;\n\t}\n\n\t/**\n\t * Returns the stem of the word.\n\t *\n\t * @returns {string} The stem.\n\t */\n\tgetStem() {\n\t\treturn this._stem;\n\t}\n\n\t/**\n\t * Sets the number of occurrences to the word.\n\t *\n\t * @param {int} numberOfOccurrences The number of occurrences to set.\n\t *\n\t * @returns {void}.\n\t */\n\tsetOccurrences( numberOfOccurrences ) {\n\t\tthis._occurrences = numberOfOccurrences;\n\t}\n\n\t/**\n\t * Returns the amount of occurrences of this word.\n\t *\n\t * @returns {number} The number of occurrences.\n\t */\n\tgetOccurrences() {\n\t\treturn this._occurrences;\n\t}\n\n\t/**\n\t * Serializes the ProminentWord instance to an object.\n\t *\n\t * @returns {Object} The serialized ProminentWord.\n\t */\n\tserialize() {\n\t\treturn {\n\t\t\t_parseClass: \"ProminentWord\",\n\t\t\tword: this._word,\n\t\t\tstem: this._stem,\n\t\t\toccurrences: this._occurrences,\n\t\t};\n\t}\n\n\t/**\n\t * Parses the object to a ProminentWord.\n\t *\n\t * @param {Object} serialized The serialized object.\n\t *\n\t * @returns {ProminentWord} The parsed ProminentWord.\n\t */\n\tstatic parse( serialized ) {\n\t\treturn new ProminentWord( serialized.word, serialized.stem, serialized.occurrences );\n\t}\n}\n\nexport default ProminentWord;\n"],"mappings":"AAAA;AACA;AACA;AACA,MAAMA,aAAa,CAAC;EACnB;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACCC,WAAWA,CAAEC,IAAI,EAAEC,IAAI,EAAEC,WAAW,EAAG;IACtC,IAAI,CAACC,KAAK,GAAGH,IAAI;IACjB,IAAI,CAACI,KAAK,GAAGH,IAAI,GAAGA,IAAI,GAAGD,IAAI;IAC/B,IAAI,CAACK,YAAY,GAAGH,WAAW,IAAI,CAAC;EACrC;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;EACCI,OAAOA,CAAEN,IAAI,EAAG;IACf,IAAI,CAACG,KAAK,GAAGH,IAAI;EAClB;;EAEA;AACD;AACA;AACA;AACA;EACCO,OAAOA,CAAA,EAAG;IACT,OAAO,IAAI,CAACJ,KAAK;EAClB;;EAEA;AACD;AACA;AACA;AACA;EACCK,OAAOA,CAAA,EAAG;IACT,OAAO,IAAI,CAACJ,KAAK;EAClB;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;EACCK,cAAcA,CAAEC,mBAAmB,EAAG;IACrC,IAAI,CAACL,YAAY,GAAGK,mBAAmB;EACxC;;EAEA;AACD;AACA;AACA;AACA;EACCC,cAAcA,CAAA,EAAG;IAChB,OAAO,IAAI,CAACN,YAAY;EACzB;;EAEA;AACD;AACA;AACA;AACA;EACCO,SAASA,CAAA,EAAG;IACX,OAAO;MACNC,WAAW,EAAE,eAAe;MAC5Bb,IAAI,EAAE,IAAI,CAACG,KAAK;MAChBF,IAAI,EAAE,IAAI,CAACG,KAAK;MAChBF,WAAW,EAAE,IAAI,CAACG;IACnB,CAAC;EACF;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;EACC,OAAOS,KAAKA,CAAEC,UAAU,EAAG;IAC1B,OAAO,IAAIjB,aAAa,CAAEiB,UAAU,CAACf,IAAI,EAAEe,UAAU,CAACd,IAAI,EAAEc,UAAU,CAACb,WAAY,CAAC;EACrF;AACD;AAEA,eAAeJ,aAAa","ignoreList":[]}

package/build/languageProcessing/values/Sentence.js

@@ -0,0 +1,110 @@
+/**
+ * Construct the Sentence object and set the sentence text.
+ *
+ * @param {string} sentence The text of the sentence.
+ * @constructor
+ */
+class Sentence {
+  /**
+   * Constructor.
+   *
+   * @param {string} sentence The sentence.
+   * @constructor
+   */
+  constructor(sentence) {
+    this._sentenceText = sentence || "";
+    this._isPassive = false;
+    this._clauses = [];
+  }
+
+  /**
+   * Returns the sentence text.
+   *
+   * @returns {string} The sentence.
+   */
+  getSentenceText() {
+    return this._sentenceText;
+  }
+
+  /**
+   * Returns the passiveness of a sentence.
+   *
+   * @returns {boolean} True if passive, otherwise returns false.
+   */
+  isPassive() {
+    return this._isPassive;
+  }
+
+  /**
+   * Sets the passiveness of the sentence.
+   *
+   * @param {boolean} passive Whether the sentence is passive or not.
+   * @returns {void}
+   */
+  setPassive(passive) {
+    this._isPassive = passive;
+  }
+
+  /**
+   * Returns an array of clauses.
+   *
+   * @returns {Clause[]} The clauses of the sentence.
+   */
+  getClauses() {
+    return this._clauses;
+  }
+
+  /**
+   * Sets the clauses.
+   *
+   * @param {Clause[]} clauses The clauses of the sentence.
+   *
+   * @returns {void}
+   */
+  setClauses(clauses) {
+    this._clauses = clauses;
+
+    // Directly set the sentence passiveness based on the passiveness of the clauses that are just set.
+    this.setSentencePassiveness();
+  }
+
+  /**
+   * Sets the passiveness of the sentence. A sentence is passive if it contains at least one passive clause.
+   *
+   * @returns {void}
+   */
+  setSentencePassiveness() {
+    const passiveClauses = this.getClauses().filter(clause => clause.isPassive() === true);
+    this.setPassive(passiveClauses.length > 0);
+  }
+
+  /**
+   * Serializes the Sentence instance to an object.
+   *
+   * @returns {Object} The serialized Sentence.
+   */
+  serialize() {
+    return {
+      _parseClass: "Sentence",
+      sentenceText: this._sentenceText,
+      isPassive: this._isPassive,
+      clauses: this._clauses
+    };
+  }
+
+  /**
+   * Parses the object to a Sentence.
+   *
+   * @param {Object} serialized The serialized object.
+   *
+   * @returns {Sentence} The parsed Sentence.
+   */
+  static parse(serialized) {
+    const sentence = new Sentence(serialized.sentenceText);
+    sentence.setClauses(serialized.clauses);
+    sentence.setPassive(serialized.isPassive);
+    return sentence;
+  }
+}
+export default Sentence;
+//# sourceMappingURL=Sentence.js.map

package/build/languageProcessing/values/Sentence.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Sentence.js","names":["Sentence","constructor","sentence","_sentenceText","_isPassive","_clauses","getSentenceText","isPassive","setPassive","passive","getClauses","setClauses","clauses","setSentencePassiveness","passiveClauses","filter","clause","length","serialize","_parseClass","sentenceText","parse","serialized"],"sources":["../../../src/languageProcessing/values/Sentence.js"],"sourcesContent":["/**\n * Construct the Sentence object and set the sentence text.\n *\n * @param {string} sentence The text of the sentence.\n * @constructor\n */\nclass Sentence {\n\t/**\n\t * Constructor.\n\t *\n\t * @param {string} sentence The sentence.\n\t * @constructor\n\t */\n\tconstructor( sentence ) {\n\t\tthis._sentenceText = sentence || \"\";\n\t\tthis._isPassive = false;\n\t\tthis._clauses = [];\n\t}\n\n\t/**\n\t * Returns the sentence text.\n\t *\n\t * @returns {string} The sentence.\n\t */\n\tgetSentenceText() {\n\t\treturn this._sentenceText;\n\t}\n\n\t/**\n\t * Returns the passiveness of a sentence.\n\t *\n\t * @returns {boolean} True if passive, otherwise returns false.\n\t */\n\tisPassive() {\n\t\treturn this._isPassive;\n\t}\n\n\t/**\n\t * Sets the passiveness of the sentence.\n\t *\n\t * @param {boolean} passive Whether the sentence is passive or not.\n\t * @returns {void}\n\t */\n\tsetPassive( passive ) {\n\t\tthis._isPassive = passive;\n\t}\n\n\t/**\n\t * Returns an array of clauses.\n\t *\n\t * @returns {Clause[]} The clauses of the sentence.\n\t */\n\tgetClauses() {\n\t\treturn this._clauses;\n\t}\n\n\t/**\n\t * Sets the clauses.\n\t *\n\t * @param {Clause[]} clauses The clauses of the sentence.\n\t *\n\t * @returns {void}\n\t */\n\tsetClauses( clauses ) {\n\t\tthis._clauses = clauses;\n\n\t\t// Directly set the sentence passiveness based on the passiveness of the clauses that are just set.\n\t\tthis.setSentencePassiveness();\n\t}\n\n\t/**\n\t * Sets the passiveness of the sentence. A sentence is passive if it contains at least one passive clause.\n\t *\n\t * @returns {void}\n\t */\n\tsetSentencePassiveness() {\n\t\tconst passiveClauses = this.getClauses().filter( clause => clause.isPassive() === true );\n\t\tthis.setPassive( passiveClauses.length > 0 );\n\t}\n\n\t/**\n\t * Serializes the Sentence instance to an object.\n\t *\n\t * @returns {Object} The serialized Sentence.\n\t */\n\tserialize() {\n\t\treturn {\n\t\t\t_parseClass: \"Sentence\",\n\t\t\tsentenceText: this._sentenceText,\n\t\t\tisPassive: this._isPassive,\n\t\t\tclauses: this._clauses,\n\t\t};\n\t}\n\n\t/**\n\t * Parses the object to a Sentence.\n\t *\n\t * @param {Object} serialized The serialized object.\n\t *\n\t * @returns {Sentence} The parsed Sentence.\n\t */\n\tstatic parse( serialized ) {\n\t\tconst sentence = new Sentence( serialized.sentenceText );\n\t\tsentence.setClauses( serialized.clauses );\n\t\tsentence.setPassive( serialized.isPassive );\n\n\t\treturn sentence;\n\t}\n}\n\nexport default Sentence;\n"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMA,QAAQ,CAAC;EACd;AACD;AACA;AACA;AACA;AACA;EACCC,WAAWA,CAAEC,QAAQ,EAAG;IACvB,IAAI,CAACC,aAAa,GAAGD,QAAQ,IAAI,EAAE;IACnC,IAAI,CAACE,UAAU,GAAG,KAAK;IACvB,IAAI,CAACC,QAAQ,GAAG,EAAE;EACnB;;EAEA;AACD;AACA;AACA;AACA;EACCC,eAAeA,CAAA,EAAG;IACjB,OAAO,IAAI,CAACH,aAAa;EAC1B;;EAEA;AACD;AACA;AACA;AACA;EACCI,SAASA,CAAA,EAAG;IACX,OAAO,IAAI,CAACH,UAAU;EACvB;;EAEA;AACD;AACA;AACA;AACA;AACA;EACCI,UAAUA,CAAEC,OAAO,EAAG;IACrB,IAAI,CAACL,UAAU,GAAGK,OAAO;EAC1B;;EAEA;AACD;AACA;AACA;AACA;EACCC,UAAUA,CAAA,EAAG;IACZ,OAAO,IAAI,CAACL,QAAQ;EACrB;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;EACCM,UAAUA,CAAEC,OAAO,EAAG;IACrB,IAAI,CAACP,QAAQ,GAAGO,OAAO;;IAEvB;IACA,IAAI,CAACC,sBAAsB,CAAC,CAAC;EAC9B;;EAEA;AACD;AACA;AACA;AACA;EACCA,sBAAsBA,CAAA,EAAG;IACxB,MAAMC,cAAc,GAAG,IAAI,CAACJ,UAAU,CAAC,CAAC,CAACK,MAAM,CAAEC,MAAM,IAAIA,MAAM,CAACT,SAAS,CAAC,CAAC,KAAK,IAAK,CAAC;IACxF,IAAI,CAACC,UAAU,CAAEM,cAAc,CAACG,MAAM,GAAG,CAAE,CAAC;EAC7C;;EAEA;AACD;AACA;AACA;AACA;EACCC,SAASA,CAAA,EAAG;IACX,OAAO;MACNC,WAAW,EAAE,UAAU;MACvBC,YAAY,EAAE,IAAI,CAACjB,aAAa;MAChCI,SAAS,EAAE,IAAI,CAACH,UAAU;MAC1BQ,OAAO,EAAE,IAAI,CAACP;IACf,CAAC;EACF;;EAEA;AACD;AACA;AACA;AACA;AACA;AACA;EACC,OAAOgB,KAAKA,CAAEC,UAAU,EAAG;IAC1B,MAAMpB,QAAQ,GAAG,IAAIF,QAAQ,CAAEsB,UAAU,CAACF,YAAa,CAAC;IACxDlB,QAAQ,CAACS,UAAU,CAAEW,UAAU,CAACV,OAAQ,CAAC;IACzCV,QAAQ,CAACM,UAAU,CAAEc,UAAU,CAACf,SAAU,CAAC;IAE3C,OAAOL,QAAQ;EAChB;AACD;AAEA,eAAeF,QAAQ","ignoreList":[]}

package/build/languageProcessing/values/index.js

@@ -0,0 +1,5 @@
+import Clause from "./Clause";
+import ProminentWord from "./ProminentWord";
+import Sentence from "./Sentence";
+export { Clause, ProminentWord, Sentence };
+//# sourceMappingURL=index.js.map

package/build/languageProcessing/values/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","names":["Clause","ProminentWord","Sentence"],"sources":["../../../src/languageProcessing/values/index.js"],"sourcesContent":["import Clause from \"./Clause\";\nimport ProminentWord from \"./ProminentWord\";\nimport Sentence from \"./Sentence\";\n\nexport {\n\tClause,\n\tProminentWord,\n\tSentence,\n};\n"],"mappings":"AAAA,OAAOA,MAAM;AACb,OAAOC,aAAa;AACpB,OAAOC,QAAQ;AAEf,SACCF,MAAM,EACNC,aAAa,EACbC,QAAQ","ignoreList":[]}

package/build/markers/addMark.js

@@ -0,0 +1,10 @@
+/**
+ * Marks a text with HTML tags
+ *
+ * @param {string} text The unmarked text.
+ * @returns {string} The marked text.
+ */
+export default function (text) {
+  return "<yoastmark class='yoast-text-mark'>" + text + "</yoastmark>";
+}
+//# sourceMappingURL=addMark.js.map

package/build/markers/addMark.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"addMark.js","names":["text"],"sources":["../../src/markers/addMark.js"],"sourcesContent":["/**\n * Marks a text with HTML tags\n *\n * @param {string} text The unmarked text.\n * @returns {string} The marked text.\n */\nexport default function( text ) {\n\treturn \"<yoastmark class='yoast-text-mark'>\" + text + \"</yoastmark>\";\n}\n"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,UAAUA,IAAI,EAAG;EAC/B,OAAO,qCAAqC,GAAGA,IAAI,GAAG,cAAc;AACrE","ignoreList":[]}

package/build/markers/addMarkSingleWord.js

@@ -0,0 +1,32 @@
+import { stripWordBoundariesStart, stripWordBoundariesEnd } from "../languageProcessing/helpers/sanitize/stripWordBoundaries";
+import { escapeRegExp } from "lodash";
+
+/**
+ * Marks a text with HTML tags, deals with word boundaries that were matched by regexes, but which should not be marked.
+ *
+ * @param {string} text The unmarked text.
+ *
+ * @returns {string} The marked text.
+ */
+export default function (text) {
+  // Strip the word boundaries at the start of the text.
+  const strippedTextStart = stripWordBoundariesStart(text);
+  let wordBoundaryStart = "";
+  let wordBoundaryEnd = "";
+
+  // Get the actual word boundaries from the start of the text.
+  if (strippedTextStart !== text) {
+    const wordBoundaryStartIndex = text.search(escapeRegExp(strippedTextStart));
+    wordBoundaryStart = text.substring(0, wordBoundaryStartIndex);
+  }
+
+  // Strip word boundaries at the end of the text.
+  const strippedTextEnd = stripWordBoundariesEnd(strippedTextStart);
+  // Get the actual word boundaries from the end of the text.
+  if (strippedTextEnd !== strippedTextStart) {
+    const wordBoundaryEndIndex = strippedTextStart.search(escapeRegExp(strippedTextEnd)) + strippedTextEnd.length;
+    wordBoundaryEnd = strippedTextStart.substring(wordBoundaryEndIndex);
+  }
+  return wordBoundaryStart + "<yoastmark class='yoast-text-mark'>" + strippedTextEnd + "</yoastmark>" + wordBoundaryEnd;
+}
+//# sourceMappingURL=addMarkSingleWord.js.map

package/build/markers/addMarkSingleWord.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"addMarkSingleWord.js","names":["stripWordBoundariesStart","stripWordBoundariesEnd","escapeRegExp","text","strippedTextStart","wordBoundaryStart","wordBoundaryEnd","wordBoundaryStartIndex","search","substring","strippedTextEnd","wordBoundaryEndIndex","length"],"sources":["../../src/markers/addMarkSingleWord.js"],"sourcesContent":["import { stripWordBoundariesStart, stripWordBoundariesEnd } from \"../languageProcessing/helpers/sanitize/stripWordBoundaries\";\nimport { escapeRegExp } from \"lodash\";\n\n/**\n * Marks a text with HTML tags, deals with word boundaries that were matched by regexes, but which should not be marked.\n *\n * @param {string} text The unmarked text.\n *\n * @returns {string} The marked text.\n */\nexport default function( text ) {\n\t// Strip the word boundaries at the start of the text.\n\tconst strippedTextStart = stripWordBoundariesStart( text );\n\tlet wordBoundaryStart = \"\";\n\tlet wordBoundaryEnd = \"\";\n\n\t// Get the actual word boundaries from the start of the text.\n\tif ( strippedTextStart !== text ) {\n\t\tconst wordBoundaryStartIndex = text.search( escapeRegExp( strippedTextStart ) );\n\t\twordBoundaryStart = text.substring( 0, wordBoundaryStartIndex );\n\t}\n\n\t// Strip word boundaries at the end of the text.\n\tconst strippedTextEnd = stripWordBoundariesEnd( strippedTextStart );\n\t// Get the actual word boundaries from the end of the text.\n\tif ( strippedTextEnd !== strippedTextStart ) {\n\t\tconst wordBoundaryEndIndex = strippedTextStart.search( escapeRegExp( strippedTextEnd ) ) + strippedTextEnd.length;\n\t\twordBoundaryEnd = strippedTextStart.substring( wordBoundaryEndIndex );\n\t}\n\n\treturn wordBoundaryStart + \"<yoastmark class='yoast-text-mark'>\" + strippedTextEnd + \"</yoastmark>\" + wordBoundaryEnd;\n}\n"],"mappings":"AAAA,SAASA,wBAAwB,EAAEC,sBAAsB;AACzD,SAASC,YAAY,QAAQ,QAAQ;;AAErC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,UAAUC,IAAI,EAAG;EAC/B;EACA,MAAMC,iBAAiB,GAAGJ,wBAAwB,CAAEG,IAAK,CAAC;EAC1D,IAAIE,iBAAiB,GAAG,EAAE;EAC1B,IAAIC,eAAe,GAAG,EAAE;;EAExB;EACA,IAAKF,iBAAiB,KAAKD,IAAI,EAAG;IACjC,MAAMI,sBAAsB,GAAGJ,IAAI,CAACK,MAAM,CAAEN,YAAY,CAAEE,iBAAkB,CAAE,CAAC;IAC/EC,iBAAiB,GAAGF,IAAI,CAACM,SAAS,CAAE,CAAC,EAAEF,sBAAuB,CAAC;EAChE;;EAEA;EACA,MAAMG,eAAe,GAAGT,sBAAsB,CAAEG,iBAAkB,CAAC;EACnE;EACA,IAAKM,eAAe,KAAKN,iBAAiB,EAAG;IAC5C,MAAMO,oBAAoB,GAAGP,iBAAiB,CAACI,MAAM,CAAEN,YAAY,CAAEQ,eAAgB,CAAE,CAAC,GAAGA,eAAe,CAACE,MAAM;IACjHN,eAAe,GAAGF,iBAAiB,CAACK,SAAS,CAAEE,oBAAqB,CAAC;EACtE;EAEA,OAAON,iBAAiB,GAAG,qCAAqC,GAAGK,eAAe,GAAG,cAAc,GAAGJ,eAAe;AACtH","ignoreList":[]}

package/build/markers/index.js

@@ -0,0 +1,4 @@
+import removeMarks from "./removeMarks";
+import addMark from "./addMark";
+export { addMark, removeMarks };
+//# sourceMappingURL=index.js.map

package/build/markers/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","names":["removeMarks","addMark"],"sources":["../../src/markers/index.js"],"sourcesContent":["import removeMarks from \"./removeMarks\";\nimport addMark from \"./addMark\";\n\nexport {\n\taddMark,\n\tremoveMarks,\n};\n"],"mappings":"AAAA,OAAOA,WAAW;AAClB,OAAOC,OAAO;AAEd,SACCA,OAAO,EACPD,WAAW","ignoreList":[]}

package/build/markers/removeDuplicateMarks.js

@@ -0,0 +1,26 @@
+import { uniqBy } from "lodash";
+
+/**
+ * Removes duplicate marks from an array.
+ * If the marks object have position information, however,
+ * we don't want to remove the duplicated objects with the same original strings.
+ *
+ * @param {Array} marks The marks to remove duplications from.
+ *
+ * @returns {Array} A list of de-duplicated marks.
+ */
+function removeDuplicateMarks(marks) {
+  /*
+   * We don't remove duplicates when mark has position information, for the reasons below:
+   * 1. Not removing duplicates is simpler than removing the duplicates by looking at the value of mark.getPosition().
+   * 2. Our current approach of creating a mark object with position information eliminates the chance of having duplicates.
+   */
+  if (!!marks && (marks.length === 0 || !!marks[0].hasPosition())) {
+    return marks;
+  }
+  return uniqBy(marks, function (mark) {
+    return mark.getOriginal();
+  });
+}
+export default removeDuplicateMarks;
+//# sourceMappingURL=removeDuplicateMarks.js.map

package/build/markers/removeDuplicateMarks.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"removeDuplicateMarks.js","names":["uniqBy","removeDuplicateMarks","marks","length","hasPosition","mark","getOriginal"],"sources":["../../src/markers/removeDuplicateMarks.js"],"sourcesContent":["import { uniqBy } from \"lodash\";\n\n/**\n * Removes duplicate marks from an array.\n * If the marks object have position information, however,\n * we don't want to remove the duplicated objects with the same original strings.\n *\n * @param {Array} marks The marks to remove duplications from.\n *\n * @returns {Array} A list of de-duplicated marks.\n */\nfunction removeDuplicateMarks( marks ) {\n\t/*\n\t * We don't remove duplicates when mark has position information, for the reasons below:\n\t * 1. Not removing duplicates is simpler than removing the duplicates by looking at the value of mark.getPosition().\n\t * 2. Our current approach of creating a mark object with position information eliminates the chance of having duplicates.\n\t */\n\tif ( !! marks && ( marks.length === 0 || !! marks[ 0 ].hasPosition() ) ) {\n\t\treturn marks;\n\t}\n\n\treturn uniqBy( marks, function( mark ) {\n\t\treturn mark.getOriginal();\n\t} );\n}\n\nexport default removeDuplicateMarks;\n"],"mappings":"AAAA,SAASA,MAAM,QAAQ,QAAQ;;AAE/B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,oBAAoBA,CAAEC,KAAK,EAAG;EACtC;AACD;AACA;AACA;AACA;EACC,IAAK,CAAC,CAAEA,KAAK,KAAMA,KAAK,CAACC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAED,KAAK,CAAE,CAAC,CAAE,CAACE,WAAW,CAAC,CAAC,CAAE,EAAG;IACxE,OAAOF,KAAK;EACb;EAEA,OAAOF,MAAM,CAAEE,KAAK,EAAE,UAAUG,IAAI,EAAG;IACtC,OAAOA,IAAI,CAACC,WAAW,CAAC,CAAC;EAC1B,CAAE,CAAC;AACJ;AAEA,eAAeL,oBAAoB","ignoreList":[]}

package/build/markers/removeMarks.js

@@ -0,0 +1,10 @@
+/**
+ * Removes all marks from a text
+ *
+ * @param {string} text The marked text.
+ * @returns {string} The unmarked text.
+ */
+export default function (text) {
+  return text.replace(new RegExp("<yoastmark[^>]*>", "g"), "").replace(new RegExp("</yoastmark>", "g"), "");
+}
+//# sourceMappingURL=removeMarks.js.map

package/build/markers/removeMarks.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"removeMarks.js","names":["text","replace","RegExp"],"sources":["../../src/markers/removeMarks.js"],"sourcesContent":["/**\n * Removes all marks from a text\n *\n * @param {string} text The marked text.\n * @returns {string} The unmarked text.\n */\nexport default function( text ) {\n\treturn text\n\t\t.replace( new RegExp( \"<yoastmark[^>]*>\", \"g\" ), \"\" )\n\t\t.replace( new RegExp( \"</yoastmark>\", \"g\" ), \"\" );\n}\n"],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,UAAUA,IAAI,EAAG;EAC/B,OAAOA,IAAI,CACTC,OAAO,CAAE,IAAIC,MAAM,CAAE,kBAAkB,EAAE,GAAI,CAAC,EAAE,EAAG,CAAC,CACpDD,OAAO,CAAE,IAAIC,MAAM,CAAE,cAAc,EAAE,GAAI,CAAC,EAAE,EAAG,CAAC;AACnD","ignoreList":[]}