chiark
/
gitweb
/
~mdw
/
catacomb-python
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
debian/: Use `dh_python2' for packaging.
[catacomb-python]
/
mp.c
diff --git
a/mp.c
b/mp.c
index 88ee73813b538baa863097df8f07232a4fe66523..b253dba7723c77aa7f9d041b8a053353c9fb1e6e 100644
(file)
--- a/
mp.c
+++ b/
mp.c
@@
-892,13
+892,13
@@
static PyTypeObject mp_pytype_skel = {
"Multiprecision integers, similar to `long' but more efficient and\n\
versatile. Support all the standard arithmetic operations.\n\
\n\
"Multiprecision integers, similar to `long' but more efficient and\n\
versatile. Support all the standard arithmetic operations.\n\
\n\
-Constructor mp(X,
radix = R
) attempts to convert X to an `mp'. If\n\
+Constructor mp(X,
[radix = R]
) attempts to convert X to an `mp'. If\n\
X is a string, it's read in radix-R form, or we look for a prefix\n\
if R = 0. Other acceptable things are ints and longs.\n\
\n\
Notes:\n\
\n\
X is a string, it's read in radix-R form, or we look for a prefix\n\
if R = 0. Other acceptable things are ints and longs.\n\
\n\
Notes:\n\
\n\
- * Use `//' for
division. MPs don't have `/'
division.",
+ * Use `//' for
integer division. `/' gives exact rational
division.",
0, /* @tp_traverse@ */
0, /* @tp_clear@ */
0, /* @tp_traverse@ */
0, /* @tp_clear@ */
@@
-1101,7
+1101,7
@@
static PyTypeObject *mpmul_pytype, mpmul_pytype_skel = {
Py_TPFLAGS_BASETYPE,
/* @tp_doc@ */
Py_TPFLAGS_BASETYPE,
/* @tp_doc@ */
-"
A
n object for multiplying many small integers.",
+"
MPMul(N_0, N_1, ....): a
n object for multiplying many small integers.",
0, /* @tp_traverse@ */
0, /* @tp_clear@ */
0, /* @tp_traverse@ */
0, /* @tp_clear@ */
@@
-1368,7
+1368,7
@@
static PyTypeObject *mpmont_pytype, mpmont_pytype_skel = {
Py_TPFLAGS_BASETYPE,
/* @tp_doc@ */
Py_TPFLAGS_BASETYPE,
/* @tp_doc@ */
-"
A
Montgomery reduction context.",
+"
MPMont(N): a
Montgomery reduction context.",
0, /* @tp_traverse@ */
0, /* @tp_clear@ */
0, /* @tp_traverse@ */
0, /* @tp_clear@ */
@@
-1507,7
+1507,7
@@
static PyTypeObject *mpbarrett_pytype, mpbarrett_pytype_skel = {
Py_TPFLAGS_BASETYPE,
/* @tp_doc@ */
Py_TPFLAGS_BASETYPE,
/* @tp_doc@ */
-"
A
Barrett reduction context.",
+"
MPBarrett(N): a
Barrett reduction context.",
0, /* @tp_traverse@ */
0, /* @tp_clear@ */
0, /* @tp_traverse@ */
0, /* @tp_clear@ */
@@
-1635,7
+1635,7
@@
static PyTypeObject *mpreduce_pytype, mpreduce_pytype_skel = {
Py_TPFLAGS_BASETYPE,
/* @tp_doc@ */
Py_TPFLAGS_BASETYPE,
/* @tp_doc@ */
-"
A reduction context for reduction modulo primes of special form
.",
+"
MPReduce(N): a reduction context for reduction modulo Solinas primes
.",
0, /* @tp_traverse@ */
0, /* @tp_clear@ */
0, /* @tp_traverse@ */
0, /* @tp_clear@ */
@@
-1804,7
+1804,7
@@
static PyTypeObject *mpcrt_pytype, mpcrt_pytype_skel = {
Py_TPFLAGS_BASETYPE,
/* @tp_doc@ */
Py_TPFLAGS_BASETYPE,
/* @tp_doc@ */
-"
A context for the solution of
Chinese Remainder Theorem problems.",
+"
MPCRT(SEQ): a context for solving
Chinese Remainder Theorem problems.",
0, /* @tp_traverse@ */
0, /* @tp_clear@ */
0, /* @tp_traverse@ */
0, /* @tp_clear@ */
@@
-2099,7
+2099,7
@@
but it's much easier to type than `p2' or `c2' or whatever.\n\
\n\
Notes:\n\
\n\
\n\
Notes:\n\
\n\
- * Use `//' for
division. GFs don't have `/'
division.",
+ * Use `//' for
Euclidean division. `/' gives exact rational
division.",
0, /* @tp_traverse@ */
0, /* @tp_clear@ */
0, /* @tp_traverse@ */
0, /* @tp_clear@ */
@@
-2310,7
+2310,7
@@
static PyTypeObject *gfreduce_pytype, gfreduce_pytype_skel = {
Py_TPFLAGS_BASETYPE,
/* @tp_doc@ */
Py_TPFLAGS_BASETYPE,
/* @tp_doc@ */
-"
A reduction context for reduction modulo sparse irreducibl
e polynomials.",
+"
GFReduce(N): a context for reduction modulo spars
e polynomials.",
0, /* @tp_traverse@ */
0, /* @tp_clear@ */
0, /* @tp_traverse@ */
0, /* @tp_clear@ */
@@
-2444,8
+2444,8
@@
static PyTypeObject gfn_pytype_skel = {
Py_TPFLAGS_BASETYPE,
/* @tp_doc@ */
Py_TPFLAGS_BASETYPE,
/* @tp_doc@ */
-"
An object for transforming elements of binary fields between polynomial
\n\
-and normal basis representations.",
+"
GFN(P, BETA): an object for transforming elements of binary fields
\n\
+
between polynomial
and normal basis representations.",
0, /* @tp_traverse@ */
0, /* @tp_clear@ */
0, /* @tp_traverse@ */
0, /* @tp_clear@ */