|
13 | 13 | * total_constraint_size) |
14 | 14 | * |
15 | 15 | * Returns: |
16 | | - * Tuple of (data, indices, indptr, (m, n)) for scipy.sparse.csr_matrix |
| 16 | + * Tuple of (data, indices, indptr, (m, n)) for scipy.sparse.CSR_matrix |
17 | 17 | */ |
18 | 18 | static PyObject *py_problem_hessian(PyObject *self, PyObject *args) |
19 | 19 | { |
@@ -50,7 +50,7 @@ static PyObject *py_problem_hessian(PyObject *self, PyObject *args) |
50 | 50 | Py_DECREF(lagrange_arr); |
51 | 51 |
|
52 | 52 | /* Extract CSR components and return as tuple */ |
53 | | - CSR_Matrix *H = prob->lagrange_hessian; |
| 53 | + CSR_matrix *H = prob->lagrange_hessian; |
54 | 54 | npy_intp nnz = H->nnz; |
55 | 55 | npy_intp n_plus_1 = H->n + 1; |
56 | 56 |
|
@@ -97,7 +97,7 @@ static PyObject *py_get_hessian(PyObject *self, PyObject *args) |
97 | 97 | return NULL; |
98 | 98 | } |
99 | 99 |
|
100 | | - CSR_Matrix *H = prob->lagrange_hessian; |
| 100 | + CSR_matrix *H = prob->lagrange_hessian; |
101 | 101 | npy_intp nnz = H->nnz; |
102 | 102 | npy_intp n_plus_1 = H->n + 1; |
103 | 103 |
|
@@ -144,7 +144,7 @@ static PyObject *py_get_problem_hessian_sparsity_coo(PyObject *self, PyObject *a |
144 | 144 | return NULL; |
145 | 145 | } |
146 | 146 |
|
147 | | - COO_Matrix *coo = prob->lagrange_hessian_coo; |
| 147 | + COO_matrix *coo = prob->lagrange_hessian_coo; |
148 | 148 | npy_intp nnz = coo->nnz; |
149 | 149 |
|
150 | 150 | PyObject *rows = PyArray_SimpleNew(1, &nnz, NPY_INT32); |
@@ -201,7 +201,7 @@ static PyObject *py_problem_eval_hessian_vals_coo(PyObject *self, PyObject *args |
201 | 201 | refresh_lower_triangular_coo(prob->lagrange_hessian_coo, |
202 | 202 | prob->lagrange_hessian->x); |
203 | 203 |
|
204 | | - COO_Matrix *coo = prob->lagrange_hessian_coo; |
| 204 | + COO_matrix *coo = prob->lagrange_hessian_coo; |
205 | 205 | npy_intp nnz = coo->nnz; |
206 | 206 |
|
207 | 207 | PyObject *data = PyArray_SimpleNew(1, &nnz, NPY_DOUBLE); |
|
0 commit comments