FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
python-docs-de/library/collections.po at 3.15 · python/python-docs-de · GitHub
python
/
python-docs-de
Public
Notifications
You must be signed in to change notification settings
Fork
1
Star
1
Code
Issues
0
Pull requests
2
Actions
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Actions
Security and quality
Insights
Expand file tree
Breadcrumbs
python-docs-de
/
library
/
collections.po
Copy path
More file actions
More file actions
Latest commit
History
History
History
1798 lines (1551 loc) · 59.4 KB
Breadcrumbs
python-docs-de
/
library
/
collections.po
Copy path
File metadata and controls
1798 lines (1551 loc) · 59.4 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.
#
msgid ""
msgstr ""
"
Project-Id-Version
:
Python 3.15\n
"
"
Report-Msgid-Bugs-To
:
\n
"
"
POT-Creation-Date
:
2026-09-14 20:17+0000\n
"
"
PO-Revision-Date
:
2025-09-16 00:01+0000\n
"
"
Language-Team
:
German (https://app.transifex.com/python-doc/teams/5390/de/)\n
"
"
Language
:
de\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
"
#:
../../library/collections.rst:2
msgid
":mod:`!collections` --- Container datatypes"
msgstr
""
#:
../../library/collections.rst:7
msgid
"**Source code:** :source:`Lib/collections/__init__.py`"
msgstr
""
#:
../../library/collections.rst:17
msgid
""
"This module implements specialized container datatypes providing "
"alternatives to Python's general purpose built-in containers, :class:"
"`dict`, :class:`list`, :class:`set`, and :class:`tuple`."
msgstr
""
#:
../../library/collections.rst:22
msgid
":func:`namedtuple`"
msgstr
""
#:
../../library/collections.rst:22
msgid
"factory function for creating tuple subclasses with named fields"
msgstr
""
#:
../../library/collections.rst:23
msgid
":class:`deque`"
msgstr
""
#:
../../library/collections.rst:23
msgid
"list-like container with fast appends and pops on either end"
msgstr
""
#:
../../library/collections.rst:24
msgid
":class:`ChainMap`"
msgstr
""
#:
../../library/collections.rst:24
msgid
"dict-like class for creating a single view of multiple mappings"
msgstr
""
#:
../../library/collections.rst:25
msgid
":class:`Counter`"
msgstr
""
#:
../../library/collections.rst:25
msgid
"dict subclass for counting :term:`hashable` objects"
msgstr
""
#:
../../library/collections.rst:26
msgid
":class:`OrderedDict`"
msgstr
""
#:
../../library/collections.rst:26
msgid
"dict subclass that remembers the order entries were added"
msgstr
""
#:
../../library/collections.rst:27
msgid
":class:`defaultdict`"
msgstr
""
#:
../../library/collections.rst:27
msgid
"dict subclass that calls a factory function to supply missing values"
msgstr
""
#:
../../library/collections.rst:28
msgid
":class:`UserDict`"
msgstr
""
#:
../../library/collections.rst:28
msgid
"wrapper around dictionary objects for easier dict subclassing"
msgstr
""
#:
../../library/collections.rst:29
msgid
":class:`UserList`"
msgstr
""
#:
../../library/collections.rst:29
msgid
"wrapper around list objects for easier list subclassing"
msgstr
""
#:
../../library/collections.rst:30
msgid
":class:`UserString`"
msgstr
""
#:
../../library/collections.rst:30
msgid
"wrapper around string objects for easier string subclassing"
msgstr
""
#:
../../library/collections.rst:35
msgid
":class:`ChainMap` objects"
msgstr
""
#:
../../library/collections.rst:39
msgid
""
"A :class:`ChainMap` class is provided for quickly linking a number of "
"mappings so they can be treated as a single unit. It is often much faster "
"than creating a new dictionary and running multiple :meth:`~dict.update` "
"calls."
msgstr
""
#:
../../library/collections.rst:43
msgid
""
"The class can be used to simulate nested scopes and is useful in templating."
msgstr
""
#:
../../library/collections.rst:47
msgid
""
"A :class:`ChainMap` groups multiple dicts or other mappings together to "
"create a single, updateable view. If no *maps* are specified, a single "
"empty dictionary is provided so that a new chain always has at least one "
"mapping."
msgstr
""
#:
../../library/collections.rst:51
msgid
""
"The underlying mappings are stored in a list. That list is public and can "
"be accessed or updated using the *maps* attribute. There is no other state."
msgstr
""
#:
../../library/collections.rst:54
msgid
""
"Lookups search the underlying mappings successively until a key is found. "
"In contrast, writes, updates, and deletions only operate on the first "
"mapping."
msgstr
""
#:
../../library/collections.rst:57
msgid
""
"A :class:`ChainMap` incorporates the underlying mappings by reference. So, "
"if one of the underlying mappings gets updated, those changes will be "
"reflected in :class:`ChainMap`."
msgstr
""
#:
../../library/collections.rst:61
msgid
""
"All of the usual dictionary methods are supported. In addition, there is a "
"*maps* attribute, a method for creating new subcontexts, and a property for "
"accessing all but the first mapping:"
msgstr
""
#:
../../library/collections.rst:67
msgid
""
"A user updateable list of mappings. The list is ordered from first-searched "
"to last-searched. It is the only stored state and can be modified to change "
"which mappings are searched. The list should always contain at least one "
"mapping."
msgstr
""
#:
../../library/collections.rst:74
msgid
""
"Returns a new :class:`ChainMap` containing a new map followed by all of the "
"maps in the current instance. If ``m`` is specified, it becomes the new map "
"at the front of the list of mappings; if not specified, an empty dict is "
"used, so that a call to ``d.new_child()`` is equivalent to: ``ChainMap({}, "
"*d.maps)``. If any keyword arguments are specified, they update passed map "
"or new empty dict. This method is used for creating subcontexts that can be "
"updated without altering values in any of the parent mappings."
msgstr
""
#:
../../library/collections.rst:83
msgid
"The optional ``m`` parameter was added."
msgstr
""
#:
../../library/collections.rst:86
msgid
"Keyword arguments support was added."
msgstr
""
#:
../../library/collections.rst:91
msgid
""
"Property returning a new :class:`ChainMap` containing all of the maps in the "
"current instance except the first one. This is useful for skipping the "
"first map in the search. Use cases are similar to those for the :keyword:"
"`nonlocal` keyword used in :term:`nested scopes <nested scope>`. The use "
"cases also parallel those for the built-in :func:`super` function. A "
"reference to ``d.parents`` is equivalent to: ``ChainMap(*d.maps[1:])``."
msgstr
""
#:
../../library/collections.rst:99
msgid
""
"Note, the iteration order of a :class:`ChainMap` is determined by scanning "
"the mappings last to first::"
msgstr
""
#:
../../library/collections.rst:102
msgid
""
">>> baseline = {'music': 'bach', 'art': 'rembrandt'}\n"
">>> adjustments = {'art': 'van gogh', 'opera': 'carmen'}\n"
">>> list(ChainMap(adjustments, baseline))\n"
"['music', 'art', 'opera']"
msgstr
""
#:
../../library/collections.rst:107
msgid
""
"This gives the same ordering as a series of :meth:`dict.update` calls "
"starting with the last mapping::"
msgstr
""
#:
../../library/collections.rst:110
msgid
""
">>> combined = baseline.copy()\n"
">>> combined.update(adjustments)\n"
">>> list(combined)\n"
"['music', 'art', 'opera']"
msgstr
""
#:
../../library/collections.rst:115
msgid
"Added support for ``|`` and ``|=`` operators, specified in :pep:`584`."
msgstr
""
#:
../../library/collections.rst:120
msgid
""
"The `MultiContext class <https://github.com/enthought/codetools/blob/4.0.0/"
"codetools/contexts/multi_context.py>`_ in the Enthought `CodeTools package "
"<https://github.com/enthought/codetools>`_ has options to support writing to "
"any mapping in the chain."
msgstr
""
#:
../../library/collections.rst:126
msgid
""
"Django's `Context class <https://github.com/django/django/blob/main/django/"
"template/context.py>`_ for templating is a read-only chain of mappings. It "
"also features pushing and popping of contexts similar to the :meth:"
"`~collections.ChainMap.new_child` method and the :attr:`~collections."
"ChainMap.parents` property."
msgstr
""
#:
../../library/collections.rst:133
msgid
""
"The `Nested Contexts recipe <https://code.activestate.com/recipes/577434-"
"nested-contexts-a-chain-of-mapping-objects/>`_ has options to control "
"whether writes and other mutations apply only to the first mapping or to any "
"mapping in the chain."
msgstr
""
#:
../../library/collections.rst:138
msgid
""
"A `greatly simplified read-only version of Chainmap <https://code."
"activestate.com/recipes/305268/>`_."
msgstr
""
#:
../../library/collections.rst:143
msgid
":class:`ChainMap` Examples and Recipes"
msgstr
""
#:
../../library/collections.rst:145
msgid
"This section shows various approaches to working with chained maps."
msgstr
""
#:
../../library/collections.rst:148
msgid
"Example of simulating Python's internal lookup chain::"
msgstr
""
#:
../../library/collections.rst:150
msgid
""
"import builtins\n"
"pylookup = ChainMap(locals(), globals(), vars(builtins))"
msgstr
""
#:
../../library/collections.rst:153
msgid
""
"Example of letting user specified command-line arguments take precedence "
"over environment variables which in turn take precedence over default "
"values::"
msgstr
""
#:
../../library/collections.rst:156
msgid
""
"import os, argparse\n"
"\n"
"defaults = {'color': 'red', 'user': 'guest'}\n"
"\n"
"parser = argparse.ArgumentParser()\n"
"parser.add_argument('-u', '--user')\n"
"parser.add_argument('-c', '--color')\n"
"namespace = parser.parse_args()\n"
"command_line_args = {k: v for k, v in vars(namespace).items() if v is not "
"None}\n"
"\n"
"combined = ChainMap(command_line_args, os.environ, defaults)\n"
"print(combined['color'])\n"
"print(combined['user'])"
msgstr
""
#:
../../library/collections.rst:170
msgid
""
"Example patterns for using the :class:`ChainMap` class to simulate nested "
"contexts::"
msgstr
""
#:
../../library/collections.rst:173
msgid
""
"c = ChainMap() # Create root context\n"
"d = c.new_child() # Create nested child context\n"
"e = c.new_child() # Child of c, independent from d\n"
"e.maps[0] # Current context dictionary -- like Python's "
"locals()\n"
"e.maps[-1] # Root context -- like Python's globals()\n"
"e.parents # Enclosing context chain -- like Python's nonlocals\n"
"\n"
"d['x'] = 1 # Set value in current context\n"
"d['x'] # Get first key in the chain of contexts\n"
"del d['x'] # Delete from current context\n"
"list(d) # All nested values\n"
"k in d # Check all nested values\n"
"len(d) # Number of nested values\n"
"d.items() # All nested items\n"
"dict(d) # Flatten into a regular dictionary"
msgstr
""
#:
../../library/collections.rst:189
msgid
""
"The :class:`ChainMap` class only makes updates (writes and deletions) to the "
"first mapping in the chain while lookups will search the full chain. "
"However, if deep writes and deletions are desired, it is easy to make a "
"subclass that updates keys found deeper in the chain::"
msgstr
""
#:
../../library/collections.rst:194
msgid
""
"class DeepChainMap(ChainMap):\n"
" 'Variant of ChainMap that allows direct updates to inner scopes'\n"
"\n"
" def __setitem__(self, key, value):\n"
" for mapping in self.maps:\n"
" if key in mapping:\n"
" mapping[key] = value\n"
" return\n"
" self.maps[0][key] = value\n"
"\n"
" def __delitem__(self, key):\n"
" for mapping in self.maps:\n"
" if key in mapping:\n"
" del mapping[key]\n"
" return\n"
" raise KeyError(key)\n"
"\n"
">>> d = DeepChainMap({'zebra': 'black'}, {'elephant': 'blue'}, {'lion': "
"'yellow'})\n"
">>> d['lion'] = 'orange' # update an existing key two levels down\n"
">>> d['snake'] = 'red' # new keys get added to the topmost dict\n"
">>> del d['elephant'] # remove an existing key one level down\n"
">>> d # display result\n"
"DeepChainMap({'zebra': 'black', 'snake': 'red'}, {}, {'lion': 'orange'})"
msgstr
""
#:
../../library/collections.rst:220
msgid
":class:`Counter` objects"
msgstr
""
#:
../../library/collections.rst:222
msgid
""
"A counter tool is provided to support convenient and rapid tallies. For "
"example::"
msgstr
""
#:
../../library/collections.rst:225
msgid
""
">>> # Tally occurrences of words in a list\n"
">>> cnt = Counter()\n"
">>> for word in ['red', 'blue', 'red', 'green', 'blue', 'blue']:\n"
"... cnt[word] += 1\n"
"...\n"
">>> cnt\n"
"Counter({'blue': 3, 'red': 2, 'green': 1})\n"
"\n"
">>> # Find the ten most common words in Hamlet\n"
">>> import re\n"
">>> words = re.findall(r'
\\
w+', open('hamlet.txt').read().lower())\n"
">>> Counter(words).most_common(10)\n"
"[('the', 1143), ('and', 966), ('to', 762), ('of', 669), ('i', 631),\n"
" ('you', 554), ('a', 546), ('my', 514), ('hamlet', 471), ('in', 451)]"
msgstr
""
#:
../../library/collections.rst:244
msgid
""
"A :class:`Counter` is a :class:`dict` subclass for counting :term:`hashable` "
"objects. It is a collection where elements are stored as dictionary keys and "
"their counts are stored as dictionary values. Counts are allowed to be any "
"integer value including zero or negative counts. The :class:`Counter` class "
"is similar to bags or multisets in other languages."
msgstr
""
#:
../../library/collections.rst:250
msgid
""
"Elements are counted from an *iterable* or initialized from another "
"*mapping* (or counter):"
msgstr
""
#:
../../library/collections.rst:258
msgid
""
"Counter objects have a dictionary interface except that they return a zero "
"count for missing items instead of raising a :exc:`KeyError`:"
msgstr
""
#:
../../library/collections.rst:265
msgid
""
"Setting a count to zero does not remove an element from a counter. Use "
"``del`` to remove it entirely:"
msgstr
""
#:
../../library/collections.rst:273
msgid
""
"As a :class:`dict` subclass, :class:`Counter` inherited the capability to "
"remember insertion order. Math operations on *Counter* objects also "
"preserve order. Results are ordered according to when an element is first "
"encountered in the left operand and then by the order encountered in the "
"right operand."
msgstr
""
#:
../../library/collections.rst:279
msgid
""
"Counter objects support additional methods beyond those available for all "
"dictionaries:"
msgstr
""
#:
../../library/collections.rst:284
msgid
""
"Return an iterator over elements repeating each as many times as its count. "
"Elements are returned in the order first encountered. If an element's count "
"is less than one, :meth:`elements` will ignore it."
msgstr
""
#:
../../library/collections.rst:294
msgid
""
"Return a list of the *n* most common elements and their counts from the most "
"common to the least. If *n* is omitted or ``None``, :meth:`most_common` "
"returns *all* elements in the counter. Elements with equal counts are "
"ordered in the order first encountered:"
msgstr
""
#:
../../library/collections.rst:306
msgid
""
"Elements are subtracted from an *iterable* or from another *mapping* (or "
"counter). Like :meth:`dict.update` but subtracts counts instead of "
"replacing them. Both inputs and outputs may be zero or negative."
msgstr
""
#:
../../library/collections.rst:320
msgid
"Compute the sum of the counts."
msgstr
""
#:
../../library/collections.rst:328
msgid
""
"The usual dictionary methods are available for :class:`Counter` objects "
"except for these two which work differently for counters:"
msgstr
""
#:
../../library/collections.rst:333
msgid
"This class method is not implemented for :class:`Counter` objects."
msgstr
""
#:
../../library/collections.rst:339
msgid
""
"Elements are counted from an *iterable* or added-in from another *mapping* "
"(or counter). Like :meth:`dict.update` but adds counts instead of replacing "
"them. Also, the *iterable* is expected to be a sequence of elements, not a "
"sequence of ``(key, value)`` pairs."
msgstr
""
#:
../../library/collections.rst:344
msgid
""
"Counters support rich comparison operators for equality, subset, and "
"superset relationships: ``==``, ``!=``, ``<``, ``<=``, ``>``, ``>=``. All of "
"those tests treat missing elements as having zero counts so that "
"``Counter(a=1) == Counter(a=1, b=0)`` returns true."
msgstr
""
#:
../../library/collections.rst:349
msgid
"Rich comparison operations were added."
msgstr
""
#:
../../library/collections.rst:352
msgid
""
"In equality tests, missing elements are treated as having zero counts. "
"Formerly, ``Counter(a=3)`` and ``Counter(a=3, b=0)`` were considered "
"distinct."
msgstr
""
#:
../../library/collections.rst:357
msgid
"Common patterns for working with :class:`Counter` objects::"
msgstr
""
#:
../../library/collections.rst:359
msgid
""
"c.total() # total of all counts\n"
"c.clear() # reset all counts\n"
"list(c) # list unique elements\n"
"set(c) # convert to a set\n"
"dict(c) # convert to a regular dictionary\n"
"c.items() # access the (elem, cnt) pairs\n"
"Counter(dict(list_of_pairs)) # convert from a list of (elem, cnt) pairs\n"
"c.most_common()[:-n-1:-1] # n least common elements\n"
"+c # remove zero and negative counts"
msgstr
""
#:
../../library/collections.rst:369
msgid
""
"Several mathematical operations are provided for combining :class:`Counter` "
"objects to produce multisets (counters that have counts greater than zero). "
"Addition and subtraction combine counters by adding or subtracting the "
"counts of corresponding elements. Intersection and union return the minimum "
"and maximum of corresponding counts. Symmetric difference returns the "
"difference between the maximum and minimum of the corresponding counts. "
"Equality and inclusion compare corresponding counts. Each operation can "
"accept inputs with signed counts, but the output will exclude results with "
"counts of zero or below."
msgstr
""
#:
../../library/collections.rst:379
msgid
""
">>> c = Counter(a=3, b=1)\n"
">>> d = Counter(a=1, b=2)\n"
">>> c + d # add two counters together: c[x] + d[x]\n"
"Counter({'a': 4, 'b': 3})\n"
">>> c - d # subtract (keeping only positive counts)\n"
"Counter({'a': 2})\n"
">>> c & d # intersection: min(c[x], d[x])\n"
"Counter({'a': 1, 'b': 1})\n"
">>> c | d # union: max(c[x], d[x])\n"
"Counter({'a': 3, 'b': 2})\n"
">>> c ^ d # max(c[x], d[x]) - min(c[x], d[x])\n"
"Counter({'a': 2, 'b': 1})\n"
">>> c == d # equality: c[x] == d[x]\n"
"False\n"
">>> c <= d # inclusion: c[x] <= d[x]\n"
"False"
msgstr
""
#:
../../library/collections.rst:398
msgid
""
"Unary addition and subtraction are shortcuts for adding an empty counter or "
"subtracting from an empty counter."
msgstr
""
#:
../../library/collections.rst:407
msgid
""
"Added support for unary plus, unary minus, and in-place multiset operations."
msgstr
""
#:
../../library/collections.rst:410
msgid
""
"Added support for the symmetric difference multiset operation, ``c ^ d``."
msgstr
""
#:
../../library/collections.rst:415
msgid
""
"Counters were primarily designed to work with positive integers to represent "
"running counts; however, care was taken to not unnecessarily preclude use "
"cases needing other types or negative values. To help with those use cases, "
"this section documents the minimum range and type restrictions."
msgstr
""
#:
../../library/collections.rst:420
msgid
""
"The :class:`Counter` class itself is a dictionary subclass with no "
"restrictions on its keys and values. The values are intended to be numbers "
"representing counts, but you *could* store anything in the value field."
msgstr
""
#:
../../library/collections.rst:424
msgid
""
"The :meth:`~Counter.most_common` method requires only that the values be "
"orderable."
msgstr
""
#:
../../library/collections.rst:426
msgid
""
"For in-place operations such as ``c[key] += 1``, the value type need only "
"support addition and subtraction. So fractions, floats, and decimals would "
"work and negative values are supported. The same is also true for :meth:"
"`~Counter.update` and :meth:`~Counter.subtract` which allow negative and "
"zero values for both inputs and outputs."
msgstr
""
#:
../../library/collections.rst:432
msgid
""
"The multiset methods are designed only for use cases with positive values. "
"The inputs may be negative or zero, but only outputs with positive values "
"are created. There are no type restrictions, but the value type needs to "
"support addition, subtraction, and comparison."
msgstr
""
#:
../../library/collections.rst:437
msgid
""
"The :meth:`~Counter.elements` method requires integer counts. It ignores "
"zero and negative counts."
msgstr
""
#:
../../library/collections.rst:442
msgid
""
"`Bag class <https://www.gnu.org/software/smalltalk/manual-base/html_node/Bag."
"html>`_ in Smalltalk."
msgstr
""
#:
../../library/collections.rst:445
msgid
""
"Wikipedia entry for `Multisets <https://en.wikipedia.org/wiki/Multiset>`_."
msgstr
""
#:
../../library/collections.rst:447
msgid
""
"`C++ multisets <http://www.java2s.com/Tutorial/Cpp/0380__set-multiset/"
"Catalog0380__set-multiset.htm>`_ tutorial with examples."
msgstr
""
#:
../../library/collections.rst:450
msgid
""
"For mathematical operations on multisets and their use cases, see *Knuth, "
"Donald. The Art of Computer Programming Volume II, Section 4.6.3, Exercise "
"19*."
msgstr
""
#:
../../library/collections.rst:454
msgid
""
"To enumerate all distinct multisets of a given size over a given set of "
"elements, see :func:`itertools.combinations_with_replacement`::"
msgstr
""
#:
../../library/collections.rst:457
msgid
""
"map(Counter, combinations_with_replacement('ABC', 2)) # --> AA AB AC BB BC CC"
msgstr
""
#:
../../library/collections.rst:461
msgid
":class:`deque` objects"
msgstr
""
#:
../../library/collections.rst:465
msgid
""
"Returns a new deque object initialized left-to-right (using :meth:`append`) "
"with data from *iterable*. If *iterable* is not specified, the new deque is "
"empty."
msgstr
""
#:
../../library/collections.rst:468
msgid
""
"Deques are a generalization of stacks and queues (the name is pronounced "
"
\"
deck
\"
and is short for
\"
double-ended queue
\"
). Deques support thread-"
"safe, memory efficient appends and pops from either side of the deque with "
"approximately the same *O*
\\
(1) performance in either direction."
msgstr
""
#:
../../library/collections.rst:473
msgid
""
"Though :class:`list` objects support similar operations, they are optimized "
"for fast fixed-length operations and incur *O*
\\
(*n*) memory movement costs "
"for ``pop(0)`` and ``insert(0, v)`` operations which change both the size "
"and position of the underlying data representation."
msgstr
""
#:
../../library/collections.rst:479
msgid
""
"If *maxlen* is not specified or is ``None``, deques may grow to an arbitrary "
"length. Otherwise, the deque is bounded to the specified maximum length. "
"Once a bounded length deque is full, when new items are added, a "
"corresponding number of items are discarded from the opposite end. Bounded "
"length deques provide functionality similar to the ``tail`` filter in Unix. "
"They are also useful for tracking transactions and other pools of data where "
"only the most recent activity is of interest."
msgstr
""
#:
../../library/collections.rst:487
msgid
"Deques are :ref:`generic <generics>` over the type of their contents."
msgstr
""
#:
../../library/collections.rst:490
msgid
"Deque objects support the following methods:"
msgstr
""
#:
../../library/collections.rst:494
msgid
"Add *item* to the right side of the deque."
msgstr
""
#:
../../library/collections.rst:499
msgid
"Add *item* to the left side of the deque."
msgstr
""
#:
../../library/collections.rst:504
msgid
"Remove all elements from the deque leaving it with length 0."
msgstr
""
#:
../../library/collections.rst:509
msgid
"Create a shallow copy of the deque."
msgstr
""
#:
../../library/collections.rst:516
msgid
"Count the number of deque elements equal to *value*."
msgstr
""
#:
../../library/collections.rst:523
msgid
""
"Extend the right side of the deque by appending elements from the iterable "
"argument."
msgstr
""
#:
../../library/collections.rst:529
msgid
""
"Extend the left side of the deque by appending elements from *iterable*. "
"Note, the series of left appends results in reversing the order of elements "
"in the iterable argument."
msgstr
""
#:
../../library/collections.rst:536
msgid
""
"Return the position of *value* in the deque (at or after index *start* and "
"before index *stop*). Returns the first match or raises :exc:`ValueError` "
"if not found."
msgstr
""
#:
../../library/collections.rst:545
msgid
"Insert *value* into the deque at position *index*."
msgstr
""
#:
../../library/collections.rst:547
msgid
""
"If the insertion would cause a bounded deque to grow beyond *maxlen*, an :"
"exc:`IndexError` is raised."
msgstr
""
#:
../../library/collections.rst:555
msgid
""
"Remove and return an element from the right side of the deque. If no "
"elements are present, raises an :exc:`IndexError`."
msgstr
""
#:
../../library/collections.rst:561
msgid
""
"Remove and return an element from the left side of the deque. If no elements "
"are present, raises an :exc:`IndexError`."
msgstr
""
#:
../../library/collections.rst:567
msgid
""
"Remove the first occurrence of *value*. If not found, raises a :exc:"
"`ValueError`."
msgstr
""
#:
../../library/collections.rst:573
msgid
"Reverse the elements of the deque in-place and then return ``None``."
msgstr
""
#:
../../library/collections.rst:580
msgid
""
"Rotate the deque *n* steps to the right. If *n* is negative, rotate to the "
"left."
msgstr
""
#:
../../library/collections.rst:583
msgid
""
"When the deque is not empty, rotating one step to the right is equivalent to "
"``d.appendleft(d.pop())``, and rotating one step to the left is equivalent "
"to ``d.append(d.popleft())``."
msgstr
""
#:
../../library/collections.rst:588
msgid
"Deque objects also provide one read-only attribute:"
msgstr
""
#:
../../library/collections.rst:592
msgid
"Maximum size of a deque or ``None`` if unbounded."
msgstr
""
#:
../../library/collections.rst:597
msgid
""
"In addition to the above, deques support iteration, pickling, ``len(d)``, "
"``reversed(d)``, ``copy.copy(d)``, ``copy.deepcopy(d)``, membership testing "
"with the :keyword:`in` operator, and subscript references such as ``d[0]`` "
"to access the first element. Indexed access is *O*
\\
(1) at both ends but "
"slows to *O*
\\
(*n*) in the middle. For fast random access, use lists "
"instead."
msgstr
""
#:
../../library/collections.rst:603
msgid
""
"Starting in version 3.5, deques support ``__add__()``, ``__mul__()``, and "
"``__imul__()``."
msgstr
""
#:
../../library/collections.rst:606
msgid
"Example:"
msgstr
"Beispiel:"
#:
../../library/collections.rst:608
msgid
""
">>> from collections import deque\n"
">>> d = deque('ghi') # make a new deque with three items\n"
">>> for elem in d: # iterate over the deque's elements\n"
"... print(elem.upper())\n"
"G\n"
"H\n"
"I\n"
"\n"
">>> d.append('j') # add a new entry to the right side\n"
">>> d.appendleft('f') # add a new entry to the left side\n"
">>> d # show the representation of the deque\n"
"deque(['f', 'g', 'h', 'i', 'j'])\n"
"\n"
">>> d.pop() # return and remove the rightmost item\n"
"'j'\n"
">>> d.popleft() # return and remove the leftmost item\n"
"'f'\n"
">>> list(d) # list the contents of the deque\n"
"['g', 'h', 'i']\n"
">>> d[0] # peek at leftmost item\n"
"'g'\n"
">>> d[-1] # peek at rightmost item\n"
"'i'\n"
"\n"
">>> list(reversed(d)) # list the contents of a deque in "
"reverse\n"
"['i', 'h', 'g']\n"
">>> 'h' in d # search the deque\n"
"True\n"
">>> d.extend('jkl') # add multiple elements at once\n"
">>> d\n"
"deque(['g', 'h', 'i', 'j', 'k', 'l'])\n"
">>> d.rotate(1) # right rotation\n"
">>> d\n"
"deque(['l', 'g', 'h', 'i', 'j', 'k'])\n"
">>> d.rotate(-1) # left rotation\n"
">>> d\n"
"deque(['g', 'h', 'i', 'j', 'k', 'l'])\n"
"\n"
">>> deque(reversed(d)) # make a new deque in reverse order\n"
"deque(['l', 'k', 'j', 'i', 'h', 'g'])\n"
">>> d.clear() # empty the deque\n"
">>> d.pop() # cannot pop from an empty deque\n"
"Traceback (most recent call last):\n"
" File
\"
<pyshell#6>
\"
, line 1, in -toplevel-\n"
" d.pop()\n"
"IndexError: pop from an empty deque\n"
"\n"
">>> d.extendleft('abc') # extendleft() reverses the input "
"order\n"
">>> d\n"
"deque(['c', 'b', 'a'])"
msgstr
""
#:
../../library/collections.rst:663
msgid
":class:`deque` Recipes"
msgstr
""
#:
../../library/collections.rst:665
msgid
"This section shows various approaches to working with deques."
msgstr
""
#:
../../library/collections.rst:667
msgid
""
"Bounded length deques provide functionality similar to the ``tail`` filter "
"in Unix::"
msgstr
""
#:
../../library/collections.rst:670
msgid
""
"def tail(filename, n=10):\n"
" 'Return the last n lines of a file'\n"
" with open(filename) as f:\n"
" return deque(f, n)"
msgstr
""
#:
../../library/collections.rst:675
msgid
""
"Another approach to using deques is to maintain a sequence of recently added "
"elements by appending to the right and popping to the left::"
msgstr
""
#:
../../library/collections.rst:678
msgid
""
"def moving_average(iterable, n=3):\n"
" # moving_average([40, 30, 50, 46, 39, 44]) --> 40.0 42.0 45.0 43.0\n"
" # https://en.wikipedia.org/wiki/Moving_average\n"
" it = iter(iterable)\n"
" d = deque(itertools.islice(it, n-1))\n"
" d.appendleft(0)\n"
" s = sum(d)\n"
" for elem in it:\n"
" s += elem - d.popleft()\n"
" d.append(elem)\n"
" yield s / n"
msgstr
""
#:
../../library/collections.rst:690
msgid
""
"A `round-robin scheduler <https://en.wikipedia.org/wiki/Round-"
"robin_scheduling>`_ can be implemented with input iterators stored in a :"
"class:`deque`. Values are yielded from the active iterator in position "
"zero. If that iterator is :term:`exhausted`, it can be removed with :meth:"
"`~deque.popleft`; otherwise, it can be cycled back to the end with the :meth:"
"`~deque.rotate` method::"
msgstr
""
#:
../../library/collections.rst:697
msgid
""
"def roundrobin(*iterables):\n"
"
\"
roundrobin('ABC', 'D', 'EF') --> A D E B F C
\"
\n"
" iterators = deque(map(iter, iterables))\n"
" while iterators:\n"
" try:\n"
" while True:\n"
" yield next(iterators[0])\n"
" iterators.rotate(-1)\n"
" except StopIteration:\n"
" # Remove an exhausted iterator.\n"
" iterators.popleft()"
msgstr
""
#:
../../library/collections.rst:709
msgid
""
"The :meth:`~deque.rotate` method provides a way to implement :class:`deque` "
"slicing and deletion. For example, a pure Python implementation of ``del "
"d[n]`` relies on the ``rotate()`` method to position elements to be popped::"
msgstr
""
#:
../../library/collections.rst:713
msgid
""
"def delete_nth(d, n):\n"
" d.rotate(-n)\n"
" d.popleft()\n"
" d.rotate(n)"
msgstr
""
#:
../../library/collections.rst:718
msgid
""
"To implement :class:`deque` slicing, use a similar approach applying :meth:"
"`~deque.rotate` to bring a target element to the left side of the deque. "
"Remove old entries with :meth:`~deque.popleft`, add new entries with :meth:"
"`~deque.extend`, and then reverse the rotation. With minor variations on "
"that approach, it is easy to implement Forth style stack manipulations such "
"as ``dup``, ``drop``, ``swap``, ``over``, ``pick``, ``rot``, and ``roll``."
msgstr
""
#:
../../library/collections.rst:728
msgid
":class:`defaultdict` objects"
msgstr
""
#:
../../library/collections.rst:734
msgid
""
"Return a new dictionary-like object. :class:`defaultdict` is a subclass of "
"the built-in :class:`dict` class. It overrides one method and adds one "
"writable instance variable. The remaining functionality is the same as for "
"the :class:`dict` class and is not documented here."
msgstr
""
#:
../../library/collections.rst:739
msgid
""
"The first argument provides the initial value for the :attr:"
"`default_factory` attribute; it defaults to ``None``. All remaining "
"arguments are treated the same as if they were passed to the :class:`dict` "
"constructor, including keyword arguments."
msgstr
""
#:
../../library/collections.rst:744
msgid
""
":class:`!defaultdict`
\\
s are :ref:`generic <generics>` over two types, "
"signifying (respectively) the types of the dictionary's keys and values."
msgstr
""
#:
../../library/collections.rst:748
msgid
""
":class:`defaultdict` objects support the following method in addition to the "
"standard :class:`dict` operations:"
msgstr
""
#:
../../library/collections.rst:753
msgid
""
"If the :attr:`default_factory` attribute is ``None``, this raises a :exc:"
"`KeyError` exception with the *key* as argument."
msgstr
""
#:
../../library/collections.rst:756
msgid
""
"If :attr:`default_factory` is not ``None``, it is called without arguments "
"to provide a default value for the given *key*, this value is inserted in "
"the dictionary for the *key*, and returned."
msgstr
""
#:
../../library/collections.rst:760
msgid
""
"If calling :attr:`default_factory` raises an exception this exception is "
"propagated unchanged."
msgstr
""
#:
../../library/collections.rst:763
View remainder of file in raw view
Back
|
FazBrowse Home
|
New Git URL