001 /* 002 * Licensed to the Apache Software Foundation (ASF) under one or more 003 * contributor license agreements. See the NOTICE file distributed with 004 * this work for additional information regarding copyright ownership. 005 * The ASF licenses this file to You under the Apache License, Version 2.0 006 * (the "License"); you may not use this file except in compliance with 007 * the License. You may obtain a copy of the License at 008 * 009 * http://www.apache.org/licenses/LICENSE-2.0 010 * 011 * Unless required by applicable law or agreed to in writing, software 012 * distributed under the License is distributed on an "AS IS" BASIS, 013 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 014 * See the License for the specific language governing permissions and 015 * limitations under the License. 016 */ 017 018 package org.apache.commons.math; 019 020 import java.util.ListResourceBundle; 021 022 /** 023 * French localization message resources for the commons-math library. 024 * @version $Revision: 796546 $ $Date: 2009-07-21 17:38:55 -0400 (Tue, 21 Jul 2009) $ 025 * @since 1.2 026 */ 027 public class MessagesResources_fr 028 extends ListResourceBundle { 029 030 /** 031 * Simple constructor. 032 */ 033 public MessagesResources_fr() { 034 } 035 036 /** 037 * Get the non-translated/translated messages arrays from this resource bundle. 038 * @return non-translated/translated messages arrays 039 */ 040 @Override 041 public Object[][] getContents() { 042 return contents.clone(); 043 } 044 045 /** Non-translated/translated messages arrays. */ 046 private static final Object[][] contents = { 047 048 // org.apache.commons.math.util.MathUtils 049 { "must have n >= k for binomial coefficient (n,k), got n = {0}, k = {1}", 050 "n doit \u00eatre sup\u00e9rieur ou \u00e9gal \u00e0 k " + 051 "pour le coefficient du bin\u00f4me (n,k), or n = {0}, k = {1}" }, 052 { "must have n >= 0 for binomial coefficient (n,k), got n = {0}", 053 "n doit \u00eatre positif pour le coefficient du bin\u00f4me (n,k), or n = {0}" }, 054 { "must have n >= 0 for n!, got n = {0}", 055 "n doit \u00eatre positif pour le calcul de n!, or n = {0}" }, 056 { "overflow: gcd({0}, {1}) is 2^31", 057 "d\u00e9passement de capacit\u00e9 : le PGCD de {0} et {1} vaut 2^31" }, 058 { "cannot raise an integral value to a negative power ({0}^{1})", 059 "impossible d''\u00e9lever une valeur enti\u00e8re " + 060 "\u00e0 une puissance n\u00e9gative ({0}^{1})" }, 061 { "invalid rounding method {0}, valid methods: {1} ({2}), {3} ({4})," + 062 " {5} ({6}), {7} ({8}), {9} ({10}), {11} ({12}), {13} ({14}), {15} ({16})", 063 "m\u00e9thode d''arondi {0} invalide, m\u00e9thodes valides : {1} ({2}), {3} ({4})," + 064 " {5} ({6}), {7} ({8}), {9} ({10}), {11} ({12}), {13} ({14}), {15} ({16})" }, 065 066 // org.apache.commons.math.FunctionEvaluationException 067 { "evaluation failed for argument = {0}", 068 "erreur d''\u00e9valuation pour l''argument {0}" }, 069 070 // org.apache.commons.math.DuplicateSampleAbscissaException 071 { "Abscissa {0} is duplicated at both indices {1} and {2}", 072 "Abscisse {0} dupliqu\u00e9e aux indices {1} et {2}" }, 073 074 // org.apache.commons.math.ConvergenceException 075 { "Convergence failed", 076 "\u00c9chec de convergence" }, 077 078 // org.apache.commons.math.ArgumentOutsideDomainException 079 { "Argument {0} outside domain [{1} ; {2}]", 080 "Argument {0} hors du domaine [{1} ; {2}]" }, 081 082 // org.apache.commons.math.MaxIterationsExceededException 083 { "Maximal number of iterations ({0}) exceeded", 084 "Nombre maximal d''it\u00e9rations ({0}) d\u00e9pass\u00e9" }, 085 086 // org.apache.commons.math.MaxEvaluationsExceededException 087 { "Maximal number of evaluations ({0}) exceeded", 088 "Nombre maximal d''\u00e9valuations ({0}) d\u00e9pass\u00e9" }, 089 090 // org.apache.commons.math.analysis.interpolation.SplineInterpolator 091 // org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm 092 // org.apache.commons.math.DimensionMismatchException 093 // org.apache.commons.math.optimization.LeastSquaresConverter 094 // org.apache.commons.math.optimization.direct.DirectSearchOptimizer 095 // org.apache.commons.math.optimization.general.AbstractLeastSquaresOptimizer 096 // org.apache.commons.math.ode.ContinuousOutputModel 097 // org.apache.commons.math.random.UncorrelatedRandomVectorGenerator 098 // org.apache.commons.math.stat.regression.AbstractMultipleLinearRegression 099 // org.apache.commons.math.stat.inference.ChiSquareTestImpl 100 { "dimension mismatch {0} != {1}", 101 "dimensions incompatibles {0} != {1}" }, 102 103 // org.apache.commons.math.linear.decomposition.NotPositiveDefiniteMatrixException 104 { "not positive definite matrix", 105 "matrice non d\u00e9finie positive" }, 106 107 // org.apache.commons.math.linear.decomposition.NotSymmetricMatrixException 108 { "not symmetric matrix", 109 "matrice non symm\u00e9trique" }, 110 111 // org.apache.commons.math.fraction.FractionConversionException 112 { "Unable to convert {0} to fraction after {1} iterations", 113 "Impossible de convertir {0} en fraction apr\u00e8s {1} it\u00e9rations" }, 114 { "Overflow trying to convert {0} to fraction ({1}/{2})", 115 "D\u00e9passement de capacit\u00e9 lors de la conversion de {0} en fraction ({1}/{2})" }, 116 117 // org.apache.commons.math.fraction.BigFraction 118 { "numerator is null", 119 "le num\u00e9rateur est null" }, 120 { "denimonator is null", 121 "le d\u00e9nominateur est null" }, 122 { "denominator must be different from 0", 123 "le d\u00e9nominateur doit \u00eatre diff\u00e9rent de 0" }, 124 { "cannot convert NaN value", 125 "les valeurs NaN ne peuvent \u00eatre converties" }, 126 { "cannot convert infinite value", 127 "les valeurs infinies ne peuvent \u00eatre converties" }, 128 129 // org.apache.commons.math.fraction.AbstractFormat 130 { "denominator format can not be null", 131 "le format du d\u00e9nominateur ne doit pas \u00eatre nul" }, 132 { "numerator format can not be null", 133 "le format du num\u00e9rateur ne doit pas \u00eatre nul" }, 134 135 // org.apache.commons.math.fraction.FractionFormat 136 { "cannot convert given object to a fraction number: {0}", 137 "impossible de convertir l''objet sous forme d''un nombre rationnel : {0}" }, 138 139 // org.apache.commons.math.fraction.FractionFormat 140 // org.apache.commons.math.fraction.BigFractionFormat 141 { "unparseable fraction number: \"{0}\"", 142 "\u00e9chec d''analyse du nombre rationnel \"{0}\"" }, 143 { "cannot format given object as a fraction number", 144 "impossible de formater l''objet sous forme d''un nombre rationnel" }, 145 146 // org.apache.commons.math.fraction.ProperFractionFormat 147 // org.apache.commons.math.fraction.ProperBigFractionFormat 148 { "whole format can not be null", 149 "le format complet ne doit pas \u00eatre nul" }, 150 151 // org.apache.commons.math.analysis.solvers.UnivariateRealSolverUtils 152 { "function is null", 153 "la fonction est nulle" }, 154 { "bad value for maximum iterations number: {0}", 155 "valeur invalide pour le nombre maximal d''it\u00e9rations : {0}" }, 156 { "invalid bracketing parameters: lower bound={0}, initial={1}, upper bound={2}", 157 "param\u00e8tres d''encadrement invalides : borne inf\u00e9rieure = {0}, valeur initiale = {1}, borne sup\u00e9rieure = {2}" }, 158 { "number of iterations={0}, maximum iterations={1}, initial={2}, lower bound={3}, upper bound={4}," + 159 " final a value={5}, final b value={6}, f(a)={7}, f(b)={8}", 160 "nombre d''it\u00e9rations = {0}, it\u00e9rations maximum = {1}, valeur initiale = {2}," + 161 " borne inf\u00e9rieure = {3}, borne sup\u00e9rieure = {4}," + 162 " valeur a finale = {5}, valeur b finale = {6}, f(a) = {7}, f(b) = {8}" }, 163 164 // org.apache.commons.math.analysis.solvers.LaguerreSolver 165 { "polynomial degree must be positive: degree={0}", 166 "le polyn\u00f4me doit \u00eatre de degr\u00e9 positif : degr\u00e9 = {0}" }, 167 168 // org.apache.commons.math.analysis.solvers.SecantSolver 169 { "function values at endpoints do not have different signs, endpoints: [{0}, {1}], values: [{2}, {3}]", 170 "les valeurs de la fonctions aux bornes sont de m\u00eame signe, bornes : [{0}, {1}], valeurs : [{2}, {3}]" }, 171 172 // org.apache.commons.math.analysis.interpolation.SplineInterpolator 173 // org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm 174 { "{0} points are required, got only {1}", 175 "{0} sont n\u00e9cessaires, seuls {1} ont \u00e9t\u00e9 fournis" }, 176 177 // org.apache.commons.math.analysis.interpolation.SplineInterpolator 178 { "points {0} and {1} are not strictly increasing ({2} >= {3})", 179 "les points {0} et {1} ne sont pas strictements croissants ({2} >= {3})" }, 180 181 // org.apache.commons.math.analysis.interpolation.LoessInterpolator 182 { "bandwidth must be in the interval [0,1], but got {0}", 183 "la largeur de bande doit \u00eatre dans l''intervalle [0, 1], alors qu'elle vaut {0}" }, 184 { "the number of robustness iterations must be non-negative, but got {0}", 185 "le nombre d''it\u00e9rations robuste ne peut \u00eatre n\u00e9gatif, alors qu''il est de {0}" }, 186 { "Loess expects the abscissa and ordinate arrays to be of the same size, " + 187 "but got {0} abscisssae and {1} ordinatae", 188 "la r\u00e9gression Loess n\u00e9cessite autant d''abscisses que d''ordonn\u00e9es, " + 189 "mais {0} abscisses et {1} ordonn\u00e9es ont \u00e9t\u00e9 fournies" }, 190 { "Loess expects at least 1 point", 191 "la r\u00e9gression Loess n\u00e9cessite au moins un point" }, 192 { "the bandwidth must be large enough to accomodate at least 2 points. There are {0} " + 193 " data points, and bandwidth must be at least {1} but it is only {2}", 194 "la largeur de bande doit \u00eatre assez grande pour supporter au moins 2 points. Il y a {0}" + 195 "donn\u00e9es et la largeur de bande doit \u00eatre au moins de {1}, or elle est seulement de {2}" }, 196 { "all abscissae must be finite real numbers, but {0}-th is {1}", 197 "toutes les abscisses doivent \u00eatre des nombres r\u00e9els finis, mais l''abscisse {0} vaut {1}" }, 198 { "all ordinatae must be finite real numbers, but {0}-th is {1}", 199 "toutes les ordonn\u00e9es doivent \u00eatre des nombres r\u00e9els finis, mais l''ordonn\u00e9e {0} vaut {1}" }, 200 { "the abscissae array must be sorted in a strictly increasing order, " + 201 "but the {0}-th element is {1} whereas {2}-th is {3}", 202 "les abscisses doivent \u00eatre en ordre strictement croissant, " + 203 "mais l''\u00e9l\u00e9ment {0} vaut {1} alors que l''\u00e9l\u00e9ment {2} vaut {3}" }, 204 205 // org.apache.commons.math.util.ContinuedFraction 206 { "Continued fraction convergents diverged to +/- infinity for value {0}", 207 "Divergence de fraction continue \u00e0 l''infini pour la valeur {0}" }, 208 { "Continued fraction convergents failed to converge for value {0}", 209 "\u00c9chec de convergence de fraction continue pour la valeur {0}" }, 210 211 // org.apache.commons.math.util.DefaultTransformer 212 { "Conversion Exception in Transformation, Object is null", 213 "Exception de conversion dans une transformation, l''objet est nul" }, 214 { "Conversion Exception in Transformation: {0}", 215 "Exception de conversion dans une transformation : {0}" }, 216 217 // org.apache.commons.math.optimization.MultiStartOptimizer 218 { "no optimum computed yet", 219 "aucun optimum n''a encore \u00e9t\u00e9 calcul\u00e9" }, 220 221 // org.apache.commons.math.optimization.direct.DirectSearchOptimizer 222 { "simplex must contain at least one point", 223 "le simplex doit contenir au moins un point" }, 224 { "equals vertices {0} and {1} in simplex configuration", 225 "sommets {0} et {1} \u00e9gaux dans la configuration du simplex" }, 226 227 // org.apache.commons.math.estimation.AbstractEstimation 228 { "maximal number of evaluations exceeded ({0})", 229 "nombre maximal d''\u00e9valuations d\u00e9pass\u00e9 ({0})" }, 230 231 // org.apache.commons.math.optimization.general.AbstractLeastSquaresOptimizer 232 { "unable to compute covariances: singular problem", 233 "impossible de calculer les covariances : probl\u00e8me singulier"}, 234 { "no degrees of freedom ({0} measurements, {1} parameters)", 235 "aucun degr\u00e9 de libert\u00e9 ({0} mesures, {1} param\u00e8tres)" }, 236 237 // org.apache.commons.math.optimization.general.GaussNewtonOptimizer 238 { "unable to solve: singular problem", 239 "r\u00e9solution impossible : probl\u00e8me singulier" }, 240 241 // org.apache.commons.math.optimization.general.LevenbergMarquardtEstimator 242 { "cost relative tolerance is too small ({0}), no further reduction in the sum of squares is possible", 243 "trop petite tol\u00e9rance relative sur le co\u00fbt ({0}), aucune r\u00e9duction de la somme des carr\u00e9s n''est possible" }, 244 { "parameters relative tolerance is too small ({0}), no further improvement in the approximate solution is possible", 245 "trop petite tol\u00e9rance relative sur les param\u00e8tres ({0}), aucune am\u00e9lioration de la solution approximative n''est possible" }, 246 { "orthogonality tolerance is too small ({0}), solution is orthogonal to the jacobian", 247 "trop petite tol\u00e9rance sur l''orthogonalit\u00e9 ({0}), la solution est orthogonale \u00e0 la jacobienne" }, 248 { "unable to perform Q.R decomposition on the {0}x{1} jacobian matrix", 249 "impossible de calculer la factorisation Q.R de la matrice jacobienne {0}x{1}" }, 250 251 // org.apache.commons.math.optimization.general.NonLinearConjugateGradientOptimizer 252 { "unable to bracket optimum in line search", 253 "impossible d''encadrer l''optimum lors de la recherche lin\u00e9aire" }, 254 255 // org.apache.commons.math.optimization.fitting.HarmonicCoefficientsGuesser 256 { "unable to first guess the harmonic coefficients", 257 "impossible de faire une premi\u00e8re estimation des coefficients harmoniques" }, 258 259 // org.apache.commons.math.optimization.fitting.HarmonicCoefficientsGuesser 260 { "sample contains {0} observed points, at least {1} are required", 261 "l''\u00e9chantillon ne contient que {0} points alors qu''au moins {1} sont n\u00e9cessaires" }, 262 263 // org.apache.commons.math.optimization.linear.NoFeasibleSolutionException 264 { "no feasible solution", 265 "aucune solution r\u00e9alisable" }, 266 267 // org.apache.commons.math.optimization.linear.UnboundedSolutionException 268 { "unbounded solution", 269 "solution non born\u00e9e" }, 270 271 // org.apache.commons.math.geometry.CardanEulerSingularityException 272 { "Cardan angles singularity", 273 "singularit\u00e9 d''angles de Cardan" }, 274 { "Euler angles singularity", 275 "singularit\u00e9 d''angles d''Euler" }, 276 277 // org.apache.commons.math.geometry.Rotation 278 { "a {0}x{1} matrix cannot be a rotation matrix", 279 "une matrice {0}x{1} ne peut pas \u00eatre une matrice de rotation" }, 280 { "the closest orthogonal matrix has a negative determinant {0}", 281 "la matrice orthogonale la plus proche a un d\u00e9terminant n\u00e9gatif {0}" }, 282 { "unable to orthogonalize matrix in {0} iterations", 283 "impossible de rendre la matrice orthogonale en {0} it\u00e9rations" }, 284 285 // org.apache.commons.math.ode.nonstiff.AdaptiveStepsizeIntegrator 286 { "minimal step size ({0}) reached, integration needs {1}", 287 "pas minimal ({0}) atteint, l''int\u00e9gration n\u00e9cessite {1}" }, 288 { "dimensions mismatch: state vector has dimension {0}," + 289 " absolute tolerance vector has dimension {1}", 290 "incompatibilit\u00e9 de dimensions entre le vecteur d''\u00e9tat ({0})," + 291 " et le vecteur de tol\u00e9rance absolue ({1})" }, 292 { "dimensions mismatch: state vector has dimension {0}," + 293 " relative tolerance vector has dimension {1}", 294 "incompatibilit\u00e9 de dimensions entre le vecteur d''\u00e9tat ({0})," + 295 " et le vecteur de tol\u00e9rance relative ({1})" }, 296 297 // org.apache.commons.math.ode.nonstiff.AdaptiveStepsizeIntegrator, 298 // org.apache.commons.math.ode.nonstiff.RungeKuttaIntegrator 299 { "dimensions mismatch: ODE problem has dimension {0}," + 300 " initial state vector has dimension {1}", 301 "incompatibilit\u00e9 de dimensions entre le probl\u00e8me ODE ({0})," + 302 " et le vecteur d''\u00e9tat initial ({1})" }, 303 { "dimensions mismatch: ODE problem has dimension {0}," + 304 " final state vector has dimension {1}", 305 "incompatibilit\u00e9 de dimensions entre le probl\u00e8me ODE ({0})," + 306 " et le vecteur d''\u00e9tat final ({1})" }, 307 { "too small integration interval: length = {0}", 308 "intervalle d''int\u00e9gration trop petit : {0}" }, 309 310 // org.apache.commons.math.ode.MultistepIntegrator 311 { "{0} method needs at least one previous point", 312 "la m\u00e9thode {0} n\u00e9cessite au moins un point pr\u00e9c\u00e9dent" }, 313 314 // org.apache.commons.math.ode.ContinuousOutputModel 315 // org.apache.commons.math.optimization.direct.DirectSearchOptimizer 316 { "unexpected exception caught", 317 "exception inattendue lev\u00e9e" }, 318 { "propagation direction mismatch", 319 "directions de propagation incoh\u00e9rentes" }, 320 { "{0} wide hole between models time ranges", 321 "trou de longueur {0} entre les domaines temporels des mod\u00e8les" }, 322 323 // org.apache.commons.math.optimization.direct.DirectSearchOptimizer 324 { "none of the {0} start points lead to convergence", 325 "aucun des {0} points de d\u00e9part n''aboutit \u00e0 une convergence" }, 326 327 // org.apache.commons.math.random.ValueServer 328 { "unknown mode {0}, known modes: {1} ({2}), {3} ({4}), {5} ({6}), {7} ({8}), {9} ({10}) and {11} ({12})", 329 "mode {0} inconnu, modes connus : {1} ({2}), {3} ({4}), {5} ({6}), {7} ({8}), {9} ({10}) et {11} ({12})" }, 330 { "digest not initialized", 331 "mod\u00e8le empirique non initialis\u00e9" }, 332 333 // org.apache.commons.math.random.EmpiricalDistributionImpl 334 { "distribution not loaded", 335 "aucune distribution n''a \u00e9t\u00e9 charg\u00e9e" }, 336 { "no bin selected", 337 "aucun compartiment s\u00e9lectionn\u00e9" }, 338 { "input data comes from unsupported datasource: {0}, supported sources: {1}, {2}", 339 "les donn\u00e9es d''entr\u00e9e proviennent " + 340 "d''une source non support\u00e9e : {0}, sources support\u00e9es : {1}, {2}" }, 341 342 // org.apache.commons.math.random.EmpiricalDistributionImpl 343 // org.apache.commons.math.random.ValueServer 344 { "URL {0} contains no data", 345 "l''adresse {0} ne contient aucune donn\u00e9e" }, 346 347 // org.apache.commons.math.random.AbstractRandomGenerator 348 // org.apache.commons.math.random.BitsStreamGenerator 349 { "upper bound must be positive ({0})", 350 "la borne sup\u00e9rieure doit \u00eatre positive ({0})" }, 351 352 // org.apache.commons.math.random.RandomDataImpl 353 { "length must be positive ({0})", 354 "la longueur doit \u00eatre positive ({0})" }, 355 { "upper bound ({0}) must be greater than lower bound ({1})", 356 "la borne sup\u00e9rieure ({0}) doit \u00eatre sup\u00e9rieure" + 357 " \u00e0 la borne inf\u00e9rieure ({1})" }, 358 { "permutation k ({0}) exceeds n ({1})", 359 "la permutation k ({0}) d\u00e9passe n ({1})" }, 360 { "permutation k ({0}) must be positive", 361 "la permutation k ({0}) doit \u00eatre positive" }, 362 { "sample size ({0}) exceeds collection size ({1})", 363 "la taille de l''\u00e9chantillon ({0}) d\u00e9passe la taille de la collection ({1})" }, 364 365 // org.apache.commons.math.linear.decomposition.EigenDecompositionImpl 366 { "cannot solve degree {0} equation", 367 "impossible de r\u00e9soudre une \u00e9quation de degr\u00e9 {0}" }, 368 { "eigen decomposition of assymetric matrices not supported yet", 369 "la d\u00e9composition en valeurs/vecteurs propres de matrices " + 370 "non sym\u00e9triques n''est pas encore disponible" }, 371 372 // org.apache.commons.math.linear.decomposition.NonSquareMatrixException 373 // org.apache.commons.math.stat.regression.AbstractMultipleLinearRegression 374 { "a {0}x{1} matrix was provided instead of a square matrix", 375 "une matrice {0}x{1} a \u00e9t\u00e9 fournie \u00e0 la place d''une matrice carr\u00e9e" }, 376 377 // org.apache.commons.math.linear.decomposition.SingularMatrixException 378 { "matrix is singular", 379 "matrice singuli\u00e8re" }, 380 381 // org.apache.commons.math.linear.decomposition.SingularValueDecompositionImpl 382 { "cutoff singular value is {0}, should be at most {1}", 383 "la valeur singuli\u00e8re de coupure vaut {0}, elle ne devrait pas d\u00e9passer {1}" }, 384 385 // org.apache.commons.math.linear.decomposition.CholeskyDecompositionImpl 386 // org.apache.commons.math.linear.decomposition.EigenDecompositionImpl 387 // org.apache.commons.math.linear.decomposition.LUDecompositionImpl 388 // org.apache.commons.math.linear.decomposition.QRDecompositionImpl 389 // org.apache.commons.math.linear.decomposition.SingularValueDecompositionImpl 390 { "dimensions mismatch: got {0}x{1} but expected {2}x{3}", 391 "dimensions erronn\u00e9es : {0}x{1} \u00e0 la place de {2}x{3}" }, 392 393 // org.apache.commons.math.linear.decomposition.CholeskyDecompositionImpl 394 // org.apache.commons.math.linear.decomposition.EigenDecompositionImpl 395 // org.apache.commons.math.linear.decomposition.LUDecompositionImpl 396 // org.apache.commons.math.linear.decomposition.QRDecompositionImpl 397 // org.apache.commons.math.linear.decomposition.SingularValueDecompositionImpl 398 // org.apache.commons.math.linear.ArrayRealVector 399 // org.apache.commons.math.linear.SparseRealVector 400 { "vector length mismatch: got {0} but expected {1}", 401 "dimension de vecteur erronn\u00e9e : {0} \u00e0 la place de {1}" }, 402 403 // org.apache.commons.math.linear.ArrayRealVector 404 // org.apache.commons.math.linear.ArrayFieldVector 405 // org.apache.commons.math.linear.SparseRealVector 406 { "index {0} out of allowed range [{1}, {2}]", 407 "index {0} hors de la plage autoris\u00e9e [{1}, {2}]" }, 408 { "vector must have at least one element", 409 "un vecteur doit comporter au moins un \u00e9l\u00e9ment" }, 410 { "position {0} and size {1} don't fit to the size of the input array {2}", 411 "la position {0} et la taille {1} sont incompatibles avec la taille du tableau d''entr\u00e9e {2}"}, 412 413 // org.apache.commons.math.linear.AbstractRealMatrix 414 // org.apache.commons.math.linear.AbstractFieldMatrix 415 { "invalid row dimension: {0} (must be positive)", 416 "nombre de lignes invalide : {0} (doit \u00eatre positif)" }, 417 { "invalid column dimension: {0} (must be positive)", 418 "nombre de colonnes invalide : {0} (doit \u00eatre positif)" }, 419 { "vector length mismatch: got {0} but expected {1}", 420 "taille de vecteur invalide : {0} au lieu de {1} attendue" }, 421 { "dimensions mismatch: got {0}x{1} but expected {2}x{3}", 422 "dimensions incoh\u00e9rentes : {0}x{1} \u00e0 la place de {2}x{3}" }, 423 { "matrix must have at least one row", 424 "une matrice doit comporter au moins une ligne" }, 425 { "matrix must have at least one column", 426 "une matrice doit comporter au moins une colonne" }, 427 428 // org.apache.commons.math.linear.AbstractRealMatrix 429 // org.apache.commons.math.linear.AbstractFieldMatrix 430 // org.apache.commons.math.stat.inference.ChiSquareTestImpl 431 { "some rows have length {0} while others have length {1}", 432 "certaines lignes ont une longueur de {0} alors que d''autres ont une longueur de {1}" }, 433 434 // org.apache.commons.math.linear.MatrixUtils 435 { "row index {0} out of allowed range [{1}, {2}]", 436 "index de ligne {0} hors de la plage autoris\u00e9e [{1}, {2}]" }, 437 { "column index {0} out of allowed range [{1}, {2}]", 438 "index de colonne {0} hors de la plage autoris\u00e9e [{1}, {2}]" }, 439 { "initial row {0} after final row {1}", 440 "ligne initiale {0} apr\u00e8s la ligne finale {1}" }, 441 { "initial column {0} after final column {1}", 442 "colonne initiale {0} apr\u00e8s la colonne finale {1}" }, 443 { "empty selected row index array", 444 "tableau des indices de lignes s\u00e9lectionn\u00e9es vide" }, 445 { "empty selected column index array", 446 "tableau des indices de colonnes s\u00e9lectionn\u00e9es vide" }, 447 { "{0}x{1} and {2}x{3} matrices are not addition compatible", 448 "les dimensions {0}x{1} et {2}x{3} sont incompatibles pour l'addition matricielle" }, 449 { "{0}x{1} and {2}x{3} matrices are not subtraction compatible", 450 "les dimensions {0}x{1} et {2}x{3} sont incompatibles pour la soustraction matricielle" }, 451 { "{0}x{1} and {2}x{3} matrices are not multiplication compatible", 452 "les dimensions {0}x{1} et {2}x{3} sont incompatibles pour la multiplication matricielle" }, 453 454 // org.apache.commons.math.linear.BlockRealMatrix 455 { "wrong array shape (block length = {0}, expected {1})", 456 "forme de tableau erron\u00e9e (bloc de longueur {0} au lieu des {1} attendus)" }, 457 458 // org.apache.commons.math.complex.Complex 459 { "cannot compute nth root for null or negative n: {0}", 460 "impossible de calculer la racine ni\u00e8me pour n n\u00e9gatif ou nul : {0}" }, 461 462 // org.apache.commons.math.complex.ComplexFormat 463 { "unparseable complex number: \"{0}\"", 464 "\u00e9chec d''analyse du nombre complexe \"{0}\"" }, 465 { "cannot format a {0} instance as a complex number", 466 "impossible de formater une instance de {0} comme un nombre complexe" }, 467 { "empty string for imaginary character", 468 "cha\u00eene vide pour le caract\u00e8 imaginaire" }, 469 { "null imaginary format", 470 "format imaginaire nul" }, 471 { "null real format", 472 "format r\u00e9el nul" }, 473 474 // org.apache.commons.math.complex.ComplexUtils 475 { "negative complex module {0}", 476 "module n\u00e9gatif ({0}) pour un nombre complexe" }, 477 478 // org.apache.commons.math.geometry.Vector3DFormat 479 { "unparseable 3D vector: \"{0}\"", 480 "\u00e9chec d''analyse du vecteur de dimension 3 \"{0}\"" }, 481 { "cannot format a {0} instance as a 3D vector", 482 "impossible de formater une instance de {0} comme un vecteur de dimension 3" }, 483 484 // org.apache.commons.math.linear.RealVectorFormat 485 { "unparseable real vector: \"{0}\"", 486 "\u00e9chec d''analyse du vecteur r\u00e9el \"{0}\"" }, 487 { "cannot format a {0} instance as a real vector", 488 "impossible de formater une instance de {0} comme un vecteur r\u00e9el" }, 489 490 // org.apache.commons.math.util.ResizableDoubleArray 491 { "the index specified: {0} is larger than the current maximal index {1}", 492 "l''index sp\u00e9cifi\u00e9 ({0}) d\u00e9passe l''index maximal courant ({1})" }, 493 { "elements cannot be retrieved from a negative array index {0}", 494 "impossible d''extraire un \u00e9l\u00e9ment \u00e0 un index n\u00e9gatif ({0})" }, 495 { "cannot set an element at a negative index {0}", 496 "impossible de mettre un \u00e9l\u00e9ment \u00e0 un index n\u00e9gatif ({0})" }, 497 { "cannot substitute an element from an empty array", 498 "impossible de substituer un \u00e9l\u00e9ment dans un tableau vide" }, 499 { "contraction criteria ({0}) smaller than the expansion factor ({1}). This would " + 500 "lead to a never ending loop of expansion and contraction as a newly expanded " + 501 "internal storage array would immediately satisfy the criteria for contraction.", 502 "crit\u00e8re de contraction ({0}) inf\u00e9rieur au facteur d''extension. Ceci " + 503 "induit une boucle infinie d''extensions/contractions car tout tableau de stockage " + 504 "fra\u00eechement \u00e9tendu respecte imm\u00e9diatement le crit\u00e8re de contraction."}, 505 { "contraction criteria smaller than one ({0}). This would lead to a never ending " + 506 "loop of expansion and contraction as an internal storage array length equal " + 507 "to the number of elements would satisfy the contraction criteria.", 508 "crit\u00e8re de contraction inf\u00e9rieur \u00e0 un ({0}). Ceci induit une boucle " + 509 "infinie d''extensions/contractions car tout tableau de stockage de longueur \u00e9gale " + 510 "au nombre d''\u00e9l\u00e9ments respecte le crit\u00e8re de contraction." }, 511 { "expansion factor smaller than one ({0})", 512 "facteur d''extension inf\u00e9rieur \u00e0 un ({0})"}, 513 { "cannot discard {0} elements from a {1} elements array", 514 "impossible d''enlever {0} \u00e9l\u00e9ments d''un tableau en contenant {1}"}, 515 { "cannot discard a negative number of elements ({0})", 516 "impossible d''enlever un nombre d''\u00e9l\u00e9ments{0} n\u00e9gatif"}, 517 { "unsupported expansion mode {0}, supported modes are {1} ({2}) and {3} ({4})", 518 "mode d''extension {0} no support\u00e9, les modes support\u00e9s sont {1} ({2}) et {3} ({4})" }, 519 { "initial capacity ({0}) is not positive", 520 "la capacit\u00e9 initiale ({0}) n''est pas positive" }, 521 { "index ({0}) is not positive", 522 "l''indice ({0}) n''est pas positif" }, 523 524 // org.apache.commons.math.analysis.polynomials.PolynomialFunction 525 // org.apache.commons.math.analysis.polynomials.PolynomialFunctionNewtonForm 526 { "empty polynomials coefficients array", 527 "tableau de coefficients polyn\u00f4miaux vide" }, 528 529 // org.apache.commons.math.analysis.polynomials.PolynomialFunctionNewtonForm 530 { "array sizes should have difference 1 ({0} != {1} + 1)", 531 "les tableaux devraient avoir une diff\u00e9rence de taille de 1 ({0} != {1} + 1)" }, 532 533 // org.apache.commons.math.analysis.polynomials.PolynomialFunctionLagrangeForm 534 { "identical abscissas x[{0}] == x[{1}] == {2} cause division by zero", 535 "division par z\u00e9ro caus\u00e9e par les abscisses identiques x[{0}] == x[{1}] == {2}" }, 536 537 // org.apache.commons.math.analysis.polynomials.PolynomialSplineFunction 538 { "spline partition must have at least {0} points, got {1}", 539 "une partiction spline n\u00e9cessite au moins {0} points, seuls {1} ont \u00e9t\u00e9 fournis" }, 540 { "knot values must be strictly increasing", 541 "les n\u0153uds d''interpolation doivent \u00eatre strictement croissants" }, 542 { "number of polynomial interpolants must match the number of segments ({0} != {1} - 1)", 543 "le nombre d''interpolants polyn\u00f4miaux doit correspondre au nombre de segments ({0} != {1} - 1)" }, 544 545 // org.apache.commons.math.analysis.solvers.UnivariateRealSolverImpl 546 { "function to solve cannot be null", 547 "la fonction \u00e0 r\u00e9soudre ne peux pas \u00eatre nulle" }, 548 { "invalid interval, initial value parameters: lower={0}, initial={1}, upper={2}", 549 "param\u00e8tres de l''intervalle initial invalides : borne inf = {0}, valeur initiale = {1}, borne sup = {2}" }, 550 551 // org.apache.commons.math.analysis.solvers.UnivariateRealSolverImpl 552 // org.apache.commons.math.analysis.solvers.BrentSolver 553 { "function values at endpoints do not have different signs. Endpoints: [{0}, {1}], Values: [{2}, {3}]", 554 "les valeurs de la fonction aux bornes n''ont pas des signes diff\u00e9rents. Bornes : [{0}, {1}], valeurs : [{2}, {3}]" }, 555 556 // org.apache.commons.math.analysis.solvers.UnivariateRealSolverImpl 557 // org.apache.commons.math.analysis.integration.UnivariateRealIntegratorImpl 558 // org.apache.commons.math.transform.FastFourierTransformer 559 { "endpoints do not specify an interval: [{0}, {1}]", 560 "les extr\u00e9mit\u00e9s ne constituent pas un intervalle : [{0}, {1}]" }, 561 562 // org.apache.commons.math.analysis.solvers.LaguerreSolver 563 { "function is not polynomial", 564 "la fonction n''est pas p\u00f4lynomiale" }, 565 566 // org.apache.commons.math.analysis.solvers.NewtonSolver 567 { "function is not differentiable", 568 "la fonction n''est pas diff\u00e9rentiable" }, 569 570 // org.apache.commons.math.analysis.integration.UnivariateRealIntegratorImpl 571 { "invalid iteration limits: min={0}, max={1}", 572 "limites d''it\u00e9rations invalides : min = {0}, max = {1}" }, 573 574 // org.apache.commons.math.analysis.integration.LegendreGaussIntegrator 575 { "{0} points Legendre-Gauss integrator not supported," + 576 " number of points must be in the {1}-{2} range", 577 "int\u00e9grateur de Legendre-Gauss non support\u00e9 en {0} points, " + 578 "le nombre de points doit \u00eatre entre {1} et {2}" }, 579 580 // org.apache.commons.math.fraction.Fraction 581 { "zero denominator in fraction {0}/{1}", 582 "d\u00e9nominateur null dans le nombre rationnel {0}/{1}" }, 583 { "overflow in fraction {0}/{1}, cannot negate", 584 "d\u00e9passement de capacit\u00e9 pour la fraction {0}/{1}, son signe ne peut \u00eatre chang\u00e9" }, 585 { "overflow, numerator too large after multiply: {0}", 586 "d\u00e9passement de capacit\u00e9 pour le num\u00e9rateur apr\u00e8s multiplication : {0}" }, 587 { "the fraction to divide by must not be zero: {0}/{1}", 588 "division par un nombre rationnel nul : {0}/{1}" }, 589 { "null fraction", 590 "fraction nulle" }, 591 592 // org.apache.commons.math.geometry.Rotation 593 { "zero norm for rotation axis", 594 "norme nulle pour un axe de rotation" }, 595 { "zero norm for rotation defining vector", 596 "norme nulle pour un axe de d\u00e9finition de rotation" }, 597 598 // org.apache.commons.math.geometry.Vector3D 599 // org.apache.commons.math.linear.ArrayRealVector 600 { "cannot normalize a zero norm vector", 601 "impossible de normer un vecteur de norme nulle" }, 602 { "zero norm", 603 "norme nulle" }, 604 605 // org.apache.commons.math.ConvergingAlgorithmImpl 606 { "no result available", 607 "aucun r\u00e9sultat n''est disponible" }, 608 609 // org.apache.commons.math.linear.BigMatrixImpl 610 { "first {0} rows are not initialized yet", 611 "les {0} premi\u00e8res lignes ne sont pas encore initialis\u00e9es" }, 612 { "first {0} columns are not initialized yet", 613 "les {0} premi\u00e8res colonnes ne sont pas encore initialis\u00e9es" }, 614 615 // org.apache.commons.math.stat.Frequency 616 { "class ({0}) does not implement Comparable", 617 "la classe ({0}) n''implante pas l''interface Comparable" }, 618 { "instance of class {0} not comparable to existing values", 619 "l''instance de la classe {0} n''est pas comparable aux valeurs existantes" }, 620 621 // org.apache.commons.math.stat.StatUtils 622 { "input arrays must have the same positive length ({0} and {1})", 623 "les tableaux d''entr\u00e9e doivent avoir la m\u00eame taille positive ({0} et {1})" }, 624 { "input arrays must have the same length and at least two elements ({0} and {1})", 625 "les tableaux d''entr\u00e9e doivent avoir la m\u00eame taille" + 626 " et au moins deux \u00e9l\u00e9ments ({0} et {1})" }, 627 628 // org.apache.commons.math.stat.correlation.Covariance 629 { "arrays must have the same length and both must have at " + 630 "least two elements. xArray has size {0}, yArray has {1} elements", 631 "les tableaux doivent avoir la m\u00eame taille " + 632 "et comporter au moins deux \u00e9l\u00e9ments. " + 633 "xArray a une taille de {0}, yArray a {1} \u00e9l\u00e9ments"}, 634 { "insufficient data: only {0} rows and {1} columns.", 635 "donn\u00e9es insuffisantes : seulement {0} lignes et {1} colonnes." }, 636 637 // org.apache.commons.math.stat.correlation.PearsonsCorrelation 638 { "covariance matrix is null", 639 "la matrice de covariance est nulle" }, 640 { "invalid array dimensions. xArray has size {0}; yArray has {1} elements", 641 "dimensions de tableaux invalides. xArray a une taille de {0}, " + 642 "yArray a {1} \u00e9l\u00e9ments" }, 643 644 // org.apache.commons.math.stat.descriptive.DescriptiveStatistics 645 { "window size must be positive ({0})", 646 "la taille de la fen\u00eatre doit \u00eatre positive ({0})" }, 647 { "percentile implementation {0} does not support setQuantile", 648 "l''implantation de pourcentage {0} ne dispose pas de la m\u00e9thode setQuantile" }, 649 { "cannot access setQuantile method in percentile implementation {0}", 650 "acc\u00e8s impossible \u00e0 la m\u00e9thode setQuantile" + 651 " dans l''implantation de pourcentage {0}" }, 652 { "out of bounds quantile value: {0}, must be in (0, 100]", 653 "valeur de quantile {0} hors bornes, doit \u00eatre dans l''intervalle ]0, 100]" }, 654 655 // org.apache.commons.math.stat.descriptive.moment.Variance 656 // org.apache.commons.math.stat.descriptive.AbstractStorelessUnivariateStatistic 657 // org.apache.commons.math.stat.descriptive.AbstractUnivariateStatistic 658 { "input values array is null", 659 "le tableau des valeurs d''entr\u00e9es est nul" }, 660 661 // org.apache.commons.math.stat.descriptive.AbstractUnivariateStatistic 662 { "start position cannot be negative ({0})", 663 "la position de d\u00e9part ne peut pas \u00eatre n\u00e9gative" }, 664 { "length cannot be negative ({0})", 665 "la longueur ne peut pas \u00eatre n\u00e9gative" }, 666 { "subarray ends after array end", 667 "le sous-tableau se termine apr\u00e8s la fin du tableau" }, 668 669 // org.apache.commons.math.stat.descriptive.moment.GeometricMean 670 // org.apache.commons.math.stat.descriptive.MultivariateSummaryStatistics 671 // org.apache.commons.math.stat.descriptive.SummaryStatistics 672 { "{0} values have been added before statistic is configured", 673 "{0} valeurs ont \u00e9t\u00e9 ajout\u00e9es " + 674 "avant que la statistique ne soit configur\u00e9e" }, 675 676 // org.apache.commons.math.stat.descriptive.moment.Kurtosis 677 { "statistics constructed from external moments cannot be incremented", 678 "les statistiques bas\u00e9es sur des moments externes " + 679 "ne peuvent pas \u00eatre incr\u00e9ment\u00e9es" }, 680 { "statistics constructed from external moments cannot be cleared", 681 "les statistiques bas\u00e9es sur des moments externes " + 682 "ne peuvent pas \u00eatre remises \u00e0 z\u00e9ro" }, 683 684 // org.apache.commons.math.stat.inference.ChiSquareTestImpl 685 { "expected array length = {0}, must be at least 2", 686 "le tableau des valeurs attendues a une longueur de {0}, elle devrait \u00eatre au moins de 2" }, 687 { "observed array length = {0}, must be at least 2", 688 "le tableau des valeurs observ\u00e9es a une longueur de {0}, elle devrait \u00eatre au moins de 2" }, 689 { "observed counts are all 0 in first observed array", 690 "aucune occurrence dans le premier tableau des observations" }, 691 { "observed counts are all 0 in second observed array", 692 "aucune occurrence dans le second tableau des observations" }, 693 { "observed counts are both zero for entry {0}", 694 "les occurrences observ\u00e9es sont toutes deux nulles pour l'entr\u00e9e {0}" }, 695 { "invalid row dimension: {0} (must be at least 2)", 696 "nombre de lignes invalide : {0} (doit \u00eatre au moins de 2)" }, 697 { "invalid column dimension: {0} (must be at least 2)", 698 "nombre de colonnes invalide : {0} (doit \u00eatre au moins de 2)" }, 699 { "element {0} is not positive: {1}", 700 "l''\u00e9l\u00e9ment {0} n''est pas positif : {1}" }, 701 { "element {0} is negative: {1}", 702 "l''\u00e9l\u00e9ment {0} est n\u00e9gatif : {1}" }, 703 { "element ({0}, {1}) is negative: {2}", 704 "l''\u00e9l\u00e9ment ({0}, {1}) est n\u00e9gatif : {2}" }, 705 706 // org.apache.commons.math.stat.inference.OneWayAnovaImpl 707 { "two or more categories required, got {0}", 708 "deux cat\u00e9gories ou plus sont n\u00e9cessaires, il y en a {0}" }, 709 { "two or more values required in each category, one has {0}", 710 "deux valeurs ou plus sont n\u00e9cessaires pour chaque cat\u00e9gorie, une cat\u00e9gorie en a {0}" }, 711 712 // org.apache.commons.math.stat.inference.TTestImpl 713 { "insufficient data for t statistic, needs at least 2, got {0}", 714 "deux valeurs ou plus sont n\u00e9cessaires pour la statistique t, il y en a {0}" }, 715 716 // org.apache.commons.math.stat.inference.ChiSquareTestImpl 717 // org.apache.commons.math.stat.inference.TTestImpl 718 // org.apache.commons.math.stat.inference.OneWayAnovaImpl 719 // org.apache.commons.math.stat.Regression 720 { "out of bounds significance level {0}, must be between {1} and {2}", 721 "niveau de signification {0} hors domaine, doit \u00eatre entre {1} et {2}" }, 722 723 // org.apache.commons.math.stat.regression.OLSMultipleLinearRegression 724 { "matrix is not upper-triangular, entry ({0}, {1}) = {2} is too large", 725 "matrice non triangulaire sup\u00e9rieure, l''\u00e9l\u00e9ment ({0}, {1}) = {2} est trop grand" }, 726 727 // org.apache.commons.math.stat.regression.AbstractMultipleLinearRegression 728 { "not enough data ({0} rows) for this many predictors ({1} predictors)", 729 "pas assez de donn\u00e9es ({0} lignes) pour {1} pr\u00e9dicteurs" }, 730 731 // org.apache.commons.math.distribution.AbstractContinuousDistribution 732 // org.apache.commons.math.distribution.AbstractIntegerDistribution 733 // org.apache.commons.math.distribution.ExponentialDistributionImpl 734 // org.apache.commons.math.distribution.BinomialDistributionImpl 735 // org.apache.commons.math.distribution.CauchyDistributionImpl 736 // org.apache.commons.math.distribution.PascalDistributionImpl 737 // org.apache.commons.math.distribution.WeibullDistributionImpl 738 { "{0} out of [{1}, {2}] range", 739 "{0} hors du domaine [{1}, {2}]" }, 740 741 // org.apache.commons.math.distribution.AbstractDistribution 742 // org.apache.commons.math.distribution.AbstractIntegerDistribution 743 { "lower endpoint ({0}) must be less than or equal to upper endpoint ({1})", 744 "la borne inf\u00e9rieure ({0}) devrait \u00eatre inf\u00e9rieure " + 745 "ou \u00e9gale \u00e0 la borne sup\u00e9rieure ({1})" }, 746 747 // org.apache.commons.math.distribution.BinomialDistributionImpl 748 { "number of trials must be non-negative ({0})", 749 "le nombre d''essais ne doit pas \u00eatre n\u00e9gatif ({0})" }, 750 751 // org.apache.commons.math.distribution.ExponentialDistributionImpl 752 // org.apache.commons.math.random.RandomDataImpl 753 { "mean must be positive ({0})", 754 "la moyenne doit \u00eatre positive ({0})" }, 755 756 // org.apache.commons.math.distribution.FDistributionImpl 757 // org.apache.commons.math.distribution.TDistributionImpl 758 { "degrees of freedom must be positive ({0})", 759 "les degr\u00e9s de libert\u00e9 doivent \u00eatre positifs ({0})" }, 760 761 // org.apache.commons.math.distribution.GammaDistributionImpl 762 { "alpha must be positive ({0})", 763 "alpha doit \u00eatre positif ({0})" }, 764 { "beta must be positive ({0})", 765 "beta doit \u00eatre positif ({0})" }, 766 767 // org.apache.commons.math.distribution.HypergeometricDistributionImpl 768 { "number of successes ({0}) must be less than or equal to population size ({1})", 769 "le nombre de succ\u00e8s doit \u00eatre inf\u00e9rieur " + 770 "ou \u00e9gal \u00e0 la taille de la population ({1})" }, 771 { "sample size ({0}) must be less than or equal to population size ({1})", 772 "la taille de l''\u00e9chantillon doit \u00eatre inf\u00e9rieure " + 773 "ou \u00e9gale \u00e0 la taille de la population ({1})" }, 774 { "population size must be positive ({0})", 775 "la taille de la population doit \u00eatre positive ({0})" }, 776 777 // org.apache.commons.math.distribution.HypergeometricDistributionImpl 778 // org.apache.commons.math.random.RandomDataImpl 779 { "sample size must be positive ({0})", 780 "la taille de l''\u00e9chantillon doit \u00eatre positive ({0})" }, 781 782 // org.apache.commons.math.distribution.HypergeometricDistributionImpl 783 // org.apache.commons.math.distribution.PascalDistributionImpl 784 { "number of successes must be non-negative ({0})", 785 "le nombre de succ\u00e8s ne doit pas \u00eatre n\u00e9gatif ({0})" }, 786 787 // org.apache.commons.math.distribution.NormalDistributionImpl 788 // org.apache.commons.math.random.RandomDataImpl 789 { "standard deviation must be positive ({0})", 790 "l''\u00e9cart type doit \u00eatre positif ({0})" }, 791 792 // org.apache.commons.math.distribution.PoissonDistributionImpl 793 // org.apache.commons.math.random.RandomDataImpl 794 { "the Poisson mean must be positive ({0})", 795 "la moyenne de Poisson doit \u00eatre positive ({0})" }, 796 797 // org.apache.commons.math.distribution.WeibullDistributionImpl 798 { "shape must be positive ({0})", 799 "le facteur de forme doit \u00eatre positif ({0})" }, 800 801 // org.apache.commons.math.distribution.WeibullDistributionImpl 802 // org.apache.commons.math.distribution.CauchyDistributionImpl 803 { "scale must be positive ({0})", 804 "l''\u00e9chelle doit \u00eatre positive ({0})" }, 805 806 // org.apache.commons.math.distribution.ZipfDistributionImpl 807 { "invalid number of elements {0} (must be positive)", 808 "nombre d''\u00e9l\u00e9ments {0} invalide (doit \u00eatre positif)" }, 809 { "invalid exponent {0} (must be positive)", 810 "exposant {0} invalide (doit \u00eatre positif)" }, 811 812 // org.apache.commons.math.transform.FastHadamardTransformer 813 { "{0} is not a power of 2", 814 "{0} n''est pas une puissance de 2" }, 815 816 // org.apache.commons.math.transform.FastFourierTransformer 817 { "cannot compute 0-th root of unity, indefinite result", 818 "impossible de calculer la racine z\u00e9roi\u00e8me de l''unit\u00e9, " + 819 "r\u00e9sultat ind\u00e9fini" }, 820 { "roots of unity have not been computed yet", 821 "les racines de l''unit\u00e9 n''ont pas encore \u00e9t\u00e9 calcul\u00e9es" }, 822 { "out of range root of unity index {0} (must be in [{1};{2}])", 823 "index de racine de l''unit\u00e9 hors domaine (devrait \u00eatre dans [{1}; {2}])" }, 824 { "number of sample is not positive: {0}", 825 "le nombre d''\u00e9chantillons n''est pas positif : {0}" }, 826 { "{0} is not a power of 2, consider padding for fix", 827 "{0} n''est pas une puissance de 2, ajoutez des \u00e9l\u00e9ments pour corriger" }, 828 { "some dimensions don't match: {0} != {1}", 829 "certaines dimensions sont incoh\u00e9rentes : {0} != {1}" }, 830 831 // org.apache.commons.math.transform.FastCosineTransformer 832 { "{0} is not a power of 2 plus one", 833 "{0} n''est pas une puissance de 2 plus un" }, 834 835 // org.apache.commons.math.transform.FastSineTransformer 836 { "first element is not 0: {0}", 837 "le premier \u00e9l\u00e9ment n''est pas nul : {0}" }, 838 839 // org.apache.commons.math.util.OpenIntToDoubleHashMap 840 { "map has been modified while iterating", 841 "la table d''adressage a \u00e9t\u00e9 modifi\u00e9e pendant l''it\u00e9ration" }, 842 { "iterator exhausted", 843 "it\u00e9ration achev\u00e9e" }, 844 845 // org.apache.commons.math.MathRuntimeException 846 { "internal error, please fill a bug report at {0}", 847 "erreur interne, veuillez signaler l''erreur \u00e0 {0}" } 848 849 }; 850 851 }