-
-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathdatastructures.po
More file actions
1534 lines (1407 loc) · 57.7 KB
/
datastructures.po
File metadata and controls
1534 lines (1407 loc) · 57.7 KB
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
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
# SOME DESCRIPTIVE TITLE.
# Copyright (C) 2001 Python Software Foundation
# This file is distributed under the same license as the Python package.
# FIRST AUTHOR <EMAIL@ADDRESS>, YEAR.
#
# Translators:
# python-doc bot, 2025
#
#, fuzzy
msgid ""
msgstr ""
"Project-Id-Version: Python 3.14\n"
"Report-Msgid-Bugs-To: \n"
"POT-Creation-Date: 2026-03-17 14:51+0000\n"
"PO-Revision-Date: 2025-09-16 00:02+0000\n"
"Last-Translator: python-doc bot, 2025\n"
"Language-Team: Swedish (https://app.transifex.com/python-doc/teams/5390/sv/)\n"
"Language: sv\n"
"MIME-Version: 1.0\n"
"Content-Type: text/plain; charset=UTF-8\n"
"Content-Transfer-Encoding: 8bit\n"
"Plural-Forms: nplurals=2; plural=(n != 1);\n"
#: ../../tutorial/datastructures.rst:5
msgid "Data Structures"
msgstr "Datastrukturer"
#: ../../tutorial/datastructures.rst:7
msgid ""
"This chapter describes some things you've learned about already in more "
"detail, and adds some new things as well."
msgstr ""
"I det här kapitlet beskrivs vissa saker som du redan har lärt dig mer "
"ingående, och några nya saker läggs till."
#: ../../tutorial/datastructures.rst:13
msgid "More on Lists"
msgstr "Mer om listor"
#: ../../tutorial/datastructures.rst:15
msgid ""
"The :ref:`list <typesseq-list>` data type has some more methods. Here are "
"all of the methods of list objects:"
msgstr ""
"Datatypen :ref:`list <typesseq-list>` har några fler metoder. Här är alla "
"metoder för listobjekt:"
#: ../../tutorial/datastructures.rst:21
msgid "Add an item to the end of the list. Similar to ``a[len(a):] = [x]``."
msgstr ""
"Lägger till ett objekt i slutet av listan. Liknar ``a[len(a):] = [x]``."
#: ../../tutorial/datastructures.rst:27
msgid ""
"Extend the list by appending all the items from the iterable. Similar to "
"``a[len(a):] = iterable``."
msgstr ""
"Förläng listan genom att lägga till alla objekt från iterabeln. Liknar "
"``a[len(a):] = iterabel``."
#: ../../tutorial/datastructures.rst:34
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 ""
"Infoga ett element på en given position. Det första argumentet är indexet "
"för det element som ska infogas före, så ``a.insert(0, x)`` infogar längst "
"fram i listan, och ``a.insert(len(a), x)`` är likvärdigt med "
"``a.append(x)``."
#: ../../tutorial/datastructures.rst:42
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 ""
"Tar bort det första objektet från listan vars värde är lika med *x*. Det "
"ger upphov till ett :exc:`ValueError` om det inte finns något sådant objekt."
#: ../../tutorial/datastructures.rst:49
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. It raises an :exc:`IndexError` if the list is empty or the index is "
"outside the list range."
msgstr ""
"Tar bort objektet på den angivna positionen i listan och returnerar det. Om"
" inget index anges, tar ``a.pop()`` bort och returnerar det sista objektet i"
" listan. Den ger upphov till ett :exc:`IndexError` om listan är tom eller om"
" indexet ligger utanför listintervallet."
#: ../../tutorial/datastructures.rst:58
msgid "Remove all items from the list. Similar to ``del a[:]``."
msgstr "Ta bort alla objekt från listan. Påminner om ``del a[:]``."
#: ../../tutorial/datastructures.rst:64
msgid ""
"Return zero-based index of the first occurrence of *x* in the list. Raises a"
" :exc:`ValueError` if there is no such item."
msgstr ""
"Returnerar nollbaserat index för den första förekomsten av *x* i listan. "
"Utlöser ett :exc:`ValueError` om det inte finns något sådant objekt."
#: ../../tutorial/datastructures.rst:67
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 ""
"De valfria argumenten *start* och *end* tolkas som i slice-notationen och "
"används för att begränsa sökningen till en viss delsekvens av listan. Det "
"returnerade indexet beräknas i förhållande till början av den fullständiga "
"sekvensen i stället för argumentet *start*."
#: ../../tutorial/datastructures.rst:76
msgid "Return the number of times *x* appears in the list."
msgstr "Returnera antalet gånger *x* förekommer i listan."
#: ../../tutorial/datastructures.rst:82
msgid ""
"Sort the items of the list in place (the arguments can be used for sort "
"customization, see :func:`sorted` for their explanation)."
msgstr ""
"Sortera objekten i listan på plats (argumenten kan användas för att anpassa "
"sorteringen, se :func:`sorted` för deras förklaring)."
#: ../../tutorial/datastructures.rst:89
msgid "Reverse the elements of the list in place."
msgstr "Backa tillbaka elementen i listan på plats."
#: ../../tutorial/datastructures.rst:95
msgid "Return a shallow copy of the list. Similar to ``a[:]``."
msgstr "Returnerar en ytlig kopia av listan. Liknar ``a[:]``."
#: ../../tutorial/datastructures.rst:98
msgid "An example that uses most of the list methods::"
msgstr "Ett exempel som använder de flesta av listans metoder::"
#: ../../tutorial/datastructures.rst:100
msgid ""
">>> fruits = ['orange', 'apple', 'pear', 'banana', 'kiwi', 'apple', 'banana']\n"
">>> fruits.count('apple')\n"
"2\n"
">>> fruits.count('tangerine')\n"
"0\n"
">>> fruits.index('banana')\n"
"3\n"
">>> fruits.index('banana', 4) # Find next banana starting at position 4\n"
"6\n"
">>> fruits.reverse()\n"
">>> fruits\n"
"['banana', 'apple', 'kiwi', 'banana', 'pear', 'apple', 'orange']\n"
">>> fruits.append('grape')\n"
">>> fruits\n"
"['banana', 'apple', 'kiwi', 'banana', 'pear', 'apple', 'orange', 'grape']\n"
">>> fruits.sort()\n"
">>> fruits\n"
"['apple', 'apple', 'banana', 'banana', 'grape', 'kiwi', 'orange', 'pear']\n"
">>> fruits.pop()\n"
"'pear'"
msgstr ""
">>> fruits = ['orange', 'apple', 'pear', 'banana', 'kiwi', 'apple', 'banana']\n"
">>> fruits.count('apple')\n"
"2\n"
">>> fruits.count('tangerine')\n"
"0\n"
">>> fruits.index('banana')\n"
"3\n"
">>> fruits.index('banana', 4) # Find next banana starting at position 4\n"
"6\n"
">>> fruits.reverse()\n"
">>> fruits\n"
"['banana', 'apple', 'kiwi', 'banana', 'pear', 'apple', 'orange']\n"
">>> fruits.append('grape')\n"
">>> fruits\n"
"['banana', 'apple', 'kiwi', 'banana', 'pear', 'apple', 'orange', 'grape']\n"
">>> fruits.sort()\n"
">>> fruits\n"
"['apple', 'apple', 'banana', 'banana', 'grape', 'kiwi', 'orange', 'pear']\n"
">>> fruits.pop()\n"
"'pear'"
#: ../../tutorial/datastructures.rst:121
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``. [#]_ This is a design principle for all mutable data "
"structures in Python."
msgstr ""
"Du kanske har märkt att metoder som ``insert``, ``remove`` eller ``sort`` "
"som bara ändrar listan inte har något returvärde utskrivet - de returnerar "
"standardvärdet ``None``. [#]_ Detta är en designprincip för alla "
"föränderliga datastrukturer i Python."
#: ../../tutorial/datastructures.rst:126
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 ""
"En annan sak som du kanske märker är att inte alla data kan sorteras eller "
"jämföras. Till exempel sorterar inte ``[None, 'hello', 10]`` eftersom "
"heltal inte kan jämföras med strängar och ``None`` inte kan jämföras med "
"andra typer. Det finns också vissa typer som inte har någon definierad "
"ordningsrelation. Till exempel är ``3+4j < 5+7j`` inte en giltig "
"jämförelse."
#: ../../tutorial/datastructures.rst:137
msgid "Using Lists as Stacks"
msgstr "Använda listor som staplar"
#: ../../tutorial/datastructures.rst:142
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:`~list.append`. To retrieve "
"an item from the top of the stack, use :meth:`~list.pop` without an explicit"
" index. For example::"
msgstr ""
"Listmetoderna gör det mycket enkelt att använda en lista som en stapel, där "
"det sista elementet som läggs till är det första elementet som hämtas "
"(\"sist in, först ut\"). För att lägga till ett element överst i stapeln, "
"använd :meth:`~list.append`. För att hämta ett element från toppen av "
"stapeln, använd :meth:`~list.pop` utan ett explicit index. Till exempel::"
#: ../../tutorial/datastructures.rst:147
msgid ""
">>> stack = [3, 4, 5]\n"
">>> stack.append(6)\n"
">>> stack.append(7)\n"
">>> stack\n"
"[3, 4, 5, 6, 7]\n"
">>> stack.pop()\n"
"7\n"
">>> stack\n"
"[3, 4, 5, 6]\n"
">>> stack.pop()\n"
"6\n"
">>> stack.pop()\n"
"5\n"
">>> stack\n"
"[3, 4]"
msgstr ""
">>> stack = [3, 4, 5]\n"
">>> stack.append(6)\n"
">>> stack.append(7)\n"
">>> stack\n"
"[3, 4, 5, 6, 7]\n"
">>> stack.pop()\n"
"7\n"
">>> stack\n"
"[3, 4, 5, 6]\n"
">>> stack.pop()\n"
"6\n"
">>> stack.pop()\n"
"5\n"
">>> stack\n"
"[3, 4]"
#: ../../tutorial/datastructures.rst:167
msgid "Using Lists as Queues"
msgstr "Använda listor som köer"
#: ../../tutorial/datastructures.rst:171
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 ""
"Det är också möjligt att använda en lista som en kö, där det första "
"elementet som läggs till är det första elementet som hämtas (\"först in, "
"först ut\"); listor är dock inte effektiva för detta ändamål. Det går "
"snabbt att lägga till och ta bort element från slutet av en lista, men det "
"går långsamt att lägga till eller ta bort element från början av en lista "
"(eftersom alla andra element måste flyttas med ett)."
#: ../../tutorial/datastructures.rst:177
msgid ""
"To implement a queue, use :class:`collections.deque` which was designed to "
"have fast appends and pops from both ends. For example::"
msgstr ""
"För att implementera en kö, använd :class:`collections.deque` som är "
"utformad för att ha snabba appends och pops från båda ändar. Till exempel::"
#: ../../tutorial/datastructures.rst:180
msgid ""
">>> from collections import deque\n"
">>> queue = deque([\"Eric\", \"John\", \"Michael\"])\n"
">>> queue.append(\"Terry\") # Terry arrives\n"
">>> queue.append(\"Graham\") # Graham arrives\n"
">>> queue.popleft() # The first to arrive now leaves\n"
"'Eric'\n"
">>> queue.popleft() # The second to arrive now leaves\n"
"'John'\n"
">>> queue # Remaining queue in order of arrival\n"
"deque(['Michael', 'Terry', 'Graham'])"
msgstr ""
">>> from collections import deque\n"
">>> queue = deque([\"Eric\", \"John\", \"Michael\"])\n"
">>> queue.append(\"Terry\") # Terry arrives\n"
">>> queue.append(\"Graham\") # Graham arrives\n"
">>> queue.popleft() # The first to arrive now leaves\n"
"'Eric'\n"
">>> queue.popleft() # The second to arrive now leaves\n"
"'John'\n"
">>> queue # Remaining queue in order of arrival\n"
"deque(['Michael', 'Terry', 'Graham'])"
#: ../../tutorial/datastructures.rst:195
msgid "List Comprehensions"
msgstr "Listförståelse"
#: ../../tutorial/datastructures.rst:197
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 ger ett kortfattat sätt att skapa listor. Vanliga "
"tillämpningar är att skapa nya listor där varje element är resultatet av "
"vissa operationer som tillämpas på varje medlem i en annan sekvens eller "
"iterabel, eller att skapa en undersekvens av de element som uppfyller ett "
"visst villkor."
#: ../../tutorial/datastructures.rst:202
msgid "For example, assume we want to create a list of squares, like::"
msgstr ""
"Anta till exempel att vi vill skapa en lista med kvadrater, till exempel::"
#: ../../tutorial/datastructures.rst:204
msgid ""
">>> squares = []\n"
">>> for x in range(10):\n"
"... squares.append(x**2)\n"
"...\n"
">>> squares\n"
"[0, 1, 4, 9, 16, 25, 36, 49, 64, 81]"
msgstr ""
">>> squares = []\n"
">>> for x in range(10):\n"
"... squares.append(x**2)\n"
"...\n"
">>> squares\n"
"[0, 1, 4, 9, 16, 25, 36, 49, 64, 81]"
#: ../../tutorial/datastructures.rst:211
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 ""
"Observera att detta skapar (eller skriver över) en variabel med namnet ``x``"
" som fortfarande existerar efter att slingan har avslutats. Vi kan beräkna "
"listan med kvadrater utan några bieffekter med::"
#: ../../tutorial/datastructures.rst:215
msgid "squares = list(map(lambda x: x**2, range(10)))"
msgstr "squares = list(map(lambda x: x**2, range(10)))"
#: ../../tutorial/datastructures.rst:217
msgid "or, equivalently::"
msgstr "eller, på motsvarande sätt::"
#: ../../tutorial/datastructures.rst:219
msgid "squares = [x**2 for x in range(10)]"
msgstr "squares = [x**2 for x in range(10)]"
#: ../../tutorial/datastructures.rst:221
msgid "which is more concise and readable."
msgstr "som är mer kortfattad och läsbar."
#: ../../tutorial/datastructures.rst:223
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 ""
"En list comprehension består av parenteser som innehåller ett uttryck följt "
"av en :keyword:`!for`\\-klausul, sedan noll eller fler :keyword:`!for`\\- "
"eller :keyword:`!if`\\-klausuler. Resultatet blir en ny lista som är "
"resultatet av utvärderingen av uttrycket i kontexten av :keyword:`!for`\\- "
"och :keyword:`!if`\\-klausulerna som följer efter det. Till exempel "
"kombinerar denna listcomp elementen i två listor om de inte är lika::"
#: ../../tutorial/datastructures.rst:230
msgid ""
">>> [(x, y) for x in [1,2,3] for y in [3,1,4] if x != y]\n"
"[(1, 3), (1, 4), (2, 3), (2, 1), (2, 4), (3, 1), (3, 4)]"
msgstr ""
">>> [(x, y) for x in [1,2,3] for y in [3,1,4] if x != y]\n"
"[(1, 3), (1, 4), (2, 3), (2, 1), (2, 4), (3, 1), (3, 4)]"
#: ../../tutorial/datastructures.rst:233
msgid "and it's equivalent to::"
msgstr "och det är likvärdigt med::"
#: ../../tutorial/datastructures.rst:235
msgid ""
">>> combs = []\n"
">>> for x in [1,2,3]:\n"
"... for y in [3,1,4]:\n"
"... if x != y:\n"
"... combs.append((x, y))\n"
"...\n"
">>> combs\n"
"[(1, 3), (1, 4), (2, 3), (2, 1), (2, 4), (3, 1), (3, 4)]"
msgstr ""
">>> combs = []\n"
">>> for x in [1,2,3]:\n"
"... for y in [3,1,4]:\n"
"... if x != y:\n"
"... combs.append((x, y))\n"
"...\n"
">>> combs\n"
"[(1, 3), (1, 4), (2, 3), (2, 1), (2, 4), (3, 1), (3, 4)]"
#: ../../tutorial/datastructures.rst:244
msgid ""
"Note how the order of the :keyword:`for` and :keyword:`if` statements is the"
" same in both these snippets."
msgstr ""
"Observera att ordningen på :keyword:`for`\\- och :keyword:`if`\\-satserna är"
" densamma i båda dessa utdrag."
#: ../../tutorial/datastructures.rst:247
msgid ""
"If the expression is a tuple (e.g. the ``(x, y)`` in the previous example), "
"it must be parenthesized. ::"
msgstr ""
"Om uttrycket är en tupel (t.ex. ``(x, y)`` i föregående exempel) måste det "
"vara inom parentes. ::"
#: ../../tutorial/datastructures.rst:250
msgid ""
">>> vec = [-4, -2, 0, 2, 4]\n"
">>> # create a new list with the values doubled\n"
">>> [x*2 for x in vec]\n"
"[-8, -4, 0, 4, 8]\n"
">>> # filter the list to exclude negative numbers\n"
">>> [x for x in vec if x >= 0]\n"
"[0, 2, 4]\n"
">>> # apply a function to all the elements\n"
">>> [abs(x) for x in vec]\n"
"[4, 2, 0, 2, 4]\n"
">>> # call a method on each element\n"
">>> freshfruit = [' banana', ' loganberry ', 'passion fruit ']\n"
">>> [weapon.strip() for weapon in freshfruit]\n"
"['banana', 'loganberry', 'passion fruit']\n"
">>> # create a list of 2-tuples like (number, square)\n"
">>> [(x, x**2) for x in range(6)]\n"
"[(0, 0), (1, 1), (2, 4), (3, 9), (4, 16), (5, 25)]\n"
">>> # the tuple must be parenthesized, otherwise an error is raised\n"
">>> [x, x**2 for x in range(6)]\n"
" File \"<stdin>\", line 1\n"
" [x, x**2 for x in range(6)]\n"
" ^^^^^^^\n"
"SyntaxError: did you forget parentheses around the comprehension target?\n"
">>> # flatten a list using a listcomp with two 'for'\n"
">>> vec = [[1,2,3], [4,5,6], [7,8,9]]\n"
">>> [num for elem in vec for num in elem]\n"
"[1, 2, 3, 4, 5, 6, 7, 8, 9]"
msgstr ""
">>> vec = [-4, -2, 0, 2, 4]\n"
">>> # create a new list with the values doubled\n"
">>> [x*2 for x in vec]\n"
"[-8, -4, 0, 4, 8]\n"
">>> # filter the list to exclude negative numbers\n"
">>> [x for x in vec if x >= 0]\n"
"[0, 2, 4]\n"
">>> # apply a function to all the elements\n"
">>> [abs(x) for x in vec]\n"
"[4, 2, 0, 2, 4]\n"
">>> # call a method on each element\n"
">>> freshfruit = [' banana', ' loganberry ', 'passion fruit ']\n"
">>> [weapon.strip() for weapon in freshfruit]\n"
"['banana', 'loganberry', 'passion fruit']\n"
">>> # create a list of 2-tuples like (number, square)\n"
">>> [(x, x**2) for x in range(6)]\n"
"[(0, 0), (1, 1), (2, 4), (3, 9), (4, 16), (5, 25)]\n"
">>> # the tuple must be parenthesized, otherwise an error is raised\n"
">>> [x, x**2 for x in range(6)]\n"
" File \"<stdin>\", line 1\n"
" [x, x**2 for x in range(6)]\n"
" ^^^^^^^\n"
"SyntaxError: did you forget parentheses around the comprehension target?\n"
">>> # flatten a list using a listcomp with two 'for'\n"
">>> vec = [[1,2,3], [4,5,6], [7,8,9]]\n"
">>> [num for elem in vec for num in elem]\n"
"[1, 2, 3, 4, 5, 6, 7, 8, 9]"
#: ../../tutorial/datastructures.rst:278
msgid ""
"List comprehensions can contain complex expressions and nested functions::"
msgstr ""
"Listförståelser kan innehålla komplexa uttryck och nästlade funktioner::"
#: ../../tutorial/datastructures.rst:280
msgid ""
">>> from math import pi\n"
">>> [str(round(pi, i)) for i in range(1, 6)]\n"
"['3.1', '3.14', '3.142', '3.1416', '3.14159']"
msgstr ""
">>> from math import pi\n"
">>> [str(round(pi, i)) for i in range(1, 6)]\n"
"['3.1', '3.14', '3.142', '3.1416', '3.14159']"
#: ../../tutorial/datastructures.rst:285
msgid "Nested List Comprehensions"
msgstr "Förståelse av nästlade listor"
#: ../../tutorial/datastructures.rst:287
msgid ""
"The initial expression in a list comprehension can be any arbitrary "
"expression, including another list comprehension."
msgstr ""
"Det första uttrycket i en listkomprehension kan vara vilket godtyckligt "
"uttryck som helst, inklusive en annan listkomprehension."
#: ../../tutorial/datastructures.rst:290
msgid ""
"Consider the following example of a 3x4 matrix implemented as a list of 3 "
"lists of length 4::"
msgstr ""
"Betrakta följande exempel på en 3x4-matris som implementerats som en lista "
"med 3 listor med längden 4::"
#: ../../tutorial/datastructures.rst:293
msgid ""
">>> matrix = [\n"
"... [1, 2, 3, 4],\n"
"... [5, 6, 7, 8],\n"
"... [9, 10, 11, 12],\n"
"... ]"
msgstr ""
">>> matrix = [\n"
"... [1, 2, 3, 4],\n"
"... [5, 6, 7, 8],\n"
"... [9, 10, 11, 12],\n"
"... ]"
#: ../../tutorial/datastructures.rst:299
msgid "The following list comprehension will transpose rows and columns::"
msgstr "Följande listförståelse kommer att transponera rader och kolumner::"
#: ../../tutorial/datastructures.rst:301
msgid ""
">>> [[row[i] for row in matrix] for i in range(4)]\n"
"[[1, 5, 9], [2, 6, 10], [3, 7, 11], [4, 8, 12]]"
msgstr ""
">>> [[row[i] for row in matrix] for i in range(4)]\n"
"[[1, 5, 9], [2, 6, 10], [3, 7, 11], [4, 8, 12]]"
#: ../../tutorial/datastructures.rst:304
msgid ""
"As we saw in the previous section, the inner list comprehension is evaluated"
" in the context of the :keyword:`for` that follows it, so this example is "
"equivalent to::"
msgstr ""
"Som vi såg i föregående avsnitt utvärderas den inre listförståelsen i "
"kontexten för det :keyword:`for` som följer efter den, så det här exemplet "
"är likvärdigt med::"
#: ../../tutorial/datastructures.rst:308
msgid ""
">>> transposed = []\n"
">>> for i in range(4):\n"
"... transposed.append([row[i] for row in matrix])\n"
"...\n"
">>> transposed\n"
"[[1, 5, 9], [2, 6, 10], [3, 7, 11], [4, 8, 12]]"
msgstr ""
">>> transposed = []\n"
">>> for i in range(4):\n"
"... transposed.append([row[i] for row in matrix])\n"
"...\n"
">>> transposed\n"
"[[1, 5, 9], [2, 6, 10], [3, 7, 11], [4, 8, 12]]"
#: ../../tutorial/datastructures.rst:315
msgid "which, in turn, is the same as::"
msgstr "vilket i sin tur är detsamma som::"
#: ../../tutorial/datastructures.rst:317
msgid ""
">>> transposed = []\n"
">>> for i in range(4):\n"
"... # the following 3 lines implement the nested listcomp\n"
"... transposed_row = []\n"
"... for row in matrix:\n"
"... transposed_row.append(row[i])\n"
"... transposed.append(transposed_row)\n"
"...\n"
">>> transposed\n"
"[[1, 5, 9], [2, 6, 10], [3, 7, 11], [4, 8, 12]]"
msgstr ""
">>> transposed = []\n"
">>> for i in range(4):\n"
"... # the following 3 lines implement the nested listcomp\n"
"... transposed_row = []\n"
"... for row in matrix:\n"
"... transposed_row.append(row[i])\n"
"... transposed.append(transposed_row)\n"
"...\n"
">>> transposed\n"
"[[1, 5, 9], [2, 6, 10], [3, 7, 11], [4, 8, 12]]"
#: ../../tutorial/datastructures.rst:328
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 ""
"I den verkliga världen bör du föredra inbyggda funktioner framför komplexa "
"flödesbeskrivningar. Funktionen :func:`zip` skulle göra ett bra jobb för "
"detta användningsfall::"
#: ../../tutorial/datastructures.rst:331
msgid ""
">>> list(zip(*matrix))\n"
"[(1, 5, 9), (2, 6, 10), (3, 7, 11), (4, 8, 12)]"
msgstr ""
">>> list(zip(*matrix))\n"
"[(1, 5, 9), (2, 6, 10), (3, 7, 11), (4, 8, 12)]"
#: ../../tutorial/datastructures.rst:334
msgid ""
"See :ref:`tut-unpacking-arguments` for details on the asterisk in this line."
msgstr ""
"Se :ref:`tut-unpacking-arguments` för detaljer om asterisken i den här "
"raden."
#: ../../tutorial/datastructures.rst:339
msgid "The :keyword:`!del` statement"
msgstr ":keyword:`!del`\\-satsen"
#: ../../tutorial/datastructures.rst:341
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:`~list.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 ""
"Det finns ett sätt att ta bort ett objekt från en lista genom att ange dess "
"index istället för dess värde: :keyword:`del` statement. Detta skiljer sig "
"från metoden :meth:`~list.pop` som returnerar ett värde. Satsen "
":keyword:`!del` kan också användas för att ta bort delar från en lista eller"
" rensa hela listan (vilket vi gjorde tidigare genom att tilldela en tom "
"lista till delen). Till exempel::"
#: ../../tutorial/datastructures.rst:347
msgid ""
">>> a = [-1, 1, 66.25, 333, 333, 1234.5]\n"
">>> del a[0]\n"
">>> a\n"
"[1, 66.25, 333, 333, 1234.5]\n"
">>> del a[2:4]\n"
">>> a\n"
"[1, 66.25, 1234.5]\n"
">>> del a[:]\n"
">>> a\n"
"[]"
msgstr ""
">>> a = [-1, 1, 66.25, 333, 333, 1234.5]\n"
">>> del a[0]\n"
">>> a\n"
"[1, 66.25, 333, 333, 1234.5]\n"
">>> del a[2:4]\n"
">>> a\n"
"[1, 66.25, 1234.5]\n"
">>> del a[:]\n"
">>> a\n"
"[]"
#: ../../tutorial/datastructures.rst:358
msgid ":keyword:`del` can also be used to delete entire variables::"
msgstr ":keyword:`del` kan också användas för att radera hela variabler::"
#: ../../tutorial/datastructures.rst:360
msgid ">>> del a"
msgstr ">>> del a"
#: ../../tutorial/datastructures.rst:362
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 ""
"Att referera till namnet ``a`` i fortsättningen är ett fel (åtminstone tills"
" ett annat värde tilldelas det). Vi kommer att hitta andra "
"användningsområden för :keyword:`del` senare."
#: ../../tutorial/datastructures.rst:369
msgid "Tuples and Sequences"
msgstr "Tupler och sekvenser"
#: ../../tutorial/datastructures.rst:371
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 ""
"Vi såg att listor och strängar har många gemensamma egenskaper, t.ex. "
"indexerings- och skivningsoperationer. De är två exempel på "
"*sekvens*-datatyper (se :ref:`typesseq`). Eftersom Python är ett språk "
"under utveckling kan andra sekvensdatatyper komma att läggas till. Det "
"finns också en annan standardsekvensdatatyp: *tuple*."
#: ../../tutorial/datastructures.rst:377
msgid ""
"A tuple consists of a number of values separated by commas, for instance::"
msgstr ""
"En tuple består av ett antal värden som separeras med kommatecken, till "
"exempel::"
#: ../../tutorial/datastructures.rst:379
msgid ""
">>> t = 12345, 54321, 'hello!'\n"
">>> t[0]\n"
"12345\n"
">>> t\n"
"(12345, 54321, 'hello!')\n"
">>> # Tuples may be nested:\n"
">>> u = t, (1, 2, 3, 4, 5)\n"
">>> u\n"
"((12345, 54321, 'hello!'), (1, 2, 3, 4, 5))\n"
">>> # Tuples are immutable:\n"
">>> t[0] = 88888\n"
"Traceback (most recent call last):\n"
" File \"<stdin>\", line 1, in <module>\n"
"TypeError: 'tuple' object does not support item assignment\n"
">>> # but they can contain mutable objects:\n"
">>> v = ([1, 2, 3], [3, 2, 1])\n"
">>> v\n"
"([1, 2, 3], [3, 2, 1])"
msgstr ""
">>> t = 12345, 54321, 'hello!'\n"
">>> t[0]\n"
"12345\n"
">>> t\n"
"(12345, 54321, 'hello!')\n"
">>> # Tuples may be nested:\n"
">>> u = t, (1, 2, 3, 4, 5)\n"
">>> u\n"
"((12345, 54321, 'hello!'), (1, 2, 3, 4, 5))\n"
">>> # Tuples are immutable:\n"
">>> t[0] = 88888\n"
"Traceback (most recent call last):\n"
" File \"<stdin>\", line 1, in <module>\n"
"TypeError: 'tuple' object does not support item assignment\n"
">>> # but they can contain mutable objects:\n"
">>> v = ([1, 2, 3], [3, 2, 1])\n"
">>> v\n"
"([1, 2, 3], [3, 2, 1])"
#: ../../tutorial/datastructures.rst:399
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 ""
"Som du ser är tupler alltid inneslutna i parenteser vid utmatning, så att "
"nästlade tupler tolkas korrekt; de kan matas in med eller utan omgivande "
"parenteser, även om parenteser ofta är nödvändiga ändå (om tupeln är en del "
"av ett större uttryck). Det är inte möjligt att tilldela de enskilda "
"objekten i en tupel, men det är möjligt att skapa tuplar som innehåller "
"föränderliga objekt, t.ex. listor."
#: ../../tutorial/datastructures.rst:406
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 ""
"Även om tupler kan tyckas likna listor används de ofta i olika situationer "
"och för olika syften. Tuples är :term:`immutable`, och innehåller vanligtvis"
" en heterogen sekvens av element som nås via uppackning (se senare i detta "
"avsnitt) eller indexering (eller till och med via attribut i fallet "
":func:`namedtuples <collections.namedtuple>`). Listor är :term:`mutable`, "
"och deras element är vanligtvis homogena och nås genom att iterera över "
"listan."
#: ../../tutorial/datastructures.rst:414
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 ""
"Ett speciellt problem är konstruktionen av tupler som innehåller 0 eller 1 "
"objekt: syntaxen har några extra finesser för att hantera dessa. Tomma "
"tupler konstrueras med ett tomt par parenteser; en tupel med ett objekt "
"konstrueras genom att följa ett värde med ett kommatecken (det räcker inte "
"att omsluta ett enda värde med parenteser). Fult, men effektivt. Till "
"exempel::"
#: ../../tutorial/datastructures.rst:420
msgid ""
">>> empty = ()\n"
">>> singleton = 'hello', # <-- note trailing comma\n"
">>> len(empty)\n"
"0\n"
">>> len(singleton)\n"
"1\n"
">>> singleton\n"
"('hello',)"
msgstr ""
">>> empty = ()\n"
">>> singleton = 'hello', # <-- note trailing comma\n"
">>> len(empty)\n"
"0\n"
">>> len(singleton)\n"
"1\n"
">>> singleton\n"
"('hello',)"
#: ../../tutorial/datastructures.rst:429
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 ""
"Satsen ``t = 12345, 54321, 'hello!'`` är ett exempel på *tuple packing*: "
"värdena ``12345``, ``54321`` och ``'hello!'`` packas ihop till en tuple. Den"
" omvända operationen är också möjlig::"
#: ../../tutorial/datastructures.rst:433
msgid ">>> x, y, z = t"
msgstr ">>> x, y, z = t"
#: ../../tutorial/datastructures.rst:435
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 ""
"Detta kallas, passande nog, *sequence unpacking* och fungerar för alla "
"sekvenser på höger sida. Sekvensuppackning kräver att det finns lika många "
"variabler på vänster sida om likhetstecknet som det finns element i "
"sekvensen. Observera att multipel tilldelning egentligen bara är en "
"kombination av tupelpackning och sekvensuppackning."
#: ../../tutorial/datastructures.rst:445
msgid "Sets"
msgstr "Uppsättningar"
#: ../../tutorial/datastructures.rst:447
msgid ""
"Python also includes a data type for :ref:`sets <types-set>`. 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 innehåller också en datatyp för :ref:`sets <types-set>`. En set är "
"en oordnad samling utan duplicerade element. Grundläggande "
"användningsområden inkluderar medlemskapstestning och eliminering av "
"duplicerade poster. Set-objekt stöder också matematiska operationer som "
"union, intersektion, differens och symmetrisk differens."
#: ../../tutorial/datastructures.rst:453
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 ""
"Curly braces eller funktionen :func:`set` kan användas för att skapa "
"uppsättningar. Observera: för att skapa en tom uppsättning måste du använda"
" ``set()``, inte ``{}``; den senare skapar en tom ordbok, en datastruktur "
"som vi diskuterar i nästa avsnitt."
#: ../../tutorial/datastructures.rst:457
msgid ""
"Because sets are unordered, iterating over them or printing them can produce"
" the elements in a different order than you expect."
msgstr ""
"Eftersom set är oordnade kan iterering över dem eller utskrift av dem ge "
"elementen i en annan ordning än du förväntar dig."
#: ../../tutorial/datastructures.rst:460
msgid "Here is a brief demonstration::"
msgstr "Här är en kort demonstration::"
#: ../../tutorial/datastructures.rst:462
msgid ""
">>> basket = {'apple', 'orange', 'apple', 'pear', 'orange', 'banana'}\n"
">>> print(basket) # show that duplicates have been removed\n"
"{'orange', 'banana', 'pear', 'apple'}\n"
">>> 'orange' in basket # fast membership testing\n"
"True\n"
">>> 'crabgrass' in basket\n"
"False\n"
"\n"
">>> # Demonstrate set operations on unique letters from two words\n"
">>>\n"
">>> a = set('abracadabra')\n"
">>> b = set('alacazam')\n"
">>> a # unique letters in a\n"
"{'a', 'r', 'b', 'c', 'd'}\n"
">>> a - b # letters in a but not in b\n"
"{'r', 'd', 'b'}\n"
">>> a | b # letters in a or b or both\n"
"{'a', 'c', 'r', 'd', 'b', 'm', 'z', 'l'}\n"
">>> a & b # letters in both a and b\n"
"{'a', 'c'}\n"
">>> a ^ b # letters in a or b but not both\n"
"{'r', 'd', 'b', 'm', 'z', 'l'}"
msgstr ""
">>> basket = {'apple', 'orange', 'apple', 'pear', 'orange', 'banana'}\n"
">>> print(basket) # show that duplicates have been removed\n"
"{'orange', 'banana', 'pear', 'apple'}\n"
">>> 'orange' in basket # fast membership testing\n"
"True\n"
">>> 'crabgrass' in basket\n"
"False\n"
"\n"
">>> # Demonstrate set operations on unique letters from two words\n"
">>>\n"
">>> a = set('abracadabra')\n"
">>> b = set('alacazam')\n"
">>> a # unique letters in a\n"
"{'a', 'r', 'b', 'c', 'd'}\n"
">>> a - b # letters in a but not in b\n"
"{'r', 'd', 'b'}\n"
">>> a | b # letters in a or b or both\n"
"{'a', 'c', 'r', 'd', 'b', 'm', 'z', 'l'}\n"
">>> a & b # letters in both a and b\n"
"{'a', 'c'}\n"
">>> a ^ b # letters in a or b but not both\n"
"{'r', 'd', 'b', 'm', 'z', 'l'}"
#: ../../tutorial/datastructures.rst:485
msgid ""
"Similarly to :ref:`list comprehensions <tut-listcomps>`, set comprehensions "
"are also supported::"
msgstr ""
"På samma sätt som :ref:`listförståelse <tut-listcomps>`, stöds även "
"setförståelse::"
#: ../../tutorial/datastructures.rst:488
msgid ""
">>> a = {x for x in 'abracadabra' if x not in 'abc'}\n"
">>> a\n"
"{'r', 'd'}"
msgstr ""
">>> a = {x for x in 'abracadabra' if x not in 'abc'}\n"
">>> a\n"
"{'r', 'd'}"
#: ../../tutorial/datastructures.rst:496
msgid "Dictionaries"
msgstr "Ordböcker"
#: ../../tutorial/datastructures.rst:498
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:`~list.append` and :meth:`~list.extend`."
msgstr ""
"En annan användbar datatyp som är inbyggd i Python är *ordboken* (se "
":ref:`typesmapping`). Ordböcker finns ibland i andra språk som \"associativa"
" minnen\" eller \"associativa matriser\". Till skillnad från sekvenser, som"
" indexeras av ett talområde, indexeras ordböcker av *nycklar*, som kan vara "
"vilken oföränderlig typ som helst; strängar och tal kan alltid vara nycklar."
" Tupler kan användas som nycklar om de bara innehåller strängar, tal eller "
"tupler; om en tupel innehåller något föränderligt objekt, antingen direkt "
"eller indirekt, kan den inte användas som nyckel. Du kan inte använda listor"
" som nycklar eftersom listor kan modifieras på plats med hjälp av "
"indextilldelningar, slice-tilldelningar eller metoder som "
":meth:`~list.append` och :meth:`~list.extend`."