Method: difflib.SequenceMatcher.set_seq2
Calls: 483, Exceptions: 0, Paths: 2Back
Path 1: 442 calls (0.92)
'' (105) ' 5. Flat is better than nested.' (36) ' 1. Beautiful is better than ugly.' (34) ' 3. Simple is better than complex.' (34) ' 4. Com...
1def set_seq2(self, b):
2 """Set the second sequence to be compared.
3
4 The first sequence to be compared is not changed.
5
6 >>> s = SequenceMatcher(None, "abcd", "bcde")
7 >>> s.ratio()
8 0.75
9 >>> s.set_seq2("abcd")
10 >>> s.ratio()
11 1.0
12 >>>
13
14 SequenceMatcher computes and caches detailed information about the
15 second sequence, so if you want to compare one sequence S against
16 many sequences, use .set_seq2(S) once and call .set_seq1(x)
17 repeatedly for each of the other sequences.
18
19 See also set_seqs() and set_seq1().
20 """
21
22 if b is self.b:
23 return
24 self.b = b
25 self.matching_blocks = self.opcodes = None
26 self.fullbcount = None
27 self.__chain_b()
Path 2: 41 calls (0.08)
' 1. Beautiful is better than ugly.' (17) 'line 6a changEd' (3) 'just fitS in!!' (3) 'just fits in two lineS yup!!' (3) 'ore\n' (3) ' Line 1: pr...
None (41)
1def set_seq2(self, b):
2 """Set the second sequence to be compared.
3
4 The first sequence to be compared is not changed.
5
6 >>> s = SequenceMatcher(None, "abcd", "bcde")
7 >>> s.ratio()
8 0.75
9 >>> s.set_seq2("abcd")
10 >>> s.ratio()
11 1.0
12 >>>
13
14 SequenceMatcher computes and caches detailed information about the
15 second sequence, so if you want to compare one sequence S against
16 many sequences, use .set_seq2(S) once and call .set_seq1(x)
17 repeatedly for each of the other sequences.
18
19 See also set_seqs() and set_seq1().
20 """
21
22 if b is self.b:
23 return
24 self.b = b
25 self.matching_blocks = self.opcodes = None
26 self.fullbcount = None
27 self.__chain_b()