Re: Closures, compile time, pad protos

2006-11-24 Thread Buddha Buck
On 11/22/06, Anatoly Vorobey <[EMAIL PROTECTED]> wrote: First of all, thanks a lot for your comments. On Wed, Nov 22, 2006 at 06:43:12PM -0500, Buddha Buck wrote: > >{ > > my $x = something(); > > if $x==1 { > >...code... > > } > >} > > > My experience with other statically typed by extre

Re: implementation for subset types

2006-11-24 Thread Jonathan Lang
TSa wrote: HaloO, I want to propose a little addition to subset type definitions. They should get an implementation body like classes and roles. This is useful to add methods to the type. Here is my Rectangle example from the 'how to change the type of objects' thread. # @.points contains Point

Re: Set-returning .keys (was Re: Smart Matching clarification)

2006-11-24 Thread Darren Duncan
To start off, I should clarify that I see little value for the existence of a Bag type except for certain matters of syntactic or semantic brevity, but that those alone can still warrant its existence. A Bag is for marking when your duplicate-allowing collection is conceptually not ordered, a

implementation for subset types

2006-11-24 Thread TSa
HaloO, I want to propose a little addition to subset type definitions. They should get an implementation body like classes and roles. This is useful to add methods to the type. Here is my Rectangle example from the 'how to change the type of objects' thread. # @.points contains Point objects sub

Re: Set-returning .keys (was Re: Smart Matching clarification)

2006-11-24 Thread Darren Duncan
P.S. Sending this again, for timeliness, (first attempt was 20 hours ago) due to p6l mail server being down before. Sorry if you end up getting a duplicate later. To start off, I should clarify that I see little value for the existence of a Bag type except for certain matters

Re: Set-returning .keys (was Re: Smart Matching clarification)

2006-11-24 Thread TSa
HaloO, Jonathan Lang wrote: Other cases: What would 'Set.push(items)' and 'Set.pop()' do? What _is_ the appropriate way to go about adding items to (or removing items from) a Set, or of searching the Set for an element? Since Sets are immutable values there should be no push and pop methods.