Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Commitefe7d4b

Browse files
committed
Translate itertools.po, 3
1 parentcf9cd59 commitefe7d4b

File tree

2 files changed

+94
-81
lines changed

2 files changed

+94
-81
lines changed

‎TRANSLATORS

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -3,6 +3,7 @@ Juan Diego Alfonso Ocampo (@halcolo)
33
Nahuel Ambrosini (@ambro17)
44
Gabriel Anguita (@gabrielanguita)
55
Paula Aragón (@pandrearro)
6+
Constanza Areal (@geekcoty)
67
Emmanuel Arias (@eamanu)
78
Jhonatan Barrera (@iam3mer)
89
Reinny Almonte Ramos (@jighdan)
@@ -16,6 +17,7 @@ Javier Daza (@javierdaza)
1617
Carlos Joel Delgado Pizarro (@c0x6a)
1718
Sergio Delgado Quintero (@sdelquin)
1819
Nicolás Demarchi (@gilgamezh)
20+
Ignacio Dopazo (@ignaciodopazo)
1921
Nahuel Espinosa (@nahueespinosa)
2022
Xavi Francisco (@srxavi)
2123
Santiago E Fraire Willemoes (@Woile)
@@ -33,6 +35,7 @@ Omar Mendo (@beejeke)
3335
Darwing Medina Lacayo (@darwing1210)
3436
Claudia Millán Nebot (@clacri @cheshireminima)
3537
María José Molina Contreras (@mjmolina)
38+
Marco Moresi (@mrcmoresi)
3639
Elisabeth Ortega (@draentropia)
3740
Santiago Piccinini (@spiccinini)
3841
Julián Pérez (@jcpmmx)

‎library/itertools.po

Lines changed: 91 additions & 81 deletions
Original file line numberDiff line numberDiff line change
@@ -11,7 +11,7 @@ msgstr ""
1111
"Project-Id-Version:Python 3.8\n"
1212
"Report-Msgid-Bugs-To:\n"
1313
"POT-Creation-Date:2020-05-05 12:54+0200\n"
14-
"PO-Revision-Date:2020-07-09 13:18-0500\n"
14+
"PO-Revision-Date:2020-08-10 10:30-0500\n"
1515
"Language-Team:python-doc-es\n"
1616
"MIME-Version:1.0\n"
1717
"Content-Type:text/plain; charset=UTF-8\n"
@@ -20,7 +20,7 @@ msgstr ""
2020
"Plural-Forms:nplurals=2; plural=(n != 1);\n"
2121
"Last-Translator:\n"
2222
"Language:es\n"
23-
"X-Generator:Poedit 2.3.1\n"
23+
"X-Generator:Poedit 2.4\n"
2424

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

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

478479
#:../Doc/library/itertools.rst:161
479480
msgid""
@@ -498,18 +499,19 @@ msgid ""
498499
"are exhausted. Used for treating consecutive sequences as a single "
499500
"sequence. Roughly equivalent to::"
500501
msgstr""
501-
"Make an iterator that returns elements from the firstiterableuntil it is "
502-
"exhausted, then proceeds to the nextiterable,until all of the iterables "
503-
"are exhausted. Used for treating consecutive sequences as a single "
504-
"sequence. Aproximadamente equivalente a::"
502+
"Crea un iterador que retorna elementos del primeriterablehasta que es "
503+
"consumido, para luego proceder con el siguienteiterable,hasta que todos "
504+
"los iterables son consumidos. Se utiliza para tratar secuencias "
505+
"consecutivas como unas sola secuencia. Aproximadamente equivalente a::"
505506

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

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

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

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

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

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

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

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

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

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

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

632638
#:../Doc/library/itertools.rst:331
633639
msgid""
634640
"Make an iterator returning elements from the iterable and saving a copy of "
635641
"each. When the iterable is exhausted, return elements from the saved copy. "
636642
"Repeats indefinitely. Roughly equivalent to::"
637643
msgstr""
638-
"Make an iterator returning elements from the iterableand saving a copy of "
639-
"each. When the iterableis exhausted, return elements from the saved copy. "
640-
"Repeats indefinitely. Aproximadamente equivalente a::"
644+
"Crea un iterador que retorna elementos del iterabley hace una copia de cada "
645+
"uno. Cuando el iterablees consumido, retornar los elementos de la copia "
646+
"almacenada. Se repite indefinidamente. Aproximadamente equivalente a::"
641647

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

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

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

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

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

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

740750
#:../Doc/library/itertools.rst:475
741751
msgid""
@@ -767,9 +777,9 @@ msgid ""
767777
"*iterable* is sorted, the permutation tuples will be produced in sorted "
768778
"order."
769779
msgstr""
770-
"Las permutaciones son emitidascon orden lexicográfico. De esta manera, si "
771-
"el *iterable* de entrada esta ordenado, las tuplas delapermutaciónse "
772-
"producirán de manera ordenada."
780+
"Las permutaciones son emitidasen orden lexicográfico. De esta manera, si "
781+
"el *iterable* de entrada esta ordenado, las tuplas de permutaciónproducidas "
782+
"estarán ordenadas."
773783

774784
#:../Doc/library/itertools.rst:491
775785
msgid""

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp