Context Navigation

Timeline

4:23 PM Ticket #3960 (Integer division) closed by J-Paul Mesnage: Completed: Added by revision [12995] in version: 3.3.17.0

12:39 PM Ticket #3960 (Integer division) updated by J-Paul Mesnage: Owner, Status changed
12:39 PM Ticket #3960 (Integer division) reopened by J-Paul Mesnage

1:32 PM Ticket #1503 (FileGetSize don't works solid) updated by J-Paul Mesnage: Status changed
1:31 PM Ticket #1503 (FileGetSize don't works solid) reopened by J-Paul Mesnage: New fix sent to Jon

10:49 AM Ticket #3959 (_WinAPI_ShellUserAuthenticationDlg example not working) closed by J-Paul Mesnage: Fixed: Fixed by revision [12992] in version: 3.3.17.0
9:35 AM Ticket #3959 (_WinAPI_ShellUserAuthenticationDlg example not working) updated by J-Paul Mesnage: True, I will update with […]

8:13 PM Ticket #3960 (Integer division) updated by jchd18: Floor() isn't the correct solution to the request. For instance, Floor(-10/3) yields -4 which is mathematically correct but certainly not what a naive user would expect in this context. The OP is expecting something "like" the Euclidean division. You supply numerator N (aka dividend) and divisor D, Euclidean division returns the quotient Q and the remainder R such as N = Q * D + R Disney life is simple but real world isn't! The question now is: "Which Euclidean division"? Translate this into: things are easy while N ≥ 0 and D > 0 but not all {N, D} are such. Try Int() and Mod() on the {N, D} tuples below: {-11, -2}, {-11, 2}, {11, -2}, {11, 2} You get four distinct (yet correct) answers: {5, -1}, {-5, -1}, {-5, 1}, {5, 1}. In short if you accept signed Q and R, then Int() and Mod() are your tools over ℤxℤ*, but if you insist on R being non-negative, then you must also accept seemingly off-by-one values for Q and varying values modulo(q) for R when at least one of N or D is negative. Finally, since Int(3, 0) yields inf (meaning infinity) and since both Mod(3, 0) and Int(0 / 0) yield nan(ind), meaning Not-A-Number(Indeterminate), one must also provide a route for these cases. Note that I choose not to return Q as return value and R as @extended because @extended is integral type and limited to 32-bit. Q is set ByRef and returned for convenience. […] Not that my remarks justify reopening the topic.

9:55 PM Ticket #3953 (missing bracket error when using ternary operator or OR operator ...) updated by J-Paul Mesnage: a new fix sent to jon
9:04 PM Ticket #3960 (Integer division) closed by Jos: Rejected: Closed for now unless an answer comes that justifies opening it again.
8:55 PM Ticket #3953 (missing bracket error when using ternary operator or OR operator ...) updated by J-Paul Mesnage: Summary changed
Thanks That's another pb not related with ternary operator

9:01 PM Ticket #3953 (missing bracket error when using ternary operator or OR operator ...) updated by anonymous: Info (if this isn't already part of the fix): […]

9:31 AM Ticket #3960 (Integer division) updated by Jos: > Yes, something similar but implemented as a built-in operation. Imho it would be rather convenient. Floor() is buildin, so please explain what the issue is with using that? Is it not working correctly or do you want another outcome than Floor() produces?

8:02 AM Ticket #3960 (Integer division) updated by anonymous: Replying to Jos: > You mean like the existing Floor() function? Yes, something similar but implemented as a built-in operation. Imho it would be rather convenient. […] Anyway I don't insist on my offer, it's just a thought :)

4:25 PM Ticket #3960 (Integer division) updated by Jos: You mean like the existing Floor() function?
8:19 AM Ticket #3960 (Integer division) created by Alecsis1: Hello! As well-known, division operation always returns double even if …

Note: See TracTimeline for information about the timeline view.