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