iframe-proxy | Sunbelt Computer Software

913 lines (773 loc) · 30.3 KB
# SOME DESCRIPTIVE TITLE.
# Copyright (C) 2001 Python Software Foundation
# This file is distributed under the same license as the Python package.
# FIRST AUTHOR <EMAIL@ADDRESS>, YEAR.
# Translators:
# python-doc bot, 2025
"Project-Id-Version: Python 3.14\n"
"Report-Msgid-Bugs-To: \n"
"POT-Creation-Date: 2026-04-11 14:31+0000\n"
"PO-Revision-Date: 2025-09-16 00:01+0000\n"
"Last-Translator: python-doc bot, 2025\n"
"Language-Team: Indonesian (https://app.transifex.com/python-doc/teams/5390/"
"MIME-Version: 1.0\n"
"Content-Type: text/plain; charset=UTF-8\n"
"Content-Transfer-Encoding: 8bit\n"
"Language: id\n"
"Plural-Forms: nplurals=1; plural=0;\n"
msgid ":mod:`!difflib` --- Helpers for computing deltas"
msgid "**Source code:** :source:`Lib/difflib.py`"
"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` "
"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."
"**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."
"**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`."
msgid "Added the *autojunk* parameter."
"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."
msgid "Each line of a :class:`Differ` delta begins with a two-letter code:"
msgid "Code"
msgstr "Kode"
msgid "Meaning"
msgstr "Artinya"
msgid "``'- '``"
msgid "line unique to sequence 1"
msgid "``'+ '``"
msgid "line unique to sequence 2"
msgid "``'  '``"
msgid "line common to both sequences"
msgid "``'? '``"
msgid "line not present in either input sequence"
"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."
"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."
msgid "The constructor for this class is:"
msgid "Initializes instance of :class:`HtmlDiff`."
"*tabsize* is an optional keyword argument to specify tab stop spacing and "
"defaults to ``8``."
"*wrapcolumn* is an optional keyword to specify column number where lines are "
"broken and wrapped, defaults to ``None`` where lines are not wrapped."
"*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."
msgid "The following methods are public:"
"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."
"*fromdesc* and *todesc* are optional keyword arguments to specify from/to "
"file column header strings (both default to an empty string)."
"*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)."
"*fromdesc* and *todesc* are interpreted as unescaped HTML and should be "
"properly escaped while receiving input from untrusted sources."
"*charset* keyword-only argument was added.  The default charset of HTML "
"document changed from ``'ISO-8859-1'`` to ``'utf-8'``."
"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."
"The arguments for this method are the same as those for the :meth:"
"`make_file` method."
"Compare *a* and *b* (lists of strings); return a delta (a :term:`generator` "
"generating the delta lines) in context diff format."
"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."
"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."
"For inputs that do not have trailing newlines, set the *lineterm* argument "
"to ``\"\"`` so that the output will be uniformly newline free."
"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."
msgid "See :ref:`difflib-interface` for a more detailed example."
"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)."
"Optional argument *n* (default ``3``) is the maximum number of close matches "
"to return; *n* must be greater than ``0``."
"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."
"The best (no more than *n*) matches among the possibilities are returned in "
"a list, sorted by similarity score, most similar first."
"Compare *a* and *b* (lists of strings); return a :class:`Differ`\\ -style "
"delta (a :term:`generator` generating the delta lines)."
"Optional keyword parameters *linejunk* and *charjunk* are filtering "
"functions (or ``None``):"
"*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 hash 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."
"*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!)."
msgid "Return one of the two sequences that generated a delta."
"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."
msgid "Example:"
msgstr "Contoh:"
"Compare *a* and *b* (lists of strings); return a delta (a :term:`generator` "
"generating the delta lines) in unified diff format."
"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."
"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."
"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."
"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`."
"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*."
"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."
"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`."
"`Pattern Matching: The Gestalt Approach <https://jacobfilipp.com/DrDobbs/"
"articles/DDJ/1988/8807/8807c/8807c.htm>`_"
"Discussion of a similar algorithm by John W. Ratcliff and D. E. Metzener. "
"This was published in Dr. Dobb's Journal in July, 1988."
msgid "SequenceMatcher objects"
msgid "The :class:`SequenceMatcher` class has this constructor:"
"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::"
msgid "lambda x: x in \" \\t\""
"if you're comparing lines as sequences of characters, and don't want to "
"synch up on blanks or hard tabs."
"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`."
"The optional argument *autojunk* can be used to disable the automatic junk "
"heuristic."
"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`."
msgid "The *bjunk* and *bpopular* attributes."
msgid ":class:`SequenceMatcher` objects have the following methods:"
msgid "Set the two sequences to be compared."
":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."
"Set the first sequence to be compared.  The second sequence to be compared "
"is not changed."
"Set the second sequence to be compared.  The first sequence to be compared "
"is not changed."
msgid "Find longest matching block in ``a[alo:ahi]`` and ``b[blo:bhi]``."
"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*."
"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."
"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:"
msgid "If no blocks match, this returns ``(alo, blo, 0)``."
msgid "This method returns a :term:`named tuple` ``Match(a, b, size)``."
msgid "Added default arguments."
"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*."
"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."
">>> 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)]"
"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*."
msgid "The *tag* values are strings, with these meanings:"
msgid "Value"
msgstr "Nilai"
msgid "``'replace'``"
msgstr "``'replace'``"
msgid "``a[i1:i2]`` should be replaced by ``b[j1:j2]``."
msgid "``'delete'``"
msgid "``a[i1:i2]`` should be deleted.  Note that ``j1 == j2`` in this case."
msgid "``'insert'``"
"``b[j1:j2]`` should be inserted at ``a[i1:i1]``. Note that ``i1 == i2`` in "
"this case."
msgid "``'equal'``"
msgid "``a[i1:i2] == b[j1:j2]`` (the sub-sequences are equal)."
msgid "For example::"
msgstr "Sebagai contoh::"
">>> 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'"
msgid "Return a :term:`generator` of groups with up to *n* lines of context."
"Starting with the groups returned by :meth:`get_opcodes`, this method splits "
"out smaller change clusters and eliminates intervening ranges which have no "
msgid "The groups are returned in the same format as :meth:`get_opcodes`."
"Return a measure of the sequences' similarity as a float in the range [0, 1]."
"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."
"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."
"Caution: The result of a :meth:`ratio` call may depend on the order of the "
"arguments. For instance::"
">>> SequenceMatcher(None, 'tide', 'diet').ratio()\n"
">>> SequenceMatcher(None, 'diet', 'tide').ratio()\n"
msgid "Return an upper bound on :meth:`ratio` relatively quickly."
msgid "Return an upper bound on :meth:`ratio` very quickly."
"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."
msgid "SequenceMatcher examples"
msgid "This example compares two strings, considering blanks to be \"junk\":"
":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:"
"If you're only interested in where the sequences match, :meth:"
"`~SequenceMatcher.get_matching_blocks` is handy:"
"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``."
"If you want to know how to change the first sequence into the second, use :"
"meth:`~SequenceMatcher.get_opcodes`:"
"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."
"`Simple version control recipe <https://code.activestate.com/recipes/576729-"
"simple-version-control/>`_ for a small application built with :class:"
"`SequenceMatcher`."
msgid "Differ objects"
"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."
msgid "The :class:`Differ` class has this constructor:"
"Optional keyword parameters *linejunk* and *charjunk* are for filter "
"functions (or ``None``):"
"*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."
"*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."
"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."
":class:`Differ` objects are used (deltas generated) via a single method:"
"Compare two sequences of lines, and generate the delta (a sequence of lines)."
"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."
msgid "Differ example"
"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):"
msgid "Next we instantiate a Differ object:"
"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."
msgid "Finally, we compare the two:"
msgid "``result`` is a list of strings, so let's pretty-print it:"
msgid "As a single multi-line string it looks like this:"
msgid "A command-line interface to difflib"
"This example shows how to use difflib to create a ``diff``-like utility."
"\"\"\" Command-line interface to difflib.py providing diffs in four "
"formats:\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"
"import sys, os, difflib, argparse\n"
"import datetime as dt\n"
"def file_mtime(path):\n"
"    t = dt.datetime.fromtimestamp(os.stat(path).st_mtime,\n"
"                                  dt.timezone.utc)\n"
"    return t.astimezone().isoformat()\n"
"def main():\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 = options.lines\n"
"    fromfile = options.fromfile\n"
"    tofile = options.tofile\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"
"    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"
"    sys.stdout.writelines(diff)\n"
"if __name__ == '__main__':\n"
"    main()\n"
msgid "ndiff example"
msgid "This example shows how to use :func:`difflib.ndiff`."
"\"\"\"ndiff [-q] file1 file2\n"
"ndiff (-r1 | -r2) < ndiff_output > file1_or_file2\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"
"In the first form, if -q (\"quiet\") is not specified, the first two lines\n"
"of output are\n"
"-: file1\n"
"+: file2\n"
"Each remaining line begins with a two-letter code:\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"
"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"
"The first file can be recovered by retaining only lines that begin with\n"
"\"  \" or \"- \", and deleting those 2-character prefixes; use ndiff with -"
"The second file can be recovered similarly, but by retaining only \"  \" "
"\"+ \" lines; use ndiff with -r2; or, on Unix, the second file can be\n"
"recovered by piping the output through\n"
"    sed -n '/^[+ ] /s/^..//p'\n"
"__version__ = 1, 7, 0\n"
"import difflib, sys\n"
"def fail(msg):\n"
"    out = sys.stderr.write\n"
"    out(msg + \"\\n\\n\")\n"
"    out(__doc__)\n"
"    return 0\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"
"# 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"
"    a = f1.readlines(); f1.close()\n"
"    b = f2.readlines(); f2.close()\n"
"    for line in difflib.ndiff(a, b):\n"
"        print(line, end=' ')\n"
"    return 1\n"
"# crack args (sys.argv[1:] is normal) & compare;\n"
"# return false iff a problem\n"
"def main(args):\n"
"    import getopt\n"
"    try:\n"
"        opts, args = getopt.getopt(args, \"qr:\")\n"
"    except getopt.error as detail:\n"
"        return fail(str(detail))\n"
"    noisy = 1\n"
"    qseen = rseen = 0\n"
"    for opt, val in opts:\n"
"        if opt == \"-q\":\n"
"            qseen = 1\n"
"            noisy = 0\n"
"        elif opt == \"-r\":\n"
"            rseen = 1\n"
"            whichfile = val\n"
"    if qseen and rseen:\n"
"        return fail(\"can't specify both -q and -r\")\n"
"    if rseen:\n"
"        if args:\n"
"            return fail(\"no args allowed with -r option\")\n"
"        if whichfile in (\"1\", \"2\"):\n"
"            restore(whichfile)\n"
"            return 1\n"
"        return fail(\"-r value must be 1 or 2\")\n"
"    if len(args) != 2:\n"
"        return fail(\"need 2 filename args\")\n"
"    f1name, f2name = args\n"
"    if noisy:\n"
"        print('-:', f1name)\n"
"        print('+:', f2name)\n"
"    return fcompare(f1name, f2name)\n"
"# read ndiff output from stdin, and print file1 (which=='1') or\n"
"# file2 (which=='2') to stdout\n"
"def restore(which):\n"
"    restored = difflib.restore(sys.stdin.readlines(), which)\n"
"    sys.stdout.writelines(restored)\n"
"if __name__ == '__main__':\n"
"    main(sys.argv[1:])\n"
Sunbelt Computer Software

PL/B Language Development and Support

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Sunbelt Computer Software

PL/B Language Development and Support

Uh oh!

FilesExpand file tree

difflib.po

Latest commit

History

difflib.po

File metadata and controls
