@@ -596,7 +596,7 @@ jtbcvt(J jt, C mode, array w) -> array {
596
596
}
597
597
}
598
598
// for all numerics, try Boolean/int/float in order, stopping when we find one that holds the data
599
- if (((mode & 1 ) != 0 ) || ((AT (w) & XNUM + RAT) == 0 )) { // if we are not stopping at XNUM/RAT
599
+ if (((mode & 1 ) != 0 ) || ((AT (w) & ( XNUM + RAT) ) == 0 )) { // if we are not stopping at XNUM/RAT
600
600
// To avoid a needless copy, suppress conversion to B01 if type is B01, to INT if type is INT, etc
601
601
// set the NOFUZZ flag in jt to insist on an exact match so we won't lose precision
602
602
array y = nullptr ;
641
641
jtcvt0 (J jt, array w) -> array {
642
642
auto const t = AT (w);
643
643
auto const n = (t & CMPX) != 0 ? 2 * AN (w) : AN (w);
644
- if ((n != 0 ) && ((t & FL + CMPX) != 0 )) {
644
+ if ((n != 0 ) && ((t & ( FL + CMPX) ) != 0 )) {
645
645
auto *u = pointer_to_values<double >(w);
646
646
std::transform (u, u + n, u, [](auto v) { return v == 0.0 ? 0.0 : v; });
647
647
}
@@ -651,7 +651,7 @@ jtcvt0(J jt, array w) -> array {
651
651
auto
652
652
jtxco1 (J jt, array w) -> array {
653
653
ASSERT (AT (w) & DENSE, EVNONCE);
654
- return jtcvt (jt, AT (w) & B01 + INT + XNUM ? XNUM : RAT, w);
654
+ return jtcvt (jt, AT (w) & ( B01 + INT + XNUM) ? XNUM : RAT, w);
655
655
}
656
656
657
657
auto
0 commit comments