axyseo 2.0.0-alpha.0.0.19 → 2.0.0-alpha.0.0.2

package/build/languageProcessing/languages/fr/helpers/internal/stem.js

@@ -1,544 +0,0 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = stem;
-var _index = require("../../../../../index.js");
-/* eslint-disable max-statements, complexity */
-
-const {
-  exceptionListHelpers: {
-    checkIfWordEndingIsOnExceptionList
-  },
-  regexHelpers: {
-    applyAllReplacements
-  }
-} = _index.languageProcessing;
-
-/*
- * MIT License
- *
- * Copyright (c) 2017 Bastien Botella
- *
- * Permission is hereby granted, free of charge, to any person obtaining a copy
- * of this software and associated documentation files (the "Software"), to deal
- * in the Software without restriction, including without limitation the rights
- * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
- * copies of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be included in all
- * copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
- * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
- * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
- * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- */
-/*
- * Author: Kasun Gajasinghe, University of Moratuwa
- * E-Mail: kasunbg AT gmail DOT com
- * Date: 09.08.2010
- *
- * LICENSE:
- *
- * Copyright (c) 2010, Kasun Gajasinghe. All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without modification,
- * are permitted provided that the following conditions are met:
- *
- *    1. Redistributions of source code must retain the above copyright notice,
- *       this list of conditions and the following disclaimer.
- *
- *    2. Redistributions in binary form must reproduce the above copyright notice,
- *       this list of conditions and the following disclaimer in the documentation
- *       and/or other materials provided with the distribution.
- *
- *
- * THIS SOFTWARE IS PROVIDED BY KASUN GAJASINGHE ""AS IS"" AND ANY EXPRESS OR IMPLIED WARRANTIES,
- * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
- * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL KASUN GAJASINGHE BE LIABLE FOR ANY DIRECT,
- * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
- * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
- * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
- * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE
- * USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- *
- */
-
-/**
- * Determines R1, R2 and RV.
- *
- * @param {string} word The word for which to determine the R regions.
- * @param {Object} rIntervalsData The regexes that cover French RV and R1 intervals.
- *
- * @returns {[number]} The R1, R2 and RV.
- */
-const determineRs = function (word, rIntervalsData) {
-  let rvIndex;
-  if (word.search(new RegExp(rIntervalsData.rvRegex1)) !== -1 || word.search(new RegExp(rIntervalsData.rvRegex2)) !== -1) {
-    rvIndex = 3;
-  } else {
-    rvIndex = word.substring(1).search(new RegExp(rIntervalsData.rvRegex3));
-    if (rvIndex === -1) {
-      rvIndex = word.length;
-    } else {
-      // +2 is to supplement the substring(1) used to find rvIndex
-      rvIndex += 2;
-    }
-  }
-  /*
-   * R1 is the region after the first non-vowel following a vowel, or the end of the word if there is no such non-vowel.
-   * R2 is the region after the first non-vowel following a vowel in R1, or the end of the word if there is no such non-vowel.
-   */
-  const r1Regex = new RegExp(rIntervalsData.r1Regex);
-  let r1Index = word.search(r1Regex);
-  let r1 = '';
-  if (r1Index === -1) {
-    r1Index = word.length;
-  } else {
-    r1Index += 2;
-    r1 = word.substring(r1Index);
-  }
-  let r2Index = r1.search(r1Regex);
-  if (r2Index === -1) {
-    r2Index = word.length;
-  } else {
-    r2Index += 2;
-    r2Index += r1Index;
-  }
-  if (r1Index !== -1 && r1Index < 3) {
-    r1Index = 3;
-  }
-  return [r1Index, r2Index, rvIndex];
-};
-
-/**
- * Removes or normalizes standard suffixes.
- *
- * @param {string} word               The word for which to remove suffixes.
- * @param {Object} standardSuffixData The French morphology data covering standard suffixes.
- * @param {number} r1Index            The start index of R1.
- * @param {number} r2Index            The start index of R2.
- * @param {number} rvIndex            The start index of RV.
- *
- * @returns {string} The word with standard suffixes removed or normalized.
- */
-const processStandardSuffixes = function (word, standardSuffixData, r1Index, r2Index, rvIndex) {
-  const a1Index = word.search(new RegExp(standardSuffixData.standardSuffixes1));
-  const a2Index = word.search(new RegExp(standardSuffixData.standardSuffixes2));
-  const a3Index = word.search(new RegExp(standardSuffixData.standardSuffixes3[0]));
-  const a4Index = word.search(new RegExp(standardSuffixData.standardSuffixes4[0]));
-  const a5Index = word.search(new RegExp(standardSuffixData.standardSuffixes5[0]));
-  const a6Index = word.search(new RegExp(standardSuffixData.standardSuffixes6));
-  const a7Index = word.search(new RegExp(standardSuffixData.standardSuffixes7));
-  const a8Index = word.search(new RegExp(standardSuffixData.standardSuffixes8));
-  const a9Index = word.search(new RegExp(standardSuffixData.standardSuffixes9[0]));
-  const a10Index = word.search(new RegExp(standardSuffixData.standardSuffixes10[0]));
-  const a11Index = word.search(new RegExp(standardSuffixData.standardSuffixes11[0]));
-  const a12Index = word.search(new RegExp(standardSuffixData.standardSuffixes12));
-  const a13Index = word.search(new RegExp(standardSuffixData.standardSuffixes13[0]));
-  const a14Index = word.search(new RegExp(standardSuffixData.standardSuffixes14[0]));
-  const a15Index = word.search(new RegExp(standardSuffixData.standardSuffixes15));
-  if (a1Index !== -1 && a1Index >= r2Index) {
-    word = word.substring(0, a1Index);
-  } else if (a2Index !== -1 && a2Index >= r2Index) {
-    word = word.substring(0, a2Index);
-    const a2Index2 = word.search(new RegExp(standardSuffixData.suffixesPrecedingChar1[0]));
-    if (a2Index2 !== -1 && a2Index2 >= r2Index) {
-      // If preceded by ic, delete if in R2
-      word = word.substring(0, a2Index2);
-    } else {
-      // Else replace by iqU
-      word = word.replace(new RegExp(standardSuffixData.suffixesPrecedingChar1[0]), standardSuffixData.suffixesPrecedingChar1[1]);
-    }
-  } else if (a3Index !== -1 && a3Index >= r2Index) {
-    // Replace with log if in R2
-    word = word.slice(0, a3Index) + standardSuffixData.standardSuffixes3[1];
-  } else if (a4Index !== -1 && a4Index >= r2Index) {
-    // Replace with u if in R2
-    word = word.slice(0, a4Index) + standardSuffixData.standardSuffixes4[1];
-  } else if (a5Index !== -1 && a5Index >= r2Index) {
-    // Replace with ent if in R2
-    word = word.slice(0, a5Index) + standardSuffixData.standardSuffixes5[1];
-  } else if (a12Index !== -1 && a12Index >= r1Index) {
-    // +1- amendment to non-vowel
-    word = word.substring(0, a12Index + 1);
-  } else if (a6Index !== -1 && a6Index >= rvIndex) {
-    word = word.substring(0, a6Index);
-    const precedingCharacter2 = word.search(new RegExp(standardSuffixData.suffixesPrecedingChar2[0]));
-    const a6Index2 = word.search(new RegExp(standardSuffixData.suffixesPrecedingChar4[0]));
-    const precedingCharacter5 = word.search(new RegExp(standardSuffixData.suffixesPrecedingChar5[0]));
-    const precedingCharacter6 = word.search(new RegExp(standardSuffixData.suffixesPrecedingChar6[0]));
-    if (precedingCharacter2 >= r2Index) {
-      word = word.slice(0, precedingCharacter2) + standardSuffixData.suffixesPrecedingChar2[1];
-      const precedingCharacter3 = word.search(new RegExp(standardSuffixData.suffixesPrecedingChar3[0]));
-      if (precedingCharacter3 >= r2Index) {
-        word = word.slice(0, precedingCharacter3) + standardSuffixData.suffixesPrecedingChar3[1];
-      }
-    } else if (word.search(new RegExp(standardSuffixData.suffixesPrecedingChar4[0])) !== -1) {
-      if (a6Index2 >= r2Index) {
-        word = word.substring(0, a6Index2);
-      } else if (a6Index2 >= r1Index) {
-        word = word.substring(0, a6Index2) + standardSuffixData.suffixesPrecedingChar4[1];
-      }
-    } else if (precedingCharacter5 >= r2Index) {
-      // If preceded by abl or iqU, delete if in R2
-      word = word.slice(0, precedingCharacter5) + standardSuffixData.suffixesPrecedingChar5[1];
-    } else if (precedingCharacter6 >= rvIndex) {
-      // If preceded by ièr, replace with i if in RV
-      word = word.slice(0, precedingCharacter6) + standardSuffixData.suffixesPrecedingChar6[1];
-    }
-  } else if (a7Index !== -1 && a7Index >= r2Index) {
-    // Delete if in R2
-    word = word.substring(0, a7Index);
-    const a7Index2 = word.search(new RegExp(standardSuffixData.suffixesPrecedingChar7[0]));
-    const a7Index3 = word.search(new RegExp(standardSuffixData.suffixesPrecedingChar1[0]));
-    if (a7Index2 !== -1) {
-      // If preceded by abil, delete if in R2, else replace by abl, otherwise
-      if (a7Index2 >= r2Index) {
-        word = word.substring(0, a7Index2);
-      } else {
-        word = word.substring(0, a7Index2) + standardSuffixData.suffixesPrecedingChar7[1];
-      }
-    } else if (a7Index3 !== -1) {
-      if (a7Index3 !== -1 && a7Index3 >= r2Index) {
-        // If preceded by ic, delete if in R2
-        word = word.substring(0, a7Index3);
-      } else {
-        // Else replace by iqU
-        word = word.substring(0, a7Index3) + standardSuffixData.suffixesPrecedingChar1[1];
-      }
-    } else if (word.search(new RegExp(standardSuffixData.suffixesPrecedingChar2[0])) >= r2Index) {
-      word = word.replace(new RegExp(standardSuffixData.suffixesPrecedingChar2[0]), standardSuffixData.suffixesPrecedingChar2[1]);
-    }
-  } else if (a8Index !== -1 && a8Index >= r2Index) {
-    word = word.substring(0, a8Index);
-    if (word.search(new RegExp(standardSuffixData.suffixesPrecedingChar3[0])) >= r2Index) {
-      word = word.replace(new RegExp(standardSuffixData.suffixesPrecedingChar3[0]), standardSuffixData.suffixesPrecedingChar3[1]);
-      if (word.search(new RegExp(standardSuffixData.suffixesPrecedingChar1[0])) >= r2Index) {
-        word = word.replace(new RegExp(standardSuffixData.suffixesPrecedingChar1[0]), '');
-      } else {
-        word = word.replace(new RegExp(standardSuffixData.suffixesPrecedingChar1[0]), standardSuffixData.suffixesPrecedingChar1[1]);
-      }
-    }
-  } else if (a9Index !== -1) {
-    word = word.replace(new RegExp(standardSuffixData.standardSuffixes9[0]), standardSuffixData.standardSuffixes9[1]);
-  } else if (a10Index >= r1Index) {
-    word = word.replace(new RegExp(standardSuffixData.standardSuffixes10[0]), standardSuffixData.standardSuffixes10[1]);
-  } else if (a11Index !== -1) {
-    const a11Index2 = word.search(new RegExp(standardSuffixData.standardSuffixes11[0]));
-    if (a11Index2 >= r2Index) {
-      word = word.substring(0, a11Index2);
-    } else if (a11Index2 >= r1Index) {
-      word = word.substring(0, a11Index2) + standardSuffixData.standardSuffixes11[1];
-    }
-  } else if (a13Index !== -1 && a13Index >= rvIndex) {
-    word = word.replace(new RegExp(standardSuffixData.standardSuffixes13[0]), standardSuffixData.standardSuffixes13[1]);
-  } else if (a14Index !== -1 && a14Index >= rvIndex) {
-    word = word.replace(new RegExp(standardSuffixData.standardSuffixes14[0]), standardSuffixData.standardSuffixes14[1]);
-  } else if (a15Index !== -1 && a15Index >= rvIndex) {
-    word = word.substring(0, a15Index + 1);
-  }
-  return word;
-};
-
-/**
- * Removes verb suffixes starting with i.
- *
- * @param {string} word                       The word for which to remove suffixes.
- * @param {string} originalWord               The unprocessed word.
- * @param {number} rvIndex                    The start index of RV.
- * @param {string} verbSuffixesWithIBeginning Data for checking French suffixes starting with I.
- *
- * @returns {{step2aDone: boolean, word: string}} The word and information about whether the conditions for step 2a were met.
- */
-const removeVerbSuffixesStartingWithI = function (word, originalWord, rvIndex, verbSuffixesWithIBeginning) {
-  let step2aDone = false;
-  if (originalWord === word.toLowerCase() || checkIfWordEndingIsOnExceptionList(originalWord, verbSuffixesWithIBeginning.exceptions)) {
-    step2aDone = true;
-    const b1Regex = new RegExp(verbSuffixesWithIBeginning.suffixes[0]);
-    if (word.search(b1Regex) >= rvIndex) {
-      word = word.replace(b1Regex, verbSuffixesWithIBeginning.suffixes[1]);
-    }
-  }
-  return {
-    word,
-    step2aDone
-  };
-};
-
-/**
- * Removes other verb suffixes.
- *
- * @param {string}  word              The word for which to remove suffixes.
- * @param {boolean} step2aDone        Whether step 2a was done.
- * @param {string}  wordAfterStep1    The word after step 1 was done.
- * @param {number}  r2Index           The start index of R2.
- * @param {number}  rvIndex           The start index of RV.
- * @param {Object}  morphologyData    The French morphology data.
- *
- * @returns {string} The word after other verb suffixes were removed.
- */
-const removeOtherVerbSuffixes = function (word, step2aDone, wordAfterStep1, r2Index, rvIndex, morphologyData) {
-  const otherVerbSuffixes = morphologyData.regularStemmer.otherVerbSuffixes;
-  if (step2aDone && wordAfterStep1 === word) {
-    const suffixIons = new RegExp(otherVerbSuffixes[0]);
-    if (word.search(suffixIons) >= r2Index) {
-      return word.replace(suffixIons, '');
-    }
-    for (let i = 1; i < otherVerbSuffixes.length; i++) {
-      const regex = new RegExp(otherVerbSuffixes[i]);
-      if (word.search(regex) >= rvIndex) {
-        return word.replace(regex, '');
-      }
-    }
-    // Check if a word ends in "ons" preceded by "i", if it is "ons" is not stemmed.
-    if (word.endsWith('ions')) {
-      return word;
-    }
-
-    // Check if a word ends in "ons" preceded by other than "i" and stem it if it is in RV.
-    const verbSuffixOns = new RegExp(morphologyData.regularStemmer.verbSuffixOns);
-    if (word.search(verbSuffixOns) >= rvIndex) {
-      word = word.replace(verbSuffixOns, '');
-    }
-  }
-  return word;
-};
-
-/**
- * Removes residual suffixes.
- *
- * @param {string}  word                            The word for which to remove residual suffixes.
- * @param {number}  rvIndex                         The start index of RV.
- * @param {number}  r2Index                         The start index of R2.
- * @param {Object}  morphologyDataRegularStemmer    The French morphology data.
- *
- * @returns {string}                                The word after residual suffixes were removed.
- */
-const removeResidualSuffixes = function (word, rvIndex, r2Index, morphologyDataRegularStemmer) {
-  const residualSuffixes = morphologyDataRegularStemmer.residualSuffixes;
-  if (word.search(new RegExp(residualSuffixes.residualSuffixes1[0])) >= rvIndex) {
-    word = word.replace(new RegExp(residualSuffixes.residualSuffixes1[0]), residualSuffixes.residualSuffixes1[1]);
-  }
-  const e1Index = word.search(new RegExp(residualSuffixes.residualSuffix2));
-  if (e1Index >= r2Index && word.search(new RegExp(residualSuffixes.residualSuffix3)) >= rvIndex) {
-    word = word.substring(0, e1Index);
-  } else {
-    let e2Index = word.search(new RegExp(residualSuffixes.residualSuffixes4[0]));
-    if (e2Index >= rvIndex) {
-      word = word.substring(0, e2Index) + residualSuffixes.residualSuffixes4[1];
-    } else {
-      e2Index = word.search(new RegExp(residualSuffixes.residualSuffix5));
-      if (e2Index >= rvIndex) {
-        // Delete last e.
-        word = word.substring(0, e2Index);
-      } else {
-        e2Index = word.search(new RegExp(residualSuffixes.residualSuffix6[0]));
-        if (e2Index >= rvIndex) {
-          word = word.substring(0, e2Index) + residualSuffixes.residualSuffix6[1];
-        }
-      }
-    }
-  }
-  return word;
-};
-
-/**
- * Checks whether a word is in the full-form exception list and if so returns the canonical stem.
- *
- * @param {string} word	      The word to be checked.
- * @param {Object} exceptions The list of full-form exceptions to be checked in.
- *
- * @returns {null|string} The canonical stem or null if nothing was found.
- */
-const checkWordInFullFormExceptions = function (word, exceptions) {
-  for (const paradigm of exceptions) {
-    if (paradigm[1].includes(word)) {
-      return paradigm[0];
-    }
-  }
-  return null;
-};
-
-/**
- * Check whether the stem is on the exception list of stems that belong to one word. If it is, returns the canonical stem.
- *
- * @param {string}	stemmedWord					The stemmed word.
- * @param {Object}	stemsThatBelongToOneWord	The list of stems that belong to one word.
- *
- * @returns {null|string}	The canonical stem if word was found on the list.
- */
-const canonicalizeStem = function (stemmedWord, stemsThatBelongToOneWord) {
-  // Check the adjectives list.
-  for (const paradigm of stemsThatBelongToOneWord.adjectives) {
-    if (paradigm.includes(stemmedWord)) {
-      return paradigm[0];
-    }
-  }
-  // Check the verbs list. The infinitive stem is always the canonical stem for verbs.
-  for (const paradigm of stemsThatBelongToOneWord.verbs) {
-    if (paradigm.includes(stemmedWord)) {
-      return paradigm[0];
-    }
-  }
-};
-
-/**
- * Checks whether the word is on the list of words which should be stemmed, even though the suffix would not be found in the
- * required region. If the word is found on the list, the stem specified in that list is returned.
- *
- * @param {string}	word				The word to check.
- * @param {Object}	shortWordsAndStems	The list to check.
- *
- * @returns {null|string} The stem or null if the word was not found on the list.
- */
-const checkShortWordsExceptionList = function (word, shortWordsAndStems) {
-  // First check whether the word is on the sub-list of words that cannot take an extra -s suffix.
-  for (const wordStemPair of shortWordsAndStems.cannotTakeExtraSuffixS) {
-    if (wordStemPair[0] === word) {
-      return wordStemPair[1];
-    }
-  }
-  // If the word was not found on the first sub-list, check the second sub-list of words that can take an extra -s suffix.
-  if (word.endsWith('s')) {
-    word = word.slice(0, -1);
-  }
-  for (const wordStemPair of shortWordsAndStems.canTakeExtraSuffixS) {
-    if (wordStemPair[0] === word) {
-      return wordStemPair[1];
-    }
-  }
-};
-
-/**
- * Stems French words.
- *
- * @param {string} word             The word to stem.
- * @param {Object} morphologyData   The French morphology data.
- *
- * @returns {string} The stemmed word.
- */
-function stem(word, morphologyData) {
-  word = word.toLowerCase();
-  const originalWord = word;
-
-  // Check if the word is on an exception list of words that should be stemmed even though the suffix is not in the required region.
-  const wordAfterShortWordsCheck = checkShortWordsExceptionList(word, morphologyData.shortWordsAndStems);
-  if (wordAfterShortWordsCheck) {
-    return wordAfterShortWordsCheck;
-  }
-
-  // Check if the word is on an exception list for which all forms of a word and its stem are listed.
-  const ifException = checkWordInFullFormExceptions(word, morphologyData.exceptionStemsWithFullForms);
-  if (ifException) {
-    return ifException;
-  }
-
-  // Check the exception list of words with plural suffix -x.
-  if (word.endsWith('x')) {
-    const pluralsWithXSuffix = morphologyData.pluralsWithXSuffix;
-    if (pluralsWithXSuffix.includes(word)) {
-      return word.slice(0, -1);
-    }
-  }
-
-  // Check if the word is on the exception list of words for which -s should not be stemmed.
-  if (word.endsWith('s')) {
-    const sShouldNotBeStemmed = morphologyData.sShouldNotBeStemmed;
-    if (sShouldNotBeStemmed.includes(word)) {
-      return word;
-    }
-  }
-
-  // Check if the word is on the exception list of words for which -ent should not be stemmed.
-  const nonVerbsOnEnt = morphologyData.nonVerbsOnEnt;
-  if (word.endsWith('ent')) {
-    if (nonVerbsOnEnt.includes(word)) {
-      return word;
-    }
-  }
-  if (word.endsWith('ents')) {
-    if (nonVerbsOnEnt.includes(word.slice(0, -1))) {
-      return word.slice(0, -1);
-    }
-  }
-
-  // Check if word is on the exception list of nouns and adjectives for which the verb suffix -ons should not be stemmed.
-  const nonVerbsOnOns = morphologyData.nonVerbsOnOns;
-  if (word.endsWith('ons')) {
-    if (nonVerbsOnOns.includes(word)) {
-      return word.slice(0, -1);
-    }
-  }
-
-  // Pre-processing steps
-  word = applyAllReplacements(word, morphologyData.regularStemmer.preProcessingStepsRegexes);
-
-  // Determine R1, R2 & RV regions.
-  const [r1Index, r2Index, rvIndex] = determineRs(word, morphologyData.regularStemmer.rIntervals);
-
-  /*
-   * Step 1:
-   * Remove standard suffixes
-   */
-  word = processStandardSuffixes(word, morphologyData.regularStemmer.standardSuffixes, r1Index, r2Index, rvIndex);
-  const wordAfterStep1 = word;
-
-  /*
-   * Step 2a:
-   * Stem verb suffixes beginning with "i"
-   */
-  const verbSuffixesStartingWithIRemoved = removeVerbSuffixesStartingWithI(word, originalWord, rvIndex, morphologyData.regularStemmer.verbSuffixesWithIBeginning);
-  word = verbSuffixesStartingWithIRemoved.word;
-  const step2aDone = verbSuffixesStartingWithIRemoved.step2aDone;
-
-  /*
-   * Step 2b:
-   * Stem other verb suffixes
-   */
-  if (!nonVerbsOnEnt.includes(word)) {
-    word = removeOtherVerbSuffixes(word, step2aDone, wordAfterStep1, r2Index, rvIndex, morphologyData);
-  }
-  if (originalWord === word.toLowerCase()) {
-    /* Step 4:
-     * Stem residual suffixes.
-     */
-    word = removeResidualSuffixes(word, rvIndex, r2Index, morphologyData.regularStemmer);
-  } else {
-    /*
-     * Step 3 (only needs to be executed if step 4 isn't executed)
-     * Replace final Y with i or final ç with c.
-     */
-    const yEnding = morphologyData.regularStemmer.yAndSoftCEndingAndReplacement.yEndingAndReplacement;
-    const softCEnding = morphologyData.regularStemmer.yAndSoftCEndingAndReplacement.softCEndingAndReplacement;
-    if (word.endsWith(yEnding[0])) {
-      word = word.slice(0, -1) + yEnding[1];
-    } else if (word.endsWith(softCEnding[0])) {
-      word = word.slice(0, -1) + softCEnding[1];
-    }
-  }
-
-  /* Step 5:
-   * Undouble final consonants
-   */
-  word = applyAllReplacements(word, morphologyData.regularStemmer.finalConsonantUndoubling);
-
-  /* Step 6:
-   * Un-accent
-   */
-  const unaccentE = morphologyData.regularStemmer.unaccentERegex;
-  word = word.replace(new RegExp(unaccentE[0]), unaccentE[1]);
-  word = word.toLowerCase();
-  const canonicalStem = canonicalizeStem(word, morphologyData.stemsThatBelongToOneWord);
-  if (canonicalStem) {
-    return canonicalStem;
-  }
-  return word;
-}
-//# sourceMappingURL=stem.js.map

package/build/languageProcessing/languages/fr/helpers/internal/stem.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"stem.js","names":["_index","require","exceptionListHelpers","checkIfWordEndingIsOnExceptionList","regexHelpers","applyAllReplacements","languageProcessing","determineRs","word","rIntervalsData","rvIndex","search","RegExp","rvRegex1","rvRegex2","substring","rvRegex3","length","r1Regex","r1Index","r1","r2Index","processStandardSuffixes","standardSuffixData","a1Index","standardSuffixes1","a2Index","standardSuffixes2","a3Index","standardSuffixes3","a4Index","standardSuffixes4","a5Index","standardSuffixes5","a6Index","standardSuffixes6","a7Index","standardSuffixes7","a8Index","standardSuffixes8","a9Index","standardSuffixes9","a10Index","standardSuffixes10","a11Index","standardSuffixes11","a12Index","standardSuffixes12","a13Index","standardSuffixes13","a14Index","standardSuffixes14","a15Index","standardSuffixes15","a2Index2","suffixesPrecedingChar1","replace","slice","precedingCharacter2","suffixesPrecedingChar2","a6Index2","suffixesPrecedingChar4","precedingCharacter5","suffixesPrecedingChar5","precedingCharacter6","suffixesPrecedingChar6","precedingCharacter3","suffixesPrecedingChar3","a7Index2","suffixesPrecedingChar7","a7Index3","a11Index2","removeVerbSuffixesStartingWithI","originalWord","verbSuffixesWithIBeginning","step2aDone","toLowerCase","exceptions","b1Regex","suffixes","removeOtherVerbSuffixes","wordAfterStep1","morphologyData","otherVerbSuffixes","regularStemmer","suffixIons","i","regex","endsWith","verbSuffixOns","removeResidualSuffixes","morphologyDataRegularStemmer","residualSuffixes","residualSuffixes1","e1Index","residualSuffix2","residualSuffix3","e2Index","residualSuffixes4","residualSuffix5","residualSuffix6","checkWordInFullFormExceptions","paradigm","includes","canonicalizeStem","stemmedWord","stemsThatBelongToOneWord","adjectives","verbs","checkShortWordsExceptionList","shortWordsAndStems","wordStemPair","cannotTakeExtraSuffixS","canTakeExtraSuffixS","stem","wordAfterShortWordsCheck","ifException","exceptionStemsWithFullForms","pluralsWithXSuffix","sShouldNotBeStemmed","nonVerbsOnEnt","nonVerbsOnOns","preProcessingStepsRegexes","rIntervals","standardSuffixes","verbSuffixesStartingWithIRemoved","yEnding","yAndSoftCEndingAndReplacement","yEndingAndReplacement","softCEnding","softCEndingAndReplacement","finalConsonantUndoubling","unaccentE","unaccentERegex","canonicalStem"],"sources":["../../../../../../src/languageProcessing/languages/fr/helpers/internal/stem.js"],"sourcesContent":["/* eslint-disable max-statements, complexity */\nimport {languageProcessing} from '@axyseo/index.js';\nconst {\n  exceptionListHelpers: {checkIfWordEndingIsOnExceptionList},\n  regexHelpers: {applyAllReplacements}\n} = languageProcessing;\n\n/*\n * MIT License\n *\n * Copyright (c) 2017 Bastien Botella\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in all\n * copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n */\n/*\n * Author: Kasun Gajasinghe, University of Moratuwa\n * E-Mail: kasunbg AT gmail DOT com\n * Date: 09.08.2010\n *\n * LICENSE:\n *\n * Copyright (c) 2010, Kasun Gajasinghe. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without modification,\n * are permitted provided that the following conditions are met:\n *\n *    1. Redistributions of source code must retain the above copyright notice,\n *       this list of conditions and the following disclaimer.\n *\n *    2. Redistributions in binary form must reproduce the above copyright notice,\n *       this list of conditions and the following disclaimer in the documentation\n *       and/or other materials provided with the distribution.\n *\n *\n * THIS SOFTWARE IS PROVIDED BY KASUN GAJASINGHE \"\"AS IS\"\" AND ANY EXPRESS OR IMPLIED WARRANTIES,\n * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A\n * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL KASUN GAJASINGHE BE LIABLE FOR ANY DIRECT,\n * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR\n * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,\n * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE\n * USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n */\n\n/**\n * Determines R1, R2 and RV.\n *\n * @param {string} word The word for which to determine the R regions.\n * @param {Object} rIntervalsData The regexes that cover French RV and R1 intervals.\n *\n * @returns {[number]} The R1, R2 and RV.\n */\nconst determineRs = function(word, rIntervalsData) {\n  let rvIndex;\n\n  if (\n    word.search(new RegExp(rIntervalsData.rvRegex1)) !== -1 ||\n    word.search(new RegExp(rIntervalsData.rvRegex2)) !== -1\n  ) {\n    rvIndex = 3;\n  } else {\n    rvIndex = word.substring(1).search(new RegExp(rIntervalsData.rvRegex3));\n    if (rvIndex === -1) {\n      rvIndex = word.length;\n    } else {\n      // +2 is to supplement the substring(1) used to find rvIndex\n      rvIndex += 2;\n    }\n  }\n  /*\n   * R1 is the region after the first non-vowel following a vowel, or the end of the word if there is no such non-vowel.\n   * R2 is the region after the first non-vowel following a vowel in R1, or the end of the word if there is no such non-vowel.\n   */\n  const r1Regex = new RegExp(rIntervalsData.r1Regex);\n  let r1Index = word.search(r1Regex);\n  let r1 = '';\n  if (r1Index === -1) {\n    r1Index = word.length;\n  } else {\n    r1Index += 2;\n    r1 = word.substring(r1Index);\n  }\n\n  let r2Index = r1.search(r1Regex);\n  if (r2Index === -1) {\n    r2Index = word.length;\n  } else {\n    r2Index += 2;\n    r2Index += r1Index;\n  }\n\n  if (r1Index !== -1 && r1Index < 3) {\n    r1Index = 3;\n  }\n\n  return [r1Index, r2Index, rvIndex];\n};\n\n/**\n * Removes or normalizes standard suffixes.\n *\n * @param {string} word               The word for which to remove suffixes.\n * @param {Object} standardSuffixData The French morphology data covering standard suffixes.\n * @param {number} r1Index            The start index of R1.\n * @param {number} r2Index            The start index of R2.\n * @param {number} rvIndex            The start index of RV.\n *\n * @returns {string} The word with standard suffixes removed or normalized.\n */\nconst processStandardSuffixes = function(word, standardSuffixData, r1Index, r2Index, rvIndex) {\n  const a1Index = word.search(new RegExp(standardSuffixData.standardSuffixes1));\n  const a2Index = word.search(new RegExp(standardSuffixData.standardSuffixes2));\n  const a3Index = word.search(new RegExp(standardSuffixData.standardSuffixes3[0]));\n  const a4Index = word.search(new RegExp(standardSuffixData.standardSuffixes4[0]));\n  const a5Index = word.search(new RegExp(standardSuffixData.standardSuffixes5[0]));\n  const a6Index = word.search(new RegExp(standardSuffixData.standardSuffixes6));\n  const a7Index = word.search(new RegExp(standardSuffixData.standardSuffixes7));\n  const a8Index = word.search(new RegExp(standardSuffixData.standardSuffixes8));\n  const a9Index = word.search(new RegExp(standardSuffixData.standardSuffixes9[0]));\n  const a10Index = word.search(new RegExp(standardSuffixData.standardSuffixes10[0]));\n  const a11Index = word.search(new RegExp(standardSuffixData.standardSuffixes11[0]));\n  const a12Index = word.search(new RegExp(standardSuffixData.standardSuffixes12));\n  const a13Index = word.search(new RegExp(standardSuffixData.standardSuffixes13[0]));\n  const a14Index = word.search(new RegExp(standardSuffixData.standardSuffixes14[0]));\n  const a15Index = word.search(new RegExp(standardSuffixData.standardSuffixes15));\n\n  if (a1Index !== -1 && a1Index >= r2Index) {\n    word = word.substring(0, a1Index);\n  } else if (a2Index !== -1 && a2Index >= r2Index) {\n    word = word.substring(0, a2Index);\n    const a2Index2 = word.search(new RegExp(standardSuffixData.suffixesPrecedingChar1[0]));\n\n    if (a2Index2 !== -1 && a2Index2 >= r2Index) {\n      // If preceded by ic, delete if in R2\n      word = word.substring(0, a2Index2);\n    } else {\n      // Else replace by iqU\n      word = word.replace(\n        new RegExp(standardSuffixData.suffixesPrecedingChar1[0]),\n        standardSuffixData.suffixesPrecedingChar1[1]\n      );\n    }\n  } else if (a3Index !== -1 && a3Index >= r2Index) {\n    // Replace with log if in R2\n    word = word.slice(0, a3Index) + standardSuffixData.standardSuffixes3[1];\n  } else if (a4Index !== -1 && a4Index >= r2Index) {\n    // Replace with u if in R2\n    word = word.slice(0, a4Index) + standardSuffixData.standardSuffixes4[1];\n  } else if (a5Index !== -1 && a5Index >= r2Index) {\n    // Replace with ent if in R2\n    word = word.slice(0, a5Index) + standardSuffixData.standardSuffixes5[1];\n  } else if (a12Index !== -1 && a12Index >= r1Index) {\n    // +1- amendment to non-vowel\n    word = word.substring(0, a12Index + 1);\n  } else if (a6Index !== -1 && a6Index >= rvIndex) {\n    word = word.substring(0, a6Index);\n\n    const precedingCharacter2 = word.search(\n      new RegExp(standardSuffixData.suffixesPrecedingChar2[0])\n    );\n    const a6Index2 = word.search(new RegExp(standardSuffixData.suffixesPrecedingChar4[0]));\n    const precedingCharacter5 = word.search(\n      new RegExp(standardSuffixData.suffixesPrecedingChar5[0])\n    );\n    const precedingCharacter6 = word.search(\n      new RegExp(standardSuffixData.suffixesPrecedingChar6[0])\n    );\n    if (precedingCharacter2 >= r2Index) {\n      word = word.slice(0, precedingCharacter2) + standardSuffixData.suffixesPrecedingChar2[1];\n\n      const precedingCharacter3 = word.search(\n        new RegExp(standardSuffixData.suffixesPrecedingChar3[0])\n      );\n      if (precedingCharacter3 >= r2Index) {\n        word = word.slice(0, precedingCharacter3) + standardSuffixData.suffixesPrecedingChar3[1];\n      }\n    } else if (word.search(new RegExp(standardSuffixData.suffixesPrecedingChar4[0])) !== -1) {\n      if (a6Index2 >= r2Index) {\n        word = word.substring(0, a6Index2);\n      } else if (a6Index2 >= r1Index) {\n        word = word.substring(0, a6Index2) + standardSuffixData.suffixesPrecedingChar4[1];\n      }\n    } else if (precedingCharacter5 >= r2Index) {\n      // If preceded by abl or iqU, delete if in R2\n      word = word.slice(0, precedingCharacter5) + standardSuffixData.suffixesPrecedingChar5[1];\n    } else if (precedingCharacter6 >= rvIndex) {\n      // If preceded by ièr, replace with i if in RV\n      word = word.slice(0, precedingCharacter6) + standardSuffixData.suffixesPrecedingChar6[1];\n    }\n  } else if (a7Index !== -1 && a7Index >= r2Index) {\n    // Delete if in R2\n    word = word.substring(0, a7Index);\n\n    const a7Index2 = word.search(new RegExp(standardSuffixData.suffixesPrecedingChar7[0]));\n    const a7Index3 = word.search(new RegExp(standardSuffixData.suffixesPrecedingChar1[0]));\n    if (a7Index2 !== -1) {\n      // If preceded by abil, delete if in R2, else replace by abl, otherwise\n      if (a7Index2 >= r2Index) {\n        word = word.substring(0, a7Index2);\n      } else {\n        word = word.substring(0, a7Index2) + standardSuffixData.suffixesPrecedingChar7[1];\n      }\n    } else if (a7Index3 !== -1) {\n      if (a7Index3 !== -1 && a7Index3 >= r2Index) {\n        // If preceded by ic, delete if in R2\n        word = word.substring(0, a7Index3);\n      } else {\n        // Else replace by iqU\n        word = word.substring(0, a7Index3) + standardSuffixData.suffixesPrecedingChar1[1];\n      }\n    } else if (word.search(new RegExp(standardSuffixData.suffixesPrecedingChar2[0])) >= r2Index) {\n      word = word.replace(\n        new RegExp(standardSuffixData.suffixesPrecedingChar2[0]),\n        standardSuffixData.suffixesPrecedingChar2[1]\n      );\n    }\n  } else if (a8Index !== -1 && a8Index >= r2Index) {\n    word = word.substring(0, a8Index);\n\n    if (word.search(new RegExp(standardSuffixData.suffixesPrecedingChar3[0])) >= r2Index) {\n      word = word.replace(\n        new RegExp(standardSuffixData.suffixesPrecedingChar3[0]),\n        standardSuffixData.suffixesPrecedingChar3[1]\n      );\n\n      if (word.search(new RegExp(standardSuffixData.suffixesPrecedingChar1[0])) >= r2Index) {\n        word = word.replace(new RegExp(standardSuffixData.suffixesPrecedingChar1[0]), '');\n      } else {\n        word = word.replace(\n          new RegExp(standardSuffixData.suffixesPrecedingChar1[0]),\n          standardSuffixData.suffixesPrecedingChar1[1]\n        );\n      }\n    }\n  } else if (a9Index !== -1) {\n    word = word.replace(\n      new RegExp(standardSuffixData.standardSuffixes9[0]),\n      standardSuffixData.standardSuffixes9[1]\n    );\n  } else if (a10Index >= r1Index) {\n    word = word.replace(\n      new RegExp(standardSuffixData.standardSuffixes10[0]),\n      standardSuffixData.standardSuffixes10[1]\n    );\n  } else if (a11Index !== -1) {\n    const a11Index2 = word.search(new RegExp(standardSuffixData.standardSuffixes11[0]));\n\n    if (a11Index2 >= r2Index) {\n      word = word.substring(0, a11Index2);\n    } else if (a11Index2 >= r1Index) {\n      word = word.substring(0, a11Index2) + standardSuffixData.standardSuffixes11[1];\n    }\n  } else if (a13Index !== -1 && a13Index >= rvIndex) {\n    word = word.replace(\n      new RegExp(standardSuffixData.standardSuffixes13[0]),\n      standardSuffixData.standardSuffixes13[1]\n    );\n  } else if (a14Index !== -1 && a14Index >= rvIndex) {\n    word = word.replace(\n      new RegExp(standardSuffixData.standardSuffixes14[0]),\n      standardSuffixData.standardSuffixes14[1]\n    );\n  } else if (a15Index !== -1 && a15Index >= rvIndex) {\n    word = word.substring(0, a15Index + 1);\n  }\n\n  return word;\n};\n\n/**\n * Removes verb suffixes starting with i.\n *\n * @param {string} word                       The word for which to remove suffixes.\n * @param {string} originalWord               The unprocessed word.\n * @param {number} rvIndex                    The start index of RV.\n * @param {string} verbSuffixesWithIBeginning Data for checking French suffixes starting with I.\n *\n * @returns {{step2aDone: boolean, word: string}} The word and information about whether the conditions for step 2a were met.\n */\nconst removeVerbSuffixesStartingWithI = function(\n  word,\n  originalWord,\n  rvIndex,\n  verbSuffixesWithIBeginning\n) {\n  let step2aDone = false;\n  if (\n    originalWord === word.toLowerCase() ||\n    checkIfWordEndingIsOnExceptionList(originalWord, verbSuffixesWithIBeginning.exceptions)\n  ) {\n    step2aDone = true;\n\n    const b1Regex = new RegExp(verbSuffixesWithIBeginning.suffixes[0]);\n    if (word.search(b1Regex) >= rvIndex) {\n      word = word.replace(b1Regex, verbSuffixesWithIBeginning.suffixes[1]);\n    }\n  }\n\n  return {word, step2aDone};\n};\n\n/**\n * Removes other verb suffixes.\n *\n * @param {string}  word              The word for which to remove suffixes.\n * @param {boolean} step2aDone        Whether step 2a was done.\n * @param {string}  wordAfterStep1    The word after step 1 was done.\n * @param {number}  r2Index           The start index of R2.\n * @param {number}  rvIndex           The start index of RV.\n * @param {Object}  morphologyData    The French morphology data.\n *\n * @returns {string} The word after other verb suffixes were removed.\n */\nconst removeOtherVerbSuffixes = function(\n  word,\n  step2aDone,\n  wordAfterStep1,\n  r2Index,\n  rvIndex,\n  morphologyData\n) {\n  const otherVerbSuffixes = morphologyData.regularStemmer.otherVerbSuffixes;\n\n  if (step2aDone && wordAfterStep1 === word) {\n    const suffixIons = new RegExp(otherVerbSuffixes[0]);\n    if (word.search(suffixIons) >= r2Index) {\n      return word.replace(suffixIons, '');\n    }\n\n    for (let i = 1; i < otherVerbSuffixes.length; i++) {\n      const regex = new RegExp(otherVerbSuffixes[i]);\n      if (word.search(regex) >= rvIndex) {\n        return word.replace(regex, '');\n      }\n    }\n    // Check if a word ends in \"ons\" preceded by \"i\", if it is \"ons\" is not stemmed.\n    if (word.endsWith('ions')) {\n      return word;\n    }\n\n    // Check if a word ends in \"ons\" preceded by other than \"i\" and stem it if it is in RV.\n    const verbSuffixOns = new RegExp(morphologyData.regularStemmer.verbSuffixOns);\n    if (word.search(verbSuffixOns) >= rvIndex) {\n      word = word.replace(verbSuffixOns, '');\n    }\n  }\n\n  return word;\n};\n\n/**\n * Removes residual suffixes.\n *\n * @param {string}  word                            The word for which to remove residual suffixes.\n * @param {number}  rvIndex                         The start index of RV.\n * @param {number}  r2Index                         The start index of R2.\n * @param {Object}  morphologyDataRegularStemmer    The French morphology data.\n *\n * @returns {string}                                The word after residual suffixes were removed.\n */\nconst removeResidualSuffixes = function(word, rvIndex, r2Index, morphologyDataRegularStemmer) {\n  const residualSuffixes = morphologyDataRegularStemmer.residualSuffixes;\n  if (word.search(new RegExp(residualSuffixes.residualSuffixes1[0])) >= rvIndex) {\n    word = word.replace(\n      new RegExp(residualSuffixes.residualSuffixes1[0]),\n      residualSuffixes.residualSuffixes1[1]\n    );\n  }\n\n  const e1Index = word.search(new RegExp(residualSuffixes.residualSuffix2));\n\n  if (e1Index >= r2Index && word.search(new RegExp(residualSuffixes.residualSuffix3)) >= rvIndex) {\n    word = word.substring(0, e1Index);\n  } else {\n    let e2Index = word.search(new RegExp(residualSuffixes.residualSuffixes4[0]));\n\n    if (e2Index >= rvIndex) {\n      word = word.substring(0, e2Index) + residualSuffixes.residualSuffixes4[1];\n    } else {\n      e2Index = word.search(new RegExp(residualSuffixes.residualSuffix5));\n      if (e2Index >= rvIndex) {\n        // Delete last e.\n        word = word.substring(0, e2Index);\n      } else {\n        e2Index = word.search(new RegExp(residualSuffixes.residualSuffix6[0]));\n        if (e2Index >= rvIndex) {\n          word = word.substring(0, e2Index) + residualSuffixes.residualSuffix6[1];\n        }\n      }\n    }\n  }\n\n  return word;\n};\n\n/**\n * Checks whether a word is in the full-form exception list and if so returns the canonical stem.\n *\n * @param {string} word\t      The word to be checked.\n * @param {Object} exceptions The list of full-form exceptions to be checked in.\n *\n * @returns {null|string} The canonical stem or null if nothing was found.\n */\nconst checkWordInFullFormExceptions = function(word, exceptions) {\n  for (const paradigm of exceptions) {\n    if (paradigm[1].includes(word)) {\n      return paradigm[0];\n    }\n  }\n  return null;\n};\n\n/**\n * Check whether the stem is on the exception list of stems that belong to one word. If it is, returns the canonical stem.\n *\n * @param {string}\tstemmedWord\t\t\t\t\tThe stemmed word.\n * @param {Object}\tstemsThatBelongToOneWord\tThe list of stems that belong to one word.\n *\n * @returns {null|string}\tThe canonical stem if word was found on the list.\n */\nconst canonicalizeStem = function(stemmedWord, stemsThatBelongToOneWord) {\n  // Check the adjectives list.\n  for (const paradigm of stemsThatBelongToOneWord.adjectives) {\n    if (paradigm.includes(stemmedWord)) {\n      return paradigm[0];\n    }\n  }\n  // Check the verbs list. The infinitive stem is always the canonical stem for verbs.\n  for (const paradigm of stemsThatBelongToOneWord.verbs) {\n    if (paradigm.includes(stemmedWord)) {\n      return paradigm[0];\n    }\n  }\n};\n\n/**\n * Checks whether the word is on the list of words which should be stemmed, even though the suffix would not be found in the\n * required region. If the word is found on the list, the stem specified in that list is returned.\n *\n * @param {string}\tword\t\t\t\tThe word to check.\n * @param {Object}\tshortWordsAndStems\tThe list to check.\n *\n * @returns {null|string} The stem or null if the word was not found on the list.\n */\nconst checkShortWordsExceptionList = function(word, shortWordsAndStems) {\n  // First check whether the word is on the sub-list of words that cannot take an extra -s suffix.\n  for (const wordStemPair of shortWordsAndStems.cannotTakeExtraSuffixS) {\n    if (wordStemPair[0] === word) {\n      return wordStemPair[1];\n    }\n  }\n  // If the word was not found on the first sub-list, check the second sub-list of words that can take an extra -s suffix.\n  if (word.endsWith('s')) {\n    word = word.slice(0, -1);\n  }\n  for (const wordStemPair of shortWordsAndStems.canTakeExtraSuffixS) {\n    if (wordStemPair[0] === word) {\n      return wordStemPair[1];\n    }\n  }\n};\n\n/**\n * Stems French words.\n *\n * @param {string} word             The word to stem.\n * @param {Object} morphologyData   The French morphology data.\n *\n * @returns {string} The stemmed word.\n */\nexport default function stem(word, morphologyData) {\n  word = word.toLowerCase();\n  const originalWord = word;\n\n  // Check if the word is on an exception list of words that should be stemmed even though the suffix is not in the required region.\n  const wordAfterShortWordsCheck = checkShortWordsExceptionList(\n    word,\n    morphologyData.shortWordsAndStems\n  );\n  if (wordAfterShortWordsCheck) {\n    return wordAfterShortWordsCheck;\n  }\n\n  // Check if the word is on an exception list for which all forms of a word and its stem are listed.\n  const ifException = checkWordInFullFormExceptions(\n    word,\n    morphologyData.exceptionStemsWithFullForms\n  );\n  if (ifException) {\n    return ifException;\n  }\n\n  // Check the exception list of words with plural suffix -x.\n  if (word.endsWith('x')) {\n    const pluralsWithXSuffix = morphologyData.pluralsWithXSuffix;\n    if (pluralsWithXSuffix.includes(word)) {\n      return word.slice(0, -1);\n    }\n  }\n\n  // Check if the word is on the exception list of words for which -s should not be stemmed.\n  if (word.endsWith('s')) {\n    const sShouldNotBeStemmed = morphologyData.sShouldNotBeStemmed;\n    if (sShouldNotBeStemmed.includes(word)) {\n      return word;\n    }\n  }\n\n  // Check if the word is on the exception list of words for which -ent should not be stemmed.\n  const nonVerbsOnEnt = morphologyData.nonVerbsOnEnt;\n  if (word.endsWith('ent')) {\n    if (nonVerbsOnEnt.includes(word)) {\n      return word;\n    }\n  }\n  if (word.endsWith('ents')) {\n    if (nonVerbsOnEnt.includes(word.slice(0, -1))) {\n      return word.slice(0, -1);\n    }\n  }\n\n  // Check if word is on the exception list of nouns and adjectives for which the verb suffix -ons should not be stemmed.\n  const nonVerbsOnOns = morphologyData.nonVerbsOnOns;\n  if (word.endsWith('ons')) {\n    if (nonVerbsOnOns.includes(word)) {\n      return word.slice(0, -1);\n    }\n  }\n\n  // Pre-processing steps\n  word = applyAllReplacements(word, morphologyData.regularStemmer.preProcessingStepsRegexes);\n\n  // Determine R1, R2 & RV regions.\n  const [r1Index, r2Index, rvIndex] = determineRs(word, morphologyData.regularStemmer.rIntervals);\n\n  /*\n   * Step 1:\n   * Remove standard suffixes\n   */\n  word = processStandardSuffixes(\n    word,\n    morphologyData.regularStemmer.standardSuffixes,\n    r1Index,\n    r2Index,\n    rvIndex\n  );\n  const wordAfterStep1 = word;\n\n  /*\n   * Step 2a:\n   * Stem verb suffixes beginning with \"i\"\n   */\n  const verbSuffixesStartingWithIRemoved = removeVerbSuffixesStartingWithI(\n    word,\n    originalWord,\n    rvIndex,\n    morphologyData.regularStemmer.verbSuffixesWithIBeginning\n  );\n  word = verbSuffixesStartingWithIRemoved.word;\n  const step2aDone = verbSuffixesStartingWithIRemoved.step2aDone;\n\n  /*\n   * Step 2b:\n   * Stem other verb suffixes\n   */\n  if (!nonVerbsOnEnt.includes(word)) {\n    word = removeOtherVerbSuffixes(\n      word,\n      step2aDone,\n      wordAfterStep1,\n      r2Index,\n      rvIndex,\n      morphologyData\n    );\n  }\n\n  if (originalWord === word.toLowerCase()) {\n    /* Step 4:\n     * Stem residual suffixes.\n     */\n    word = removeResidualSuffixes(word, rvIndex, r2Index, morphologyData.regularStemmer);\n  } else {\n    /*\n     * Step 3 (only needs to be executed if step 4 isn't executed)\n     * Replace final Y with i or final ç with c.\n     */\n    const yEnding =\n      morphologyData.regularStemmer.yAndSoftCEndingAndReplacement.yEndingAndReplacement;\n    const softCEnding =\n      morphologyData.regularStemmer.yAndSoftCEndingAndReplacement.softCEndingAndReplacement;\n    if (word.endsWith(yEnding[0])) {\n      word = word.slice(0, -1) + yEnding[1];\n    } else if (word.endsWith(softCEnding[0])) {\n      word = word.slice(0, -1) + softCEnding[1];\n    }\n  }\n\n  /* Step 5:\n   * Undouble final consonants\n   */\n  word = applyAllReplacements(word, morphologyData.regularStemmer.finalConsonantUndoubling);\n\n  /* Step 6:\n   * Un-accent\n   */\n  const unaccentE = morphologyData.regularStemmer.unaccentERegex;\n  word = word.replace(new RegExp(unaccentE[0]), unaccentE[1]);\n  word = word.toLowerCase();\n\n  const canonicalStem = canonicalizeStem(word, morphologyData.stemsThatBelongToOneWord);\n  if (canonicalStem) {\n    return canonicalStem;\n  }\n\n  return word;\n}\n"],"mappings":";;;;;;AACA,IAAAA,MAAA,GAAAC,OAAA;AADA;;AAEA,MAAM;EACJC,oBAAoB,EAAE;IAACC;EAAkC,CAAC;EAC1DC,YAAY,EAAE;IAACC;EAAoB;AACrC,CAAC,GAAGC,yBAAkB;;AAEtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,WAAW,GAAG,SAAAA,CAASC,IAAI,EAAEC,cAAc,EAAE;EACjD,IAAIC,OAAO;EAEX,IACEF,IAAI,CAACG,MAAM,CAAC,IAAIC,MAAM,CAACH,cAAc,CAACI,QAAQ,CAAC,CAAC,KAAK,CAAC,CAAC,IACvDL,IAAI,CAACG,MAAM,CAAC,IAAIC,MAAM,CAACH,cAAc,CAACK,QAAQ,CAAC,CAAC,KAAK,CAAC,CAAC,EACvD;IACAJ,OAAO,GAAG,CAAC;EACb,CAAC,MAAM;IACLA,OAAO,GAAGF,IAAI,CAACO,SAAS,CAAC,CAAC,CAAC,CAACJ,MAAM,CAAC,IAAIC,MAAM,CAACH,cAAc,CAACO,QAAQ,CAAC,CAAC;IACvE,IAAIN,OAAO,KAAK,CAAC,CAAC,EAAE;MAClBA,OAAO,GAAGF,IAAI,CAACS,MAAM;IACvB,CAAC,MAAM;MACL;MACAP,OAAO,IAAI,CAAC;IACd;EACF;EACA;AACF;AACA;AACA;EACE,MAAMQ,OAAO,GAAG,IAAIN,MAAM,CAACH,cAAc,CAACS,OAAO,CAAC;EAClD,IAAIC,OAAO,GAAGX,IAAI,CAACG,MAAM,CAACO,OAAO,CAAC;EAClC,IAAIE,EAAE,GAAG,EAAE;EACX,IAAID,OAAO,KAAK,CAAC,CAAC,EAAE;IAClBA,OAAO,GAAGX,IAAI,CAACS,MAAM;EACvB,CAAC,MAAM;IACLE,OAAO,IAAI,CAAC;IACZC,EAAE,GAAGZ,IAAI,CAACO,SAAS,CAACI,OAAO,CAAC;EAC9B;EAEA,IAAIE,OAAO,GAAGD,EAAE,CAACT,MAAM,CAACO,OAAO,CAAC;EAChC,IAAIG,OAAO,KAAK,CAAC,CAAC,EAAE;IAClBA,OAAO,GAAGb,IAAI,CAACS,MAAM;EACvB,CAAC,MAAM;IACLI,OAAO,IAAI,CAAC;IACZA,OAAO,IAAIF,OAAO;EACpB;EAEA,IAAIA,OAAO,KAAK,CAAC,CAAC,IAAIA,OAAO,GAAG,CAAC,EAAE;IACjCA,OAAO,GAAG,CAAC;EACb;EAEA,OAAO,CAACA,OAAO,EAAEE,OAAO,EAAEX,OAAO,CAAC;AACpC,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMY,uBAAuB,GAAG,SAAAA,CAASd,IAAI,EAAEe,kBAAkB,EAAEJ,OAAO,EAAEE,OAAO,EAAEX,OAAO,EAAE;EAC5F,MAAMc,OAAO,GAAGhB,IAAI,CAACG,MAAM,CAAC,IAAIC,MAAM,CAACW,kBAAkB,CAACE,iBAAiB,CAAC,CAAC;EAC7E,MAAMC,OAAO,GAAGlB,IAAI,CAACG,MAAM,CAAC,IAAIC,MAAM,CAACW,kBAAkB,CAACI,iBAAiB,CAAC,CAAC;EAC7E,MAAMC,OAAO,GAAGpB,IAAI,CAACG,MAAM,CAAC,IAAIC,MAAM,CAACW,kBAAkB,CAACM,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;EAChF,MAAMC,OAAO,GAAGtB,IAAI,CAACG,MAAM,CAAC,IAAIC,MAAM,CAACW,kBAAkB,CAACQ,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;EAChF,MAAMC,OAAO,GAAGxB,IAAI,CAACG,MAAM,CAAC,IAAIC,MAAM,CAACW,kBAAkB,CAACU,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;EAChF,MAAMC,OAAO,GAAG1B,IAAI,CAACG,MAAM,CAAC,IAAIC,MAAM,CAACW,kBAAkB,CAACY,iBAAiB,CAAC,CAAC;EAC7E,MAAMC,OAAO,GAAG5B,IAAI,CAACG,MAAM,CAAC,IAAIC,MAAM,CAACW,kBAAkB,CAACc,iBAAiB,CAAC,CAAC;EAC7E,MAAMC,OAAO,GAAG9B,IAAI,CAACG,MAAM,CAAC,IAAIC,MAAM,CAACW,kBAAkB,CAACgB,iBAAiB,CAAC,CAAC;EAC7E,MAAMC,OAAO,GAAGhC,IAAI,CAACG,MAAM,CAAC,IAAIC,MAAM,CAACW,kBAAkB,CAACkB,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;EAChF,MAAMC,QAAQ,GAAGlC,IAAI,CAACG,MAAM,CAAC,IAAIC,MAAM,CAACW,kBAAkB,CAACoB,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC;EAClF,MAAMC,QAAQ,GAAGpC,IAAI,CAACG,MAAM,CAAC,IAAIC,MAAM,CAACW,kBAAkB,CAACsB,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC;EAClF,MAAMC,QAAQ,GAAGtC,IAAI,CAACG,MAAM,CAAC,IAAIC,MAAM,CAACW,kBAAkB,CAACwB,kBAAkB,CAAC,CAAC;EAC/E,MAAMC,QAAQ,GAAGxC,IAAI,CAACG,MAAM,CAAC,IAAIC,MAAM,CAACW,kBAAkB,CAAC0B,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC;EAClF,MAAMC,QAAQ,GAAG1C,IAAI,CAACG,MAAM,CAAC,IAAIC,MAAM,CAACW,kBAAkB,CAAC4B,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC;EAClF,MAAMC,QAAQ,GAAG5C,IAAI,CAACG,MAAM,CAAC,IAAIC,MAAM,CAACW,kBAAkB,CAAC8B,kBAAkB,CAAC,CAAC;EAE/E,IAAI7B,OAAO,KAAK,CAAC,CAAC,IAAIA,OAAO,IAAIH,OAAO,EAAE;IACxCb,IAAI,GAAGA,IAAI,CAACO,SAAS,CAAC,CAAC,EAAES,OAAO,CAAC;EACnC,CAAC,MAAM,IAAIE,OAAO,KAAK,CAAC,CAAC,IAAIA,OAAO,IAAIL,OAAO,EAAE;IAC/Cb,IAAI,GAAGA,IAAI,CAACO,SAAS,CAAC,CAAC,EAAEW,OAAO,CAAC;IACjC,MAAM4B,QAAQ,GAAG9C,IAAI,CAACG,MAAM,CAAC,IAAIC,MAAM,CAACW,kBAAkB,CAACgC,sBAAsB,CAAC,CAAC,CAAC,CAAC,CAAC;IAEtF,IAAID,QAAQ,KAAK,CAAC,CAAC,IAAIA,QAAQ,IAAIjC,OAAO,EAAE;MAC1C;MACAb,IAAI,GAAGA,IAAI,CAACO,SAAS,CAAC,CAAC,EAAEuC,QAAQ,CAAC;IACpC,CAAC,MAAM;MACL;MACA9C,IAAI,GAAGA,IAAI,CAACgD,OAAO,CACjB,IAAI5C,MAAM,CAACW,kBAAkB,CAACgC,sBAAsB,CAAC,CAAC,CAAC,CAAC,EACxDhC,kBAAkB,CAACgC,sBAAsB,CAAC,CAAC,CAC7C,CAAC;IACH;EACF,CAAC,MAAM,IAAI3B,OAAO,KAAK,CAAC,CAAC,IAAIA,OAAO,IAAIP,OAAO,EAAE;IAC/C;IACAb,IAAI,GAAGA,IAAI,CAACiD,KAAK,CAAC,CAAC,EAAE7B,OAAO,CAAC,GAAGL,kBAAkB,CAACM,iBAAiB,CAAC,CAAC,CAAC;EACzE,CAAC,MAAM,IAAIC,OAAO,KAAK,CAAC,CAAC,IAAIA,OAAO,IAAIT,OAAO,EAAE;IAC/C;IACAb,IAAI,GAAGA,IAAI,CAACiD,KAAK,CAAC,CAAC,EAAE3B,OAAO,CAAC,GAAGP,kBAAkB,CAACQ,iBAAiB,CAAC,CAAC,CAAC;EACzE,CAAC,MAAM,IAAIC,OAAO,KAAK,CAAC,CAAC,IAAIA,OAAO,IAAIX,OAAO,EAAE;IAC/C;IACAb,IAAI,GAAGA,IAAI,CAACiD,KAAK,CAAC,CAAC,EAAEzB,OAAO,CAAC,GAAGT,kBAAkB,CAACU,iBAAiB,CAAC,CAAC,CAAC;EACzE,CAAC,MAAM,IAAIa,QAAQ,KAAK,CAAC,CAAC,IAAIA,QAAQ,IAAI3B,OAAO,EAAE;IACjD;IACAX,IAAI,GAAGA,IAAI,CAACO,SAAS,CAAC,CAAC,EAAE+B,QAAQ,GAAG,CAAC,CAAC;EACxC,CAAC,MAAM,IAAIZ,OAAO,KAAK,CAAC,CAAC,IAAIA,OAAO,IAAIxB,OAAO,EAAE;IAC/CF,IAAI,GAAGA,IAAI,CAACO,SAAS,CAAC,CAAC,EAAEmB,OAAO,CAAC;IAEjC,MAAMwB,mBAAmB,GAAGlD,IAAI,CAACG,MAAM,CACrC,IAAIC,MAAM,CAACW,kBAAkB,CAACoC,sBAAsB,CAAC,CAAC,CAAC,CACzD,CAAC;IACD,MAAMC,QAAQ,GAAGpD,IAAI,CAACG,MAAM,CAAC,IAAIC,MAAM,CAACW,kBAAkB,CAACsC,sBAAsB,CAAC,CAAC,CAAC,CAAC,CAAC;IACtF,MAAMC,mBAAmB,GAAGtD,IAAI,CAACG,MAAM,CACrC,IAAIC,MAAM,CAACW,kBAAkB,CAACwC,sBAAsB,CAAC,CAAC,CAAC,CACzD,CAAC;IACD,MAAMC,mBAAmB,GAAGxD,IAAI,CAACG,MAAM,CACrC,IAAIC,MAAM,CAACW,kBAAkB,CAAC0C,sBAAsB,CAAC,CAAC,CAAC,CACzD,CAAC;IACD,IAAIP,mBAAmB,IAAIrC,OAAO,EAAE;MAClCb,IAAI,GAAGA,IAAI,CAACiD,KAAK,CAAC,CAAC,EAAEC,mBAAmB,CAAC,GAAGnC,kBAAkB,CAACoC,sBAAsB,CAAC,CAAC,CAAC;MAExF,MAAMO,mBAAmB,GAAG1D,IAAI,CAACG,MAAM,CACrC,IAAIC,MAAM,CAACW,kBAAkB,CAAC4C,sBAAsB,CAAC,CAAC,CAAC,CACzD,CAAC;MACD,IAAID,mBAAmB,IAAI7C,OAAO,EAAE;QAClCb,IAAI,GAAGA,IAAI,CAACiD,KAAK,CAAC,CAAC,EAAES,mBAAmB,CAAC,GAAG3C,kBAAkB,CAAC4C,sBAAsB,CAAC,CAAC,CAAC;MAC1F;IACF,CAAC,MAAM,IAAI3D,IAAI,CAACG,MAAM,CAAC,IAAIC,MAAM,CAACW,kBAAkB,CAACsC,sBAAsB,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE;MACvF,IAAID,QAAQ,IAAIvC,OAAO,EAAE;QACvBb,IAAI,GAAGA,IAAI,CAACO,SAAS,CAAC,CAAC,EAAE6C,QAAQ,CAAC;MACpC,CAAC,MAAM,IAAIA,QAAQ,IAAIzC,OAAO,EAAE;QAC9BX,IAAI,GAAGA,IAAI,CAACO,SAAS,CAAC,CAAC,EAAE6C,QAAQ,CAAC,GAAGrC,kBAAkB,CAACsC,sBAAsB,CAAC,CAAC,CAAC;MACnF;IACF,CAAC,MAAM,IAAIC,mBAAmB,IAAIzC,OAAO,EAAE;MACzC;MACAb,IAAI,GAAGA,IAAI,CAACiD,KAAK,CAAC,CAAC,EAAEK,mBAAmB,CAAC,GAAGvC,kBAAkB,CAACwC,sBAAsB,CAAC,CAAC,CAAC;IAC1F,CAAC,MAAM,IAAIC,mBAAmB,IAAItD,OAAO,EAAE;MACzC;MACAF,IAAI,GAAGA,IAAI,CAACiD,KAAK,CAAC,CAAC,EAAEO,mBAAmB,CAAC,GAAGzC,kBAAkB,CAAC0C,sBAAsB,CAAC,CAAC,CAAC;IAC1F;EACF,CAAC,MAAM,IAAI7B,OAAO,KAAK,CAAC,CAAC,IAAIA,OAAO,IAAIf,OAAO,EAAE;IAC/C;IACAb,IAAI,GAAGA,IAAI,CAACO,SAAS,CAAC,CAAC,EAAEqB,OAAO,CAAC;IAEjC,MAAMgC,QAAQ,GAAG5D,IAAI,CAACG,MAAM,CAAC,IAAIC,MAAM,CAACW,kBAAkB,CAAC8C,sBAAsB,CAAC,CAAC,CAAC,CAAC,CAAC;IACtF,MAAMC,QAAQ,GAAG9D,IAAI,CAACG,MAAM,CAAC,IAAIC,MAAM,CAACW,kBAAkB,CAACgC,sBAAsB,CAAC,CAAC,CAAC,CAAC,CAAC;IACtF,IAAIa,QAAQ,KAAK,CAAC,CAAC,EAAE;MACnB;MACA,IAAIA,QAAQ,IAAI/C,OAAO,EAAE;QACvBb,IAAI,GAAGA,IAAI,CAACO,SAAS,CAAC,CAAC,EAAEqD,QAAQ,CAAC;MACpC,CAAC,MAAM;QACL5D,IAAI,GAAGA,IAAI,CAACO,SAAS,CAAC,CAAC,EAAEqD,QAAQ,CAAC,GAAG7C,kBAAkB,CAAC8C,sBAAsB,CAAC,CAAC,CAAC;MACnF;IACF,CAAC,MAAM,IAAIC,QAAQ,KAAK,CAAC,CAAC,EAAE;MAC1B,IAAIA,QAAQ,KAAK,CAAC,CAAC,IAAIA,QAAQ,IAAIjD,OAAO,EAAE;QAC1C;QACAb,IAAI,GAAGA,IAAI,CAACO,SAAS,CAAC,CAAC,EAAEuD,QAAQ,CAAC;MACpC,CAAC,MAAM;QACL;QACA9D,IAAI,GAAGA,IAAI,CAACO,SAAS,CAAC,CAAC,EAAEuD,QAAQ,CAAC,GAAG/C,kBAAkB,CAACgC,sBAAsB,CAAC,CAAC,CAAC;MACnF;IACF,CAAC,MAAM,IAAI/C,IAAI,CAACG,MAAM,CAAC,IAAIC,MAAM,CAACW,kBAAkB,CAACoC,sBAAsB,CAAC,CAAC,CAAC,CAAC,CAAC,IAAItC,OAAO,EAAE;MAC3Fb,IAAI,GAAGA,IAAI,CAACgD,OAAO,CACjB,IAAI5C,MAAM,CAACW,kBAAkB,CAACoC,sBAAsB,CAAC,CAAC,CAAC,CAAC,EACxDpC,kBAAkB,CAACoC,sBAAsB,CAAC,CAAC,CAC7C,CAAC;IACH;EACF,CAAC,MAAM,IAAIrB,OAAO,KAAK,CAAC,CAAC,IAAIA,OAAO,IAAIjB,OAAO,EAAE;IAC/Cb,IAAI,GAAGA,IAAI,CAACO,SAAS,CAAC,CAAC,EAAEuB,OAAO,CAAC;IAEjC,IAAI9B,IAAI,CAACG,MAAM,CAAC,IAAIC,MAAM,CAACW,kBAAkB,CAAC4C,sBAAsB,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI9C,OAAO,EAAE;MACpFb,IAAI,GAAGA,IAAI,CAACgD,OAAO,CACjB,IAAI5C,MAAM,CAACW,kBAAkB,CAAC4C,sBAAsB,CAAC,CAAC,CAAC,CAAC,EACxD5C,kBAAkB,CAAC4C,sBAAsB,CAAC,CAAC,CAC7C,CAAC;MAED,IAAI3D,IAAI,CAACG,MAAM,CAAC,IAAIC,MAAM,CAACW,kBAAkB,CAACgC,sBAAsB,CAAC,CAAC,CAAC,CAAC,CAAC,IAAIlC,OAAO,EAAE;QACpFb,IAAI,GAAGA,IAAI,CAACgD,OAAO,CAAC,IAAI5C,MAAM,CAACW,kBAAkB,CAACgC,sBAAsB,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;MACnF,CAAC,MAAM;QACL/C,IAAI,GAAGA,IAAI,CAACgD,OAAO,CACjB,IAAI5C,MAAM,CAACW,kBAAkB,CAACgC,sBAAsB,CAAC,CAAC,CAAC,CAAC,EACxDhC,kBAAkB,CAACgC,sBAAsB,CAAC,CAAC,CAC7C,CAAC;MACH;IACF;EACF,CAAC,MAAM,IAAIf,OAAO,KAAK,CAAC,CAAC,EAAE;IACzBhC,IAAI,GAAGA,IAAI,CAACgD,OAAO,CACjB,IAAI5C,MAAM,CAACW,kBAAkB,CAACkB,iBAAiB,CAAC,CAAC,CAAC,CAAC,EACnDlB,kBAAkB,CAACkB,iBAAiB,CAAC,CAAC,CACxC,CAAC;EACH,CAAC,MAAM,IAAIC,QAAQ,IAAIvB,OAAO,EAAE;IAC9BX,IAAI,GAAGA,IAAI,CAACgD,OAAO,CACjB,IAAI5C,MAAM,CAACW,kBAAkB,CAACoB,kBAAkB,CAAC,CAAC,CAAC,CAAC,EACpDpB,kBAAkB,CAACoB,kBAAkB,CAAC,CAAC,CACzC,CAAC;EACH,CAAC,MAAM,IAAIC,QAAQ,KAAK,CAAC,CAAC,EAAE;IAC1B,MAAM2B,SAAS,GAAG/D,IAAI,CAACG,MAAM,CAAC,IAAIC,MAAM,CAACW,kBAAkB,CAACsB,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC;IAEnF,IAAI0B,SAAS,IAAIlD,OAAO,EAAE;MACxBb,IAAI,GAAGA,IAAI,CAACO,SAAS,CAAC,CAAC,EAAEwD,SAAS,CAAC;IACrC,CAAC,MAAM,IAAIA,SAAS,IAAIpD,OAAO,EAAE;MAC/BX,IAAI,GAAGA,IAAI,CAACO,SAAS,CAAC,CAAC,EAAEwD,SAAS,CAAC,GAAGhD,kBAAkB,CAACsB,kBAAkB,CAAC,CAAC,CAAC;IAChF;EACF,CAAC,MAAM,IAAIG,QAAQ,KAAK,CAAC,CAAC,IAAIA,QAAQ,IAAItC,OAAO,EAAE;IACjDF,IAAI,GAAGA,IAAI,CAACgD,OAAO,CACjB,IAAI5C,MAAM,CAACW,kBAAkB,CAAC0B,kBAAkB,CAAC,CAAC,CAAC,CAAC,EACpD1B,kBAAkB,CAAC0B,kBAAkB,CAAC,CAAC,CACzC,CAAC;EACH,CAAC,MAAM,IAAIC,QAAQ,KAAK,CAAC,CAAC,IAAIA,QAAQ,IAAIxC,OAAO,EAAE;IACjDF,IAAI,GAAGA,IAAI,CAACgD,OAAO,CACjB,IAAI5C,MAAM,CAACW,kBAAkB,CAAC4B,kBAAkB,CAAC,CAAC,CAAC,CAAC,EACpD5B,kBAAkB,CAAC4B,kBAAkB,CAAC,CAAC,CACzC,CAAC;EACH,CAAC,MAAM,IAAIC,QAAQ,KAAK,CAAC,CAAC,IAAIA,QAAQ,IAAI1C,OAAO,EAAE;IACjDF,IAAI,GAAGA,IAAI,CAACO,SAAS,CAAC,CAAC,EAAEqC,QAAQ,GAAG,CAAC,CAAC;EACxC;EAEA,OAAO5C,IAAI;AACb,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMgE,+BAA+B,GAAG,SAAAA,CACtChE,IAAI,EACJiE,YAAY,EACZ/D,OAAO,EACPgE,0BAA0B,EAC1B;EACA,IAAIC,UAAU,GAAG,KAAK;EACtB,IACEF,YAAY,KAAKjE,IAAI,CAACoE,WAAW,CAAC,CAAC,IACnCzE,kCAAkC,CAACsE,YAAY,EAAEC,0BAA0B,CAACG,UAAU,CAAC,EACvF;IACAF,UAAU,GAAG,IAAI;IAEjB,MAAMG,OAAO,GAAG,IAAIlE,MAAM,CAAC8D,0BAA0B,CAACK,QAAQ,CAAC,CAAC,CAAC,CAAC;IAClE,IAAIvE,IAAI,CAACG,MAAM,CAACmE,OAAO,CAAC,IAAIpE,OAAO,EAAE;MACnCF,IAAI,GAAGA,IAAI,CAACgD,OAAO,CAACsB,OAAO,EAAEJ,0BAA0B,CAACK,QAAQ,CAAC,CAAC,CAAC,CAAC;IACtE;EACF;EAEA,OAAO;IAACvE,IAAI;IAAEmE;EAAU,CAAC;AAC3B,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMK,uBAAuB,GAAG,SAAAA,CAC9BxE,IAAI,EACJmE,UAAU,EACVM,cAAc,EACd5D,OAAO,EACPX,OAAO,EACPwE,cAAc,EACd;EACA,MAAMC,iBAAiB,GAAGD,cAAc,CAACE,cAAc,CAACD,iBAAiB;EAEzE,IAAIR,UAAU,IAAIM,cAAc,KAAKzE,IAAI,EAAE;IACzC,MAAM6E,UAAU,GAAG,IAAIzE,MAAM,CAACuE,iBAAiB,CAAC,CAAC,CAAC,CAAC;IACnD,IAAI3E,IAAI,CAACG,MAAM,CAAC0E,UAAU,CAAC,IAAIhE,OAAO,EAAE;MACtC,OAAOb,IAAI,CAACgD,OAAO,CAAC6B,UAAU,EAAE,EAAE,CAAC;IACrC;IAEA,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGH,iBAAiB,CAAClE,MAAM,EAAEqE,CAAC,EAAE,EAAE;MACjD,MAAMC,KAAK,GAAG,IAAI3E,MAAM,CAACuE,iBAAiB,CAACG,CAAC,CAAC,CAAC;MAC9C,IAAI9E,IAAI,CAACG,MAAM,CAAC4E,KAAK,CAAC,IAAI7E,OAAO,EAAE;QACjC,OAAOF,IAAI,CAACgD,OAAO,CAAC+B,KAAK,EAAE,EAAE,CAAC;MAChC;IACF;IACA;IACA,IAAI/E,IAAI,CAACgF,QAAQ,CAAC,MAAM,CAAC,EAAE;MACzB,OAAOhF,IAAI;IACb;;IAEA;IACA,MAAMiF,aAAa,GAAG,IAAI7E,MAAM,CAACsE,cAAc,CAACE,cAAc,CAACK,aAAa,CAAC;IAC7E,IAAIjF,IAAI,CAACG,MAAM,CAAC8E,aAAa,CAAC,IAAI/E,OAAO,EAAE;MACzCF,IAAI,GAAGA,IAAI,CAACgD,OAAO,CAACiC,aAAa,EAAE,EAAE,CAAC;IACxC;EACF;EAEA,OAAOjF,IAAI;AACb,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMkF,sBAAsB,GAAG,SAAAA,CAASlF,IAAI,EAAEE,OAAO,EAAEW,OAAO,EAAEsE,4BAA4B,EAAE;EAC5F,MAAMC,gBAAgB,GAAGD,4BAA4B,CAACC,gBAAgB;EACtE,IAAIpF,IAAI,CAACG,MAAM,CAAC,IAAIC,MAAM,CAACgF,gBAAgB,CAACC,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC,IAAInF,OAAO,EAAE;IAC7EF,IAAI,GAAGA,IAAI,CAACgD,OAAO,CACjB,IAAI5C,MAAM,CAACgF,gBAAgB,CAACC,iBAAiB,CAAC,CAAC,CAAC,CAAC,EACjDD,gBAAgB,CAACC,iBAAiB,CAAC,CAAC,CACtC,CAAC;EACH;EAEA,MAAMC,OAAO,GAAGtF,IAAI,CAACG,MAAM,CAAC,IAAIC,MAAM,CAACgF,gBAAgB,CAACG,eAAe,CAAC,CAAC;EAEzE,IAAID,OAAO,IAAIzE,OAAO,IAAIb,IAAI,CAACG,MAAM,CAAC,IAAIC,MAAM,CAACgF,gBAAgB,CAACI,eAAe,CAAC,CAAC,IAAItF,OAAO,EAAE;IAC9FF,IAAI,GAAGA,IAAI,CAACO,SAAS,CAAC,CAAC,EAAE+E,OAAO,CAAC;EACnC,CAAC,MAAM;IACL,IAAIG,OAAO,GAAGzF,IAAI,CAACG,MAAM,CAAC,IAAIC,MAAM,CAACgF,gBAAgB,CAACM,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;IAE5E,IAAID,OAAO,IAAIvF,OAAO,EAAE;MACtBF,IAAI,GAAGA,IAAI,CAACO,SAAS,CAAC,CAAC,EAAEkF,OAAO,CAAC,GAAGL,gBAAgB,CAACM,iBAAiB,CAAC,CAAC,CAAC;IAC3E,CAAC,MAAM;MACLD,OAAO,GAAGzF,IAAI,CAACG,MAAM,CAAC,IAAIC,MAAM,CAACgF,gBAAgB,CAACO,eAAe,CAAC,CAAC;MACnE,IAAIF,OAAO,IAAIvF,OAAO,EAAE;QACtB;QACAF,IAAI,GAAGA,IAAI,CAACO,SAAS,CAAC,CAAC,EAAEkF,OAAO,CAAC;MACnC,CAAC,MAAM;QACLA,OAAO,GAAGzF,IAAI,CAACG,MAAM,CAAC,IAAIC,MAAM,CAACgF,gBAAgB,CAACQ,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;QACtE,IAAIH,OAAO,IAAIvF,OAAO,EAAE;UACtBF,IAAI,GAAGA,IAAI,CAACO,SAAS,CAAC,CAAC,EAAEkF,OAAO,CAAC,GAAGL,gBAAgB,CAACQ,eAAe,CAAC,CAAC,CAAC;QACzE;MACF;IACF;EACF;EAEA,OAAO5F,IAAI;AACb,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM6F,6BAA6B,GAAG,SAAAA,CAAS7F,IAAI,EAAEqE,UAAU,EAAE;EAC/D,KAAK,MAAMyB,QAAQ,IAAIzB,UAAU,EAAE;IACjC,IAAIyB,QAAQ,CAAC,CAAC,CAAC,CAACC,QAAQ,CAAC/F,IAAI,CAAC,EAAE;MAC9B,OAAO8F,QAAQ,CAAC,CAAC,CAAC;IACpB;EACF;EACA,OAAO,IAAI;AACb,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAME,gBAAgB,GAAG,SAAAA,CAASC,WAAW,EAAEC,wBAAwB,EAAE;EACvE;EACA,KAAK,MAAMJ,QAAQ,IAAII,wBAAwB,CAACC,UAAU,EAAE;IAC1D,IAAIL,QAAQ,CAACC,QAAQ,CAACE,WAAW,CAAC,EAAE;MAClC,OAAOH,QAAQ,CAAC,CAAC,CAAC;IACpB;EACF;EACA;EACA,KAAK,MAAMA,QAAQ,IAAII,wBAAwB,CAACE,KAAK,EAAE;IACrD,IAAIN,QAAQ,CAACC,QAAQ,CAACE,WAAW,CAAC,EAAE;MAClC,OAAOH,QAAQ,CAAC,CAAC,CAAC;IACpB;EACF;AACF,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMO,4BAA4B,GAAG,SAAAA,CAASrG,IAAI,EAAEsG,kBAAkB,EAAE;EACtE;EACA,KAAK,MAAMC,YAAY,IAAID,kBAAkB,CAACE,sBAAsB,EAAE;IACpE,IAAID,YAAY,CAAC,CAAC,CAAC,KAAKvG,IAAI,EAAE;MAC5B,OAAOuG,YAAY,CAAC,CAAC,CAAC;IACxB;EACF;EACA;EACA,IAAIvG,IAAI,CAACgF,QAAQ,CAAC,GAAG,CAAC,EAAE;IACtBhF,IAAI,GAAGA,IAAI,CAACiD,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;EAC1B;EACA,KAAK,MAAMsD,YAAY,IAAID,kBAAkB,CAACG,mBAAmB,EAAE;IACjE,IAAIF,YAAY,CAAC,CAAC,CAAC,KAAKvG,IAAI,EAAE;MAC5B,OAAOuG,YAAY,CAAC,CAAC,CAAC;IACxB;EACF;AACF,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACe,SAASG,IAAIA,CAAC1G,IAAI,EAAE0E,cAAc,EAAE;EACjD1E,IAAI,GAAGA,IAAI,CAACoE,WAAW,CAAC,CAAC;EACzB,MAAMH,YAAY,GAAGjE,IAAI;;EAEzB;EACA,MAAM2G,wBAAwB,GAAGN,4BAA4B,CAC3DrG,IAAI,EACJ0E,cAAc,CAAC4B,kBACjB,CAAC;EACD,IAAIK,wBAAwB,EAAE;IAC5B,OAAOA,wBAAwB;EACjC;;EAEA;EACA,MAAMC,WAAW,GAAGf,6BAA6B,CAC/C7F,IAAI,EACJ0E,cAAc,CAACmC,2BACjB,CAAC;EACD,IAAID,WAAW,EAAE;IACf,OAAOA,WAAW;EACpB;;EAEA;EACA,IAAI5G,IAAI,CAACgF,QAAQ,CAAC,GAAG,CAAC,EAAE;IACtB,MAAM8B,kBAAkB,GAAGpC,cAAc,CAACoC,kBAAkB;IAC5D,IAAIA,kBAAkB,CAACf,QAAQ,CAAC/F,IAAI,CAAC,EAAE;MACrC,OAAOA,IAAI,CAACiD,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1B;EACF;;EAEA;EACA,IAAIjD,IAAI,CAACgF,QAAQ,CAAC,GAAG,CAAC,EAAE;IACtB,MAAM+B,mBAAmB,GAAGrC,cAAc,CAACqC,mBAAmB;IAC9D,IAAIA,mBAAmB,CAAChB,QAAQ,CAAC/F,IAAI,CAAC,EAAE;MACtC,OAAOA,IAAI;IACb;EACF;;EAEA;EACA,MAAMgH,aAAa,GAAGtC,cAAc,CAACsC,aAAa;EAClD,IAAIhH,IAAI,CAACgF,QAAQ,CAAC,KAAK,CAAC,EAAE;IACxB,IAAIgC,aAAa,CAACjB,QAAQ,CAAC/F,IAAI,CAAC,EAAE;MAChC,OAAOA,IAAI;IACb;EACF;EACA,IAAIA,IAAI,CAACgF,QAAQ,CAAC,MAAM,CAAC,EAAE;IACzB,IAAIgC,aAAa,CAACjB,QAAQ,CAAC/F,IAAI,CAACiD,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE;MAC7C,OAAOjD,IAAI,CAACiD,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1B;EACF;;EAEA;EACA,MAAMgE,aAAa,GAAGvC,cAAc,CAACuC,aAAa;EAClD,IAAIjH,IAAI,CAACgF,QAAQ,CAAC,KAAK,CAAC,EAAE;IACxB,IAAIiC,aAAa,CAAClB,QAAQ,CAAC/F,IAAI,CAAC,EAAE;MAChC,OAAOA,IAAI,CAACiD,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1B;EACF;;EAEA;EACAjD,IAAI,GAAGH,oBAAoB,CAACG,IAAI,EAAE0E,cAAc,CAACE,cAAc,CAACsC,yBAAyB,CAAC;;EAE1F;EACA,MAAM,CAACvG,OAAO,EAAEE,OAAO,EAAEX,OAAO,CAAC,GAAGH,WAAW,CAACC,IAAI,EAAE0E,cAAc,CAACE,cAAc,CAACuC,UAAU,CAAC;;EAE/F;AACF;AACA;AACA;EACEnH,IAAI,GAAGc,uBAAuB,CAC5Bd,IAAI,EACJ0E,cAAc,CAACE,cAAc,CAACwC,gBAAgB,EAC9CzG,OAAO,EACPE,OAAO,EACPX,OACF,CAAC;EACD,MAAMuE,cAAc,GAAGzE,IAAI;;EAE3B;AACF;AACA;AACA;EACE,MAAMqH,gCAAgC,GAAGrD,+BAA+B,CACtEhE,IAAI,EACJiE,YAAY,EACZ/D,OAAO,EACPwE,cAAc,CAACE,cAAc,CAACV,0BAChC,CAAC;EACDlE,IAAI,GAAGqH,gCAAgC,CAACrH,IAAI;EAC5C,MAAMmE,UAAU,GAAGkD,gCAAgC,CAAClD,UAAU;;EAE9D;AACF;AACA;AACA;EACE,IAAI,CAAC6C,aAAa,CAACjB,QAAQ,CAAC/F,IAAI,CAAC,EAAE;IACjCA,IAAI,GAAGwE,uBAAuB,CAC5BxE,IAAI,EACJmE,UAAU,EACVM,cAAc,EACd5D,OAAO,EACPX,OAAO,EACPwE,cACF,CAAC;EACH;EAEA,IAAIT,YAAY,KAAKjE,IAAI,CAACoE,WAAW,CAAC,CAAC,EAAE;IACvC;AACJ;AACA;IACIpE,IAAI,GAAGkF,sBAAsB,CAAClF,IAAI,EAAEE,OAAO,EAAEW,OAAO,EAAE6D,cAAc,CAACE,cAAc,CAAC;EACtF,CAAC,MAAM;IACL;AACJ;AACA;AACA;IACI,MAAM0C,OAAO,GACX5C,cAAc,CAACE,cAAc,CAAC2C,6BAA6B,CAACC,qBAAqB;IACnF,MAAMC,WAAW,GACf/C,cAAc,CAACE,cAAc,CAAC2C,6BAA6B,CAACG,yBAAyB;IACvF,IAAI1H,IAAI,CAACgF,QAAQ,CAACsC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE;MAC7BtH,IAAI,GAAGA,IAAI,CAACiD,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAGqE,OAAO,CAAC,CAAC,CAAC;IACvC,CAAC,MAAM,IAAItH,IAAI,CAACgF,QAAQ,CAACyC,WAAW,CAAC,CAAC,CAAC,CAAC,EAAE;MACxCzH,IAAI,GAAGA,IAAI,CAACiD,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAGwE,WAAW,CAAC,CAAC,CAAC;IAC3C;EACF;;EAEA;AACF;AACA;EACEzH,IAAI,GAAGH,oBAAoB,CAACG,IAAI,EAAE0E,cAAc,CAACE,cAAc,CAAC+C,wBAAwB,CAAC;;EAEzF;AACF;AACA;EACE,MAAMC,SAAS,GAAGlD,cAAc,CAACE,cAAc,CAACiD,cAAc;EAC9D7H,IAAI,GAAGA,IAAI,CAACgD,OAAO,CAAC,IAAI5C,MAAM,CAACwH,SAAS,CAAC,CAAC,CAAC,CAAC,EAAEA,SAAS,CAAC,CAAC,CAAC,CAAC;EAC3D5H,IAAI,GAAGA,IAAI,CAACoE,WAAW,CAAC,CAAC;EAEzB,MAAM0D,aAAa,GAAG9B,gBAAgB,CAAChG,IAAI,EAAE0E,cAAc,CAACwB,wBAAwB,CAAC;EACrF,IAAI4B,aAAa,EAAE;IACjB,OAAOA,aAAa;EACtB;EAEA,OAAO9H,IAAI;AACb","ignoreList":[]}