W3C home > Mailing lists > Public > public-script-coord@w3.org > April to June 2014

[Bug 25590] Off-by-one in 3.2.6 effective overload set algorithm

From: <bugzilla@jessica.w3.org>
Date: Thu, 08 May 2014 05:36:20 +0000
To: public-script-coord@w3.org
Message-ID: <bug-25590-3890-hV9SU8pzHG@http.www.w3.org/Bugs/Public/>
https://www.w3.org/Bugs/Public/show_bug.cgi?id=25590

Nils Barth <nbarth+w3bugzilla@google.com> changed:

           What    |Removed                     |Added
----------------------------------------------------------------------------
                 CC|                            |nbarth+w3bugzilla@google.co
                   |                            |m

--- Comment #1 from Nils Barth <nbarth+w3bugzilla@google.com> ---
Thanks Joshua!
I'm referring to:
http://heycam.github.io/webidl/#dfn-effective-overload-set

To fix this, there are two solutions, right?

Option A:
Replace:
7. While i ≥ 0:
with:
7. While i > 0:

Option B:
Remove: 8. If n > 0 ...
...and preferably amend 5.7.2 to:
2. Otherwise, add to S the tuple <X, t0..i−1, o0..i−1>; if i is 0, this means
to add to S the tuple <X, (), ()> (where “()” represents the empty list).


Option A is probably simpler and more explicit spec-wise, because it avoids the
negative indexes and is explicit about the bound.

-- 
You are receiving this mail because:
You are on the CC list for the bug.
Received on Thursday, 8 May 2014 05:36:21 UTC

This archive was generated by hypermail 2.4.0 : Friday, 17 January 2020 17:14:21 UTC