def bisect_right(self, val):
_maxes = self._maxes<EOL>if not _maxes:<EOL><INDENT>return <NUM_LIT:0><EOL><DEDENT>pos = bisect_right(_maxes, val)<EOL>if pos == len(_maxes):<EOL><INDENT>return self._len<EOL><DEDENT>idx = bisect_right(self._lists[pos], val)<EOL>return self._loc(pos, idx)<EOL>
Same as *bisect_left*, but if *val* is already present, the insertion
point will be after (to the right of) any existing entries.