Re^3: Prototype like sort()?

That's nice, I got reminded of TOBYINK's PerlX::Maybe when reading that code. But it's too "magical" for my taste. Thanks for the offer though.

Comment on Re^3: Prototype like sort()?

Replies are listed 'Best First'.
Re^4: Prototype like sort()? by LanX (Sage) on Feb 05, 2018 at 08:40 UTC
Actually, as long as we are only talking about two variants, it's more sensical to just define a second `rankby` . IMHO a module with many sort like functions would profit from a specialized `by` . > But it's too "magical" for my taste. In context of my DSL mediators I've already put some efforts into investigating possible pitfalls and found very good solutions. Please note that most other solutions come with ugly edge cases which are excluded here. There is a performance penalty though ... Cheers Rolf _{(addicted to the Perl Programming Language and ☆☆☆☆ :) Wikisyntax for the Monastery}	[reply] [d/l] [select]
Re^5: Prototype like sort()? by perlancar (Hermit) on Feb 05, 2018 at 10:15 UTC
I invite you to create a fork that employs this interface, and let's see which interface users like more (we'll have to wait for some time though ;-). You are also welcome to send me a pull request, although I cannot promise that I'll accept it.	[reply]
Re^6: Prototype like sort()? by LanX (Sage) on Feb 05, 2018 at 10:18 UTC
Nah, I'm more interested in general design strategies, sorry! :) Besides, I can't find your project. Cheers Rolf _{(addicted to the Perl Programming Language and ☆☆☆☆ :) Wikisyntax for the Monastery}	[reply]