forked from AFPy/python-docs-fr
264 lines
11 KiB
Plaintext
264 lines
11 KiB
Plaintext
# SOME DESCRIPTIVE TITLE.
|
||
# Copyright (C) 2001-2016, Python Software Foundation
|
||
# This file is distributed under the same license as the Python package.
|
||
# FIRST AUTHOR <EMAIL@ADDRESS>, YEAR.
|
||
#
|
||
#, fuzzy
|
||
msgid ""
|
||
msgstr ""
|
||
"Project-Id-Version: Python 3.6\n"
|
||
"Report-Msgid-Bugs-To: \n"
|
||
"POT-Creation-Date: 2017-08-10 00:49+0200\n"
|
||
"PO-Revision-Date: 2018-01-21 23:30+0100\n"
|
||
"Last-Translator: FULL NAME <EMAIL@ADDRESS>\n"
|
||
"Language-Team: LANGUAGE <LL@li.org>\n"
|
||
"Language: fr\n"
|
||
"MIME-Version: 1.0\n"
|
||
"Content-Type: text/plain; charset=UTF-8\n"
|
||
"Content-Transfer-Encoding: 8bit\n"
|
||
|
||
#: ../Doc/library/queue.rst:2
|
||
msgid ":mod:`queue` --- A synchronized queue class"
|
||
msgstr ":mod:`queue` --- File synchronisée"
|
||
|
||
#: ../Doc/library/queue.rst:7
|
||
msgid "**Source code:** :source:`Lib/queue.py`"
|
||
msgstr "**Code source :** :source:`Lib/queue.py`"
|
||
|
||
#: ../Doc/library/queue.rst:11
|
||
msgid ""
|
||
"The :mod:`queue` module implements multi-producer, multi-consumer queues. It "
|
||
"is especially useful in threaded programming when information must be "
|
||
"exchanged safely between multiple threads. The :class:`Queue` class in this "
|
||
"module implements all the required locking semantics. It depends on the "
|
||
"availability of thread support in Python; see the :mod:`threading` module."
|
||
msgstr ""
|
||
"Le module :mod:`queue` implémente des files multi-productrices et multi-"
|
||
"consommatrices. C'est particulièrement utile en programmation *multi-"
|
||
"thread*, lorsque les informations doivent être échangées sans risques entre "
|
||
"plusieurs *threads*. La classe :class:`Queue` de ce module implémente tout "
|
||
"le vérouillage nécessaire. Cela dépend de la disponibilité du support des "
|
||
"threads en Python; voir le module :mod:`threading`."
|
||
|
||
#: ../Doc/library/queue.rst:18
|
||
msgid ""
|
||
"The module implements three types of queue, which differ only in the order "
|
||
"in which the entries are retrieved. In a :abbr:`FIFO (first-in, first-out)` "
|
||
"queue, the first tasks added are the first retrieved. In a :abbr:`LIFO (last-"
|
||
"in, first-out)` queue, the most recently added entry is the first retrieved "
|
||
"(operating like a stack). With a priority queue, the entries are kept "
|
||
"sorted (using the :mod:`heapq` module) and the lowest valued entry is "
|
||
"retrieved first."
|
||
msgstr ""
|
||
"Le module implémente trois types de files qui différent par l'ordre dans "
|
||
"lequel les éléments en sont extraits. Dans une file :abbr:`FIFO (first-in, "
|
||
"first-out)`, les premièrs éléments ajoutés sont les premiers extraits. Dans "
|
||
"une file :abbr:`LIFO (last-in, first-out)`, le dernier élément ajouté est le "
|
||
"premier élément extrait (se comporte comme une pile). Avec une file de "
|
||
"priorité, les entrées restent triés (en utilisant le module :mod:`heapq`) "
|
||
"et l'élément ayant la valeur la plus faible est extrait en premier."
|
||
|
||
#: ../Doc/library/queue.rst:26
|
||
msgid ""
|
||
"Internally, the module uses locks to temporarily block competing threads; "
|
||
"however, it is not designed to handle reentrancy within a thread."
|
||
msgstr ""
|
||
"En interne, le module utilise des verrous pour bloquer temporairement des "
|
||
"fils d'exécution concurrents. Cependant, il n'a pas été conçu pour être "
|
||
"réentrant au sein d'un fil d'exécution."
|
||
|
||
#: ../Doc/library/queue.rst:29
|
||
msgid "The :mod:`queue` module defines the following classes and exceptions:"
|
||
msgstr ""
|
||
"Le module :mod:`queue` définit les classes et les exceptions suivantes :"
|
||
|
||
#: ../Doc/library/queue.rst:33
|
||
msgid ""
|
||
"Constructor for a :abbr:`FIFO (first-in, first-out)` queue. *maxsize* is an "
|
||
"integer that sets the upperbound limit on the number of items that can be "
|
||
"placed in the queue. Insertion will block once this size has been reached, "
|
||
"until queue items are consumed. If *maxsize* is less than or equal to zero, "
|
||
"the queue size is infinite."
|
||
msgstr ""
|
||
"Constructeur pour une file :abbr:`FIFO (first-in, first-out)`. *maxsize* est "
|
||
"un entier définissant le nombre maximal d'éléments pouvant être mis dans la "
|
||
"file. L'insertion sera bloquée lorsque cette borne supérieure sera atteinte, "
|
||
"jusqu'à ce que des éléments de la file soient consommés. Si *maxsize* est "
|
||
"inférieur ou égal à 0, la taille de la file sera infinie."
|
||
|
||
#: ../Doc/library/queue.rst:41
|
||
msgid ""
|
||
"Constructor for a :abbr:`LIFO (last-in, first-out)` queue. *maxsize* is an "
|
||
"integer that sets the upperbound limit on the number of items that can be "
|
||
"placed in the queue. Insertion will block once this size has been reached, "
|
||
"until queue items are consumed. If *maxsize* is less than or equal to zero, "
|
||
"the queue size is infinite."
|
||
msgstr ""
|
||
"Constructeur pour une file :abbr:`LIFO (last-in, first-out)`. *maxsize* est "
|
||
"un entier définissant le nombre maximal d'éléments pouvant être mis dans la "
|
||
"file. L'insertion sera bloquée lorsque cette borne supérieure sera atteinte, "
|
||
"jusqu'à ce que des éléments de la file soient consommés. Si *maxsize* est "
|
||
"inférieur ou égal à 0, la taille de la file sera infinie."
|
||
|
||
#: ../Doc/library/queue.rst:50
|
||
msgid ""
|
||
"Constructor for a priority queue. *maxsize* is an integer that sets the "
|
||
"upperbound limit on the number of items that can be placed in the queue. "
|
||
"Insertion will block once this size has been reached, until queue items are "
|
||
"consumed. If *maxsize* is less than or equal to zero, the queue size is "
|
||
"infinite."
|
||
msgstr ""
|
||
"Constructeur pour une file de priorité. *maxsize* est un entier définissant "
|
||
"le nombre maximal d'éléments pouvant être mis dans la file. L'insertion sera "
|
||
"bloquée lorsque cette borne supérieure sera atteinte, jusqu'à ce que des "
|
||
"éléments soient consommés. Si *maxsize* est inférieur ou égal à 0, la taille "
|
||
"de la file sera infinie."
|
||
|
||
#: ../Doc/library/queue.rst:55
|
||
msgid ""
|
||
"The lowest valued entries are retrieved first (the lowest valued entry is "
|
||
"the one returned by ``sorted(list(entries))[0]``). A typical pattern for "
|
||
"entries is a tuple in the form: ``(priority_number, data)``."
|
||
msgstr ""
|
||
"Les éléments de valeurs les plus faibles sont extraits en premier (l'élément "
|
||
"de valeur la plus faible est celui renvoyé par ``sorted(list(entries))"
|
||
"[0]``). Un cas typique est d'utiliser des tuple de la forme : "
|
||
"``(priority_number, data)``."
|
||
|
||
#: ../Doc/library/queue.rst:62
|
||
msgid ""
|
||
"Exception raised when non-blocking :meth:`~Queue.get` (or :meth:`~Queue."
|
||
"get_nowait`) is called on a :class:`Queue` object which is empty."
|
||
msgstr ""
|
||
"Exception levée lorsque la méthode non bloquante :meth:`~Queue.get` (ou :"
|
||
"meth:`~Queue.get_nowait`) est appelée sur l'objet :class:`Queue` vide."
|
||
|
||
#: ../Doc/library/queue.rst:69
|
||
msgid ""
|
||
"Exception raised when non-blocking :meth:`~Queue.put` (or :meth:`~Queue."
|
||
"put_nowait`) is called on a :class:`Queue` object which is full."
|
||
msgstr ""
|
||
|
||
#: ../Doc/library/queue.rst:77
|
||
msgid "Queue Objects"
|
||
msgstr ""
|
||
|
||
#: ../Doc/library/queue.rst:79
|
||
msgid ""
|
||
"Queue objects (:class:`Queue`, :class:`LifoQueue`, or :class:"
|
||
"`PriorityQueue`) provide the public methods described below."
|
||
msgstr ""
|
||
|
||
#: ../Doc/library/queue.rst:85
|
||
msgid ""
|
||
"Return the approximate size of the queue. Note, qsize() > 0 doesn't "
|
||
"guarantee that a subsequent get() will not block, nor will qsize() < maxsize "
|
||
"guarantee that put() will not block."
|
||
msgstr ""
|
||
|
||
#: ../Doc/library/queue.rst:92
|
||
msgid ""
|
||
"Return ``True`` if the queue is empty, ``False`` otherwise. If empty() "
|
||
"returns ``True`` it doesn't guarantee that a subsequent call to put() will "
|
||
"not block. Similarly, if empty() returns ``False`` it doesn't guarantee "
|
||
"that a subsequent call to get() will not block."
|
||
msgstr ""
|
||
|
||
#: ../Doc/library/queue.rst:100
|
||
msgid ""
|
||
"Return ``True`` if the queue is full, ``False`` otherwise. If full() "
|
||
"returns ``True`` it doesn't guarantee that a subsequent call to get() will "
|
||
"not block. Similarly, if full() returns ``False`` it doesn't guarantee that "
|
||
"a subsequent call to put() will not block."
|
||
msgstr ""
|
||
|
||
#: ../Doc/library/queue.rst:108
|
||
msgid ""
|
||
"Put *item* into the queue. If optional args *block* is true and *timeout* is "
|
||
"``None`` (the default), block if necessary until a free slot is available. "
|
||
"If *timeout* is a positive number, it blocks at most *timeout* seconds and "
|
||
"raises the :exc:`Full` exception if no free slot was available within that "
|
||
"time. Otherwise (*block* is false), put an item on the queue if a free slot "
|
||
"is immediately available, else raise the :exc:`Full` exception (*timeout* is "
|
||
"ignored in that case)."
|
||
msgstr ""
|
||
|
||
#: ../Doc/library/queue.rst:119
|
||
msgid "Equivalent to ``put(item, False)``."
|
||
msgstr ""
|
||
|
||
#: ../Doc/library/queue.rst:124
|
||
msgid ""
|
||
"Remove and return an item from the queue. If optional args *block* is true "
|
||
"and *timeout* is ``None`` (the default), block if necessary until an item is "
|
||
"available. If *timeout* is a positive number, it blocks at most *timeout* "
|
||
"seconds and raises the :exc:`Empty` exception if no item was available "
|
||
"within that time. Otherwise (*block* is false), return an item if one is "
|
||
"immediately available, else raise the :exc:`Empty` exception (*timeout* is "
|
||
"ignored in that case)."
|
||
msgstr ""
|
||
|
||
#: ../Doc/library/queue.rst:134
|
||
msgid "Equivalent to ``get(False)``."
|
||
msgstr ""
|
||
|
||
#: ../Doc/library/queue.rst:136
|
||
msgid ""
|
||
"Two methods are offered to support tracking whether enqueued tasks have been "
|
||
"fully processed by daemon consumer threads."
|
||
msgstr ""
|
||
|
||
#: ../Doc/library/queue.rst:142
|
||
msgid ""
|
||
"Indicate that a formerly enqueued task is complete. Used by queue consumer "
|
||
"threads. For each :meth:`get` used to fetch a task, a subsequent call to :"
|
||
"meth:`task_done` tells the queue that the processing on the task is complete."
|
||
msgstr ""
|
||
|
||
#: ../Doc/library/queue.rst:146
|
||
msgid ""
|
||
"If a :meth:`join` is currently blocking, it will resume when all items have "
|
||
"been processed (meaning that a :meth:`task_done` call was received for every "
|
||
"item that had been :meth:`put` into the queue)."
|
||
msgstr ""
|
||
|
||
#: ../Doc/library/queue.rst:150
|
||
msgid ""
|
||
"Raises a :exc:`ValueError` if called more times than there were items placed "
|
||
"in the queue."
|
||
msgstr ""
|
||
|
||
#: ../Doc/library/queue.rst:156
|
||
msgid "Blocks until all items in the queue have been gotten and processed."
|
||
msgstr ""
|
||
|
||
#: ../Doc/library/queue.rst:158
|
||
msgid ""
|
||
"The count of unfinished tasks goes up whenever an item is added to the "
|
||
"queue. The count goes down whenever a consumer thread calls :meth:"
|
||
"`task_done` to indicate that the item was retrieved and all work on it is "
|
||
"complete. When the count of unfinished tasks drops to zero, :meth:`join` "
|
||
"unblocks."
|
||
msgstr ""
|
||
|
||
#: ../Doc/library/queue.rst:164
|
||
msgid "Example of how to wait for enqueued tasks to be completed::"
|
||
msgstr ""
|
||
|
||
#: ../Doc/library/queue.rst:198
|
||
msgid "Class :class:`multiprocessing.Queue`"
|
||
msgstr ""
|
||
|
||
#: ../Doc/library/queue.rst:197
|
||
msgid ""
|
||
"A queue class for use in a multi-processing (rather than multi-threading) "
|
||
"context."
|
||
msgstr ""
|
||
|
||
#: ../Doc/library/queue.rst:200
|
||
msgid ""
|
||
":class:`collections.deque` is an alternative implementation of unbounded "
|
||
"queues with fast atomic :meth:`~collections.deque.append` and :meth:"
|
||
"`~collections.deque.popleft` operations that do not require locking."
|
||
msgstr ""
|