<commit_before>/*
 * Licensed to the Apache Software Foundation (ASF) under one or more
 * contributor license agreements.  See the NOTICE file distributed with
 * this work for additional information regarding copyright ownership.
 * The ASF licenses this file to You under the Apache License, Version 2.0
 * (the "License"); you may not use this file except in compliance with
 * the License.  You may obtain a copy of the License at
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package org.apache.commons.math;

import java.util.ListResourceBundle;

/** 
 * French localization message resources for the commons-math library.
 * @version $Revision$ $Date$
 * @since 1.2
 */
public class MessagesResources_fr
  extends ListResourceBundle {

  /** 
   * Simple constructor.
   */
  public MessagesResources_fr() {
  }

  /** 
   * Get the non-translated/translated messages arrays from this resource bundle.
   * @return non-translated/translated messages arrays
   */
  @Override
  public Object[][] getContents() {
    return contents.clone();
  }

  /** Non-translated/translated messages arrays. */
  private static final Object[][] contents = {

    // org.apache.commons.math.util.MathUtils
    { "must have n >= k for binomial coefficient (n,k), got n = {0}, k = {1}",
      "n doit \u00eatre sup\u00e9rieur ou \u00e9gal \u00e0 k " +
      "pour le coefficient du bin\u00f4me (n,k), or n = {0}, k = {1}" },
    { "must have n >= 0 for binomial coefficient (n,k), got n = {0}",
      "n doit \u00eatre positif pour le coefficient du bin\u00f4me (n,k), or n = {0}" },
    { "must have n >= 0 for n!, got n = {0}",
      "n doit \u00eatre positif pour le calcul de n!, or n = {0}" },
    { "overflow: gcd({0}, {1}) is 2^31",
      "d\u00e9passement de capacit\u00e9 : le PGCD de {0} et {1} vaut 2^31" },
    { "cannot raise an integral value to a negative power ({0}^{1})",
      "impossible d''\u00e9lever une valeur enti\u00e8re " +
      "\u00e0 une puissance n\u00e9gative ({0}^{1})" },
    { "invalid rounding method {0}, valid methods: {1} ({2}), {3} ({4})," +
       " {5} ({6}), {7} ({8}), {9} ({10}), {11} ({12}), {13} ({14}), {15} ({16})",
      "m\u00e9thode d''arondi {0} invalide, m\u00e9thodes valides : {1} ({2}), {3} ({4})," +
       " {5} ({6}), {7} ({8}), {9} ({10}), {11} ({12}), {13} ({14}), {15} ({16})" },

    // org.apache.commons.math.FunctionEvaluationException
    { "evaluation failed for argument = {0}",
      "erreur d''\u00e9valuation pour l''argument {0}" },

    // org.apache.commons.math.DuplicateSampleAbscissaException
    { "Abscissa {0} is duplicated at both indices {1} and {2}",
      "Abscisse {0} dupliqu\u00e9e aux indices {1} et {2}" },

    // org.apache.commons.math.ConvergenceException
    { "Convergence failed",
      "\u00c9chec de convergence" },

    // org.apache.commons.math.ArgumentOutsideDomainException
    { "Argument {0} outside domain [{1} ; {2}]",
      "Argument {0} hors du domaine [{1} ; {2}]" },

    // org.apache.commons.math.MaxIterationsExceededException
    { "Maximal number of iterations ({0}) exceeded",
      "Nombre maximal d''it\u00e9rations ({0}) d\u00e9pass\u00e9" },

    // org.apache.commons.math.MaxEvaluationsExceededException
    { "Maximal number of evaluations ({0}) exceeded",
      "Nombre maximal d''\u00e9valuations ({0}) d\u00e9pass\u00e9" },

    // org.apache.commons.math.analysis.interpolation.SplineInterpolator
    // org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm
    // org.apache.commons.math.DimensionMismatchException
    // org.apache.commons.math.optimization.LeastSquaresConverter
    // org.apache.commons.math.optimization.direct.DirectSearchOptimizer
    // org.apache.commons.math.optimization.general.AbstractLeastSquaresOptimizer
    // org.apache.commons.math.ode.ContinuousOutputModel
    // org.apache.commons.math.random.UncorrelatedRandomVectorGenerator
    // org.apache.commons.math.stat.regression.AbstractMultipleLinearRegression
    // org.apache.commons.math.stat.inference.ChiSquareTestImpl
    { "dimension mismatch {0} != {1}",
      "dimensions incompatibles {0} != {1}" },

    // org.apache.commons.math.linear.decomposition.NotPositiveDefiniteMatrixException
    { "not positive definite matrix",
      "matrice non d\u00e9finie positive" },

    // org.apache.commons.math.linear.decomposition.NotSymmetricMatrixException
    { "not symmetric matrix",
      "matrice non symm\u00e9trique" },

    // org.apache.commons.math.fraction.FractionConversionException
    { "Unable to convert {0} to fraction after {1} iterations",
      "Impossible de convertir {0} en fraction apr\u00e8s {1} it\u00e9rations" },
    { "Overflow trying to convert {0} to fraction ({1}/{2})",
      "D\u00e9passement de capacit\u00e9 lors de la conversion de {0} en fraction ({1}/{2})" },

    // org.apache.commons.math.fraction.BigFraction
    { "numerator is null",
      "le num\u00e9rateur est null" },
    { "denimonator is null",
      "le d\u00e9nominateur est null" },
    { "denominator must be different from 0",
      "le d\u00e9nominateur doit \u00eatre diff\u00e9rent de 0" },
    { "cannot convert NaN value",
      "les valeurs NaN ne peuvent \u00eatre converties" },
    { "cannot convert infinite value",
      "les valeurs infinies ne peuvent \u00eatre converties" },

    // org.apache.commons.math.fraction.AbstractFormat
    { "denominator format can not be null",
      "le format du d\u00e9nominateur ne doit pas \u00eatre nul" },
    { "numerator format can not be null",
      "le format du num\u00e9rateur ne doit pas \u00eatre nul" },

    // org.apache.commons.math.fraction.FractionFormat
    { "cannot convert given object to a fraction number: {0}",
      "impossible de convertir l''objet sous forme d''un nombre rationnel : {0}" },

    // org.apache.commons.math.fraction.FractionFormat
    // org.apache.commons.math.fraction.BigFractionFormat
    { "unparseable fraction number: \"{0}\"",
      "\u00e9chec d''analyse du nombre rationnel \"{0}\"" },
    { "cannot format given object as a fraction number",
      "impossible de formater l''objet sous forme d''un nombre rationnel" },

    // org.apache.commons.math.fraction.ProperFractionFormat
    // org.apache.commons.math.fraction.ProperBigFractionFormat
    { "whole format can not be null",
      "le format complet ne doit pas \u00eatre nul" },

    // org.apache.commons.math.analysis.solvers.UnivariateRealSolverUtils
    { "function is null",
      "la fonction est nulle" },
    { "bad value for maximum iterations number: {0}",
      "valeur invalide pour le nombre maximal d''it\u00e9rations : {0}" },
    { "invalid bracketing parameters:  lower bound={0},  initial={1}, upper bound={2}",
      "param\u00e8tres d''encadrement invalides : borne inf\u00e9rieure = {0}, valeur initiale = {1}, borne sup\u00e9rieure = {2}" },
    { "number of iterations={0}, maximum iterations={1}, initial={2}, lower bound={3}, upper bound={4}," +
        " final a value={5}, final b value={6}, f(a)={7}, f(b)={8}",
      "nombre d''it\u00e9rations = {0}, it\u00e9rations maximum = {1}, valeur initiale = {2}," +
        " borne inf\u00e9rieure = {3}, borne sup\u00e9rieure = {4}," +
        " valeur a finale = {5}, valeur b finale = {6}, f(a) = {7}, f(b) = {8}" },

    // org.apache.commons.math.analysis.solvers.LaguerreSolver
    { "polynomial degree must be positive: degree={0}",
      "le polyn\u00f4me doit \u00eatre de degr\u00e9 positif : degr\u00e9 = {0}" },

    // org.apache.commons.math.analysis.solvers.SecantSolver
    { "function values at endpoints do not have different signs, endpoints: [{0}, {1}], values: [{2}, {3}]",
      "les valeurs de la fonctions aux bornes sont de m\u00eame signe, bornes : [{0}, {1}], valeurs : [{2}, {3}]" },

    // org.apache.commons.math.analysis.interpolation.SplineInterpolator
    // org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm
    { "{0} points are required, got only {1}",
      "{0} sont n\u00e9cessaires, seuls {1} ont \u00e9t\u00e9 fournis" },

    // org.apache.commons.math.analysis.interpolation.SplineInterpolator
    { "points {0} and {1} are not strictly increasing ({2} >= {3})",
      "les points {0} et {1} ne sont pas strictements croissants ({2} >= {3})" },

    // org.apache.commons.math.util.ContinuedFraction
    { "Continued fraction convergents diverged to +/- infinity for value {0}",
      "Divergence de fraction continue \u00e0 l''infini pour la valeur {0}" },
    { "Continued fraction convergents failed to converge for value {0}",
      "\u00c9chec de convergence de fraction continue pour la valeur {0}" },

    // org.apache.commons.math.util.DefaultTransformer
    { "Conversion Exception in Transformation, Object is null",
      "Exception de conversion dans une transformation, l''objet est nul" },
    { "Conversion Exception in Transformation: {0}",
      "Exception de conversion dans une transformation : {0}" },

    // org.apache.commons.math.optimization.MultiStartOptimizer
    { "no optimum computed yet",
      "aucun optimum n''a encore \u00e9t\u00e9 calcul\u00e9" },

    // org.apache.commons.math.optimization.direct.DirectSearchOptimizer<commit_msg>error messages for Loess interpolation<commit_after>/*
 * Licensed to the Apache Software Foundation (ASF) under one or more
 * contributor license agreements.  See the NOTICE file distributed with
 * this work for additional information regarding copyright ownership.
 * The ASF licenses this file to You under the Apache License, Version 2.0
 * (the "License"); you may not use this file except in compliance with
 * the License.  You may obtain a copy of the License at
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package org.apache.commons.math;

import java.util.ListResourceBundle;

/** 
 * French localization message resources for the commons-math library.
 * @version $Revision$ $Date$
 * @since 1.2
 */
public class MessagesResources_fr
  extends ListResourceBundle {

  /** 
   * Simple constructor.
   */
  public MessagesResources_fr() {
  }

  /** 
   * Get the non-translated/translated messages arrays from this resource bundle.
   * @return non-translated/translated messages arrays
   */
  @Override
  public Object[][] getContents() {
    return contents.clone();
  }

  /** Non-translated/translated messages arrays. */
  private static final Object[][] contents = {

    // org.apache.commons.math.util.MathUtils
    { "must have n >= k for binomial coefficient (n,k), got n = {0}, k = {1}",
      "n doit \u00eatre sup\u00e9rieur ou \u00e9gal \u00e0 k " +
      "pour le coefficient du bin\u00f4me (n,k), or n = {0}, k = {1}" },
    { "must have n >= 0 for binomial coefficient (n,k), got n = {0}",
      "n doit \u00eatre positif pour le coefficient du bin\u00f4me (n,k), or n = {0}" },
    { "must have n >= 0 for n!, got n = {0}",
      "n doit \u00eatre positif pour le calcul de n!, or n = {0}" },
    { "overflow: gcd({0}, {1}) is 2^31",
      "d\u00e9passement de capacit\u00e9 : le PGCD de {0} et {1} vaut 2^31" },
    { "cannot raise an integral value to a negative power ({0}^{1})",
      "impossible d''\u00e9lever une valeur enti\u00e8re " +
      "\u00e0 une puissance n\u00e9gative ({0}^{1})" },
    { "invalid rounding method {0}, valid methods: {1} ({2}), {3} ({4})," +
       " {5} ({6}), {7} ({8}), {9} ({10}), {11} ({12}), {13} ({14}), {15} ({16})",
      "m\u00e9thode d''arondi {0} invalide, m\u00e9thodes valides : {1} ({2}), {3} ({4})," +
       " {5} ({6}), {7} ({8}), {9} ({10}), {11} ({12}), {13} ({14}), {15} ({16})" },

    // org.apache.commons.math.FunctionEvaluationException
    { "evaluation failed for argument = {0}",
      "erreur d''\u00e9valuation pour l''argument {0}" },

    // org.apache.commons.math.DuplicateSampleAbscissaException
    { "Abscissa {0} is duplicated at both indices {1} and {2}",
      "Abscisse {0} dupliqu\u00e9e aux indices {1} et {2}" },

    // org.apache.commons.math.ConvergenceException
    { "Convergence failed",
      "\u00c9chec de convergence" },

    // org.apache.commons.math.ArgumentOutsideDomainException
    { "Argument {0} outside domain [{1} ; {2}]",
      "Argument {0} hors du domaine [{1} ; {2}]" },

    // org.apache.commons.math.MaxIterationsExceededException
    { "Maximal number of iterations ({0}) exceeded",
      "Nombre maximal d''it\u00e9rations ({0}) d\u00e9pass\u00e9" },

    // org.apache.commons.math.MaxEvaluationsExceededException
    { "Maximal number of evaluations ({0}) exceeded",
      "Nombre maximal d''\u00e9valuations ({0}) d\u00e9pass\u00e9" },

    // org.apache.commons.math.analysis.interpolation.SplineInterpolator
    // org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm
    // org.apache.commons.math.DimensionMismatchException
    // org.apache.commons.math.optimization.LeastSquaresConverter
    // org.apache.commons.math.optimization.direct.DirectSearchOptimizer
    // org.apache.commons.math.optimization.general.AbstractLeastSquaresOptimizer
    // org.apache.commons.math.ode.ContinuousOutputModel
    // org.apache.commons.math.random.UncorrelatedRandomVectorGenerator
    // org.apache.commons.math.stat.regression.AbstractMultipleLinearRegression
    // org.apache.commons.math.stat.inference.ChiSquareTestImpl
    { "dimension mismatch {0} != {1}",
      "dimensions incompatibles {0} != {1}" },

    // org.apache.commons.math.linear.decomposition.NotPositiveDefiniteMatrixException
    { "not positive definite matrix",
      "matrice non d\u00e9finie positive" },

    // org.apache.commons.math.linear.decomposition.NotSymmetricMatrixException
    { "not symmetric matrix",
      "matrice non symm\u00e9trique" },

    // org.apache.commons.math.fraction.FractionConversionException
    { "Unable to convert {0} to fraction after {1} iterations",
      "Impossible de convertir {0} en fraction apr\u00e8s {1} it\u00e9rations" },
    { "Overflow trying to convert {0} to fraction ({1}/{2})",
      "D\u00e9passement de capacit\u00e9 lors de la conversion de {0} en fraction ({1}/{2})" },

    // org.apache.commons.math.fraction.BigFraction
    { "numerator is null",
      "le num\u00e9rateur est null" },
    { "denimonator is null",
      "le d\u00e9nominateur est null" },
    { "denominator must be different from 0",
      "le d\u00e9nominateur doit \u00eatre diff\u00e9rent de 0" },
    { "cannot convert NaN value",
      "les valeurs NaN ne peuvent \u00eatre converties" },
    { "cannot convert infinite value",
      "les valeurs infinies ne peuvent \u00eatre converties" },

    // org.apache.commons.math.fraction.AbstractFormat
    { "denominator format can not be null",
      "le format du d\u00e9nominateur ne doit pas \u00eatre nul" },
    { "numerator format can not be null",
      "le format du num\u00e9rateur ne doit pas \u00eatre nul" },

    // org.apache.commons.math.fraction.FractionFormat
    { "cannot convert given object to a fraction number: {0}",
      "impossible de convertir l''objet sous forme d''un nombre rationnel : {0}" },

    // org.apache.commons.math.fraction.FractionFormat
    // org.apache.commons.math.fraction.BigFractionFormat
    { "unparseable fraction number: \"{0}\"",
      "\u00e9chec d''analyse du nombre rationnel \"{0}\"" },
    { "cannot format given object as a fraction number",
      "impossible de formater l''objet sous forme d''un nombre rationnel" },

    // org.apache.commons.math.fraction.ProperFractionFormat
    // org.apache.commons.math.fraction.ProperBigFractionFormat
    { "whole format can not be null",
      "le format complet ne doit pas \u00eatre nul" },

    // org.apache.commons.math.analysis.solvers.UnivariateRealSolverUtils
    { "function is null",
      "la fonction est nulle" },
    { "bad value for maximum iterations number: {0}",
      "valeur invalide pour le nombre maximal d''it\u00e9rations : {0}" },
    { "invalid bracketing parameters:  lower bound={0},  initial={1}, upper bound={2}",
      "param\u00e8tres d''encadrement invalides : borne inf\u00e9rieure = {0}, valeur initiale = {1}, borne sup\u00e9rieure = {2}" },
    { "number of iterations={0}, maximum iterations={1}, initial={2}, lower bound={3}, upper bound={4}," +
        " final a value={5}, final b value={6}, f(a)={7}, f(b)={8}",
      "nombre d''it\u00e9rations = {0}, it\u00e9rations maximum = {1}, valeur initiale = {2}," +
        " borne inf\u00e9rieure = {3}, borne sup\u00e9rieure = {4}," +
        " valeur a finale = {5}, valeur b finale = {6}, f(a) = {7}, f(b) = {8}" },

    // org.apache.commons.math.analysis.solvers.LaguerreSolver
    { "polynomial degree must be positive: degree={0}",
      "le polyn\u00f4me doit \u00eatre de degr\u00e9 positif : degr\u00e9 = {0}" },

    // org.apache.commons.math.analysis.solvers.SecantSolver
    { "function values at endpoints do not have different signs, endpoints: [{0}, {1}], values: [{2}, {3}]",
      "les valeurs de la fonctions aux bornes sont de m\u00eame signe, bornes : [{0}, {1}], valeurs : [{2}, {3}]" },

    // org.apache.commons.math.analysis.interpolation.SplineInterpolator
    // org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm
    { "{0} points are required, got only {1}",
      "{0} sont n\u00e9cessaires, seuls {1} ont \u00e9t\u00e9 fournis" },

    // org.apache.commons.math.analysis.interpolation.SplineInterpolator
    { "points {0} and {1} are not strictly increasing ({2} >= {3})",
      "les points {0} et {1} ne sont pas strictements croissants ({2} >= {3})" },

    // org.apache.commons.math.analysis.interpolation.LoessInterpolator
    { "bandwidth must be in the interval [0,1], but got {0}",
      "la largeur de bande doit \u00eatre dans l''intervalle [0, 1], alors qu'elle vaut {0}" },
    { "the number of robustness iterations must be non-negative, but got {0}",
      "le nombre d''it\u00e9rations robuste ne peut \u00eatre n\u00e9gatif, alors qu''il est de {0}" },
    { "Loess expects the abscissa and ordinate arrays to be of the same size, " +
      "but got {0} abscisssae and {1} ordinatae",
      "la r\u00e9gression Loess n\u00e9cessite autant d''abscisses que d''ordonn\u00e9es, " +
      "mais {0} abscisses et {1} ordonn\u00e9es ont \u00e9t\u00e9 fournies" },
    { "Loess expects at least 1 point",
      "la r\u00e9gression Loess n\u00e9cessite au moins un point" },
    { "the bandwidth must be large enough to accomodate at least 2 points. There are {0} " +
      " data points, and bandwidth must be at least {1}  but it is only {2}",
      "la largeur de bande doit \u00eatre assez grande pour supporter au moins 2 points. Il y a {0}" +
      "donn\u00e9es et la largeur de bande doit \u00eatre au moins de {1}, or elle est seulement de {2}" },
    { "all abscissae must be finite real numbers, but {0}-th is {1}",
      "toutes les abscisses doivent \u00eatre des nombres r\u00e9els finis, mais l''abscisse {0} vaut {1}" },
    { "all ordinatae must be finite real numbers, but {0}-th is {1}",
      "toutes les ordonn\u00e9es doivent \u00eatre des nombres r\u00e9els finis, mais l''ordonn\u00e9e {0} vaut {1}" },
    { "the abscissae array must be sorted in a strictly increasing order, " +
      "but the {0}-th element is {1} whereas {2}-th is {3}",
      "les abscisses doivent \u00eatre en ordre strictement croissant, " +
      "mais l''\u00e9l\u00e9ment {0} vaut {1} alors que l''\u00e9l\u00e9ment {2} vaut {3}" },

    // org.apache.commons.math.util.ContinuedFraction
    { "Continued fraction convergents diverged to +/- infinity for value {0}",
      "Divergence de fraction continue \u00e0 l''infini pour la valeur {0}" },
    { "Continued fraction convergents failed to converge for value {0}",
      "\u00c9chec de convergence de fraction continue pour la valeur {0}" },

    // org.apache.commons.math.util.DefaultTransformer
    { "Conversion Exception in Transformation, Object is null",
      "Exception de conversion dans une transformation, l''objet est nul" },
    { "Conversion Exception in Transformation: {0}",
      "Exception de conversion dans une transformation : {0}" },

    // org.apache.commons.math.optimization.MultiStartOptimizer
    { "no optimum computed yet",
      "aucun optimum n''a encore \u00e9t\u00e9 calcul\u00e9" },

    // org.apache.commons.math.optimization.direct.DirectSearchOptimizer
{'fraction_non_alphanumeric': 0.1391941391941392, 'fraction_numerical': 0.03881832453261025, 'mean_word_length': 3.379583333333333, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 13, 'https://': 0, 'lorem ipsum': 0, 'www.': 2, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '7389319', 'n_tokens_mistral': 7304, 'n_tokens_neox': 6860, 'n_words': 2016}