-
-
Notifications
You must be signed in to change notification settings - Fork 27
Expand file tree
/
Copy pathdatastructures.po
More file actions
1068 lines (941 loc) · 39.5 KB
/
datastructures.po
File metadata and controls
1068 lines (941 loc) · 39.5 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
# Hengky Kurniawan, 2025
#
#, fuzzy
msgid ""
msgstr ""
"Project-Id-Version: Python 3.14\n"
"Report-Msgid-Bugs-To: \n"
"POT-Creation-Date: 2026-03-27 14:44+0000\n"
"PO-Revision-Date: 2025-09-16 00:02+0000\n"
"Last-Translator: Hengky Kurniawan, 2025\n"
"Language-Team: Indonesian (https://app.transifex.com/python-doc/teams/5390/"
"id/)\n"
"MIME-Version: 1.0\n"
"Content-Type: text/plain; charset=UTF-8\n"
"Content-Transfer-Encoding: 8bit\n"
"Language: id\n"
"Plural-Forms: nplurals=1; plural=0;\n"
msgid "Data Structures"
msgstr "Struktur Data"
msgid ""
"This chapter describes some things you've learned about already in more "
"detail, and adds some new things as well."
msgstr ""
"Bab ini menjelaskan beberapa hal yang telah Anda pelajari secara lebih "
"rinci, dan menambahkan beberapa hal baru juga."
msgid "More on Lists"
msgstr "Lebih Lanjut tentang Daftar *Lists*"
msgid ""
"The :ref:`list <typesseq-list>` data type has some more methods. Here are "
"all of the methods of list objects:"
msgstr ""
msgid "Add an item to the end of the list. Similar to ``a[len(a):] = [x]``."
msgstr ""
msgid ""
"Extend the list by appending all the items from the iterable. Similar to "
"``a[len(a):] = iterable``."
msgstr ""
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 ""
"Masukkan item pada posisi tertentu. Argumen pertama adalah indeks elemen "
"sebelum memasukkan, jadi ``a.insert(0, x)`` memasukkan di bagian depan "
"daftar *list*, dan ``a.insert(len(a), x)`` sama dengan ``a.append(x)``."
msgid ""
"Remove the first item from the list whose value is equal to *value*. It "
"raises a :exc:`ValueError` if there is no such item."
msgstr ""
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 ""
msgid "Remove all items from the list. Similar to ``del a[:]``."
msgstr ""
msgid ""
"Return zero-based index of the first occurrence of *value* in the list. "
"Raises a :exc:`ValueError` if there is no such item."
msgstr ""
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 ""
"Argumen opsional *start* dan *end* ditafsirkan seperti dalam notasi *slice* "
"dan digunakan untuk membatasi pencarian ke urutan tertentu dari daftar. "
"Indeks yang dikembalikan dihitung relatif terhadap awal urutan penuh "
"daripada argumen *start*."
msgid "Return the number of times *value* appears in the list."
msgstr ""
msgid ""
"Sort the items of the list in place (the arguments can be used for sort "
"customization, see :func:`sorted` for their explanation)."
msgstr ""
"Urutkan item daftar di tempat (argumen dapat digunakan untuk mengurutkan "
"ubahsuaian *customization*, lihat :func:`sorted` untuk penjelasannya)."
msgid "Reverse the elements of the list in place."
msgstr "Balikkan elemen daftar *list* di tempatnya."
msgid "Return a shallow copy of the list. Similar to ``a[:]``."
msgstr ""
msgid "An example that uses most of the list methods::"
msgstr "Contoh yang menggunakan sebagian besar metode daftar *list*::"
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 ""
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 ""
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 ""
msgid "Using Lists as Stacks"
msgstr "Menggunakan Daftar *Lists* sebagai Tumpukan *Stacks*"
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 ""
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 ""
msgid "Using Lists as Queues"
msgstr "Menggunakan Daftar *Lists* sebagai Antrian *Queues*"
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 ""
"Dimungkinkan juga untuk menggunakan daftar sebagai antrian, di mana elemen "
"pertama yang ditambahkan adalah elemen pertama yang diambil (\"first-in, "
"first-out\"); namun, daftar tidak efisien untuk tujuan ini. Sementara "
"menambahkan dan muncul dari akhir daftar cepat, melakukan memasukkan atau "
"muncul dari awal daftar lambat (karena semua elemen lain harus digeser satu)."
msgid ""
"To implement a queue, use :class:`collections.deque` which was designed to "
"have fast appends and pops from both ends. For example::"
msgstr ""
"Untuk mengimplementasikan antrian, gunakan :class:`collections.deque` yang "
"dirancang untuk menambahkan dan muncul dengan cepat dari kedua ujungnya. "
"Sebagai contoh::"
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 ""
msgid "List Comprehensions"
msgstr "Daftar *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 ""
"Pemahaman daftar *list comprehensions* menyediakan cara singkat untuk "
"membuat daftar. Aplikasi umum adalah membuat daftar baru di mana setiap "
"elemen adalah hasil dari beberapa operasi yang diterapkan pada setiap "
"anggota dari urutan lain atau *iterable*, atau untuk membuat urutan elemen-"
"elemen yang memenuhi kondisi tertentu."
msgid "For example, assume we want to create a list of squares, like::"
msgstr "Misalnya, anggap kita ingin membuat daftar kotak, seperti::"
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 ""
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 ""
"Perhatikan bahwa ini membuat (atau menimpa) variabel bernama ``x`` yang "
"masih ada setelah loop selesai. Kami dapat menghitung daftar kotak tanpa "
"efek samping menggunakan::"
msgid "squares = list(map(lambda x: x**2, range(10)))"
msgstr ""
msgid "or, equivalently::"
msgstr "atau, dengan kata lain::"
msgid "squares = [x**2 for x in range(10)]"
msgstr ""
msgid "which is more concise and readable."
msgstr "yang lebih ringkas dan mudah dibaca."
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 ""
"Pemahaman daftar *list comprehension* terdiri dari tanda kurung yang berisi "
"ekspresi diikuti oleh klausa :keyword:`!for`, lalu nol atau lebih klausa :"
"keyword:`!for` atau :keyword:`!if`. Hasilnya akan menjadi daftar baru yang "
"dihasilkan dari mengevaluasi ekspresi dalam konteks dari klausa :keyword:`!"
"for` dan :keyword:`!if` yang mengikutinya. Sebagai contoh, *listcomp* ini "
"menggabungkan elemen dari dua daftar jika tidak sama::"
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 ""
msgid "and it's equivalent to::"
msgstr "dan itu setara dengan::"
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 ""
msgid ""
"Note how the order of the :keyword:`for` and :keyword:`if` statements is the "
"same in both these snippets."
msgstr ""
"Perhatikan bagaimana urutan pernyataan :keyword:`for` dan :keyword:`if` "
"adalah sama di kedua cuplikan ini."
msgid ""
"If the expression is a tuple (e.g. the ``(x, y)`` in the previous example), "
"it must be parenthesized. ::"
msgstr ""
"Jika ekspresi adalah tuple (mis. ``(x, y)`` dalam contoh sebelumnya), "
"ekspresi tersebut harus diberi kurung. ::"
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 ""
msgid ""
"List comprehensions can contain complex expressions and nested functions::"
msgstr ""
"Pemahaman daftar *list comprehensions* dapat berisi ekspresi kompleks dan "
"fungsi bersarang::"
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 ""
msgid "Nested List Comprehensions"
msgstr "Pemahaman Daftar *List Comprehensions* Bersarang"
msgid ""
"The initial expression in a list comprehension can be any arbitrary "
"expression, including another list comprehension."
msgstr ""
"Ekspresi awal dalam pemahaman daftar *list comprehension* dapat berupa "
"ekspresi acak *arbitrary*, termasuk pemahaman daftar *list comprehension* "
"lainnya."
msgid ""
"Consider the following example of a 3x4 matrix implemented as a list of 3 "
"lists of length 4::"
msgstr ""
"Perhatikan contoh matriks 3x4 berikut yang diimplementasikan sebagai daftar "
"*list* 3 dari daftar *list* panjang 4 ::"
msgid ""
">>> matrix = [\n"
"... [1, 2, 3, 4],\n"
"... [5, 6, 7, 8],\n"
"... [9, 10, 11, 12],\n"
"... ]"
msgstr ""
msgid "The following list comprehension will transpose rows and columns::"
msgstr ""
"Pemahaman daftar *list comprehension* berikut akan mengubah baris dan kolom::"
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 ""
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 ""
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 ""
msgid "which, in turn, is the same as::"
msgstr "yang, pada gilirannya, sama dengan::"
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 ""
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 ""
"Di dunia nyata, Anda harus memilih fungsi bawaan untuk pernyataan aliran "
"*flow* yang kompleks. Fungsi :func:`zip` akan melakukan pekerjaan yang baik "
"untuk kasus penggunaan ini::"
msgid ""
">>> list(zip(*matrix))\n"
"[(1, 5, 9), (2, 6, 10), (3, 7, 11), (4, 8, 12)]"
msgstr ""
msgid ""
"See :ref:`tut-unpacking-arguments` for details on the asterisk in this line."
msgstr ""
"Lihat :ref:`tut-unpacking-arguments` untuk detail tentang tanda bintang "
"*asterisk* di baris ini."
msgid "The :keyword:`!del` statement"
msgstr "Pernyataan :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:`~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 ""
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 ""
msgid ":keyword:`del` can also be used to delete entire variables::"
msgstr ":keyword:`del` juga dapat digunakan untuk menghapus seluruh variabel::"
msgid ">>> del a"
msgstr ""
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 ""
"Merujuk nama ``a`` selanjutnya adalah kesalahan (setidaknya sampai nilai "
"lain ditetapkan untuknya). Kita akan menemukan kegunaan lain untuk :keyword:"
"`del` nanti."
msgid "Tuples and Sequences"
msgstr "Tuples and *Urutan* Sequences"
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 ""
"Kita melihat bahwa daftar *list* dan string memiliki banyak properti yang "
"sama, seperti operasi pengindeksan dan pemotongan. Mereka adalah dua contoh "
"tipe data *sequence* (lihat :ref:`typesseq`). Karena Python adalah bahasa "
"yang berkembang, tipe data urutan lainnya dapat ditambahkan. Ada juga tipe "
"data urutan standar lain: *tuple*."
msgid ""
"A tuple consists of a number of values separated by commas, for instance::"
msgstr ""
"Sebuah *tuple* terdiri dari sejumlah nilai yang dipisahkan oleh koma, "
"misalnya::"
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 ""
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 ""
"Seperti yang Anda lihat, pada *tuple* keluaran selalu tertutup dalam tanda "
"kurung, sehingga *tuple* bersarang *nester* ditafsirkan dengan benar; mereka "
"mungkin dimasukkan dengan atau tanpa tanda kurung di sekitarnya, meskipun "
"seringkali tanda kurung diperlukan pula (jika tuple adalah bagian dari "
"ekspresi yang lebih besar). Tidak mungkin untuk memberikan nilai ke masing-"
"masing item *tuple*, namun dimungkinkan untuk membuat tuple yang berisi "
"objek yang bisa berubah *mutable*, seperti daftar."
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 ""
"Meskipun *tuple* mungkin mirip dengan daftar, *tuple* sering digunakan dalam "
"situasi yang berbeda dan untuk tujuan yang berbeda. *Tuples* adalah :term:"
"`immutable`, dan biasanya berisi urutan elemen yang heterogen yang diakses "
"melalui *unpacking* (lihat nanti di bagian ini) atau pengindeksan (atau "
"bahkan berdasarkan atribut dalam kasus <collections.namedtuple>`). Daftar "
"adalah :term:`mutable`, dan elemen-elemennya biasanya homogen dan diakses "
"dengan menyusuri *iterating* daftar *list*."
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 ""
"Masalah khusus adalah pembangunan *tuple* yang mengandung 0 atau 1 item: "
"sintaksis memiliki beberapa kebiasaan *quirks* tambahan untuk mengakomodasi "
"ini. *Tuple* kosong dibangun oleh sepasang kurung kosong; tupel dengan satu "
"item dikonstruksi dengan mengikuti nilai dengan koma (tidak cukup untuk "
"menyertakan nilai tunggal dalam tanda kurung). Jelek, tapi efektif. Sebagai "
"contoh::"
msgid ""
">>> empty = ()\n"
">>> singleton = 'hello', # <-- note trailing comma\n"
">>> len(empty)\n"
"0\n"
">>> len(singleton)\n"
"1\n"
">>> singleton\n"
"('hello',)"
msgstr ""
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 ""
"Pernyataan ``t = 12345, 54321, 'hello!'`` Adalah contoh dari *tuple "
"packing*: nilainya ``12345``, ``54321`` dan ``'hello!'`` Dikemas bersama-"
"sama dalam *tuple*. Operasi terbalik juga dimungkinkan ::"
msgid ">>> x, y, z = t"
msgstr ""
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 ""
"Ini disebut, cukup tepat, urutan membongkar *sequence unpacking* dan "
"berfungsi untuk setiap urutan di sisi kanan. Urutan membongkar mensyaratkan "
"bahwa ada banyak variabel di sisi kiri tanda sama dengan ada elemen dalam "
"urutan. Perhatikan bahwa banyak tugas benar-benar hanya kombinasi dari "
"*tuple packing* dan urutan pembongkaran *sequence unpacking*."
msgid "Sets"
msgstr "Himpunan *Set*"
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 ""
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 ""
"Kurung kurawal atau fungsi :func:`set` dapat digunakan untuk membuat "
"himpunan. Catatan: untuk membuat himpunan kosong Anda harus menggunakan "
"``set()``, bukan ``{}``; yang terakhir itu membuat kamus *dictionary* "
"kosong, struktur data yang kita bahas di bagian selanjutnya."
msgid ""
"Because sets are unordered, iterating over them or printing them can produce "
"the elements in a different order than you expect."
msgstr ""
msgid "Here is a brief demonstration::"
msgstr "Berikut ini adalah demonstrasi singkat::"
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 ""
msgid ""
"Similarly to :ref:`list comprehensions <tut-listcomps>`, set comprehensions "
"are also supported::"
msgstr ""
"Seperti halnya untuk :ref:`list comprehensions <tut-listcomps>`, *set "
"comprehensions* juga didukung::"
msgid ""
">>> a = {x for x in 'abracadabra' if x not in 'abc'}\n"
">>> a\n"
"{'r', 'd'}"
msgstr ""
msgid "Dictionaries"
msgstr "Kamus *Dictionaries*"
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 ""
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 ""
"Sebaiknya pikirkan kamus *dictionary* sebagai satu set *key: value* "
"berpasangan, dengan persyaratan bahwa kunci tersebut unik (dalam satu kamus "
"*dictionary*). Sepasang kurung kurawal membuat kamus *dictionary* kosong: "
"``{}``. Menempatkan daftar pasangan kunci:nilai yang dipisah koma dalam "
"kurung menambahkan pasangan kunci:nilai ke kamus *dictionary*; ini juga cara "
"kamus *dictionary* ditulis pada keluaran."
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."
msgstr ""
msgid ""
"Extracting a value for a non-existent key by subscripting (``d[key]``) "
"raises a :exc:`KeyError`. To avoid getting this error when trying to access "
"a possibly non-existent key, use the :meth:`~dict.get` method instead, which "
"returns ``None`` (or a specified default value) if the key is not in the "
"dictionary."
msgstr ""
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 ""
"Melakukan ``list(d)`` pada kamus mengembalikan daftar *list* semua kunci "
"yang digunakan dalam kamus, dalam urutan penyisipan (jika Anda ingin "
"diurutkan, cukup gunakan ``sorted(d)`` sebagai gantinya). Untuk memeriksa "
"apakah ada satu kunci dalam kamus, gunakan kaca kunci :keyword:`in`."
msgid "Here is a small example using a dictionary::"
msgstr "Ini adalah contoh kecil menggunakan kamus *dictionary*::"
msgid ""
">>> tel = {'jack': 4098, 'sape': 4139}\n"
">>> tel['guido'] = 4127\n"
">>> tel\n"
"{'jack': 4098, 'sape': 4139, 'guido': 4127}\n"
">>> tel['jack']\n"
"4098\n"
">>> tel['irv']\n"
"Traceback (most recent call last):\n"
" File \"<stdin>\", line 1, in <module>\n"
"KeyError: 'irv'\n"
">>> print(tel.get('irv'))\n"
"None\n"
">>> del tel['sape']\n"
">>> tel['irv'] = 4127\n"
">>> tel\n"
"{'jack': 4098, 'guido': 4127, 'irv': 4127}\n"
">>> list(tel)\n"
"['jack', 'guido', 'irv']\n"
">>> sorted(tel)\n"
"['guido', 'irv', 'jack']\n"
">>> 'guido' in tel\n"
"True\n"
">>> 'jack' not in tel\n"
"False"
msgstr ""
msgid ""
"The :func:`dict` constructor builds dictionaries directly from sequences of "
"key-value pairs::"
msgstr ""
"Pembangun *constructor* :func:`dict` membangun kamus langsung dari urutan "
"pasangan kunci-nilai::"
msgid ""
">>> dict([('sape', 4139), ('guido', 4127), ('jack', 4098)])\n"
"{'sape': 4139, 'guido': 4127, 'jack': 4098}"
msgstr ""
msgid ""
"In addition, dict comprehensions can be used to create dictionaries from "
"arbitrary key and value expressions::"
msgstr ""
"Selain itu, pemahaman kamus *dict comprehensions* dapat digunakan untuk "
"membuat kamus *dictionary* dari ekspresi kunci dan nilai acak *arbitrary*::"
msgid ""
">>> {x: x**2 for x in (2, 4, 6)}\n"
"{2: 4, 4: 16, 6: 36}"
msgstr ""
msgid ""
"When the keys are simple strings, it is sometimes easier to specify pairs "
"using keyword arguments::"
msgstr ""
"Ketika kunci adalah string sederhana, kadang-kadang lebih mudah untuk "
"menentukan pasangan menggunakan argumen kata kunci *keyword arguments*::"
msgid ""
">>> dict(sape=4139, guido=4127, jack=4098)\n"
"{'sape': 4139, 'guido': 4127, 'jack': 4098}"
msgstr ""
msgid "Looping Techniques"
msgstr "Teknik Perulangan"
msgid ""
"When looping through dictionaries, the key and corresponding value can be "
"retrieved at the same time using the :meth:`~dict.items` method. ::"
msgstr ""
msgid ""
">>> knights = {'gallahad': 'the pure', 'robin': 'the brave'}\n"
">>> for k, v in knights.items():\n"
"... print(k, v)\n"
"...\n"
"gallahad the pure\n"
"robin the brave"
msgstr ""
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 ""
"Saat mengulang melalui urutan, indeks posisi dan nilai terkait dapat diambil "
"pada saat yang sama menggunakan fungsi :func:`enumerate`. ::"
msgid ""
">>> for i, v in enumerate(['tic', 'tac', 'toe']):\n"
"... print(i, v)\n"
"...\n"
"0 tic\n"
"1 tac\n"
"2 toe"
msgstr ""
msgid ""
"To loop over two or more sequences at the same time, the entries can be "
"paired with the :func:`zip` function. ::"
msgstr ""
"Untuk mengulang dua urutan atau lebih secara bersamaan, entri dapat "
"dipasangkan dengan fungsi :func:`zip`. ::"
msgid ""
">>> questions = ['name', 'quest', 'favorite color']\n"
">>> answers = ['lancelot', 'the holy grail', 'blue']\n"
">>> for q, a in zip(questions, answers):\n"
"... print('What is your {0}? It is {1}.'.format(q, a))\n"
"...\n"
"What is your name? It is lancelot.\n"
"What is your quest? It is the holy grail.\n"
"What is your favorite color? It is blue."
msgstr ""
msgid ""
"To loop over a sequence in reverse, first specify the sequence in a forward "
"direction and then call the :func:`reversed` function. ::"
msgstr ""
"Untuk mengulang urutan secara terbalik, pertama tentukan urutan dalam arah "
"maju dan kemudian panggil fungsi :func:`reversed`. ::"
msgid ""
">>> for i in reversed(range(1, 10, 2)):\n"
"... print(i)\n"
"...\n"
"9\n"
"7\n"
"5\n"
"3\n"
"1"
msgstr ""
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 ""
"Untuk mengulangi sebuah urutan *sequence* dalam susunan yang diurutkan, "
"gunakan fungsi :func:`sorted` yang mengembalikan daftar terurut baru dengan "
"membiarkan sumber tidak diubah. ::"
msgid ""
">>> basket = ['apple', 'orange', 'apple', 'pear', 'orange', 'banana']\n"
">>> for i in sorted(basket):\n"
"... print(i)\n"
"...\n"
"apple\n"
"apple\n"
"banana\n"
"orange\n"
"orange\n"
"pear"
msgstr ""
msgid ""
"Using :func:`set` on a sequence eliminates duplicate elements. The use of :"
"func:`sorted` in combination with :func:`set` over a sequence is an "
"idiomatic way to loop over unique elements of the sequence in sorted "
"order. ::"
msgstr ""
"Menggunakan :func:`set` pada sebuah urutan dapat menghilangkan elemen-elemen "
"yang duplikat. Penggunaan :func:`sorted` yang dikombinasikan dengan :func:"
"`set` terhadap sebuah urutan merupakan cara idiomatik untuk *loop* dari "
"elemen-elemen unik dari urutan yang diurutkan. ::"
msgid ""
">>> basket = ['apple', 'orange', 'apple', 'pear', 'orange', 'banana']\n"
">>> for f in sorted(set(basket)):\n"
"... print(f)\n"
"...\n"
"apple\n"
"banana\n"
"orange\n"
"pear"
msgstr ""
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 ""
"Terkadang tergoda untuk mengubah daftar *list* saat Anda mengulanginya; "
"namun, seringkali lebih mudah dan aman untuk membuat daftar *list* baru. ::"
msgid ""
">>> import math\n"
">>> raw_data = [56.2, float('NaN'), 51.7, 55.3, 52.5, float('NaN'), 47.8]\n"
">>> filtered_data = []\n"
">>> for value in raw_data:\n"
"... if not math.isnan(value):\n"
"... filtered_data.append(value)\n"
"...\n"
">>> filtered_data\n"
"[56.2, 51.7, 55.3, 52.5, 47.8]"
msgstr ""
msgid "More on Conditions"
msgstr "Lebih lanjut tentang Kondisi"
msgid ""
"The conditions used in ``while`` and ``if`` statements can contain any "
"operators, not just comparisons."
msgstr ""
"Kondisi yang digunakan dalam pernyataan ``while`` dan ``if`` dapat berisi "
"operator apa pun, bukan hanya perbandingan."
msgid ""
"The comparison operators ``in`` and ``not in`` are membership tests that "
"determine whether a value is in (or not in) a container. The operators "
"``is`` and ``is not`` compare whether two objects are really the same "
"object. 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 ""
"Perbandingan bisa dibuat berantai. Sebagai contoh, ``a < b == c`` menguji "
"apakah ``a`` kurang dari ``b`` dan apa ``b`` sama dengan ``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 ""
"Perbandingan dapat digabungkan menggunakan operator Boolean ``and`` dan "
"``or``, dan hasil perbandingan (atau ekspresi Boolean lainnya) dapat "
"dinegasikan dengan ``not``. Ini memiliki prioritas lebih rendah daripada "
"operator pembanding; di antara mereka, ``not`` memiliki prioritas tertinggi "
"dan ``or`` terendah, sehingga ``A and not B or C`` setara dengan ``(A and "
"(not B)) or C`` . Seperti biasa, tanda kurung dapat digunakan untuk "
"mengekspresikan komposisi yang diinginkan."
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 ""
"Operator Boolean ``and`` dan ``or`` disebut operator *short-circuit*: "
"argumen mereka dievaluasi dari kiri ke kanan, dan evaluasi berhenti segera "
"setelah hasilnya ditentukan. Misalnya, jika ``A`` dan ``C`` bernilai benar "
"tetapi ``B`` salah, ``A and B and C`` tidak mengevaluasi ekspresi ``C``. "
"Ketika digunakan sebagai nilai umum dan bukan sebagai Boolean, nilai "
"kembalian dari operator hubung singkat *short-circuit* adalah argumen "
"terakhir yang dievaluasi."
msgid ""
"It is possible to assign the result of a comparison or other Boolean "
"expression to a variable. For example, ::"
msgstr ""
"Dimungkinkan untuk menetapkan hasil perbandingan atau ekspresi Boolean "
"lainnya ke variabel. Sebagai contoh, ::"
msgid ""
">>> string1, string2, string3 = '', 'Trondheim', 'Hammer Dance'\n"
">>> non_null = string1 or string2 or string3\n"
">>> non_null\n"
"'Trondheim'"
msgstr ""
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."