Skip to content
Projeler
Gruplar
Parçacıklar
Yardım
Yükleniyor...
Oturum aç / Kaydol
Gezinmeyi değiştir
C
cpython
Proje
Proje
Ayrıntılar
Etkinlik
Cycle Analytics
Depo (repository)
Depo (repository)
Dosyalar
Kayıtlar (commit)
Dallar (branch)
Etiketler
Katkıda bulunanlar
Grafik
Karşılaştır
Grafikler
Konular (issue)
0
Konular (issue)
0
Liste
Pano
Etiketler
Kilometre Taşları
Birleştirme (merge) Talepleri
0
Birleştirme (merge) Talepleri
0
CI / CD
CI / CD
İş akışları (pipeline)
İşler
Zamanlamalar
Grafikler
Paketler
Paketler
Wiki
Wiki
Parçacıklar
Parçacıklar
Üyeler
Üyeler
Collapse sidebar
Close sidebar
Etkinlik
Grafik
Grafikler
Yeni bir konu (issue) oluştur
İşler
Kayıtlar (commit)
Konu (issue) Panoları
Kenar çubuğunu aç
Batuhan Osman TASKAYA
cpython
Commits
61024b91
Kaydet (Commit)
61024b91
authored
Mar 02, 2008
tarafından
Raymond Hettinger
Dosyalara gözat
Seçenekler
Dosyalara Gözat
İndir
Eposta Yamaları
Sade Fark
Simplify code for itertools.product().
üst
2b7a5c46
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
2 additions
and
13 deletions
+2
-13
itertoolsmodule.c
Modules/itertoolsmodule.c
+2
-13
No files found.
Modules/itertoolsmodule.c
Dosyayı görüntüle @
61024b91
...
...
@@ -1770,7 +1770,6 @@ static PyTypeObject chain_type = {
typedef
struct
{
PyObject_HEAD
PyObject
*
pools
;
/* tuple of pool tuples */
Py_ssize_t
*
maxvec
;
/* size of each pool */
Py_ssize_t
*
indices
;
/* one index per pool */
PyObject
*
result
;
/* most recently returned result tuple */
int
stopped
;
/* set to 1 when the product iterator is exhausted */
...
...
@@ -1784,7 +1783,6 @@ product_new(PyTypeObject *type, PyObject *args, PyObject *kwds)
productobject
*
lz
;
Py_ssize_t
nargs
,
npools
,
repeat
=
1
;
PyObject
*
pools
=
NULL
;
Py_ssize_t
*
maxvec
=
NULL
;
Py_ssize_t
*
indices
=
NULL
;
Py_ssize_t
i
;
...
...
@@ -1809,9 +1807,8 @@ product_new(PyTypeObject *type, PyObject *args, PyObject *kwds)
nargs
=
(
repeat
==
0
)
?
0
:
PyTuple_GET_SIZE
(
args
);
npools
=
nargs
*
repeat
;
maxvec
=
PyMem_Malloc
(
npools
*
sizeof
(
Py_ssize_t
));
indices
=
PyMem_Malloc
(
npools
*
sizeof
(
Py_ssize_t
));
if
(
maxvec
==
NULL
||
indices
==
NULL
)
{
if
(
indices
==
NULL
)
{
PyErr_NoMemory
();
goto
error
;
}
...
...
@@ -1825,16 +1822,13 @@ product_new(PyTypeObject *type, PyObject *args, PyObject *kwds)
PyObject
*
pool
=
PySequence_Tuple
(
item
);
if
(
pool
==
NULL
)
goto
error
;
PyTuple_SET_ITEM
(
pools
,
i
,
pool
);
maxvec
[
i
]
=
PyTuple_GET_SIZE
(
pool
);
indices
[
i
]
=
0
;
}
for
(
;
i
<
npools
;
++
i
)
{
PyObject
*
pool
=
PyTuple_GET_ITEM
(
pools
,
i
-
nargs
);
Py_INCREF
(
pool
);
PyTuple_SET_ITEM
(
pools
,
i
,
pool
);
maxvec
[
i
]
=
maxvec
[
i
-
nargs
];
indices
[
i
]
=
0
;
}
...
...
@@ -1844,7 +1838,6 @@ product_new(PyTypeObject *type, PyObject *args, PyObject *kwds)
goto
error
;
lz
->
pools
=
pools
;
lz
->
maxvec
=
maxvec
;
lz
->
indices
=
indices
;
lz
->
result
=
NULL
;
lz
->
stopped
=
0
;
...
...
@@ -1852,8 +1845,6 @@ product_new(PyTypeObject *type, PyObject *args, PyObject *kwds)
return
(
PyObject
*
)
lz
;
error:
if
(
maxvec
!=
NULL
)
PyMem_Free
(
maxvec
);
if
(
indices
!=
NULL
)
PyMem_Free
(
indices
);
Py_XDECREF
(
pools
);
...
...
@@ -1866,7 +1857,6 @@ product_dealloc(productobject *lz)
PyObject_GC_UnTrack
(
lz
);
Py_XDECREF
(
lz
->
pools
);
Py_XDECREF
(
lz
->
result
);
PyMem_Free
(
lz
->
maxvec
);
PyMem_Free
(
lz
->
indices
);
Py_TYPE
(
lz
)
->
tp_free
(
lz
);
}
...
...
@@ -1913,7 +1903,6 @@ product_next(productobject *lz)
}
}
else
{
Py_ssize_t
*
indices
=
lz
->
indices
;
Py_ssize_t
*
maxvec
=
lz
->
maxvec
;
/* Copy the previous result tuple or re-use it if available */
if
(
Py_REFCNT
(
result
)
>
1
)
{
...
...
@@ -1937,7 +1926,7 @@ product_next(productobject *lz)
for
(
i
=
npools
-
1
;
i
>=
0
;
i
--
)
{
pool
=
PyTuple_GET_ITEM
(
pools
,
i
);
indices
[
i
]
++
;
if
(
indices
[
i
]
==
maxvec
[
i
]
)
{
if
(
indices
[
i
]
==
PyTuple_GET_SIZE
(
pool
)
)
{
/* Roll-over and advance to next pool */
indices
[
i
]
=
0
;
elem
=
PyTuple_GET_ITEM
(
pool
,
0
);
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment