Working on library.po:stdtypes.rst

JulienPalard · JulienPalard · commit 6fa8ad2e6a47 · 2016-07-27T00:15:40.000+02:00
diff --git a/library.po b/library.po
@@ -107608,44 +107608,39 @@ msgstr ""
 
 #: ../Doc/library/stdtypes.rst:367
 msgid ":func:`math.trunc(\\ x) <math.trunc>`"
-msgstr ""
+msgstr ":func:`math.trunc(\\ x) <math.trunc>`"
 
 #: ../Doc/library/stdtypes.rst:367
-#, fuzzy
 msgid "*x* truncated to :class:`~numbers.Integral`"
 msgstr "*x* tronqué à l'entier vers zéro"
 
 #: ../Doc/library/stdtypes.rst:370
-#, fuzzy
 msgid ":func:`round(x[, n]) <round>`"
-msgstr "``round(x[, n])``"
+msgstr ":func:`round(x[, n]) <round>`"
 
 #: ../Doc/library/stdtypes.rst:370
-#, fuzzy
 msgid ""
 "*x* rounded to *n* digits, rounding half to even. If *n* is omitted, it "
 "defaults to 0."
 msgstr ""
-"*x* arrondi à n chiffres, arrondissant la moitié au pair. Si n est omis, la "
-"valeur par défaut à 0."
+"*x* arrondi à *n* chiffres, arrondissant la moitié au pair. Si *n* est omis, "
+"la valeur par défaut à 0."
 
 #: ../Doc/library/stdtypes.rst:374
 msgid ":func:`math.floor(\\ x) <math.floor>`"
-msgstr ""
+msgstr ":func:`math.floor(\\ x) <math.floor>`"
 
 #: ../Doc/library/stdtypes.rst:374
-#, fuzzy
 msgid "the greatest :class:`~numbers.Integral` <= *x*"
-msgstr "le plus grand entier <= *x*"
+msgstr "le plus grand :class:`~numbers.Integral` <= *x*"
 
 #: ../Doc/library/stdtypes.rst:377
 msgid ":func:`math.ceil(x) <math.ceil>`"
-msgstr ""
+msgstr ":func:`math.ceil(x) <math.ceil>`"
 
 #: ../Doc/library/stdtypes.rst:377
-#, fuzzy
 msgid "the least :class:`~numbers.Integral` >= *x*"
-msgstr "le plus petit entier >= *x*"
+msgstr "le plus petit :class:`~numbers.Integral` >= *x*"
 
 #: ../Doc/library/stdtypes.rst:381
 msgid ""
@@ -107660,7 +107655,6 @@ msgid "Bitwise Operations on Integer Types"
 msgstr "Opérations sur les bits des nombres entiers"
 
 #: ../Doc/library/stdtypes.rst:402
-#, fuzzy
 msgid ""
 "Bitwise operations only make sense for integers.  Negative numbers are "
 "treated as their 2's complement value (this assumes that there are enough "
