Re^2: Prototype like sort()?

Others explained that not all builtins' APIs can be copied by using prototypes.

But if you are willing to combine your rank with another modifier sub like by with prototype, you could form compound statements like

rank LIST;

rank by BLOCK LIST;

rank by {SUBNAME} LIST;
[download]

I find this more readable than your original approach.

If acceptable, I could elaborate further on a clean implementation.

Cheers Rolf
_{(addicted to the Perl Programming Language and ☆☆☆☆ :)

Wikisyntax for the Monastery}

Comment on Re^2: Prototype like sort()? Select or Download Code

Replies are listed 'Best First'.
Re^3: Prototype like sort()? by perlancar (Hermit) on Feb 05, 2018 at 05:14 UTC
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.	[reply]
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