# Copyright (C) 2001-2020, Python Software Foundation

# This file is distributed under the same license as the Python package.

# Maintained by the python-doc-es workteam.

# docs-es@python.org /

# https://mail.python.org/mailman3/lists/docs-es.python.org/

# Check https://github.com/python/python-docs-es/blob/3.8/TRANSLATORS to

# get the list of volunteers

#

msgid ""

msgstr ""

"Project-Id-Version: Python 3.8\n"

"Report-Msgid-Bugs-To: \n"

"POT-Creation-Date: 2024-11-21 16:38-0300\n"

"PO-Revision-Date: 2023-11-04 23:12+0100\n"

"Last-Translator: Marcos Medrano <marcosmedrano0@gmail.com>\n"

"Language: es\n"

"Language-Team: python-doc-es\n"

"Plural-Forms: nplurals=2; plural=(n != 1);\n"

"MIME-Version: 1.0\n"

"Content-Type: text/plain; charset=utf-8\n"

"Content-Transfer-Encoding: 8bit\n"

"Generated-By: Babel 2.16.0\n"

#: ../Doc/library/collections.rst:2

#, fuzzy

msgid ":mod:`!collections` --- Container datatypes"

msgstr ":mod:`collections` --- Tipos de datos contenedor"

#: ../Doc/library/collections.rst:10

msgid "**Source code:** :source:`Lib/collections/__init__.py`"

msgstr "**Source code:** :source:`Lib/collections/__init__.py`"

#: ../Doc/library/collections.rst:20

msgid ""

"This module implements specialized container datatypes providing "

"alternatives to Python's general purpose built-in containers, :class:"

"`dict`, :class:`list`, :class:`set`, and :class:`tuple`."

msgstr ""

"Este módulo implementa tipos de datos de contenedores especializados que "

"proporcionan alternativas a los contenedores integrados de uso general de "

"Python, :class:`dict`, :class:`list`, :class:`set`, and :class:`tuple`."

#: ../Doc/library/collections.rst:25

msgid ":func:`namedtuple`"

msgstr ":func:`namedtuple`"

#: ../Doc/library/collections.rst:25

msgid "factory function for creating tuple subclasses with named fields"

msgstr ""

"función *factory* para crear subclases de *tuplas* con campos con nombre"

#: ../Doc/library/collections.rst:26

msgid ":class:`deque`"

msgstr ":class:`deque`"

#: ../Doc/library/collections.rst:26

msgid "list-like container with fast appends and pops on either end"

msgstr ""

"contenedor similar a una lista con *appends* y *pops* rápidos en ambos "

"extremos"

#: ../Doc/library/collections.rst:27

msgid ":class:`ChainMap`"

msgstr ":class:`ChainMap`"

#: ../Doc/library/collections.rst:27

msgid "dict-like class for creating a single view of multiple mappings"

msgstr ""

"clase similar a *dict* para crear una vista única de múltiples *mapeados*"

#: ../Doc/library/collections.rst:28

msgid ":class:`Counter`"

msgstr ":class:`Counter`"

#: ../Doc/library/collections.rst:28

msgid "dict subclass for counting :term:`hashable` objects"

msgstr "subclase de *dict* para contar objetos :term:`hashable`"

#: ../Doc/library/collections.rst:29

msgid ":class:`OrderedDict`"

msgstr ":class:`OrderedDict`"

#: ../Doc/library/collections.rst:29

msgid "dict subclass that remembers the order entries were added"

msgstr ""

"subclase de *dict* que recuerda las entradas de la orden que se agregaron"

#: ../Doc/library/collections.rst:30

msgid ":class:`defaultdict`"

msgstr ":class:`defaultdict`"

#: ../Doc/library/collections.rst:30

msgid "dict subclass that calls a factory function to supply missing values"

msgstr ""

"subclase de *dict* que llama a una función de *factory* para suministrar "

"valores faltantes"

#: ../Doc/library/collections.rst:31

msgid ":class:`UserDict`"

msgstr ":class:`UserDict`"

#: ../Doc/library/collections.rst:31

msgid "wrapper around dictionary objects for easier dict subclassing"

msgstr ""

"envoltura alrededor de los objetos de diccionario para facilitar "

"subclasificaciones *dict*"

#: ../Doc/library/collections.rst:32

msgid ":class:`UserList`"

msgstr ":class:`UserList`"

#: ../Doc/library/collections.rst:32

msgid "wrapper around list objects for easier list subclassing"

msgstr ""

"envoltura alrededor de los objetos de lista para facilitar la "

"subclasificación de un *list*"

#: ../Doc/library/collections.rst:33

msgid ":class:`UserString`"

msgstr ":class:`UserString`"

#: ../Doc/library/collections.rst:33

msgid "wrapper around string objects for easier string subclassing"

msgstr ""

"envoltura alrededor de objetos de cadena para facilitar la subclasificación "

"de *string*"

#: ../Doc/library/collections.rst:38

msgid ":class:`ChainMap` objects"

msgstr "Objetos :class:`ChainMap`"

#: ../Doc/library/collections.rst:42

msgid ""

"A :class:`ChainMap` class is provided for quickly linking a number of "

"mappings so they can be treated as a single unit. It is often much faster "

"than creating a new dictionary and running multiple :meth:`~dict.update` "

"calls."

msgstr ""

"Una clase :class:`ChainMap` se proporciona para vincular rápidamente una "

"serie de *mappings* de modo que puedan tratarse como una sola unidad. Suele "

"ser mucho más rápido que crear un diccionario nuevo y ejecutar varias "

"llamadas a :meth:`~dict.update`."

#: ../Doc/library/collections.rst:46

msgid ""

"The class can be used to simulate nested scopes and is useful in templating."

msgstr ""

"La clase se puede utilizar para simular ámbitos anidados y es útil para "

"crear plantillas."

#: ../Doc/library/collections.rst:50

msgid ""

"A :class:`ChainMap` groups multiple dicts or other mappings together to "

"create a single, updateable view. If no *maps* are specified, a single "

"empty dictionary is provided so that a new chain always has at least one "

"mapping."

msgstr ""

"Un :class:`ChainMap` agrupa varios diccionarios u otros *mappings* para "

"crear una vista única y actualizable. Si no se especifican *maps*, se "

"proporciona un solo diccionario vacío para que una nueva cadena siempre "

"tenga al menos un *mapeo*."

#: ../Doc/library/collections.rst:54

msgid ""

"The underlying mappings are stored in a list. That list is public and can "

"be accessed or updated using the *maps* attribute. There is no other state."

msgstr ""

"Las asignaciones subyacentes se almacenan en una lista. Esa lista es pública "

"y se puede acceder a ella o actualizarla usando el atributo *maps*. No hay "

"otro estado."

#: ../Doc/library/collections.rst:57

msgid ""

"Lookups search the underlying mappings successively until a key is found. "

"In contrast, writes, updates, and deletions only operate on the first "

"mapping."

msgstr ""

"Las búsquedas buscan los mapeos subyacentes sucesivamente hasta que se "

"encuentra una clave. Por el contrario, las escrituras, actualizaciones y "

"eliminaciones solo operan en el primer *mapeo*."

#: ../Doc/library/collections.rst:60

msgid ""

"A :class:`ChainMap` incorporates the underlying mappings by reference. So, "

"if one of the underlying mappings gets updated, those changes will be "

"reflected in :class:`ChainMap`."

msgstr ""

"Un :class:`ChainMap` incorpora los mapeos subyacentes por referencia. "

"Entonces, si una de los mapeos subyacentes se actualiza, esos cambios se "

"reflejarán en :class:`ChainMap`."

#: ../Doc/library/collections.rst:64

msgid ""

"All of the usual dictionary methods are supported. In addition, there is a "

"*maps* attribute, a method for creating new subcontexts, and a property for "

"accessing all but the first mapping:"

msgstr ""

"Se admiten todos los métodos habituales de un diccionario. Además, hay un "

"atributo *maps*, un método para crear nuevos sub contextos y una propiedad "

"para acceder a todos menos al primer mapeo:"

#: ../Doc/library/collections.rst:70

msgid ""

"A user updateable list of mappings. The list is ordered from first-searched "

"to last-searched. It is the only stored state and can be modified to change "

"which mappings are searched. The list should always contain at least one "

"mapping."

msgstr ""

"Una lista de mapeos actualizable por el usuario. La lista está ordenada "

"desde la primera búsqueda hasta la última búsqueda. Es el único estado "

"almacenado y se puede modificar para cambiar los mapeos que se buscan. La "

"lista siempre debe contener al menos un mapeo."

#: ../Doc/library/collections.rst:77

msgid ""

"Returns a new :class:`ChainMap` containing a new map followed by all of the "

"maps in the current instance. If ``m`` is specified, it becomes the new map "

"at the front of the list of mappings; if not specified, an empty dict is "

"used, so that a call to ``d.new_child()`` is equivalent to: ``ChainMap({}, "

"*d.maps)``. If any keyword arguments are specified, they update passed map "

"or new empty dict. This method is used for creating subcontexts that can be "

"updated without altering values in any of the parent mappings."

msgstr ""

"Retorna un nuevo :class:`ChainMap` conteniendo un nuevo mapa seguido de "

"todos los mapas de la instancia actual. Si se especifica ``m``, se "

"convierte en el nuevo mapa al principio de la lista de asignaciones; si no "

"se especifica, se usa un diccionario vacío, de modo que una llamada a ``d."

"new_child()`` es equivalente a: ``ChainMap({}, *d.maps)``. Si se especifica "

"algún argumento de palabra clave, actualiza el mapa pasado o el nuevo "

"diccionario vacío. Este método se utiliza para crear sub contextos que se "

"pueden actualizar sin alterar los valores en ninguna de los mapeos padre."

#: ../Doc/library/collections.rst:86

msgid "The optional ``m`` parameter was added."

msgstr "Se agregó el parámetro opcional ``m`` ."

#: ../Doc/library/collections.rst:89

msgid "Keyword arguments support was added."

msgstr "Se añadió soporte para argumentos por palabras clave."

#: ../Doc/library/collections.rst:94

msgid ""

"Property returning a new :class:`ChainMap` containing all of the maps in the "

"current instance except the first one. This is useful for skipping the "

"first map in the search. Use cases are similar to those for the :keyword:"

"`nonlocal` keyword used in :term:`nested scopes <nested scope>`. The use "

"cases also parallel those for the built-in :func:`super` function. A "

"reference to ``d.parents`` is equivalent to: ``ChainMap(*d.maps[1:])``."

msgstr ""

"Propiedad que retorna un nuevo :class:`ChainMap` conteniendo todos los mapas "

"de la instancia actual excepto el primero. Esto es útil para omitir el "

"primer mapa en la búsqueda. Los casos de uso son similares a los de :"

"keyword:`nonlocal` la palabra clave usada en :term:`alcances anidados "

"<nested scope>`. Los casos de uso también son paralelos a los de la función "

"incorporada :func:`super`. Una referencia a ``d.parents`` es equivalente a: "

"``ChainMap(*d.maps[1:])``."

#: ../Doc/library/collections.rst:102

#, fuzzy

msgid ""

"Note, the iteration order of a :class:`ChainMap` is determined by scanning "

"the mappings last to first::"

msgstr ""

"Tenga en cuenta que el orden de iteración de a :class:`ChainMap()` se "

"determina escaneando los mapeos del último al primero::"

#: ../Doc/library/collections.rst:105

msgid ""

">>> baseline = {'music': 'bach', 'art': 'rembrandt'}\n"

">>> adjustments = {'art': 'van gogh', 'opera': 'carmen'}\n"

">>> list(ChainMap(adjustments, baseline))\n"

"['music', 'art', 'opera']"

msgstr ""

#: ../Doc/library/collections.rst:110

msgid ""

"This gives the same ordering as a series of :meth:`dict.update` calls "

"starting with the last mapping::"

msgstr ""

"Esto da el mismo orden que una serie de llamadas a :meth:`dict.update` "

"comenzando con el último mapeo::"

#: ../Doc/library/collections.rst:113

msgid ""

">>> combined = baseline.copy()\n"

">>> combined.update(adjustments)\n"

">>> list(combined)\n"

"['music', 'art', 'opera']"

msgstr ""

#: ../Doc/library/collections.rst:118

msgid "Added support for ``|`` and ``|=`` operators, specified in :pep:`584`."

msgstr ""

"Se agregó soporte para los operadores ``|`` y ``|=``, especificados en :pep:"

"`584`."

#: ../Doc/library/collections.rst:123

msgid ""

"The `MultiContext class <https://github.com/enthought/codetools/blob/4.0.0/"

"codetools/contexts/multi_context.py>`_ in the Enthought `CodeTools package "

"<https://github.com/enthought/codetools>`_ has options to support writing to "

"any mapping in the chain."

msgstr ""

"La `clase MultiContext <https://github.com/enthought/codetools/blob/4.0.0/"

"codetools/contexts/multi_context.py>`_ en el paquete de Enthought llamado "

"`CodeTools <https://github.com/enthought/codetools>`_ tiene opciones para "

"admitir la escritura en cualquier mapeo de la cadena."

#: ../Doc/library/collections.rst:129

msgid ""

"Django's `Context class <https://github.com/django/django/blob/main/django/"

"template/context.py>`_ for templating is a read-only chain of mappings. It "

"also features pushing and popping of contexts similar to the :meth:"

"`~collections.ChainMap.new_child` method and the :attr:`~collections."

"ChainMap.parents` property."

msgstr ""

"La clase de Django `Context <https://github.com/django/django/blob/master/"

"django/template/context.py>`_ para crear plantillas es una cadena de mapeo "

"de solo lectura. También presenta características de pushing y popping de "

"contextos similar al método :meth:`~collections.ChainMap.new_child` y a la "

"propiedad :attr:`~collections.ChainMap.parents` ."

#: ../Doc/library/collections.rst:136

#, fuzzy

msgid ""

"The `Nested Contexts recipe <https://code.activestate.com/recipes/577434-"

"nested-contexts-a-chain-of-mapping-objects/>`_ has options to control "

"whether writes and other mutations apply only to the first mapping or to any "

"mapping in the chain."

msgstr ""

"La `receta de Contextos Anidados <https://code.activestate.com/"

"recipes/577434/>`_ tiene opciones para controlar si las escrituras y otras "

"mutaciones se aplican solo al primer mapeo o a cualquier mapeo en la cadena."

#: ../Doc/library/collections.rst:141

msgid ""

"A `greatly simplified read-only version of Chainmap <https://code."

"activestate.com/recipes/305268/>`_."

msgstr ""

"Una `versión de solo lectura muy simplificada de Chainmap <https://code."

"activestate.com/recipes/305268/>`_."

#: ../Doc/library/collections.rst:146

msgid ":class:`ChainMap` Examples and Recipes"

msgstr "Ejemplos y recetas :class:`ChainMap`"

#: ../Doc/library/collections.rst:148

msgid "This section shows various approaches to working with chained maps."

msgstr ""

"Esta sección muestra varios enfoques para trabajar con mapas encadenados."

#: ../Doc/library/collections.rst:151

msgid "Example of simulating Python's internal lookup chain::"

msgstr "Ejemplo de simulación de la cadena de búsqueda interna de Python:"

#: ../Doc/library/collections.rst:153

msgid ""

"import builtins\n"

"pylookup = ChainMap(locals(), globals(), vars(builtins))"

msgstr ""

#: ../Doc/library/collections.rst:156

msgid ""

"Example of letting user specified command-line arguments take precedence "

"over environment variables which in turn take precedence over default "

"values::"

msgstr ""

"Ejemplo de dejar que los argumentos de la línea de comandos especificados "

"por el usuario tengan prioridad sobre las variables de entorno que, a su "

"vez, tienen prioridad sobre los valores predeterminados::"

#: ../Doc/library/collections.rst:159

msgid ""

"import os, argparse\n"

"\n"

"defaults = {'color': 'red', 'user': 'guest'}\n"

"\n"

"parser = argparse.ArgumentParser()\n"

"parser.add_argument('-u', '--user')\n"

"parser.add_argument('-c', '--color')\n"

"namespace = parser.parse_args()\n"

"command_line_args = {k: v for k, v in vars(namespace).items() if v is not "

"None}\n"

"\n"

"combined = ChainMap(command_line_args, os.environ, defaults)\n"

"print(combined['color'])\n"

"print(combined['user'])"

msgstr ""

#: ../Doc/library/collections.rst:173

msgid ""

"Example patterns for using the :class:`ChainMap` class to simulate nested "

"contexts::"

msgstr ""

"Patrones de ejemplo para usar la clase :class:`ChainMap` para simular "

"contextos anidados::"

#: ../Doc/library/collections.rst:176

msgid ""

"c = ChainMap() # Create root context\n"

"d = c.new_child() # Create nested child context\n"

"e = c.new_child() # Child of c, independent from d\n"

"e.maps[0] # Current context dictionary -- like Python's "

"locals()\n"

"e.maps[-1] # Root context -- like Python's globals()\n"

"e.parents # Enclosing context chain -- like Python's nonlocals\n"

"\n"

"d['x'] = 1 # Set value in current context\n"

"d['x'] # Get first key in the chain of contexts\n"

"del d['x'] # Delete from current context\n"

"list(d) # All nested values\n"

"k in d # Check all nested values\n"

"len(d) # Number of nested values\n"

"d.items() # All nested items\n"

"dict(d) # Flatten into a regular dictionary"

msgstr ""

#: ../Doc/library/collections.rst:192

msgid ""

"The :class:`ChainMap` class only makes updates (writes and deletions) to the "

"first mapping in the chain while lookups will search the full chain. "

"However, if deep writes and deletions are desired, it is easy to make a "

"subclass that updates keys found deeper in the chain::"

msgstr ""

"La clase :class:`ChainMap` solo realiza actualizaciones (escrituras y "

"eliminaciones) en el primer mapeo de la cadena, mientras que las búsquedas "

"buscarán en la cadena completa. Sin embargo, si se desean escrituras y "

"eliminaciones profundas, es fácil crear una subclase que actualice las "

"claves que se encuentran más profundas en la cadena::"

#: ../Doc/library/collections.rst:197

msgid ""

"class DeepChainMap(ChainMap):\n"

" 'Variant of ChainMap that allows direct updates to inner scopes'\n"

"\n"

" def __setitem__(self, key, value):\n"

" for mapping in self.maps:\n"

" if key in mapping:\n"

" mapping[key] = value\n"

" return\n"

" self.maps[0][key] = value\n"

"\n"

" def __delitem__(self, key):\n"

" for mapping in self.maps:\n"

" if key in mapping:\n"

" del mapping[key]\n"

" return\n"

" raise KeyError(key)\n"

"\n"

">>> d = DeepChainMap({'zebra': 'black'}, {'elephant': 'blue'}, {'lion': "

"'yellow'})\n"

">>> d['lion'] = 'orange' # update an existing key two levels down\n"

">>> d['snake'] = 'red' # new keys get added to the topmost dict\n"

">>> del d['elephant'] # remove an existing key one level down\n"

">>> d # display result\n"

"DeepChainMap({'zebra': 'black', 'snake': 'red'}, {}, {'lion': 'orange'})"

msgstr ""

#: ../Doc/library/collections.rst:223

msgid ":class:`Counter` objects"

msgstr "Objetos :class:`Counter`"

#: ../Doc/library/collections.rst:225

msgid ""

"A counter tool is provided to support convenient and rapid tallies. For "

"example::"

msgstr ""

"Se proporciona una herramienta de contador para respaldar recuentos rápidos "

"y convenientes. Por ejemplo::"

#: ../Doc/library/collections.rst:228

msgid ""

">>> # Tally occurrences of words in a list\n"

">>> cnt = Counter()\n"

">>> for word in ['red', 'blue', 'red', 'green', 'blue', 'blue']:\n"

"... cnt[word] += 1\n"

"...\n"

">>> cnt\n"

"Counter({'blue': 3, 'red': 2, 'green': 1})\n"

"\n"

">>> # Find the ten most common words in Hamlet\n"

">>> import re\n"

">>> words = re.findall(r'\\w+', open('hamlet.txt').read().lower())\n"

">>> Counter(words).most_common(10)\n"

"[('the', 1143), ('and', 966), ('to', 762), ('of', 669), ('i', 631),\n"

" ('you', 554), ('a', 546), ('my', 514), ('hamlet', 471), ('in', 451)]"

msgstr ""

#: ../Doc/library/collections.rst:245

msgid ""

"A :class:`Counter` is a :class:`dict` subclass for counting :term:`hashable` "

"objects. It is a collection where elements are stored as dictionary keys and "

"their counts are stored as dictionary values. Counts are allowed to be any "

"integer value including zero or negative counts. The :class:`Counter` class "

"is similar to bags or multisets in other languages."

msgstr ""

"Una clase :class:`Counter` es una subclase :class:`dict` para contar "

"objetos :term:`hashable`. Es una colección donde los elementos se almacenan "

"como claves de diccionario y sus conteos se almacenan como valores de "

"diccionario. Se permite que los conteos sean cualquier valor entero, "

"incluidos los conteos de cero o negativos. La clase :class:`Counter` es "

"similar a los *bags* o multiconjuntos en otros idiomas."

#: ../Doc/library/collections.rst:251

msgid ""

"Elements are counted from an *iterable* or initialized from another "

"*mapping* (or counter):"

msgstr ""

"Los elementos se cuentan desde un *iterable* o se inicializan desde otro "

"*mapeo* (o contador):"

#: ../Doc/library/collections.rst:259

msgid ""

"Counter objects have a dictionary interface except that they return a zero "

"count for missing items instead of raising a :exc:`KeyError`:"

msgstr ""

"Los objetos Counter tienen una interfaz de diccionario, excepto que retornan "

"un conteo de cero para los elementos faltantes en lugar de levantar una :exc:"

"`KeyError`:"

#: ../Doc/library/collections.rst:266

msgid ""

"Setting a count to zero does not remove an element from a counter. Use "

"``del`` to remove it entirely:"

msgstr ""

"Establecer un conteo en cero no elimina un elemento de un contador. Utilice "

"``del`` para eliminarlo por completo:"

#: ../Doc/library/collections.rst:274

msgid ""

"As a :class:`dict` subclass, :class:`Counter` inherited the capability to "

"remember insertion order. Math operations on *Counter* objects also "

"preserve order. Results are ordered according to when an element is first "

"encountered in the left operand and then by the order encountered in the "

"right operand."

msgstr ""

"Como subclase de :class:`dict` , :class:`Counter` heredó la capacidad de "

"recordar el orden de inserción. Las operaciones matemáticas en objetos "

"*Counter* también preservan el orden. Los resultados se ordenan en función "

"de cuándo se encuentra un elemento por primera vez en el operando izquierdo "

"y, a continuación, por el orden en que se encuentra en el operando derecho."

#: ../Doc/library/collections.rst:280

msgid ""

"Counter objects support additional methods beyond those available for all "

"dictionaries:"

msgstr ""

"Los objetos Counter admiten métodos adicionales a los disponibles para todos "

"los diccionarios:"

#: ../Doc/library/collections.rst:285

msgid ""

"Return an iterator over elements repeating each as many times as its count. "

"Elements are returned in the order first encountered. If an element's count "

"is less than one, :meth:`elements` will ignore it."

msgstr ""

"Retorna un iterador sobre los elementos que se repiten tantas veces como su "

"conteo. Los elementos se retornan en el orden en que se encontraron por "

"primera vez. Si el conteo de un elemento es menor que uno, :meth:`elements` "

"lo ignorará."

#: ../Doc/library/collections.rst:295

msgid ""

"Return a list of the *n* most common elements and their counts from the most "

"common to the least. If *n* is omitted or ``None``, :meth:`most_common` "

"returns *all* elements in the counter. Elements with equal counts are "

"ordered in the order first encountered:"

msgstr ""

"Retorna una lista de los *n* elementos mas comunes y sus conteos, del mas "

"común al menos común. Si se omite *n* o ``None``, :meth:`most_common` "

"retorna *todos* los elementos del contador. Los elementos con conteos "

"iguales se ordenan en el orden en que se encontraron por primera vez:"

#: ../Doc/library/collections.rst:305

msgid ""

"Elements are subtracted from an *iterable* or from another *mapping* (or "

"counter). Like :meth:`dict.update` but subtracts counts instead of "

"replacing them. Both inputs and outputs may be zero or negative."

msgstr ""

"Los elementos se restan de un *iterable* o de otro *mapeo* (o contador). "

"Como :meth:`dict.update` pero resta los conteos en lugar de reemplazarlos. "

"Tanto las entradas como las salidas pueden ser cero o negativas."

#: ../Doc/library/collections.rst:319

msgid "Compute the sum of the counts."

msgstr "Computa la suma de las cuentas."

#: ../Doc/library/collections.rst:327

msgid ""

"The usual dictionary methods are available for :class:`Counter` objects "

"except for two which work differently for counters."

msgstr ""

"Los métodos de diccionario habituales están disponibles para objetos :class:"

"`Counter` excepto dos que funcionan de manera diferente para los contadores."

#: ../Doc/library/collections.rst:332

msgid "This class method is not implemented for :class:`Counter` objects."

msgstr ""

"Este método de clase no está implementado para objetos :class:`Counter` ."

#: ../Doc/library/collections.rst:336

msgid ""

"Elements are counted from an *iterable* or added-in from another *mapping* "

"(or counter). Like :meth:`dict.update` but adds counts instead of replacing "

"them. Also, the *iterable* is expected to be a sequence of elements, not a "

"sequence of ``(key, value)`` pairs."

msgstr ""

"Los elementos se cuentan desde un *iterable* o agregados desde otro *mapeo* "

"(o contador). Como :meth:`dict.update` pero agrega conteos en lugar de "

"reemplazarlos. Además, se espera que el *iterable* sea una secuencia de "

"elementos, no una secuencia de parejas ``(clave, valor)`` ."

#: ../Doc/library/collections.rst:341

msgid ""

"Counters support rich comparison operators for equality, subset, and "

"superset relationships: ``==``, ``!=``, ``<``, ``<=``, ``>``, ``>=``. All of "

"those tests treat missing elements as having zero counts so that "

"``Counter(a=1) == Counter(a=1, b=0)`` returns true."

msgstr ""

"Los contadores admiten operadores de comparación ricos para las relaciones "

"de igualdad, subconjunto, y superconjunto: ``==``, ``!=``, ``<``, ``<=``, "

"``>``, ``>=``. Todas esas pruebas tratan los elementos faltantes como si "

"tuvieran cero recuentos, por lo que ``Counter(a=1) == Counter(a=1, b=0)`` "

"retorne verdadero."

#: ../Doc/library/collections.rst:346

msgid "Rich comparison operations were added."

msgstr "Se han añadido operaciones de comparación enriquecidas."

#: ../Doc/library/collections.rst:349

msgid ""

"In equality tests, missing elements are treated as having zero counts. "

"Formerly, ``Counter(a=3)`` and ``Counter(a=3, b=0)`` were considered "

"distinct."

msgstr ""

"En pruebas de igualdad, los elementos faltantes son tratados como si "

"tuvieran cero recuentos. Anteriormente, ``Counter(a=3)`` y ``Counter(a=3, "

"b=0)`` se consideraban distintos."

#: ../Doc/library/collections.rst:354

msgid "Common patterns for working with :class:`Counter` objects::"

msgstr "Patrones comunes para trabajar con objetos :class:`Counter`::"

#: ../Doc/library/collections.rst:356

msgid ""

"c.total() # total of all counts\n"

"c.clear() # reset all counts\n"

"list(c) # list unique elements\n"

"set(c) # convert to a set\n"

"dict(c) # convert to a regular dictionary\n"

"c.items() # access the (elem, cnt) pairs\n"

"Counter(dict(list_of_pairs)) # convert from a list of (elem, cnt) pairs\n"

"c.most_common()[:-n-1:-1] # n least common elements\n"

"+c # remove zero and negative counts"

msgstr ""

#: ../Doc/library/collections.rst:366

msgid ""

"Several mathematical operations are provided for combining :class:`Counter` "

"objects to produce multisets (counters that have counts greater than zero). "

"Addition and subtraction combine counters by adding or subtracting the "

"counts of corresponding elements. Intersection and union return the minimum "

"and maximum of corresponding counts. Equality and inclusion compare "

"corresponding counts. Each operation can accept inputs with signed counts, "

"but the output will exclude results with counts of zero or less."

msgstr ""

"Existen varias operaciones matemáticas que permiten combinar objetos :class:"

"`Counter` para producir conjuntos múltiples (contadores con recuentos "

"superiores a cero). La suma y la resta combinan contadores sumando o "

"restando los recuentos de los elementos correspondientes. La intersección y "

"la unión retornan el mínimo y el máximo de los recuentos correspondientes. "

"La igualdad y la inclusión comparan los recuentos correspondientes. Cada "

"operación puede aceptar entradas con recuentos con signo, pero la salida "

"excluirá los resultados con recuentos iguales o inferiores a cero."

#: ../Doc/library/collections.rst:374

msgid ""

">>> c = Counter(a=3, b=1)\n"

">>> d = Counter(a=1, b=2)\n"

">>> c + d # add two counters together: c[x] + d[x]\n"

"Counter({'a': 4, 'b': 3})\n"

">>> c - d # subtract (keeping only positive counts)\n"

"Counter({'a': 2})\n"

">>> c & d # intersection: min(c[x], d[x])\n"

"Counter({'a': 1, 'b': 1})\n"

">>> c | d # union: max(c[x], d[x])\n"

"Counter({'a': 3, 'b': 2})\n"

">>> c == d # equality: c[x] == d[x]\n"

"False\n"

">>> c <= d # inclusion: c[x] <= d[x]\n"

"False"

msgstr ""

#: ../Doc/library/collections.rst:391

msgid ""

"Unary addition and subtraction are shortcuts for adding an empty counter or "

"subtracting from an empty counter."

msgstr ""

"La suma y resta unaria son atajos para agregar un contador vacío o restar de "

"un contador vacío."

#: ../Doc/library/collections.rst:400

msgid ""

"Added support for unary plus, unary minus, and in-place multiset operations."

msgstr ""

"Se agregó soporte para operaciones unarias de adición, resta y multiconjunto "

"en su lugar (*in-place*)."

#: ../Doc/library/collections.rst:405

msgid ""

"Counters were primarily designed to work with positive integers to represent "

"running counts; however, care was taken to not unnecessarily preclude use "

"cases needing other types or negative values. To help with those use cases, "

"this section documents the minimum range and type restrictions."

msgstr ""

"Los Counters se diseñaron principalmente para trabajar con números enteros "

"positivos para representar conteos continuos; sin embargo, se tuvo cuidado "

"de no excluir innecesariamente los casos de uso que necesitan otros tipos o "

"valores negativos. Para ayudar con esos casos de uso, esta sección documenta "

"el rango mínimo y las restricciones de tipo."

#: ../Doc/library/collections.rst:410

msgid ""

"The :class:`Counter` class itself is a dictionary subclass with no "

"restrictions on its keys and values. The values are intended to be numbers "

"representing counts, but you *could* store anything in the value field."

msgstr ""

"La clase :class:`Counter` en sí misma es una subclase de diccionario sin "

"restricciones en sus claves y valores. Los valores están pensados para ser "

"números que representan conteos, pero *podría* almacenar cualquier cosa en "

"el campo de valor."

#: ../Doc/library/collections.rst:414

msgid ""

"The :meth:`~Counter.most_common` method requires only that the values be "

"orderable."

msgstr ""

"El método :meth:`~Counter.most_common` solo requiere que los valores se "

"puedan ordenar."

#: ../Doc/library/collections.rst:416

msgid ""

"For in-place operations such as ``c[key] += 1``, the value type need only "

"support addition and subtraction. So fractions, floats, and decimals would "

"work and negative values are supported. The same is also true for :meth:"

"`~Counter.update` and :meth:`~Counter.subtract` which allow negative and "

"zero values for both inputs and outputs."

msgstr ""

"Para operaciones en su lugar (*in-place*) como ``c[key] += 1``, el tipo de "

"valor solo necesita admitir la suma y la resta. Por lo tanto, las "

"fracciones, flotantes y decimales funcionarían y se admiten valores "

"negativos. Lo mismo ocurre con :meth:`~Counter.update` y :meth:`~Counter."

"subtract` que permiten valores negativos y cero para las entradas y salidas."

#: ../Doc/library/collections.rst:422

msgid ""

"The multiset methods are designed only for use cases with positive values. "

"The inputs may be negative or zero, but only outputs with positive values "

"are created. There are no type restrictions, but the value type needs to "

"support addition, subtraction, and comparison."

msgstr ""

"Los métodos de multiconjuntos están diseñados solo para casos de uso con "

"valores positivos. Las entradas pueden ser negativas o cero, pero solo se "

"crean salidas con valores positivos. No hay restricciones de tipo, pero el "

"tipo de valor debe admitir la suma, la resta y la comparación."

#: ../Doc/library/collections.rst:427

msgid ""

"The :meth:`~Counter.elements` method requires integer counts. It ignores "

"zero and negative counts."

msgstr ""

"El método :meth:`~Counter.elements` requiere conteos enteros. Ignora los "

"conteos de cero y negativos."

#: ../Doc/library/collections.rst:432

msgid ""

"`Bag class <https://www.gnu.org/software/smalltalk/manual-base/html_node/Bag."

"html>`_ in Smalltalk."

msgstr ""

"`Clase Bag <https://www.gnu.org/software/smalltalk/manual-base/html_node/Bag."

"html>`_ en Smalltalk."

#: ../Doc/library/collections.rst:435

msgid ""

"Wikipedia entry for `Multisets <https://en.wikipedia.org/wiki/Multiset>`_."

msgstr ""

"Entrada de Wikipedia para `Multiconjuntos <https://es.wikipedia.org/wiki/"

"Multiconjunto>`_."

#: ../Doc/library/collections.rst:437

msgid ""

"`C++ multisets <http://www.java2s.com/Tutorial/Cpp/0380__set-multiset/"

"Catalog0380__set-multiset.htm>`_ tutorial with examples."

msgstr ""

"Tutorial de `multiconjuntos de C++ <http://www.java2s.com/Tutorial/"

"Cpp/0380__set-multiset/Catalog0380__set-multiset.htm>`_ con ejemplos."

#: ../Doc/library/collections.rst:440

msgid ""

"For mathematical operations on multisets and their use cases, see *Knuth, "

"Donald. The Art of Computer Programming Volume II, Section 4.6.3, Exercise "

"19*."

msgstr ""

"Para operaciones matemáticas en multiconjuntos y sus casos de uso, consulte "

"*Knuth, Donald. The Art of Computer Programming Volume II, Sección 4.6.3, "

"Ejercicio 19*."

#: ../Doc/library/collections.rst:444

msgid ""

"To enumerate all distinct multisets of a given size over a given set of "

"elements, see :func:`itertools.combinations_with_replacement`::"

msgstr ""

"Para enumerar todos los distintos multiconjuntos de un tamaño dado sobre un "

"conjunto dado de elementos, consulte :func:`itertools."

"combinations_with_replacement`::"

#: ../Doc/library/collections.rst:447

msgid ""

"map(Counter, combinations_with_replacement('ABC', 2)) # --> AA AB AC BB BC CC"

msgstr ""

#: ../Doc/library/collections.rst:451

msgid ":class:`deque` objects"

msgstr "Objetos :class:`deque`"

#: ../Doc/library/collections.rst:455

msgid ""

"Returns a new deque object initialized left-to-right (using :meth:`append`) "

"with data from *iterable*. If *iterable* is not specified, the new deque is "

"empty."

msgstr ""

"Retorna un nuevo objeto deque inicializado de izquierda a derecha (usando :"

"meth:`append`) con datos de *iterable*. Si no se especifica *iterable*, el "

"nuevo deque estará vacío."

#: ../Doc/library/collections.rst:458

#, fuzzy

msgid ""

"Deques are a generalization of stacks and queues (the name is pronounced "

"\"deck\" and is short for \"double-ended queue\"). Deques support thread-"

"safe, memory efficient appends and pops from either side of the deque with "

"approximately the same *O*\\ (1) performance in either direction."

msgstr ""

"Los deques son una generalización de pilas y colas (el nombre se pronuncia "

"“baraja”, *deck* en inglés, y es la abreviatura de “cola de dos extremos”, "

"*double-ended queue* en inglés). Los Deques admiten hilos seguros, appends y "

"pops eficientes en memoria desde cualquier lado del deque con "

"aproximadamente el mismo rendimiento O(1) en cualquier dirección."

#: ../Doc/library/collections.rst:463

#, fuzzy

msgid ""

"Though :class:`list` objects support similar operations, they are optimized "

"for fast fixed-length operations and incur *O*\\ (*n*) memory movement costs "

"for ``pop(0)`` and ``insert(0, v)`` operations which change both the size "

"and position of the underlying data representation."

msgstr ""

"Aunque los objetos :class:`list` admiten operaciones similares, están "

"optimizados para operaciones rápidas de longitud fija e incurren en costos "

"de movimiento de memoria O(n) para operaciones ``pop(0)`` y ``insert(0, v)`` "

"que cambian tanto el tamaño como la posición de la representación de datos "

"subyacente."

#: ../Doc/library/collections.rst:469

msgid ""

"If *maxlen* is not specified or is ``None``, deques may grow to an arbitrary "

"length. Otherwise, the deque is bounded to the specified maximum length. "

"Once a bounded length deque is full, when new items are added, a "

"corresponding number of items are discarded from the opposite end. Bounded "

"length deques provide functionality similar to the ``tail`` filter in Unix. "

"They are also useful for tracking transactions and other pools of data where "

"only the most recent activity is of interest."

msgstr ""

"Si no se especifica *maxlen* o es ``None``, los deques pueden crecer hasta "

"una longitud arbitraria. De lo contrario, el deque está limitado a la "

"longitud máxima especificada. Una vez que un deque de longitud limitada esta "

"lleno, cuando se agregan nuevos elementos, se descarta el número "

"correspondiente de elementos del extremo opuesto. Los deques de longitud "

"limitada proporcionan una funcionalidad similar al filtro ``tail`` en Unix. "

"También son útiles para rastrear transacciones y otros grupos de datos donde "

"solo la actividad más reciente es de interés."

#: ../Doc/library/collections.rst:478

msgid "Deque objects support the following methods:"

msgstr "Los objetos deque admiten los siguientes métodos:"

#: ../Doc/library/collections.rst:482

msgid "Add *x* to the right side of the deque."

msgstr "Agregue *x* al lado derecho del deque."

#: ../Doc/library/collections.rst:487

msgid "Add *x* to the left side of the deque."

msgstr "Agregue *x* al lado izquierdo del deque."

#: ../Doc/library/collections.rst:492

msgid "Remove all elements from the deque leaving it with length 0."

msgstr "Retire todos los elementos del deque dejándolo con longitud 0."

#: ../Doc/library/collections.rst:497

msgid "Create a shallow copy of the deque."

msgstr "Crea una copia superficial del deque."

#: ../Doc/library/collections.rst:504

msgid "Count the number of deque elements equal to *x*."

msgstr "Cuente el número de elementos deque igual a *x*."

#: ../Doc/library/collections.rst:511

msgid ""

"Extend the right side of the deque by appending elements from the iterable "

"argument."

msgstr ""

"Extienda el lado derecho del deque agregando elementos del argumento "

"iterable."

#: ../Doc/library/collections.rst:517

msgid ""

"Extend the left side of the deque by appending elements from *iterable*. "

"Note, the series of left appends results in reversing the order of elements "

"in the iterable argument."

msgstr ""

"Extienda el lado izquierdo del deque agregando elementos de *iterable*. "

"Tenga en cuenta que la serie de appends a la izquierda da como resultado la "

"inversión del orden de los elementos en el argumento iterable."

#: ../Doc/library/collections.rst:524

msgid ""

"Return the position of *x* in the deque (at or after index *start* and "

"before index *stop*). Returns the first match or raises :exc:`ValueError` "

"if not found."

msgstr ""

"Retorna la posición de *x* en el deque (en o después del índice *start* y "

"antes del índice *stop*). Retorna la primera coincidencia o lanza :exc:"

"`ValueError` si no se encuentra."

#: ../Doc/library/collections.rst:533

msgid "Insert *x* into the deque at position *i*."

msgstr "Ingrese *x* en el dique en la posición *i*."

#: ../Doc/library/collections.rst:535

msgid ""

"If the insertion would cause a bounded deque to grow beyond *maxlen*, an :"

"exc:`IndexError` is raised."

msgstr ""

"Si la inserción causara que un deque limitado crezca más allá de *maxlen*, "

"se lanza un :exc:`IndexError`."

#: ../Doc/library/collections.rst:543

msgid ""

"Remove and return an element from the right side of the deque. If no "

"elements are present, raises an :exc:`IndexError`."

msgstr ""

"Elimina y retorna un elemento del lado derecho del deque. Si no hay "

"elementos presentes, lanza un :exc:`IndexError`."

#: ../Doc/library/collections.rst:549

msgid ""

"Remove and return an element from the left side of the deque. If no elements "

"are present, raises an :exc:`IndexError`."

msgstr ""

"Elimina y retorna un elemento del lado izquierdo del deque. Si no hay "

"elementos presentes, lanza un :exc:`IndexError`."

#: ../Doc/library/collections.rst:555

msgid ""

"Remove the first occurrence of *value*. If not found, raises a :exc:"

"`ValueError`."

msgstr ""

"Elimina la primera aparición de *value*. Si no se encuentra, lanza un :exc:"

"`ValueError`."

#: ../Doc/library/collections.rst:561

msgid "Reverse the elements of the deque in-place and then return ``None``."

msgstr ""

"Invierte los elementos del deque en su lugar (*in-place*) y luego retorna "

"``None``."

#: ../Doc/library/collections.rst:568

msgid ""

"Rotate the deque *n* steps to the right. If *n* is negative, rotate to the "

"left."

msgstr ""

"Gira el deque *n* pasos a la derecha. Si *n* es negativo, lo gira hacia la "

"izquierda."

#: ../Doc/library/collections.rst:571

msgid ""

"When the deque is not empty, rotating one step to the right is equivalent to "

"``d.appendleft(d.pop())``, and rotating one step to the left is equivalent "

"to ``d.append(d.popleft())``."

msgstr ""

"Cuando el deque no está vacío, girar un paso hacia la derecha equivale a ``d."

"appendleft(d.pop())``, y girar un paso hacia la izquierda equivale a ``d."

"append(d.popleft())``."

#: ../Doc/library/collections.rst:576

msgid "Deque objects also provide one read-only attribute:"

msgstr "Los objetos deque también proporcionan un atributo de solo lectura:"

#: ../Doc/library/collections.rst:580

msgid "Maximum size of a deque or ``None`` if unbounded."