Re: Smart Matching clarification

2006-11-17 Thread Paul Seamons
> So maybe we have some or all of: > > .keys .sortkeys > .values .sortvalues > .kv .sortkv > .pairs.sortpairs > > Possible variations: .skeys, .ordkeys, etc. Also could flip the > default and make .keys sort by default and then you use .rawkeys to get > unor

Re: generic ordinal-relevant operators

2006-11-17 Thread Larry Wall
On Fri, Nov 17, 2006 at 04:57:59PM +0100, TSa wrote: : But I don't understand exactly how the coercive semantics : of the numeric and string comparisons are achieved. I assume there : are protos defined with signature :(Any,Any) that coerce the args : to numeric or string and re-dispatch. Right? I

Re: Smart Matching clarification

2006-11-17 Thread Jonathan Lang
Larry Wall wrote: Jonathan Lang wrote: : Looking through the table provided, I ran across the following: : :$_ $xType of Match ImpliedMatching Code :== = == :HashHash hash keys identical match if $_.keys.s

Re: Smart Matching clarification

2006-11-17 Thread Larry Wall
On Thu, Nov 16, 2006 at 04:25:30PM -0800, Jonathan Lang wrote: : Looking through the table provided, I ran across the following: : :$_ $xType of Match ImpliedMatching Code :== = == :HashHash hash keys identical

Re: generic ordinal-relevant operators

2006-11-17 Thread TSa
HaloO, Smylers wrote: TSa writes: ... one question remains that might actually make Duncan's proposal pointless. Didn't Larry actually accept Darren's proposal and add the C and C operators? He did. But I don't understand exactly how the coercive semantics of the numeric and string compar