@@ -48,7 +48,7 @@ Docs...
48
48
auto x1p = x1.unchecked <2 >();
49
49
auto x2p = x2.unchecked <2 >();
50
50
size_t n1 = x1p.shape (0 ), n2 = x2p.shape (0 );
51
- if (x1p.shape (1 ) != ssize_t (self.ndim ()) || x2p.shape (1 ) != ssize_t (self.ndim ())) throw george::dimension_mismatch ();
51
+ if (x1p.shape (1 ) != py:: ssize_t (self.ndim ()) || x2p.shape (1 ) != py:: ssize_t (self.ndim ())) throw george::dimension_mismatch ();
52
52
py::array_t <double > result ({n1, n2});
53
53
auto resultp = result.mutable_unchecked <2 >();
54
54
for (size_t i = 0 ; i < n1; ++i) {
@@ -62,7 +62,7 @@ Docs...
62
62
interface.def (" value_symmetric" , [](KernelInterface& self, py::array_t <double > x) {
63
63
auto xp = x.unchecked <2 >();
64
64
size_t n = xp.shape (0 );
65
- if (xp.shape (1 ) != ssize_t (self.ndim ())) throw george::dimension_mismatch ();
65
+ if (xp.shape (1 ) != py:: ssize_t (self.ndim ())) throw george::dimension_mismatch ();
66
66
py::array_t <double > result ({n, n});
67
67
auto resultp = result.mutable_unchecked <2 >();
68
68
for (size_t i = 0 ; i < n; ++i) {
@@ -80,7 +80,7 @@ Docs...
80
80
auto x1p = x1.unchecked <2 >();
81
81
auto x2p = x2.unchecked <2 >();
82
82
size_t n = x1p.shape (0 );
83
- if (ssize_t (n) != x2p.shape (0 ) || x1p.shape (1 ) != ssize_t (self.ndim ()) || x2p.shape (1 ) != ssize_t (self.ndim ())) throw george::dimension_mismatch ();
83
+ if (py:: ssize_t (n) != x2p.shape (0 ) || x1p.shape (1 ) != py:: ssize_t (self.ndim ()) || x2p.shape (1 ) != py:: ssize_t (self.ndim ())) throw george::dimension_mismatch ();
84
84
py::array_t <double > result (n);
85
85
auto resultp = result.mutable_unchecked <1 >();
86
86
for (size_t i = 0 ; i < n; ++i) {
@@ -93,7 +93,7 @@ Docs...
93
93
auto x1p = x1.unchecked <2 >();
94
94
auto x2p = x2.unchecked <2 >();
95
95
size_t n1 = x1p.shape (0 ), n2 = x2p.shape (0 ), size = self.size ();
96
- if (x1p.shape (1 ) != ssize_t (self.ndim ()) || x2p.shape (1 ) != ssize_t (self.ndim ())) throw george::dimension_mismatch ();
96
+ if (x1p.shape (1 ) != py:: ssize_t (self.ndim ()) || x2p.shape (1 ) != py:: ssize_t (self.ndim ())) throw george::dimension_mismatch ();
97
97
py::array_t <double > result ({n1, n2, size});
98
98
auto resultp = result.mutable_unchecked <3 >();
99
99
auto w = which.unchecked <1 >();
@@ -109,7 +109,7 @@ Docs...
109
109
interface.def (" gradient_symmetric" , [](KernelInterface& self, py::array_t <unsigned > which, py::array_t <double > x) {
110
110
auto xp = x.unchecked <2 >();
111
111
size_t n = xp.shape (0 ), size = self.size ();
112
- if (xp.shape (1 ) != ssize_t (self.ndim ())) throw george::dimension_mismatch ();
112
+ if (xp.shape (1 ) != py:: ssize_t (self.ndim ())) throw george::dimension_mismatch ();
113
113
py::array_t <double > result ({n, n, size});
114
114
auto resultp = result.mutable_unchecked <3 >();
115
115
auto w = which.unchecked <1 >();
@@ -128,7 +128,7 @@ Docs...
128
128
auto x1p = x1.unchecked <2 >();
129
129
auto x2p = x2.unchecked <2 >();
130
130
size_t n1 = x1p.shape (0 ), n2 = x2p.shape (0 ), ndim = self.ndim ();
131
- if (x1p.shape (1 ) != ssize_t (ndim) || x2p.shape (1 ) != ssize_t (ndim)) throw george::dimension_mismatch ();
131
+ if (x1p.shape (1 ) != py:: ssize_t (ndim) || x2p.shape (1 ) != py:: ssize_t (ndim)) throw george::dimension_mismatch ();
132
132
py::array_t <double > result ({n1, n2, ndim});
133
133
auto resultp = result.mutable_unchecked <3 >();
134
134
for (size_t i = 0 ; i < n1; ++i) {
@@ -144,7 +144,7 @@ Docs...
144
144
auto x1p = x1.unchecked <2 >();
145
145
auto x2p = x2.unchecked <2 >();
146
146
size_t n1 = x1p.shape (0 ), n2 = x2p.shape (0 ), ndim = self.ndim ();
147
- if (x1p.shape (1 ) != ssize_t (ndim) || x2p.shape (1 ) != ssize_t (ndim)) throw george::dimension_mismatch ();
147
+ if (x1p.shape (1 ) != py:: ssize_t (ndim) || x2p.shape (1 ) != py:: ssize_t (ndim)) throw george::dimension_mismatch ();
148
148
py::array_t <double > result ({n1, n2, ndim});
149
149
auto resultp = result.mutable_unchecked <3 >();
150
150
for (size_t i = 0 ; i < n1; ++i) {
0 commit comments