@@ -1187,7 +1187,7 @@ def bisect_right(self, value):
1187
1187
"""Return an index to insert `value` in the sorted list.
1188
1188
1189
1189
Similar to `bisect_left`, but if `value` is already present, the
1190
- insertion point with be after (to the right of) any existing values.
1190
+ insertion point will be after (to the right of) any existing values.
1191
1191
1192
1192
Similar to the `bisect` module in the standard library.
1193
1193
@@ -2243,7 +2243,7 @@ def bisect_right(self, value):
2243
2243
"""Return an index to insert `value` in the sorted-key list.
2244
2244
2245
2245
Similar to `bisect_left`, but if `value` is already present, the
2246
- insertion point with be after (to the right of) any existing values.
2246
+ insertion point will be after (to the right of) any existing values.
2247
2247
2248
2248
Similar to the `bisect` module in the standard library.
2249
2249
@@ -2303,7 +2303,7 @@ def bisect_key_right(self, key):
2303
2303
"""Return an index to insert `key` in the sorted-key list.
2304
2304
2305
2305
Similar to `bisect_key_left`, but if `key` is already present, the
2306
- insertion point with be after (to the right of) any existing keys.
2306
+ insertion point will be after (to the right of) any existing keys.
2307
2307
2308
2308
Similar to the `bisect` module in the standard library.
2309
2309
0 commit comments