8000 Traducción de `library/itertools.po` by jcpmmx · Pull Request #451 · python/python-docs-es · GitHub
[go: up one dir, main page]
Skip to content

Traducción de library/itertools.po #451

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related em 8000 ails.

Already on GitHub? Sign in to your account

Merged
merged 20 commits into from
Aug 27, 2020
+326 −99
Merged

Traducción de library/itertools.po #451

Show file tree
Hide file tree
Changes from 1 commit
Commits
Show all changes
20 commits
Select commit Hold shift + click to select a range
26d001a
Translate itertools.po
jcpmmx Jun 26, 2020
70b719b
Translate itertools.po, 2
jcpmmx Jul 9, 2020
c00ef76
Merge branch '3.8' into traduccion-itertools
jcpmmx Jul 9, 2020
b009d8f
Merge branch '3.8' into traduccion-itertools
jcpmmx Jul 28, 2020
cf9cd59
Merge branch '3.8' into traduccion-itertools
jcpmmx Jul 29, 2020
efe7d4b
Translate itertools.po, 3
jcpmmx Aug 10, 2020
c060fc2
Merge branch '3.8' into traduccion-itertools
jcpmmx Aug 10, 2020
dc7918f
Translate itertools.po, 4
jcpmmx Aug 10, 2020
4fa1ec7
Fix errors
jcpmmx Aug 10, 2020
e69185f
Merge branch '3.8' into traduccion-itertools
clacri Aug 11, 2020
462a815
Merge branch '3.8' into traduccion-itertools
clacri Aug 15, 2020
b51be48
Merge branch '3.8' into traduccion-itertools
clacri Aug 18, 2020
1cc3c3a
Merge branch '3.8' into traduccion-itertools
clacri Aug 19, 2020
8ccb230
Merge branch '3.8' into traduccion-itertools
clacri Aug 21, 2020
347cb41
Address PR feedback
jcpmmx Aug 22, 2020
2ecd0a7
Merge branch '3.8' into traduccion-itertools
cmaureir Aug 22, 2020
d0ca0ea
Merge branch '3.8' into traduccion-itertools
clacri Aug 23, 2020
6d48125
powrap passing, fail in pospell
clacri Aug 23, 2020
186f4f6
testing
clacri Aug 27, 2020
58be2f4
Merge branch '3.8' of https://github.com/python/python-docs-es into p…
clacri Aug 27, 2020
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
Translate itertools.po, 3
  • Loading branch information
@jcpmmx
jcpmmx committed Aug 10, 2020
commit efe7d4ba11c06cc71bd968bd3e8297ad2fc389d6
3 changes: 3 additions & 0 deletions TRANSLATORS
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3,6 +3,7 @@ Juan Diego Alfonso Ocampo (@halcolo)
Nahuel Ambrosini (@ambro17)
Gabriel Anguita (@gabrielanguita)
Paula Aragón (@pandrearro)
Constanza Areal (@geekcoty)
Emmanuel Arias (@eamanu)
Jhonatan Barrera (@iam3mer)
Reinny Almonte Ramos (@jighdan)
Expand All @@ -16,6 +17,7 @@ Javier Daza (@javierdaza)
Carlos Joel Delgado Pizarro (@c0x6a)
Sergio Delgado Quintero (@sdelquin)
Nicolás Demarchi (@gilgamezh)
Ignacio Dopazo (@ignaciodopazo)
Nahuel Espinosa (@nahueespinosa)
Xavi Francisco (@srxavi)
Santiago E Fraire Willemoes (@Woile)
Expand All @@ -33,6 +35,7 @@ Omar Mendo (@beejeke)
Darwing Medina Lacayo (@darwing1210)
Claudia Millán Nebot (@clacri @cheshireminima)
María José Molina Contreras (@mjmolina)
Marco Moresi (@mrcmoresi)
Elisabeth Ortega (@draentropia)
Santiago Piccinini (@spiccinini)
Julián Pérez (@jcpmmx)
Expand Down
172 changes: 91 additions & 81 deletions library/itertools.po
View file
Open in desktop
8000
Original file line number Diff line number Diff line change
Expand Up @@ -11,7 +11,7 @@ msgstr ""
"Project-Id-Version: Python 3.8\n"
"Report-Msgid-Bugs-To: \n"
"POT-Creation-Date: 2020-05-05 12:54+0200\n"
"PO-Revision-Date: 2020-07-09 13:18-0500\n"
"PO-Revision-Date: 2020-08-10 10:30-0500\n"
"Language-Team: python-doc-es\n"
"MIME-Version: 1.0\n"
"Content-Type: text/plain; charset=UTF-8\n"
Expand All @@ -20,7 +20,7 @@ msgstr ""
"Plural-Forms: nplurals=2; plural=(n != 1);\n"
"Last-Translator: \n"
"Language: es\n"
"X-Generator: Poedit 2.3.1\n"
"X-Generator: Poedit 2.4\n"

#: ../Doc/library/itertools.rst:2
msgid ":mod:`itertools` --- Functions creating iterators for efficient looping"
Expand All @@ -34,7 +34,7 @@ msgid ""
"suitable for Python."
msgstr ""
"Este módulo implementa un número de piezas básicas :term:`iterator` "
"inspiradas en “constructs” de APL, Haskell y SML. Cada pieza ha sido "
"inspiradas en *constructs* de APL, Haskell y SML. Cada pieza ha sido "
"reconvertida a una forma apropiada para Python."

#: ../Doc/library/itertools.rst:20
Expand Down Expand Up @@ -467,13 +467,14 @@ msgid ""
"modeled by supplying the initial value in the iterable and using only the "
"accumulated total in *func* argument::"
msgstr ""
"There are a number of uses for the *func* argument. It can be set to :func:"
"`min` for a running minimum, :func:`max` for a running maximum, or :func:"
"`operator.mul` for a running product. Amortization tables can be built by "
"accumulating interest and applying payments. First-order `recurrence "
"relations <https://en.wikipedia.org/wiki/Recurrence_relation>`_ can be "
"modeled by supplying the initial value in the iterable and using only the "
"accumulated total in *func* argument::"
"Hay un número de usos para el parámetro *func*. Se le puede asignar :func:"
"`min` para calcular un mínimo acumulado, :func:`max` para un máximo "
"acumulado, o :func:`operator.mul` para un producto acumulado. Se pueden "
"crear tablas de amortización al acumular intereses y aplicando pagos. "
"`Relaciones de recurrencias <https://es.wikipedia.org/wiki/"
"Relación_de_recurrencia>`_ de primer orden se puede modelar al proveer el "
"valor inicial en el iterable y utilizando sólo el total acumulado en el "
"parámetro *func*::"

#: ../Doc/library/itertools.rst:161
msgid ""
Expand All @@ -498,18 +499,19 @@ msgid ""
"are exhausted. Used for treating consecutive sequences as a single "
"sequence. Roughly equivalent to::"
msgstr ""
"Make an iterator that returns elements from the first iterable until it is "
"exhausted, then proceeds to the next iterable, until all of the iterables "
"are exhausted. Used for treating consecutive sequences as a single "
"sequence. Aproximadamente equivalente a::"
"Crea un iterador que retorna elementos del primer iterable hasta que es "
"consumido, para luego proceder con el siguiente iterable, hasta que todos "
"los iterables son consumidos. Se utiliza para tratar secuencias "
"consecutivas como unas sola secuencia. Aproximadamente equivalente a::"

#: ../Doc/library/itertools.rst:188
msgid ""
"Alternate constructor for :func:`chain`. Gets chained inputs from a single "
"iterable argument that is evaluated lazily. Roughly equivalent to::"
msgstr ""
"Alternate constructor for :func:`chain`. Gets chained inputs from a single "
"iterable argument that is evaluated lazily. Aproximadamente equivalente a::"
"Constructor alternativo para :func:`chain`. Obtiene entradas enlazadas de "
"un mismo parámetro que se evalúa perezosamente. Aproximadamente equivalente "
"a::"

#: ../Doc/library/itertools.rst:200
msgid "Return *r* length subsequences of elements from the input *iterable*."
Expand All @@ -523,29 +525,30 @@ msgid ""
"*iterable* is sorted, the combination tuples will be produced in sorted "
"order."
msgstr ""
"Combinations are emitted in lexicographic sort order. So, if the input "
"*iterable* is sorted, the combination tuples will be produced in sorted "
"order."
"Las combinaciones se emiten en orden lexicográfico. De esta manera, si el "
"*iterable* de entrada está ordenado, las tuplas de permutación producidas "
"estarán ordenadas."

#: ../Doc/library/itertools.rst:206
msgid ""
"Elements are treated as unique based on their position, not on their value. "
"So if the input elements are unique, there will be no repeat values in each "
"combination."
msgstr ""
"Elements are treated as unique based on their position, not on their value. "
"So if the input elements are unique, there will be no repeat values in each "
"combination."
"Los elementos son tratados como únicos basados en su posición, no en su "
"valor. De esta manera, si los elementos de entrada son únicos, no habrá "
"valores repetidos en cada combinación."

#: ../Doc/library/itertools.rst:232
msgid ""
"The code for :func:`combinations` can be also expressed as a subsequence of :"
"func:`permutations` after filtering entries where the elements are not in "
"sorted order (according to their position in the input pool)::"
msgstr ""
"The code for :func:`combinations` can be also expressed as a subsequence of :"
"func:`permutations` after filtering entries where the elements are not in "
"sorted order (according to their position in the input pool)::"
"El código para :func:`combinations` se puede expresar también como una "
"subsecuencia de :func:`permutations`, luego de filtrar entradas donde los "
"elementos no están ordenados (de acuerdo a su posición en el conjunto de "
"entrada)::"

#: ../Doc/library/itertools.rst:243
msgid ""
Expand All @@ -560,28 +563,30 @@ msgid ""
"Return *r* length subsequences of elements from the input *iterable* "
"allowing individual elements to be repeated more than once."
msgstr ""
"Return *r* length subsequences of elements from the input *iterable* "
"allowing individual elements to be repeated more than once."
"Retorna subsecuencias, de longitud *r*, con elementos del *iterable* de "
"entrada, permitiendo que haya elementos individuales repetidos más de una "
"vez."

#: ../Doc/library/itertools.rst:255
msgid ""
"Elements are treated as unique based on their position, not on their value. "
"So if the input elements are unique, the generated combinations will also be "
"unique."
msgstr ""
"Elements are treated as unique based on their position, not on their value. "
"So if the input elements are unique, the generated combinations will also be "
"unique."
"Los elementos son tratados como únicos basados en su posición, no en su "
"valor. De esta manera, si los elementos de entrada son únicos, las "
"combinaciones generadas también serán únicas."

#: ../Doc/library/itertools.rst:278
msgid ""
"The code for :func:`combinations_with_replacement` can be also expressed as "
"a subsequence of :func:`product` after filtering entries where the elements "
"are not in sorted order (according to their position in the input pool)::"
msgstr ""
"The code for :func:`combinations_with_replacement` can be also expressed as "
"a subsequence of :func:`product` after filtering entries where the elements "
"are not in sorted order (according to their position in the input pool)::"
"El código para :func:`combinations_with_replacement` se puede expresar "
"también como una subsecuencia de :func:`product`, luego de filtrar entradas "
"donde los elementos no están ordenados (de acuerdo a su posición en el "
"conjunto de entrada)::"

#: ../Doc/library/itertools.rst:289
msgid ""
Expand All @@ -597,10 +602,10 @@ msgid ""
"Stops when either the *data* or *selectors* iterables has been exhausted. "
"Roughly equivalent to::"
msgstr ""
"Make an iterator that filters elements from *data* returning only those that "
"have a corresponding element in *selectors* that evaluates to ``True``. "
"Stops when either the *data* or *selectors* iterables has been exhausted. "
"Aproximadamente equivalente a::"
"Crea un iterador que filtra elementos de *data*, retornando sólo aquellos "
"que tienen un elemento correspondiente en *selectors* que evalúa a ``True``. "
"El iterador se detiene cuando alguno de los iterables (*data* o *selectors*) "
"ha sido consumido. Aproximadamente equivalente a::"

#: ../Doc/library/itertools.rst:310
msgid ""
Expand All @@ -609,35 +614,36 @@ msgid ""
"data points. Also, used with :func:`zip` to add sequence numbers. Roughly "
"equivalent to::"
msgstr ""
"Make an iterator that returns evenly spaced values starting with number "
"*start*. Often used as an argument to :func:`map` to generate consecutive "
"data points. Also, used with :func:`zip` to add sequence numbers. "
"Aproximadamente equivalente a::"
"Crea un iterador que retorna valores espaciados uniformemente, comenzando "
"con el número *start*. Usualmente se utiliza como parámetro en :func:`map` "
"para generar puntos de datos consecutivos. También se utiliza en :func:`zip` "
"para agregar secuencias de números. Aproximadamente equivalente a::"

#: ../Doc/library/itertools.rst:322
msgid ""
"When counting with floating point numbers, better accuracy can sometimes be "
"achieved by substituting multiplicative code such as: ``(start + step * i "
"for i in count())``."
msgstr ""
"When counting with floating point numbers, better accuracy can sometimes be "
"achieved by substituting multiplicative code such as: ``(start + step * i "
"Cuando se hace conteo con números de punto flotante, se puede lograr una "
"mejor precisión al sustituir código multiplicativo como: ``(start + step * i "
"for i in count())``."

#: ../Doc/library/itertools.rst:326
msgid "Added *step* argument and allowed non-integer arguments."
msgstr ""
"Adicionó el parámetro *step* y permitió paramétros diferentes a enteros."
"Se adicionó el parámetro *step* y se permitió paramétros diferentes a "
"enteros."

#: ../Doc/library/itertools.rst:331
msgid ""
"Make an iterator returning elements from the iterable and saving a copy of "
"each. When the iterable is exhausted, return elements from the saved copy. "
"Repeats indefinitely. Roughly equivalent to::"
msgstr ""
"Make an iterator returning elements from the iterable and saving a copy of "
"each. When the iterable is exhausted, return elements from the saved copy. "
"Repeats indefinitely. Aproximadamente equivalente a::"
"Crea un iterador que retorna elementos del iterable y hace una copia de cada "
"uno. Cuando el iterable es consumido, retornar los elementos de la copia "
"almacenada. Se repite indefinidamente. Aproximadamente equivalente a::"

#: ../Doc/library/itertools.rst:345
msgid ""
Expand All @@ -654,20 +660,22 @@ msgid ""
"does not produce *any* output until the predicate first becomes false, so it "
"may have a lengthy start-up time. Roughly equivalent to::"
msgstr ""
"Make an iterator that drops elements from the iterable as long as 9E88 the "
"predicate is true; afterwards, returns every element. Note, the iterator "
"does not produce *any* output until the predicate first becomes false, so it "
"may have a lengthy start-up time. Aproximadamente equivalente a::"
"Crea un iterador que descarta elementos del iterable, siempre y cuando el "
"predicado sea verdadero; después, retorna cada elemento. Ten en cuenta, el "
"iterador no produce *ningún* resultado hasta que el predicado se hace falso, "
"pudiendo incurrir en un tiempo de arranque extenso. Aproximadamente "
"equivalente a::"

#: ../Doc/library/itertools.rst:368
msgid ""
"Make an iterator that filters elements from iterable returning only those "
"for which the predicate is ``False``. If *predicate* is ``None``, return the "
"items that are false. Roughly equivalent to::"
msgstr ""
"Make an iterator that filters elements from iterable returning only those "
"for which the predicate is ``False``. If *predicate* is ``None``, return the "
"items that are false. Aproximadamente equivalente a::"
"Crea un iterador que filtra elementos de un iterable, retornando sólo "
"aquellos para los cuales el predicado es ``False``. Si *predicate* es "
"``None``, retorna los elementos que son falsos. Aproximadamente equivalente "
"a::"

#: ../Doc/library/itertools.rst:383
msgid ""
Expand All @@ -677,11 +685,11 @@ msgid ""
"returns the element unchanged. Generally, the iterable needs to already be "
"sorted on the same key function."
msgstr ""
"Make an iterator that returns consecutive keys and groups from the "
"*iterable*. The *key* is a function computing a key value for each element. "
"If not specified or is ``None``, *key* defaults to an identity function and "
"returns the element unchanged. Generally, the iterable needs to already be "
"sorted on the same key function."
"Crea un iterador que retorna claves consecutivas y grupos del *iterable*. La "
"*clave* es una función que calcula un valor clave para cada elemento. Si no "
"se especifica o es ``None``, la *clave* es una función de identidad por "
"defecto y retornar el elemento sin cambios. Generalmente, el iterable "
"necesita estar ordenador con la misma función clave."

#: ../Doc/library/itertools.rst:389
msgid ""
Expand All @@ -691,11 +699,11 @@ msgid ""
"the same key function). That behavior differs from SQL's GROUP BY which "
"aggregates common elements regardless of their input order."
msgstr ""
"The operation of :func:`groupby` is similar to the ``uniq`` filter in Unix. "
"It generates a break or new group every time the value of the key function "
"changes (which is why it is usually necessary to have sorted the data using "
"the same key function). That behavior differs from SQL's GROUP BY which "
"aggregates common elements regardless of their input order."
"El funcionamiento de :func:`groupby` es similar al del filtro ``uniq`` en "
"Unix. Genera un salto o un nuevo grupo cada vez que el valor de la función "
"clave cambia (por lo que usualmente es necesario ordenar los datos usando la "
"misma función clave). Ese comportamiento difiere del de GROUP BY de SQL, el "
"cual agrega elementos comunes sin importar el orden de entrada."

#: ../Doc/library/itertools.rst:395
msgid ""
Expand All @@ -704,10 +712,10 @@ msgid ""
"`groupby` object is advanced, the previous group is no longer visible. So, "
"if that data is needed later, it should be stored as a list::"
msgstr ""
"The returned group is itself an iterator that shares the underlying iterable "
"with :func:`groupby`. Because the source is shared, when the :func:"
"`groupby` object is advanced, the previous group is no longer visible. So, "
"if that data is needed later, it should be stored as a list::"
"El grupo retornado es un iterador mismo que comparte el iterable subyacente "
"con :func:`groupby`. Al compartir la fuente, cuando el objeto :func:"
"`groupby` se avanza, el grupo previo deja de ser visible. En ese caso, si "
"los datos se necesitan posteriormente, se deberían almacenar como lista::"

#: ../Doc/library/itertools.rst:407
msgid ":func:`groupby` is roughly equivalent to::"
Expand All @@ -726,16 +734,18 @@ msgid ""
"the internal structure has been flattened (for example, a multi-line report "
"may list a name field on every third line). Roughly equivalent to::"
msgstr ""
"Make an iterator that returns selected elements from the iterable. If "
"*start* is non-zero, then elements from the iterable are skipped until start "
"is reached. Afterward, elements are returned consecutively unless *step* is "
"set higher than one which results in items being skipped. If *stop* is "
"``None``, then iteration continues until the iterator is exhausted, if at "
"all; otherwise, it stops at the specified position. Unlike regular "
"slicing, :func:`islice` does not support negative values for *start*, "
"*stop*, or *step*. Can be used to extract related fields from data where "
"the internal structure has been flattened (for example, a multi-line report "
"may list a name field on every third line). Aproximadamente equivalente a::"
"Crea un iterador que retorna los elementos seleccionados del iterable. Si "
"*start* es diferente a cero, los elementos del iterable son ignorados hasta "
"que se llegue a *start*. Después de eso, los elementos son retornados "
"consecutivamente a menos que *step* posea un valor tan alto que permita que "
"algunos elementos sean ignordos. Si *stop* es ``None``, la iteración "
"continúa hasta que el iterador sea consumido (si es que llega a ocurrir); de "
"lo contrario, se detiene en la posición especificada. A diferencia de la "
"segmentación normal, :func:`islice` no soporta valores negativos para "
"*start*, *stop*, o *step*. Puede usarse para extraer campos relacionados de "
"estructuras de datos que internamente has sido simplificadas (por ejemplo, "
"un reporte milti-línea puede contener un nombre de campo cada tres líneas). "
"Aproximadamente equivalente a::"

#: ../Doc/library/itertools.rst:475
msgid ""
Expand Down Expand Up @@ -767,9 +777,9 @@ msgid ""
"*iterable* is sorted, the permutation tuples will be produced in sorted "
"order."
msgstr ""
"Las permutaciones son emitidas con orden lexicográfico. De esta manera, si "
"el *iterable* de entrada esta ordenado, las tuplas de la permutación se "
"producirán de manera ordenada."
"Las permutaciones son emitidas en orden lexicográfico. De esta manera, si "
"el *iterable* de entrada esta ordenado, las tuplas de permutación producidas "
"estarán ordenadas."

#: ../Doc/library/itertools.rst:491
msgid ""
Expand Down
0