summaryrefslogtreecommitdiffstats
path: root/Parser/intrcheck.c
diff options
context:
space:
mode:
authorTim Peters <tim.peters@gmail.com>2000-12-29 02:06:45 (GMT)
committerTim Peters <tim.peters@gmail.com>2000-12-29 02:06:45 (GMT)
commit36cdad12ddb2d70cc260d2a03e2b7e2f8ebb9a73 (patch)
treeb8d38d97318b978080b844b199c441e9dd955ff5 /Parser/intrcheck.c
parent011ea47577eca09abe0d78aece95618e66554f66 (diff)
downloadcpython-36cdad12ddb2d70cc260d2a03e2b7e2f8ebb9a73.zip
cpython-36cdad12ddb2d70cc260d2a03e2b7e2f8ebb9a73.tar.gz
cpython-36cdad12ddb2d70cc260d2a03e2b7e2f8ebb9a73.tar.bz2
Fred, THIS NEEDS DOCS! The function docstrings tell the tale.
Christmas present to myself: the bisect module didn't define what happened if the new element was already in the list. It so happens that it inserted the new element "to the right" of all equal elements. Since it wasn't defined, among other bad implications it was a mystery how to use bisect to determine whether an element was already in the list (I've seen code that *assumed* "to the right" without justification). Added new methods bisect_left and insort_left that insert "to the left" instead; made the old names bisect and insort aliases for the new names bisect_right and insort_right; beefed up docstrings to explain what these actually do; and added a std test for the bisect module.
Diffstat (limited to 'Parser/intrcheck.c')
0 files changed, 0 insertions, 0 deletions