equal
deleted
inserted
replaced
62 def _search(self, m, s, lo=0, hi=None): |
62 def _search(self, m, s, lo=0, hi=None): |
63 '''return a tuple (start, end) that says where to find s within m. |
63 '''return a tuple (start, end) that says where to find s within m. |
64 |
64 |
65 If the string is found m[start:end] are the line containing |
65 If the string is found m[start:end] are the line containing |
66 that string. If start == end the string was not found and |
66 that string. If start == end the string was not found and |
67 they indicate the proper sorted insertion point. This was |
67 they indicate the proper sorted insertion point. |
68 taken from bisect_left, and modified to find line start/end as |
|
69 it goes along. |
|
70 |
68 |
71 m should be a buffer or a string |
69 m should be a buffer or a string |
72 s is a string''' |
70 s is a string''' |
73 def advance(i, c): |
71 def advance(i, c): |
74 while i < lenm and m[i] != c: |
72 while i < lenm and m[i] != c: |