__gmon_start__ _init _fini __cxa_finalize _Jv_RegisterClasses PyObject_GetIter _PyObject_GC_New PyObject_GC_Track _Py_NoneStruct PyArg_ParseTupleAndKeywords PyIter_Next PyObject_RichCompareBool PyObject_CallFunctionObjArgs PyTuple_Pack PyObject_GC_UnTrack PyObject_GC_Del PyTuple_Size PyObject_Repr PyString_FromFormat PyTuple_New PyMem_Malloc PySequence_Tuple PyMem_Free PyErr_NoMemory PyExc_ValueError PyErr_SetString PyInt_AsSsize_t PyErr_Occurred PySequence_Size PyDict_Type PyExc_TypeError PyErr_ExceptionMatches PyErr_Format PyDict_Size PyDict_GetItemString _PyArg_NoKeywords PyExc_StopIteration PyErr_Clear PyNumber_Check PyInt_FromLong PyArg_UnpackTuple PyObject_IsTrue PyBool_Type PyObject_Call PyTuple_Type PyList_New PyList_Size PyList_Append PyObject_ClearWeakRefs PyInt_FromSize_t Py_BuildValue PyInt_FromSsize_t PyNumber_Add PyType_IsSubtype PyArg_ParseTuple PyObject_HasAttrString PyObject_CallMethod inititertools PyType_Type Py_InitModule4 strchr PyModule_AddObject PyType_Ready PyObject_GenericGetAttr PyObject_SelfIter libc.so.6 _edata __bss_start _end GLIBC_2.1.3 GLIBC_2.0
O|O:groupby OO:compress O|n:repeat repeat(%s) repeat(%s, %zd) |n:product r must be non-negative On:combinations O|O:permutations fillvalue izip() chain() imap() |OO:count a number is required ifilterfalse() ifilter() starmap() islice() takewhile() dropwhile() cycle() len() of unsized object O(OO) O(n) count(%zd) count(%s) count(%s, %s) O|n n must be >= 0 __copy__ itertools itertools.tee_dataobject itertools.tee itertools._grouper itertools.combinations itertools.cycle itertools.dropwhile itertools.takewhile itertools.islice itertools.starmap itertools.imap itertools.chain itertools.compress itertools.ifilter itertools.ifilterfalse itertools.count itertools.izip itertools.izip_longest itertools.permutations itertools.product itertools.repeat itertools.groupby key times start step data selectors from_iterable __reduce__ __length_hint__ repeat argument cannot be negative On:combinations_with_replacement izip_longest() got an unexpected keyword argument izip_longest argument #%zd must support iteration izip argument #%zd must support iteration imap() must have at least two arguments. Stop argument for islice() must be None or an integer: 0 <= x <= maxint. Indices for islice() must be None or an integer: 0 <= x <= maxint. Step for islice() must be a positive integer or None. itertools.combinations_with_replacement
@ ` @ ` @ Functional tools for creating and using iterators. Infinite iterators: count([n]) --> n, n+1, n+2, ... cycle(p) --> p0, p1, ... plast, p0, p1, ... repeat(elem [,n]) --> elem, elem, elem, ... endlessly or up to n times Iterators terminating on the shortest input sequence: chain(p, q, ...) --> p0, p1, ... plast, q0, q1, ... compress(data, selectors) --> (d[0] if s[0]), (d[1] if s[1]), ... dropwhile(pred, seq) --> seq[n], seq[n+1], starting when pred fails groupby(iterable[, keyfunc]) --> sub-iterators grouped by value of keyfunc(v) ifilter(pred, seq) --> elements of seq where pred(elem) is True ifilterfalse(pred, seq) --> elements of seq where pred(elem) is False islice(seq, [start,] stop [, step]) --> elements from seq[start:stop:step] imap(fun, p, q, ...) --> fun(p0, q0), fun(p1, q1), ... starmap(fun, seq) --> fun(*seq[0]), fun(*seq[1]), ... tee(it, n=2) --> (it1, it2 , ... itn) splits one iterator into n takewhile(pred, seq) --> seq[0], seq[1], until pred fails izip(p, q, ...) --> (p[0], q[0]), (p[1], q[1]), ... izip_longest(p, q, ...) --> (p[0], q[0]), (p[1], q[1]), ... Combinatoric generators: product(p, q, ... [repeat=1]) --> cartesian product permutations(p[, r]) combinations(p, r) combinations_with_replacement(p, r) Data container common to multiple tee objects. tee(iterable, n=2) --> tuple of n independent iterators. Iterator wrapped to make it copyable combinations(iterable, r) --> combinations object Return successive r-length combinations of elements in the iterable. combinations(range(4), 3) --> (0,1,2), (0,1,3), (0,2,3), (1,2,3) combinations_with_replacement(iterable, r) --> combinations_with_replacement object Return successive r-length combinations of elements in the iterable allowing individual elements to have successive repeats. combinations_with_replacement('ABC', 2) --> AA AB AC BB BC CC cycle(iterable) --> cycle object Return elements from the iterable until it is exhausted. Then repeat the sequence indefinitely. dropwhile(predicate, iterable) --> dropwhile object Drop items from the iterable while predicate(item) is true. Afterwards, return every element until the iterable is exhausted. takewhile(predicate, iterable) --> takewhile object Return successive entries from an iterable as long as the predicate evaluates to true for each entry. islice(iterable, [start,] stop [, step]) --> islice object Return an iterator whose next() method returns selected values from an iterable. If start is specified, will skip all preceding elements; otherwise, start defaults to zero. Step defaults to one. If specified as another value, step determines how many values are skipped between successive calls. Works like a slice() on a list but returns an iterator. starmap(function, sequence) --> starmap object Return an iterator whose values are returned from the function evaluated with a argument tuple taken from the given sequence. imap(func, *iterables) --> imap object Make an iterator that computes the function using arguments from each of the iterables. Like map() except that it returns an iterator instead of a list and that it stops when the shortest iterable is exhausted instead of filling in None for shorter iterables. chain(*iterables) --> chain object Return a chain object whose .next() method returns elements from the first iterable until it is exhausted, then elements from the next iterable, until all of the iterables are exhausted. compress(data, selectors) --> iterator over selected data Return data elements corresponding to true selector elements. Forms a shorter iterator from selected data elements using the selectors to choose the data elements. ifilter(function or None, sequence) --> ifilter object Return those items of sequence for which function(item) is true. If function is None, return the items that are true. ifilterfalse(function or None, sequence) --> ifilterfalse object Return those items of sequence for which function(item) is false. If function is None, return the items that are false. count(start=0, step=1) --> count object Return a count object whose .next() method returns consecutive values. Equivalent to: def count(firstval=0, step=1): x = firstval while 1: yield x x += step izip(iter1 [,iter2 [...]]) --> izip object Return a izip object whose .next() method returns a tuple where the i-th element comes from the i-th iterable argument. The .next() method continues until the shortest iterable in the argument sequence is exhausted and then it raises StopIteration. Works like the zip() function but consumes less memory by returning an iterator instead of a list. izip_longest(iter1 [,iter2 [...]], [fillvalue=None]) --> izip_longest object Return an izip_longest object whose .next() method returns a tuple where the i-th element comes from the i-th iterable argument. The .next() method continues until the longest iterable in the argument sequence is exhausted and then it raises StopIteration. When the shorter iterables are exhausted, the fillvalue is substituted in their place. The fillvalue defaults to None or can be specified by a keyword argument. permutations(iterable[, r]) --> permutations object Return successive r-length permutations of elements in the iterable. permutations(range(3), 2) --> (0,1), (0,2), (1,0), (1,2), (2,0), (2,1) product(*iterables) --> product object Cartesian product of input iterables. Equivalent to nested for-loops. For example, product(A, B) returns the same as: ((x,y) for x in A for y in B). The leftmost iterators are in the outermost for-loop, so the output tuples cycle in a manner similar to an odometer (with the rightmost element changing on every iteration). To compute the product of an iterable with itself, specify the number of repetitions with the optional repeat keyword argument. For example, product(A, repeat=4) means the same as product(A, A, A, A). product('ab', range(3)) --> ('a',0) ('a',1) ('a',2) ('b',0) ('b',1) ('b',2) product((0,1), (0,1), (0,1)) --> (0,0,0) (0,0,1) (0,1,0) (0,1,1) (1,0,0) ... repeat(object [,times]) -> create an iterator which returns the object for the specified number of times. If not specified, returns the object endlessly. groupby(iterable[, keyfunc]) -> create an iterator which returns (key, sub-iterator) grouped by each value of key(value). Returns an independent iterator. chain.from_iterable(iterable) --> chain object Alternate chain() contructor taking a single iterable argument that evaluates lazily. Return state information for pickling. Private method returning an estimate of len(list(it)). xk * A `\ 0 k Pe A @ 0 [ f k @* A \ k < E p_ 3 @; o : E @ _ 1 09 k ) E ` \ @Z X k `) E 0] PV 0Q k ( E ] PU P l ( E ` ` pM l ( E ] 0X pL $l ' E P^ @W F 3l @' E ^ G PE Cl & E ` `T Vl `& E ` PS pK hl % E Pa @R pJ l % c E ` a d @ @H l % E ` b 0 C l $ E pb @? `A l 8 E 0` @. @= l 8 E _ `, 5 l $ + E @ p ` * l 0# E ` p[ ! k Pg *m m k m *m k m m m m *m k *m k ek 0 %m 3m 0c >m b
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 itertoolsmodule.c teedataobject_clear teedataobject_type tee_traverse islice_traverse islice_next repeat_traverse repeat_next chain_new_from_iterable tee_copy tee_type groupby_new kwargs.8783 compress_new kwargs.9542 tee_next _grouper_next groupby_next _grouper_type groupby_dealloc repeat_dealloc izip_longest_dealloc izip_dealloc count_dealloc ifilterfalse_dealloc ifilter_dealloc compress_dealloc chain_dealloc imap_dealloc starmap_dealloc islice_dealloc takewhile_dealloc dropwhile_dealloc cycle_dealloc _grouper_dealloc teedataobject_dealloc repeat_new kwargs.9764 repeat_repr product_next permutations_next izip_next cwr_next combinations_next product_new product_dealloc permutations_dealloc cwr_new kwargs.9401 cwr_dealloc combinations_new kwargs.9332 combinations_dealloc permutations_new kwargs.9473 izip_longest_next izip_longest_new izip_new izip_type chain_new chain_type imap_new imap_type chain_next count_new kwlist.9663 ifilterfalse_new ifilterfalse_type ifilter_new ifilter_type starmap_new starmap_type islice_new islice_type takewhile_new takewhile_type dropwhile_new dropwhile_type ifilterfalse_next ifilter_next compress_next takewhile_next dropwhile_next imap_next starmap_next cycle_new cycle_type cycle_next tee_clear groupby_traverse _grouper_traverse teedataobject_traverse cycle_traverse dropwhile_traverse takewhile_traverse starmap_traverse imap_traverse chain_traverse product_traverse combinations_traverse cwr_traverse permutations_traverse compress_traverse ifilter_traverse ifilterfalse_traverse count_traverse izip_traverse izip_longest_traverse repeat_len count_reduce count_repr count_next tee_dealloc tee_fromiterable tee_new tee combinations_type cwr_type compress_type count_type iziplongest_type permutations_type product_type repeat_type groupby_type module_doc module_methods teedataobject_doc tee_doc teeobject_doc tee_methods combinations_doc cwr_doc cycle_doc dropwhile_doc takewhile_doc islice_doc starmap_doc imap_doc chain_doc chain_methods compress_doc ifilter_doc ifilterfalse_doc count_doc count_methods izip_doc izip_longest_doc permutations_doc product_doc repeat_doc repeat_methods groupby_doc teecopy_doc chain_from_iterable_doc count_reduce_doc length_hint_doc _GLOBAL_OFFSET_TABLE_ __x86.get_pc_thunk.bx __dso_handle __DTOR_END__ _DYNAMIC PyModule_AddObject PyExc_StopIteration PyBool_Type PyArg_UnpackTuple PyObject_CallMethod PyIter_Next PyExc_ValueError PyType_Ready PyObject_SelfIter PyMem_Free __gmon_start__ _Jv_RegisterClasses strchr@@GLIBC_2.0 _fini PyObject_GC_Del PyErr_NoMemory PyObject_GC_UnTrack PyObject_CallFunctionObjArgs PyObject_IsTrue PyExc_TypeError PyDict_Type PyErr_Format PyArg_ParseTuple _PyArg_NoKeywords PyErr_ExceptionMatches PyErr_Occurred PyArg_ParseTupleAndKeywords _PyObject_GC_New PyString_FromFormat PyTuple_Pack PyInt_FromLong PyTuple_Type PyInt_AsSsize_t PyInt_FromSize_t PyDict_Size PyObject_GenericGetAttr PySequence_Size PyObject_GetIter PyList_Size PyType_IsSubtype PyType_Type PyNumber_Add PyObject_ClearWeakRefs Py_BuildValue __bss_start _Py_NoneStruct PyNumber_Check PyList_Append PyDict_GetItemString PySequence_Tuple PyObject_Call PyInt_FromSsize_t Py_InitModule4 PyTuple_Size _end PyErr_Clear PyTuple_New PyObject_RichCompareBool PyErr_SetString _edata PyObject_HasAttrString inititertools PyList_New PyMem_Malloc __cxa_finalize@@GLIBC_2.1.3 PyObject_GC_Track PyObject_Repr _init
