aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorMark <53903062+andemark@users.noreply.github.com>2023-11-13 10:17:23 +0000
committerMark <53903062+andemark@users.noreply.github.com>2023-11-13 10:17:23 +0000
commit7dd52fb63dcac5f223b444c76866e53d2a330891 (patch)
tree32d0b3f63e9badfc1a5bb89117181b422b334455
parent03593725948f4adc106777b47d963d4e4f4b31d8 (diff)
downloadperlweeklychallenge-club-7dd52fb63dcac5f223b444c76866e53d2a330891.tar.gz
perlweeklychallenge-club-7dd52fb63dcac5f223b444c76866e53d2a330891.tar.bz2
perlweeklychallenge-club-7dd52fb63dcac5f223b444c76866e53d2a330891.zip
Challenge 243 Solutions (Raku)
-rw-r--r--challenge-243/mark-anderson/raku/ch-1.raku11
1 files changed, 4 insertions, 7 deletions
diff --git a/challenge-243/mark-anderson/raku/ch-1.raku b/challenge-243/mark-anderson/raku/ch-1.raku
index a944777d1e..c5e9532de3 100644
--- a/challenge-243/mark-anderson/raku/ch-1.raku
+++ b/challenge-243/mark-anderson/raku/ch-1.raku
@@ -1,16 +1,13 @@
#!/usr/bin/env raku
use Test;
-use experimental :cached;
is reverse-pairs(1,3,2,3,1), 2;
is reverse-pairs(2,4,3,5,1), 3;
+# I've tried memoize, race, and promises for big lists and those seem
+# to make things slower 🤔
+
sub reverse-pairs(*@a)
{
- sub rp($p) is cached
- {
- .[0] > .[1] * 2 given |$p
- }
-
- + @a.combinations(2).grep(&rp)
+ + grep { .[0] > .[1] * 2 }, @a.combinations(2)
}