/* -*-c-*-
- *
- * $Id$
*
* Multiprecision arithmetic
*
* (c) 2004 Straylight/Edgeware
*/
-/*----- Licensing notice --------------------------------------------------*
+/*----- Licensing notice --------------------------------------------------*
*
* This file is part of the Python interface to Catacomb.
*
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
- *
+ *
* Catacomb/Python is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
- *
+ *
* You should have received a copy of the GNU General Public License
* along with Catacomb/Python; if not, write to the Free Software Foundation,
* Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
return (1);
}
+static mp *implicitmp(PyObject *o)
+{
+ if (!o ||
+ GF_PYCHECK(o) ||
+ ECPT_PYCHECK(o) ||
+ FE_PYCHECK(o) ||
+ GE_PYCHECK(o))
+ return (0);
+ return (tomp(o));
+}
+
+static mp *implicitgf(PyObject *o)
+{
+ if (!o ||
+ MP_PYCHECK(o) ||
+ ECPT_PYCHECK(o) ||
+ FE_PYCHECK(o) ||
+ GE_PYCHECK(o))
+ return (0);
+ return (tomp(o));
+}
+
static int mpbinop(PyObject *x, PyObject *y, mp **xx, mp **yy)
{
- if ((*xx = tomp(x)) == 0)
+ if ((*xx = implicitmp(x)) == 0)
return (-1);
- if ((*yy = tomp(y)) == 0) {
+ if ((*yy = implicitmp(y)) == 0) {
+ MP_DROP(*xx);
+ return (-1);
+ }
+ return (0);
+}
+
+static int gfbinop(PyObject *x, PyObject *y, mp **xx, mp **yy)
+{
+ if ((*xx = implicitgf(x)) == 0)
+ return (-1);
+ if ((*yy = implicitgf(y)) == 0) {
MP_DROP(*xx);
return (-1);
}
#define BINOP(pre, name) \
static PyObject *pre##_py##name(PyObject *x, PyObject *y) { \
mp *xx, *yy, *zz; \
- if (mpbinop(x, y, &xx, &yy)) RETURN_NOTIMPL; \
+ if (pre##binop(x, y, &xx, &yy)) RETURN_NOTIMPL; \
zz = pre##_##name(MP_NEW, xx, yy); \
MP_DROP(xx); MP_DROP(yy); \
return (pre##_pywrap(zz)); \
mp *xx, *yy; \
PyObject *z = 0; \
long n; \
- if (mpbinop(x, y, &xx, &yy)) RETURN_NOTIMPL; \
+ if (pre##binop(x, y, &xx, &yy)) RETURN_NOTIMPL; \
if (mp_tolong_checked(yy, &n)) goto end; \
if (n < 0) \
z = pre##_pywrap(mp_##rname(MP_NEW, xx, -n)); \
mp *xx, *yy; \
PyObject *z = 0; \
INIT_##qq(q) INIT_##rr(r) \
- if (mpbinop(x, y, &xx, &yy)) RETURN_NOTIMPL; \
+ if (pre##binop(x, y, &xx, &yy)) RETURN_NOTIMPL; \
if (MP_ZEROP(yy)) \
ZDIVERR("division by zero"); \
pre##_div(ARG_##qq(q), ARG_##rr(r), xx, yy); \
mp *r = 0;
PyObject *rc = 0;
- if ((xx = tomp(x)) == 0 || (yy = tomp(y)) == 0 ||
+ if ((xx = implicitmp(x)) == 0 || (yy = implicitmp(y)) == 0 ||
(z && z != Py_None && (zz = tomp(z)) == 0)) {
mp_drop(xx); mp_drop(yy); mp_drop(zz);
RETURN_NOTIMPL;
return (PyFloat_FromDouble(f));
}
-#define COERCE(pre, PRE) \
+#define COERCE(pre, PRE) \
static int pre##_pycoerce(PyObject **x, PyObject **y) \
{ \
mp *z; \
PyObject *z = 0;
if (!PyArg_ParseTuple(arg, "O&:jacobi", convmp, &y)) goto end;
- if (MP_NEGP(MP_X(me)) || MP_EVENP(MP_X(me)))
- VALERR("must be positive and odd");
z = PyInt_FromLong(mp_jacobi(y, MP_X(me)));
end:
if (y) MP_DROP(y);
#define BITOP(pre, name, c) \
static PyObject *pre##meth_##name(PyObject *me, PyObject *arg) \
{ \
- int i; \
- if (!PyArg_ParseTuple(arg, "i:" #name, &i)) return (0); \
+ unsigned long i; \
+ if (!PyArg_ParseTuple(arg, "O&:" #name, convulong, &i)) return (0); \
return (pre##_pywrap(mp_##name##c(MP_NEW, MP_X(me), i))); \
}
BITOP(mp, setbit, 2c);
BITOP(mp, clearbit, 2c);
-BITOP(gf, setbit, );
+BITOP(gf, setbit, );
BITOP(gf, clearbit, );
#undef BITOP
static PyObject *mpmeth_testbit(PyObject *me, PyObject *arg)
{
- int i;
- if (!PyArg_ParseTuple(arg, "i:testbit", &i)) return (0);
+ unsigned long i;
+ if (!PyArg_ParseTuple(arg, "O&:testbit", convulong, &i)) return (0);
return (getbool(mp_testbit2c(MP_X(me), i)));
}
static PyObject *gfmeth_testbit(PyObject *me, PyObject *arg)
{
- int i;
- if (!PyArg_ParseTuple(arg, "i:testbit", &i)) return (0);
+ unsigned long i;
+ if (!PyArg_ParseTuple(arg, "O&:testbit", convulong, &i)) return (0);
return (getbool(mp_testbit(MP_X(me), i)));
}
static PyTypeObject mp_pytype_skel = {
PyObject_HEAD_INIT(0) 0, /* Header */
- "catacomb.MP", /* @tp_name@ */
+ "MP", /* @tp_name@ */
sizeof(mp_pyobj), /* @tp_basicsize@ */
0, /* @tp_itemsize@ */
};
static PyObject *meth__MP_fromstring(PyObject *me,
- PyObject *arg, PyObject *kw)
+ PyObject *arg, PyObject *kw)
{
int r = 0;
char *p;
if (!good_radix_p(r, 1)) VALERR("bad radix");
sc.buf = p; sc.lim = p + len;
if ((zz = mp_read(MP_NEW, r, &mptext_stringops, &sc)) == 0)
- SYNERR("bad integer");
+ VALERR("bad integer");
z = Py_BuildValue("(Ns#)", mp_pywrap(zz), sc.buf, (int)(sc.lim - sc.buf));
end:
return (z);
}
-static PyObject *meth__MP_product(PyObject *me, PyObject *arg)
+static PyObject *meth__MP_factorial(PyObject *me, PyObject *arg)
+{
+ unsigned long i;
+ mp *x;
+ if (!PyArg_ParseTuple(arg, "OO&:factorial", &me, convulong, &i))
+ return (0);
+ x = mp_factorial(i);
+ return mp_pywrap(x);
+}
+
+static PyObject *meth__MP_fibonacci(PyObject *me, PyObject *arg)
+{
+ long i;
+ mp *x;
+ if (!PyArg_ParseTuple(arg, "Ol:fibonacci", &me, &i)) return (0);
+ x = mp_fibonacci(i);
+ return mp_pywrap(x);
+}
+
+#define LOADOP(pre, py, name) \
+ static PyObject *meth__##py##_##name(PyObject *me, PyObject *arg) \
+ { \
+ char *p; \
+ int len; \
+ if (!PyArg_ParseTuple(arg, "Os#:" #name, &me, &p, &len)) return (0); \
+ return (pre##_pywrap(mp_##name(MP_NEW, p, len))); \
+ }
+LOADOP(mp, MP, loadl)
+LOADOP(mp, MP, loadb)
+LOADOP(mp, MP, loadl2c)
+LOADOP(mp, MP, loadb2c)
+LOADOP(gf, GF, loadl)
+LOADOP(gf, GF, loadb)
+#undef LOADOP
+
+/*----- Products of small integers ----------------------------------------*/
+
+typedef struct mpmul_pyobj {
+ PyObject_HEAD
+ int livep;
+ mpmul mm;
+} mpmul_pyobj;
+
+#define MPMUL_LIVEP(o) (((mpmul_pyobj *)(o))->livep)
+#define MPMUL_PY(o) (&((mpmul_pyobj *)(o))->mm)
+
+static void mpmul_pydealloc(PyObject *me)
+{
+ if (MPMUL_LIVEP(me))
+ mp_drop(mpmul_done(MPMUL_PY(me)));
+ FREEOBJ(me);
+}
+
+static PyObject *mmmeth_factor(PyObject *me, PyObject *arg)
{
- mpmul m;
PyObject *q, *i;
mp *x;
- if (PyTuple_Size(arg) != 2) {
+ if (!MPMUL_LIVEP(me)) VALERR("MPMul object invalid");
+ if (PyTuple_Size(arg) != 1)
i = PyObject_GetIter(arg);
- PyIter_Next(i);
- } else {
- if ((q = PyTuple_GetItem(arg, 1)) == 0) return (0);
+ else {
+ if ((q = PyTuple_GetItem(arg, 0)) == 0) goto end;
if ((i = PyObject_GetIter(q)) == 0) {
PyErr_Clear(); /* that's ok */
i = PyObject_GetIter(arg);
}
}
- if (!i) return (0);
- mpmul_init(&m);
+ if (!i) goto end;
while ((q = PyIter_Next(i)) != 0) {
x = getmp(q); Py_DECREF(q); if (!x) {
- MP_DROP(mpmul_done(&m));
Py_DECREF(i);
- return (0);
+ goto end;
}
- mpmul_add(&m, x);
+ mpmul_add(MPMUL_PY(me), x);
MP_DROP(x);
}
- x = mpmul_done(&m);
Py_DECREF(i);
+ RETURN_ME;
+end:
+ return (0);
+}
+
+static PyObject *mmmeth_done(PyObject *me, PyObject *arg)
+{
+ mp *x;
+
+ if (!PyArg_ParseTuple(arg, ":done")) goto end;
+ if (!MPMUL_LIVEP(me)) VALERR("MPMul object invalid");
+ x = mpmul_done(MPMUL_PY(me));
+ MPMUL_LIVEP(me) = 0;
return (mp_pywrap(x));
+end:
+ return (0);
}
-#define LOADOP(pre, py, name) \
- static PyObject *meth__##py##_##name(PyObject *me, PyObject *arg) \
- { \
- char *p; \
- int len; \
- if (!PyArg_ParseTuple(arg, "Os#:" #name, &me, &p, &len)) return (0); \
- return (pre##_pywrap(mp_##name(MP_NEW, p, len))); \
+static PyObject *mpmul_pynew(PyTypeObject *ty, PyObject *arg, PyObject *kw)
+{
+ mpmul_pyobj *mm;
+
+ if (kw) TYERR("keyword arguments not allowed here");
+ mm = (mpmul_pyobj *)ty->tp_alloc(ty, 0);
+ mpmul_init(&mm->mm);
+ mm->livep = 1;
+ if (mmmeth_factor((PyObject *)mm, arg) == 0) {
+ Py_DECREF(mm);
+ goto end;
}
-LOADOP(mp, MP, loadl)
-LOADOP(mp, MP, loadb)
-LOADOP(mp, MP, loadl2c)
-LOADOP(mp, MP, loadb2c)
-LOADOP(gf, GF, loadl)
-LOADOP(gf, GF, loadb)
-#undef LOADOP
+ return ((PyObject *)mm);
+end:
+ return (0);
+}
+
+static PyObject *mmget_livep(PyObject *me, void *hunoz)
+ { return (getbool(MPMUL_LIVEP(me))); }
+
+static PyGetSetDef mpmul_pygetset[] = {
+#define GETSETNAME(op, name) mm##op##_##name
+ GET (livep, "MM.livep -> flag: object still valid?")
+#undef GETSETNAME
+ { 0 }
+};
+
+static PyMethodDef mpmul_pymethods[] = {
+#define METHNAME(name) mmmeth_##name
+ METH (factor, "MM.factor(ITERABLE) or MM.factor(I, ...)")
+ METH (done, "MM.done() -> PRODUCT")
+#undef METHNAME
+ { 0 }
+};
+
+static PyTypeObject *mpmul_pytype, mpmul_pytype_skel = {
+ PyObject_HEAD_INIT(0) 0, /* Header */
+ "MPMul", /* @tp_name@ */
+ sizeof(mpmul_pyobj), /* @tp_basicsize@ */
+ 0, /* @tp_itemsize@ */
+
+ mpmul_pydealloc, /* @tp_dealloc@ */
+ 0, /* @tp_print@ */
+ 0, /* @tp_getattr@ */
+ 0, /* @tp_setattr@ */
+ 0, /* @tp_compare@ */
+ 0, /* @tp_repr@ */
+ 0, /* @tp_as_number@ */
+ 0, /* @tp_as_sequence@ */
+ 0, /* @tp_as_mapping@ */
+ 0, /* @tp_hash@ */
+ 0, /* @tp_call@ */
+ 0, /* @tp_str@ */
+ 0, /* @tp_getattro@ */
+ 0, /* @tp_setattro@ */
+ 0, /* @tp_as_buffer@ */
+ Py_TPFLAGS_DEFAULT | /* @tp_flags@ */
+ Py_TPFLAGS_BASETYPE,
+
+ /* @tp_doc@ */
+"An object for multiplying many small integers.",
+
+ 0, /* @tp_traverse@ */
+ 0, /* @tp_clear@ */
+ 0, /* @tp_richcompare@ */
+ 0, /* @tp_weaklistoffset@ */
+ 0, /* @tp_iter@ */
+ 0, /* @tp_iternext@ */
+ mpmul_pymethods, /* @tp_methods@ */
+ 0, /* @tp_members@ */
+ mpmul_pygetset, /* @tp_getset@ */
+ 0, /* @tp_base@ */
+ 0, /* @tp_dict@ */
+ 0, /* @tp_descr_get@ */
+ 0, /* @tp_descr_set@ */
+ 0, /* @tp_dictoffset@ */
+ 0, /* @tp_init@ */
+ PyType_GenericAlloc, /* @tp_alloc@ */
+ mpmul_pynew, /* @tp_new@ */
+ 0, /* @tp_free@ */
+ 0 /* @tp_is_gc@ */
+};
/*----- Montgomery reduction ----------------------------------------------*/
static PyObject *mm_mexpr(PyObject *me, void *v, int n)
{ return mp_pywrap(mpmont_mexpr(MPMONT_PY(me), MP_NEW, v, n)); }
-
+
static void mp_mexp_drop(void *p)
{
mp_expfactor *f = p;
static PyObject *mm_mexp(PyObject *me, void *v, int n)
{ return mp_pywrap(mpmont_mexp(MPMONT_PY(me), MP_NEW, v, n)); }
-
+
static PyObject *mmmeth_mexp(PyObject *me, PyObject *arg)
{
return mexp_common(me, arg, sizeof(mp_expfactor),
static PyMethodDef mpmont_pymethods[] = {
#define METHNAME(name) mmmeth_##name
- METH (int, "M.out(X) -> XR")
+ METH (int, "M.int(X) -> XR")
METH (mul, "M.mul(XR, YR) -> ZR where Z = X Y")
METH (expr, "M.expr(XR, N) -> ZR where Z = X^N mod M.m")
METH (mexpr, "\
-B.mexp([(XR0, N0), (XR1, N1), ...]) = ZR where Z = X0^N0 X1^N1 mod B.m\n\
+M.mexpr([(XR0, N0), (XR1, N1), ...]) = ZR where Z = X0^N0 X1^N1 ... mod M.m\n\
\t(the list may be flattened if this more convenient.)")
METH (reduce, "M.reduce(XR) -> X")
METH (ext, "M.ext(XR) -> X")
METH (exp, "M.exp(X, N) -> X^N mod M.m")
METH (mexp, "\
-B.mexp([(X0, N0), (X1, N1), ...]) = X0^N0 X1^N1 mod B.m\n\
+M.mexp([(X0, N0), (X1, N1), ...]) = X0^N0 X1^N1 ... mod M.m\n\
\t(the list may be flattened if this more convenient.)")
#undef METHNAME
{ 0 }
static PyTypeObject *mpmont_pytype, mpmont_pytype_skel = {
PyObject_HEAD_INIT(0) 0, /* Header */
- "catacomb.MPMont", /* @tp_name@ */
+ "MPMont", /* @tp_name@ */
sizeof(mpmont_pyobj), /* @tp_basicsize@ */
0, /* @tp_itemsize@ */
static PyObject *mb_mexp(PyObject *me, void *v, int n)
{ return mp_pywrap(mpbarrett_mexp(MPBARRETT_PY(me), MP_NEW, v, n)); }
-
+
static PyObject *mbmeth_mexp(PyObject *me, PyObject *arg)
{
return mexp_common(me, arg, sizeof(mp_expfactor),
METH (reduce, "B.reduce(X) -> X mod B.m")
METH (exp, "B.exp(X, N) -> X^N mod B.m")
METH (mexp, "\
-B.mexp([(X0, N0), (X1, N1), ...]) = X0^N0 X1^N1 mod B.m\n\
+B.mexp([(X0, N0), (X1, N1), ...]) = X0^N0 X1^N1 ... mod B.m\n\
\t(the list may be flattened if this more convenient.)")
#undef METHNAME
{ 0 }
static PyTypeObject *mpbarrett_pytype, mpbarrett_pytype_skel = {
PyObject_HEAD_INIT(0) 0, /* Header */
- "catacomb.MPBarrett", /* @tp_name@ */
+ "MPBarrett", /* @tp_name@ */
sizeof(mpbarrett_pyobj), /* @tp_basicsize@ */
0, /* @tp_itemsize@ */
static PyTypeObject *mpreduce_pytype, mpreduce_pytype_skel = {
PyObject_HEAD_INIT(0) 0, /* Header */
- "catacomb.MPReduce", /* @tp_name@ */
+ "MPReduce", /* @tp_name@ */
sizeof(mpreduce_pyobj), /* @tp_basicsize@ */
0, /* @tp_itemsize@ */
static PyTypeObject *mpcrt_pytype, mpcrt_pytype_skel = {
PyObject_HEAD_INIT(0) 0, /* Header */
- "catacomb.MPCRT", /* @tp_name@ */
+ "MPCRT", /* @tp_name@ */
sizeof(mpcrt_pyobj), /* @tp_basicsize@ */
0, /* @tp_itemsize@ */
int xl, yl;
int b;
- if (mpbinop(x, y, &xx, &yy)) RETURN_NOTIMPL;
+ if (gfbinop(x, y, &xx, &yy)) RETURN_NOTIMPL;
switch (op) {
case Py_EQ: b = MP_EQ(xx, yy); break;
case Py_NE: b = !MP_EQ(xx, yy); break;
METH (gcdx,
"X.gcdx(Y) -> (gcd(X, Y), U, V) with X U + Y V = gcd(X, Y)")
METH (modinv, "X.modinv(Y) -> multiplicative inverse of Y mod X")
- METH (irreduciblep, "X.irreduciblep() -> true/false")
+ METH (irreduciblep, "X.irreduciblep() -> true/false")
#undef METHNAME
#define METHNAME(func) mpmeth_##func
KWMETH(tostring, "X.tostring(radix = 10) -> STR")
static PyTypeObject gf_pytype_skel = {
PyObject_HEAD_INIT(0) 0, /* Header */
- "catacomb.GF", /* @tp_name@ */
+ "GF", /* @tp_name@ */
sizeof(mp_pyobj), /* @tp_basicsize@ */
0, /* @tp_itemsize@ */
if (!PyArg_ParseTupleAndKeywords(arg, kw, "Os#|i:fromstring",
kwlist, &me, &p, &len, &r))
goto end;
- if (!good_radix_p(r, 1)) VALERR("radix out of range");
+ if (!good_radix_p(r, 1)) VALERR("bad radix");
sc.buf = p; sc.lim = p + len;
- if ((zz = mp_read(MP_NEW, r, &mptext_stringops, &sc)) == 0 || MP_NEGP(zz))
- z = Py_BuildValue("(Os#)", Py_None, p, len);
- else
- z = Py_BuildValue("(Ns#)", gf_pywrap(zz),
- sc.buf, (int)(sc.lim - sc.buf));
+ if ((zz = mp_read(MP_NEW, r, &mptext_stringops, &sc)) == 0 ||
+ MP_NEGP(zz)) {
+ if (zz) MP_DROP(zz);
+ VALERR("bad binary polynomial");
+ }
+ z = Py_BuildValue("(Ns#)", gf_pywrap(zz), sc.buf, (int)(sc.lim - sc.buf));
end:
return (z);
}
return (rc);
}
+static PyObject *grmeth_trace(PyObject *me, PyObject *arg)
+{
+ PyObject *rc = 0;
+ mp *xx = 0;
+
+ if (!PyArg_ParseTuple(arg, "O&:trace", convgf, &xx)) goto end;
+ rc = PyInt_FromLong(gfreduce_trace(GFREDUCE_PY(me), xx));
+end:
+ if (xx) MP_DROP(xx);
+ return (rc);
+}
+
+static PyObject *grmeth_halftrace(PyObject *me, PyObject *arg)
+{
+ PyObject *rc = 0;
+ mp *xx = 0;
+
+ if (!PyArg_ParseTuple(arg, "O&:halftrace", convgf, &xx)) goto end;
+ rc = gf_pywrap(gfreduce_halftrace(GFREDUCE_PY(me), MP_NEW, xx));
+end:
+ if (xx) MP_DROP(xx);
+ return (rc);
+}
+
+static PyObject *grmeth_sqrt(PyObject *me, PyObject *arg)
+{
+ PyObject *rc = 0;
+ mp *xx = 0, *yy;
+
+ if (!PyArg_ParseTuple(arg, "O&:sqrt", convgf, &xx)) goto end;
+ if ((yy = gfreduce_sqrt(GFREDUCE_PY(me), MP_NEW, xx)) == 0)
+ VALERR("no modular square root");
+ rc = gf_pywrap(yy);
+end:
+ if (xx) MP_DROP(xx);
+ return (rc);
+}
+
+static PyObject *grmeth_quadsolve(PyObject *me, PyObject *arg)
+{
+ PyObject *rc = 0;
+ mp *xx = 0, *yy;
+
+ if (!PyArg_ParseTuple(arg, "O&:quadsolve", convgf, &xx)) goto end;
+ if ((yy = gfreduce_quadsolve(GFREDUCE_PY(me), MP_NEW, xx)) == 0)
+ VALERR("no solution found");
+ rc = gf_pywrap(yy);
+end:
+ if (xx) MP_DROP(xx);
+ return (rc);
+}
+
static PyObject *grmeth_reduce(PyObject *me, PyObject *arg)
{
PyObject *z = 0;
static PyMethodDef gfreduce_pymethods[] = {
#define METHNAME(name) grmeth_##name
METH (reduce, "R.reduce(X) -> X mod B.m")
+ METH (trace, "R.trace(X) -> Tr(X) = x + x^2 + ... + x^{2^{m - 1}}")
+ METH (halftrace, "R.halftrace(X) -> x + x^{2^2} + ... + x^{2^{m - 1}}")
+ METH (sqrt, "R.sqrt(X) -> Y where Y^2 = X mod R")
+ METH (quadsolve, "R.quadsolve(X) -> Y where Y^2 + Y = X mod R")
METH (exp, "R.exp(X, N) -> X^N mod B.m")
#undef METHNAME
{ 0 }
static PyTypeObject *gfreduce_pytype, gfreduce_pytype_skel = {
PyObject_HEAD_INIT(0) 0, /* Header */
- "catacomb.GFReduce", /* @tp_name@ */
+ "GFReduce", /* @tp_name@ */
sizeof(gfreduce_pyobj), /* @tp_basicsize@ */
0, /* @tp_itemsize@ */
static PyTypeObject gfn_pytype_skel = {
PyObject_HEAD_INIT(0) 0, /* Header */
- "catacomb.GFN", /* @tp_name@ */
+ "GFN", /* @tp_name@ */
sizeof(gfn_pyobj), /* @tp_basicsize@ */
0, /* @tp_itemsize@ */
static PyMethodDef methods[] = {
#define METHNAME(func) meth_##func
- KWMETH(_MP_fromstring, "\
+ KWMETH(_MP_fromstring, "\
fromstring(STR, radix = 0) -> (X, REST)\n\
\n\
Parse STR as a large integer, according to radix. If radix is zero,\n\
read a prefix from STR to decide radix: allow `0' for octal, `0x' for hex\n\
or `R_' for other radix R.")
- KWMETH(_GF_fromstring, "\
+ KWMETH(_GF_fromstring, "\
fromstring(STR, radix = 0) -> (X, REST)\n\
\n\
Parse STR as a binary polynomial, according to radix. If radix is zero,\n\
read a prefix from STR to decide radix: allow `0' for octal, `0x' for hex\n\
or `R_' for other radix R.")
+ METH (_MP_factorial, "\
+factorial(I) -> I!: compute factorial")
+ METH (_MP_fibonacci, "\
+fibonacci(I) -> F(I): compute Fibonacci number")
METH (_MP_loadl, "\
loadl(STR) -> X: read little-endian bytes")
METH (_MP_loadb, "\
loadb2c(STR) -> X: read big-endian bytes, two's complement")
METH (_MP_frombuf, "\
frombuf(STR) -> (X, REST): read buffer format")
- METH (_MP_product, "\
-product(ITER) -> X: product of things iterated over")
METH (_GF_loadl, "\
loadl(STR) -> X: read little-endian bytes")
METH (_GF_loadb, "\
{
INITTYPE(mp, root);
INITTYPE(gf, root);
+ INITTYPE(mpmul, root);
INITTYPE(mpmont, root);
INITTYPE(mpbarrett, root);
INITTYPE(mpreduce, root);
void mp_pyinsert(PyObject *mod)
{
INSERT("MP", mp_pytype);
+ INSERT("MPMul", mpmul_pytype);
INSERT("MPMont", mpmont_pytype);
INSERT("MPBarrett", mpbarrett_pytype);
INSERT("MPReduce", mpreduce_pytype);