-
-
Notifications
You must be signed in to change notification settings - Fork 23
Expand file tree
/
Copy pathdifflib.po
More file actions
1049 lines (909 loc) · 33.8 KB
/
difflib.po
File metadata and controls
1049 lines (909 loc) · 33.8 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-2024, Python Software Foundation
# This file is distributed under the same license as the Python package.
# FIRST AUTHOR <EMAIL@ADDRESS>, YEAR.
#
#, fuzzy
msgid ""
msgstr ""
"Project-Id-Version: Python 3.12\n"
"Report-Msgid-Bugs-To: \n"
"POT-Creation-Date: 2025-11-26 22:26+0200\n"
"PO-Revision-Date: YEAR-MO-DA HO:MI+ZONE\n"
"Last-Translator: FULL NAME <EMAIL@ADDRESS>\n"
"Language-Team: LANGUAGE <LL@li.org>\n"
"Language: \n"
"MIME-Version: 1.0\n"
"Content-Type: text/plain; charset=UTF-8\n"
"Content-Transfer-Encoding: 8bit\n"
#: library/difflib.rst:2
msgid ":mod:`!difflib` --- Helpers for computing deltas"
msgstr ""
#: library/difflib.rst:11
msgid "**Source code:** :source:`Lib/difflib.py`"
msgstr ""
#: library/difflib.rst:20
msgid ""
"This module provides classes and functions for comparing sequences. It can "
"be used for example, for comparing files, and can produce information about "
"file differences in various formats, including HTML and context and unified "
"diffs. For comparing directories and files, see also, the :mod:`filecmp` "
"module."
msgstr ""
#: library/difflib.rst:29
msgid ""
"This is a flexible class for comparing pairs of sequences of any type, so "
"long as the sequence elements are :term:`hashable`. The basic algorithm "
"predates, and is a little fancier than, an algorithm published in the late "
"1980's by Ratcliff and Obershelp under the hyperbolic name \"gestalt pattern "
"matching.\" The idea is to find the longest contiguous matching subsequence "
"that contains no \"junk\" elements; these \"junk\" elements are ones that "
"are uninteresting in some sense, such as blank lines or whitespace. "
"(Handling junk is an extension to the Ratcliff and Obershelp algorithm.) The "
"same idea is then applied recursively to the pieces of the sequences to the "
"left and to the right of the matching subsequence. This does not yield "
"minimal edit sequences, but does tend to yield matches that \"look right\" "
"to people."
msgstr ""
#: library/difflib.rst:41
msgid ""
"**Timing:** The basic Ratcliff-Obershelp algorithm is cubic time in the "
"worst case and quadratic time in the expected case. :class:`SequenceMatcher` "
"is quadratic time for the worst case and has expected-case behavior "
"dependent in a complicated way on how many elements the sequences have in "
"common; best case time is linear."
msgstr ""
#: library/difflib.rst:47
msgid ""
"**Automatic junk heuristic:** :class:`SequenceMatcher` supports a heuristic "
"that automatically treats certain sequence items as junk. The heuristic "
"counts how many times each individual item appears in the sequence. If an "
"item's duplicates (after the first one) account for more than 1% of the "
"sequence and the sequence is at least 200 items long, this item is marked as "
"\"popular\" and is treated as junk for the purpose of sequence matching. "
"This heuristic can be turned off by setting the ``autojunk`` argument to "
"``False`` when creating the :class:`SequenceMatcher`."
msgstr ""
#: library/difflib.rst:386
msgid "Added the *autojunk* parameter."
msgstr ""
#: library/difflib.rst:61
msgid ""
"This is a class for comparing sequences of lines of text, and producing "
"human-readable differences or deltas. Differ uses :class:`SequenceMatcher` "
"both to compare sequences of lines, and to compare sequences of characters "
"within similar (near-matching) lines."
msgstr ""
#: library/difflib.rst:66
msgid "Each line of a :class:`Differ` delta begins with a two-letter code:"
msgstr ""
#: library/difflib.rst:69
msgid "Code"
msgstr ""
#: library/difflib.rst:496
msgid "Meaning"
msgstr ""
#: library/difflib.rst:71
msgid "``'- '``"
msgstr ""
#: library/difflib.rst:71
msgid "line unique to sequence 1"
msgstr ""
#: library/difflib.rst:73
msgid "``'+ '``"
msgstr ""
#: library/difflib.rst:73
msgid "line unique to sequence 2"
msgstr ""
#: library/difflib.rst:75
msgid "``' '``"
msgstr ""
#: library/difflib.rst:75
msgid "line common to both sequences"
msgstr ""
#: library/difflib.rst:77
msgid "``'? '``"
msgstr ""
#: library/difflib.rst:77
msgid "line not present in either input sequence"
msgstr ""
#: library/difflib.rst:80
msgid ""
"Lines beginning with '``?``' attempt to guide the eye to intraline "
"differences, and were not present in either input sequence. These lines can "
"be confusing if the sequences contain whitespace characters, such as spaces, "
"tabs or line breaks."
msgstr ""
#: library/difflib.rst:87
msgid ""
"This class can be used to create an HTML table (or a complete HTML file "
"containing the table) showing a side by side, line by line comparison of "
"text with inter-line and intra-line change highlights. The table can be "
"generated in either full or contextual difference mode."
msgstr ""
#: library/difflib.rst:92
msgid "The constructor for this class is:"
msgstr ""
#: library/difflib.rst:97
msgid "Initializes instance of :class:`HtmlDiff`."
msgstr ""
#: library/difflib.rst:99
msgid ""
"*tabsize* is an optional keyword argument to specify tab stop spacing and "
"defaults to ``8``."
msgstr ""
#: library/difflib.rst:102
msgid ""
"*wrapcolumn* is an optional keyword to specify column number where lines are "
"broken and wrapped, defaults to ``None`` where lines are not wrapped."
msgstr ""
#: library/difflib.rst:105
msgid ""
"*linejunk* and *charjunk* are optional keyword arguments passed into :func:"
"`ndiff` (used by :class:`HtmlDiff` to generate the side by side HTML "
"differences). See :func:`ndiff` documentation for argument default values "
"and descriptions."
msgstr ""
#: library/difflib.rst:109
msgid "The following methods are public:"
msgstr ""
#: library/difflib.rst:114
msgid ""
"Compares *fromlines* and *tolines* (lists of strings) and returns a string "
"which is a complete HTML file containing a table showing line by line "
"differences with inter-line and intra-line changes highlighted."
msgstr ""
#: library/difflib.rst:118
msgid ""
"*fromdesc* and *todesc* are optional keyword arguments to specify from/to "
"file column header strings (both default to an empty string)."
msgstr ""
#: library/difflib.rst:121
msgid ""
"*context* and *numlines* are both optional keyword arguments. Set *context* "
"to ``True`` when contextual differences are to be shown, else the default is "
"``False`` to show the full files. *numlines* defaults to ``5``. When "
"*context* is ``True`` *numlines* controls the number of context lines which "
"surround the difference highlights. When *context* is ``False`` *numlines* "
"controls the number of lines which are shown before a difference highlight "
"when using the \"next\" hyperlinks (setting to zero would cause the \"next\" "
"hyperlinks to place the next difference highlight at the top of the browser "
"without any leading context)."
msgstr ""
#: library/difflib.rst:132
msgid ""
"*fromdesc* and *todesc* are interpreted as unescaped HTML and should be "
"properly escaped while receiving input from untrusted sources."
msgstr ""
#: library/difflib.rst:135
msgid ""
"*charset* keyword-only argument was added. The default charset of HTML "
"document changed from ``'ISO-8859-1'`` to ``'utf-8'``."
msgstr ""
#: library/difflib.rst:141
msgid ""
"Compares *fromlines* and *tolines* (lists of strings) and returns a string "
"which is a complete HTML table showing line by line differences with inter-"
"line and intra-line changes highlighted."
msgstr ""
#: library/difflib.rst:145
msgid ""
"The arguments for this method are the same as those for the :meth:"
"`make_file` method."
msgstr ""
#: library/difflib.rst:152
msgid ""
"Compare *a* and *b* (lists of strings); return a delta (a :term:`generator` "
"generating the delta lines) in context diff format."
msgstr ""
#: library/difflib.rst:155
msgid ""
"Context diffs are a compact way of showing just the lines that have changed "
"plus a few lines of context. The changes are shown in a before/after "
"style. The number of context lines is set by *n* which defaults to three."
msgstr ""
#: library/difflib.rst:159
msgid ""
"By default, the diff control lines (those with ``***`` or ``---``) are "
"created with a trailing newline. This is helpful so that inputs created "
"from :func:`io.IOBase.readlines` result in diffs that are suitable for use "
"with :func:`io.IOBase.writelines` since both the inputs and outputs have "
"trailing newlines."
msgstr ""
#: library/difflib.rst:297
msgid ""
"For inputs that do not have trailing newlines, set the *lineterm* argument "
"to ``\"\"`` so that the output will be uniformly newline free."
msgstr ""
#: library/difflib.rst:168
msgid ""
"The context diff format normally has a header for filenames and modification "
"times. Any or all of these may be specified using strings for *fromfile*, "
"*tofile*, *fromfiledate*, and *tofiledate*. The modification times are "
"normally expressed in the ISO 8601 format. If not specified, the strings "
"default to blanks."
msgstr ""
#: library/difflib.rst:320
msgid "See :ref:`difflib-interface` for a more detailed example."
msgstr ""
#: library/difflib.rst:199
msgid ""
"Return a list of the best \"good enough\" matches. *word* is a sequence for "
"which close matches are desired (typically a string), and *possibilities* is "
"a list of sequences against which to match *word* (typically a list of "
"strings)."
msgstr ""
#: library/difflib.rst:203
msgid ""
"Optional argument *n* (default ``3``) is the maximum number of close matches "
"to return; *n* must be greater than ``0``."
msgstr ""
#: library/difflib.rst:206
msgid ""
"Optional argument *cutoff* (default ``0.6``) is a float in the range [0, 1]. "
"Possibilities that don't score at least that similar to *word* are ignored."
msgstr ""
#: library/difflib.rst:209
msgid ""
"The best (no more than *n*) matches among the possibilities are returned in "
"a list, sorted by similarity score, most similar first."
msgstr ""
#: library/difflib.rst:225
msgid ""
"Compare *a* and *b* (lists of strings); return a :class:`Differ`\\ -style "
"delta (a :term:`generator` generating the delta lines)."
msgstr ""
#: library/difflib.rst:228
msgid ""
"Optional keyword parameters *linejunk* and *charjunk* are filtering "
"functions (or ``None``):"
msgstr ""
#: library/difflib.rst:231
msgid ""
"*linejunk*: A function that accepts a single string argument, and returns "
"true if the string is junk, or false if not. The default is ``None``. There "
"is also a module-level function :func:`IS_LINE_JUNK`, which filters out "
"lines without visible characters, except for at most one pound character "
"(``'#'``) -- however the underlying :class:`SequenceMatcher` class does a "
"dynamic analysis of which lines are so frequent as to constitute noise, and "
"this usually works better than using this function."
msgstr ""
#: library/difflib.rst:239
msgid ""
"*charjunk*: A function that accepts a character (a string of length 1), and "
"returns if the character is junk, or false if not. The default is module-"
"level function :func:`IS_CHARACTER_JUNK`, which filters out whitespace "
"characters (a blank or tab; it's a bad idea to include newline in this!)."
msgstr ""
#: library/difflib.rst:260
msgid "Return one of the two sequences that generated a delta."
msgstr ""
#: library/difflib.rst:262
msgid ""
"Given a *sequence* produced by :meth:`Differ.compare` or :func:`ndiff`, "
"extract lines originating from file 1 or 2 (parameter *which*), stripping "
"off line prefixes."
msgstr ""
#: library/difflib.rst:266
msgid "Example:"
msgstr ""
#: library/difflib.rst:283
msgid ""
"Compare *a* and *b* (lists of strings); return a delta (a :term:`generator` "
"generating the delta lines) in unified diff format."
msgstr ""
#: library/difflib.rst:286
msgid ""
"Unified diffs are a compact way of showing just the lines that have changed "
"plus a few lines of context. The changes are shown in an inline style "
"(instead of separate before/after blocks). The number of context lines is "
"set by *n* which defaults to three."
msgstr ""
#: library/difflib.rst:291
msgid ""
"By default, the diff control lines (those with ``---``, ``+++``, or ``@@``) "
"are created with a trailing newline. This is helpful so that inputs created "
"from :func:`io.IOBase.readlines` result in diffs that are suitable for use "
"with :func:`io.IOBase.writelines` since both the inputs and outputs have "
"trailing newlines."
msgstr ""
#: library/difflib.rst:300
msgid ""
"The unified diff format normally has a header for filenames and modification "
"times. Any or all of these may be specified using strings for *fromfile*, "
"*tofile*, *fromfiledate*, and *tofiledate*. The modification times are "
"normally expressed in the ISO 8601 format. If not specified, the strings "
"default to blanks."
msgstr ""
#: library/difflib.rst:324
msgid ""
"Compare *a* and *b* (lists of bytes objects) using *dfunc*; yield a sequence "
"of delta lines (also bytes) in the format returned by *dfunc*. *dfunc* must "
"be a callable, typically either :func:`unified_diff` or :func:`context_diff`."
msgstr ""
#: library/difflib.rst:329
msgid ""
"Allows you to compare data with unknown or inconsistent encoding. All inputs "
"except *n* must be bytes objects, not str. Works by losslessly converting "
"all inputs (except *n*) to str, and calling ``dfunc(a, b, fromfile, tofile, "
"fromfiledate, tofiledate, n, lineterm)``. The output of *dfunc* is then "
"converted back to bytes, so the delta lines that you receive have the same "
"unknown/inconsistent encodings as *a* and *b*."
msgstr ""
#: library/difflib.rst:340
msgid ""
"Return ``True`` for ignorable lines. The line *line* is ignorable if *line* "
"is blank or contains a single ``'#'``, otherwise it is not ignorable. Used "
"as a default for parameter *linejunk* in :func:`ndiff` in older versions."
msgstr ""
#: library/difflib.rst:347
msgid ""
"Return ``True`` for ignorable characters. The character *ch* is ignorable "
"if *ch* is a space or tab, otherwise it is not ignorable. Used as a default "
"for parameter *charjunk* in :func:`ndiff`."
msgstr ""
#: library/difflib.rst:354
msgid ""
"`Pattern Matching: The Gestalt Approach <https://www.drdobbs.com/database/"
"pattern-matching-the-gestalt-approach/184407970>`_"
msgstr ""
#: library/difflib.rst:355
msgid ""
"Discussion of a similar algorithm by John W. Ratcliff and D. E. Metzener. "
"This was published in `Dr. Dobb's Journal <https://www.drdobbs.com/>`_ in "
"July, 1988."
msgstr ""
#: library/difflib.rst:362
msgid "SequenceMatcher Objects"
msgstr ""
#: library/difflib.rst:364
msgid "The :class:`SequenceMatcher` class has this constructor:"
msgstr ""
#: library/difflib.rst:369
msgid ""
"Optional argument *isjunk* must be ``None`` (the default) or a one-argument "
"function that takes a sequence element and returns true if and only if the "
"element is \"junk\" and should be ignored. Passing ``None`` for *isjunk* is "
"equivalent to passing ``lambda x: False``; in other words, no elements are "
"ignored. For example, pass::"
msgstr ""
#: library/difflib.rst:375
msgid "lambda x: x in \" \\t\""
msgstr ""
#: library/difflib.rst:377
msgid ""
"if you're comparing lines as sequences of characters, and don't want to "
"synch up on blanks or hard tabs."
msgstr ""
#: library/difflib.rst:380
msgid ""
"The optional arguments *a* and *b* are sequences to be compared; both "
"default to empty strings. The elements of both sequences must be :term:"
"`hashable`."
msgstr ""
#: library/difflib.rst:383
msgid ""
"The optional argument *autojunk* can be used to disable the automatic junk "
"heuristic."
msgstr ""
#: library/difflib.rst:389
msgid ""
"SequenceMatcher objects get three data attributes: *bjunk* is the set of "
"elements of *b* for which *isjunk* is ``True``; *bpopular* is the set of non-"
"junk elements considered popular by the heuristic (if it is not disabled); "
"*b2j* is a dict mapping the remaining elements of *b* to a list of positions "
"where they occur. All three are reset whenever *b* is reset with :meth:"
"`set_seqs` or :meth:`set_seq2`."
msgstr ""
#: library/difflib.rst:396
msgid "The *bjunk* and *bpopular* attributes."
msgstr ""
#: library/difflib.rst:399
msgid ":class:`SequenceMatcher` objects have the following methods:"
msgstr ""
#: library/difflib.rst:403
msgid "Set the two sequences to be compared."
msgstr ""
#: library/difflib.rst:405
msgid ""
":class:`SequenceMatcher` computes and caches detailed information about the "
"second sequence, so if you want to compare one sequence against many "
"sequences, use :meth:`set_seq2` to set the commonly used sequence once and "
"call :meth:`set_seq1` repeatedly, once for each of the other sequences."
msgstr ""
#: library/difflib.rst:413
msgid ""
"Set the first sequence to be compared. The second sequence to be compared "
"is not changed."
msgstr ""
#: library/difflib.rst:419
msgid ""
"Set the second sequence to be compared. The first sequence to be compared "
"is not changed."
msgstr ""
#: library/difflib.rst:425
msgid "Find longest matching block in ``a[alo:ahi]`` and ``b[blo:bhi]``."
msgstr ""
#: library/difflib.rst:427
msgid ""
"If *isjunk* was omitted or ``None``, :meth:`find_longest_match` returns "
"``(i, j, k)`` such that ``a[i:i+k]`` is equal to ``b[j:j+k]``, where ``alo "
"<= i <= i+k <= ahi`` and ``blo <= j <= j+k <= bhi``. For all ``(i', j', "
"k')`` meeting those conditions, the additional conditions ``k >= k'``, ``i "
"<= i'``, and if ``i == i'``, ``j <= j'`` are also met. In other words, of "
"all maximal matching blocks, return one that starts earliest in *a*, and of "
"all those maximal matching blocks that start earliest in *a*, return the one "
"that starts earliest in *b*."
msgstr ""
#: library/difflib.rst:440
msgid ""
"If *isjunk* was provided, first the longest matching block is determined as "
"above, but with the additional restriction that no junk element appears in "
"the block. Then that block is extended as far as possible by matching "
"(only) junk elements on both sides. So the resulting block never matches on "
"junk except as identical junk happens to be adjacent to an interesting match."
msgstr ""
#: library/difflib.rst:447
msgid ""
"Here's the same example as before, but considering blanks to be junk. That "
"prevents ``' abcd'`` from matching the ``' abcd'`` at the tail end of the "
"second sequence directly. Instead only the ``'abcd'`` can match, and "
"matches the leftmost ``'abcd'`` in the second sequence:"
msgstr ""
#: library/difflib.rst:456
msgid "If no blocks match, this returns ``(alo, blo, 0)``."
msgstr ""
#: library/difflib.rst:458
msgid "This method returns a :term:`named tuple` ``Match(a, b, size)``."
msgstr ""
#: library/difflib.rst:460
msgid "Added default arguments."
msgstr ""
#: library/difflib.rst:466
msgid ""
"Return list of triples describing non-overlapping matching subsequences. "
"Each triple is of the form ``(i, j, n)``, and means that ``a[i:i+n] == b[j:"
"j+n]``. The triples are monotonically increasing in *i* and *j*."
msgstr ""
#: library/difflib.rst:471
msgid ""
"The last triple is a dummy, and has the value ``(len(a), len(b), 0)``. It "
"is the only triple with ``n == 0``. If ``(i, j, n)`` and ``(i', j', n')`` "
"are adjacent triples in the list, and the second is not the last triple in "
"the list, then ``i+n < i'`` or ``j+n < j'``; in other words, adjacent "
"triples always describe non-adjacent equal blocks."
msgstr ""
#: library/difflib.rst:479
msgid ""
">>> s = SequenceMatcher(None, \"abxcd\", \"abcd\")\n"
">>> s.get_matching_blocks()\n"
"[Match(a=0, b=0, size=2), Match(a=3, b=2, size=2), Match(a=5, b=4, size=0)]"
msgstr ""
#: library/difflib.rst:488
msgid ""
"Return list of 5-tuples describing how to turn *a* into *b*. Each tuple is "
"of the form ``(tag, i1, i2, j1, j2)``. The first tuple has ``i1 == j1 == "
"0``, and remaining tuples have *i1* equal to the *i2* from the preceding "
"tuple, and, likewise, *j1* equal to the previous *j2*."
msgstr ""
#: library/difflib.rst:493
msgid "The *tag* values are strings, with these meanings:"
msgstr ""
#: library/difflib.rst:496
msgid "Value"
msgstr ""
#: library/difflib.rst:498
msgid "``'replace'``"
msgstr ""
#: library/difflib.rst:498
msgid "``a[i1:i2]`` should be replaced by ``b[j1:j2]``."
msgstr ""
#: library/difflib.rst:501
msgid "``'delete'``"
msgstr ""
#: library/difflib.rst:501
msgid "``a[i1:i2]`` should be deleted. Note that ``j1 == j2`` in this case."
msgstr ""
#: library/difflib.rst:504
msgid "``'insert'``"
msgstr ""
#: library/difflib.rst:504
msgid ""
"``b[j1:j2]`` should be inserted at ``a[i1:i1]``. Note that ``i1 == i2`` in "
"this case."
msgstr ""
#: library/difflib.rst:508
msgid "``'equal'``"
msgstr ""
#: library/difflib.rst:508
msgid "``a[i1:i2] == b[j1:j2]`` (the sub-sequences are equal)."
msgstr ""
#: library/difflib.rst:512
msgid "For example::"
msgstr ""
#: library/difflib.rst:514
msgid ""
">>> a = \"qabxcd\"\n"
">>> b = \"abycdf\"\n"
">>> s = SequenceMatcher(None, a, b)\n"
">>> for tag, i1, i2, j1, j2 in s.get_opcodes():\n"
"... print('{:7} a[{}:{}] --> b[{}:{}] {!r:>8} --> {!r}'.format(\n"
"... tag, i1, i2, j1, j2, a[i1:i2], b[j1:j2]))\n"
"delete a[0:1] --> b[0:0] 'q' --> ''\n"
"equal a[1:3] --> b[0:2] 'ab' --> 'ab'\n"
"replace a[3:4] --> b[2:3] 'x' --> 'y'\n"
"equal a[4:6] --> b[3:5] 'cd' --> 'cd'\n"
"insert a[6:6] --> b[5:6] '' --> 'f'"
msgstr ""
#: library/difflib.rst:529
msgid "Return a :term:`generator` of groups with up to *n* lines of context."
msgstr ""
#: library/difflib.rst:531
msgid ""
"Starting with the groups returned by :meth:`get_opcodes`, this method splits "
"out smaller change clusters and eliminates intervening ranges which have no "
"changes."
msgstr ""
#: library/difflib.rst:535
msgid "The groups are returned in the same format as :meth:`get_opcodes`."
msgstr ""
#: library/difflib.rst:540
msgid ""
"Return a measure of the sequences' similarity as a float in the range [0, 1]."
msgstr ""
#: library/difflib.rst:543
msgid ""
"Where T is the total number of elements in both sequences, and M is the "
"number of matches, this is 2.0\\*M / T. Note that this is ``1.0`` if the "
"sequences are identical, and ``0.0`` if they have nothing in common."
msgstr ""
#: library/difflib.rst:547
msgid ""
"This is expensive to compute if :meth:`get_matching_blocks` or :meth:"
"`get_opcodes` hasn't already been called, in which case you may want to try :"
"meth:`quick_ratio` or :meth:`real_quick_ratio` first to get an upper bound."
msgstr ""
#: library/difflib.rst:554
msgid ""
"Caution: The result of a :meth:`ratio` call may depend on the order of the "
"arguments. For instance::"
msgstr ""
#: library/difflib.rst:557
msgid ""
">>> SequenceMatcher(None, 'tide', 'diet').ratio()\n"
"0.25\n"
">>> SequenceMatcher(None, 'diet', 'tide').ratio()\n"
"0.5"
msgstr ""
#: library/difflib.rst:565
msgid "Return an upper bound on :meth:`ratio` relatively quickly."
msgstr ""
#: library/difflib.rst:570
msgid "Return an upper bound on :meth:`ratio` very quickly."
msgstr ""
#: library/difflib.rst:573
msgid ""
"The three methods that return the ratio of matching to total characters can "
"give different results due to differing levels of approximation, although :"
"meth:`~SequenceMatcher.quick_ratio` and :meth:`~SequenceMatcher."
"real_quick_ratio` are always at least as large as :meth:`~SequenceMatcher."
"ratio`:"
msgstr ""
#: library/difflib.rst:590
msgid "SequenceMatcher Examples"
msgstr ""
#: library/difflib.rst:592
msgid "This example compares two strings, considering blanks to be \"junk\":"
msgstr ""
#: library/difflib.rst:598
msgid ""
":meth:`~SequenceMatcher.ratio` returns a float in [0, 1], measuring the "
"similarity of the sequences. As a rule of thumb, a :meth:`~SequenceMatcher."
"ratio` value over 0.6 means the sequences are close matches:"
msgstr ""
#: library/difflib.rst:605
msgid ""
"If you're only interested in where the sequences match, :meth:"
"`~SequenceMatcher.get_matching_blocks` is handy:"
msgstr ""
#: library/difflib.rst:614
msgid ""
"Note that the last tuple returned by :meth:`~SequenceMatcher."
"get_matching_blocks` is always a dummy, ``(len(a), len(b), 0)``, and this is "
"the only case in which the last tuple element (number of elements matched) "
"is ``0``."
msgstr ""
#: library/difflib.rst:618
msgid ""
"If you want to know how to change the first sequence into the second, use :"
"meth:`~SequenceMatcher.get_opcodes`:"
msgstr ""
#: library/difflib.rst:629
msgid ""
"The :func:`get_close_matches` function in this module which shows how simple "
"code building on :class:`SequenceMatcher` can be used to do useful work."
msgstr ""
#: library/difflib.rst:633
msgid ""
"`Simple version control recipe <https://code.activestate.com/recipes/576729-"
"simple-version-control/>`_ for a small application built with :class:"
"`SequenceMatcher`."
msgstr ""
#: library/difflib.rst:641
msgid "Differ Objects"
msgstr ""
#: library/difflib.rst:643
msgid ""
"Note that :class:`Differ`\\ -generated deltas make no claim to be "
"**minimal** diffs. To the contrary, minimal diffs are often counter-"
"intuitive, because they synch up anywhere possible, sometimes accidental "
"matches 100 pages apart. Restricting synch points to contiguous matches "
"preserves some notion of locality, at the occasional cost of producing a "
"longer diff."
msgstr ""
#: library/difflib.rst:649
msgid "The :class:`Differ` class has this constructor:"
msgstr ""
#: library/difflib.rst:655
msgid ""
"Optional keyword parameters *linejunk* and *charjunk* are for filter "
"functions (or ``None``):"
msgstr ""
#: library/difflib.rst:658
msgid ""
"*linejunk*: A function that accepts a single string argument, and returns "
"true if the string is junk. The default is ``None``, meaning that no line "
"is considered junk."
msgstr ""
#: library/difflib.rst:662
msgid ""
"*charjunk*: A function that accepts a single character argument (a string of "
"length 1), and returns true if the character is junk. The default is "
"``None``, meaning that no character is considered junk."
msgstr ""
#: library/difflib.rst:666
msgid ""
"These junk-filtering functions speed up matching to find differences and do "
"not cause any differing lines or characters to be ignored. Read the "
"description of the :meth:`~SequenceMatcher.find_longest_match` method's "
"*isjunk* parameter for an explanation."
msgstr ""
#: library/difflib.rst:672
msgid ""
":class:`Differ` objects are used (deltas generated) via a single method:"
msgstr ""
#: library/difflib.rst:677
msgid ""
"Compare two sequences of lines, and generate the delta (a sequence of lines)."
msgstr ""
#: library/difflib.rst:679
msgid ""
"Each sequence must contain individual single-line strings ending with "
"newlines. Such sequences can be obtained from the :meth:`~io.IOBase."
"readlines` method of file-like objects. The delta generated also consists "
"of newline-terminated strings, ready to be printed as-is via the :meth:`~io."
"IOBase.writelines` method of a file-like object."
msgstr ""
#: library/difflib.rst:690
msgid "Differ Example"
msgstr ""
#: library/difflib.rst:692
msgid ""
"This example compares two texts. First we set up the texts, sequences of "
"individual single-line strings ending with newlines (such sequences can also "
"be obtained from the :meth:`~io.IOBase.readlines` method of file-like "
"objects):"
msgstr ""
#: library/difflib.rst:711
msgid "Next we instantiate a Differ object:"
msgstr ""
#: library/difflib.rst:715
msgid ""
"Note that when instantiating a :class:`Differ` object we may pass functions "
"to filter out line and character \"junk.\" See the :meth:`Differ` "
"constructor for details."
msgstr ""
#: library/difflib.rst:719
msgid "Finally, we compare the two:"
msgstr ""
#: library/difflib.rst:723
msgid "``result`` is a list of strings, so let's pretty-print it:"
msgstr ""
#: library/difflib.rst:738
msgid "As a single multi-line string it looks like this:"
msgstr ""
#: library/difflib.rst:757
msgid "A command-line interface to difflib"
msgstr ""
#: library/difflib.rst:759
msgid ""
"This example shows how to use difflib to create a ``diff``-like utility."
msgstr ""
#: library/difflib.rst:761
msgid ""
"\"\"\" Command line interface to difflib.py providing diffs in four "
"formats:\n"
"\n"
"* ndiff: lists every line and highlights interline changes.\n"
"* context: highlights clusters of changes in a before/after format.\n"
"* unified: highlights clusters of changes in an inline format.\n"
"* html: generates side by side comparison with change highlights.\n"
"\n"
"\"\"\"\n"
"\n"
"import sys, os, difflib, argparse\n"
"from datetime import datetime, timezone\n"
"\n"
"def file_mtime(path):\n"
" t = datetime.fromtimestamp(os.stat(path).st_mtime,\n"
" timezone.utc)\n"
" return t.astimezone().isoformat()\n"
"\n"
"def main():\n"
"\n"
" parser = argparse.ArgumentParser()\n"
" parser.add_argument('-c', action='store_true', default=False,\n"
" help='Produce a context format diff (default)')\n"
" parser.add_argument('-u', action='store_true', default=False,\n"
" help='Produce a unified format diff')\n"
" parser.add_argument('-m', action='store_true', default=False,\n"
" help='Produce HTML side by side diff '\n"
" '(can use -c and -l in conjunction)')\n"
" parser.add_argument('-n', action='store_true', default=False,\n"
" help='Produce a ndiff format diff')\n"
" parser.add_argument('-l', '--lines', type=int, default=3,\n"
" help='Set number of context lines (default 3)')\n"
" parser.add_argument('fromfile')\n"
" parser.add_argument('tofile')\n"
" options = parser.parse_args()\n"
"\n"
" n = options.lines\n"
" fromfile = options.fromfile\n"
" tofile = options.tofile\n"
"\n"
" fromdate = file_mtime(fromfile)\n"
" todate = file_mtime(tofile)\n"
" with open(fromfile) as ff:\n"
" fromlines = ff.readlines()\n"
" with open(tofile) as tf:\n"
" tolines = tf.readlines()\n"
"\n"
" if options.u:\n"
" diff = difflib.unified_diff(fromlines, tolines, fromfile, tofile, "
"fromdate, todate, n=n)\n"
" elif options.n:\n"
" diff = difflib.ndiff(fromlines, tolines)\n"
" elif options.m:\n"
" diff = difflib.HtmlDiff().make_file(fromlines,tolines,fromfile,"
"tofile,context=options.c,numlines=n)\n"
" else:\n"
" diff = difflib.context_diff(fromlines, tolines, fromfile, tofile, "
"fromdate, todate, n=n)\n"
"\n"
" sys.stdout.writelines(diff)\n"
"\n"
"if __name__ == '__main__':\n"
" main()\n"
msgstr ""
#: library/difflib.rst:764
msgid "ndiff example"
msgstr ""
#: library/difflib.rst:766
msgid "This example shows how to use :func:`difflib.ndiff`."
msgstr ""
#: library/difflib.rst:768
msgid ""
"\"\"\"ndiff [-q] file1 file2\n"
" or\n"
"ndiff (-r1 | -r2) < ndiff_output > file1_or_file2\n"
"\n"
"Print a human-friendly file difference report to stdout. Both inter-\n"
"and intra-line differences are noted. In the second form, recreate file1\n"
"(-r1) or file2 (-r2) on stdout, from an ndiff report on stdin.\n"
"\n"
"In the first form, if -q (\"quiet\") is not specified, the first two lines\n"
"of output are\n"
"\n"
"-: file1\n"
"+: file2\n"
"\n"
"Each remaining line begins with a two-letter code:\n"
"\n"
" \"- \" line unique to file1\n"
" \"+ \" line unique to file2\n"
" \" \" line common to both files\n"
" \"? \" line not present in either input file\n"
"\n"
"Lines beginning with \"? \" attempt to guide the eye to intraline\n"
"differences, and were not present in either input file. These lines can be\n"
"confusing if the source files contain tab characters.\n"
"\n"
"The first file can be recovered by retaining only lines that begin with\n"
"\" \" or \"- \", and deleting those 2-character prefixes; use ndiff with -"
"r1.\n"
"\n"
"The second file can be recovered similarly, but by retaining only \" \" "
"and\n"
"\"+ \" lines; use ndiff with -r2; or, on Unix, the second file can be\n"
"recovered by piping the output through\n"
"\n"
" sed -n '/^[+ ] /s/^..//p'\n"
"\"\"\"\n"
"\n"
"__version__ = 1, 7, 0\n"
"\n"
"import difflib, sys\n"
"\n"
"def fail(msg):\n"
" out = sys.stderr.write\n"
" out(msg + \"\\n\\n\")\n"
" out(__doc__)\n"
" return 0\n"
"\n"
"# open a file & return the file object; gripe and return 0 if it\n"
"# couldn't be opened\n"
"def fopen(fname):\n"
" try:\n"
" return open(fname)\n"
" except IOError as detail:\n"
" return fail(\"couldn't open \" + fname + \": \" + str(detail))\n"
"\n"
"# open two files & spray the diff to stdout; return false iff a problem\n"
"def fcompare(f1name, f2name):\n"
" f1 = fopen(f1name)\n"
" f2 = fopen(f2name)\n"
" if not f1 or not f2:\n"
" return 0\n"
"\n"
" a = f1.readlines(); f1.close()\n"
" b = f2.readlines(); f2.close()\n"
" for line in difflib.ndiff(a, b):\n"