in reply to Re^4: rough approximation to pattern matching using local (Multi Subs)
in thread rough approximation to pattern matching using local
I'll start with a narrow view of your "Does it work?" question:
A look at 'roast', the suite of tests for a Perl 6 compiler, provides part of a broader view of the "does it work?" question:
(Collectively the design docs contain links to most of the 35K+ tests in 'roast'. The rest are for covering things like the 140+ articles in the Perl 6 Advent Calendars; these now have close to 100% coverage thanks to David Warring's determination to sort them out in the latter half of 2014.)
For example, the design doc section I linked as Unpacking array parameters embeds links to a couple test files from roast: S06-signature/unpack-array.t and S06-multi/unpackability.t.
For example, searching for "signature" ("pattern matching" doesn't match anything) in the current latest 'roast' run for Rakudo on MoarVM reveals 80+ matches. At the time of writing this I consider just 36 to be of real interest.
(I ignored matches such as todo tests for the "signature" method on the not-yet-implemented compiler object representing the distro used to compile the compiler.)
An informal analysis of the matches of interest to me indicated around 500 relevant passing tests and 65 todo/skipped. About half of the latter look like they really need to be done by 6.0, i.e. supposedly by the end of this year, especially the ones covering binding of return values and named arguments. YMMV.
I plan to properly address your "is it worth it?" speed question in a separate comment this weekend.
»ö« . o O ( "the celebrity tell-all of the Perl-6 cult?" )
|
|---|