[ Web Proxy ]
URL:
Viewing:
https://github-redirect.dependabot.com/python/python-docs-pl/blob/3.8/tutorial/datastructures.po
[Back]
[Original]
python-docs-pl/tutorial/datastructures.po at 3.8 python/python-docs-pl GitHub
Skip to content
Navigation Menu
Sign in
Appearance settings
Platform
AI CODE CREATION
GitHub Copilot
Write better code with AI
GitHub Copilot app
Direct agents from issue to merge
MCP Registry
Integrate external tools
DEVELOPER WORKFLOWS
Actions
Automate any workflow
Codespaces
Instant dev environments
Issues
Plan and track work
Code Review
Manage code changes
Code Quality
Enforce quality at merge
APPLICATION SECURITY
GitHub Advanced Security
Find and fix vulnerabilities
Code security
Secure your code as you build
Secret protection
Stop leaks before they start
EXPLORE
Why GitHub
Documentation
Blog
Changelog
Marketplace
View all features
Solutions
BY COMPANY SIZE
Enterprises
Small and medium teams
Startups
Nonprofits
BY USE CASE
App Modernization
DevSecOps
DevOps
CI/CD
View all use cases
BY INDUSTRY
Healthcare
Financial services
Manufacturing
Government
View all industries
View all solutions
Resources
EXPLORE BY TOPIC
AI
Software Development
DevOps
Security
View all topics
EXPLORE BY TYPE
Customer stories
Events & webinars
Ebooks & reports
Business insights
GitHub Skills
SUPPORT & SERVICES
Documentation
Customer support
Community forum
Trust center
Partners
View all resources
Open Source
COMMUNITY
GitHub Sponsors
Fund open source developers
PROGRAMS
Security Lab
Maintainer Community
GitHub Stars
Archive Program
REPOSITORIES
Topics
Trending
Collections
Enterprise
ENTERPRISE SOLUTIONS
Enterprise platform
AI-powered developer platform
AVAILABLE ADD-ONS
GitHub Advanced Security
Enterprise-grade security features
Copilot for Business
Enterprise-grade AI features
Premium Support
Enterprise-grade 24/7 support
Pricing
Search
/
Sign in
Sign up
Appearance settings
You signed in with another tab or window.
Reload
to refresh your session.
You signed out in another tab or window.
Reload
to refresh your session.
You switched accounts on another tab or window.
Reload
to refresh your session.
Dismiss alert
{{ message }}
python
python-docs-pl
Repository navigation
Code
Issues
4
(4)
Pull requests
2
(2)
Actions
Security and quality
Insights
More
items
Files
Expand file tree
3.8
Breadcrumbs
python-docs-pl
/
tutorial
/
datastructures.po
Copy path
Blame
More file actions
Blame
More file actions
Latest commit
History
History
History
718 lines (629 loc) 33.6 KB
3.8
Breadcrumbs
python-docs-pl
/
tutorial
/
datastructures.po
Copy path
Top
File metadata and controls
Code
Blame
718 lines (629 loc) 33.6 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
#
SOME DESCRIPTIVE TITLE.
#
Copyright (C) 2001-2021, Python Software Foundation
#
This file is distributed under the same license as the Python package.
#
FIRST AUTHOR <EMAIL@ADDRESS>, YEAR.
#
#
Translators:
#
Maciej Olko <maciej.olko@gmail.com>, 2021
#
#,
fuzzy
msgid ""
msgstr ""
"
Project-Id-Version
:
Python 3.8\n
"
"
Report-Msgid-Bugs-To
:
\n
"
"
POT-Creation-Date
:
2021-01-01 16:06+0000\n
"
"
PO-Revision-Date
:
2020-05-30 12:16+0000\n
"
"
Last-Translator
:
Maciej Olko <maciej.olko@gmail.com>, 2021\n
"
"
Language-Team
:
Polish (https://www.transifex.com/python-doc/teams/5390/pl/)\n
"
"
MIME-Version
:
1.0\n
"
"
Content-Type
:
text/plain; charset=UTF-8\n
"
"
Content-Transfer-Encoding
:
8bit\n
"
"
Language
:
pl\n
"
"
Plural-Forms
:
nplurals=4; plural=(n==1 ? 0 : (n%10>=2 && n%10<=4) &&
"
"
(n%100<12 || n%100>14) ? 1 : n!=1 && (n%10>=0 && n%10<=1) || (n%10>=5 &&
"
"
n%10<=9) || (n%100>=12 && n%100<=14) ? 2 : 3);\n
"
msgid
"Data Structures"
msgstr
"Struktury danych"
msgid
""
"This chapter describes some things you've learned about already in more "
"detail, and adds some new things as well."
msgstr
""
"Ten rozdzia opisuje bardziej szczegowo niektre rzeczy, ktre ju "
"poznalicie, oraz rwnie wprowadza nowe elementy."
msgid
"More on Lists"
msgstr
"Wicej na temat list"
msgid
""
"The list data type has some more methods. Here are all of the methods of "
"list objects:"
msgstr
""
"Typ danych listy ma kilka wicej metod. To wszystkie metody obiektw list:"
msgid
""
"Add an item to the end of the list. Equivalent to ``a[len(a):] = [x]``."
msgstr
"Dodaje element na kocu listy. Ekwiwalent ``a[len(a):] = [x]``."
msgid
""
"Extend the list by appending all the items from the iterable. Equivalent to "
"``a[len(a):] = iterable``."
msgstr
""
"Rozszerza list przez dodanie wszystkich elementw iterable'a. Ekwiwalent "
"``a[len(a):] = iterable``."
msgid
""
"Insert an item at a given position. The first argument is the index of the "
"element before which to insert, so ``a.insert(0, x)`` inserts at the front "
"of the list, and ``a.insert(len(a), x)`` is equivalent to ``a.append(x)``."
msgstr
""
"Wstawia element na podan pozycj. Pierwszy argument jest indeksem elementu, "
"przed ktrym wstawiamy, wic ``a.insert(0, x)`` wstawia na pocztek listy a "
"``a.insert(len(a), x)`` odpowiada ``a.append(x)``."
msgid
""
"Remove the first item from the list whose value is equal to *x*. It raises "
"a :exc:`ValueError` if there is no such item."
msgstr
""
"Usu pierwszy element z listy, ktrego warto jest rwna *x*. Rzuca :exc:"
"`ValueError`, jeli nie ma takiego elementu."
msgid
""
"Remove the item at the given position in the list, and return it. If no "
"index is specified, ``a.pop()`` removes and returns the last item in the "
"list. (The square brackets around the *i* in the method signature denote "
"that the parameter is optional, not that you should type square brackets at "
"that position. You will see this notation frequently in the Python Library "
"Reference.)"
msgstr
""
"Usuwa element z podanej pozycji na licie i zwraca go. Jeli indeks nie jest "
"podany, ``a.pop()`` usuwa i zwraca ostatni element listy. (Nawiasy "
"kwadratowe dookoa *i* w sygnaturze metody oznaczaj, e ten parametr jest "
"opcjonalny, nie e powiniene wpisa nawiasy kwadratowe w tym miejscu. Tak "
"notacj bdziesz czsto widzie w dokumentacji biblioteki Pythona.)"
msgid
"Remove all items from the list. Equivalent to ``del a[:]``."
msgstr
"Usuwa wszystkie elementy z listy. Ekwiwalent ``del a[:]``."
msgid
""
"Return zero-based index in the list of the first item whose value is equal "
"to *x*. Raises a :exc:`ValueError` if there is no such item."
msgstr
""
"Zwraca indeks (liczony od zera) pierwszego elementu na licie, ktrego "
"warto jest rwna *x*. Rzuca :exc:`ValueError`, jeli nie ma takiego "
"elementu."
msgid
""
"The optional arguments *start* and *end* are interpreted as in the slice "
"notation and are used to limit the search to a particular subsequence of the "
"list. The returned index is computed relative to the beginning of the full "
"sequence rather than the *start* argument."
msgstr
""
"Opcjonalne argumenty *start* i *end* s interpretowane jak w notacji slice i "
"su do ograniczenia wyszukiwania do szczeglnej podsekwencji listy. "
"Zwracany indeks jest wyliczany wzgldem pocztku penej sekwencji, nie "
"wzgldem argumentu *start*."
msgid
"Return the number of times *x* appears in the list."
msgstr
"Zwraca liczb razy, jak *x* wystpuje licie."
msgid
""
"Sort the items of the list in place (the arguments can be used for sort "
"customization, see :func:`sorted` for their explanation)."
msgstr
""
"Sortuje elementy listy w miejscu (argumenty mog suy do dostosowania "
"sortowania, patrz :func:`sorted` po ich wyjanienie)."
msgid
"Reverse the elements of the list in place."
msgstr
"Odwraca elementy listy w miejscu."
msgid
"Return a shallow copy of the list. Equivalent to ``a[:]``."
msgstr
"Zwraca pytk kopi listy. Ekwiwalent ``a[:]``."
msgid
"An example that uses most of the list methods::"
msgstr
"Przykad, ktry uywa wikszo metod listy:"
msgid
""
"You might have noticed that methods like ``insert``, ``remove`` or ``sort`` "
"that only modify the list have no return value printed -- they return the "
"default ``None``. [1]_ This is a design principle for all mutable data "
"structures in Python."
msgstr
""
"Moge(-a) zauway, e metod takie jak ``insert``, ``remove`` lub "
"``sort``, ktre tylko modyfikuj list, nie maj wywietlonej zwracanej "
"wartoci -- zwracaj one domylne ``None``. [1]_ To zasada projektowa dla "
"wszystkich mutowalnych typw danych w Pythonie."
msgid
""
"Another thing you might notice is that not all data can be sorted or "
"compared. For instance, ``[None, 'hello', 10]`` doesn't sort because "
"integers can't be compared to strings and *None* can't be compared to other "
"types. Also, there are some types that don't have a defined ordering "
"relation. For example, ``3+4j < 5+7j`` isn't a valid comparison."
msgstr
""
"Moesz te zauway, e nie wszystkie dane da si posortowa lub porwna. "
"Na przykad, ``[None, 'hello', 10]`` nie sortuje si, poniewa liczby "
"cakowite nie mog by porwnywane do cigw znakw a *None* nie moe by "
"porwnywany do innych typw. S rwnie typy, ktre nie maj okrelonej "
"relacji porzdku. Na przykad ``3+4j < 5+7j`` nie jest poprawnym porwnaniem."
msgid
"Using Lists as Stacks"
msgstr
"Uywanie list jako stosw"
msgid
""
"The list methods make it very easy to use a list as a stack, where the last "
"element added is the first element retrieved (
\"
last-in, first-out
\"
). To "
"add an item to the top of the stack, use :meth:`append`. To retrieve an "
"item from the top of the stack, use :meth:`pop` without an explicit index. "
"For example::"
msgstr
""
"Metody listy uatwiaj uywanie listy jako stosu, gdzie ostatni element "
"dodany jest pierwszym elementem pobieranym (last-in, first-out). Aby doda "
"element na wierzch stosu, uyj :meth:`append`. Aby pobra element z wierzchu "
"stosu, uyj :meth:`pop` bez podanego indeksu. Na przykad::"
msgid
"Using Lists as Queues"
msgstr
"Uywanie list jako kolejek"
msgid
""
"It is also possible to use a list as a queue, where the first element added "
"is the first element retrieved (
\"
first-in, first-out
\"
); however, lists are "
"not efficient for this purpose. While appends and pops from the end of list "
"are fast, doing inserts or pops from the beginning of a list is slow "
"(because all of the other elements have to be shifted by one)."
msgstr
""
"Mona te uywa list jako kolejek, gdzie pierwszy element dodany jest "
"pierwszym elementem pobieranym (first-in, first-out); jednake listy nie "
"s wydajne do tego celu. Appendy i popy na kocu listy s szybkie, lecz "
"inserty i popy na pocztku listy s wolne (poniewa wszystkie inne elementy "
"musz zosta przesunite o jeden)."
msgid
""
"To implement a queue, use :class:`collections.deque` which was designed to "
"have fast appends and pops from both ends. For example::"
msgstr
""
"Aby zaimplementowa kolejk, uyj :class:`collections.deque`, ktra zostaa "
"zaprojektowana, by mie szybkie appendy i popy na obu kocach. Na przykad::"
msgid
"List Comprehensions"
msgstr
"List comprehensions"
msgid
""
"List comprehensions provide a concise way to create lists. Common "
"applications are to make new lists where each element is the result of some "
"operations applied to each member of another sequence or iterable, or to "
"create a subsequence of those elements that satisfy a certain condition."
msgstr
""
"List comprehensions s zwizym sposobem na tworzenie list. Powszechne "
"zastosowania to tworzenie nowych list, gdzie kady element jest wynikiem "
"jakich operacji zastosowanych do kadego elementu innej sekwencji lub "
"iterable'a lub do tworzenia podsekwencji tych elementw, ktre speniaj "
"okrelony warunek."
msgid
"For example, assume we want to create a list of squares, like::"
msgstr
"Na przykad zamy, e chcemy stworzy list kwadratw, jak tu::"
msgid
""
"Note that this creates (or overwrites) a variable named ``x`` that still "
"exists after the loop completes. We can calculate the list of squares "
"without any side effects using::"
msgstr
""
"Zwr uwag, e ten kod tworzy (lub nadpisuje) zmienn o nazwie ``x``, ktra "
"wci istnieje po wykonaniu ptli. Moemy obliczy list kwadratw bez "
"adnych efektw ubocznych w nastpujcy sposb::"
msgid
"or, equivalently::"
msgstr
"lub rwnowanie::"
msgid
"which is more concise and readable."
msgstr
"co jest bardziej zwize i czytelne."
msgid
""
"A list comprehension consists of brackets containing an expression followed "
"by a :keyword:`!for` clause, then zero or more :keyword:`!for` or :keyword:`!"
"if` clauses. The result will be a new list resulting from evaluating the "
"expression in the context of the :keyword:`!for` and :keyword:`!if` clauses "
"which follow it. For example, this listcomp combines the elements of two "
"lists if they are not equal::"
msgstr
""
"Wyraenie listowe skada si z nawiasw zawierajcych wyraenie oraz "
"klauzul :keyword:`!for`, nastpnie zero lub wicej klauzul :keyword:`!for` "
"lub :keyword:`!if`. Rezultatem bdzie nowa lista powstaa z obliczenia "
"wyraenia w kontekcie klauzul :keyword:`!for` i :keyword:`!if`, ktre po "
"nim nastpuj. Na przykad to wyraenie listowe czy elementy dwch list, "
"jeli nie s rwne::"
msgid
"and it's equivalent to::"
msgstr
"i jest odpowiednikiem::"
msgid
""
"Note how the order of the :keyword:`for` and :keyword:`if` statements is the "
"same in both these snippets."
msgstr
""
"Zwr uwag, e kolejno instrukcji :keyword:`for` i :keyword:`if` jest "
"taka sama w obu fragmentach kodu."
msgid
""
"If the expression is a tuple (e.g. the ``(x, y)`` in the previous example), "
"it must be parenthesized. ::"
msgstr
""
"Jeli wyraenie jest krotk (tak jak ``(x, y)`` w poprzednim przykadzie), "
"musi by wzite w nawias. ::"
msgid
""
"List comprehensions can contain complex expressions and nested functions::"
msgstr
""
"Wyraenia listowe mog zawiera zoone wyraenia i zagniedone funkcje::"
msgid
"Nested List Comprehensions"
msgstr
"Zagniedone wyraenia listowe"
msgid
""
"The initial expression in a list comprehension can be any arbitrary "
"expression, including another list comprehension."
msgstr
""
"Wyraeniem wyjciowym w wyraeniu listowym moe by kade arbitralne "
"wyraenie, wczajc inne wyraenie listowe."
msgid
""
"Consider the following example of a 3x4 matrix implemented as a list of 3 "
"lists of length 4::"
msgstr
""
"Rozwamy nastpujcy przykad macierzy 3-na-4 zaimplementowanej jako lista "
"trzech list o dugoci 4::"
msgid
"The following list comprehension will transpose rows and columns::"
msgstr
"Nastpujce wyraenie listowe przetransponuje wiersze i kolumny::"
msgid
""
"As we saw in the previous section, the nested listcomp is evaluated in the "
"context of the :keyword:`for` that follows it, so this example is equivalent "
"to::"
msgstr
""
"Jak widzielimy w poprzedniej sekcji, zagniedone wyraenie listowe jest "
"ewaluowane w kontekcie :keyword:`for`, ktre po nim nastpuje, wic ten "
"przykad jest rwnowany temu::"
msgid
"which, in turn, is the same as::"
msgstr
"ktry z kolei jest taki sam jak::"
msgid
""
"In the real world, you should prefer built-in functions to complex flow "
"statements. The :func:`zip` function would do a great job for this use case::"
msgstr
""
"W prawdziwym wiecie powiniene(-nna) preferowa wbudowane funkcje w "
"zoonych instrukcjach przepywu. Funkcja :func:`zip` bardzo si przyda w "
"tym przypadku::"
msgid
""
"See :ref:`tut-unpacking-arguments` for details on the asterisk in this line."
msgstr
""
"W :ref:`tut-unpacking-arguments` znajdziesz wyjanienie znaku gwiazdki w tej "
"linii."
msgid
"The :keyword:`!del` statement"
msgstr
"Instrukcja :keyword:`!del`"
msgid
""
"There is a way to remove an item from a list given its index instead of its "
"value: the :keyword:`del` statement. This differs from the :meth:`pop` "
"method which returns a value. The :keyword:`!del` statement can also be "
"used to remove slices from a list or clear the entire list (which we did "
"earlier by assignment of an empty list to the slice). For example::"
msgstr
""
"Element mona usun z listy majc jego indeks zamiast wartoci: instrukcj :"
"keyword:`del`. Jest ona rna od metody :meth:`pop`, ktra zwraca warto. "
"Instrukcji :keyword:`!del` mona te uy do usunicia slice'w lub "
"wyczyszczenia caej listy (zrobilimy to wczeniej przypisujc pust list "
"do slice'a). Na przykad::"
msgid
":keyword:`del` can also be used to delete entire variables::"
msgstr
":keyword:`del` mona rwnie uy do usuwania caych zmiennych::"
msgid
""
"Referencing the name ``a`` hereafter is an error (at least until another "
"value is assigned to it). We'll find other uses for :keyword:`del` later."
msgstr
""
"Odniesienie si do nazwy ``a`` odtd jest bdem (przynajmniej dopki nie "
"przypisana jest do niej inna warto). Pniej odnajdziemy wicej zastosowa "
"dla :keyword:`del`."
msgid
"Tuples and Sequences"
msgstr
"Krotki i sekwencje"
msgid
""
"We saw that lists and strings have many common properties, such as indexing "
"and slicing operations. They are two examples of *sequence* data types "
"(see :ref:`typesseq`). Since Python is an evolving language, other sequence "
"data types may be added. There is also another standard sequence data type: "
"the *tuple*."
msgstr
""
"Widzielimy, e listy i cigi znakw maj wiele wsplnych wasnoci, takich "
"jak indeksowanie i operacje slice. S one dwoma przykadami *sekwencyjnych* "
"typw danych (patrz :ref:`typesseq`). Jakoe Python jest ewoluujcym "
"jzykiem, mog zosta dodane inne sekwencyjne typy danych. Jest te inny "
"standardowy sekwencyjny typ danych: *krotka*."
msgid
""
"A tuple consists of a number of values separated by commas, for instance::"
msgstr
""
"Krotka skada si z kilku wartoci rozdzielonych przecinkami, na przykad::"
msgid
""
"As you see, on output tuples are always enclosed in parentheses, so that "
"nested tuples are interpreted correctly; they may be input with or without "
"surrounding parentheses, although often parentheses are necessary anyway (if "
"the tuple is part of a larger expression). It is not possible to assign to "
"the individual items of a tuple, however it is possible to create tuples "
"which contain mutable objects, such as lists."
msgstr
""
"Jak widzisz na wyjciu krotki zawsze s otoczone nawiasami, tak aby "
"zagniedone krotki byy poprawnie interpretowane; wpisa je mona z lub bez "
"otaczajcych nawiasw, chocia czsto nawiasy s i tak potrzebne (jeli "
"krotka jest czci wikszego wyraenia). Nie da si przypisa wartoci do "
"pojedynczych elementw krotki, ale da si stworzy krotki, ktre zawieraj "
"mutowalne obiekty, takie jak listy."
msgid
""
"Though tuples may seem similar to lists, they are often used in different "
"situations and for different purposes. Tuples are :term:`immutable`, and "
"usually contain a heterogeneous sequence of elements that are accessed via "
"unpacking (see later in this section) or indexing (or even by attribute in "
"the case of :func:`namedtuples <collections.namedtuple>`). Lists are :term:"
"`mutable`, and their elements are usually homogeneous and are accessed by "
"iterating over the list."
msgstr
""
"Mimo e krotki mog wydawa si podobne do list, czsto s uywane w innych "
"sytuacjach i do innych celw. Krotki s :term:`niemutowalne <immutable>` i "
"zazwyczaj zawieraj heterogeniczne sekwencje elementw, do ktrych dostp "
"uzyskuje si przez rozpakowywanie (patrz pniej w tej sekcji) lub "
"indeksowanie (lub nawet przez atrybut w przypadku :func:`namedtuples "
"<collections.namedtuple>`). Listy s :term:`mutowalne <mutable>` i ich "
"elementy s zazwyczaj homogeniczne i dostp do nich uzyskuje si przez "
"iterowanie po licie."
msgid
""
"A special problem is the construction of tuples containing 0 or 1 items: the "
"syntax has some extra quirks to accommodate these. Empty tuples are "
"constructed by an empty pair of parentheses; a tuple with one item is "
"constructed by following a value with a comma (it is not sufficient to "
"enclose a single value in parentheses). Ugly, but effective. For example::"
msgstr
""
"Specjalnym problemem jest konstrukcja krotek zawierajcych 0 lub 1 element: "
"skadnia przewiduje na to kilka sposobw. Puste krotki mona konstruowa "
"pust par nawiasw; krotk z jednym elementem mona skonstruowa "
"umieszczajc przecinek za wartoci (nie wystarczy otoczy pojedynczej "
"wartoci nawiasami). Brzydkie, ale dziaa. Na przykad::"
msgid
""
"The statement ``t = 12345, 54321, 'hello!'`` is an example of *tuple "
"packing*: the values ``12345``, ``54321`` and ``'hello!'`` are packed "
"together in a tuple. The reverse operation is also possible::"
msgstr
""
"Instrukcja ``t = 12345, 54321, 'hello!'`` jest przykadem *pakowania "
"krotki*: wartoci ``12345``, ``54321`` i ``'hello!'`` s razem zapakowane w "
"krotk. Moliwa jest rwnie odwrotna operacja::"
msgid
""
"This is called, appropriately enough, *sequence unpacking* and works for any "
"sequence on the right-hand side. Sequence unpacking requires that there are "
"as many variables on the left side of the equals sign as there are elements "
"in the sequence. Note that multiple assignment is really just a combination "
"of tuple packing and sequence unpacking."
msgstr
""
"Takie co nazywane jest, odpowiednio, *rozpakowywaniem sekwencji*. Takie "
"rozpakowywanie wymaga, aby po lewej stronie znaku rwnoci byo tyle samo "
"zmiennych, ile jest elementw w sekwencji. Zauwacie, e wielokrotne "
"przypisanie jest kombinacj pakowania i rozpakowywania sekwencji."
msgid
"Sets"
msgstr
"Zbiory"
msgid
""
"Python also includes a data type for *sets*. A set is an unordered "
"collection with no duplicate elements. Basic uses include membership "
"testing and eliminating duplicate entries. Set objects also support "
"mathematical operations like union, intersection, difference, and symmetric "
"difference."
msgstr
""
"Python ma rwnie typ danych dla zbiorw. Zbir jest nieuporzdkowan "
"kolekcj bez zduplikowanych elementw. Podstawowe uycia to sprawdzenie "
"zawierania i eliminacja duplikatw. Obiekty zbiorw wspieraj te operacje "
"matematyczne jak suma, iloczyn, rnica i rnica symetryczna zbiorw."
msgid
""
"Curly braces or the :func:`set` function can be used to create sets. Note: "
"to create an empty set you have to use ``set()``, not ``{}``; the latter "
"creates an empty dictionary, a data structure that we discuss in the next "
"section."
msgstr
""
"Zbiory mona stworzy uywajc nawiasw klamrowych lub funkcji :func:`set`. "
"Uwaga: aby stworzy pusty zbir, musisz uy ``set()``, nie ``{}``; to "
"drugie tworzy pusty sownik, struktur danych, ktr omwimy w nastpnej "
"sekcji."
msgid
"Here is a brief demonstration::"
msgstr
"Poniej krtka demonstracja::"
msgid
""
"Similarly to :ref:`list comprehensions <tut-listcomps>`, set comprehensions "
"are also supported::"
msgstr
""
"Podobnie do :ref:`wyrae listowych <tut-listcomps>`, s wspierane rwnie "
"wyraenia zbiorw::"
msgid
"Dictionaries"
msgstr
"Sowniki"
msgid
""
"Another useful data type built into Python is the *dictionary* (see :ref:"
"`typesmapping`). Dictionaries are sometimes found in other languages as "
"
\"
associative memories
\"
or
\"
associative arrays
\"
. Unlike sequences, which "
"are indexed by a range of numbers, dictionaries are indexed by *keys*, which "
"can be any immutable type; strings and numbers can always be keys. Tuples "
"can be used as keys if they contain only strings, numbers, or tuples; if a "
"tuple contains any mutable object either directly or indirectly, it cannot "
"be used as a key. You can't use lists as keys, since lists can be modified "
"in place using index assignments, slice assignments, or methods like :meth:"
"`append` and :meth:`extend`."
msgstr
""
"Innym przydatnym typem danych wbudowanym w Pythona jest *sownik* (patrz :"
"ref:`typesmapping`). Sowniki w innych jzykach czasem wystpuj jako "
"pamici asocjacyjne albo tablice asocjacyjne. W przeciwiestwie do "
"sekwencji, ktre s indeksowane zakresem liczb, sowniki s indeksowane "
"przez *klucze*, ktre mog by dowolnym niemutowalnym typem; cigi znakw i "
"liczby zawsze mog by kluczami. Mona uy krotek, jeli zawieraj tylko "
"cigi znakw, liczby lub krotki; jeli krotka zawiera cho jeden mutowalny "
"obiekt, bezporednio lub porednio, nie mona jej uy jako klucza. Nie "
"moesz uywa list jako kluczy, jako e listy mog by modyfikowane w "
"miejscu przy uyciu przypisa do indeksu, przypisa do slice'w lub metod "
"jak :meth:`append` i :meth:`extend`."
msgid
""
"It is best to think of a dictionary as a set of *key: value* pairs, with the "
"requirement that the keys are unique (within one dictionary). A pair of "
"braces creates an empty dictionary: ``{}``. Placing a comma-separated list "
"of key:value pairs within the braces adds initial key:value pairs to the "
"dictionary; this is also the way dictionaries are written on output."
msgstr
""
"Najlepiej jest myle o sowniku jako zbiorze par *klucz: warto*, z "
"wymaganiem aby klucze byy unikalne (w obrbie jednego sownika). Para "
"nawiasw klamrowych tworzy pusty sownik: ``{}``. Umieszczenie listy par "
"klucz:warto rozdzielonych przecinkami dodaje pocztkowe pary do sownika; "
"w ten sposb rwnie sowniki s wypisywane na wyjciu."
msgid
""
"The main operations on a dictionary are storing a value with some key and "
"extracting the value given the key. It is also possible to delete a key:"
"value pair with ``del``. If you store using a key that is already in use, "
"the old value associated with that key is forgotten. It is an error to "
"extract a value using a non-existent key."
msgstr
""
"Gwnymi operacjami na sowniku s umieszczanie wartoci pod jakim kluczem "
"oraz wyciganie wartoci dla podanego klucza. Moliwe jest rwnie usunicie "
"pary klucz:warto przy uyciu ``del``. Jeli umiecisz warto uywajc "
"klucza, ktry ju jest w uyciu, stara warto powizana z tym kluczem "
"zostanie zapomniana. Prba wycignicia wartoci przy uyciu nieistniejcego "
"klucza zakoczy si bdem."
msgid
""
"Performing ``list(d)`` on a dictionary returns a list of all the keys used "
"in the dictionary, in insertion order (if you want it sorted, just use "
"``sorted(d)`` instead). To check whether a single key is in the dictionary, "
"use the :keyword:`in` keyword."
msgstr
""
"Wykonanie ``list(d)`` na sowniku zwraca list wszystkich kluczy uywanych w "
"sowniku, w kolejnoci wstawiania (jeli chcesz je posortowa, uyj "
"``sorted(d)``). Aby sprawdzi, czy pojedynczy klucz jest w sowniku, uyj "
"sowa kluczowego :keyword:`in`."
msgid
"Here is a small example using a dictionary::"
msgstr
"May przykad z uyciem sownika::"
msgid
""
"The :func:`dict` constructor builds dictionaries directly from sequences of "
"key-value pairs::"
msgstr
""
"Konstruktor :func:`dict` buduje sowniki bezporednio z sekwencji par klucz-"
"warto::"
msgid
""
"In addition, dict comprehensions can be used to create dictionaries from "
"arbitrary key and value expressions::"
msgstr
""
"Dodatkowo mona uy wyrae sownikowych to tworzenia sownikw z podanych "
"wyrae klucza i wartoci::"
msgid
""
"When the keys are simple strings, it is sometimes easier to specify pairs "
"using keyword arguments::"
msgstr
""
"Kiedy klucze s prostymi cigami znakw, czasem atwiej jest poda pary "
"uywajc argumentw nazwanych::"
msgid
"Looping Techniques"
msgstr
"Techniki ptli"
msgid
""
"When looping through dictionaries, the key and corresponding value can be "
"retrieved at the same time using the :meth:`items` method. ::"
msgstr
""
"Podczas iterowania po sownikach, klucz i odpowiadajc mu warto mona "
"pobra w tym samym czasie uywajc metody :meth:`items`. ::"
msgid
""
"When looping through a sequence, the position index and corresponding value "
"can be retrieved at the same time using the :func:`enumerate` function. ::"
msgstr
""
"Przy iterowaniu po sekwencji, indeks pozycyjny i odpowiadajc mu warto "
"mona pobra w tym samym czasie uywajc funkcji :func:`enumerate`. ::"
msgid
""
"To loop over two or more sequences at the same time, the entries can be "
"paired with the :func:`zip` function. ::"
msgstr
""
"Aby przeiterowa po dwch lub wicej sekwencjach w tym samym czasie, "
"elementy mog zosta zgrupowane funkcj :func:`zip`. ::"
msgid
""
"To loop over a sequence in reverse, first specify the sequence in a forward "
"direction and then call the :func:`reversed` function. ::"
msgstr
""
"Aby przeiterowa po sekwencji od koca, najpierw okrel sekwencj w kierunku "
"do przodu a nastpnie wywoaj funkcj :func:`reversed`. ::"
msgid
""
"To loop over a sequence in sorted order, use the :func:`sorted` function "
"which returns a new sorted list while leaving the source unaltered. ::"
msgstr
""
"Aby przeiterowa po sekwencji w posortowanej kolejnoci, uyj funkcji :func:"
"`sorted`, ktra zwraca now posortowan list pozostawiajc list rdow "
"niezmienion. ::"
msgid
""
"It is sometimes tempting to change a list while you are looping over it; "
"however, it is often simpler and safer to create a new list instead. ::"
msgstr
""
"Czasem kusi, eby zmieni list podczas iterowania po niej; jednak czsto "
"prociej i bezpieczniej jest stworzy now list. ::"
msgid
"More on Conditions"
msgstr
"Wicej na temat warunkw"
msgid
""
"The conditions used in ``while`` and ``if`` statements can contain any "
"operators, not just comparisons."
msgstr
""
"Warunki uyte w instrukcjach ``while`` i ``if`` mog zawiera dowolne "
"operatory, nie tylko porwnania."
msgid
""
"The comparison operators ``in`` and ``not in`` check whether a value occurs "
"(does not occur) in a sequence. The operators ``is`` and ``is not`` compare "
"whether two objects are really the same object; this only matters for "
"mutable objects like lists. All comparison operators have the same "
"priority, which is lower than that of all numerical operators."
msgstr
""
msgid
""
"Comparisons can be chained. For example, ``a < b == c`` tests whether ``a`` "
"is less than ``b`` and moreover ``b`` equals ``c``."
msgstr
""
"Porwnania mog by ukadane w acuchy. Na przykad ``a < b == c`` "
"sprawdza, czy ``a`` jest mniejsze od ``b`` i ponadto czy ``b`` rwna si "
"``c``."
msgid
""
"Comparisons may be combined using the Boolean operators ``and`` and ``or``, "
"and the outcome of a comparison (or of any other Boolean expression) may be "
"negated with ``not``. These have lower priorities than comparison "
"operators; between them, ``not`` has the highest priority and ``or`` the "
"lowest, so that ``A and not B or C`` is equivalent to ``(A and (not B)) or "
"C``. As always, parentheses can be used to express the desired composition."
msgstr
""
"Porwnania mona czy uywajc operatorw boolowskich ``and`` i ``or``. "
"Wynik porwnania (lub jakiegokolwiek innego wyraenia boolowskiego) mona "
"zanegowa uywajc ``not``. Operatory te maj mniejszy priorytet ni "
"operatory porwnania; wrd nich ``not`` ma najwyszy priorytet a ``or`` "
"najniszy, wic ``A and not B or C`` jest ekwiwalentem ``(A and (not B)) or "
"C``. Jak zwykle mona uy nawiasw, aby wyrazi podan kolejno "
"kompozycji wyraenia."
msgid
""
"The Boolean operators ``and`` and ``or`` are so-called *short-circuit* "
"operators: their arguments are evaluated from left to right, and evaluation "
"stops as soon as the outcome is determined. For example, if ``A`` and ``C`` "
"are true but ``B`` is false, ``A and B and C`` does not evaluate the "
"expression ``C``. When used as a general value and not as a Boolean, the "
"return value of a short-circuit operator is the last evaluated argument."
msgstr
""
"Argumenty operatorw boolowskich ``and`` i ``or`` s ewaluowane od lewej do "
"prawej. Ewaluacja koczy si w momencie ustalenia wyniku. Na przykad, jeli "
"``A`` i ``C`` s prawd, ale ``B`` jest faszem, ``A and B and C`` nie "
"zewaluuje wyraenia ``C``. Przy uyciu oglnej wartoci, nie jako boolean, "
"warto zwracana tych operatorw to ostatnio ewaluowany argument."
msgid
""
"It is possible to assign the result of a comparison or other Boolean "
"expression to a variable. For example, ::"
msgstr
""
"Da si przypisa wynik porwnania lub inne wyraenie boolowskie do zmiennej. "
"Na przykad, ::"
msgid
""
"Note that in Python, unlike C, assignment inside expressions must be done "
"explicitly with the :ref:`walrus operator <why-can-t-i-use-an-assignment-in-"
"an-expression>` ``:=``. This avoids a common class of problems encountered "
"in C programs: typing ``=`` in an expression when ``==`` was intended."
msgstr
""
"Zwr uwag, e w Pythonie, w przeciwiestwie do C, przypisanie wewntrz "
"wyrae musi by wyraone bezporednio przez uycie :ref:`walrus operatora "
"<why-can-t-i-use-an-assignment-in-an-expression>` ``:=``. W ten sposb "
"unikamy powszechnej klasy problemw spotykanych w programach C: wpisywania "
"``=`` w wyraeniu, gdy miao si intencj wpisa ``==``."
msgid
"Comparing Sequences and Other Types"
msgstr
"Porwnywanie sekwencji i innych typw"
msgid
""
"Sequence objects typically may be compared to other objects with the same "
"sequence type. The comparison uses *lexicographical* ordering: first the "
"first two items are compared, and if they differ this determines the outcome "
"of the comparison; if they are equal, the next two items are compared, and "
"so on, until either sequence is exhausted. If two items to be compared are "
"themselves sequences of the same type, the lexicographical comparison is "
"carried out recursively. If all items of two sequences compare equal, the "
"sequences are considered equal. If one sequence is an initial sub-sequence "
"of the other, the shorter sequence is the smaller (lesser) one. "
"Lexicographical ordering for strings uses the Unicode code point number to "
"order individual characters. Some examples of comparisons between sequences "
"of the same type::"
msgstr
""
"Obiekty sekwencji zazwyczaj mog by porwnywane do innych obiektw, o tym "
"samym typie sekwencji. Porwnanie uywa porzdku *leksykograficznego*: "
"pierwszy albo pierwsze dwa elementy s porwnywane, i jeli si rni, to "
"determinuje wynik porwnania; jeli s rwne, nastpne dwa elementy s "
"porwnywane, i tak dalej, dopki ktra z sekwencji si nie skoczy. Jeli "
"dwa elementy do porwnania same s sekwencjami tego samego typu, porwnanie "
"leksykograficzne odbywa si rekursywnie. Jeli wszystkie elementy dwch "
"sekwencji s rwne, takie sekwencje s traktowane jako rwne. Jeli jedna "
"sekwencja jest pocztkow sub-sekwencj drugiej, ta krtsza sekwencja jest "
"mniejsz. Porzdek leksykograficzny cigw znakw uywa liczby tablicy "
"Unicode do wyznaczenia porzdku pojedynczych znakw. Niektre przykady "
"porwna pomidzy sekwencjami takiego samego typu::"
msgid
""
"Note that comparing objects of different types with ``<`` or ``>`` is legal "
"provided that the objects have appropriate comparison methods. For example, "
"mixed numeric types are compared according to their numeric value, so 0 "
"equals 0.0, etc. Otherwise, rather than providing an arbitrary ordering, "
"the interpreter will raise a :exc:`TypeError` exception."
msgstr
""
"Zwr uwag, e porwnywanie obiektw innych typw przy uyciu ``<`` lub "
"``>`` jest dozwolone pod warunkiem, e te obiekty maj odpowiednie metody "
"porwna. Na przykad mieszane typy numeryczne s porwnywane w oparciu o "
"ich warto numeryczn, tak e 0 rwna si 0.0 i tak dalej. W innych "
"przypadkach, zamiast zwraca arbitralny porzdek, interpreter zgosi "
"wyjtek :exc:`TypeError`."
msgid
"Footnotes"
msgstr
"Przypisy"
msgid
""
"Other languages may return the mutated object, which allows method chaining, "
"such as ``d->insert(
\"
a
\"
)->remove(
\"
b
\"
)->sort();``."
msgstr
""
"Inne jzyki mog zwraca zmieniony obiekt, co pozwala na acuchowanie "
"metod, na przykad ``d->insert(
\"
a
\"
)->remove(
\"
b
\"
)->sort();``."
Footer
© 2026 GitHub, Inc.
Footer navigation
Terms
Privacy
Security
Status
Community
Docs
Contact
Manage cookies
Do not share my personal information
You cant perform that action at this time.
Web Proxy Viewer |
New URL
|
Original Page