| /external/python/cpython2/Doc/library/ |
| D | difflib.rst | 1 :mod:`difflib` --- Helpers for computing deltas
17 This module provides classes and functions for comparing sequences. It
24 This is a flexible class for comparing pairs of sequences of any type, so long
30 idea is then applied recursively to the pieces of the sequences to the left and
32 sequences, but does tend to yield matches that "look right" to people.
34 **Timing:** The basic Ratcliff-Obershelp algorithm is cubic time in the worst
36 quadratic time for the worst case and has expected-case behavior dependent in a
37 complicated way on how many elements the sequences have in common; best case
53 This is a class for comparing sequences of lines of text, and producing
54 human-readable differences or deltas. Differ uses :class:`SequenceMatcher`
[all …]
|
| /external/python/cpython3/Doc/library/ |
| D | difflib.rst | 1 :mod:`difflib` --- Helpers for computing deltas
18 --------------
20 This module provides classes and functions for comparing sequences. It
29 This is a flexible class for comparing pairs of sequences of any type, so long
37 idea is then applied recursively to the pieces of the sequences to the left and
39 sequences, but does tend to yield matches that "look right" to people.
41 **Timing:** The basic Ratcliff-Obershelp algorithm is cubic time in the worst
43 quadratic time for the worst case and has expected-case behavior dependent in a
44 complicated way on how many elements the sequences have in common; best case
61 This is a class for comparing sequences of lines of text, and producing
[all …]
|
| /external/python/cpython2/Lib/ |
| D | difflib.py | 2 Module difflib -- helpers for computing deltas between objects.
8 For two lists of strings, return a delta in context diff format.
14 Return one of the two sequences that generated an ndiff delta.
17 For two lists of strings, return a delta in unified diff format.
20 A flexible class for comparing pairs of sequences of any type.
23 For producing human-readable deltas from sequences of lines of text.
47 SequenceMatcher is a flexible class for comparing pairs of sequences of
53 elements (R-O doesn't address junk). The same idea is then applied
54 recursively to the pieces of the sequences to the left and to the right
56 sequences, but does tend to yield matches that "look right" to people.
[all …]
|
| /external/python/cpython3/Lib/ |
| D | difflib.py | 2 Module difflib -- helpers for computing deltas between objects.
8 For two lists of strings, return a delta in context diff format.
14 Return one of the two sequences that generated an ndiff delta.
17 For two lists of strings, return a delta in unified diff format.
20 A flexible class for comparing pairs of sequences of any type.
23 For producing human-readable deltas from sequences of lines of text.
47 SequenceMatcher is a flexible class for comparing pairs of sequences of
53 elements (R-O doesn't address junk). The same idea is then applied
54 recursively to the pieces of the sequences to the left and to the right
56 sequences, but does tend to yield matches that "look right" to people.
[all …]
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/coll/ |
| D | BOCSU.java | 6 * Copyright (C) 1996-2014, International Business Machines Corporation and
18 * <a href="http://www.icu-project.org/docs/papers/binary_ordered_compression_for_unicode.html">
23 * to UTF-8, and for some kinds of text (such as CJK) it does better.
35 * <p>Unlike a UTF encoding, BOCU-compressed text is not suitable for
48 * range -10ffff..+10ffff in ascending order, which forbids encoding
50 * lead byte range in the middle and encode non-negative values going
54 * middle byte value for single-byte encoded differences. For
58 * single-byte range. For large absolute values, the difference is
67 * sequences as a whole are well ordered. I.e., even if the lead byte
68 * is the same for sequences of different lengths, the trail bytes
[all …]
|
| /external/icu/icu4j/main/collate/src/main/java/com/ibm/icu/impl/coll/ |
| D | BOCSU.java | 5 * Copyright (C) 1996-2014, International Business Machines Corporation and
17 * <a href="http://www.icu-project.org/docs/papers/binary_ordered_compression_for_unicode.html">
22 * to UTF-8, and for some kinds of text (such as CJK) it does better.
34 * <p>Unlike a UTF encoding, BOCU-compressed text is not suitable for
47 * range -10ffff..+10ffff in ascending order, which forbids encoding
49 * lead byte range in the middle and encode non-negative values going
53 * middle byte value for single-byte encoded differences. For
57 * single-byte range. For large absolute values, the difference is
66 * sequences as a whole are well ordered. I.e., even if the lead byte
67 * is the same for sequences of different lengths, the trail bytes
[all …]
|
| /external/swiftshader/third_party/SPIRV-Tools/source/diff/ |
| D | lcs.h | 7 // http://www.apache.org/licenses/LICENSE-2.0
27 namespace diff {
29 // The result of a diff.
42 // Given two sequences, it creates a matching between them. The elements are
125 // The LCS algorithm is simple. Given sequences s and d, with a:b depicting a in CalculateLCS()
138 // sequences. in CalculateLCS()
198 src_match_result->clear(); in RetrieveMatch()
199 dst_match_result->clear(); in RetrieveMatch()
201 src_match_result->resize(src_.size(), false); in RetrieveMatch()
202 dst_match_result->resize(dst_.size(), false); in RetrieveMatch()
[all …]
|
| /external/angle/third_party/spirv-tools/src/source/diff/ |
| D | lcs.h | 7 // http://www.apache.org/licenses/LICENSE-2.0
27 namespace diff {
29 // The result of a diff.
42 // Given two sequences, it creates a matching between them. The elements are
125 // The LCS algorithm is simple. Given sequences s and d, with a:b depicting a in CalculateLCS()
138 // sequences. in CalculateLCS()
198 src_match_result->clear(); in RetrieveMatch()
199 dst_match_result->clear(); in RetrieveMatch()
201 src_match_result->resize(src_.size(), false); in RetrieveMatch()
202 dst_match_result->resize(dst_.size(), false); in RetrieveMatch()
[all …]
|
| /external/deqp-deps/SPIRV-Tools/source/diff/ |
| D | lcs.h | 7 // http://www.apache.org/licenses/LICENSE-2.0
27 namespace diff {
29 // The result of a diff.
42 // Given two sequences, it creates a matching between them. The elements are
125 // The LCS algorithm is simple. Given sequences s and d, with a:b depicting a in CalculateLCS()
138 // sequences. in CalculateLCS()
198 src_match_result->clear(); in RetrieveMatch()
199 dst_match_result->clear(); in RetrieveMatch()
201 src_match_result->resize(src_.size(), false); in RetrieveMatch()
202 dst_match_result->resize(dst_.size(), false); in RetrieveMatch()
[all …]
|
| /external/zstd/contrib/match_finders/ |
| D | zstd_edist.h | 5 * This source code is licensed under both the BSD-style license (found in the
8 * You may select, at your option, one of the above-listed licenses.
25 * sequences to identify the regions within two files where they differ.
29 * Algorithmica Vol. 1, 1986, pp. 251-266,
34 * algorithms such as GNU diff, bsdiff, and Xdelta.
41 * (large similar files) this approach by itself took 5-10X longer than zstd-19 and
42 * generally resulted in 2-3X larger files. The core advantage that zstd-19 has
53 /*-*************************************
61 * Will populate the provided ZSTD_Sequence buffer with sequences
62 * based on the optimal or near-optimal (depending on 'useHeuristics')
[all …]
|
| D | README.md | 18 * sequences to identify the regions within two files where they differ.
22 * Algorithmica Vol. 1, 1986, pp. 251-266,
27 * algorithms such as GNU diff, bsdiff, and Xdelta.
34 * (large similar files) this approach by itself took 5-10X longer than zstd-19 and
35 * generally resulted in 2-3X larger files. The core advantage that zstd-19 has
|
| /external/zstd/lib/common/ |
| D | zstd_internal.h | 5 * This source code is licensed under both the BSD-style license (found in the
8 * You may select, at your option, one of the above-listed licenses.
19 /*-*************************************
46 /* ---- static assert (debug) --- */
53 /*-*************************************
63 /*-*************************************
95 #define MIN_CBLOCK_SIZE (1 /*litCSize*/ + 1 /* RLE or RAW */) /* for a non-null block */
106 #define MaxLit ((1<<Litbits) - 1)
135 -1,-1,-1,-1
155 1, 1, 1, 1, 1, 1,-1,-1,
[all …]
|
| /external/zstd/lib/compress/ |
| D | zstd_compress_internal.h | 5 * This source code is licensed under both the BSD-style license (found in the
8 * You may select, at your option, one of the above-listed licenses.
18 /*-*************************************
32 /*-*************************************
46 /*-*************************************
89 * Stores Literals Block Type for a super-block in hType, and
100 * Stores symbol compression modes for a super-block in {ll, ol, ml}Type, and
145 rawSeq* seq; /* The start of the sequences */
149 size_t size; /* The number of sequences. <= capacity. */
156 size_t posInSrc; /* Number of bytes given by sequences provided so far */
[all …]
|
| /external/python/cpython2/Lib/unittest/ |
| D | case.py | 159 * maxDiff: sets the maximum length of a diff in failure messages
254 """Returns a one-line description of the test, or None if no
382 function, args, kwargs = self._cleanups.pop(-1)
401 function, args, kwargs = self._cleanups.pop(-1)
545 if abs(first - second) <= delta:
555 if round(abs(second-first), places) == 0:
578 if not (first == second) and abs(first - second) > delta:
586 if not (first == second) and round(abs(second-first), places) != 0:
625 """An equality assertion for ordered sequences (like lists and tuples).
633 seq_type: The expected datatype of the sequences, or None if no
[all …]
|
| /external/one-true-awk/testdir/ |
| D | T.misc | 5 awk=${awk-../a.out}
7 rm -f core
23 cmp -s foo1 foo2 || echo 'BAD: T.misc ghosh RE bug'
30 cmp -s foo1 foo2 || echo 'BAD: T.misc last number bug'
32 # check some \ sequences in strings (ascii)
35 cmp -s foo1 foo2 || echo 'BAD: T.misc hex string cvt'
39 cmp -s foo1 foo2 || echo 'BAD: T.misc oct string cvt'
45 cmp -s foo1 foo2 || echo 'BAD: T.misc bad field increment'
47 # makes sure that fields are recomputed even if self-assignment
55 $awk '{ NF -= 2; $1 = $1; print }' <foo >foo2
[all …]
|
| /external/zstd/lib/decompress/ |
| D | zstd_decompress_block.c | 5 * This source code is licensed under both the BSD-style license (found in the
8 * You may select, at your option, one of the above-listed licenses.
14 /*-*******************************************************
50 /*-*************************************************************
56 …size_t const blockSizeMax = dctx->isFrameDecompression ? dctx->fParams.blockSizeMax : ZSTD_BLOCKSI… in ZSTD_blockSizeMax()
70 bpPtr->lastBlock = cBlockHeader & 1; in ZSTD_getcBlockSize()
71 bpPtr->blockType = (blockType_e)((cBlockHeader >> 1) & 3); in ZSTD_getcBlockSize()
72 bpPtr->origSize = cSize; /* only useful for RLE */ in ZSTD_getcBlockSize()
73 if (bpPtr->blockType == bt_rle) return 1; in ZSTD_getcBlockSize()
74 RETURN_ERROR_IF(bpPtr->blockType == bt_reserved, corruption_detected, ""); in ZSTD_getcBlockSize()
[all …]
|
| /external/curl/tests/ |
| D | README.md | 1 <!--
4 SPDX-License-Identifier: curl
5 -->
21 To run the tests faster, pass the -j (parallelism) flag:
23 make test TFLAGS="-j10"
29 When you run tests via make, the flags `-a` and `-s` are passed, meaning
48 - perl (and a unix-style shell)
49 - python (and a unix-style shell, for SMB and TELNET tests)
50 - python-impacket (for SMB tests)
51 - diff (when a test fails, a diff is shown)
[all …]
|
| /external/python/cpython3/Lib/unittest/ |
| D | case.py | 76 # exc_info -> frame -> exc_info
127 """Same as enterContext, but module-wide."""
142 # Swallows all but first exception. If a multi-exception handler
239 # bpo-23890: manually break a reference cycle
372 * maxDiff: sets the maximum length of a diff in failure messages
464 """Same as enterContext, but class-wide."""
490 """Returns a one-line description of the test, or None if no
640 # outcome.expectedFailure -> frame -> outcome -> outcome.expectedFailure
768 # bpo-23890: manually break a reference cycle
904 diff = abs(first - second)
[all …]
|
| /external/toolchain-utils/cros_utils/ |
| D | misc.py | 1 # -*- coding: utf-8 -*-
3 # Use of this source code is governed by a BSD-style license that can be
23 "/mnt/host/source/src/third_party/toolchain-utils/"
32 "git ls-remote "
34 "refs/heads/release-R*"
40 mo = re.search(r"refs/heads/release-R(\d+)-(\d+)\.B", line)
49 return "R%d-%s" % (lower[-1] + 1, lsb_version)
139 command = "ln -sf -T %s %s" % (latest_image_dir, label)
145 command = "ln -sf -T %s %s" % (vanilla_path, "vanilla")
158 usepkg_flag = "--usepkg"
[all …]
|
| /external/libcups/cups/ |
| D | options.c | 4 * Copyright 2007-2017 by Apple Inc.
5 * Copyright 1997-2007 by Easy Software Products.
14 #include "cups-private.h"
15 #include "debug-internal.h"
28 * 'cupsAddIntegerOption()' - Add an integer option to an option array.
36 int /* O - Number of options */
38 const char *name, /* I - Name of option */ in cupsAddIntegerOption()
39 int value, /* I - Value of option */ in cupsAddIntegerOption()
40 int num_options, /* I - Number of options */ in cupsAddIntegerOption()
41 cups_option_t **options) /* IO - Pointer to options */ in cupsAddIntegerOption()
[all …]
|
| /external/mesa3d/src/gfxstream/codegen/vulkan/vulkan-docs-next/scripts/htmldiff/ |
| D | htmldiff.pl | 3 # htmldiff - present a diff marked version of two html documents
5 # Copyright (c) 1998-2006 MACS, Inc.
9 # SPDX-License-Identifier: MIT
32 # usage: htmldiff [[-c] [-l] [-o] oldversion newversion [output]]
34 # -c - disable metahtml comment processing
35 # -o - disable outputting of old text
36 # -l - use navindex to create sequence of diffs
37 # oldversion - the previous version of the document
38 # newversion - the newer version of the document
39 # output - a filename to place the output in. If omitted, the output goes to
[all …]
|
| /external/icu/icu4j/main/charset/src/main/java/com/ibm/icu/charset/ |
| D | CharsetBOCU1.java | 5 * Copyright (C) 2008-2011, International Business Machines Corporation and *
40 //private static final int BOCU1_COUNT = (BOCU1_MAX_LEAD-BOCU1_MIN+1);
44 private static final int BOCU1_TRAIL_BYTE_OFFSET = (BOCU1_MIN-BOCU1_TRAIL_CONTROLS_COUNT);
47 …private static final int BOCU1_TRAIL_COUNT =((BOCU1_MAX_TRAIL-BOCU1_MIN+1)+BOCU1_TRAIL_CONTROLS_CO…
50 * number of positive and negative single-byte codes
55 /* number of lead bytes for positive and negative 2/3/4-byte sequences */
60 /* The difference value range for single-byters. */
61 private static final int BOCU1_REACH_POS_1 = (BOCU1_SINGLE-1);
62 private static final int BOCU1_REACH_NEG_1 = (-BOCU1_SINGLE);
64 /* The difference value range for double-byters. */
[all …]
|
| /external/python/cpython2/Lib/unittest/test/ |
| D | test_case.py | 75 self.assertEqual(Test().id()[-13:], '.Test.runTest')
86 self.assertEqual(Test('test').id()[-10:], '.Test.test')
366 # will be a string (either 8-byte or unicode -- again, because the docs
400 "Docstrings are omitted with -O2 and above")
408 "Docstrings are omitted with -O2 and above")
598 diff = '\n'.join(difflib.ndiff(pprint.pformat(seq1).splitlines(),
601 omitted = unittest.case.DIFF_OMITTED % (len(diff) + 1,)
603 self.maxDiff = len(diff)//2
610 self.assertLess(len(msg), len(diff))
613 self.maxDiff = len(diff) * 2
[all …]
|
| /external/icu/icu4j/demos/src/main/java/com/ibm/icu/dev/demo/translit/ |
| D | IntDiffer.java | 5 * Copyright (C) 1996-2016, International Business Machines Corporation and
13 * VERY Basic Diff program. Compares two sequences of ints fed into it, and
48 return aTop-maxSame; in getACount()
52 return bTop-maxSame; in getBCount()
84 if (aCount - maxSame < EQUALSIZE || bCount - maxSame < EQUALSIZE) return; in checkMatch()
87 int match = find(a, aCount-EQUALSIZE, aCount, b, maxSame, bCount); in checkMatch()
88 if (match != -1) { in checkMatch()
89 aTop = aCount-EQUALSIZE; in checkMatch()
93 match = find(b, bCount-EQUALSIZE, bCount, a, maxSame, aCount); in checkMatch()
94 if (match != -1) { in checkMatch()
[all …]
|
| /external/ms-tpm-20-ref/TPMCmd/tpm/src/crypt/ |
| D | BnMath.c | 40 // words in little-endian format. As the magnitude of the number decreases, the
58 // is to allow them to be used in "guarded" sequences. That is:
73 // because handling the carry for multi-precision stuff is not as easy in C
116 for(; count; count--) in CarryProp()
130 pAssert((unsigned)stop < result->allocated); in CarryResolve()
131 result->d[stop++] = 1; in CarryResolve()
151 if(n2->size > n1->size) in BnAdd()
156 pAssert(result->allocated >= n1->size); in BnAdd()
157 stop = MIN(n1->size, n2->allocated); in BnAdd()
158 carry = (int)AddSame(result->d, n1->d, n2->d, (int)stop); in BnAdd()
[all …]
|