Path 1: 966 calls (0.96)

→ a ' 1. Beautiful is beTTer than ugly.' (108) '' (105) ' 3. Simple is better than complex.' (90) ' 4. Complex is better than complicated.' (90) ' ...

3 run 1 not run

1def set_seq1(self, a):
2        """Set the first sequence to be compared.
3
4        The second sequence to be compared is not changed.
5
6        >>> s = SequenceMatcher(None, "abcd", "bcde")
7        >>> s.ratio()
8        0.75
9        >>> s.set_seq1("bcde")
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_seq2().
20        """
21
22        if a is self.a:
23            return
24        self.a = a
25        self.matching_blocks = self.opcodes = None
            

Path 2: 43 calls (0.04)

→ a ' 4. Complex is better than complicated.' (18) 'line 6 changed' (3) 'just fits in!!' (3) 'just fits in two lines yup!!' (3) 'three\n' (3) ' 4. Co...

↩ return None (43)

2 run 2 not run

1def set_seq1(self, a):
2        """Set the first sequence to be compared.
3
4        The second sequence to be compared is not changed.
5
6        >>> s = SequenceMatcher(None, "abcd", "bcde")
7        >>> s.ratio()
8        0.75
9        >>> s.set_seq1("bcde")
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_seq2().
20        """
21
22        if a is self.a:
23            return
24        self.a = a
25        self.matching_blocks = self.opcodes = None