@@ -11,7 +11,7 @@ msgid ""
1111msgstr ""
1212"Project-Id-Version : Python 3.14\n "
1313"Report-Msgid-Bugs-To : \n "
14- "POT-Creation-Date : 2026-07-25 15:45 +0000\n "
14+ "POT-Creation-Date : 2026-07-29 16:48 +0000\n "
1515"PO-Revision-Date : 2026-05-08 17:17+0000\n "
1616"Last-Translator : Rafael Fontenelle <rffontenelle@gmail.com>, 2026\n "
1717"Language-Team : Polish (https://app.transifex.com/python-doc/teams/5390/pl/)\n "
@@ -30,51 +30,100 @@ msgid "**Source code:** :source:`Lib/difflib.py`"
3030msgstr "**Kod źródłowy:** :source:`Lib/difflib.py`"
3131
3232msgid ""
33- "This module provides classes and functions for comparing sequences. It can "
34- "be used for example, for comparing files, and can produce information about "
35- "file differences in various formats, including HTML and context and unified "
36- "diffs. For comparing directories and files, see also, the :mod:`filecmp` "
37- "module."
33+ "This module provides classes and functions for comparing sequences. Most of "
34+ "them compare sequences of text lines (for example lists of strings, or :term:"
35+ "`file objects <file object>`) and produce :dfn:`diffs` -- reports on the "
36+ "differences. Diffs can be produced in in various formats, including HTML and "
37+ "context and unified diffs -- formats produced by tools like :manpage:`diff "
38+ "<diff(1)>` and :manpage:`git diff <git-diff(1)>`."
3839msgstr ""
3940
4041msgid ""
41- "This is a flexible class for comparing pairs of sequences of any type, so "
42- "long as the sequence elements are :term:`hashable`. The basic algorithm "
43- "predates, and is a little fancier than, an algorithm published in the late "
44- "1980's by Ratcliff and Obershelp under the hyperbolic name \" gestalt pattern "
45- "matching.\" The idea is to find the longest contiguous matching subsequence "
46- "that contains no \" junk\" elements; these \" junk\" elements are ones that "
47- "are uninteresting in some sense, such as blank lines or whitespace. "
48- "(Handling junk is an extension to the Ratcliff and Obershelp algorithm.) The "
49- "same idea is then applied recursively to the pieces of the sequences to the "
50- "left and to the right of the matching subsequence. This does not yield "
51- "minimal edit sequences, but does tend to yield matches that \" look right\" "
52- "to people."
42+ "Comparisons are done using a matching algorithm implemented in :class:"
43+ "`SequenceMatcher` -- a flexible class for comparing pairs of sequences of "
44+ "any type, not just text, so long as the sequence elements are :term:"
45+ "`hashable`."
46+ msgstr ""
47+
48+ msgid "Junk heuristic"
5349msgstr ""
5450
5551msgid ""
56- "**Timing:** The basic Ratcliff-Obershelp algorithm is cubic time in the "
57- "worst case and quadratic time in the expected case. :class:`SequenceMatcher` "
58- "is quadratic time for the worst case and has expected-case behavior "
59- "dependent in a complicated way on how many elements the sequences have in "
60- "common; best case time is linear."
52+ ":mod:`!difflib` uses a :dfn:`junk` heuristic: some items are deemed to be :"
53+ "dfn:`junk`, and ignored when searching for similarities. Ideally, these are "
54+ "uninteresting or common items, such as blank lines or whitespace."
6155msgstr ""
6256
6357msgid ""
64- "**Junk**: :class:`SequenceMatcher` accepts an ``isjunk`` predicate and an "
65- "``autojunk`` flag. Items that are considered as junk will not be considered "
66- "to find similar content blocks. This can produce better results for humans "
67- "(typically breaking on whitespace) and faster (because it reduces the number "
68- "of possible combinations). But it can also cause pathological cases where "
69- "too many items considered junk cause an unexpectedly large (but correct) "
70- "diff result. You should consider tuning them or turning them off depending "
71- "on your data. Moreover, only the second sequence is inspected for junk. This "
72- "causes the diff output to not be symmetrical. When ``autojunk=True``, it "
73- "will consider as junk the items that account for more than 1% of the "
74- "sequence, if it is at least 200 items long."
58+ "This heuristic can speed the algorithm up (because it reduces the number of "
59+ "possible combinations) and it can produce results that are more "
60+ "understandable for humans (typically breaking on whitespace). But it can "
61+ "also cause pathological cases:"
7562msgstr ""
7663
77- msgid "Added the *autojunk* parameter."
64+ msgid ""
65+ "Inappropriately chosen junk items can cause an unexpectedly **large** (but "
66+ "still correct) result."
67+ msgstr ""
68+
69+ msgid ""
70+ "The default heuristic is **asymmetric**: only the second sequence is "
71+ "inspected when determining what is considered junk, so comparing A to B can "
72+ "give different results than comparing B to A and reversing the result."
73+ msgstr ""
74+
75+ msgid ""
76+ "By default, if the second input sequence is at least 200 items long, items "
77+ "that account for more than 1% it are considered *junk*."
78+ msgstr ""
79+
80+ msgid ""
81+ "Depending on your data, you should consider turning this heuristic off "
82+ "(setting :class:`~difflib.SequenceMatcher`'s *autojunk* argument to to "
83+ "``False``) or tuning it (using the *isjunk* argument, perhaps to one of the :"
84+ "ref:`predefined functions <difflib-isjunk-functions>`)."
85+ msgstr ""
86+
87+ msgid "The :mod:`!difflib` algorithm"
88+ msgstr ""
89+
90+ msgid ""
91+ "The algorithm used in :class:`SequenceMatcher` predates, and is a little "
92+ "fancier than, an algorithm published in the late 1980s by Ratcliff and "
93+ "Obershelp under the hyperbolic name \" gestalt pattern matching.\" The idea "
94+ "is to find the longest contiguous subsequence common to both inputs, then "
95+ "recursively handle the pieces of the sequences to the left and to the right "
96+ "of the matching subsequence."
97+ msgstr ""
98+
99+ msgid ""
100+ "`Pattern Matching: The Gestalt Approach <https://jacobfilipp.com/DrDobbs/"
101+ "articles/DDJ/1988/8807/8807c/8807c.htm>`_"
102+ msgstr ""
103+
104+ msgid ""
105+ "Discussion of a similar algorithm by John W. Ratcliff and D. E. Metzener. "
106+ "This was published in Dr. Dobb's Journal in July, 1988."
107+ msgstr ""
108+
109+ msgid ""
110+ "As an extension to the Ratcliff and Obershelp algorithm, :mod:`!difflib` "
111+ "searches for the longest *junk-free* contiguous subsequence. See the :ref:"
112+ "`difflib-junk` section for details."
113+ msgstr ""
114+
115+ msgid "Timing"
116+ msgstr ""
117+
118+ msgid ""
119+ "The basic Ratcliff-Obershelp algorithm is cubic time in the worst case and "
120+ "quadratic time in the expected case. :mod:`difflib`'s algorithm is quadratic "
121+ "time for the worst case and has expected-case behavior dependent in a "
122+ "complicated way on how many elements the sequences have in common; best case "
123+ "time is linear."
124+ msgstr ""
125+
126+ msgid "Diff generation"
78127msgstr ""
79128
80129msgid ""
@@ -124,6 +173,58 @@ msgid ""
124173"tabs or line breaks."
125174msgstr ""
126175
176+ msgid ""
177+ "Note that :class:`Differ`\\ -generated deltas make no claim to be "
178+ "**minimal** diffs. To the contrary, minimal diffs are often counter-"
179+ "intuitive for humans, because they synch up anywhere possible, sometimes at "
180+ "accidental matches 100 pages apart. Restricting synch points to contiguous "
181+ "matches preserves some notion of locality, at the occasional cost of "
182+ "producing a longer diff."
183+ msgstr ""
184+
185+ msgid "The :class:`Differ` class has this constructor:"
186+ msgstr ""
187+
188+ msgid ""
189+ "Optional keyword parameters *linejunk* and *charjunk* are for filter "
190+ "functions (or ``None``):"
191+ msgstr ""
192+
193+ msgid ""
194+ "*linejunk*: A function that accepts a single string argument, and returns "
195+ "true if the string is junk. The default is ``None``, meaning that no line "
196+ "is considered junk."
197+ msgstr ""
198+
199+ msgid ""
200+ "*charjunk*: A function that accepts a single character argument (a string of "
201+ "length 1), and returns true if the character is junk. The default is "
202+ "``None``, meaning that no character is considered junk."
203+ msgstr ""
204+
205+ msgid ""
206+ "These junk-filtering functions speed up matching to find differences and do "
207+ "not cause any differing lines or characters to be ignored. Read the "
208+ "description of the :meth:`~SequenceMatcher.find_longest_match` method's "
209+ "*isjunk* parameter for an explanation."
210+ msgstr ""
211+
212+ msgid ""
213+ ":class:`Differ` objects are used (deltas generated) via a single method:"
214+ msgstr ""
215+
216+ msgid ""
217+ "Compare two sequences of lines, and generate the delta (a sequence of lines)."
218+ msgstr ""
219+
220+ msgid ""
221+ "Each sequence must contain individual single-line strings ending with "
222+ "newlines. Such sequences can be obtained from the :meth:`~io.IOBase."
223+ "readlines` method of file-like objects. The generated delta also consists "
224+ "of newline-terminated strings, ready to be printed as-is via the :meth:`~io."
225+ "IOBase.writelines` method of a file-like object."
226+ msgstr ""
227+
127228msgid ""
128229"This class can be used to create an HTML table (or a complete HTML file "
129230"containing the table) showing a side by side, line by line comparison of "
@@ -345,6 +446,9 @@ msgid ""
345446"unknown/inconsistent encodings as *a* and *b*."
346447msgstr ""
347448
449+ msgid "Junk definition functions"
450+ msgstr ""
451+
348452msgid ""
349453"Return ``True`` for ignorable lines. The line *line* is ignorable if *line* "
350454"is blank or contains a single ``'#'``, otherwise it is not ignorable. Used "
@@ -357,22 +461,9 @@ msgid ""
357461"for parameter *charjunk* in :func:`ndiff`."
358462msgstr ""
359463
360- msgid ""
361- "`Pattern Matching: The Gestalt Approach <https://jacobfilipp.com/DrDobbs/"
362- "articles/DDJ/1988/8807/8807c/8807c.htm>`_"
363- msgstr ""
364-
365- msgid ""
366- "Discussion of a similar algorithm by John W. Ratcliff and D. E. Metzener. "
367- "This was published in Dr. Dobb's Journal in July, 1988."
368- msgstr ""
369-
370464msgid "SequenceMatcher objects"
371465msgstr ""
372466
373- msgid "The :class:`SequenceMatcher` class has this constructor:"
374- msgstr ""
375-
376467msgid ""
377468"Optional argument *isjunk* must be ``None`` (the default) or a one-argument "
378469"function that takes a sequence element and returns true if and only if the "
@@ -400,6 +491,9 @@ msgid ""
400491"heuristic."
401492msgstr ""
402493
494+ msgid "Added the *autojunk* parameter."
495+ msgstr ""
496+
403497msgid ""
404498"SequenceMatcher objects get three data attributes: *bjunk* is the set of "
405499"elements of *b* for which *isjunk* is ``True``; *bpopular* is the set of non-"
@@ -591,6 +685,9 @@ msgid ""
591685"ratio`:"
592686msgstr ""
593687
688+ msgid "Examples"
689+ msgstr ""
690+
594691msgid "SequenceMatcher examples"
595692msgstr ""
596693
@@ -631,61 +728,6 @@ msgid ""
631728"`SequenceMatcher`."
632729msgstr ""
633730
634- msgid "Differ objects"
635- msgstr ""
636-
637- msgid ""
638- "Note that :class:`Differ`\\ -generated deltas make no claim to be "
639- "**minimal** diffs. To the contrary, minimal diffs are often counter-"
640- "intuitive, because they synch up anywhere possible, sometimes accidental "
641- "matches 100 pages apart. Restricting synch points to contiguous matches "
642- "preserves some notion of locality, at the occasional cost of producing a "
643- "longer diff."
644- msgstr ""
645-
646- msgid "The :class:`Differ` class has this constructor:"
647- msgstr ""
648-
649- msgid ""
650- "Optional keyword parameters *linejunk* and *charjunk* are for filter "
651- "functions (or ``None``):"
652- msgstr ""
653-
654- msgid ""
655- "*linejunk*: A function that accepts a single string argument, and returns "
656- "true if the string is junk. The default is ``None``, meaning that no line "
657- "is considered junk."
658- msgstr ""
659-
660- msgid ""
661- "*charjunk*: A function that accepts a single character argument (a string of "
662- "length 1), and returns true if the character is junk. The default is "
663- "``None``, meaning that no character is considered junk."
664- msgstr ""
665-
666- msgid ""
667- "These junk-filtering functions speed up matching to find differences and do "
668- "not cause any differing lines or characters to be ignored. Read the "
669- "description of the :meth:`~SequenceMatcher.find_longest_match` method's "
670- "*isjunk* parameter for an explanation."
671- msgstr ""
672-
673- msgid ""
674- ":class:`Differ` objects are used (deltas generated) via a single method:"
675- msgstr ""
676-
677- msgid ""
678- "Compare two sequences of lines, and generate the delta (a sequence of lines)."
679- msgstr ""
680-
681- msgid ""
682- "Each sequence must contain individual single-line strings ending with "
683- "newlines. Such sequences can be obtained from the :meth:`~io.IOBase."
684- "readlines` method of file-like objects. The delta generated also consists "
685- "of newline-terminated strings, ready to be printed as-is via the :meth:`~io."
686- "IOBase.writelines` method of a file-like object."
687- msgstr ""
688-
689731msgid "Differ example"
690732msgstr ""
691733
0 commit comments