__gmon_start__ _init _fini __cxa_finalize _Jv_RegisterClasses PySequence_GetItem PyObject_RichCompareBool PySequence_Size PyExc_ValueError PyErr_SetString PyArg_ParseTupleAndKeywords PyList_Type PyObject_CallMethod _Py_NoneStruct PyList_Insert PyInt_FromSsize_t init_bisect Py_InitModule4 libc.so.6 _edata __bss_start _end GLIBC_2.1.3
lo must be non-negative OO|nn:insort_left nO insert OO|nn:insort_right OO|nn:bisect_left OO|nn:bisect_right _bisect insort a x lo hi
`! Bisection algorithms. This module provides support for maintaining a list in sorted order without having to sort the list after each insertion. For long lists of items with expensive comparison operations, this can be an improvement over the more common approach. bisect(a, x[, lo[, hi]]) -> index bisect_right(a, x[, lo[, hi]]) -> index Return the index where to insert item x in list a, assuming a is sorted. The return value i is such that all e in a[:i] have e <= x, and all e in a[i:] have e > x. So if x already appears in the list, i points just beyond the rightmost x already there Optional args lo (default 0) and hi (default len(a)) bound the slice of a to be searched. insort(a, x[, lo[, hi]]) insort_right(a, x[, lo[, hi]]) Insert item x in list a, and keep it sorted assuming a is sorted. If x is already in a, insert it to the right of the rightmost x. Optional args lo (default 0) and hi (default len(a)) bound the slice of a to be searched. bisect_left(a, x[, lo[, hi]]) -> index Return the index where to insert item x in list a, assuming a is sorted. The return value i is such that all e in a[:i] have e < x, and all e in a[i:] have e >= x. So if x already appears in the list, i points just before the leftmost x already there. Optional args lo (default 0) and hi (default len(a)) bound the slice of a to be searched. insort_left(a, x[, lo[, hi]]) Insert item x in list a, and keep it sorted assuming a is sorted. If x is already in a, insert it to the left of the leftmost x. Optional args lo (default 0) and hi (default len(a)) bound the slice of a to be searched. + " 9 " `$ @ `$ % ' G I K N G I K N G I K N G I K N
GCC: (GNU) 4.2.3 (Ubuntu 4.2.3-2ubuntu7) GCC: (GNU) 4.6.x-google 20120106 (prerelease) GCC: (GNU) 4.2.3 (Ubuntu 4.2.3-2ubuntu7)
.symtab .strtab .shstrtab .hash .dynsym .dynstr .gnu.version .gnu.version_r .rel.dyn .rel.plt .init .text .fini .rodata .eh_frame_hdr .eh_frame .ctors .dtors .jcr .dynamic .got .got.plt .data .bss .comment .debug_aranges .debug_info .debug_abbrev .debug_line .debug_ranges
initfini.c crtstuff.c __CTOR_LIST__ __DTOR_LIST__ __JCR_LIST__ __do_global_dtors_aux completed.5467 dtor_idx.5469 frame_dummy __CTOR_END__ __FRAME_END__ __JCR_END__ __do_global_ctors_aux _bisectmodule.c internal_bisect_left insort_left keywords.8809 internal_bisect_right insort_right keywords.8772 bisect_left keywords.8796 bisect_right keywords.8759 module_doc bisect_methods bisect_right_doc insort_right_doc bisect_left_doc insort_left_doc _GLOBAL_OFFSET_TABLE_ __x86.get_pc_thunk.bx __dso_handle __DTOR_END__ _DYNAMIC PyList_Insert PyObject_CallMethod PyExc_ValueError __gmon_start__ _Jv_RegisterClasses _fini PyList_Type PyArg_ParseTupleAndKeywords PySequence_GetItem PySequence_Size __bss_start _Py_NoneStruct PyInt_FromSsize_t Py_InitModule4 _end init_bisect PyObject_RichCompareBool PyErr_SetString _edata __cxa_finalize@@GLIBC_2.1.3 _init
