FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
python-docs-ja/tutorial/datastructures.po at 3.13 · python/python-docs-ja · GitHub
python
python-docs-ja
Repository navigation
Code
Issues
1
(1)
Pull requests
Actions
Security and quality
Insights
Expand file tree
Breadcrumbs
python-docs-ja
/
tutorial
/
datastructures.po
Copy path
More file actions
More file actions
Latest commit
History
History
History
1482 lines (1357 loc) · 61 KB
Breadcrumbs
python-docs-ja
/
tutorial
/
datastructures.po
Copy path
File metadata and controls
1482 lines (1357 loc) · 61 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
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:
#
tomo, 2021
#
TENMYO Masakazu, 2024
#
Takanori Suzuki <takanori@takanory.net>, 2025
#
#,
fuzzy
msgid ""
msgstr ""
"
Project-Id-Version
:
Python 3.14\n
"
"
Report-Msgid-Bugs-To
:
\n
"
"
POT-Creation-Date
:
2025-05-09 14:19+0000\n
"
"
PO-Revision-Date
:
2021-06-28 01:50+0000\n
"
"
Last-Translator
:
Takanori Suzuki <takanori@takanory.net>, 2025\n
"
"
Language-Team
:
Japanese (https://app.transifex.com/python-doc/teams/5390/
"
"
ja/)\n
"
"
Language
:
ja\n
"
"
MIME-Version
:
1.0\n
"
"
Content-Type
:
text/plain; charset=UTF-8\n
"
"
Content-Transfer-Encoding
:
8bit\n
"
"
Plural-Forms
:
nplurals=1; plural=0;\n
"
#:
../../tutorial/datastructures.rst:5
msgid
"Data Structures"
msgstr
"データ構造"
#:
../../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
""
"この章では、すでに学んだことについてより詳しく説明するとともに、いくつか新し"
"いことを追加します。"
#:
../../tutorial/datastructures.rst:13
msgid
"More on Lists"
msgstr
"リスト型についてもう少し"
#:
../../tutorial/datastructures.rst:15
msgid
""
"The list data type has some more methods. Here are all of the methods of "
"list objects:"
msgstr
""
"リストデータ型には、他にもいくつかメソッドがあります。リストオブジェクトのす"
"べてのメソッドを以下に示します:"
#:
../../tutorial/datastructures.rst:22
msgid
"Add an item to the end of the list. Similar to ``a[len(a):] = [x]``."
msgstr
"リストの末尾に要素を一つ追加します。``a[len(a):] = [x]`` と同様です。"
#:
../../tutorial/datastructures.rst:28
msgid
""
"Extend the list by appending all the items from the iterable. Similar to "
"``a[len(a):] = iterable``."
msgstr
""
"イテラブルのすべての要素を対象のリストに追加し、リストを拡張します。"
"``a[len(a):] = iterable`` と同様です。"
#:
../../tutorial/datastructures.rst:35
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
""
"指定した位置に要素を挿入します。第 1 引数は、リストのインデクスで、そのインデ"
"クスを持つ要素の直前に挿入が行われます。従って、 ``a.insert(0, x)`` はリスト"
"の先頭に挿入を行います。また ``a.insert(len(a), x)`` は ``a.append(x)`` と等"
"価です。"
#:
../../tutorial/datastructures.rst:43
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
""
"リスト中で *x* と等しい値を持つ最初の要素を削除します。該当する要素がなけれ"
"ば :exc:`ValueError` が送出されます。"
#:
../../tutorial/datastructures.rst:50
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
""
"指定された位置の要素をリストから取り除き、それを返します。インデックスが指定"
"されていない場合、 ``a.pop()`` はリスト末尾の要素を取り除いて返します。リスト"
"が空であるか、インデックスがリストの範囲外の場合は、:exc:`IndexError` を送出"
"します。"
#:
../../tutorial/datastructures.rst:59
msgid
"Remove all items from the list. Similar to ``del a[:]``."
msgstr
"リスト中の全ての要素を削除します。``del a[:]`` と同様です。"
#:
../../tutorial/datastructures.rst:65
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
""
"リスト中で *x* と等しい値を持つ最初の要素の位置をゼロから始まる添字で返しま"
"す。 該当する要素がなければ :exc:`ValueError` が送出されます。"
#:
../../tutorial/datastructures.rst:68
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
""
"任意の引数である *start* と *end* はスライス記法として解釈され、リストの探索"
"範囲を指定できます。返される添字は、*start* 引数からの相対位置ではなく、リス"
"ト全体の先頭からの位置になります。"
#:
../../tutorial/datastructures.rst:77
msgid
"Return the number of times *x* appears in the list."
msgstr
"リストでの *x* の出現回数を返します。"
#:
../../tutorial/datastructures.rst:83
msgid
""
"Sort the items of the list in place (the arguments can be used for sort "
"customization, see :func:`sorted` for their explanation)."
msgstr
""
"リストの項目を、インプレース演算 (in place、元のデータを演算結果で置き換える"
"やりかた) でソートします。引数はソート方法のカスタマイズに使えます。 :func:"
"`sorted` の説明を参照してください。"
#:
../../tutorial/datastructures.rst:90
msgid
"Reverse the elements of the list in place."
msgstr
"リストの要素を、インプレース演算で逆順にします。"
#:
../../tutorial/datastructures.rst:96
msgid
"Return a shallow copy of the list. Similar to ``a[:]``."
msgstr
"リストの浅い (shallow) コピーを返します。``a[:]`` と同様です。"
#:
../../tutorial/datastructures.rst:99
msgid
"An example that uses most of the list methods::"
msgstr
"以下にリストのメソッドをほぼ全て使った例を示します::"
#:
../../tutorial/datastructures.rst:101
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) # インデックス4から数えて次の banana の位置\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:122
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
""
"``insert``, ``remove``, ``sort`` などのリストを操作するメソッドの戻り値が表示"
"されていないことに気が付いたかもしれません。これらのメソッドは ``None`` を返"
"しています。[#]_ これは Python の変更可能なデータ構造全てについての設計上の原"
"則となっています。"
#:
../../tutorial/datastructures.rst:127
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
""
"もうひとつ気付くとしたら、すべてのデータでソートや比較できるわけではないとい"
"うことです。 例えば、 ``[None, 'hello', 10]`` はソートされません。なぜなら整"
"数は文字列と比べられませんし、 ``None`` は他の型と比べられないからです。 ま"
"た、順序関係が定義されていない型もあります。 例えば、 ``3+4j < 5+7j`` は有効"
"な比較ではありません。"
#:
../../tutorial/datastructures.rst:138
msgid
"Using Lists as Stacks"
msgstr
"リストをスタックとして使う"
#:
../../tutorial/datastructures.rst:143
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
""
"リスト型のメソッドのおかげで、簡単にリストをスタックとして使えます。スタック"
"では、最後に追加された要素が最初に取り出されます (
\"
last-in, first-out
\"
)。ス"
"タックの一番上に要素を追加するには :meth:`!append` を使います。スタックの一番"
"上から要素を取り出すには :meth:`!pop` をインデクスを指定せずに使います。例え"
"ば以下のようにします::"
#:
../../tutorial/datastructures.rst:148
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:168
msgid
"Using Lists as Queues"
msgstr
"リストをキューとして使う"
#:
../../tutorial/datastructures.rst:172
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
""
"リストをキュー (queue) として使うことも可能です。この場合、最初に追加した要素"
"を最初に取り出します (
\"
first-in, first-out
\"
)。しかし、リストでは効率的にこ"
"の目的を達成することが出来ません。追加（append）や取り出し（pop）をリストの末"
"尾に対して行うと速いのですが、挿入（insert）や取り出し（pop）をリストの先頭に"
"対して行うと遅くなってしまいます（他の要素をひとつずつずらす必要があるからで"
"す）。"
#:
../../tutorial/datastructures.rst:178
msgid
""
"To implement a queue, use :class:`collections.deque` which was designed to "
"have fast appends and pops from both ends. For example::"
msgstr
""
"キューの実装には :class:`collections.deque` を使います。このクラスは両端で要"
"素を高速に追加・取り出しできるように設計されています。例えば次のように使いま"
"す::"
#:
../../tutorial/datastructures.rst:181
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 が到着\n"
">>> queue.append(
\"
Graham
\"
) # Graham が到着\n"
">>> queue.popleft() # 最初に到着した人が去る\n"
"'Eric'\n"
">>> queue.popleft() # 2番目に到着した人が去る\n"
"'John'\n"
">>> queue # 残っている人を到着順に表示\n"
"deque(['Michael', 'Terry', 'Graham'])"
#:
../../tutorial/datastructures.rst:196
msgid
"List Comprehensions"
msgstr
"リストの内包表記"
#:
../../tutorial/datastructures.rst:198
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
""
"リスト内包表記を使うとリストを簡潔に作れます。シーケンスやイテラブルの各要素"
"に操作を適用した結果から新しいリストを作るときによく使います。また、特定の条"
"件を満たす要素だけを取り出して部分シーケンスを作ることもできます。"
#:
../../tutorial/datastructures.rst:203
msgid
"For example, assume we want to create a list of squares, like::"
msgstr
"例えば、次のような平方のリストを作りたいとします::"
#:
../../tutorial/datastructures.rst:205
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:212
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
""
"このコードは ``x`` という名前の変数を作るか、既存の変数を上書きします。この変"
"数がループ終了後も残ることに注意してください。次のように書けば、副作用なしで"
"平方のリストを計算できます::"
#:
../../tutorial/datastructures.rst:216
msgid
"squares = list(map(lambda x: x**2, range(10)))"
msgstr
"squares = list(map(lambda x: x**2, range(10)))"
#:
../../tutorial/datastructures.rst:218
msgid
"or, equivalently::"
msgstr
"もしくは、以下でも同じです::"
#:
../../tutorial/datastructures.rst:220
msgid
"squares = [x**2 for x in range(10)]"
msgstr
"squares = [x**2 for x in range(10)]"
#:
../../tutorial/datastructures.rst:222
msgid
"which is more concise and readable."
msgstr
"これはより簡潔で読みやすいです。"
#:
../../tutorial/datastructures.rst:224
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
""
"リスト内包表記は、式とそれに続く :keyword:`!for` 句、さらに0個以上の :"
"keyword:`!for` 句または :keyword:`!if` 句を角括弧で囲んだものです。式に続く :"
"keyword:`!for` 句と :keyword:`!if` 句に従って式を評価し、その結果を要素とする"
"新しいリストを作ります。例えば次のリスト内包表記は、2つのリストから等しくない"
"要素同士を組み合わせてペアを作ります::"
#:
../../tutorial/datastructures.rst:231
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:234
msgid
"and it's equivalent to::"
msgstr
"これは次のコードと等価です::"
#:
../../tutorial/datastructures.rst:236
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:245
msgid
""
"Note how the order of the :keyword:`for` and :keyword:`if` statements is the "
"same in both these snippets."
msgstr
""
"どちらのコードでも :keyword:`for` 文と :keyword:`if` 文の順序が同じであること"
"に注目してください。"
#:
../../tutorial/datastructures.rst:248
msgid
""
"If the expression is a tuple (e.g. the ``(x, y)`` in the previous example), "
"it must be parenthesized. ::"
msgstr
""
"式がタプルの場合は前の例の ``(x, y)`` のように丸括弧で囲む必要があります。 ::"
#:
../../tutorial/datastructures.rst:251
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"
">>> # 値を2倍にした新しいリストを作る\n"
">>> [x*2 for x in vec]\n"
"[-8, -4, 0, 4, 8]\n"
">>> # リストから負の数を除く\n"
">>> [x for x in vec if x >= 0]\n"
"[0, 2, 4]\n"
">>> # すべての要素に関数を適用する\n"
">>> [abs(x) for x in vec]\n"
"[4, 2, 0, 2, 4]\n"
">>> # 各要素のメソッドを呼び出す\n"
">>> freshfruit = [' banana', ' loganberry ', 'passion fruit ']\n"
">>> [weapon.strip() for weapon in freshfruit]\n"
"['banana', 'loganberry', 'passion fruit']\n"
">>> # (number, square) のような2要素のタプルのリストを作る\n"
">>> [(x, x**2) for x in range(6)]\n"
"[(0, 0), (1, 1), (2, 4), (3, 9), (4, 16), (5, 25)]\n"
">>> # タプルを丸括弧で囲まないとエラーになる\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"
">>> # 2つの '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:279
msgid
""
"List comprehensions can contain complex expressions and nested functions::"
msgstr
"リスト内包表記では複雑な式や入れ子になった関数呼び出しも使えます::"
#:
../../tutorial/datastructures.rst:281
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:286
msgid
"Nested List Comprehensions"
msgstr
"ネストしたリストの内包表記"
#:
../../tutorial/datastructures.rst:288
msgid
""
"The initial expression in a list comprehension can be any arbitrary "
"expression, including another list comprehension."
msgstr
""
"リスト内包表記中の最初の式は任意の式なので、そこに他のリスト内包表記を書くこ"
"ともできます。"
#:
../../tutorial/datastructures.rst:291
msgid
""
"Consider the following example of a 3x4 matrix implemented as a list of 3 "
"lists of length 4::"
msgstr
"次の、長さ4のリスト3つからなる、3x4 の matrix について考えます::"
#:
../../tutorial/datastructures.rst:294
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:300
msgid
"The following list comprehension will transpose rows and columns::"
msgstr
"次のリスト内包表記は、matrix の行と列を入れ替えます::"
#:
../../tutorial/datastructures.rst:302
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:305
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
""
"前の節で見たように、内側のリスト内包表記は、続く :keyword:`for` のコンテキス"
"トの中で評価されます。そのため、この例は次のコードと等価です::"
#:
../../tutorial/datastructures.rst:309
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:316
msgid
"which, in turn, is the same as::"
msgstr
"これをもう一度変換すると、次のコードと等価になります::"
#:
../../tutorial/datastructures.rst:318
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"
"... # 以下の3行はネストされたリスト内包表記と同じ実装\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:329
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
""
"実際には複雑な流れの式よりも組み込み関数を使う方が良いです。この場合 :func:"
"`zip` 関数が良い仕事をしてくれるでしょう::"
#:
../../tutorial/datastructures.rst:332
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:335
msgid
""
"See :ref:`tut-unpacking-arguments` for details on the asterisk in this line."
msgstr
""
"この行にあるアスタリスクの詳細については :ref:`tut-unpacking-arguments` を参"
"照してください。"
#:
../../tutorial/datastructures.rst:340
msgid
"The :keyword:`!del` statement"
msgstr
":keyword:`!del` 文"
#:
../../tutorial/datastructures.rst:342
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
""
"リストから要素を削除する際、値を指定する代わりにインデックスを指定する方法が"
"あります。それが :keyword:`del` 文です。これは :meth:`!pop` メソッドと違い、"
"値を返しません。 :keyword:`!del` 文はリストからスライスを除去したり、リスト全"
"体を削除することもできます(以前はスライスに空のリストを代入して行っていまし"
"た)。例えば以下のようにします::"
#:
../../tutorial/datastructures.rst:348
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:359
msgid
":keyword:`del` can also be used to delete entire variables::"
msgstr
":keyword:`del` は変数全体の削除にも使えます::"
#:
../../tutorial/datastructures.rst:361
msgid
">>> del a"
msgstr
">>> del a"
#:
../../tutorial/datastructures.rst:363
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
""
"この文の後で名前 ``a`` を参照すると、(別の値を ``a`` に代入するまで) エラーに"
"なります。 :keyword:`del` の別の用途についてはまた後で取り上げます。"
#:
../../tutorial/datastructures.rst:370
msgid
"Tuples and Sequences"
msgstr
"タプルとシーケンス"
#:
../../tutorial/datastructures.rst:372
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
""
"リストや文字列には、インデクスやスライスを使った演算のように、数多くの共通の"
"性質があることを見てきました。これらは *シーケンス (sequence)* データ型 (:"
"ref:`typesseq` を参照) の二つの例です。 Python はまだ進歩の過程にある言語なの"
"で、他のシーケンスデータ型が追加されるかもしれません。標準のシーケンス型はも"
"う一つあります: *タプル (tuple)* 型です。"
#:
../../tutorial/datastructures.rst:378
msgid
""
"A tuple consists of a number of values separated by commas, for instance::"
msgstr
""
"タプルはコンマで区切られたいくつかの値からなります。例えば以下のように書きま"
"す::"
#:
../../tutorial/datastructures.rst:380
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"
">>> # タプルは入れ子にできる:\n"
">>> u = t, (1, 2, 3, 4, 5)\n"
">>> u\n"
"((12345, 54321, 'hello!'), (1, 2, 3, 4, 5))\n"
">>> # タプルは不変(イミュータブル):\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"
">>> # しかし、可変(ミュータブル)オブジェクトを含むことができる:\n"
">>> v = ([1, 2, 3], [3, 2, 1])\n"
">>> v\n"
"([1, 2, 3], [3, 2, 1])"
#:
../../tutorial/datastructures.rst:400
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
""
"ご覧のとおり、タプルの表示には常に丸括弧がついていて、タプルのネストが正しく"
"解釈されるようになっています。タプルを書くときは必ずしも丸括弧で囲まなくても"
"いいですが、(タプルが大きな式の一部だった場合は) 丸括弧が必要な場合もありま"
"す。タプルの要素を代入することはできません。しかし、タプルにリストのような変"
"更可能型を含めることはできます。"
#:
../../tutorial/datastructures.rst:407
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
""
"タプルはリストと似ていますが、たいてい異なる場面と異なる目的で利用されます。"
"タプルは :term:`不変 <immutable>` で、複数の型の要素からなることもあり、要素"
"はアンパック(この節の後半に出てきます)操作やインデックス (あるいは :func:"
"`namedtuples <collections.namedtuple>` の場合は属性)でアクセスすることが多い"
"です。一方、リストは :term:`可変 <mutable>` で、要素はたいてい同じ型のオブ"
"ジェクトであり、たいていイテレートによってアクセスします。"
#:
../../tutorial/datastructures.rst:415
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
""
"問題は 0 個または 1 個の項目からなるタプルの構築です。これらの操作を行うた"
"め、構文には特別な細工がされています。空のタプルは空の丸括弧ペアで構築できま"
"す。一つの要素を持つタプルは、値の後ろにコンマを続ける (単一の値を丸括弧で囲"
"むだけでは不十分です) ことで構築できます。美しくはないけれども、効果的です。"
"例えば以下のようにします::"
#:
../../tutorial/datastructures.rst:421
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', # <-- 末尾にカンマがあることに注意\n"
">>> len(empty)\n"
"0\n"
">>> len(singleton)\n"
"1\n"
">>> singleton\n"
"('hello',)"
#:
../../tutorial/datastructures.rst:430
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
""
"文 ``t = 12345, 54321, 'hello!'`` は *タプルのパック (tuple packing)* の例で"
"す。値 ``12345``, ``54321``, ``'hello!'`` が一つのタプルにパックされます。逆"
"の演算も可能です::"
#:
../../tutorial/datastructures.rst:434
msgid
">>> x, y, z = t"
msgstr
">>> x, y, z = t"
#:
../../tutorial/datastructures.rst:436
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
""
"この操作は、*シーケンスのアンパック (sequence unpacking)* とでも呼ぶべきもの"
"で、右辺には全てのシーケンス型を使うことができます。シーケンスのアンパックで"
"は、等号の左辺に列挙されている変数が、右辺のシーケンスの長さと同じ数だけある"
"ことが要求されます。複数同時の代入が実はタプルのパックとシーケンスのアンパッ"
"クを組み合わせたものに過ぎないことに注意してください。"
#:
../../tutorial/datastructures.rst:446
msgid
"Sets"
msgstr
"集合型"
#:
../../tutorial/datastructures.rst:448
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 には、 *集合 (set)* を扱うためのデータ型もあります。集合とは、重複する"
"要素をもたない、順序づけられていない要素の集まりです。 Set オブジェクトは、"
"和 (union)、積 (intersection)、差 (difference)、対称差 (symmetric difference)"
"といった数学的な演算もサポートしています。"
#:
../../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
""
"中括弧、または :func:`set` 関数は set を生成するために使用することができま"
"す。注: 空集合を作成するためには ``set()`` を使用しなければなりません (``{}"
"`` ではなく)。後者は空の辞書を作成します。辞書は次のセクションで議論するデー"
"タ構造です。"
#:
../../tutorial/datastructures.rst:457
msgid
"Here is a brief demonstration::"
msgstr
"簡単なデモンストレーションを示します::"
#:
../../tutorial/datastructures.rst:459
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) # 重複が削除されていることを確認\n"
"{'orange', 'banana', 'pear', 'apple'}\n"
">>> 'orange' in basket # 高速なメンバー判定\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 # aのユニークな文字\n"
"{'a', 'r', 'b', 'c', 'd'}\n"
">>> a - b # aにあってbにない文字\n"
"{'r', 'd', 'b'}\n"
">>> a | b # aまたはbまたは両方に存在する文字\n"
"{'a', 'c', 'r', 'd', 'b', 'm', 'z', 'l'}\n"
">>> a & b # aとbの両方に存在する文字\n"
"{'a', 'c'}\n"
">>> a ^ b # aまたはbにあるが、両方にはない文"
"字 \n"
"{'r', 'd', 'b', 'm', 'z', 'l'}"
#:
../../tutorial/datastructures.rst:482
msgid
""
"Similarly to :ref:`list comprehensions <tut-listcomps>`, set comprehensions "
"are also supported::"
msgstr
""
":ref:`リスト内包 <tut-listcomps>` と同様に、 set 内包もサポートされています::"
#:
../../tutorial/datastructures.rst:485
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:493
msgid
"Dictionaries"
msgstr
"辞書型 (dictionary)"
#:
../../tutorial/datastructures.rst:495
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
""
"もう一つ、有用な型が Python に組み込まれています。それは *辞書 (dictionary)* "
"(:ref:`typesmapping` を参照)です。辞書は他の言語にも
\"
連想記憶 (associated "
"memory)
\"
や
\"
連想配列 (associative array)
\"
という名前で存在することがあり"
"ます。ある範囲の数でインデクス化されているシーケンスと異なり、辞書は *キー "
"(key)* でインデクス化されています。このキーは何らかの変更不能な型になります。"
"文字列、数値は常にキーにすることができます。タプルは、文字列、数値、その他の"
"タプルのみを含む場合はキーにすることができます。直接、あるいは間接的に変更可"
"能なオブジェクトを含むタプルはキーにできません。リストをキーとして使うことは"
"できません。これは、リストにスライスやインデクス指定の代入を行ったり、 :meth:"
"`!append` や :meth:`!extend` のようなメソッドを使うと、インプレースで変更する"
"ことができるためです。"
#:
../../tutorial/datastructures.rst:506
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
""
"辞書は *キー(key): 値(value)* のペアの集合であり、キーが (辞書の中で)一意でな"
"ければならない、と考えるとよいでしょう。波括弧 (brace) のペア: ``{}`` は空の"
"辞書を生成します。カンマで区切られた key: value のペアを波括弧ペアの間に入れ"
"ると、辞書の初期値となる key: value が追加されます; この表現方法は出力時に辞"
"書が書き出されるのと同じ方法です。"
#:
../../tutorial/datastructures.rst:512
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."
View remainder of file in raw view
Back
|
FazBrowse Home
|
New Git URL