Re: Minimal Distance (Re: Where is Manhattan Dispatch discussion?)

2008-05-07 Thread TSa
HaloO, John M. Dlugosz wrote: When I mentioned this before, there was big flack over mentioning the way C++ did it. I think that must have been miscommunicated, since I wasn't even talking about summing all the arguments when he brought up Manhattan dispatch. That he there being me, I just

Re: Minimal Distance (Re: Where is Manhattan Dispatch discussion?)

2008-05-07 Thread Austin Hastings
TSa wrote: BTW, what is a flack? See http://en.wikipedia.org/wiki/Flak_%28disambiguation%29 Originally, (FL)ug(a)bwehr (K)anone -- German 88mm anti-aircraft cannon of WWII. Subsequently, any anti-air gun or cannon, particularly when fired at a position rather than aimed at a particular

Re: Minimal Distance (Re: Where is Manhattan Dispatch discussion?)

2008-05-07 Thread Brandon S. Allbery KF8NH
On 2008 May 7, at 4:21, TSa wrote: BTW, what is a flack? He's using flak (shrapnel; usual usage catching flak over ...) without understanding it. Coming back to how C++ handles static overloading. How is the sort order of (int *), (int ), (int), (const int *), (const int ), (const int),

Minimal Distance (Re: Where is Manhattan Dispatch discussion?)

2008-05-06 Thread John M. Dlugosz
Mark A. Biggar mark-at-biggar.org |Perl 6| wrote: To do multi method dispatch, you want to select the method that best matches the parameters in the call. One way to do that is to define a measure for distances between types and they use the method that's at the minimum distance. One simple

Re: Minimal Distance (Re: Where is Manhattan Dispatch discussion?)

2008-05-06 Thread TSa
HaloO, John M. Dlugosz wrote: In C++, which must be resolved at compile time, the overloading resolution mechanism demands that =every= parameter be at least as good of a match, and one strictly better match. So the implementation never guesses if worse-left/better-right is a better fit than

Re: Minimal Distance (Re: Where is Manhattan Dispatch discussion?)

2008-05-06 Thread chromatic
On Tuesday 06 May 2008 10:38:38 John M. Dlugosz wrote: I have problems with a simple sum.  The distance is artificially inflated if you make lots of small derivation steps vs one large change.  The concept of derivation steps is ill-defined for parameterized types and types that change

Re: Minimal Distance (Re: Where is Manhattan Dispatch discussion?)

2008-05-06 Thread Larry Wall
On Tue, May 06, 2008 at 08:20:40PM +0200, TSa wrote: HaloO, John M. Dlugosz wrote: In C++, which must be resolved at compile time, the overloading resolution mechanism demands that =every= parameter be at least as good of a match, and one strictly better match. So the implementation never

Re: Minimal Distance (Re: Where is Manhattan Dispatch discussion?)

2008-05-06 Thread John M. Dlugosz
TSa Thomas.Sandlass-at-barco.com |Perl 6| wrote: HaloO, John M. Dlugosz wrote: In C++, which must be resolved at compile time, the overloading resolution mechanism demands that =every= parameter be at least as good of a match, and one strictly better match. So the implementation never

Re: Minimal Distance (Re: Where is Manhattan Dispatch discussion?)

2008-05-06 Thread John M. Dlugosz
Larry Wall larry-at-wall.org |Perl 6| wrote: On Tue, May 06, 2008 at 08:20:40PM +0200, TSa wrote: HaloO, John M. Dlugosz wrote: In C++, which must be resolved at compile time, the overloading resolution mechanism demands that =every= parameter be at least as good of a match, and one

Re: Minimal Distance (Re: Where is Manhattan Dispatch discussion?)

2008-05-06 Thread Larry Wall
On Tue, May 06, 2008 at 08:47:47PM -0500, John M. Dlugosz wrote: Larry Wall larry-at-wall.org |Perl 6| wrote: On Tue, May 06, 2008 at 08:20:40PM +0200, TSa wrote: HaloO, John M. Dlugosz wrote: In C++, which must be resolved at compile time, the overloading resolution mechanism