Done: library/bisect. #83
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
entwanne
requested changes
Nov 15, 2017
library/bisect.po
Outdated
| "trier à chaque insertion. Il pourrait être plus rapide que l'approche " | ||
| "classique pour de longues listes d'éléments dont les opérations de " | ||
| "comparaison sont lourdes. Le module se nomme :mod:`bisect` car il utilise " | ||
| "une approche simple par bisection. Si vous voulez un exemple de cet " |
There was a problem hiding this comment.
« bissection » en français, non ?
library/bisect.po
Outdated
| "comparaison sont lourdes. Le module se nomme :mod:`bisect` car il utilise " | ||
| "une approche simple par bisection. Si vous voulez un exemple de cet " | ||
| "algorithme, le mieux est d'aller lire le code source de ce module (les " | ||
| "conditions sur les limites y étant justes!)." |
There was a problem hiding this comment.
J'ajouterais une petite espace insécable avant le point d'exclamation 😉
There was a problem hiding this comment.
Et un espace insécable, un !
library/bisect.po
Outdated
|
|
||
| #: ../Doc/library/bisect.rst:33 | ||
| msgid "" | ||
| "The returned insertion point *i* partitions the array *a* into two halves so " | ||
| "that ``all(val < x for val in a[lo:i])`` for the left side and ``all(val >= " | ||
| "x for val in a[i:hi])`` for the right side." | ||
| msgstr "" | ||
| "Le point d'insertion renvoyé, *i*, coupe la liste *a* en deux moitiés tel " |
library/bisect.po
Outdated
|
|
||
| #: ../Doc/library/bisect.rst:43 | ||
| msgid "" | ||
| "The returned insertion point *i* partitions the array *a* into two halves so " | ||
| "that ``all(val <= x for val in a[lo:i])`` for the left side and ``all(val > " | ||
| "x for val in a[i:hi])`` for the right side." | ||
| msgstr "" | ||
| "Le point d'insertion renvoyé, *i*, coupe la liste *a* en deux moitiés tel " |
library/bisect.po
Outdated
| @@ -92,6 +119,11 @@ msgid "" | |||
| "The keys are precomputed to save unnecessary calls to the key function " | |||
| "during searches." | |||
| msgstr "" | |||
| "`SortedCollection recipe <https://code.activestate.com/recipes/577197-" | |||
| "sortedcollection/>`_ utilise le module *bisect* pour construire une class " | |||
library/bisect.po
Outdated
| "sortedcollection/>`_ utilise le module *bisect* pour construire une class " | ||
| "collection exposant des méthodes de recherches naturelles et gèrant une " | ||
| "fonctions clef. Les clefs sont précalculées pour économiser des appels " | ||
| "innutils à la fonction clef durant les recherches." |
library/bisect.po
Outdated
| @@ -104,6 +136,10 @@ msgid "" | |||
| "following five functions show how to transform them into the standard " | |||
| "lookups for sorted lists::" | |||
| msgstr "" | |||
| "Les fonctions :func:`bisect` ci-dessus sont utiles insérer des éléments, " | |||
There was a problem hiding this comment.
Il manque un « pour » devant « insérer »
library/bisect.po
Outdated
| @@ -124,9 +165,16 @@ msgid "" | |||
| "lead to an inefficient design (successive calls to bisect functions would " | |||
| "not \"remember\" all of the previous key lookups)." | |||
| msgstr "" | |||
| "Contrairement à la fonction :func:`sorted`, ça n'aurait pas de sens pour la " | |||
| "fonction :func:`bisect` d'avoir un paramètre *key* ou *reversed*, qui " | |||
| "conduiraient à une utilisation innefficace (des appels successifs à la " | |||
There was a problem hiding this comment.
innefficace → inefficace
library/bisect.po
Outdated
| "fonction :func:`bisect` d'avoir un paramètre *key* ou *reversed*, qui " | ||
| "conduiraient à une utilisation innefficace (des appels successifs à la " | ||
| "fonction *bisect* n'auraient aucun moyen de se \"souvenir\" des recherches " | ||
| "de clef précédetes)." |
There was a problem hiding this comment.
précédetes → précédentes
library/bisect.po
Outdated
|
|
||
| #: ../Doc/library/bisect.rst:135 | ||
| msgid "" | ||
| "Instead, it is better to search a list of precomputed keys to find the index " | ||
| "of the record in question::" | ||
| msgstr "" | ||
| "Il est préférable d'utiliser une liste de clef précalculée pour chercher " |
entwanne
approved these changes
Nov 22, 2017
JulienPalard
pushed a commit
that referenced
this pull request
Mar 20, 2023
Co-authored-by: nicolastala <contact@nicolastala.fr> Reviewed-on: https://git.afpy.org/AFPy/python-docs-fr/pulls/87 Co-authored-by: nicolas talabardon <contact@nicolastala.fr> Co-committed-by: nicolas talabardon <contact@nicolastala.fr>
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
No description provided.