mirror of https://github.com/python/cpython
2033 lines
48 KiB
C
2033 lines
48 KiB
C
/* Array object implementation */
|
|
|
|
/* An array is a uniform list -- all items have the same type.
|
|
The item type is restricted to simple C types like int or float */
|
|
|
|
#include "Python.h"
|
|
|
|
#ifdef STDC_HEADERS
|
|
#include <stddef.h>
|
|
#else /* !STDC_HEADERS */
|
|
#ifndef DONT_HAVE_SYS_TYPES_H
|
|
#include <sys/types.h> /* For size_t */
|
|
#endif /* DONT_HAVE_SYS_TYPES_H */
|
|
#endif /* !STDC_HEADERS */
|
|
|
|
/* Shamelessy stolen from listobject.c */
|
|
static int
|
|
roundupsize(int n)
|
|
{
|
|
unsigned int nbits = 0;
|
|
unsigned int n2 = (unsigned int)n >> 5;
|
|
|
|
/* Round up:
|
|
* If n < 256, to a multiple of 8.
|
|
* If n < 2048, to a multiple of 64.
|
|
* If n < 16384, to a multiple of 512.
|
|
* If n < 131072, to a multiple of 4096.
|
|
* If n < 1048576, to a multiple of 32768.
|
|
* If n < 8388608, to a multiple of 262144.
|
|
* If n < 67108864, to a multiple of 2097152.
|
|
* If n < 536870912, to a multiple of 16777216.
|
|
* ...
|
|
* If n < 2**(5+3*i), to a multiple of 2**(3*i).
|
|
*
|
|
* This over-allocates proportional to the list size, making room
|
|
* for additional growth. The over-allocation is mild, but is
|
|
* enough to give linear-time amortized behavior over a long
|
|
* sequence of appends() in the presence of a poorly-performing
|
|
* system realloc() (which is a reality, e.g., across all flavors
|
|
* of Windows, with Win9x behavior being particularly bad -- and
|
|
* we've still got address space fragmentation problems on Win9x
|
|
* even with this scheme, although it requires much longer lists to
|
|
* provoke them than it used to).
|
|
*/
|
|
do {
|
|
n2 >>= 3;
|
|
nbits += 3;
|
|
} while (n2);
|
|
return ((n >> nbits) + 1) << nbits;
|
|
}
|
|
|
|
#define NRESIZE(var, type, nitems) \
|
|
do { \
|
|
size_t _new_size = roundupsize(nitems); \
|
|
if (_new_size <= ((~(size_t)0) / sizeof(type))) \
|
|
PyMem_RESIZE(var, type, _new_size); \
|
|
else \
|
|
var = NULL; \
|
|
} while (0)
|
|
/* END SHAMELESSLY STOLEN CODE */
|
|
|
|
struct arrayobject; /* Forward */
|
|
|
|
/* All possible arraydescr values are defined in the vector "descriptors"
|
|
* below. That's defined later because the appropriate get and set
|
|
* functions aren't visible yet.
|
|
*/
|
|
struct arraydescr {
|
|
int typecode;
|
|
int itemsize;
|
|
PyObject * (*getitem)(struct arrayobject *, int);
|
|
int (*setitem)(struct arrayobject *, int, PyObject *);
|
|
};
|
|
|
|
typedef struct arrayobject {
|
|
PyObject_HEAD
|
|
int ob_size;
|
|
char *ob_item;
|
|
struct arraydescr *ob_descr;
|
|
} arrayobject;
|
|
|
|
static PyTypeObject Arraytype;
|
|
|
|
#define array_Check(op) PyObject_TypeCheck(op, &Arraytype)
|
|
#define array_CheckExact(op) ((op)->ob_type == &Arraytype)
|
|
|
|
/****************************************************************************
|
|
Get and Set functions for each type.
|
|
A Get function takes an arrayobject* and an integer index, returning the
|
|
array value at that index wrapped in an appropriate PyObject*.
|
|
A Set function takes an arrayobject, integer index, and PyObject*; sets
|
|
the array value at that index to the raw C data extracted from the PyObject*,
|
|
and returns 0 if successful, else nonzero on failure (PyObject* not of an
|
|
appropriate type or value).
|
|
Note that the basic Get and Set functions do NOT check that the index is
|
|
in bounds; that's the responsibility of the caller.
|
|
****************************************************************************/
|
|
|
|
static PyObject *
|
|
c_getitem(arrayobject *ap, int i)
|
|
{
|
|
return PyString_FromStringAndSize(&((char *)ap->ob_item)[i], 1);
|
|
}
|
|
|
|
static int
|
|
c_setitem(arrayobject *ap, int i, PyObject *v)
|
|
{
|
|
char x;
|
|
if (!PyArg_Parse(v, "c;array item must be char", &x))
|
|
return -1;
|
|
if (i >= 0)
|
|
((char *)ap->ob_item)[i] = x;
|
|
return 0;
|
|
}
|
|
|
|
static PyObject *
|
|
b_getitem(arrayobject *ap, int i)
|
|
{
|
|
long x = ((char *)ap->ob_item)[i];
|
|
if (x >= 128)
|
|
x -= 256;
|
|
return PyInt_FromLong(x);
|
|
}
|
|
|
|
static int
|
|
b_setitem(arrayobject *ap, int i, PyObject *v)
|
|
{
|
|
short x;
|
|
/* PyArg_Parse's 'b' formatter is for an unsigned char, therefore
|
|
must use the next size up that is signed ('h') and manually do
|
|
the overflow checking */
|
|
if (!PyArg_Parse(v, "h;array item must be integer", &x))
|
|
return -1;
|
|
else if (x < -128) {
|
|
PyErr_SetString(PyExc_OverflowError,
|
|
"signed char is less than minimum");
|
|
return -1;
|
|
}
|
|
else if (x > 127) {
|
|
PyErr_SetString(PyExc_OverflowError,
|
|
"signed char is greater than maximum");
|
|
return -1;
|
|
}
|
|
if (i >= 0)
|
|
((char *)ap->ob_item)[i] = (char)x;
|
|
return 0;
|
|
}
|
|
|
|
static PyObject *
|
|
BB_getitem(arrayobject *ap, int i)
|
|
{
|
|
long x = ((unsigned char *)ap->ob_item)[i];
|
|
return PyInt_FromLong(x);
|
|
}
|
|
|
|
static int
|
|
BB_setitem(arrayobject *ap, int i, PyObject *v)
|
|
{
|
|
unsigned char x;
|
|
/* 'B' == unsigned char, maps to PyArg_Parse's 'b' formatter */
|
|
if (!PyArg_Parse(v, "b;array item must be integer", &x))
|
|
return -1;
|
|
if (i >= 0)
|
|
((char *)ap->ob_item)[i] = x;
|
|
return 0;
|
|
}
|
|
|
|
#ifdef Py_USING_UNICODE
|
|
static PyObject *
|
|
u_getitem(arrayobject *ap, int i)
|
|
{
|
|
return PyUnicode_FromUnicode(&((Py_UNICODE *) ap->ob_item)[i], 1);
|
|
}
|
|
|
|
static int
|
|
u_setitem(arrayobject *ap, int i, PyObject *v)
|
|
{
|
|
Py_UNICODE *p;
|
|
int len;
|
|
|
|
if (!PyArg_Parse(v, "u#;array item must be unicode character", &p, &len))
|
|
return -1;
|
|
if (len != 1) {
|
|
PyErr_SetString(PyExc_TypeError, "array item must be unicode character");
|
|
return -1;
|
|
}
|
|
if (i >= 0)
|
|
((Py_UNICODE *)ap->ob_item)[i] = p[0];
|
|
return 0;
|
|
}
|
|
#endif
|
|
|
|
static PyObject *
|
|
h_getitem(arrayobject *ap, int i)
|
|
{
|
|
return PyInt_FromLong((long) ((short *)ap->ob_item)[i]);
|
|
}
|
|
|
|
static int
|
|
h_setitem(arrayobject *ap, int i, PyObject *v)
|
|
{
|
|
short x;
|
|
/* 'h' == signed short, maps to PyArg_Parse's 'h' formatter */
|
|
if (!PyArg_Parse(v, "h;array item must be integer", &x))
|
|
return -1;
|
|
if (i >= 0)
|
|
((short *)ap->ob_item)[i] = x;
|
|
return 0;
|
|
}
|
|
|
|
static PyObject *
|
|
HH_getitem(arrayobject *ap, int i)
|
|
{
|
|
return PyInt_FromLong((long) ((unsigned short *)ap->ob_item)[i]);
|
|
}
|
|
|
|
static int
|
|
HH_setitem(arrayobject *ap, int i, PyObject *v)
|
|
{
|
|
int x;
|
|
/* PyArg_Parse's 'h' formatter is for a signed short, therefore
|
|
must use the next size up and manually do the overflow checking */
|
|
if (!PyArg_Parse(v, "i;array item must be integer", &x))
|
|
return -1;
|
|
else if (x < 0) {
|
|
PyErr_SetString(PyExc_OverflowError,
|
|
"unsigned short is less than minimum");
|
|
return -1;
|
|
}
|
|
else if (x > USHRT_MAX) {
|
|
PyErr_SetString(PyExc_OverflowError,
|
|
"unsigned short is greater than maximum");
|
|
return -1;
|
|
}
|
|
if (i >= 0)
|
|
((short *)ap->ob_item)[i] = (short)x;
|
|
return 0;
|
|
}
|
|
|
|
static PyObject *
|
|
i_getitem(arrayobject *ap, int i)
|
|
{
|
|
return PyInt_FromLong((long) ((int *)ap->ob_item)[i]);
|
|
}
|
|
|
|
static int
|
|
i_setitem(arrayobject *ap, int i, PyObject *v)
|
|
{
|
|
int x;
|
|
/* 'i' == signed int, maps to PyArg_Parse's 'i' formatter */
|
|
if (!PyArg_Parse(v, "i;array item must be integer", &x))
|
|
return -1;
|
|
if (i >= 0)
|
|
((int *)ap->ob_item)[i] = x;
|
|
return 0;
|
|
}
|
|
|
|
static PyObject *
|
|
II_getitem(arrayobject *ap, int i)
|
|
{
|
|
return PyLong_FromUnsignedLong(
|
|
(unsigned long) ((unsigned int *)ap->ob_item)[i]);
|
|
}
|
|
|
|
static int
|
|
II_setitem(arrayobject *ap, int i, PyObject *v)
|
|
{
|
|
unsigned long x;
|
|
if (PyLong_Check(v)) {
|
|
x = PyLong_AsUnsignedLong(v);
|
|
if (x == (unsigned long) -1 && PyErr_Occurred())
|
|
return -1;
|
|
}
|
|
else {
|
|
long y;
|
|
if (!PyArg_Parse(v, "l;array item must be integer", &y))
|
|
return -1;
|
|
if (y < 0) {
|
|
PyErr_SetString(PyExc_OverflowError,
|
|
"unsigned int is less than minimum");
|
|
return -1;
|
|
}
|
|
x = (unsigned long)y;
|
|
|
|
}
|
|
if (x > UINT_MAX) {
|
|
PyErr_SetString(PyExc_OverflowError,
|
|
"unsigned int is greater than maximum");
|
|
return -1;
|
|
}
|
|
|
|
if (i >= 0)
|
|
((unsigned int *)ap->ob_item)[i] = (unsigned int)x;
|
|
return 0;
|
|
}
|
|
|
|
static PyObject *
|
|
l_getitem(arrayobject *ap, int i)
|
|
{
|
|
return PyInt_FromLong(((long *)ap->ob_item)[i]);
|
|
}
|
|
|
|
static int
|
|
l_setitem(arrayobject *ap, int i, PyObject *v)
|
|
{
|
|
long x;
|
|
if (!PyArg_Parse(v, "l;array item must be integer", &x))
|
|
return -1;
|
|
if (i >= 0)
|
|
((long *)ap->ob_item)[i] = x;
|
|
return 0;
|
|
}
|
|
|
|
static PyObject *
|
|
LL_getitem(arrayobject *ap, int i)
|
|
{
|
|
return PyLong_FromUnsignedLong(((unsigned long *)ap->ob_item)[i]);
|
|
}
|
|
|
|
static int
|
|
LL_setitem(arrayobject *ap, int i, PyObject *v)
|
|
{
|
|
unsigned long x;
|
|
if (PyLong_Check(v)) {
|
|
x = PyLong_AsUnsignedLong(v);
|
|
if (x == (unsigned long) -1 && PyErr_Occurred())
|
|
return -1;
|
|
}
|
|
else {
|
|
long y;
|
|
if (!PyArg_Parse(v, "l;array item must be integer", &y))
|
|
return -1;
|
|
if (y < 0) {
|
|
PyErr_SetString(PyExc_OverflowError,
|
|
"unsigned long is less than minimum");
|
|
return -1;
|
|
}
|
|
x = (unsigned long)y;
|
|
|
|
}
|
|
if (x > ULONG_MAX) {
|
|
PyErr_SetString(PyExc_OverflowError,
|
|
"unsigned long is greater than maximum");
|
|
return -1;
|
|
}
|
|
|
|
if (i >= 0)
|
|
((unsigned long *)ap->ob_item)[i] = x;
|
|
return 0;
|
|
}
|
|
|
|
static PyObject *
|
|
f_getitem(arrayobject *ap, int i)
|
|
{
|
|
return PyFloat_FromDouble((double) ((float *)ap->ob_item)[i]);
|
|
}
|
|
|
|
static int
|
|
f_setitem(arrayobject *ap, int i, PyObject *v)
|
|
{
|
|
float x;
|
|
if (!PyArg_Parse(v, "f;array item must be float", &x))
|
|
return -1;
|
|
if (i >= 0)
|
|
((float *)ap->ob_item)[i] = x;
|
|
return 0;
|
|
}
|
|
|
|
static PyObject *
|
|
d_getitem(arrayobject *ap, int i)
|
|
{
|
|
return PyFloat_FromDouble(((double *)ap->ob_item)[i]);
|
|
}
|
|
|
|
static int
|
|
d_setitem(arrayobject *ap, int i, PyObject *v)
|
|
{
|
|
double x;
|
|
if (!PyArg_Parse(v, "d;array item must be float", &x))
|
|
return -1;
|
|
if (i >= 0)
|
|
((double *)ap->ob_item)[i] = x;
|
|
return 0;
|
|
}
|
|
|
|
/* Description of types */
|
|
static struct arraydescr descriptors[] = {
|
|
{'c', sizeof(char), c_getitem, c_setitem},
|
|
{'b', sizeof(char), b_getitem, b_setitem},
|
|
{'B', sizeof(char), BB_getitem, BB_setitem},
|
|
#ifdef Py_USING_UNICODE
|
|
{'u', sizeof(Py_UNICODE), u_getitem, u_setitem},
|
|
#endif
|
|
{'h', sizeof(short), h_getitem, h_setitem},
|
|
{'H', sizeof(short), HH_getitem, HH_setitem},
|
|
{'i', sizeof(int), i_getitem, i_setitem},
|
|
{'I', sizeof(int), II_getitem, II_setitem},
|
|
{'l', sizeof(long), l_getitem, l_setitem},
|
|
{'L', sizeof(long), LL_getitem, LL_setitem},
|
|
{'f', sizeof(float), f_getitem, f_setitem},
|
|
{'d', sizeof(double), d_getitem, d_setitem},
|
|
{'\0', 0, 0, 0} /* Sentinel */
|
|
};
|
|
|
|
/****************************************************************************
|
|
Implementations of array object methods.
|
|
****************************************************************************/
|
|
|
|
static PyObject *
|
|
newarrayobject(PyTypeObject *type, int size, struct arraydescr *descr)
|
|
{
|
|
arrayobject *op;
|
|
size_t nbytes;
|
|
|
|
if (size < 0) {
|
|
PyErr_BadInternalCall();
|
|
return NULL;
|
|
}
|
|
|
|
nbytes = size * descr->itemsize;
|
|
/* Check for overflow */
|
|
if (nbytes / descr->itemsize != (size_t)size) {
|
|
return PyErr_NoMemory();
|
|
}
|
|
op = (arrayobject *) type->tp_alloc(type, 0);
|
|
if (op == NULL) {
|
|
return NULL;
|
|
}
|
|
op->ob_size = size;
|
|
if (size <= 0) {
|
|
op->ob_item = NULL;
|
|
}
|
|
else {
|
|
op->ob_item = PyMem_NEW(char, nbytes);
|
|
if (op->ob_item == NULL) {
|
|
PyObject_Del(op);
|
|
return PyErr_NoMemory();
|
|
}
|
|
}
|
|
op->ob_descr = descr;
|
|
return (PyObject *) op;
|
|
}
|
|
|
|
static PyObject *
|
|
getarrayitem(PyObject *op, int i)
|
|
{
|
|
register arrayobject *ap;
|
|
assert(array_Check(op));
|
|
ap = (arrayobject *)op;
|
|
if (i < 0 || i >= ap->ob_size) {
|
|
PyErr_SetString(PyExc_IndexError, "array index out of range");
|
|
return NULL;
|
|
}
|
|
return (*ap->ob_descr->getitem)(ap, i);
|
|
}
|
|
|
|
static int
|
|
ins1(arrayobject *self, int where, PyObject *v)
|
|
{
|
|
char *items;
|
|
if (v == NULL) {
|
|
PyErr_BadInternalCall();
|
|
return -1;
|
|
}
|
|
if ((*self->ob_descr->setitem)(self, -1, v) < 0)
|
|
return -1;
|
|
items = self->ob_item;
|
|
NRESIZE(items, char, (self->ob_size+1) * self->ob_descr->itemsize);
|
|
if (items == NULL) {
|
|
PyErr_NoMemory();
|
|
return -1;
|
|
}
|
|
if (where < 0)
|
|
where = 0;
|
|
if (where > self->ob_size)
|
|
where = self->ob_size;
|
|
memmove(items + (where+1)*self->ob_descr->itemsize,
|
|
items + where*self->ob_descr->itemsize,
|
|
(self->ob_size-where)*self->ob_descr->itemsize);
|
|
self->ob_item = items;
|
|
self->ob_size++;
|
|
return (*self->ob_descr->setitem)(self, where, v);
|
|
}
|
|
|
|
/* Methods */
|
|
|
|
static void
|
|
array_dealloc(arrayobject *op)
|
|
{
|
|
if (op->ob_item != NULL)
|
|
PyMem_DEL(op->ob_item);
|
|
op->ob_type->tp_free((PyObject *)op);
|
|
}
|
|
|
|
static PyObject *
|
|
array_richcompare(PyObject *v, PyObject *w, int op)
|
|
{
|
|
arrayobject *va, *wa;
|
|
PyObject *vi = NULL;
|
|
PyObject *wi = NULL;
|
|
int i, k;
|
|
PyObject *res;
|
|
|
|
if (!array_Check(v) || !array_Check(w)) {
|
|
Py_INCREF(Py_NotImplemented);
|
|
return Py_NotImplemented;
|
|
}
|
|
|
|
va = (arrayobject *)v;
|
|
wa = (arrayobject *)w;
|
|
|
|
if (va->ob_size != wa->ob_size && (op == Py_EQ || op == Py_NE)) {
|
|
/* Shortcut: if the lengths differ, the arrays differ */
|
|
if (op == Py_EQ)
|
|
res = Py_False;
|
|
else
|
|
res = Py_True;
|
|
Py_INCREF(res);
|
|
return res;
|
|
}
|
|
|
|
/* Search for the first index where items are different */
|
|
k = 1;
|
|
for (i = 0; i < va->ob_size && i < wa->ob_size; i++) {
|
|
vi = getarrayitem(v, i);
|
|
wi = getarrayitem(w, i);
|
|
if (vi == NULL || wi == NULL) {
|
|
Py_XDECREF(vi);
|
|
Py_XDECREF(wi);
|
|
return NULL;
|
|
}
|
|
k = PyObject_RichCompareBool(vi, wi, Py_EQ);
|
|
if (k == 0)
|
|
break; /* Keeping vi and wi alive! */
|
|
Py_DECREF(vi);
|
|
Py_DECREF(wi);
|
|
if (k < 0)
|
|
return NULL;
|
|
}
|
|
|
|
if (k) {
|
|
/* No more items to compare -- compare sizes */
|
|
int vs = va->ob_size;
|
|
int ws = wa->ob_size;
|
|
int cmp;
|
|
switch (op) {
|
|
case Py_LT: cmp = vs < ws; break;
|
|
case Py_LE: cmp = vs <= ws; break;
|
|
case Py_EQ: cmp = vs == ws; break;
|
|
case Py_NE: cmp = vs != ws; break;
|
|
case Py_GT: cmp = vs > ws; break;
|
|
case Py_GE: cmp = vs >= ws; break;
|
|
default: return NULL; /* cannot happen */
|
|
}
|
|
if (cmp)
|
|
res = Py_True;
|
|
else
|
|
res = Py_False;
|
|
Py_INCREF(res);
|
|
return res;
|
|
}
|
|
|
|
/* We have an item that differs. First, shortcuts for EQ/NE */
|
|
if (op == Py_EQ) {
|
|
Py_INCREF(Py_False);
|
|
res = Py_False;
|
|
}
|
|
else if (op == Py_NE) {
|
|
Py_INCREF(Py_True);
|
|
res = Py_True;
|
|
}
|
|
else {
|
|
/* Compare the final item again using the proper operator */
|
|
res = PyObject_RichCompare(vi, wi, op);
|
|
}
|
|
Py_DECREF(vi);
|
|
Py_DECREF(wi);
|
|
return res;
|
|
}
|
|
|
|
static int
|
|
array_length(arrayobject *a)
|
|
{
|
|
return a->ob_size;
|
|
}
|
|
|
|
static PyObject *
|
|
array_item(arrayobject *a, int i)
|
|
{
|
|
if (i < 0 || i >= a->ob_size) {
|
|
PyErr_SetString(PyExc_IndexError, "array index out of range");
|
|
return NULL;
|
|
}
|
|
return getarrayitem((PyObject *)a, i);
|
|
}
|
|
|
|
static PyObject *
|
|
array_slice(arrayobject *a, int ilow, int ihigh)
|
|
{
|
|
arrayobject *np;
|
|
if (ilow < 0)
|
|
ilow = 0;
|
|
else if (ilow > a->ob_size)
|
|
ilow = a->ob_size;
|
|
if (ihigh < 0)
|
|
ihigh = 0;
|
|
if (ihigh < ilow)
|
|
ihigh = ilow;
|
|
else if (ihigh > a->ob_size)
|
|
ihigh = a->ob_size;
|
|
np = (arrayobject *) newarrayobject(&Arraytype, ihigh - ilow, a->ob_descr);
|
|
if (np == NULL)
|
|
return NULL;
|
|
memcpy(np->ob_item, a->ob_item + ilow * a->ob_descr->itemsize,
|
|
(ihigh-ilow) * a->ob_descr->itemsize);
|
|
return (PyObject *)np;
|
|
}
|
|
|
|
static PyObject *
|
|
array_concat(arrayobject *a, PyObject *bb)
|
|
{
|
|
int size;
|
|
arrayobject *np;
|
|
if (!array_Check(bb)) {
|
|
PyErr_Format(PyExc_TypeError,
|
|
"can only append array (not \"%.200s\") to array",
|
|
bb->ob_type->tp_name);
|
|
return NULL;
|
|
}
|
|
#define b ((arrayobject *)bb)
|
|
if (a->ob_descr != b->ob_descr) {
|
|
PyErr_BadArgument();
|
|
return NULL;
|
|
}
|
|
size = a->ob_size + b->ob_size;
|
|
np = (arrayobject *) newarrayobject(&Arraytype, size, a->ob_descr);
|
|
if (np == NULL) {
|
|
return NULL;
|
|
}
|
|
memcpy(np->ob_item, a->ob_item, a->ob_size*a->ob_descr->itemsize);
|
|
memcpy(np->ob_item + a->ob_size*a->ob_descr->itemsize,
|
|
b->ob_item, b->ob_size*b->ob_descr->itemsize);
|
|
return (PyObject *)np;
|
|
#undef b
|
|
}
|
|
|
|
static PyObject *
|
|
array_repeat(arrayobject *a, int n)
|
|
{
|
|
int i;
|
|
int size;
|
|
arrayobject *np;
|
|
char *p;
|
|
int nbytes;
|
|
if (n < 0)
|
|
n = 0;
|
|
size = a->ob_size * n;
|
|
np = (arrayobject *) newarrayobject(&Arraytype, size, a->ob_descr);
|
|
if (np == NULL)
|
|
return NULL;
|
|
p = np->ob_item;
|
|
nbytes = a->ob_size * a->ob_descr->itemsize;
|
|
for (i = 0; i < n; i++) {
|
|
memcpy(p, a->ob_item, nbytes);
|
|
p += nbytes;
|
|
}
|
|
return (PyObject *) np;
|
|
}
|
|
|
|
static int
|
|
array_ass_slice(arrayobject *a, int ilow, int ihigh, PyObject *v)
|
|
{
|
|
char *item;
|
|
int n; /* Size of replacement array */
|
|
int d; /* Change in size */
|
|
#define b ((arrayobject *)v)
|
|
if (v == NULL)
|
|
n = 0;
|
|
else if (array_Check(v)) {
|
|
n = b->ob_size;
|
|
if (a == b) {
|
|
/* Special case "a[i:j] = a" -- copy b first */
|
|
int ret;
|
|
v = array_slice(b, 0, n);
|
|
ret = array_ass_slice(a, ilow, ihigh, v);
|
|
Py_DECREF(v);
|
|
return ret;
|
|
}
|
|
if (b->ob_descr != a->ob_descr) {
|
|
PyErr_BadArgument();
|
|
return -1;
|
|
}
|
|
}
|
|
else {
|
|
PyErr_Format(PyExc_TypeError,
|
|
"can only assign array (not \"%.200s\") to array slice",
|
|
v->ob_type->tp_name);
|
|
return -1;
|
|
}
|
|
if (ilow < 0)
|
|
ilow = 0;
|
|
else if (ilow > a->ob_size)
|
|
ilow = a->ob_size;
|
|
if (ihigh < 0)
|
|
ihigh = 0;
|
|
if (ihigh < ilow)
|
|
ihigh = ilow;
|
|
else if (ihigh > a->ob_size)
|
|
ihigh = a->ob_size;
|
|
item = a->ob_item;
|
|
d = n - (ihigh-ilow);
|
|
if (d < 0) { /* Delete -d items */
|
|
memmove(item + (ihigh+d)*a->ob_descr->itemsize,
|
|
item + ihigh*a->ob_descr->itemsize,
|
|
(a->ob_size-ihigh)*a->ob_descr->itemsize);
|
|
a->ob_size += d;
|
|
PyMem_RESIZE(item, char, a->ob_size*a->ob_descr->itemsize);
|
|
/* Can't fail */
|
|
a->ob_item = item;
|
|
}
|
|
else if (d > 0) { /* Insert d items */
|
|
PyMem_RESIZE(item, char,
|
|
(a->ob_size + d)*a->ob_descr->itemsize);
|
|
if (item == NULL) {
|
|
PyErr_NoMemory();
|
|
return -1;
|
|
}
|
|
memmove(item + (ihigh+d)*a->ob_descr->itemsize,
|
|
item + ihigh*a->ob_descr->itemsize,
|
|
(a->ob_size-ihigh)*a->ob_descr->itemsize);
|
|
a->ob_item = item;
|
|
a->ob_size += d;
|
|
}
|
|
if (n > 0)
|
|
memcpy(item + ilow*a->ob_descr->itemsize, b->ob_item,
|
|
n*b->ob_descr->itemsize);
|
|
return 0;
|
|
#undef b
|
|
}
|
|
|
|
static int
|
|
array_ass_item(arrayobject *a, int i, PyObject *v)
|
|
{
|
|
if (i < 0 || i >= a->ob_size) {
|
|
PyErr_SetString(PyExc_IndexError,
|
|
"array assignment index out of range");
|
|
return -1;
|
|
}
|
|
if (v == NULL)
|
|
return array_ass_slice(a, i, i+1, v);
|
|
return (*a->ob_descr->setitem)(a, i, v);
|
|
}
|
|
|
|
static int
|
|
setarrayitem(PyObject *a, int i, PyObject *v)
|
|
{
|
|
assert(array_Check(a));
|
|
return array_ass_item((arrayobject *)a, i, v);
|
|
}
|
|
|
|
static int
|
|
array_do_extend(arrayobject *self, PyObject *bb)
|
|
{
|
|
int size;
|
|
|
|
if (!array_Check(bb)) {
|
|
PyErr_Format(PyExc_TypeError,
|
|
"can only extend array with array (not \"%.200s\")",
|
|
bb->ob_type->tp_name);
|
|
return -1;
|
|
}
|
|
#define b ((arrayobject *)bb)
|
|
if (self->ob_descr != b->ob_descr) {
|
|
PyErr_SetString(PyExc_TypeError,
|
|
"can only extend with array of same kind");
|
|
return -1;
|
|
}
|
|
size = self->ob_size + b->ob_size;
|
|
PyMem_RESIZE(self->ob_item, char, size*self->ob_descr->itemsize);
|
|
if (self->ob_item == NULL) {
|
|
PyObject_Del(self);
|
|
PyErr_NoMemory();
|
|
return -1;
|
|
}
|
|
memcpy(self->ob_item + self->ob_size*self->ob_descr->itemsize,
|
|
b->ob_item, b->ob_size*b->ob_descr->itemsize);
|
|
self->ob_size = size;
|
|
|
|
return 0;
|
|
#undef b
|
|
}
|
|
|
|
static PyObject *
|
|
array_inplace_concat(arrayobject *self, PyObject *bb)
|
|
{
|
|
if (array_do_extend(self, bb) == -1)
|
|
return NULL;
|
|
Py_INCREF(self);
|
|
return (PyObject *)self;
|
|
}
|
|
|
|
static PyObject *
|
|
array_inplace_repeat(arrayobject *self, int n)
|
|
{
|
|
char *items, *p;
|
|
int size, i;
|
|
|
|
if (self->ob_size > 0) {
|
|
if (n < 0)
|
|
n = 0;
|
|
items = self->ob_item;
|
|
size = self->ob_size * self->ob_descr->itemsize;
|
|
if (n == 0) {
|
|
PyMem_FREE(items);
|
|
self->ob_item = NULL;
|
|
self->ob_size = 0;
|
|
}
|
|
else {
|
|
PyMem_Resize(items, char, n * size);
|
|
if (items == NULL)
|
|
return PyErr_NoMemory();
|
|
p = items;
|
|
for (i = 1; i < n; i++) {
|
|
p += size;
|
|
memcpy(p, items, size);
|
|
}
|
|
self->ob_item = items;
|
|
self->ob_size *= n;
|
|
}
|
|
}
|
|
Py_INCREF(self);
|
|
return (PyObject *)self;
|
|
}
|
|
|
|
|
|
static PyObject *
|
|
ins(arrayobject *self, int where, PyObject *v)
|
|
{
|
|
if (ins1(self, where, v) != 0)
|
|
return NULL;
|
|
Py_INCREF(Py_None);
|
|
return Py_None;
|
|
}
|
|
|
|
static PyObject *
|
|
array_count(arrayobject *self, PyObject *v)
|
|
{
|
|
int count = 0;
|
|
int i;
|
|
|
|
for (i = 0; i < self->ob_size; i++) {
|
|
PyObject *selfi = getarrayitem((PyObject *)self, i);
|
|
int cmp = PyObject_RichCompareBool(selfi, v, Py_EQ);
|
|
Py_DECREF(selfi);
|
|
if (cmp > 0)
|
|
count++;
|
|
else if (cmp < 0)
|
|
return NULL;
|
|
}
|
|
return PyInt_FromLong((long)count);
|
|
}
|
|
|
|
PyDoc_STRVAR(count_doc,
|
|
"count(x)\n\
|
|
\n\
|
|
Return number of occurences of x in the array.");
|
|
|
|
static PyObject *
|
|
array_index(arrayobject *self, PyObject *v)
|
|
{
|
|
int i;
|
|
|
|
for (i = 0; i < self->ob_size; i++) {
|
|
PyObject *selfi = getarrayitem((PyObject *)self, i);
|
|
int cmp = PyObject_RichCompareBool(selfi, v, Py_EQ);
|
|
Py_DECREF(selfi);
|
|
if (cmp > 0) {
|
|
return PyInt_FromLong((long)i);
|
|
}
|
|
else if (cmp < 0)
|
|
return NULL;
|
|
}
|
|
PyErr_SetString(PyExc_ValueError, "array.index(x): x not in list");
|
|
return NULL;
|
|
}
|
|
|
|
PyDoc_STRVAR(index_doc,
|
|
"index(x)\n\
|
|
\n\
|
|
Return index of first occurence of x in the array.");
|
|
|
|
static int
|
|
array_contains(arrayobject *self, PyObject *v)
|
|
{
|
|
int i, cmp;
|
|
|
|
for (i = 0, cmp = 0 ; cmp == 0 && i < self->ob_size; i++) {
|
|
PyObject *selfi = getarrayitem((PyObject *)self, i);
|
|
cmp = PyObject_RichCompareBool(selfi, v, Py_EQ);
|
|
Py_DECREF(selfi);
|
|
}
|
|
return cmp;
|
|
}
|
|
|
|
static PyObject *
|
|
array_remove(arrayobject *self, PyObject *v)
|
|
{
|
|
int i;
|
|
|
|
for (i = 0; i < self->ob_size; i++) {
|
|
PyObject *selfi = getarrayitem((PyObject *)self,i);
|
|
int cmp = PyObject_RichCompareBool(selfi, v, Py_EQ);
|
|
Py_DECREF(selfi);
|
|
if (cmp > 0) {
|
|
if (array_ass_slice(self, i, i+1,
|
|
(PyObject *)NULL) != 0)
|
|
return NULL;
|
|
Py_INCREF(Py_None);
|
|
return Py_None;
|
|
}
|
|
else if (cmp < 0)
|
|
return NULL;
|
|
}
|
|
PyErr_SetString(PyExc_ValueError, "array.remove(x): x not in list");
|
|
return NULL;
|
|
}
|
|
|
|
PyDoc_STRVAR(remove_doc,
|
|
"remove(x)\n\
|
|
\n\
|
|
Remove the first occurence of x in the array.");
|
|
|
|
static PyObject *
|
|
array_pop(arrayobject *self, PyObject *args)
|
|
{
|
|
int i = -1;
|
|
PyObject *v;
|
|
if (!PyArg_ParseTuple(args, "|i:pop", &i))
|
|
return NULL;
|
|
if (self->ob_size == 0) {
|
|
/* Special-case most common failure cause */
|
|
PyErr_SetString(PyExc_IndexError, "pop from empty array");
|
|
return NULL;
|
|
}
|
|
if (i < 0)
|
|
i += self->ob_size;
|
|
if (i < 0 || i >= self->ob_size) {
|
|
PyErr_SetString(PyExc_IndexError, "pop index out of range");
|
|
return NULL;
|
|
}
|
|
v = getarrayitem((PyObject *)self,i);
|
|
if (array_ass_slice(self, i, i+1, (PyObject *)NULL) != 0) {
|
|
Py_DECREF(v);
|
|
return NULL;
|
|
}
|
|
return v;
|
|
}
|
|
|
|
PyDoc_STRVAR(pop_doc,
|
|
"pop([i])\n\
|
|
\n\
|
|
Return the i-th element and delete it from the array. i defaults to -1.");
|
|
|
|
static PyObject *
|
|
array_extend(arrayobject *self, PyObject *bb)
|
|
{
|
|
if (array_do_extend(self, bb) == -1)
|
|
return NULL;
|
|
Py_INCREF(Py_None);
|
|
return Py_None;
|
|
}
|
|
|
|
PyDoc_STRVAR(extend_doc,
|
|
"extend(array)\n\
|
|
\n\
|
|
Append array items to the end of the array.");
|
|
|
|
static PyObject *
|
|
array_insert(arrayobject *self, PyObject *args)
|
|
{
|
|
int i;
|
|
PyObject *v;
|
|
if (!PyArg_ParseTuple(args, "iO:insert", &i, &v))
|
|
return NULL;
|
|
return ins(self, i, v);
|
|
}
|
|
|
|
PyDoc_STRVAR(insert_doc,
|
|
"insert(i,x)\n\
|
|
\n\
|
|
Insert a new item x into the array before position i.");
|
|
|
|
|
|
static PyObject *
|
|
array_buffer_info(arrayobject *self, PyObject *unused)
|
|
{
|
|
PyObject* retval = NULL;
|
|
retval = PyTuple_New(2);
|
|
if (!retval)
|
|
return NULL;
|
|
|
|
PyTuple_SET_ITEM(retval, 0, PyLong_FromVoidPtr(self->ob_item));
|
|
PyTuple_SET_ITEM(retval, 1, PyInt_FromLong((long)(self->ob_size)));
|
|
|
|
return retval;
|
|
}
|
|
|
|
PyDoc_STRVAR(buffer_info_doc,
|
|
"buffer_info() -> (address, length)\n\
|
|
\n\
|
|
Return a tuple (address, length) giving the current memory address and\n\
|
|
the length in items of the buffer used to hold array's contents\n\
|
|
The length should be multiplied by the itemsize attribute to calculate\n\
|
|
the buffer length in bytes.");
|
|
|
|
|
|
static PyObject *
|
|
array_append(arrayobject *self, PyObject *v)
|
|
{
|
|
return ins(self, (int) self->ob_size, v);
|
|
}
|
|
|
|
PyDoc_STRVAR(append_doc,
|
|
"append(x)\n\
|
|
\n\
|
|
Append new value x to the end of the array.");
|
|
|
|
|
|
static PyObject *
|
|
array_byteswap(arrayobject *self, PyObject *unused)
|
|
{
|
|
char *p;
|
|
int i;
|
|
|
|
switch (self->ob_descr->itemsize) {
|
|
case 1:
|
|
break;
|
|
case 2:
|
|
for (p = self->ob_item, i = self->ob_size; --i >= 0; p += 2) {
|
|
char p0 = p[0];
|
|
p[0] = p[1];
|
|
p[1] = p0;
|
|
}
|
|
break;
|
|
case 4:
|
|
for (p = self->ob_item, i = self->ob_size; --i >= 0; p += 4) {
|
|
char p0 = p[0];
|
|
char p1 = p[1];
|
|
p[0] = p[3];
|
|
p[1] = p[2];
|
|
p[2] = p1;
|
|
p[3] = p0;
|
|
}
|
|
break;
|
|
case 8:
|
|
for (p = self->ob_item, i = self->ob_size; --i >= 0; p += 8) {
|
|
char p0 = p[0];
|
|
char p1 = p[1];
|
|
char p2 = p[2];
|
|
char p3 = p[3];
|
|
p[0] = p[7];
|
|
p[1] = p[6];
|
|
p[2] = p[5];
|
|
p[3] = p[4];
|
|
p[4] = p3;
|
|
p[5] = p2;
|
|
p[6] = p1;
|
|
p[7] = p0;
|
|
}
|
|
break;
|
|
default:
|
|
PyErr_SetString(PyExc_RuntimeError,
|
|
"don't know how to byteswap this array type");
|
|
return NULL;
|
|
}
|
|
Py_INCREF(Py_None);
|
|
return Py_None;
|
|
}
|
|
|
|
PyDoc_STRVAR(byteswap_doc,
|
|
"byteswap()\n\
|
|
\n\
|
|
Byteswap all items of the array. If the items in the array are not 1, 2,\n\
|
|
4, or 8 bytes in size, RuntimeError is raised.");
|
|
|
|
static PyObject *
|
|
array_reverse(arrayobject *self, PyObject *unused)
|
|
{
|
|
register int itemsize = self->ob_descr->itemsize;
|
|
register char *p, *q;
|
|
/* little buffer to hold items while swapping */
|
|
char tmp[256]; /* 8 is probably enough -- but why skimp */
|
|
assert(itemsize <= sizeof(tmp));
|
|
|
|
if (self->ob_size > 1) {
|
|
for (p = self->ob_item,
|
|
q = self->ob_item + (self->ob_size - 1)*itemsize;
|
|
p < q;
|
|
p += itemsize, q -= itemsize) {
|
|
/* memory areas guaranteed disjoint, so memcpy
|
|
* is safe (& memmove may be slower).
|
|
*/
|
|
memcpy(tmp, p, itemsize);
|
|
memcpy(p, q, itemsize);
|
|
memcpy(q, tmp, itemsize);
|
|
}
|
|
}
|
|
|
|
Py_INCREF(Py_None);
|
|
return Py_None;
|
|
}
|
|
|
|
PyDoc_STRVAR(reverse_doc,
|
|
"reverse()\n\
|
|
\n\
|
|
Reverse the order of the items in the array.");
|
|
|
|
static PyObject *
|
|
array_fromfile(arrayobject *self, PyObject *args)
|
|
{
|
|
PyObject *f;
|
|
int n;
|
|
FILE *fp;
|
|
if (!PyArg_ParseTuple(args, "Oi:fromfile", &f, &n))
|
|
return NULL;
|
|
fp = PyFile_AsFile(f);
|
|
if (fp == NULL) {
|
|
PyErr_SetString(PyExc_TypeError, "arg1 must be open file");
|
|
return NULL;
|
|
}
|
|
if (n > 0) {
|
|
char *item = self->ob_item;
|
|
int itemsize = self->ob_descr->itemsize;
|
|
size_t nread;
|
|
int newlength;
|
|
size_t newbytes;
|
|
/* Be careful here about overflow */
|
|
if ((newlength = self->ob_size + n) <= 0 ||
|
|
(newbytes = newlength * itemsize) / itemsize !=
|
|
(size_t)newlength)
|
|
goto nomem;
|
|
PyMem_RESIZE(item, char, newbytes);
|
|
if (item == NULL) {
|
|
nomem:
|
|
PyErr_NoMemory();
|
|
return NULL;
|
|
}
|
|
self->ob_item = item;
|
|
self->ob_size += n;
|
|
nread = fread(item + (self->ob_size - n) * itemsize,
|
|
itemsize, n, fp);
|
|
if (nread < (size_t)n) {
|
|
self->ob_size -= (n - nread);
|
|
PyMem_RESIZE(item, char, self->ob_size*itemsize);
|
|
self->ob_item = item;
|
|
PyErr_SetString(PyExc_EOFError,
|
|
"not enough items in file");
|
|
return NULL;
|
|
}
|
|
}
|
|
Py_INCREF(Py_None);
|
|
return Py_None;
|
|
}
|
|
|
|
PyDoc_STRVAR(fromfile_doc,
|
|
"fromfile(f, n)\n\
|
|
\n\
|
|
Read n objects from the file object f and append them to the end of the\n\
|
|
array. Also called as read.");
|
|
|
|
|
|
static PyObject *
|
|
array_tofile(arrayobject *self, PyObject *f)
|
|
{
|
|
FILE *fp;
|
|
|
|
fp = PyFile_AsFile(f);
|
|
if (fp == NULL) {
|
|
PyErr_SetString(PyExc_TypeError, "arg must be open file");
|
|
return NULL;
|
|
}
|
|
if (self->ob_size > 0) {
|
|
if (fwrite(self->ob_item, self->ob_descr->itemsize,
|
|
self->ob_size, fp) != (size_t)self->ob_size) {
|
|
PyErr_SetFromErrno(PyExc_IOError);
|
|
clearerr(fp);
|
|
return NULL;
|
|
}
|
|
}
|
|
Py_INCREF(Py_None);
|
|
return Py_None;
|
|
}
|
|
|
|
PyDoc_STRVAR(tofile_doc,
|
|
"tofile(f)\n\
|
|
\n\
|
|
Write all items (as machine values) to the file object f. Also called as\n\
|
|
write.");
|
|
|
|
|
|
static PyObject *
|
|
array_fromlist(arrayobject *self, PyObject *list)
|
|
{
|
|
int n;
|
|
int itemsize = self->ob_descr->itemsize;
|
|
|
|
if (!PyList_Check(list)) {
|
|
PyErr_SetString(PyExc_TypeError, "arg must be list");
|
|
return NULL;
|
|
}
|
|
n = PyList_Size(list);
|
|
if (n > 0) {
|
|
char *item = self->ob_item;
|
|
int i;
|
|
PyMem_RESIZE(item, char, (self->ob_size + n) * itemsize);
|
|
if (item == NULL) {
|
|
PyErr_NoMemory();
|
|
return NULL;
|
|
}
|
|
self->ob_item = item;
|
|
self->ob_size += n;
|
|
for (i = 0; i < n; i++) {
|
|
PyObject *v = PyList_GetItem(list, i);
|
|
if ((*self->ob_descr->setitem)(self,
|
|
self->ob_size - n + i, v) != 0) {
|
|
self->ob_size -= n;
|
|
PyMem_RESIZE(item, char,
|
|
self->ob_size * itemsize);
|
|
self->ob_item = item;
|
|
return NULL;
|
|
}
|
|
}
|
|
}
|
|
Py_INCREF(Py_None);
|
|
return Py_None;
|
|
}
|
|
|
|
PyDoc_STRVAR(fromlist_doc,
|
|
"fromlist(list)\n\
|
|
\n\
|
|
Append items to array from list.");
|
|
|
|
|
|
static PyObject *
|
|
array_tolist(arrayobject *self, PyObject *unused)
|
|
{
|
|
PyObject *list = PyList_New(self->ob_size);
|
|
int i;
|
|
|
|
if (list == NULL)
|
|
return NULL;
|
|
for (i = 0; i < self->ob_size; i++) {
|
|
PyObject *v = getarrayitem((PyObject *)self, i);
|
|
if (v == NULL) {
|
|
Py_DECREF(list);
|
|
return NULL;
|
|
}
|
|
PyList_SetItem(list, i, v);
|
|
}
|
|
return list;
|
|
}
|
|
|
|
PyDoc_STRVAR(tolist_doc,
|
|
"tolist() -> list\n\
|
|
\n\
|
|
Convert array to an ordinary list with the same items.");
|
|
|
|
|
|
static PyObject *
|
|
array_fromstring(arrayobject *self, PyObject *args)
|
|
{
|
|
char *str;
|
|
int n;
|
|
int itemsize = self->ob_descr->itemsize;
|
|
if (!PyArg_ParseTuple(args, "s#:fromstring", &str, &n))
|
|
return NULL;
|
|
if (n % itemsize != 0) {
|
|
PyErr_SetString(PyExc_ValueError,
|
|
"string length not a multiple of item size");
|
|
return NULL;
|
|
}
|
|
n = n / itemsize;
|
|
if (n > 0) {
|
|
char *item = self->ob_item;
|
|
PyMem_RESIZE(item, char, (self->ob_size + n) * itemsize);
|
|
if (item == NULL) {
|
|
PyErr_NoMemory();
|
|
return NULL;
|
|
}
|
|
self->ob_item = item;
|
|
self->ob_size += n;
|
|
memcpy(item + (self->ob_size - n) * itemsize,
|
|
str, itemsize*n);
|
|
}
|
|
Py_INCREF(Py_None);
|
|
return Py_None;
|
|
}
|
|
|
|
PyDoc_STRVAR(fromstring_doc,
|
|
"fromstring(string)\n\
|
|
\n\
|
|
Appends items from the string, interpreting it as an array of machine\n\
|
|
values,as if it had been read from a file using the fromfile() method).");
|
|
|
|
|
|
static PyObject *
|
|
array_tostring(arrayobject *self, PyObject *unused)
|
|
{
|
|
return PyString_FromStringAndSize(self->ob_item,
|
|
self->ob_size * self->ob_descr->itemsize);
|
|
}
|
|
|
|
PyDoc_STRVAR(tostring_doc,
|
|
"tostring() -> string\n\
|
|
\n\
|
|
Convert the array to an array of machine values and return the string\n\
|
|
representation.");
|
|
|
|
|
|
|
|
#ifdef Py_USING_UNICODE
|
|
static PyObject *
|
|
array_fromunicode(arrayobject *self, PyObject *args)
|
|
{
|
|
Py_UNICODE *ustr;
|
|
int n;
|
|
|
|
if (!PyArg_ParseTuple(args, "u#:fromunicode", &ustr, &n))
|
|
return NULL;
|
|
if (self->ob_descr->typecode != 'u') {
|
|
PyErr_SetString(PyExc_ValueError,
|
|
"fromunicode() may only be called on "
|
|
"type 'u' arrays");
|
|
return NULL;
|
|
}
|
|
if (n > 0) {
|
|
Py_UNICODE *item = (Py_UNICODE *) self->ob_item;
|
|
PyMem_RESIZE(item, Py_UNICODE, self->ob_size + n);
|
|
if (item == NULL) {
|
|
PyErr_NoMemory();
|
|
return NULL;
|
|
}
|
|
self->ob_item = (char *) item;
|
|
self->ob_size += n;
|
|
memcpy(item + self->ob_size - n,
|
|
ustr, n * sizeof(Py_UNICODE));
|
|
}
|
|
|
|
Py_INCREF(Py_None);
|
|
return Py_None;
|
|
}
|
|
|
|
PyDoc_STRVAR(fromunicode_doc,
|
|
"fromunicode(ustr)\n\
|
|
\n\
|
|
Extends this array with data from the unicode string ustr.\n\
|
|
The array must be a type 'u' array; otherwise a ValueError\n\
|
|
is raised. Use array.fromstring(ustr.decode(...)) to\n\
|
|
append Unicode data to an array of some other type.");
|
|
|
|
|
|
static PyObject *
|
|
array_tounicode(arrayobject *self, PyObject *unused)
|
|
{
|
|
if (self->ob_descr->typecode != 'u') {
|
|
PyErr_SetString(PyExc_ValueError,
|
|
"tounicode() may only be called on type 'u' arrays");
|
|
return NULL;
|
|
}
|
|
return PyUnicode_FromUnicode((Py_UNICODE *) self->ob_item, self->ob_size);
|
|
}
|
|
|
|
PyDoc_STRVAR(tounicode_doc,
|
|
"tounicode() -> unicode\n\
|
|
\n\
|
|
Convert the array to a unicode string. The array must be\n\
|
|
a type 'u' array; otherwise a ValueError is raised. Use\n\
|
|
array.tostring().decode() to obtain a unicode string from\n\
|
|
an array of some other type.");
|
|
|
|
#endif /* Py_USING_UNICODE */
|
|
|
|
|
|
static PyObject *
|
|
array_get_typecode(arrayobject *a, void *closure)
|
|
{
|
|
char tc = a->ob_descr->typecode;
|
|
return PyString_FromStringAndSize(&tc, 1);
|
|
}
|
|
|
|
static PyObject *
|
|
array_get_itemsize(arrayobject *a, void *closure)
|
|
{
|
|
return PyInt_FromLong((long)a->ob_descr->itemsize);
|
|
}
|
|
|
|
static PyGetSetDef array_getsets [] = {
|
|
{"typecode", (getter) array_get_typecode, NULL,
|
|
"the typecode character used to create the array"},
|
|
{"itemsize", (getter) array_get_itemsize, NULL,
|
|
"the size, in bytes, of one array item"},
|
|
{NULL}
|
|
};
|
|
|
|
PyMethodDef array_methods[] = {
|
|
{"append", (PyCFunction)array_append, METH_O,
|
|
append_doc},
|
|
{"buffer_info", (PyCFunction)array_buffer_info, METH_NOARGS,
|
|
buffer_info_doc},
|
|
{"byteswap", (PyCFunction)array_byteswap, METH_NOARGS,
|
|
byteswap_doc},
|
|
{"count", (PyCFunction)array_count, METH_O,
|
|
count_doc},
|
|
{"extend", (PyCFunction)array_extend, METH_O,
|
|
extend_doc},
|
|
{"fromfile", (PyCFunction)array_fromfile, METH_VARARGS,
|
|
fromfile_doc},
|
|
{"fromlist", (PyCFunction)array_fromlist, METH_O,
|
|
fromlist_doc},
|
|
{"fromstring", (PyCFunction)array_fromstring, METH_VARARGS,
|
|
fromstring_doc},
|
|
#ifdef Py_USING_UNICODE
|
|
{"fromunicode", (PyCFunction)array_fromunicode, METH_VARARGS,
|
|
fromunicode_doc},
|
|
#endif
|
|
{"index", (PyCFunction)array_index, METH_O,
|
|
index_doc},
|
|
{"insert", (PyCFunction)array_insert, METH_VARARGS,
|
|
insert_doc},
|
|
{"pop", (PyCFunction)array_pop, METH_VARARGS,
|
|
pop_doc},
|
|
{"read", (PyCFunction)array_fromfile, METH_VARARGS,
|
|
fromfile_doc},
|
|
{"remove", (PyCFunction)array_remove, METH_O,
|
|
remove_doc},
|
|
{"reverse", (PyCFunction)array_reverse, METH_NOARGS,
|
|
reverse_doc},
|
|
/* {"sort", (PyCFunction)array_sort, METH_VARARGS,
|
|
sort_doc},*/
|
|
{"tofile", (PyCFunction)array_tofile, METH_O,
|
|
tofile_doc},
|
|
{"tolist", (PyCFunction)array_tolist, METH_NOARGS,
|
|
tolist_doc},
|
|
{"tostring", (PyCFunction)array_tostring, METH_NOARGS,
|
|
tostring_doc},
|
|
#ifdef Py_USING_UNICODE
|
|
{"tounicode", (PyCFunction)array_tounicode, METH_NOARGS,
|
|
tounicode_doc},
|
|
#endif
|
|
{"write", (PyCFunction)array_tofile, METH_O,
|
|
tofile_doc},
|
|
{NULL, NULL} /* sentinel */
|
|
};
|
|
|
|
static PyObject *
|
|
array_repr(arrayobject *a)
|
|
{
|
|
char buf[256], typecode;
|
|
PyObject *s, *t, *v = NULL;
|
|
int len;
|
|
|
|
len = a->ob_size;
|
|
typecode = a->ob_descr->typecode;
|
|
if (len == 0) {
|
|
PyOS_snprintf(buf, sizeof(buf), "array('%c')", typecode);
|
|
return PyString_FromString(buf);
|
|
}
|
|
|
|
if (typecode == 'c')
|
|
v = array_tostring(a, NULL);
|
|
#ifdef Py_USING_UNICODE
|
|
else if (typecode == 'u')
|
|
v = array_tounicode(a, NULL);
|
|
#endif
|
|
else
|
|
v = array_tolist(a, NULL);
|
|
t = PyObject_Repr(v);
|
|
Py_XDECREF(v);
|
|
|
|
PyOS_snprintf(buf, sizeof(buf), "array('%c', ", typecode);
|
|
s = PyString_FromString(buf);
|
|
PyString_ConcatAndDel(&s, t);
|
|
PyString_ConcatAndDel(&s, PyString_FromString(")"));
|
|
return s;
|
|
}
|
|
|
|
static PyObject*
|
|
array_subscr(arrayobject* self, PyObject* item)
|
|
{
|
|
if (PyInt_Check(item)) {
|
|
long i = PyInt_AS_LONG(item);
|
|
if (i < 0)
|
|
i += self->ob_size;
|
|
return array_item(self, i);
|
|
}
|
|
else if (PyLong_Check(item)) {
|
|
long i = PyLong_AsLong(item);
|
|
if (i == -1 && PyErr_Occurred())
|
|
return NULL;
|
|
if (i < 0)
|
|
i += self->ob_size;
|
|
return array_item(self, i);
|
|
}
|
|
else if (PySlice_Check(item)) {
|
|
int start, stop, step, slicelength, cur, i;
|
|
PyObject* result;
|
|
arrayobject* ar;
|
|
int itemsize = self->ob_descr->itemsize;
|
|
|
|
if (PySlice_GetIndicesEx((PySliceObject*)item, self->ob_size,
|
|
&start, &stop, &step, &slicelength) < 0) {
|
|
return NULL;
|
|
}
|
|
|
|
if (slicelength <= 0) {
|
|
return newarrayobject(&Arraytype, 0, self->ob_descr);
|
|
}
|
|
else {
|
|
result = newarrayobject(&Arraytype, slicelength, self->ob_descr);
|
|
if (!result) return NULL;
|
|
|
|
ar = (arrayobject*)result;
|
|
|
|
for (cur = start, i = 0; i < slicelength;
|
|
cur += step, i++) {
|
|
memcpy(ar->ob_item + i*itemsize,
|
|
self->ob_item + cur*itemsize,
|
|
itemsize);
|
|
}
|
|
|
|
return result;
|
|
}
|
|
}
|
|
else {
|
|
PyErr_SetString(PyExc_TypeError,
|
|
"list indices must be integers");
|
|
return NULL;
|
|
}
|
|
}
|
|
|
|
static int
|
|
array_ass_subscr(arrayobject* self, PyObject* item, PyObject* value)
|
|
{
|
|
if (PyInt_Check(item)) {
|
|
long i = PyInt_AS_LONG(item);
|
|
if (i < 0)
|
|
i += self->ob_size;
|
|
return array_ass_item(self, i, value);
|
|
}
|
|
else if (PyLong_Check(item)) {
|
|
long i = PyLong_AsLong(item);
|
|
if (i == -1 && PyErr_Occurred())
|
|
return -1;
|
|
if (i < 0)
|
|
i += self->ob_size;
|
|
return array_ass_item(self, i, value);
|
|
}
|
|
else if (PySlice_Check(item)) {
|
|
int start, stop, step, slicelength;
|
|
int itemsize = self->ob_descr->itemsize;
|
|
|
|
if (PySlice_GetIndicesEx((PySliceObject*)item, self->ob_size,
|
|
&start, &stop, &step, &slicelength) < 0) {
|
|
return -1;
|
|
}
|
|
|
|
/* treat A[slice(a,b)] = v _exactly_ like A[a:b] = v */
|
|
if (step == 1 && ((PySliceObject*)item)->step == Py_None)
|
|
return array_ass_slice(self, start, stop, value);
|
|
|
|
if (value == NULL) {
|
|
/* delete slice */
|
|
int cur, i, extra;
|
|
|
|
if (slicelength <= 0)
|
|
return 0;
|
|
|
|
if (step < 0) {
|
|
stop = start + 1;
|
|
start = stop + step*(slicelength - 1) - 1;
|
|
step = -step;
|
|
}
|
|
|
|
for (cur = start, i = 0; i < slicelength - 1;
|
|
cur += step, i++) {
|
|
memmove(self->ob_item + (cur - i)*itemsize,
|
|
self->ob_item + (cur + 1)*itemsize,
|
|
(step - 1) * itemsize);
|
|
}
|
|
extra = self->ob_size - (cur + 1);
|
|
if (extra > 0) {
|
|
memmove(self->ob_item + (cur - i)*itemsize,
|
|
self->ob_item + (cur + 1)*itemsize,
|
|
extra*itemsize);
|
|
}
|
|
|
|
self->ob_size -= slicelength;
|
|
self->ob_item = PyMem_REALLOC(self->ob_item, itemsize*self->ob_size);
|
|
|
|
|
|
return 0;
|
|
}
|
|
else {
|
|
/* assign slice */
|
|
int cur, i;
|
|
arrayobject* av;
|
|
|
|
if (!array_Check(value)) {
|
|
PyErr_Format(PyExc_TypeError,
|
|
"must assign array (not \"%.200s\") to slice",
|
|
value->ob_type->tp_name);
|
|
return -1;
|
|
}
|
|
|
|
av = (arrayobject*)value;
|
|
|
|
if (av->ob_size != slicelength) {
|
|
PyErr_Format(PyExc_ValueError,
|
|
"attempt to assign array of size %d to extended slice of size %d",
|
|
av->ob_size, slicelength);
|
|
return -1;
|
|
}
|
|
|
|
if (!slicelength)
|
|
return 0;
|
|
|
|
/* protect against a[::-1] = a */
|
|
if (self == av) {
|
|
value = array_slice(av, 0, av->ob_size);
|
|
av = (arrayobject*)value;
|
|
}
|
|
else {
|
|
Py_INCREF(value);
|
|
}
|
|
|
|
for (cur = start, i = 0; i < slicelength;
|
|
cur += step, i++) {
|
|
memcpy(self->ob_item + cur*itemsize,
|
|
av->ob_item + i*itemsize,
|
|
itemsize);
|
|
}
|
|
|
|
Py_DECREF(value);
|
|
|
|
return 0;
|
|
}
|
|
}
|
|
else {
|
|
PyErr_SetString(PyExc_TypeError,
|
|
"list indices must be integers");
|
|
return -1;
|
|
}
|
|
}
|
|
|
|
static PyMappingMethods array_as_mapping = {
|
|
(inquiry)array_length,
|
|
(binaryfunc)array_subscr,
|
|
(objobjargproc)array_ass_subscr
|
|
};
|
|
|
|
static int
|
|
array_buffer_getreadbuf(arrayobject *self, int index, const void **ptr)
|
|
{
|
|
if ( index != 0 ) {
|
|
PyErr_SetString(PyExc_SystemError,
|
|
"Accessing non-existent array segment");
|
|
return -1;
|
|
}
|
|
*ptr = (void *)self->ob_item;
|
|
return self->ob_size*self->ob_descr->itemsize;
|
|
}
|
|
|
|
static int
|
|
array_buffer_getwritebuf(arrayobject *self, int index, const void **ptr)
|
|
{
|
|
if ( index != 0 ) {
|
|
PyErr_SetString(PyExc_SystemError,
|
|
"Accessing non-existent array segment");
|
|
return -1;
|
|
}
|
|
*ptr = (void *)self->ob_item;
|
|
return self->ob_size*self->ob_descr->itemsize;
|
|
}
|
|
|
|
static int
|
|
array_buffer_getsegcount(arrayobject *self, int *lenp)
|
|
{
|
|
if ( lenp )
|
|
*lenp = self->ob_size*self->ob_descr->itemsize;
|
|
return 1;
|
|
}
|
|
|
|
static PySequenceMethods array_as_sequence = {
|
|
(inquiry)array_length, /*sq_length*/
|
|
(binaryfunc)array_concat, /*sq_concat*/
|
|
(intargfunc)array_repeat, /*sq_repeat*/
|
|
(intargfunc)array_item, /*sq_item*/
|
|
(intintargfunc)array_slice, /*sq_slice*/
|
|
(intobjargproc)array_ass_item, /*sq_ass_item*/
|
|
(intintobjargproc)array_ass_slice, /*sq_ass_slice*/
|
|
(objobjproc)array_contains, /*sq_contains*/
|
|
(binaryfunc)array_inplace_concat, /*sq_inplace_concat*/
|
|
(intargfunc)array_inplace_repeat /*sq_inplace_repeat*/
|
|
};
|
|
|
|
static PyBufferProcs array_as_buffer = {
|
|
(getreadbufferproc)array_buffer_getreadbuf,
|
|
(getwritebufferproc)array_buffer_getwritebuf,
|
|
(getsegcountproc)array_buffer_getsegcount,
|
|
};
|
|
|
|
static PyObject *
|
|
array_new(PyTypeObject *type, PyObject *args, PyObject *kwds)
|
|
{
|
|
char c;
|
|
PyObject *initial = NULL;
|
|
struct arraydescr *descr;
|
|
|
|
if (kwds != NULL) {
|
|
int i = PyObject_Length(kwds);
|
|
if (i < 0)
|
|
return NULL;
|
|
else if (i > 0) {
|
|
PyErr_SetString(PyExc_TypeError,
|
|
"array.array constructor takes "
|
|
"no keyword arguments");
|
|
return NULL;
|
|
}
|
|
}
|
|
|
|
if (!PyArg_ParseTuple(args, "c|O:array", &c, &initial))
|
|
return NULL;
|
|
|
|
if (!(initial == NULL || PyList_Check(initial)
|
|
|| PyString_Check(initial) || PyTuple_Check(initial)
|
|
|| (c == 'u' && PyUnicode_Check(initial)))) {
|
|
PyErr_SetString(PyExc_TypeError,
|
|
"array initializer must be list or string");
|
|
return NULL;
|
|
}
|
|
for (descr = descriptors; descr->typecode != '\0'; descr++) {
|
|
if (descr->typecode == c) {
|
|
PyObject *a;
|
|
int len;
|
|
|
|
if (initial == NULL || !(PyList_Check(initial)
|
|
|| PyTuple_Check(initial)))
|
|
len = 0;
|
|
else
|
|
len = PySequence_Size(initial);
|
|
|
|
a = newarrayobject(type, len, descr);
|
|
if (a == NULL)
|
|
return NULL;
|
|
|
|
if (len > 0) {
|
|
int i;
|
|
for (i = 0; i < len; i++) {
|
|
PyObject *v =
|
|
PySequence_GetItem(initial, i);
|
|
if (setarrayitem(a, i, v) != 0) {
|
|
Py_DECREF(a);
|
|
return NULL;
|
|
}
|
|
}
|
|
}
|
|
if (initial != NULL && PyString_Check(initial)) {
|
|
PyObject *t_initial = Py_BuildValue("(O)",
|
|
initial);
|
|
PyObject *v =
|
|
array_fromstring((arrayobject *)a,
|
|
t_initial);
|
|
Py_DECREF(t_initial);
|
|
if (v == NULL) {
|
|
Py_DECREF(a);
|
|
return NULL;
|
|
}
|
|
Py_DECREF(v);
|
|
#ifdef Py_USING_UNICODE
|
|
} else if (initial != NULL && PyUnicode_Check(initial)) {
|
|
int n = PyUnicode_GET_DATA_SIZE(initial);
|
|
if (n > 0) {
|
|
arrayobject *self = (arrayobject *)a;
|
|
char *item = self->ob_item;
|
|
item = PyMem_Realloc(item, n);
|
|
if (item == NULL) {
|
|
PyErr_NoMemory();
|
|
Py_DECREF(a);
|
|
return NULL;
|
|
}
|
|
self->ob_item = item;
|
|
self->ob_size = n / sizeof(Py_UNICODE);
|
|
memcpy(item, PyUnicode_AS_DATA(initial), n);
|
|
}
|
|
#endif
|
|
}
|
|
return a;
|
|
}
|
|
}
|
|
PyErr_SetString(PyExc_ValueError,
|
|
"bad typecode (must be c, b, B, u, h, H, i, I, l, L, f or d)");
|
|
return NULL;
|
|
}
|
|
|
|
|
|
PyDoc_STRVAR(module_doc,
|
|
"This module defines an object type which can efficiently represent\n\
|
|
an array of basic values: characters, integers, floating point\n\
|
|
numbers. Arrays are sequence types and behave very much like lists,\n\
|
|
except that the type of objects stored in them is constrained. The\n\
|
|
type is specified at object creation time by using a type code, which\n\
|
|
is a single character. The following type codes are defined:\n\
|
|
\n\
|
|
Type code C Type Minimum size in bytes \n\
|
|
'c' character 1 \n\
|
|
'b' signed integer 1 \n\
|
|
'B' unsigned integer 1 \n\
|
|
'u' Unicode character 2 \n\
|
|
'h' signed integer 2 \n\
|
|
'H' unsigned integer 2 \n\
|
|
'i' signed integer 2 \n\
|
|
'I' unsigned integer 2 \n\
|
|
'l' signed integer 4 \n\
|
|
'L' unsigned integer 4 \n\
|
|
'f' floating point 4 \n\
|
|
'd' floating point 8 \n\
|
|
\n\
|
|
The constructor is:\n\
|
|
\n\
|
|
array(typecode [, initializer]) -- create a new array\n\
|
|
");
|
|
|
|
PyDoc_STRVAR(arraytype_doc,
|
|
"array(typecode [, initializer]) -> array\n\
|
|
\n\
|
|
Return a new array whose items are restricted by typecode, and\n\
|
|
initialized from the optional initializer value, which must be a list\n\
|
|
or a string.\n\
|
|
\n\
|
|
Arrays represent basic values and behave very much like lists, except\n\
|
|
the type of objects stored in them is constrained.\n\
|
|
\n\
|
|
Methods:\n\
|
|
\n\
|
|
append() -- append a new item to the end of the array\n\
|
|
buffer_info() -- return information giving the current memory info\n\
|
|
byteswap() -- byteswap all the items of the array\n\
|
|
count() -- return number of occurences of an object\n\
|
|
extend() -- extend array by appending array elements\n\
|
|
fromfile() -- read items from a file object\n\
|
|
fromlist() -- append items from the list\n\
|
|
fromstring() -- append items from the string\n\
|
|
index() -- return index of first occurence of an object\n\
|
|
insert() -- insert a new item into the array at a provided position\n\
|
|
pop() -- remove and return item (default last)\n\
|
|
read() -- DEPRECATED, use fromfile()\n\
|
|
remove() -- remove first occurence of an object\n\
|
|
reverse() -- reverse the order of the items in the array\n\
|
|
tofile() -- write all items to a file object\n\
|
|
tolist() -- return the array converted to an ordinary list\n\
|
|
tostring() -- return the array converted to a string\n\
|
|
write() -- DEPRECATED, use tofile()\n\
|
|
\n\
|
|
Attributes:\n\
|
|
\n\
|
|
typecode -- the typecode character used to create the array\n\
|
|
itemsize -- the length in bytes of one array item\n\
|
|
");
|
|
|
|
static PyObject *array_iter(arrayobject *ao);
|
|
|
|
static PyTypeObject Arraytype = {
|
|
PyObject_HEAD_INIT(NULL)
|
|
0,
|
|
"array.array",
|
|
sizeof(arrayobject),
|
|
0,
|
|
(destructor)array_dealloc, /* tp_dealloc */
|
|
0, /* tp_print */
|
|
0, /* tp_getattr */
|
|
0, /* tp_setattr */
|
|
0, /* tp_compare */
|
|
(reprfunc)array_repr, /* tp_repr */
|
|
0, /* tp_as _number*/
|
|
&array_as_sequence, /* tp_as _sequence*/
|
|
&array_as_mapping, /* tp_as _mapping*/
|
|
0, /* tp_hash */
|
|
0, /* tp_call */
|
|
0, /* tp_str */
|
|
PyObject_GenericGetAttr, /* tp_getattro */
|
|
0, /* tp_setattro */
|
|
&array_as_buffer, /* tp_as_buffer*/
|
|
Py_TPFLAGS_DEFAULT | Py_TPFLAGS_BASETYPE, /* tp_flags */
|
|
arraytype_doc, /* tp_doc */
|
|
0, /* tp_traverse */
|
|
0, /* tp_clear */
|
|
array_richcompare, /* tp_richcompare */
|
|
0, /* tp_weaklistoffset */
|
|
(getiterfunc)array_iter, /* tp_iter */
|
|
0, /* tp_iternext */
|
|
array_methods, /* tp_methods */
|
|
0, /* tp_members */
|
|
array_getsets, /* 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 */
|
|
array_new, /* tp_new */
|
|
PyObject_Del, /* tp_free */
|
|
};
|
|
|
|
|
|
/*********************** Array Iterator **************************/
|
|
|
|
typedef struct {
|
|
PyObject_HEAD
|
|
long index;
|
|
arrayobject *ao;
|
|
PyObject * (*getitem)(struct arrayobject *, int);
|
|
} arrayiterobject;
|
|
|
|
static PyTypeObject PyArrayIter_Type;
|
|
|
|
#define PyArrayIter_Check(op) PyObject_TypeCheck(op, &PyArrayIter_Type)
|
|
|
|
static PyObject *
|
|
array_iter(arrayobject *ao)
|
|
{
|
|
arrayiterobject *it;
|
|
|
|
if (!array_Check(ao)) {
|
|
PyErr_BadInternalCall();
|
|
return NULL;
|
|
}
|
|
|
|
it = PyObject_GC_New(arrayiterobject, &PyArrayIter_Type);
|
|
if (it == NULL)
|
|
return NULL;
|
|
|
|
Py_INCREF(ao);
|
|
it->ao = ao;
|
|
it->index = 0;
|
|
it->getitem = ao->ob_descr->getitem;
|
|
PyObject_GC_Track(it);
|
|
return (PyObject *)it;
|
|
}
|
|
|
|
static PyObject *
|
|
arrayiter_next(arrayiterobject *it)
|
|
{
|
|
assert(PyArrayIter_Check(it));
|
|
if (it->index < it->ao->ob_size)
|
|
return (*it->getitem)(it->ao, it->index++);
|
|
return NULL;
|
|
}
|
|
|
|
static void
|
|
arrayiter_dealloc(arrayiterobject *it)
|
|
{
|
|
PyObject_GC_UnTrack(it);
|
|
Py_XDECREF(it->ao);
|
|
PyObject_GC_Del(it);
|
|
}
|
|
|
|
static int
|
|
arrayiter_traverse(arrayiterobject *it, visitproc visit, void *arg)
|
|
{
|
|
if (it->ao != NULL)
|
|
return visit((PyObject *)(it->ao), arg);
|
|
return 0;
|
|
}
|
|
|
|
static PyTypeObject PyArrayIter_Type = {
|
|
PyObject_HEAD_INIT(NULL)
|
|
0, /* ob_size */
|
|
"arrayiterator", /* tp_name */
|
|
sizeof(arrayiterobject), /* tp_basicsize */
|
|
0, /* tp_itemsize */
|
|
/* methods */
|
|
(destructor)arrayiter_dealloc, /* 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 */
|
|
PyObject_GenericGetAttr, /* tp_getattro */
|
|
0, /* tp_setattro */
|
|
0, /* tp_as_buffer */
|
|
Py_TPFLAGS_DEFAULT | Py_TPFLAGS_HAVE_GC,/* tp_flags */
|
|
0, /* tp_doc */
|
|
(traverseproc)arrayiter_traverse, /* tp_traverse */
|
|
0, /* tp_clear */
|
|
0, /* tp_richcompare */
|
|
0, /* tp_weaklistoffset */
|
|
PyObject_SelfIter, /* tp_iter */
|
|
(iternextfunc)arrayiter_next, /* tp_iternext */
|
|
0, /* tp_methods */
|
|
};
|
|
|
|
|
|
/*********************** Install Module **************************/
|
|
|
|
/* No functions in array module. */
|
|
static PyMethodDef a_methods[] = {
|
|
{NULL, NULL, 0, NULL} /* Sentinel */
|
|
};
|
|
|
|
|
|
PyMODINIT_FUNC
|
|
initarray(void)
|
|
{
|
|
PyObject *m;
|
|
|
|
Arraytype.ob_type = &PyType_Type;
|
|
PyArrayIter_Type.ob_type = &PyType_Type;
|
|
m = Py_InitModule3("array", a_methods, module_doc);
|
|
|
|
Py_INCREF((PyObject *)&Arraytype);
|
|
PyModule_AddObject(m, "ArrayType", (PyObject *)&Arraytype);
|
|
Py_INCREF((PyObject *)&Arraytype);
|
|
PyModule_AddObject(m, "array", (PyObject *)&Arraytype);
|
|
/* No need to check the error here, the caller will do that */
|
|
}
|