From bf3c97c2134534290a6969824936a68f7da91af9 Mon Sep 17 00:00:00 2001
From: Mohammad S Anwar <mohammad.anwar@yahoo.com>
Date: Sat, 11 Apr 2020 15:32:02 +0100
Subject: - Renamed APL solutions.

---
 challenge-055/richard-park/apl/ch-1.apl  | 12 ------------
 challenge-055/richard-park/apl/ch-1.aplf | 12 ++++++++++++
 challenge-055/richard-park/apl/ch-2.apl  | 13 -------------
 challenge-055/richard-park/apl/ch-2.aplf | 13 +++++++++++++
 4 files changed, 25 insertions(+), 25 deletions(-)
 delete mode 100644 challenge-055/richard-park/apl/ch-1.apl
 create mode 100644 challenge-055/richard-park/apl/ch-1.aplf
 delete mode 100644 challenge-055/richard-park/apl/ch-2.apl
 create mode 100644 challenge-055/richard-park/apl/ch-2.aplf

diff --git a/challenge-055/richard-park/apl/ch-1.apl b/challenge-055/richard-park/apl/ch-1.apl
deleted file mode 100644
index 248a6f09dc..0000000000
--- a/challenge-055/richard-park/apl/ch-1.apl
+++ /dev/null
@@ -1,12 +0,0 @@
- FlipBinary←{
-⍝ ⍵: Binary number b of length n
-     n←≢b←⍵
-⍝ Flip 2 indices L≤R<N and count the number of 1s
-⍝ ←: L R pairs which result in maximum 1s
-     To←{⍺+⍳1+⍵-⍺}         ⍝ Integers ⍺ to ⍵ inclusive
-     flip←{⍵/⍨≤/¨⍵},⍳n n   ⍝ Possible flip indices L R
-     flerp←(⊃To/)¨flip     ⍝ Interpolate integers from L to R
-     f←⍵∘{~@⍵⊢⍺}¨flerp     ⍝ b flipped at each set of flip indices
-     max←⌈/sum←+/¨f        ⍝ Maximum number of 1s
-     flip[⍸sum=max]        ⍝ Flip indices which result in maximum 1s
- }
diff --git a/challenge-055/richard-park/apl/ch-1.aplf b/challenge-055/richard-park/apl/ch-1.aplf
new file mode 100644
index 0000000000..248a6f09dc
--- /dev/null
+++ b/challenge-055/richard-park/apl/ch-1.aplf
@@ -0,0 +1,12 @@
+ FlipBinary←{
+⍝ ⍵: Binary number b of length n
+     n←≢b←⍵
+⍝ Flip 2 indices L≤R<N and count the number of 1s
+⍝ ←: L R pairs which result in maximum 1s
+     To←{⍺+⍳1+⍵-⍺}         ⍝ Integers ⍺ to ⍵ inclusive
+     flip←{⍵/⍨≤/¨⍵},⍳n n   ⍝ Possible flip indices L R
+     flerp←(⊃To/)¨flip     ⍝ Interpolate integers from L to R
+     f←⍵∘{~@⍵⊢⍺}¨flerp     ⍝ b flipped at each set of flip indices
+     max←⌈/sum←+/¨f        ⍝ Maximum number of 1s
+     flip[⍸sum=max]        ⍝ Flip indices which result in maximum 1s
+ }
diff --git a/challenge-055/richard-park/apl/ch-2.apl b/challenge-055/richard-park/apl/ch-2.apl
deleted file mode 100644
index 06fdfa0dd9..0000000000
--- a/challenge-055/richard-park/apl/ch-2.apl
+++ /dev/null
@@ -1,13 +0,0 @@
- WaveArray←{
-⍝ Thanks to Total Array Ordering, an array ⍵ can be reordered so that its major cells, m, have the property
-⍝ (1⌷⍵)≥(2⌷⍵)≤(3⌷⍵)≥(4⌷⍵)≤...
-⍝ ⍵: Array
-⍝ ←: Array of rank (1+≢⍴⍵) where each major cell is a wave permutation of ⍵
-     n←≢⍵
-     p←⍵⌷⍤0 99⍨Pmat n        ⍝ Permutations of ⍵
-     gte←(¯1+n)⍴1 0          ⍝ Wave-array greater-than or equal pattern
-     lte←~gte                ⍝ Wave-array less-than or equal pattern
-     g←gte≡⍤1⊢2≥/(⍋⍋)⍤¯1⊢p   ⍝ Permutations with wave gte pattern
-     l←lte≡⍤1⊢2≤/(⍋⍋)⍤¯1⊢p   ⍝ Permutations with wave lte pattern
-     ∪(g∧l)⌿p                ⍝ Unique wave permutations of ⍵
- }
diff --git a/challenge-055/richard-park/apl/ch-2.aplf b/challenge-055/richard-park/apl/ch-2.aplf
new file mode 100644
index 0000000000..06fdfa0dd9
--- /dev/null
+++ b/challenge-055/richard-park/apl/ch-2.aplf
@@ -0,0 +1,13 @@
+ WaveArray←{
+⍝ Thanks to Total Array Ordering, an array ⍵ can be reordered so that its major cells, m, have the property
+⍝ (1⌷⍵)≥(2⌷⍵)≤(3⌷⍵)≥(4⌷⍵)≤...
+⍝ ⍵: Array
+⍝ ←: Array of rank (1+≢⍴⍵) where each major cell is a wave permutation of ⍵
+     n←≢⍵
+     p←⍵⌷⍤0 99⍨Pmat n        ⍝ Permutations of ⍵
+     gte←(¯1+n)⍴1 0          ⍝ Wave-array greater-than or equal pattern
+     lte←~gte                ⍝ Wave-array less-than or equal pattern
+     g←gte≡⍤1⊢2≥/(⍋⍋)⍤¯1⊢p   ⍝ Permutations with wave gte pattern
+     l←lte≡⍤1⊢2≤/(⍋⍋)⍤¯1⊢p   ⍝ Permutations with wave lte pattern
+     ∪(g∧l)⌿p                ⍝ Unique wave permutations of ⍵
+ }
-- 
cgit