« Bugzilla Issues Index
#980 — 5.2: simplifying modulo
- bug_id:
980
- creation_ts:
2012-11-21 12:46:00 -0800
- short_desc:
5.2: simplifying modulo
- delta_ts:
2013-09-16 06:36:29 -0700
- product:
Draft for 6th Edition
- component:
editorial issue
- version:
Rev 11: October 26, 2012 Draft
- rep_platform:
All
- op_sys:
All
- bug_status:
RESOLVED
- resolution:
WORKSFORME
- priority:
Normal
- bug_severity:
enhancement
- everconfirmed:
true
- reporter:
Michael Dyck
- assigned_to:
Allen Wirfs-Brock
- cc:
claude.pache
- commentid:
2484
- comment_count:
0
- who:
Michael Dyck
- bug_when:
2012-11-21 12:46:38 -0800
Section 5.2 says:
The notation “x modulo y” (y must be finite and nonzero)
computes a value k of the same sign as y (or zero) such that
abs(k) < abs(y) and x-k = q * y for some integer q.
You could make the definition a bit simpler by requiring that y be a positive integer, which is true of all uses of 'modulo' in the spec.
- commentid:
3265
- comment_count:
1
- who:
Allen Wirfs-Brock
- bug_when:
2013-03-02 10:58:54 -0800
yes, but it doesn't hurt and maybe someday in the future it will be needed.