- From: Boris Zbarsky <notifications@github.com>
- Date: Fri, 17 Mar 2017 16:17:29 -0700
- To: heycam/webidl <webidl@noreply.github.com>
- Cc: Subscribed <subscribed@noreply.github.com>
Received on Friday, 17 March 2017 23:18:03 UTC
Stepping through the https://heycam.github.io/webidl/#dfn-effective-overload-set algorithm: 1. S is empty set. 2. F is the set of our operations. 3. maxarg is 4 (due to the f4 overload), though in practice this will turn out to not matter. 4. m is 4 (because both maxarg and N are 4). 5. We will now consider f2. 5.1. n is 3. 5.2. (t0, t1, t2) is (Node, DOMString, double) 5.3 (o0, 01, 02) is (required, required, variadic) 5.4 Add the tuple of those two things to the overload set. 5.5 f2 is declared variadic, so: 5.5.1. for 3 <= i <= 4 add more things and specifically, when i == 4, we add `<f2, (Node, DOMString, double, double), (required, required, variadic, variadic)>`. -- You are receiving this because you are subscribed to this thread. Reply to this email directly or view it on GitHub: https://github.com/heycam/webidl/issues/327#issuecomment-287494054
Received on Friday, 17 March 2017 23:18:03 UTC