updated numpy version, removed some usage of PyList_GET_ITEM

Author: flexatone

requirements-build-3_13.txt

@@ -1,2 +1,2 @@
-numpy==2.2.5
+numpy==2.3.1
 setuptools==80.*

requirements-dev-3_13.txt

@@ -1,4 +1,4 @@
-numpy==2.2.5
+numpy==2.3.1
 pytest==8.3.3
 invoke==2.2.0
 hypothesis==6.131.16

src/_arraykit.c

@@ -72,7 +72,7 @@ static struct PyModuleDef arraykit_module = {
     .m_methods = arraykit_methods,
 };
 
-PyObject *
+PyObject*
 PyInit__arraykit(void)
 {
     import_array();
@@ -134,6 +134,9 @@ PyInit__arraykit(void)
         Py_XDECREF(m);
         return NULL;
     }
+#ifdef Py_GIL_DISABLED
+    PyUnstable_Module_SetGIL(m, Py_MOD_GIL_NOT_USED);
+#endif
     return m;
 }
 

src/auto_map.c

@@ -426,8 +426,8 @@ fami_iternext(FAMIObject *self)
             else {
                 PyObject* t = PyTuple_New(2);
                 if (!t) { return NULL; }
-                PyObject* k = PyList_GET_ITEM(self->fam->keys, index);
-                Py_INCREF(k);
+                PyObject* k = PyList_GetItemRef(self->fam->keys, index);
+                if (!t) { return NULL; }
                 PyTuple_SET_ITEM(t, 0, k);
                 PyTuple_SET_ITEM(t, 1, PyLong_FromSsize_t(index));
                 return t;
@@ -438,8 +438,8 @@ fami_iternext(FAMIObject *self)
                 return PyArray_ToScalar(PyArray_GETPTR1(self->keys_array, index), self->keys_array);
             }
             else {
-                PyObject* yield = PyList_GET_ITEM(self->fam->keys, index);
-                Py_INCREF(yield);
+                PyObject* yield = PyList_GetItemRef(self->fam->keys, index);
+                if (!yield) { return NULL; }
                 return yield;
             }
         }
@@ -1302,11 +1302,11 @@ lookup(FAMObject *self, PyObject *key) {
     return self->table[table_pos].keys_pos;
 }
 
-// Insert a key_pos, hash pair into the table. Assumes table already has appropriate size. When inserting a new itme, `hash` is -1, forcing a fresh hash to be computed here. Return 0 on success, -1 on error.
+// Insert a key_pos, hash pair into the table. Assumes table already has appropriate size. When inserting a new item, `hash` is -1, forcing a fresh hash to be computed here. Return 0 on success, -1 on error.
 static int
 insert_obj(
         FAMObject *self,
-        PyObject *key,
+        PyObject *key,  // NOTE: a borrowed reference
         Py_ssize_t keys_pos,
         Py_hash_t hash)
 {