Lines Matching refs:junk
54 the longest contiguous matching subsequence that contains no "junk"
55 elements (R-O doesn't address junk). The same idea is then applied
62 longest *contiguous* & junk-free matching subsequence. That's what
67 to synching up on blocks of "junk lines", though (like blank lines in
70 "junk" <wink>.
72 Example, comparing two strings, and considering blanks to be "junk":
159 element is junk. None is equivalent to passing "lambda x: 0", i.e.
160 no elements are considered to be junk. For example, pass
174 "automatic junk heuristic" that treats popular elements as junk
186 # at which x appears; junk elements do not appear
204 # returning true iff the element is "junk" -- this has
292 # when self.isjunk is defined, junk elements don't show up in this
294 # from starting any matching block at a junk element ...
299 # be viewed as an adaptive notion of semi-junk, and yields an enormous
308 # for junk a LOT, it's important to minimize the number of calls.
314 # of junk. I.e., we don't call isjunk at all yet. Throwing
315 # out the junk later is much cheaper than building b2j "right"
324 # Purge junk elements
325 junk = set()
330 junk.add(elt)
333 # Purge popular elements that are not junk
343 # Now for x in b, isjunk(x) == x in junk, but the latter is much faster.
344 # Sicne the number of *unique* junk elements is probably small, the
347 self.isbjunk = junk.__contains__
373 junk element appears in the block. Then that block is extended as
374 far as possible by matching (only) junk elements on both sides. So
375 the resulting block never matches on junk except as identical junk
379 junk. That prevents " abcd" from matching the " abcd" at the tail
408 # find longest junk-free match
410 # junk-free match ending with a[i-1] and b[j]
415 # b2j has no junk keys, the loop is skipped if a[i] is junk
429 # Extend the best by non-junk elements on each end. In particular,
430 # "popular" non-junk elements aren't in b2j, which greatly speeds
432 # doesn't contain any junk *or* popular non-junk elements.
443 # empty!), we may as well suck up the matching junk on each
816 filter out line and character 'junk'. See Differ.__init__ for details.
867 and return true iff the string is junk. The module-level function
971 # (identical lines must be junk lines, & we don't want to synch up
972 # on junk -- unless we have to)
1089 # With respect to junk, an earlier version of ndiff simply refused to
1090 # *start* a match with a junk element. The result was cases like this:
1093 # If you consider whitespace to be junk, the longest contiguous match
1094 # not starting with junk is "e Thread currentThread". So ndiff reported
1097 # looks for matching blocks that are entirely junk-free, then extends the
1098 # longest one of those as far as possible but only with matching junk.
1324 return true iff the string is junk. The default is None, and is
