[Octave-bug-tracker] [bug #61319] idivide fails to distinguish between ceil and floor for inputs close to perfect squares

[Arun Giridhar]

Follow-up Comment #5, bug #61319 (project octave):

You're right -- calling floor and ceil separately won't do any good here
because they're already integers. I wasn't thinking.

Good idea about rem and mod. Since they are written in C++, perhaps they can
access native-mode integer division without rounding. Given two numbers foo
and bar, this seems to work reliably for large n:


r = rem (foo,bar);
q = (foo - r) ./ bar;   # always floor

assert(all(q .* bar + r == foo)),


What should the fix and ceil expressions be?

    _______________________________________________________

Reply to this item at:

  <https://savannah.gnu.org/bugs/?61319>

_______________________________________________
  Message sent via Savannah
  https://savannah.gnu.org/