diff options
author | Ganesh Kathiresan <ganesh3597@gmail.com> | 2020-12-01 08:52:50 +0530 |
---|---|---|
committer | Ganesh Kathiresan <ganesh3597@gmail.com> | 2020-12-01 08:52:50 +0530 |
commit | 28aa88312164987462b1e7744e0efb5bee65c724 (patch) | |
tree | 4b4ef4019aa8209897b72eda70f90bb715c27a4c /numpy/core | |
parent | ca4ba20fabcae7dd0944c0374ed0e452c684d4ac (diff) | |
download | numpy-28aa88312164987462b1e7744e0efb5bee65c724.tar.gz |
MAINT: Linting fixes
Diffstat (limited to 'numpy/core')
-rw-r--r-- | numpy/core/src/umath/loops.c.src | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/numpy/core/src/umath/loops.c.src b/numpy/core/src/umath/loops.c.src index 6637c0e4e..6823a13b2 100644 --- a/numpy/core/src/umath/loops.c.src +++ b/numpy/core/src/umath/loops.c.src @@ -862,14 +862,14 @@ NPY_NO_EXPORT void /* When the divisor is a constant, use libdivide for faster division */ if (steps[1] == 0) { - /* In case of empty array, just return*/ + /* In case of empty array, just return */ if (n == 0) { return; } const @type@ in2 = *(@type@ *)ip2; - /* If divisor is 0, we need not compute anything*/ + /* If divisor is 0, we need not compute anything */ if (in2 == 0) { npy_set_floatstatus_divbyzero(); BINARY_LOOP_SLIDING { @@ -1415,12 +1415,12 @@ TIMEDELTA_dm_m_multiply(char **args, npy_intp const *dimensions, npy_intp const NPY_NO_EXPORT void TIMEDELTA_mq_m_divide(char **args, npy_intp const *dimensions, npy_intp const *steps, void *NPY_UNUSED(func)) { - /* NOTE: This code is similar to array floor divide*/ + /* NOTE: This code is similar to array floor divide */ BINARY_DEFS /* When the divisor is a constant, use libdivide for faster division */ if (steps[1] == 0) { - /* In case of empty array, just return*/ + /* In case of empty array, just return */ if (n == 0) { return; } @@ -1528,12 +1528,12 @@ TIMEDELTA_mm_m_remainder(char **args, npy_intp const *dimensions, npy_intp const NPY_NO_EXPORT void TIMEDELTA_mm_q_floor_divide(char **args, npy_intp const *dimensions, npy_intp const *steps, void *NPY_UNUSED(func)) { - /* NOTE: This code is similar to array floor divide*/ + /* NOTE: This code is similar to array floor divide */ BINARY_DEFS /* When the divisor is a constant, use libdivide for faster division */ if (steps[1] == 0) { - /* In case of empty array, just return*/ + /* In case of empty array, just return */ if (n == 0) { return; } |