3 #include "structmember.h"
5 /* Itertools module written and maintained
6 by Raymond D. Hettinger <python@rcn.com>
7 Copyright (c) 2003 Python Software Foundation.
12 /* groupby object ***********************************************************/
23 static PyTypeObject groupby_type
;
24 static PyObject
*_grouper_create(groupbyobject
*, PyObject
*);
27 groupby_new(PyTypeObject
*type
, PyObject
*args
, PyObject
*kwds
)
29 static char *kwargs
[] = {"iterable", "key", NULL
};
31 PyObject
*it
, *keyfunc
= Py_None
;
33 if (!PyArg_ParseTupleAndKeywords(args
, kwds
, "O|O:groupby", kwargs
,
37 gbo
= (groupbyobject
*)type
->tp_alloc(type
, 0);
42 gbo
->currvalue
= NULL
;
43 gbo
->keyfunc
= keyfunc
;
45 gbo
->it
= PyObject_GetIter(it
);
46 if (gbo
->it
== NULL
) {
50 return (PyObject
*)gbo
;
54 groupby_dealloc(groupbyobject
*gbo
)
56 PyObject_GC_UnTrack(gbo
);
58 Py_XDECREF(gbo
->keyfunc
);
59 Py_XDECREF(gbo
->tgtkey
);
60 Py_XDECREF(gbo
->currkey
);
61 Py_XDECREF(gbo
->currvalue
);
62 Py_TYPE(gbo
)->tp_free(gbo
);
66 groupby_traverse(groupbyobject
*gbo
, visitproc visit
, void *arg
)
69 Py_VISIT(gbo
->keyfunc
);
70 Py_VISIT(gbo
->tgtkey
);
71 Py_VISIT(gbo
->currkey
);
72 Py_VISIT(gbo
->currvalue
);
77 groupby_next(groupbyobject
*gbo
)
79 PyObject
*newvalue
, *newkey
, *r
, *grouper
, *tmp
;
81 /* skip to next iteration group */
83 if (gbo
->currkey
== NULL
)
85 else if (gbo
->tgtkey
== NULL
)
90 rcmp
= PyObject_RichCompareBool(gbo
->tgtkey
,
98 newvalue
= PyIter_Next(gbo
->it
);
102 if (gbo
->keyfunc
== Py_None
) {
106 newkey
= PyObject_CallFunctionObjArgs(gbo
->keyfunc
,
108 if (newkey
== NULL
) {
115 gbo
->currkey
= newkey
;
118 tmp
= gbo
->currvalue
;
119 gbo
->currvalue
= newvalue
;
123 Py_INCREF(gbo
->currkey
);
125 gbo
->tgtkey
= gbo
->currkey
;
128 grouper
= _grouper_create(gbo
, gbo
->tgtkey
);
132 r
= PyTuple_Pack(2, gbo
->currkey
, grouper
);
137 PyDoc_STRVAR(groupby_doc
,
138 "groupby(iterable[, keyfunc]) -> create an iterator which returns\n\
139 (key, sub-iterator) grouped by each value of key(value).\n");
141 static PyTypeObject groupby_type
= {
142 PyVarObject_HEAD_INIT(NULL
, 0)
143 "itertools.groupby", /* tp_name */
144 sizeof(groupbyobject
), /* tp_basicsize */
147 (destructor
)groupby_dealloc
, /* tp_dealloc */
153 0, /* tp_as_number */
154 0, /* tp_as_sequence */
155 0, /* tp_as_mapping */
159 PyObject_GenericGetAttr
, /* tp_getattro */
161 0, /* tp_as_buffer */
162 Py_TPFLAGS_DEFAULT
| Py_TPFLAGS_HAVE_GC
|
163 Py_TPFLAGS_BASETYPE
, /* tp_flags */
164 groupby_doc
, /* tp_doc */
165 (traverseproc
)groupby_traverse
, /* tp_traverse */
167 0, /* tp_richcompare */
168 0, /* tp_weaklistoffset */
169 PyObject_SelfIter
, /* tp_iter */
170 (iternextfunc
)groupby_next
, /* tp_iternext */
176 0, /* tp_descr_get */
177 0, /* tp_descr_set */
178 0, /* tp_dictoffset */
181 groupby_new
, /* tp_new */
182 PyObject_GC_Del
, /* tp_free */
186 /* _grouper object (internal) ************************************************/
194 static PyTypeObject _grouper_type
;
197 _grouper_create(groupbyobject
*parent
, PyObject
*tgtkey
)
201 igo
= PyObject_GC_New(_grouperobject
, &_grouper_type
);
204 igo
->parent
= (PyObject
*)parent
;
206 igo
->tgtkey
= tgtkey
;
209 PyObject_GC_Track(igo
);
210 return (PyObject
*)igo
;
214 _grouper_dealloc(_grouperobject
*igo
)
216 PyObject_GC_UnTrack(igo
);
217 Py_DECREF(igo
->parent
);
218 Py_DECREF(igo
->tgtkey
);
219 PyObject_GC_Del(igo
);
223 _grouper_traverse(_grouperobject
*igo
, visitproc visit
, void *arg
)
225 Py_VISIT(igo
->parent
);
226 Py_VISIT(igo
->tgtkey
);
231 _grouper_next(_grouperobject
*igo
)
233 groupbyobject
*gbo
= (groupbyobject
*)igo
->parent
;
234 PyObject
*newvalue
, *newkey
, *r
;
237 if (gbo
->currvalue
== NULL
) {
238 newvalue
= PyIter_Next(gbo
->it
);
239 if (newvalue
== NULL
)
242 if (gbo
->keyfunc
== Py_None
) {
246 newkey
= PyObject_CallFunctionObjArgs(gbo
->keyfunc
,
248 if (newkey
== NULL
) {
254 assert(gbo
->currkey
== NULL
);
255 gbo
->currkey
= newkey
;
256 gbo
->currvalue
= newvalue
;
259 assert(gbo
->currkey
!= NULL
);
260 rcmp
= PyObject_RichCompareBool(igo
->tgtkey
, gbo
->currkey
, Py_EQ
);
262 /* got any error or current group is end */
266 gbo
->currvalue
= NULL
;
267 Py_CLEAR(gbo
->currkey
);
272 static PyTypeObject _grouper_type
= {
273 PyVarObject_HEAD_INIT(NULL
, 0)
274 "itertools._grouper", /* tp_name */
275 sizeof(_grouperobject
), /* tp_basicsize */
278 (destructor
)_grouper_dealloc
, /* tp_dealloc */
284 0, /* tp_as_number */
285 0, /* tp_as_sequence */
286 0, /* tp_as_mapping */
290 PyObject_GenericGetAttr
, /* tp_getattro */
292 0, /* tp_as_buffer */
293 Py_TPFLAGS_DEFAULT
| Py_TPFLAGS_HAVE_GC
, /* tp_flags */
295 (traverseproc
)_grouper_traverse
,/* tp_traverse */
297 0, /* tp_richcompare */
298 0, /* tp_weaklistoffset */
299 PyObject_SelfIter
, /* tp_iter */
300 (iternextfunc
)_grouper_next
, /* tp_iternext */
306 0, /* tp_descr_get */
307 0, /* tp_descr_set */
308 0, /* tp_dictoffset */
312 PyObject_GC_Del
, /* tp_free */
317 /* tee object and with supporting function and objects ***************/
319 /* The teedataobject pre-allocates space for LINKCELLS number of objects.
320 To help the object fit neatly inside cache lines (space for 16 to 32
321 pointers), the value should be a multiple of 16 minus space for
322 the other structure members including PyHEAD overhead. The larger the
323 value, the less memory overhead per object and the less time spent
324 allocating/deallocating new links. The smaller the number, the less
325 wasted space and the more rapid freeing of older data.
334 PyObject
*(values
[LINKCELLS
]);
339 teedataobject
*dataobj
;
341 PyObject
*weakreflist
;
344 static PyTypeObject teedataobject_type
;
347 teedataobject_new(PyObject
*it
)
351 tdo
= PyObject_GC_New(teedataobject
, &teedataobject_type
);
356 tdo
->nextlink
= NULL
;
359 PyObject_GC_Track(tdo
);
360 return (PyObject
*)tdo
;
364 teedataobject_jumplink(teedataobject
*tdo
)
366 if (tdo
->nextlink
== NULL
)
367 tdo
->nextlink
= teedataobject_new(tdo
->it
);
368 Py_XINCREF(tdo
->nextlink
);
369 return tdo
->nextlink
;
373 teedataobject_getitem(teedataobject
*tdo
, int i
)
377 assert(i
< LINKCELLS
);
378 if (i
< tdo
->numread
)
379 value
= tdo
->values
[i
];
381 /* this is the lead iterator, so fetch more data */
382 assert(i
== tdo
->numread
);
383 value
= PyIter_Next(tdo
->it
);
387 tdo
->values
[i
] = value
;
394 teedataobject_traverse(teedataobject
*tdo
, visitproc visit
, void * arg
)
398 for (i
= 0; i
< tdo
->numread
; i
++)
399 Py_VISIT(tdo
->values
[i
]);
400 Py_VISIT(tdo
->nextlink
);
405 teedataobject_safe_decref(PyObject
*obj
)
407 while (obj
&& Py_TYPE(obj
) == &teedataobject_type
&&
408 Py_REFCNT(obj
) == 1) {
409 PyObject
*nextlink
= ((teedataobject
*)obj
)->nextlink
;
410 ((teedataobject
*)obj
)->nextlink
= NULL
;
418 teedataobject_clear(teedataobject
*tdo
)
424 for (i
=0 ; i
<tdo
->numread
; i
++)
425 Py_CLEAR(tdo
->values
[i
]);
427 tdo
->nextlink
= NULL
;
428 teedataobject_safe_decref(tmp
);
433 teedataobject_dealloc(teedataobject
*tdo
)
435 PyObject_GC_UnTrack(tdo
);
436 teedataobject_clear(tdo
);
437 PyObject_GC_Del(tdo
);
440 PyDoc_STRVAR(teedataobject_doc
, "Data container common to multiple tee objects.");
442 static PyTypeObject teedataobject_type
= {
443 PyVarObject_HEAD_INIT(0, 0) /* Must fill in type value later */
444 "itertools.tee_dataobject", /* tp_name */
445 sizeof(teedataobject
), /* tp_basicsize */
448 (destructor
)teedataobject_dealloc
, /* tp_dealloc */
454 0, /* tp_as_number */
455 0, /* tp_as_sequence */
456 0, /* tp_as_mapping */
460 PyObject_GenericGetAttr
, /* tp_getattro */
462 0, /* tp_as_buffer */
463 Py_TPFLAGS_DEFAULT
| Py_TPFLAGS_HAVE_GC
, /* tp_flags */
464 teedataobject_doc
, /* tp_doc */
465 (traverseproc
)teedataobject_traverse
, /* tp_traverse */
466 (inquiry
)teedataobject_clear
, /* tp_clear */
467 0, /* tp_richcompare */
468 0, /* tp_weaklistoffset */
476 0, /* tp_descr_get */
477 0, /* tp_descr_set */
478 0, /* tp_dictoffset */
482 PyObject_GC_Del
, /* tp_free */
486 static PyTypeObject tee_type
;
489 tee_next(teeobject
*to
)
491 PyObject
*value
, *link
;
493 if (to
->index
>= LINKCELLS
) {
494 link
= teedataobject_jumplink(to
->dataobj
);
497 Py_DECREF(to
->dataobj
);
498 to
->dataobj
= (teedataobject
*)link
;
501 value
= teedataobject_getitem(to
->dataobj
, to
->index
);
509 tee_traverse(teeobject
*to
, visitproc visit
, void *arg
)
511 Py_VISIT((PyObject
*)to
->dataobj
);
516 tee_copy(teeobject
*to
)
520 newto
= PyObject_GC_New(teeobject
, &tee_type
);
523 Py_INCREF(to
->dataobj
);
524 newto
->dataobj
= to
->dataobj
;
525 newto
->index
= to
->index
;
526 newto
->weakreflist
= NULL
;
527 PyObject_GC_Track(newto
);
528 return (PyObject
*)newto
;
531 PyDoc_STRVAR(teecopy_doc
, "Returns an independent iterator.");
534 tee_fromiterable(PyObject
*iterable
)
539 it
= PyObject_GetIter(iterable
);
542 if (PyObject_TypeCheck(it
, &tee_type
)) {
543 to
= (teeobject
*)tee_copy((teeobject
*)it
);
547 to
= PyObject_GC_New(teeobject
, &tee_type
);
550 to
->dataobj
= (teedataobject
*)teedataobject_new(it
);
558 to
->weakreflist
= NULL
;
559 PyObject_GC_Track(to
);
562 return (PyObject
*)to
;
566 tee_new(PyTypeObject
*type
, PyObject
*args
, PyObject
*kw
)
570 if (!PyArg_UnpackTuple(args
, "tee", 1, 1, &iterable
))
572 return tee_fromiterable(iterable
);
576 tee_clear(teeobject
*to
)
578 if (to
->weakreflist
!= NULL
)
579 PyObject_ClearWeakRefs((PyObject
*) to
);
580 Py_CLEAR(to
->dataobj
);
585 tee_dealloc(teeobject
*to
)
587 PyObject_GC_UnTrack(to
);
592 PyDoc_STRVAR(teeobject_doc
,
593 "Iterator wrapped to make it copyable");
595 static PyMethodDef tee_methods
[] = {
596 {"__copy__", (PyCFunction
)tee_copy
, METH_NOARGS
, teecopy_doc
},
597 {NULL
, NULL
} /* sentinel */
600 static PyTypeObject tee_type
= {
601 PyVarObject_HEAD_INIT(NULL
, 0)
602 "itertools.tee", /* tp_name */
603 sizeof(teeobject
), /* tp_basicsize */
606 (destructor
)tee_dealloc
, /* tp_dealloc */
612 0, /* tp_as_number */
613 0, /* tp_as_sequence */
614 0, /* tp_as_mapping */
620 0, /* tp_as_buffer */
621 Py_TPFLAGS_DEFAULT
| Py_TPFLAGS_HAVE_GC
, /* tp_flags */
622 teeobject_doc
, /* tp_doc */
623 (traverseproc
)tee_traverse
, /* tp_traverse */
624 (inquiry
)tee_clear
, /* tp_clear */
625 0, /* tp_richcompare */
626 offsetof(teeobject
, weakreflist
), /* tp_weaklistoffset */
627 PyObject_SelfIter
, /* tp_iter */
628 (iternextfunc
)tee_next
, /* tp_iternext */
629 tee_methods
, /* tp_methods */
634 0, /* tp_descr_get */
635 0, /* tp_descr_set */
636 0, /* tp_dictoffset */
639 tee_new
, /* tp_new */
640 PyObject_GC_Del
, /* tp_free */
644 tee(PyObject
*self
, PyObject
*args
)
647 PyObject
*it
, *iterable
, *copyable
, *result
;
649 if (!PyArg_ParseTuple(args
, "O|n", &iterable
, &n
))
652 PyErr_SetString(PyExc_ValueError
, "n must be >= 0");
655 result
= PyTuple_New(n
);
660 it
= PyObject_GetIter(iterable
);
665 if (!PyObject_HasAttrString(it
, "__copy__")) {
666 copyable
= tee_fromiterable(it
);
668 if (copyable
== NULL
) {
674 PyTuple_SET_ITEM(result
, 0, copyable
);
675 for (i
=1 ; i
<n
; i
++) {
676 copyable
= PyObject_CallMethod(copyable
, "__copy__", NULL
);
677 if (copyable
== NULL
) {
681 PyTuple_SET_ITEM(result
, i
, copyable
);
686 PyDoc_STRVAR(tee_doc
,
687 "tee(iterable, n=2) --> tuple of n independent iterators.");
690 /* cycle object **********************************************************/
699 static PyTypeObject cycle_type
;
702 cycle_new(PyTypeObject
*type
, PyObject
*args
, PyObject
*kwds
)
709 if (type
== &cycle_type
&& !_PyArg_NoKeywords("cycle()", kwds
))
712 if (!PyArg_UnpackTuple(args
, "cycle", 1, 1, &iterable
))
716 it
= PyObject_GetIter(iterable
);
720 saved
= PyList_New(0);
726 /* create cycleobject structure */
727 lz
= (cycleobject
*)type
->tp_alloc(type
, 0);
737 return (PyObject
*)lz
;
741 cycle_dealloc(cycleobject
*lz
)
743 PyObject_GC_UnTrack(lz
);
744 Py_XDECREF(lz
->saved
);
746 Py_TYPE(lz
)->tp_free(lz
);
750 cycle_traverse(cycleobject
*lz
, visitproc visit
, void *arg
)
758 cycle_next(cycleobject
*lz
)
765 item
= PyIter_Next(lz
->it
);
767 if (!lz
->firstpass
&& PyList_Append(lz
->saved
, item
)) {
773 if (PyErr_Occurred()) {
774 if (PyErr_ExceptionMatches(PyExc_StopIteration
))
779 if (PyList_Size(lz
->saved
) == 0)
781 it
= PyObject_GetIter(lz
->saved
);
791 PyDoc_STRVAR(cycle_doc
,
792 "cycle(iterable) --> cycle object\n\
794 Return elements from the iterable until it is exhausted.\n\
795 Then repeat the sequence indefinitely.");
797 static PyTypeObject cycle_type
= {
798 PyVarObject_HEAD_INIT(NULL
, 0)
799 "itertools.cycle", /* tp_name */
800 sizeof(cycleobject
), /* tp_basicsize */
803 (destructor
)cycle_dealloc
, /* tp_dealloc */
809 0, /* tp_as_number */
810 0, /* tp_as_sequence */
811 0, /* tp_as_mapping */
815 PyObject_GenericGetAttr
, /* tp_getattro */
817 0, /* tp_as_buffer */
818 Py_TPFLAGS_DEFAULT
| Py_TPFLAGS_HAVE_GC
|
819 Py_TPFLAGS_BASETYPE
, /* tp_flags */
820 cycle_doc
, /* tp_doc */
821 (traverseproc
)cycle_traverse
, /* tp_traverse */
823 0, /* tp_richcompare */
824 0, /* tp_weaklistoffset */
825 PyObject_SelfIter
, /* tp_iter */
826 (iternextfunc
)cycle_next
, /* tp_iternext */
832 0, /* tp_descr_get */
833 0, /* tp_descr_set */
834 0, /* tp_dictoffset */
837 cycle_new
, /* tp_new */
838 PyObject_GC_Del
, /* tp_free */
842 /* dropwhile object **********************************************************/
851 static PyTypeObject dropwhile_type
;
854 dropwhile_new(PyTypeObject
*type
, PyObject
*args
, PyObject
*kwds
)
856 PyObject
*func
, *seq
;
860 if (type
== &dropwhile_type
&& !_PyArg_NoKeywords("dropwhile()", kwds
))
863 if (!PyArg_UnpackTuple(args
, "dropwhile", 2, 2, &func
, &seq
))
867 it
= PyObject_GetIter(seq
);
871 /* create dropwhileobject structure */
872 lz
= (dropwhileobject
*)type
->tp_alloc(type
, 0);
882 return (PyObject
*)lz
;
886 dropwhile_dealloc(dropwhileobject
*lz
)
888 PyObject_GC_UnTrack(lz
);
889 Py_XDECREF(lz
->func
);
891 Py_TYPE(lz
)->tp_free(lz
);
895 dropwhile_traverse(dropwhileobject
*lz
, visitproc visit
, void *arg
)
903 dropwhile_next(dropwhileobject
*lz
)
905 PyObject
*item
, *good
;
906 PyObject
*it
= lz
->it
;
908 PyObject
*(*iternext
)(PyObject
*);
910 iternext
= *Py_TYPE(it
)->tp_iternext
;
918 good
= PyObject_CallFunctionObjArgs(lz
->func
, item
, NULL
);
923 ok
= PyObject_IsTrue(good
);
935 PyDoc_STRVAR(dropwhile_doc
,
936 "dropwhile(predicate, iterable) --> dropwhile object\n\
938 Drop items from the iterable while predicate(item) is true.\n\
939 Afterwards, return every element until the iterable is exhausted.");
941 static PyTypeObject dropwhile_type
= {
942 PyVarObject_HEAD_INIT(NULL
, 0)
943 "itertools.dropwhile", /* tp_name */
944 sizeof(dropwhileobject
), /* tp_basicsize */
947 (destructor
)dropwhile_dealloc
, /* tp_dealloc */
953 0, /* tp_as_number */
954 0, /* tp_as_sequence */
955 0, /* tp_as_mapping */
959 PyObject_GenericGetAttr
, /* tp_getattro */
961 0, /* tp_as_buffer */
962 Py_TPFLAGS_DEFAULT
| Py_TPFLAGS_HAVE_GC
|
963 Py_TPFLAGS_BASETYPE
, /* tp_flags */
964 dropwhile_doc
, /* tp_doc */
965 (traverseproc
)dropwhile_traverse
, /* tp_traverse */
967 0, /* tp_richcompare */
968 0, /* tp_weaklistoffset */
969 PyObject_SelfIter
, /* tp_iter */
970 (iternextfunc
)dropwhile_next
, /* tp_iternext */
976 0, /* tp_descr_get */
977 0, /* tp_descr_set */
978 0, /* tp_dictoffset */
981 dropwhile_new
, /* tp_new */
982 PyObject_GC_Del
, /* tp_free */
986 /* takewhile object **********************************************************/
995 static PyTypeObject takewhile_type
;
998 takewhile_new(PyTypeObject
*type
, PyObject
*args
, PyObject
*kwds
)
1000 PyObject
*func
, *seq
;
1002 takewhileobject
*lz
;
1004 if (type
== &takewhile_type
&& !_PyArg_NoKeywords("takewhile()", kwds
))
1007 if (!PyArg_UnpackTuple(args
, "takewhile", 2, 2, &func
, &seq
))
1011 it
= PyObject_GetIter(seq
);
1015 /* create takewhileobject structure */
1016 lz
= (takewhileobject
*)type
->tp_alloc(type
, 0);
1026 return (PyObject
*)lz
;
1030 takewhile_dealloc(takewhileobject
*lz
)
1032 PyObject_GC_UnTrack(lz
);
1033 Py_XDECREF(lz
->func
);
1035 Py_TYPE(lz
)->tp_free(lz
);
1039 takewhile_traverse(takewhileobject
*lz
, visitproc visit
, void *arg
)
1047 takewhile_next(takewhileobject
*lz
)
1049 PyObject
*item
, *good
;
1050 PyObject
*it
= lz
->it
;
1056 item
= (*Py_TYPE(it
)->tp_iternext
)(it
);
1060 good
= PyObject_CallFunctionObjArgs(lz
->func
, item
, NULL
);
1065 ok
= PyObject_IsTrue(good
);
1075 PyDoc_STRVAR(takewhile_doc
,
1076 "takewhile(predicate, iterable) --> takewhile object\n\
1078 Return successive entries from an iterable as long as the \n\
1079 predicate evaluates to true for each entry.");
1081 static PyTypeObject takewhile_type
= {
1082 PyVarObject_HEAD_INIT(NULL
, 0)
1083 "itertools.takewhile", /* tp_name */
1084 sizeof(takewhileobject
), /* tp_basicsize */
1085 0, /* tp_itemsize */
1087 (destructor
)takewhile_dealloc
, /* tp_dealloc */
1093 0, /* tp_as_number */
1094 0, /* tp_as_sequence */
1095 0, /* tp_as_mapping */
1099 PyObject_GenericGetAttr
, /* tp_getattro */
1100 0, /* tp_setattro */
1101 0, /* tp_as_buffer */
1102 Py_TPFLAGS_DEFAULT
| Py_TPFLAGS_HAVE_GC
|
1103 Py_TPFLAGS_BASETYPE
, /* tp_flags */
1104 takewhile_doc
, /* tp_doc */
1105 (traverseproc
)takewhile_traverse
, /* tp_traverse */
1107 0, /* tp_richcompare */
1108 0, /* tp_weaklistoffset */
1109 PyObject_SelfIter
, /* tp_iter */
1110 (iternextfunc
)takewhile_next
, /* tp_iternext */
1116 0, /* tp_descr_get */
1117 0, /* tp_descr_set */
1118 0, /* tp_dictoffset */
1121 takewhile_new
, /* tp_new */
1122 PyObject_GC_Del
, /* tp_free */
1126 /* islice object ************************************************************/
1137 static PyTypeObject islice_type
;
1140 islice_new(PyTypeObject
*type
, PyObject
*args
, PyObject
*kwds
)
1143 Py_ssize_t start
=0, stop
=-1, step
=1;
1144 PyObject
*it
, *a1
=NULL
, *a2
=NULL
, *a3
=NULL
;
1148 if (type
== &islice_type
&& !_PyArg_NoKeywords("islice()", kwds
))
1151 if (!PyArg_UnpackTuple(args
, "islice", 2, 4, &seq
, &a1
, &a2
, &a3
))
1154 numargs
= PyTuple_Size(args
);
1156 if (a1
!= Py_None
) {
1157 stop
= PyInt_AsSsize_t(a1
);
1159 if (PyErr_Occurred())
1161 PyErr_SetString(PyExc_ValueError
,
1162 "Stop argument for islice() must be None or an integer: 0 <= x <= maxint.");
1168 start
= PyInt_AsSsize_t(a1
);
1169 if (start
== -1 && PyErr_Occurred())
1171 if (a2
!= Py_None
) {
1172 stop
= PyInt_AsSsize_t(a2
);
1174 if (PyErr_Occurred())
1176 PyErr_SetString(PyExc_ValueError
,
1177 "Stop argument for islice() must be None or an integer: 0 <= x <= maxint.");
1182 if (start
<0 || stop
<-1) {
1183 PyErr_SetString(PyExc_ValueError
,
1184 "Indices for islice() must be None or an integer: 0 <= x <= maxint.");
1190 step
= PyInt_AsSsize_t(a3
);
1191 if (step
== -1 && PyErr_Occurred())
1195 PyErr_SetString(PyExc_ValueError
,
1196 "Step for islice() must be a positive integer or None.");
1201 it
= PyObject_GetIter(seq
);
1205 /* create isliceobject structure */
1206 lz
= (isliceobject
*)type
->tp_alloc(type
, 0);
1217 return (PyObject
*)lz
;
1221 islice_dealloc(isliceobject
*lz
)
1223 PyObject_GC_UnTrack(lz
);
1225 Py_TYPE(lz
)->tp_free(lz
);
1229 islice_traverse(isliceobject
*lz
, visitproc visit
, void *arg
)
1236 islice_next(isliceobject
*lz
)
1239 PyObject
*it
= lz
->it
;
1240 Py_ssize_t stop
= lz
->stop
;
1242 PyObject
*(*iternext
)(PyObject
*);
1247 iternext
= *Py_TYPE(it
)->tp_iternext
;
1248 while (lz
->cnt
< lz
->next
) {
1249 item
= iternext(it
);
1255 if (stop
!= -1 && lz
->cnt
>= stop
)
1257 item
= iternext(it
);
1262 /* The (size_t) cast below avoids the danger of undefined
1263 behaviour from signed integer overflow. */
1264 lz
->next
+= (size_t)lz
->step
;
1265 if (lz
->next
< oldnext
|| (stop
!= -1 && lz
->next
> stop
))
1274 PyDoc_STRVAR(islice_doc
,
1275 "islice(iterable, [start,] stop [, step]) --> islice object\n\
1277 Return an iterator whose next() method returns selected values from an\n\
1278 iterable. If start is specified, will skip all preceding elements;\n\
1279 otherwise, start defaults to zero. Step defaults to one. If\n\
1280 specified as another value, step determines how many values are \n\
1281 skipped between successive calls. Works like a slice() on a list\n\
1282 but returns an iterator.");
1284 static PyTypeObject islice_type
= {
1285 PyVarObject_HEAD_INIT(NULL
, 0)
1286 "itertools.islice", /* tp_name */
1287 sizeof(isliceobject
), /* tp_basicsize */
1288 0, /* tp_itemsize */
1290 (destructor
)islice_dealloc
, /* tp_dealloc */
1296 0, /* tp_as_number */
1297 0, /* tp_as_sequence */
1298 0, /* tp_as_mapping */
1302 PyObject_GenericGetAttr
, /* tp_getattro */
1303 0, /* tp_setattro */
1304 0, /* tp_as_buffer */
1305 Py_TPFLAGS_DEFAULT
| Py_TPFLAGS_HAVE_GC
|
1306 Py_TPFLAGS_BASETYPE
, /* tp_flags */
1307 islice_doc
, /* tp_doc */
1308 (traverseproc
)islice_traverse
, /* tp_traverse */
1310 0, /* tp_richcompare */
1311 0, /* tp_weaklistoffset */
1312 PyObject_SelfIter
, /* tp_iter */
1313 (iternextfunc
)islice_next
, /* tp_iternext */
1319 0, /* tp_descr_get */
1320 0, /* tp_descr_set */
1321 0, /* tp_dictoffset */
1324 islice_new
, /* tp_new */
1325 PyObject_GC_Del
, /* tp_free */
1329 /* starmap object ************************************************************/
1337 static PyTypeObject starmap_type
;
1340 starmap_new(PyTypeObject
*type
, PyObject
*args
, PyObject
*kwds
)
1342 PyObject
*func
, *seq
;
1346 if (type
== &starmap_type
&& !_PyArg_NoKeywords("starmap()", kwds
))
1349 if (!PyArg_UnpackTuple(args
, "starmap", 2, 2, &func
, &seq
))
1353 it
= PyObject_GetIter(seq
);
1357 /* create starmapobject structure */
1358 lz
= (starmapobject
*)type
->tp_alloc(type
, 0);
1367 return (PyObject
*)lz
;
1371 starmap_dealloc(starmapobject
*lz
)
1373 PyObject_GC_UnTrack(lz
);
1374 Py_XDECREF(lz
->func
);
1376 Py_TYPE(lz
)->tp_free(lz
);
1380 starmap_traverse(starmapobject
*lz
, visitproc visit
, void *arg
)
1388 starmap_next(starmapobject
*lz
)
1392 PyObject
*it
= lz
->it
;
1394 args
= (*Py_TYPE(it
)->tp_iternext
)(it
);
1397 if (!PyTuple_CheckExact(args
)) {
1398 PyObject
*newargs
= PySequence_Tuple(args
);
1400 if (newargs
== NULL
)
1404 result
= PyObject_Call(lz
->func
, args
, NULL
);
1409 PyDoc_STRVAR(starmap_doc
,
1410 "starmap(function, sequence) --> starmap object\n\
1412 Return an iterator whose values are returned from the function evaluated\n\
1413 with a argument tuple taken from the given sequence.");
1415 static PyTypeObject starmap_type
= {
1416 PyVarObject_HEAD_INIT(NULL
, 0)
1417 "itertools.starmap", /* tp_name */
1418 sizeof(starmapobject
), /* tp_basicsize */
1419 0, /* tp_itemsize */
1421 (destructor
)starmap_dealloc
, /* tp_dealloc */
1427 0, /* tp_as_number */
1428 0, /* tp_as_sequence */
1429 0, /* tp_as_mapping */
1433 PyObject_GenericGetAttr
, /* tp_getattro */
1434 0, /* tp_setattro */
1435 0, /* tp_as_buffer */
1436 Py_TPFLAGS_DEFAULT
| Py_TPFLAGS_HAVE_GC
|
1437 Py_TPFLAGS_BASETYPE
, /* tp_flags */
1438 starmap_doc
, /* tp_doc */
1439 (traverseproc
)starmap_traverse
, /* tp_traverse */
1441 0, /* tp_richcompare */
1442 0, /* tp_weaklistoffset */
1443 PyObject_SelfIter
, /* tp_iter */
1444 (iternextfunc
)starmap_next
, /* tp_iternext */
1450 0, /* tp_descr_get */
1451 0, /* tp_descr_set */
1452 0, /* tp_dictoffset */
1455 starmap_new
, /* tp_new */
1456 PyObject_GC_Del
, /* tp_free */
1460 /* imap object ************************************************************/
1468 static PyTypeObject imap_type
;
1471 imap_new(PyTypeObject
*type
, PyObject
*args
, PyObject
*kwds
)
1473 PyObject
*it
, *iters
, *func
;
1475 Py_ssize_t numargs
, i
;
1477 if (type
== &imap_type
&& !_PyArg_NoKeywords("imap()", kwds
))
1480 numargs
= PyTuple_Size(args
);
1482 PyErr_SetString(PyExc_TypeError
,
1483 "imap() must have at least two arguments.");
1487 iters
= PyTuple_New(numargs
-1);
1491 for (i
=1 ; i
<numargs
; i
++) {
1493 it
= PyObject_GetIter(PyTuple_GET_ITEM(args
, i
));
1498 PyTuple_SET_ITEM(iters
, i
-1, it
);
1501 /* create imapobject structure */
1502 lz
= (imapobject
*)type
->tp_alloc(type
, 0);
1508 func
= PyTuple_GET_ITEM(args
, 0);
1512 return (PyObject
*)lz
;
1516 imap_dealloc(imapobject
*lz
)
1518 PyObject_GC_UnTrack(lz
);
1519 Py_XDECREF(lz
->iters
);
1520 Py_XDECREF(lz
->func
);
1521 Py_TYPE(lz
)->tp_free(lz
);
1525 imap_traverse(imapobject
*lz
, visitproc visit
, void *arg
)
1527 Py_VISIT(lz
->iters
);
1533 imap() is an iterator version of __builtins__.map() except that it does
1534 not have the None fill-in feature. That was intentionally left out for
1535 the following reasons:
1537 1) Itertools are designed to be easily combined and chained together.
1538 Having all tools stop with the shortest input is a unifying principle
1539 that makes it easier to combine finite iterators (supplying data) with
1540 infinite iterators like count() and repeat() (for supplying sequential
1541 or constant arguments to a function).
1543 2) In typical use cases for combining itertools, having one finite data
1544 supplier run out before another is likely to be an error condition which
1545 should not pass silently by automatically supplying None.
1547 3) The use cases for automatic None fill-in are rare -- not many functions
1548 do something useful when a parameter suddenly switches type and becomes
1551 4) If a need does arise, it can be met by __builtins__.map() or by
1552 writing: chain(iterable, repeat(None)).
1554 5) Similar toolsets in Haskell and SML do not have automatic None fill-in.
1558 imap_next(imapobject
*lz
)
1563 Py_ssize_t numargs
, i
;
1565 numargs
= PyTuple_Size(lz
->iters
);
1566 argtuple
= PyTuple_New(numargs
);
1567 if (argtuple
== NULL
)
1570 for (i
=0 ; i
<numargs
; i
++) {
1571 val
= PyIter_Next(PyTuple_GET_ITEM(lz
->iters
, i
));
1573 Py_DECREF(argtuple
);
1576 PyTuple_SET_ITEM(argtuple
, i
, val
);
1578 if (lz
->func
== Py_None
)
1580 result
= PyObject_Call(lz
->func
, argtuple
, NULL
);
1581 Py_DECREF(argtuple
);
1585 PyDoc_STRVAR(imap_doc
,
1586 "imap(func, *iterables) --> imap object\n\
1588 Make an iterator that computes the function using arguments from\n\
1589 each of the iterables. Like map() except that it returns\n\
1590 an iterator instead of a list and that it stops when the shortest\n\
1591 iterable is exhausted instead of filling in None for shorter\n\
1594 static PyTypeObject imap_type
= {
1595 PyVarObject_HEAD_INIT(NULL
, 0)
1596 "itertools.imap", /* tp_name */
1597 sizeof(imapobject
), /* tp_basicsize */
1598 0, /* tp_itemsize */
1600 (destructor
)imap_dealloc
, /* tp_dealloc */
1606 0, /* tp_as_number */
1607 0, /* tp_as_sequence */
1608 0, /* tp_as_mapping */
1612 PyObject_GenericGetAttr
, /* tp_getattro */
1613 0, /* tp_setattro */
1614 0, /* tp_as_buffer */
1615 Py_TPFLAGS_DEFAULT
| Py_TPFLAGS_HAVE_GC
|
1616 Py_TPFLAGS_BASETYPE
, /* tp_flags */
1617 imap_doc
, /* tp_doc */
1618 (traverseproc
)imap_traverse
, /* tp_traverse */
1620 0, /* tp_richcompare */
1621 0, /* tp_weaklistoffset */
1622 PyObject_SelfIter
, /* tp_iter */
1623 (iternextfunc
)imap_next
, /* tp_iternext */
1629 0, /* tp_descr_get */
1630 0, /* tp_descr_set */
1631 0, /* tp_dictoffset */
1634 imap_new
, /* tp_new */
1635 PyObject_GC_Del
, /* tp_free */
1639 /* chain object ************************************************************/
1643 PyObject
*source
; /* Iterator over input iterables */
1644 PyObject
*active
; /* Currently running input iterator */
1647 static PyTypeObject chain_type
;
1650 chain_new_internal(PyTypeObject
*type
, PyObject
*source
)
1654 lz
= (chainobject
*)type
->tp_alloc(type
, 0);
1660 lz
->source
= source
;
1662 return (PyObject
*)lz
;
1666 chain_new(PyTypeObject
*type
, PyObject
*args
, PyObject
*kwds
)
1670 if (type
== &chain_type
&& !_PyArg_NoKeywords("chain()", kwds
))
1673 source
= PyObject_GetIter(args
);
1677 return chain_new_internal(type
, source
);
1681 chain_new_from_iterable(PyTypeObject
*type
, PyObject
*arg
)
1685 source
= PyObject_GetIter(arg
);
1689 return chain_new_internal(type
, source
);
1693 chain_dealloc(chainobject
*lz
)
1695 PyObject_GC_UnTrack(lz
);
1696 Py_XDECREF(lz
->active
);
1697 Py_XDECREF(lz
->source
);
1698 Py_TYPE(lz
)->tp_free(lz
);
1702 chain_traverse(chainobject
*lz
, visitproc visit
, void *arg
)
1704 Py_VISIT(lz
->source
);
1705 Py_VISIT(lz
->active
);
1710 chain_next(chainobject
*lz
)
1714 if (lz
->source
== NULL
)
1715 return NULL
; /* already stopped */
1717 if (lz
->active
== NULL
) {
1718 PyObject
*iterable
= PyIter_Next(lz
->source
);
1719 if (iterable
== NULL
) {
1720 Py_CLEAR(lz
->source
);
1721 return NULL
; /* no more input sources */
1723 lz
->active
= PyObject_GetIter(iterable
);
1724 Py_DECREF(iterable
);
1725 if (lz
->active
== NULL
) {
1726 Py_CLEAR(lz
->source
);
1727 return NULL
; /* input not iterable */
1730 item
= PyIter_Next(lz
->active
);
1733 if (PyErr_Occurred()) {
1734 if (PyErr_ExceptionMatches(PyExc_StopIteration
))
1737 return NULL
; /* input raised an exception */
1739 Py_CLEAR(lz
->active
);
1740 return chain_next(lz
); /* recurse and use next active */
1743 PyDoc_STRVAR(chain_doc
,
1744 "chain(*iterables) --> chain object\n\
1746 Return a chain object whose .next() method returns elements from the\n\
1747 first iterable until it is exhausted, then elements from the next\n\
1748 iterable, until all of the iterables are exhausted.");
1750 PyDoc_STRVAR(chain_from_iterable_doc
,
1751 "chain.from_iterable(iterable) --> chain object\n\
1753 Alternate chain() contructor taking a single iterable argument\n\
1754 that evaluates lazily.");
1756 static PyMethodDef chain_methods
[] = {
1757 {"from_iterable", (PyCFunction
) chain_new_from_iterable
, METH_O
| METH_CLASS
,
1758 chain_from_iterable_doc
},
1759 {NULL
, NULL
} /* sentinel */
1762 static PyTypeObject chain_type
= {
1763 PyVarObject_HEAD_INIT(NULL
, 0)
1764 "itertools.chain", /* tp_name */
1765 sizeof(chainobject
), /* tp_basicsize */
1766 0, /* tp_itemsize */
1768 (destructor
)chain_dealloc
, /* tp_dealloc */
1774 0, /* tp_as_number */
1775 0, /* tp_as_sequence */
1776 0, /* tp_as_mapping */
1780 PyObject_GenericGetAttr
, /* tp_getattro */
1781 0, /* tp_setattro */
1782 0, /* tp_as_buffer */
1783 Py_TPFLAGS_DEFAULT
| Py_TPFLAGS_HAVE_GC
|
1784 Py_TPFLAGS_BASETYPE
, /* tp_flags */
1785 chain_doc
, /* tp_doc */
1786 (traverseproc
)chain_traverse
, /* tp_traverse */
1788 0, /* tp_richcompare */
1789 0, /* tp_weaklistoffset */
1790 PyObject_SelfIter
, /* tp_iter */
1791 (iternextfunc
)chain_next
, /* tp_iternext */
1792 chain_methods
, /* tp_methods */
1797 0, /* tp_descr_get */
1798 0, /* tp_descr_set */
1799 0, /* tp_dictoffset */
1802 chain_new
, /* tp_new */
1803 PyObject_GC_Del
, /* tp_free */
1807 /* product object ************************************************************/
1811 PyObject
*pools
; /* tuple of pool tuples */
1812 Py_ssize_t
*indices
; /* one index per pool */
1813 PyObject
*result
; /* most recently returned result tuple */
1814 int stopped
; /* set to 1 when the product iterator is exhausted */
1817 static PyTypeObject product_type
;
1820 product_new(PyTypeObject
*type
, PyObject
*args
, PyObject
*kwds
)
1823 Py_ssize_t nargs
, npools
, repeat
=1;
1824 PyObject
*pools
= NULL
;
1825 Py_ssize_t
*indices
= NULL
;
1829 char *kwlist
[] = {"repeat", 0};
1830 PyObject
*tmpargs
= PyTuple_New(0);
1831 if (tmpargs
== NULL
)
1833 if (!PyArg_ParseTupleAndKeywords(tmpargs
, kwds
, "|n:product", kwlist
, &repeat
)) {
1839 PyErr_SetString(PyExc_ValueError
,
1840 "repeat argument cannot be negative");
1845 assert(PyTuple_CheckExact(args
));
1849 nargs
= PyTuple_GET_SIZE(args
);
1850 if ((size_t)nargs
> PY_SSIZE_T_MAX
/sizeof(Py_ssize_t
)/repeat
) {
1851 PyErr_SetString(PyExc_OverflowError
, "repeat argument too large");
1855 npools
= nargs
* repeat
;
1857 indices
= PyMem_New(Py_ssize_t
, npools
);
1858 if (indices
== NULL
) {
1863 pools
= PyTuple_New(npools
);
1867 for (i
=0; i
< nargs
; ++i
) {
1868 PyObject
*item
= PyTuple_GET_ITEM(args
, i
);
1869 PyObject
*pool
= PySequence_Tuple(item
);
1872 PyTuple_SET_ITEM(pools
, i
, pool
);
1875 for ( ; i
< npools
; ++i
) {
1876 PyObject
*pool
= PyTuple_GET_ITEM(pools
, i
- nargs
);
1878 PyTuple_SET_ITEM(pools
, i
, pool
);
1882 /* create productobject structure */
1883 lz
= (productobject
*)type
->tp_alloc(type
, 0);
1888 lz
->indices
= indices
;
1892 return (PyObject
*)lz
;
1895 if (indices
!= NULL
)
1896 PyMem_Free(indices
);
1902 product_dealloc(productobject
*lz
)
1904 PyObject_GC_UnTrack(lz
);
1905 Py_XDECREF(lz
->pools
);
1906 Py_XDECREF(lz
->result
);
1907 if (lz
->indices
!= NULL
)
1908 PyMem_Free(lz
->indices
);
1909 Py_TYPE(lz
)->tp_free(lz
);
1913 product_traverse(productobject
*lz
, visitproc visit
, void *arg
)
1915 Py_VISIT(lz
->pools
);
1916 Py_VISIT(lz
->result
);
1921 product_next(productobject
*lz
)
1926 PyObject
*pools
= lz
->pools
;
1927 PyObject
*result
= lz
->result
;
1928 Py_ssize_t npools
= PyTuple_GET_SIZE(pools
);
1934 if (result
== NULL
) {
1935 /* On the first pass, return an initial tuple filled with the
1936 first element from each pool. */
1937 result
= PyTuple_New(npools
);
1940 lz
->result
= result
;
1941 for (i
=0; i
< npools
; i
++) {
1942 pool
= PyTuple_GET_ITEM(pools
, i
);
1943 if (PyTuple_GET_SIZE(pool
) == 0)
1945 elem
= PyTuple_GET_ITEM(pool
, 0);
1947 PyTuple_SET_ITEM(result
, i
, elem
);
1950 Py_ssize_t
*indices
= lz
->indices
;
1952 /* Copy the previous result tuple or re-use it if available */
1953 if (Py_REFCNT(result
) > 1) {
1954 PyObject
*old_result
= result
;
1955 result
= PyTuple_New(npools
);
1958 lz
->result
= result
;
1959 for (i
=0; i
< npools
; i
++) {
1960 elem
= PyTuple_GET_ITEM(old_result
, i
);
1962 PyTuple_SET_ITEM(result
, i
, elem
);
1964 Py_DECREF(old_result
);
1966 /* Now, we've got the only copy so we can update it in-place */
1967 assert (npools
==0 || Py_REFCNT(result
) == 1);
1969 /* Update the pool indices right-to-left. Only advance to the
1970 next pool when the previous one rolls-over */
1971 for (i
=npools
-1 ; i
>= 0 ; i
--) {
1972 pool
= PyTuple_GET_ITEM(pools
, i
);
1974 if (indices
[i
] == PyTuple_GET_SIZE(pool
)) {
1975 /* Roll-over and advance to next pool */
1977 elem
= PyTuple_GET_ITEM(pool
, 0);
1979 oldelem
= PyTuple_GET_ITEM(result
, i
);
1980 PyTuple_SET_ITEM(result
, i
, elem
);
1983 /* No rollover. Just increment and stop here. */
1984 elem
= PyTuple_GET_ITEM(pool
, indices
[i
]);
1986 oldelem
= PyTuple_GET_ITEM(result
, i
);
1987 PyTuple_SET_ITEM(result
, i
, elem
);
1993 /* If i is negative, then the indices have all rolled-over
2007 PyDoc_STRVAR(product_doc
,
2008 "product(*iterables) --> product object\n\
2010 Cartesian product of input iterables. Equivalent to nested for-loops.\n\n\
2011 For example, product(A, B) returns the same as: ((x,y) for x in A for y in B).\n\
2012 The leftmost iterators are in the outermost for-loop, so the output tuples\n\
2013 cycle in a manner similar to an odometer (with the rightmost element changing\n\
2014 on every iteration).\n\n\
2015 To compute the product of an iterable with itself, specify the number\n\
2016 of repetitions with the optional repeat keyword argument. For example,\n\
2017 product(A, repeat=4) means the same as product(A, A, A, A).\n\n\
2018 product('ab', range(3)) --> ('a',0) ('a',1) ('a',2) ('b',0) ('b',1) ('b',2)\n\
2019 product((0,1), (0,1), (0,1)) --> (0,0,0) (0,0,1) (0,1,0) (0,1,1) (1,0,0) ...");
2021 static PyTypeObject product_type
= {
2022 PyVarObject_HEAD_INIT(NULL
, 0)
2023 "itertools.product", /* tp_name */
2024 sizeof(productobject
), /* tp_basicsize */
2025 0, /* tp_itemsize */
2027 (destructor
)product_dealloc
, /* tp_dealloc */
2033 0, /* tp_as_number */
2034 0, /* tp_as_sequence */
2035 0, /* tp_as_mapping */
2039 PyObject_GenericGetAttr
, /* tp_getattro */
2040 0, /* tp_setattro */
2041 0, /* tp_as_buffer */
2042 Py_TPFLAGS_DEFAULT
| Py_TPFLAGS_HAVE_GC
|
2043 Py_TPFLAGS_BASETYPE
, /* tp_flags */
2044 product_doc
, /* tp_doc */
2045 (traverseproc
)product_traverse
, /* tp_traverse */
2047 0, /* tp_richcompare */
2048 0, /* tp_weaklistoffset */
2049 PyObject_SelfIter
, /* tp_iter */
2050 (iternextfunc
)product_next
, /* tp_iternext */
2056 0, /* tp_descr_get */
2057 0, /* tp_descr_set */
2058 0, /* tp_dictoffset */
2061 product_new
, /* tp_new */
2062 PyObject_GC_Del
, /* tp_free */
2066 /* combinations object ************************************************************/
2070 PyObject
*pool
; /* input converted to a tuple */
2071 Py_ssize_t
*indices
; /* one index per result element */
2072 PyObject
*result
; /* most recently returned result tuple */
2073 Py_ssize_t r
; /* size of result tuple */
2074 int stopped
; /* set to 1 when the combinations iterator is exhausted */
2075 } combinationsobject
;
2077 static PyTypeObject combinations_type
;
2080 combinations_new(PyTypeObject
*type
, PyObject
*args
, PyObject
*kwds
)
2082 combinationsobject
*co
;
2085 PyObject
*pool
= NULL
;
2086 PyObject
*iterable
= NULL
;
2087 Py_ssize_t
*indices
= NULL
;
2089 static char *kwargs
[] = {"iterable", "r", NULL
};
2091 if (!PyArg_ParseTupleAndKeywords(args
, kwds
, "On:combinations", kwargs
,
2095 pool
= PySequence_Tuple(iterable
);
2098 n
= PyTuple_GET_SIZE(pool
);
2100 PyErr_SetString(PyExc_ValueError
, "r must be non-negative");
2104 indices
= PyMem_New(Py_ssize_t
, r
);
2105 if (indices
== NULL
) {
2110 for (i
=0 ; i
<r
; i
++)
2113 /* create combinationsobject structure */
2114 co
= (combinationsobject
*)type
->tp_alloc(type
, 0);
2119 co
->indices
= indices
;
2122 co
->stopped
= r
> n
? 1 : 0;
2124 return (PyObject
*)co
;
2127 if (indices
!= NULL
)
2128 PyMem_Free(indices
);
2134 combinations_dealloc(combinationsobject
*co
)
2136 PyObject_GC_UnTrack(co
);
2137 Py_XDECREF(co
->pool
);
2138 Py_XDECREF(co
->result
);
2139 if (co
->indices
!= NULL
)
2140 PyMem_Free(co
->indices
);
2141 Py_TYPE(co
)->tp_free(co
);
2145 combinations_traverse(combinationsobject
*co
, visitproc visit
, void *arg
)
2148 Py_VISIT(co
->result
);
2153 combinations_next(combinationsobject
*co
)
2157 PyObject
*pool
= co
->pool
;
2158 Py_ssize_t
*indices
= co
->indices
;
2159 PyObject
*result
= co
->result
;
2160 Py_ssize_t n
= PyTuple_GET_SIZE(pool
);
2161 Py_ssize_t r
= co
->r
;
2162 Py_ssize_t i
, j
, index
;
2167 if (result
== NULL
) {
2168 /* On the first pass, initialize result tuple using the indices */
2169 result
= PyTuple_New(r
);
2172 co
->result
= result
;
2173 for (i
=0; i
<r
; i
++) {
2175 elem
= PyTuple_GET_ITEM(pool
, index
);
2177 PyTuple_SET_ITEM(result
, i
, elem
);
2180 /* Copy the previous result tuple or re-use it if available */
2181 if (Py_REFCNT(result
) > 1) {
2182 PyObject
*old_result
= result
;
2183 result
= PyTuple_New(r
);
2186 co
->result
= result
;
2187 for (i
=0; i
<r
; i
++) {
2188 elem
= PyTuple_GET_ITEM(old_result
, i
);
2190 PyTuple_SET_ITEM(result
, i
, elem
);
2192 Py_DECREF(old_result
);
2194 /* Now, we've got the only copy so we can update it in-place
2195 * CPython's empty tuple is a singleton and cached in
2196 * PyTuple's freelist.
2198 assert(r
== 0 || Py_REFCNT(result
) == 1);
2200 /* Scan indices right-to-left until finding one that is not
2201 at its maximum (i + n - r). */
2202 for (i
=r
-1 ; i
>= 0 && indices
[i
] == i
+n
-r
; i
--)
2205 /* If i is negative, then the indices are all at
2206 their maximum value and we're done. */
2210 /* Increment the current index which we know is not at its
2211 maximum. Then move back to the right setting each index
2212 to its lowest possible value (one higher than the index
2213 to its left -- this maintains the sort order invariant). */
2215 for (j
=i
+1 ; j
<r
; j
++)
2216 indices
[j
] = indices
[j
-1] + 1;
2218 /* Update the result tuple for the new indices
2219 starting with i, the leftmost index that changed */
2220 for ( ; i
<r
; i
++) {
2222 elem
= PyTuple_GET_ITEM(pool
, index
);
2224 oldelem
= PyTuple_GET_ITEM(result
, i
);
2225 PyTuple_SET_ITEM(result
, i
, elem
);
2238 PyDoc_STRVAR(combinations_doc
,
2239 "combinations(iterable, r) --> combinations object\n\
2241 Return successive r-length combinations of elements in the iterable.\n\n\
2242 combinations(range(4), 3) --> (0,1,2), (0,1,3), (0,2,3), (1,2,3)");
2244 static PyTypeObject combinations_type
= {
2245 PyVarObject_HEAD_INIT(NULL
, 0)
2246 "itertools.combinations", /* tp_name */
2247 sizeof(combinationsobject
), /* tp_basicsize */
2248 0, /* tp_itemsize */
2250 (destructor
)combinations_dealloc
, /* tp_dealloc */
2256 0, /* tp_as_number */
2257 0, /* tp_as_sequence */
2258 0, /* tp_as_mapping */
2262 PyObject_GenericGetAttr
, /* tp_getattro */
2263 0, /* tp_setattro */
2264 0, /* tp_as_buffer */
2265 Py_TPFLAGS_DEFAULT
| Py_TPFLAGS_HAVE_GC
|
2266 Py_TPFLAGS_BASETYPE
, /* tp_flags */
2267 combinations_doc
, /* tp_doc */
2268 (traverseproc
)combinations_traverse
, /* tp_traverse */
2270 0, /* tp_richcompare */
2271 0, /* tp_weaklistoffset */
2272 PyObject_SelfIter
, /* tp_iter */
2273 (iternextfunc
)combinations_next
, /* tp_iternext */
2279 0, /* tp_descr_get */
2280 0, /* tp_descr_set */
2281 0, /* tp_dictoffset */
2284 combinations_new
, /* tp_new */
2285 PyObject_GC_Del
, /* tp_free */
2289 /* combinations with replacement object *******************************************/
2293 def combinations_with_replacement(iterable, r):
2294 "combinations_with_replacement('ABC', 2) --> AA AB AC BB BC CC"
2295 # number items returned: (n+r-1)! / r! / (n-1)!
2296 pool = tuple(iterable)
2299 yield tuple(pool[i] for i in indices)
2301 for i in reversed(range(r)):
2302 if indices[i] != n - 1:
2306 indices[i:] = [indices[i] + 1] * (r - i)
2307 yield tuple(pool[i] for i in indices)
2309 def combinations_with_replacement2(iterable, r):
2310 'Alternate version that filters from product()'
2311 pool = tuple(iterable)
2313 for indices in product(range(n), repeat=r):
2314 if sorted(indices) == list(indices):
2315 yield tuple(pool[i] for i in indices)
2319 PyObject
*pool
; /* input converted to a tuple */
2320 Py_ssize_t
*indices
; /* one index per result element */
2321 PyObject
*result
; /* most recently returned result tuple */
2322 Py_ssize_t r
; /* size of result tuple */
2323 int stopped
; /* set to 1 when the cwr iterator is exhausted */
2326 static PyTypeObject cwr_type
;
2329 cwr_new(PyTypeObject
*type
, PyObject
*args
, PyObject
*kwds
)
2334 PyObject
*pool
= NULL
;
2335 PyObject
*iterable
= NULL
;
2336 Py_ssize_t
*indices
= NULL
;
2338 static char *kwargs
[] = {"iterable", "r", NULL
};
2340 if (!PyArg_ParseTupleAndKeywords(args
, kwds
, "On:combinations_with_replacement", kwargs
,
2344 pool
= PySequence_Tuple(iterable
);
2347 n
= PyTuple_GET_SIZE(pool
);
2349 PyErr_SetString(PyExc_ValueError
, "r must be non-negative");
2353 indices
= PyMem_New(Py_ssize_t
, r
);
2354 if (indices
== NULL
) {
2359 for (i
=0 ; i
<r
; i
++)
2362 /* create cwrobject structure */
2363 co
= (cwrobject
*)type
->tp_alloc(type
, 0);
2368 co
->indices
= indices
;
2371 co
->stopped
= !n
&& r
;
2373 return (PyObject
*)co
;
2376 if (indices
!= NULL
)
2377 PyMem_Free(indices
);
2383 cwr_dealloc(cwrobject
*co
)
2385 PyObject_GC_UnTrack(co
);
2386 Py_XDECREF(co
->pool
);
2387 Py_XDECREF(co
->result
);
2388 if (co
->indices
!= NULL
)
2389 PyMem_Free(co
->indices
);
2390 Py_TYPE(co
)->tp_free(co
);
2394 cwr_traverse(cwrobject
*co
, visitproc visit
, void *arg
)
2397 Py_VISIT(co
->result
);
2402 cwr_next(cwrobject
*co
)
2406 PyObject
*pool
= co
->pool
;
2407 Py_ssize_t
*indices
= co
->indices
;
2408 PyObject
*result
= co
->result
;
2409 Py_ssize_t n
= PyTuple_GET_SIZE(pool
);
2410 Py_ssize_t r
= co
->r
;
2411 Py_ssize_t i
, j
, index
;
2416 if (result
== NULL
) {
2417 /* On the first pass, initialize result tuple using the indices */
2418 result
= PyTuple_New(r
);
2421 co
->result
= result
;
2422 for (i
=0; i
<r
; i
++) {
2424 elem
= PyTuple_GET_ITEM(pool
, index
);
2426 PyTuple_SET_ITEM(result
, i
, elem
);
2429 /* Copy the previous result tuple or re-use it if available */
2430 if (Py_REFCNT(result
) > 1) {
2431 PyObject
*old_result
= result
;
2432 result
= PyTuple_New(r
);
2435 co
->result
= result
;
2436 for (i
=0; i
<r
; i
++) {
2437 elem
= PyTuple_GET_ITEM(old_result
, i
);
2439 PyTuple_SET_ITEM(result
, i
, elem
);
2441 Py_DECREF(old_result
);
2443 /* Now, we've got the only copy so we can update it in-place CPython's
2444 empty tuple is a singleton and cached in PyTuple's freelist. */
2445 assert(r
== 0 || Py_REFCNT(result
) == 1);
2447 /* Scan indices right-to-left until finding one that is not
2448 * at its maximum (n-1). */
2449 for (i
=r
-1 ; i
>= 0 && indices
[i
] == n
-1; i
--)
2452 /* If i is negative, then the indices are all at
2453 their maximum value and we're done. */
2457 /* Increment the current index which we know is not at its
2458 maximum. Then set all to the right to the same value. */
2460 for (j
=i
+1 ; j
<r
; j
++)
2461 indices
[j
] = indices
[j
-1];
2463 /* Update the result tuple for the new indices
2464 starting with i, the leftmost index that changed */
2465 for ( ; i
<r
; i
++) {
2467 elem
= PyTuple_GET_ITEM(pool
, index
);
2469 oldelem
= PyTuple_GET_ITEM(result
, i
);
2470 PyTuple_SET_ITEM(result
, i
, elem
);
2483 PyDoc_STRVAR(cwr_doc
,
2484 "combinations_with_replacement(iterable, r) --> combinations_with_replacement object\n\
2486 Return successive r-length combinations of elements in the iterable\n\
2487 allowing individual elements to have successive repeats.\n\
2488 combinations_with_replacement('ABC', 2) --> AA AB AC BB BC CC");
2490 static PyTypeObject cwr_type
= {
2491 PyVarObject_HEAD_INIT(NULL
, 0)
2492 "itertools.combinations_with_replacement", /* tp_name */
2493 sizeof(cwrobject
), /* tp_basicsize */
2494 0, /* tp_itemsize */
2496 (destructor
)cwr_dealloc
, /* tp_dealloc */
2502 0, /* tp_as_number */
2503 0, /* tp_as_sequence */
2504 0, /* tp_as_mapping */
2508 PyObject_GenericGetAttr
, /* tp_getattro */
2509 0, /* tp_setattro */
2510 0, /* tp_as_buffer */
2511 Py_TPFLAGS_DEFAULT
| Py_TPFLAGS_HAVE_GC
|
2512 Py_TPFLAGS_BASETYPE
, /* tp_flags */
2513 cwr_doc
, /* tp_doc */
2514 (traverseproc
)cwr_traverse
, /* tp_traverse */
2516 0, /* tp_richcompare */
2517 0, /* tp_weaklistoffset */
2518 PyObject_SelfIter
, /* tp_iter */
2519 (iternextfunc
)cwr_next
, /* tp_iternext */
2525 0, /* tp_descr_get */
2526 0, /* tp_descr_set */
2527 0, /* tp_dictoffset */
2530 cwr_new
, /* tp_new */
2531 PyObject_GC_Del
, /* tp_free */
2535 /* permutations object ************************************************************
2537 def permutations(iterable, r=None):
2538 'permutations(range(3), 2) --> (0,1) (0,2) (1,0) (1,2) (2,0) (2,1)'
2539 pool = tuple(iterable)
2541 r = n if r is None else r
2543 cycles = range(n-r+1, n+1)[::-1]
2544 yield tuple(pool[i] for i in indices[:r])
2546 for i in reversed(range(r)):
2549 indices[i:] = indices[i+1:] + indices[i:i+1]
2553 indices[i], indices[-j] = indices[-j], indices[i]
2554 yield tuple(pool[i] for i in indices[:r])
2562 PyObject
*pool
; /* input converted to a tuple */
2563 Py_ssize_t
*indices
; /* one index per element in the pool */
2564 Py_ssize_t
*cycles
; /* one rollover counter per element in the result */
2565 PyObject
*result
; /* most recently returned result tuple */
2566 Py_ssize_t r
; /* size of result tuple */
2567 int stopped
; /* set to 1 when the permutations iterator is exhausted */
2568 } permutationsobject
;
2570 static PyTypeObject permutations_type
;
2573 permutations_new(PyTypeObject
*type
, PyObject
*args
, PyObject
*kwds
)
2575 permutationsobject
*po
;
2578 PyObject
*robj
= Py_None
;
2579 PyObject
*pool
= NULL
;
2580 PyObject
*iterable
= NULL
;
2581 Py_ssize_t
*indices
= NULL
;
2582 Py_ssize_t
*cycles
= NULL
;
2584 static char *kwargs
[] = {"iterable", "r", NULL
};
2586 if (!PyArg_ParseTupleAndKeywords(args
, kwds
, "O|O:permutations", kwargs
,
2590 pool
= PySequence_Tuple(iterable
);
2593 n
= PyTuple_GET_SIZE(pool
);
2596 if (robj
!= Py_None
) {
2597 r
= PyInt_AsSsize_t(robj
);
2598 if (r
== -1 && PyErr_Occurred())
2602 PyErr_SetString(PyExc_ValueError
, "r must be non-negative");
2606 indices
= PyMem_New(Py_ssize_t
, n
);
2607 cycles
= PyMem_New(Py_ssize_t
, r
);
2608 if (indices
== NULL
|| cycles
== NULL
) {
2613 for (i
=0 ; i
<n
; i
++)
2615 for (i
=0 ; i
<r
; i
++)
2618 /* create permutationsobject structure */
2619 po
= (permutationsobject
*)type
->tp_alloc(type
, 0);
2624 po
->indices
= indices
;
2625 po
->cycles
= cycles
;
2628 po
->stopped
= r
> n
? 1 : 0;
2630 return (PyObject
*)po
;
2633 if (indices
!= NULL
)
2634 PyMem_Free(indices
);
2642 permutations_dealloc(permutationsobject
*po
)
2644 PyObject_GC_UnTrack(po
);
2645 Py_XDECREF(po
->pool
);
2646 Py_XDECREF(po
->result
);
2647 PyMem_Free(po
->indices
);
2648 PyMem_Free(po
->cycles
);
2649 Py_TYPE(po
)->tp_free(po
);
2653 permutations_traverse(permutationsobject
*po
, visitproc visit
, void *arg
)
2656 Py_VISIT(po
->result
);
2661 permutations_next(permutationsobject
*po
)
2665 PyObject
*pool
= po
->pool
;
2666 Py_ssize_t
*indices
= po
->indices
;
2667 Py_ssize_t
*cycles
= po
->cycles
;
2668 PyObject
*result
= po
->result
;
2669 Py_ssize_t n
= PyTuple_GET_SIZE(pool
);
2670 Py_ssize_t r
= po
->r
;
2671 Py_ssize_t i
, j
, k
, index
;
2676 if (result
== NULL
) {
2677 /* On the first pass, initialize result tuple using the indices */
2678 result
= PyTuple_New(r
);
2681 po
->result
= result
;
2682 for (i
=0; i
<r
; i
++) {
2684 elem
= PyTuple_GET_ITEM(pool
, index
);
2686 PyTuple_SET_ITEM(result
, i
, elem
);
2692 /* Copy the previous result tuple or re-use it if available */
2693 if (Py_REFCNT(result
) > 1) {
2694 PyObject
*old_result
= result
;
2695 result
= PyTuple_New(r
);
2698 po
->result
= result
;
2699 for (i
=0; i
<r
; i
++) {
2700 elem
= PyTuple_GET_ITEM(old_result
, i
);
2702 PyTuple_SET_ITEM(result
, i
, elem
);
2704 Py_DECREF(old_result
);
2706 /* Now, we've got the only copy so we can update it in-place */
2707 assert(r
== 0 || Py_REFCNT(result
) == 1);
2709 /* Decrement rightmost cycle, moving leftward upon zero rollover */
2710 for (i
=r
-1 ; i
>=0 ; i
--) {
2712 if (cycles
[i
] == 0) {
2713 /* rotatation: indices[i:] = indices[i+1:] + indices[i:i+1] */
2715 for (j
=i
; j
<n
-1 ; j
++)
2716 indices
[j
] = indices
[j
+1];
2717 indices
[n
-1] = index
;
2722 indices
[i
] = indices
[n
-j
];
2723 indices
[n
-j
] = index
;
2725 for (k
=i
; k
<r
; k
++) {
2726 /* start with i, the leftmost element that changed */
2727 /* yield tuple(pool[k] for k in indices[:r]) */
2729 elem
= PyTuple_GET_ITEM(pool
, index
);
2731 oldelem
= PyTuple_GET_ITEM(result
, k
);
2732 PyTuple_SET_ITEM(result
, k
, elem
);
2738 /* If i is negative, then the cycles have all
2739 rolled-over and we're done. */
2751 PyDoc_STRVAR(permutations_doc
,
2752 "permutations(iterable[, r]) --> permutations object\n\
2754 Return successive r-length permutations of elements in the iterable.\n\n\
2755 permutations(range(3), 2) --> (0,1), (0,2), (1,0), (1,2), (2,0), (2,1)");
2757 static PyTypeObject permutations_type
= {
2758 PyVarObject_HEAD_INIT(NULL
, 0)
2759 "itertools.permutations", /* tp_name */
2760 sizeof(permutationsobject
), /* tp_basicsize */
2761 0, /* tp_itemsize */
2763 (destructor
)permutations_dealloc
, /* tp_dealloc */
2769 0, /* tp_as_number */
2770 0, /* tp_as_sequence */
2771 0, /* tp_as_mapping */
2775 PyObject_GenericGetAttr
, /* tp_getattro */
2776 0, /* tp_setattro */
2777 0, /* tp_as_buffer */
2778 Py_TPFLAGS_DEFAULT
| Py_TPFLAGS_HAVE_GC
|
2779 Py_TPFLAGS_BASETYPE
, /* tp_flags */
2780 permutations_doc
, /* tp_doc */
2781 (traverseproc
)permutations_traverse
, /* tp_traverse */
2783 0, /* tp_richcompare */
2784 0, /* tp_weaklistoffset */
2785 PyObject_SelfIter
, /* tp_iter */
2786 (iternextfunc
)permutations_next
, /* tp_iternext */
2792 0, /* tp_descr_get */
2793 0, /* tp_descr_set */
2794 0, /* tp_dictoffset */
2797 permutations_new
, /* tp_new */
2798 PyObject_GC_Del
, /* tp_free */
2802 /* compress object ************************************************************/
2806 def compress(data, selectors):
2807 "compress('ABCDEF', [1,0,1,0,1,1]) --> A C E F"
2808 return (d for d, s in izip(data, selectors) if s)
2814 PyObject
*selectors
;
2817 static PyTypeObject compress_type
;
2820 compress_new(PyTypeObject
*type
, PyObject
*args
, PyObject
*kwds
)
2822 PyObject
*seq1
, *seq2
;
2823 PyObject
*data
=NULL
, *selectors
=NULL
;
2825 static char *kwargs
[] = {"data", "selectors", NULL
};
2827 if (!PyArg_ParseTupleAndKeywords(args
, kwds
, "OO:compress", kwargs
, &seq1
, &seq2
))
2830 data
= PyObject_GetIter(seq1
);
2833 selectors
= PyObject_GetIter(seq2
);
2834 if (selectors
== NULL
)
2837 /* create compressobject structure */
2838 lz
= (compressobject
*)type
->tp_alloc(type
, 0);
2842 lz
->selectors
= selectors
;
2843 return (PyObject
*)lz
;
2847 Py_XDECREF(selectors
);
2852 compress_dealloc(compressobject
*lz
)
2854 PyObject_GC_UnTrack(lz
);
2855 Py_XDECREF(lz
->data
);
2856 Py_XDECREF(lz
->selectors
);
2857 Py_TYPE(lz
)->tp_free(lz
);
2861 compress_traverse(compressobject
*lz
, visitproc visit
, void *arg
)
2864 Py_VISIT(lz
->selectors
);
2869 compress_next(compressobject
*lz
)
2871 PyObject
*data
= lz
->data
, *selectors
= lz
->selectors
;
2872 PyObject
*datum
, *selector
;
2873 PyObject
*(*datanext
)(PyObject
*) = *Py_TYPE(data
)->tp_iternext
;
2874 PyObject
*(*selectornext
)(PyObject
*) = *Py_TYPE(selectors
)->tp_iternext
;
2878 /* Steps: get datum, get selector, evaluate selector.
2879 Order is important (to match the pure python version
2880 in terms of which input gets a chance to raise an
2884 datum
= datanext(data
);
2888 selector
= selectornext(selectors
);
2889 if (selector
== NULL
) {
2894 ok
= PyObject_IsTrue(selector
);
2895 Py_DECREF(selector
);
2904 PyDoc_STRVAR(compress_doc
,
2905 "compress(data, selectors) --> iterator over selected data\n\
2907 Return data elements corresponding to true selector elements.\n\
2908 Forms a shorter iterator from selected data elements using the\n\
2909 selectors to choose the data elements.");
2911 static PyTypeObject compress_type
= {
2912 PyVarObject_HEAD_INIT(NULL
, 0)
2913 "itertools.compress", /* tp_name */
2914 sizeof(compressobject
), /* tp_basicsize */
2915 0, /* tp_itemsize */
2917 (destructor
)compress_dealloc
, /* tp_dealloc */
2923 0, /* tp_as_number */
2924 0, /* tp_as_sequence */
2925 0, /* tp_as_mapping */
2929 PyObject_GenericGetAttr
, /* tp_getattro */
2930 0, /* tp_setattro */
2931 0, /* tp_as_buffer */
2932 Py_TPFLAGS_DEFAULT
| Py_TPFLAGS_HAVE_GC
|
2933 Py_TPFLAGS_BASETYPE
, /* tp_flags */
2934 compress_doc
, /* tp_doc */
2935 (traverseproc
)compress_traverse
, /* tp_traverse */
2937 0, /* tp_richcompare */
2938 0, /* tp_weaklistoffset */
2939 PyObject_SelfIter
, /* tp_iter */
2940 (iternextfunc
)compress_next
, /* tp_iternext */
2946 0, /* tp_descr_get */
2947 0, /* tp_descr_set */
2948 0, /* tp_dictoffset */
2951 compress_new
, /* tp_new */
2952 PyObject_GC_Del
, /* tp_free */
2956 /* ifilter object ************************************************************/
2964 static PyTypeObject ifilter_type
;
2967 ifilter_new(PyTypeObject
*type
, PyObject
*args
, PyObject
*kwds
)
2969 PyObject
*func
, *seq
;
2973 if (type
== &ifilter_type
&& !_PyArg_NoKeywords("ifilter()", kwds
))
2976 if (!PyArg_UnpackTuple(args
, "ifilter", 2, 2, &func
, &seq
))
2980 it
= PyObject_GetIter(seq
);
2984 /* create ifilterobject structure */
2985 lz
= (ifilterobject
*)type
->tp_alloc(type
, 0);
2994 return (PyObject
*)lz
;
2998 ifilter_dealloc(ifilterobject
*lz
)
3000 PyObject_GC_UnTrack(lz
);
3001 Py_XDECREF(lz
->func
);
3003 Py_TYPE(lz
)->tp_free(lz
);
3007 ifilter_traverse(ifilterobject
*lz
, visitproc visit
, void *arg
)
3015 ifilter_next(ifilterobject
*lz
)
3018 PyObject
*it
= lz
->it
;
3020 PyObject
*(*iternext
)(PyObject
*);
3022 iternext
= *Py_TYPE(it
)->tp_iternext
;
3024 item
= iternext(it
);
3028 if (lz
->func
== Py_None
|| lz
->func
== (PyObject
*)&PyBool_Type
) {
3029 ok
= PyObject_IsTrue(item
);
3032 good
= PyObject_CallFunctionObjArgs(lz
->func
,
3038 ok
= PyObject_IsTrue(good
);
3049 PyDoc_STRVAR(ifilter_doc
,
3050 "ifilter(function or None, sequence) --> ifilter object\n\
3052 Return those items of sequence for which function(item) is true.\n\
3053 If function is None, return the items that are true.");
3055 static PyTypeObject ifilter_type
= {
3056 PyVarObject_HEAD_INIT(NULL
, 0)
3057 "itertools.ifilter", /* tp_name */
3058 sizeof(ifilterobject
), /* tp_basicsize */
3059 0, /* tp_itemsize */
3061 (destructor
)ifilter_dealloc
, /* tp_dealloc */
3067 0, /* tp_as_number */
3068 0, /* tp_as_sequence */
3069 0, /* tp_as_mapping */
3073 PyObject_GenericGetAttr
, /* tp_getattro */
3074 0, /* tp_setattro */
3075 0, /* tp_as_buffer */
3076 Py_TPFLAGS_DEFAULT
| Py_TPFLAGS_HAVE_GC
|
3077 Py_TPFLAGS_BASETYPE
, /* tp_flags */
3078 ifilter_doc
, /* tp_doc */
3079 (traverseproc
)ifilter_traverse
, /* tp_traverse */
3081 0, /* tp_richcompare */
3082 0, /* tp_weaklistoffset */
3083 PyObject_SelfIter
, /* tp_iter */
3084 (iternextfunc
)ifilter_next
, /* tp_iternext */
3090 0, /* tp_descr_get */
3091 0, /* tp_descr_set */
3092 0, /* tp_dictoffset */
3095 ifilter_new
, /* tp_new */
3096 PyObject_GC_Del
, /* tp_free */
3100 /* ifilterfalse object ************************************************************/
3106 } ifilterfalseobject
;
3108 static PyTypeObject ifilterfalse_type
;
3111 ifilterfalse_new(PyTypeObject
*type
, PyObject
*args
, PyObject
*kwds
)
3113 PyObject
*func
, *seq
;
3115 ifilterfalseobject
*lz
;
3117 if (type
== &ifilterfalse_type
&&
3118 !_PyArg_NoKeywords("ifilterfalse()", kwds
))
3121 if (!PyArg_UnpackTuple(args
, "ifilterfalse", 2, 2, &func
, &seq
))
3125 it
= PyObject_GetIter(seq
);
3129 /* create ifilterfalseobject structure */
3130 lz
= (ifilterfalseobject
*)type
->tp_alloc(type
, 0);
3139 return (PyObject
*)lz
;
3143 ifilterfalse_dealloc(ifilterfalseobject
*lz
)
3145 PyObject_GC_UnTrack(lz
);
3146 Py_XDECREF(lz
->func
);
3148 Py_TYPE(lz
)->tp_free(lz
);
3152 ifilterfalse_traverse(ifilterfalseobject
*lz
, visitproc visit
, void *arg
)
3160 ifilterfalse_next(ifilterfalseobject
*lz
)
3163 PyObject
*it
= lz
->it
;
3165 PyObject
*(*iternext
)(PyObject
*);
3167 iternext
= *Py_TYPE(it
)->tp_iternext
;
3169 item
= iternext(it
);
3173 if (lz
->func
== Py_None
|| lz
->func
== (PyObject
*)&PyBool_Type
) {
3174 ok
= PyObject_IsTrue(item
);
3177 good
= PyObject_CallFunctionObjArgs(lz
->func
,
3183 ok
= PyObject_IsTrue(good
);
3194 PyDoc_STRVAR(ifilterfalse_doc
,
3195 "ifilterfalse(function or None, sequence) --> ifilterfalse object\n\
3197 Return those items of sequence for which function(item) is false.\n\
3198 If function is None, return the items that are false.");
3200 static PyTypeObject ifilterfalse_type
= {
3201 PyVarObject_HEAD_INIT(NULL
, 0)
3202 "itertools.ifilterfalse", /* tp_name */
3203 sizeof(ifilterfalseobject
), /* tp_basicsize */
3204 0, /* tp_itemsize */
3206 (destructor
)ifilterfalse_dealloc
, /* tp_dealloc */
3212 0, /* tp_as_number */
3213 0, /* tp_as_sequence */
3214 0, /* tp_as_mapping */
3218 PyObject_GenericGetAttr
, /* tp_getattro */
3219 0, /* tp_setattro */
3220 0, /* tp_as_buffer */
3221 Py_TPFLAGS_DEFAULT
| Py_TPFLAGS_HAVE_GC
|
3222 Py_TPFLAGS_BASETYPE
, /* tp_flags */
3223 ifilterfalse_doc
, /* tp_doc */
3224 (traverseproc
)ifilterfalse_traverse
, /* tp_traverse */
3226 0, /* tp_richcompare */
3227 0, /* tp_weaklistoffset */
3228 PyObject_SelfIter
, /* tp_iter */
3229 (iternextfunc
)ifilterfalse_next
, /* tp_iternext */
3235 0, /* tp_descr_get */
3236 0, /* tp_descr_set */
3237 0, /* tp_dictoffset */
3240 ifilterfalse_new
, /* tp_new */
3241 PyObject_GC_Del
, /* tp_free */
3245 /* count object ************************************************************/
3251 PyObject
*long_step
;
3254 /* Counting logic and invariants:
3256 fast_mode: when cnt an integer < PY_SSIZE_T_MAX and no step is specified.
3258 assert(cnt != PY_SSIZE_T_MAX && long_cnt == NULL && long_step==PyInt(1));
3259 Advances with: cnt += 1
3260 When count hits Y_SSIZE_T_MAX, switch to slow_mode.
3262 slow_mode: when cnt == PY_SSIZE_T_MAX, step is not int(1), or cnt is a float.
3264 assert(cnt == PY_SSIZE_T_MAX && long_cnt != NULL && long_step != NULL);
3265 All counting is done with python objects (no overflows or underflows).
3266 Advances with: long_cnt += long_step
3267 Step may be zero -- effectively a slow version of repeat(cnt).
3268 Either long_cnt or long_step may be a float, Fraction, or Decimal.
3271 static PyTypeObject count_type
;
3274 count_new(PyTypeObject
*type
, PyObject
*args
, PyObject
*kwds
)
3279 PyObject
*long_cnt
= NULL
;
3280 PyObject
*long_step
= NULL
;
3281 static char *kwlist
[] = {"start", "step", 0};
3283 if (!PyArg_ParseTupleAndKeywords(args
, kwds
, "|OO:count",
3284 kwlist
, &long_cnt
, &long_step
))
3287 if ((long_cnt
!= NULL
&& !PyNumber_Check(long_cnt
)) ||
3288 (long_step
!= NULL
&& !PyNumber_Check(long_step
))) {
3289 PyErr_SetString(PyExc_TypeError
, "a number is required");
3293 if (long_cnt
!= NULL
) {
3294 cnt
= PyInt_AsSsize_t(long_cnt
);
3295 if ((cnt
== -1 && PyErr_Occurred()) || !PyInt_Check(long_cnt
)) {
3299 Py_INCREF(long_cnt
);
3302 long_cnt
= PyInt_FromLong(0);
3305 /* If not specified, step defaults to 1 */
3306 if (long_step
== NULL
) {
3307 long_step
= PyInt_FromLong(1);
3308 if (long_step
== NULL
) {
3309 Py_DECREF(long_cnt
);
3313 Py_INCREF(long_step
);
3315 assert(long_cnt
!= NULL
&& long_step
!= NULL
);
3317 /* Fast mode only works when the step is 1 */
3318 if (!PyInt_Check(long_step
) ||
3319 PyInt_AS_LONG(long_step
) != 1) {
3324 cnt
= PY_SSIZE_T_MAX
;
3328 assert((cnt
!= PY_SSIZE_T_MAX
&& long_cnt
== NULL
&& !slow_mode
) ||
3329 (cnt
== PY_SSIZE_T_MAX
&& long_cnt
!= NULL
&& slow_mode
));
3331 (PyInt_Check(long_step
) && PyInt_AS_LONG(long_step
) == 1));
3333 /* create countobject structure */
3334 lz
= (countobject
*)type
->tp_alloc(type
, 0);
3336 Py_XDECREF(long_cnt
);
3340 lz
->long_cnt
= long_cnt
;
3341 lz
->long_step
= long_step
;
3343 return (PyObject
*)lz
;
3347 count_dealloc(countobject
*lz
)
3349 PyObject_GC_UnTrack(lz
);
3350 Py_XDECREF(lz
->long_cnt
);
3351 Py_XDECREF(lz
->long_step
);
3352 Py_TYPE(lz
)->tp_free(lz
);
3356 count_traverse(countobject
*lz
, visitproc visit
, void *arg
)
3358 Py_VISIT(lz
->long_cnt
);
3359 Py_VISIT(lz
->long_step
);
3364 count_nextlong(countobject
*lz
)
3367 PyObject
*stepped_up
;
3369 long_cnt
= lz
->long_cnt
;
3370 if (long_cnt
== NULL
) {
3371 /* Switch to slow_mode */
3372 long_cnt
= PyInt_FromSsize_t(PY_SSIZE_T_MAX
);
3373 if (long_cnt
== NULL
)
3376 assert(lz
->cnt
== PY_SSIZE_T_MAX
&& long_cnt
!= NULL
);
3378 stepped_up
= PyNumber_Add(long_cnt
, lz
->long_step
);
3379 if (stepped_up
== NULL
)
3381 lz
->long_cnt
= stepped_up
;
3386 count_next(countobject
*lz
)
3388 if (lz
->cnt
== PY_SSIZE_T_MAX
)
3389 return count_nextlong(lz
);
3390 return PyInt_FromSsize_t(lz
->cnt
++);
3394 count_repr(countobject
*lz
)
3396 PyObject
*cnt_repr
, *step_repr
= NULL
;
3397 PyObject
*result
= NULL
;
3399 if (lz
->cnt
!= PY_SSIZE_T_MAX
)
3400 return PyString_FromFormat("count(%zd)", lz
->cnt
);
3402 cnt_repr
= PyObject_Repr(lz
->long_cnt
);
3403 if (cnt_repr
== NULL
)
3406 if (PyInt_Check(lz
->long_step
) && PyInt_AS_LONG(lz
->long_step
) == 1) {
3407 /* Don't display step when it is an integer equal to 1 */
3408 result
= PyString_FromFormat("count(%s)",
3409 PyString_AS_STRING(cnt_repr
));
3411 step_repr
= PyObject_Repr(lz
->long_step
);
3412 if (step_repr
!= NULL
)
3413 result
= PyString_FromFormat("count(%s, %s)",
3414 PyString_AS_STRING(cnt_repr
),
3415 PyString_AS_STRING(step_repr
));
3417 Py_DECREF(cnt_repr
);
3418 Py_XDECREF(step_repr
);
3423 count_reduce(countobject
*lz
)
3425 if (lz
->cnt
== PY_SSIZE_T_MAX
)
3426 return Py_BuildValue("O(OO)", Py_TYPE(lz
), lz
->long_cnt
, lz
->long_step
);
3427 return Py_BuildValue("O(n)", Py_TYPE(lz
), lz
->cnt
);
3430 PyDoc_STRVAR(count_reduce_doc
, "Return state information for pickling.");
3432 static PyMethodDef count_methods
[] = {
3433 {"__reduce__", (PyCFunction
)count_reduce
, METH_NOARGS
,
3435 {NULL
, NULL
} /* sentinel */
3438 PyDoc_STRVAR(count_doc
,
3439 "count(start=0, step=1) --> count object\n\
3441 Return a count object whose .next() method returns consecutive values.\n\
3443 def count(firstval=0, step=1):\n\
3449 static PyTypeObject count_type
= {
3450 PyVarObject_HEAD_INIT(NULL
, 0)
3451 "itertools.count", /* tp_name */
3452 sizeof(countobject
), /* tp_basicsize */
3453 0, /* tp_itemsize */
3455 (destructor
)count_dealloc
, /* tp_dealloc */
3460 (reprfunc
)count_repr
, /* tp_repr */
3461 0, /* tp_as_number */
3462 0, /* tp_as_sequence */
3463 0, /* tp_as_mapping */
3467 PyObject_GenericGetAttr
, /* tp_getattro */
3468 0, /* tp_setattro */
3469 0, /* tp_as_buffer */
3470 Py_TPFLAGS_DEFAULT
| Py_TPFLAGS_HAVE_GC
|
3471 Py_TPFLAGS_BASETYPE
, /* tp_flags */
3472 count_doc
, /* tp_doc */
3473 (traverseproc
)count_traverse
, /* tp_traverse */
3475 0, /* tp_richcompare */
3476 0, /* tp_weaklistoffset */
3477 PyObject_SelfIter
, /* tp_iter */
3478 (iternextfunc
)count_next
, /* tp_iternext */
3479 count_methods
, /* tp_methods */
3484 0, /* tp_descr_get */
3485 0, /* tp_descr_set */
3486 0, /* tp_dictoffset */
3489 count_new
, /* tp_new */
3490 PyObject_GC_Del
, /* tp_free */
3494 /* izip object ************************************************************/
3500 Py_ssize_t tuplesize
;
3501 PyObject
*ittuple
; /* tuple of iterators */
3505 static PyTypeObject izip_type
;
3508 izip_new(PyTypeObject
*type
, PyObject
*args
, PyObject
*kwds
)
3512 PyObject
*ittuple
; /* tuple of iterators */
3514 Py_ssize_t tuplesize
= PySequence_Length(args
);
3516 if (type
== &izip_type
&& !_PyArg_NoKeywords("izip()", kwds
))
3519 /* args must be a tuple */
3520 assert(PyTuple_Check(args
));
3522 /* obtain iterators */
3523 ittuple
= PyTuple_New(tuplesize
);
3524 if (ittuple
== NULL
)
3526 for (i
=0; i
< tuplesize
; ++i
) {
3527 PyObject
*item
= PyTuple_GET_ITEM(args
, i
);
3528 PyObject
*it
= PyObject_GetIter(item
);
3530 if (PyErr_ExceptionMatches(PyExc_TypeError
))
3531 PyErr_Format(PyExc_TypeError
,
3532 "izip argument #%zd must support iteration",
3537 PyTuple_SET_ITEM(ittuple
, i
, it
);
3540 /* create a result holder */
3541 result
= PyTuple_New(tuplesize
);
3542 if (result
== NULL
) {
3546 for (i
=0 ; i
< tuplesize
; i
++) {
3548 PyTuple_SET_ITEM(result
, i
, Py_None
);
3551 /* create izipobject structure */
3552 lz
= (izipobject
*)type
->tp_alloc(type
, 0);
3558 lz
->ittuple
= ittuple
;
3559 lz
->tuplesize
= tuplesize
;
3560 lz
->result
= result
;
3562 return (PyObject
*)lz
;
3566 izip_dealloc(izipobject
*lz
)
3568 PyObject_GC_UnTrack(lz
);
3569 Py_XDECREF(lz
->ittuple
);
3570 Py_XDECREF(lz
->result
);
3571 Py_TYPE(lz
)->tp_free(lz
);
3575 izip_traverse(izipobject
*lz
, visitproc visit
, void *arg
)
3577 Py_VISIT(lz
->ittuple
);
3578 Py_VISIT(lz
->result
);
3583 izip_next(izipobject
*lz
)
3586 Py_ssize_t tuplesize
= lz
->tuplesize
;
3587 PyObject
*result
= lz
->result
;
3594 if (Py_REFCNT(result
) == 1) {
3596 for (i
=0 ; i
< tuplesize
; i
++) {
3597 it
= PyTuple_GET_ITEM(lz
->ittuple
, i
);
3598 item
= (*Py_TYPE(it
)->tp_iternext
)(it
);
3603 olditem
= PyTuple_GET_ITEM(result
, i
);
3604 PyTuple_SET_ITEM(result
, i
, item
);
3608 result
= PyTuple_New(tuplesize
);
3611 for (i
=0 ; i
< tuplesize
; i
++) {
3612 it
= PyTuple_GET_ITEM(lz
->ittuple
, i
);
3613 item
= (*Py_TYPE(it
)->tp_iternext
)(it
);
3618 PyTuple_SET_ITEM(result
, i
, item
);
3624 PyDoc_STRVAR(izip_doc
,
3625 "izip(iter1 [,iter2 [...]]) --> izip object\n\
3627 Return a izip object whose .next() method returns a tuple where\n\
3628 the i-th element comes from the i-th iterable argument. The .next()\n\
3629 method continues until the shortest iterable in the argument sequence\n\
3630 is exhausted and then it raises StopIteration. Works like the zip()\n\
3631 function but consumes less memory by returning an iterator instead of\n\
3634 static PyTypeObject izip_type
= {
3635 PyVarObject_HEAD_INIT(NULL
, 0)
3636 "itertools.izip", /* tp_name */
3637 sizeof(izipobject
), /* tp_basicsize */
3638 0, /* tp_itemsize */
3640 (destructor
)izip_dealloc
, /* tp_dealloc */
3646 0, /* tp_as_number */
3647 0, /* tp_as_sequence */
3648 0, /* tp_as_mapping */
3652 PyObject_GenericGetAttr
, /* tp_getattro */
3653 0, /* tp_setattro */
3654 0, /* tp_as_buffer */
3655 Py_TPFLAGS_DEFAULT
| Py_TPFLAGS_HAVE_GC
|
3656 Py_TPFLAGS_BASETYPE
, /* tp_flags */
3657 izip_doc
, /* tp_doc */
3658 (traverseproc
)izip_traverse
, /* tp_traverse */
3660 0, /* tp_richcompare */
3661 0, /* tp_weaklistoffset */
3662 PyObject_SelfIter
, /* tp_iter */
3663 (iternextfunc
)izip_next
, /* tp_iternext */
3669 0, /* tp_descr_get */
3670 0, /* tp_descr_set */
3671 0, /* tp_dictoffset */
3674 izip_new
, /* tp_new */
3675 PyObject_GC_Del
, /* tp_free */
3679 /* repeat object ************************************************************/
3687 static PyTypeObject repeat_type
;
3690 repeat_new(PyTypeObject
*type
, PyObject
*args
, PyObject
*kwds
)
3694 Py_ssize_t cnt
= -1, n_kwds
= 0;
3695 static char *kwargs
[] = {"object", "times", NULL
};
3697 if (!PyArg_ParseTupleAndKeywords(args
, kwds
, "O|n:repeat", kwargs
,
3702 n_kwds
= PyDict_Size(kwds
);
3703 /* Does user supply times argument? */
3704 if ((PyTuple_Size(args
) + n_kwds
== 2) && cnt
< 0)
3707 ro
= (repeatobject
*)type
->tp_alloc(type
, 0);
3711 ro
->element
= element
;
3713 return (PyObject
*)ro
;
3717 repeat_dealloc(repeatobject
*ro
)
3719 PyObject_GC_UnTrack(ro
);
3720 Py_XDECREF(ro
->element
);
3721 Py_TYPE(ro
)->tp_free(ro
);
3725 repeat_traverse(repeatobject
*ro
, visitproc visit
, void *arg
)
3727 Py_VISIT(ro
->element
);
3732 repeat_next(repeatobject
*ro
)
3738 Py_INCREF(ro
->element
);
3743 repeat_repr(repeatobject
*ro
)
3745 PyObject
*result
, *objrepr
;
3747 objrepr
= PyObject_Repr(ro
->element
);
3748 if (objrepr
== NULL
)
3752 result
= PyString_FromFormat("repeat(%s)",
3753 PyString_AS_STRING(objrepr
));
3755 result
= PyString_FromFormat("repeat(%s, %zd)",
3756 PyString_AS_STRING(objrepr
), ro
->cnt
);
3762 repeat_len(repeatobject
*ro
)
3764 if (ro
->cnt
== -1) {
3765 PyErr_SetString(PyExc_TypeError
, "len() of unsized object");
3768 return PyInt_FromSize_t(ro
->cnt
);
3771 PyDoc_STRVAR(length_hint_doc
, "Private method returning an estimate of len(list(it)).");
3773 static PyMethodDef repeat_methods
[] = {
3774 {"__length_hint__", (PyCFunction
)repeat_len
, METH_NOARGS
, length_hint_doc
},
3775 {NULL
, NULL
} /* sentinel */
3778 PyDoc_STRVAR(repeat_doc
,
3779 "repeat(object [,times]) -> create an iterator which returns the object\n\
3780 for the specified number of times. If not specified, returns the object\n\
3783 static PyTypeObject repeat_type
= {
3784 PyVarObject_HEAD_INIT(NULL
, 0)
3785 "itertools.repeat", /* tp_name */
3786 sizeof(repeatobject
), /* tp_basicsize */
3787 0, /* tp_itemsize */
3789 (destructor
)repeat_dealloc
, /* tp_dealloc */
3794 (reprfunc
)repeat_repr
, /* tp_repr */
3795 0, /* tp_as_number */
3796 0, /* tp_as_sequence */
3797 0, /* tp_as_mapping */
3801 PyObject_GenericGetAttr
, /* tp_getattro */
3802 0, /* tp_setattro */
3803 0, /* tp_as_buffer */
3804 Py_TPFLAGS_DEFAULT
| Py_TPFLAGS_HAVE_GC
|
3805 Py_TPFLAGS_BASETYPE
, /* tp_flags */
3806 repeat_doc
, /* tp_doc */
3807 (traverseproc
)repeat_traverse
, /* tp_traverse */
3809 0, /* tp_richcompare */
3810 0, /* tp_weaklistoffset */
3811 PyObject_SelfIter
, /* tp_iter */
3812 (iternextfunc
)repeat_next
, /* tp_iternext */
3813 repeat_methods
, /* tp_methods */
3818 0, /* tp_descr_get */
3819 0, /* tp_descr_set */
3820 0, /* tp_dictoffset */
3823 repeat_new
, /* tp_new */
3824 PyObject_GC_Del
, /* tp_free */
3827 /* iziplongest object ************************************************************/
3833 Py_ssize_t tuplesize
;
3834 Py_ssize_t numactive
;
3835 PyObject
*ittuple
; /* tuple of iterators */
3837 PyObject
*fillvalue
;
3838 } iziplongestobject
;
3840 static PyTypeObject iziplongest_type
;
3843 izip_longest_new(PyTypeObject
*type
, PyObject
*args
, PyObject
*kwds
)
3845 iziplongestobject
*lz
;
3847 PyObject
*ittuple
; /* tuple of iterators */
3849 PyObject
*fillvalue
= Py_None
;
3850 Py_ssize_t tuplesize
= PySequence_Length(args
);
3852 if (kwds
!= NULL
&& PyDict_CheckExact(kwds
) && PyDict_Size(kwds
) > 0) {
3853 fillvalue
= PyDict_GetItemString(kwds
, "fillvalue");
3854 if (fillvalue
== NULL
|| PyDict_Size(kwds
) > 1) {
3855 PyErr_SetString(PyExc_TypeError
,
3856 "izip_longest() got an unexpected keyword argument");
3861 /* args must be a tuple */
3862 assert(PyTuple_Check(args
));
3864 /* obtain iterators */
3865 ittuple
= PyTuple_New(tuplesize
);
3866 if (ittuple
== NULL
)
3868 for (i
=0; i
< tuplesize
; ++i
) {
3869 PyObject
*item
= PyTuple_GET_ITEM(args
, i
);
3870 PyObject
*it
= PyObject_GetIter(item
);
3872 if (PyErr_ExceptionMatches(PyExc_TypeError
))
3873 PyErr_Format(PyExc_TypeError
,
3874 "izip_longest argument #%zd must support iteration",
3879 PyTuple_SET_ITEM(ittuple
, i
, it
);
3882 /* create a result holder */
3883 result
= PyTuple_New(tuplesize
);
3884 if (result
== NULL
) {
3888 for (i
=0 ; i
< tuplesize
; i
++) {
3890 PyTuple_SET_ITEM(result
, i
, Py_None
);
3893 /* create iziplongestobject structure */
3894 lz
= (iziplongestobject
*)type
->tp_alloc(type
, 0);
3900 lz
->ittuple
= ittuple
;
3901 lz
->tuplesize
= tuplesize
;
3902 lz
->numactive
= tuplesize
;
3903 lz
->result
= result
;
3904 Py_INCREF(fillvalue
);
3905 lz
->fillvalue
= fillvalue
;
3906 return (PyObject
*)lz
;
3910 izip_longest_dealloc(iziplongestobject
*lz
)
3912 PyObject_GC_UnTrack(lz
);
3913 Py_XDECREF(lz
->ittuple
);
3914 Py_XDECREF(lz
->result
);
3915 Py_XDECREF(lz
->fillvalue
);
3916 Py_TYPE(lz
)->tp_free(lz
);
3920 izip_longest_traverse(iziplongestobject
*lz
, visitproc visit
, void *arg
)
3922 Py_VISIT(lz
->ittuple
);
3923 Py_VISIT(lz
->result
);
3924 Py_VISIT(lz
->fillvalue
);
3929 izip_longest_next(iziplongestobject
*lz
)
3932 Py_ssize_t tuplesize
= lz
->tuplesize
;
3933 PyObject
*result
= lz
->result
;
3940 if (lz
->numactive
== 0)
3942 if (Py_REFCNT(result
) == 1) {
3944 for (i
=0 ; i
< tuplesize
; i
++) {
3945 it
= PyTuple_GET_ITEM(lz
->ittuple
, i
);
3947 Py_INCREF(lz
->fillvalue
);
3948 item
= lz
->fillvalue
;
3950 item
= PyIter_Next(it
);
3953 if (lz
->numactive
== 0 || PyErr_Occurred()) {
3958 Py_INCREF(lz
->fillvalue
);
3959 item
= lz
->fillvalue
;
3960 PyTuple_SET_ITEM(lz
->ittuple
, i
, NULL
);
3965 olditem
= PyTuple_GET_ITEM(result
, i
);
3966 PyTuple_SET_ITEM(result
, i
, item
);
3970 result
= PyTuple_New(tuplesize
);
3973 for (i
=0 ; i
< tuplesize
; i
++) {
3974 it
= PyTuple_GET_ITEM(lz
->ittuple
, i
);
3976 Py_INCREF(lz
->fillvalue
);
3977 item
= lz
->fillvalue
;
3979 item
= PyIter_Next(it
);
3982 if (lz
->numactive
== 0 || PyErr_Occurred()) {
3987 Py_INCREF(lz
->fillvalue
);
3988 item
= lz
->fillvalue
;
3989 PyTuple_SET_ITEM(lz
->ittuple
, i
, NULL
);
3994 PyTuple_SET_ITEM(result
, i
, item
);
4000 PyDoc_STRVAR(izip_longest_doc
,
4001 "izip_longest(iter1 [,iter2 [...]], [fillvalue=None]) --> izip_longest object\n\
4003 Return an izip_longest object whose .next() method returns a tuple where\n\
4004 the i-th element comes from the i-th iterable argument. The .next()\n\
4005 method continues until the longest iterable in the argument sequence\n\
4006 is exhausted and then it raises StopIteration. When the shorter iterables\n\
4007 are exhausted, the fillvalue is substituted in their place. The fillvalue\n\
4008 defaults to None or can be specified by a keyword argument.\n\
4011 static PyTypeObject iziplongest_type
= {
4012 PyVarObject_HEAD_INIT(NULL
, 0)
4013 "itertools.izip_longest", /* tp_name */
4014 sizeof(iziplongestobject
), /* tp_basicsize */
4015 0, /* tp_itemsize */
4017 (destructor
)izip_longest_dealloc
, /* tp_dealloc */
4023 0, /* tp_as_number */
4024 0, /* tp_as_sequence */
4025 0, /* tp_as_mapping */
4029 PyObject_GenericGetAttr
, /* tp_getattro */
4030 0, /* tp_setattro */
4031 0, /* tp_as_buffer */
4032 Py_TPFLAGS_DEFAULT
| Py_TPFLAGS_HAVE_GC
|
4033 Py_TPFLAGS_BASETYPE
, /* tp_flags */
4034 izip_longest_doc
, /* tp_doc */
4035 (traverseproc
)izip_longest_traverse
, /* tp_traverse */
4037 0, /* tp_richcompare */
4038 0, /* tp_weaklistoffset */
4039 PyObject_SelfIter
, /* tp_iter */
4040 (iternextfunc
)izip_longest_next
, /* tp_iternext */
4046 0, /* tp_descr_get */
4047 0, /* tp_descr_set */
4048 0, /* tp_dictoffset */
4051 izip_longest_new
, /* tp_new */
4052 PyObject_GC_Del
, /* tp_free */
4055 /* module level code ********************************************************/
4057 PyDoc_STRVAR(module_doc
,
4058 "Functional tools for creating and using iterators.\n\
4060 Infinite iterators:\n\
4061 count([n]) --> n, n+1, n+2, ...\n\
4062 cycle(p) --> p0, p1, ... plast, p0, p1, ...\n\
4063 repeat(elem [,n]) --> elem, elem, elem, ... endlessly or up to n times\n\
4065 Iterators terminating on the shortest input sequence:\n\
4066 chain(p, q, ...) --> p0, p1, ... plast, q0, q1, ... \n\
4067 compress(data, selectors) --> (d[0] if s[0]), (d[1] if s[1]), ...\n\
4068 dropwhile(pred, seq) --> seq[n], seq[n+1], starting when pred fails\n\
4069 groupby(iterable[, keyfunc]) --> sub-iterators grouped by value of keyfunc(v)\n\
4070 ifilter(pred, seq) --> elements of seq where pred(elem) is True\n\
4071 ifilterfalse(pred, seq) --> elements of seq where pred(elem) is False\n\
4072 islice(seq, [start,] stop [, step]) --> elements from\n\
4073 seq[start:stop:step]\n\
4074 imap(fun, p, q, ...) --> fun(p0, q0), fun(p1, q1), ...\n\
4075 starmap(fun, seq) --> fun(*seq[0]), fun(*seq[1]), ...\n\
4076 tee(it, n=2) --> (it1, it2 , ... itn) splits one iterator into n\n\
4077 takewhile(pred, seq) --> seq[0], seq[1], until pred fails\n\
4078 izip(p, q, ...) --> (p[0], q[0]), (p[1], q[1]), ... \n\
4079 izip_longest(p, q, ...) --> (p[0], q[0]), (p[1], q[1]), ... \n\
4081 Combinatoric generators:\n\
4082 product(p, q, ... [repeat=1]) --> cartesian product\n\
4083 permutations(p[, r])\n\
4084 combinations(p, r)\n\
4085 combinations_with_replacement(p, r)\n\
4089 static PyMethodDef module_methods
[] = {
4090 {"tee", (PyCFunction
)tee
, METH_VARARGS
, tee_doc
},
4091 {NULL
, NULL
} /* sentinel */
4100 PyTypeObject
*typelist
[] = {
4123 Py_TYPE(&teedataobject_type
) = &PyType_Type
;
4124 m
= Py_InitModule3("itertools", module_methods
, module_doc
);
4128 for (i
=0 ; typelist
[i
] != NULL
; i
++) {
4129 if (PyType_Ready(typelist
[i
]) < 0)
4131 name
= strchr(typelist
[i
]->tp_name
, '.');
4132 assert (name
!= NULL
);
4133 Py_INCREF(typelist
[i
]);
4134 PyModule_AddObject(m
, name
+1, (PyObject
*)typelist
[i
]);
4137 if (PyType_Ready(&teedataobject_type
) < 0)
4139 if (PyType_Ready(&tee_type
) < 0)
4141 if (PyType_Ready(&_grouper_type
) < 0)