diff options
| author | Christian Clauss <cclauss@me.com> | 2021-10-06 23:57:10 (GMT) |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2021-10-06 23:57:10 (GMT) |
| commit | 5f401f10400123afa9171548c432ea3fc37c0736 (patch) | |
| tree | ff6d1e214f02b837c06e1bdf7fcab735e7af612c /Objects/exception_handling_notes.txt | |
| parent | db72e58ea5940c3942ede9f70cb897510b52fc36 (diff) | |
| download | cpython-5f401f10400123afa9171548c432ea3fc37c0736.zip cpython-5f401f10400123afa9171548c432ea3fc37c0736.tar.gz cpython-5f401f10400123afa9171548c432ea3fc37c0736.tar.bz2 | |
Fix typos in the Objects directory (GH-28766)
Diffstat (limited to 'Objects/exception_handling_notes.txt')
| -rw-r--r-- | Objects/exception_handling_notes.txt | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/Objects/exception_handling_notes.txt b/Objects/exception_handling_notes.txt index 2183fa1..e738c27 100644 --- a/Objects/exception_handling_notes.txt +++ b/Objects/exception_handling_notes.txt @@ -105,7 +105,7 @@ All offsets and lengths are in instructions, not bytes. We want the format to be compact, but quickly searchable. For it to be compact, it needs to have variable sized entries so that we can store common (small) offsets compactly, but handle large offsets if needed. For it to be searchable quickly, we need to support binary search giving us log(n) performance in all cases. -Binary search typically assumes fixed size entries, but that is not necesary, as long as we can identify the start of an entry. +Binary search typically assumes fixed size entries, but that is not necessary, as long as we can identify the start of an entry. It is worth noting that the size (end-start) is always smaller than the end, so we encode the entries as: start, size, target, depth, push-lasti |