diff --git a/Lang/11l/Bioinformatics-base-count b/Lang/11l/Bioinformatics-base-count
deleted file mode 120000
index d8c9e2572d..0000000000
--- a/Lang/11l/Bioinformatics-base-count
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Bioinformatics-base-count/11l
\ No newline at end of file
diff --git a/Lang/11l/Meissel-Mertens-constant b/Lang/11l/Meissel-Mertens-constant
deleted file mode 120000
index 908ef16ca2..0000000000
--- a/Lang/11l/Meissel-Mertens-constant
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Meissel-Mertens-constant/11l
\ No newline at end of file
diff --git a/Lang/11l/Miller-Rabin-primality-test b/Lang/11l/Miller-Rabin-primality-test
deleted file mode 120000
index cec9772a16..0000000000
--- a/Lang/11l/Miller-Rabin-primality-test
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Miller-Rabin-primality-test/11l
\ No newline at end of file
diff --git a/Lang/11l/Sorting-Algorithms-Circle-Sort b/Lang/11l/Sorting-Algorithms-Circle-Sort
deleted file mode 120000
index 38059f4dea..0000000000
--- a/Lang/11l/Sorting-Algorithms-Circle-Sort
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Sorting-Algorithms-Circle-Sort/11l
\ No newline at end of file
diff --git a/Lang/6502-Assembly/00-LANG.txt b/Lang/6502-Assembly/00-LANG.txt
index a7fa28ad34..1273acfa02 100644
--- a/Lang/6502-Assembly/00-LANG.txt
+++ b/Lang/6502-Assembly/00-LANG.txt
@@ -131,6 +131,29 @@ This flag is set if the BRK command was executed. The BRK basically
* Set with: BRK
* Cleared with: RTI
* There are no branches associated with this command.
+
+This flag is used only for differentiating a BRK from an hardware IRQ
+IRQ:
+ STA saveAccumulator ; save accumulator
+ PLA ; get flags
+ STA saveFlags ; save flags
+ AND #$10 ; check "break" flag
+ BNE IRQ_fromBreak ; if(break flag set){ goto IRQ_fromBreak; }
+ JMP IRQ_fromHardware ; else{ goto IRQ_fromInterrupt; }
+IRQ_fromBreak:
+ LDA saveFlags ; load flags from temp address
+ PHA ; restore flags to stack
+ LDA saveAccumulator ; restore accumulator
+ ;...
+ RTI ; return from interrupt
+
+IRQ_fromInterrupt:
+ LDA saveFlags ; load flags from temp address
+ PHA ; restore flags to stack
+ LDA saveAccumulator ; restore accumulator
+ ;...
+ RTI ; return from interrupt
+
BEGIN { ... } block.
-* ''List users who have /bin/ksh as a shell.''$ awk -F: '$7 == "/bin/ksh" { print $1 }' /etc/passwd
+* ''List users who have /bin/ksh as a shell.''$ awk -F: '$7 == "/bin/ksh" { print $1 }' /etc/passwd
AWK has only three types of variables: they are strings, floating-point numbers, and associative arrays (where every array index is a string).
Conversion between strings and numbers is automatic. AWK also has regular expressions, which appear in many AWK programs.
There are a few built-in functions, like cos() and sprintf().
-* ''Find average line length.''$ awk '{ cnt += length($0) } END { print cnt / NR }' /etc/rc
+* ''Find average line length.''$ awk '{ cnt += length($0) } END { print cnt / NR }' /etc/rc
The name "AWK" comes from the initials of Alfred Aho, Peter Weinberger and Brian Kernighan: they invented AWK during the 1970s.
A few decades later, Kernighan continues to maintain the [[nawk|reference implementation]] of AWK.
diff --git a/Lang/AWK/Bioinformatics-base-count b/Lang/AWK/Bioinformatics-base-count
deleted file mode 120000
index 0d26eb27e1..0000000000
--- a/Lang/AWK/Bioinformatics-base-count
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Bioinformatics-base-count/AWK
\ No newline at end of file
diff --git a/Lang/Action-/Bioinformatics-base-count b/Lang/Action-/Bioinformatics-base-count
deleted file mode 120000
index 2a7e093367..0000000000
--- a/Lang/Action-/Bioinformatics-base-count
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Bioinformatics-base-count/Action-
\ No newline at end of file
diff --git a/Lang/Action-/Quaternion-type b/Lang/Action-/Quaternion-type
deleted file mode 120000
index 0cfb07db30..0000000000
--- a/Lang/Action-/Quaternion-type
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Quaternion-type/Action-
\ No newline at end of file
diff --git a/Lang/Action-/Sorting-Algorithms-Circle-Sort b/Lang/Action-/Sorting-Algorithms-Circle-Sort
deleted file mode 120000
index a9db72f0ce..0000000000
--- a/Lang/Action-/Sorting-Algorithms-Circle-Sort
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Sorting-Algorithms-Circle-Sort/Action-
\ No newline at end of file
diff --git a/Lang/Ada/Bioinformatics-base-count b/Lang/Ada/Bioinformatics-base-count
deleted file mode 120000
index 59c9c9dde5..0000000000
--- a/Lang/Ada/Bioinformatics-base-count
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Bioinformatics-base-count/Ada
\ No newline at end of file
diff --git a/Lang/Ada/Miller-Rabin-primality-test b/Lang/Ada/Miller-Rabin-primality-test
deleted file mode 120000
index 79bf6fd437..0000000000
--- a/Lang/Ada/Miller-Rabin-primality-test
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Miller-Rabin-primality-test/Ada
\ No newline at end of file
diff --git a/Lang/Ada/Quaternion-type b/Lang/Ada/Quaternion-type
deleted file mode 120000
index 9dc0eab94d..0000000000
--- a/Lang/Ada/Quaternion-type
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Quaternion-type/Ada
\ No newline at end of file
diff --git a/Lang/Agena/00-LANG.txt b/Lang/Agena/00-LANG.txt
index c8171cc29e..5398f01156 100644
--- a/Lang/Agena/00-LANG.txt
+++ b/Lang/Agena/00-LANG.txt
@@ -20,6 +20,9 @@ The syntax looks like very simplified [[ALGOL 68]] with elements taken from [[Lu
== How has it been implemented ? ==
Agena is based on the [[ANSI]] [[C]] source code of [[Lua]], a popular and widely used Open Source programming language.
+== Todo ==
+[[Tasks not implemented in Agena]]
+
== See Also ==
[[ALGOL 68]]goboscript is a text-based programming language that compiles to Scratch. Write Scratch projects in text, and compile it into a .sb3 file -- which can be opened in the Scratch editor, TurboWarp or be uploaded to the Scratch website.
+
+===Package managers===
+Despite being a relatively new programming language, goboscript has multiple package managers.
+
+* [https://github.com/aspizu/backpack backpack] - The official goboscript package manager
+* [https://github.com/inflated-goboscript/inflator inflator] - A more powerful package manager inspired by Python's pip
\ No newline at end of file
diff --git a/Lang/Groovy/Empty-program b/Lang/Groovy/Empty-program
deleted file mode 120000
index 8d1c7a42ae..0000000000
--- a/Lang/Groovy/Empty-program
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Empty-program/Groovy
\ No newline at end of file
diff --git a/Lang/Haskell/Bioinformatics-base-count b/Lang/Haskell/Bioinformatics-base-count
deleted file mode 120000
index cf913dcdcd..0000000000
--- a/Lang/Haskell/Bioinformatics-base-count
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Bioinformatics-base-count/Haskell
\ No newline at end of file
diff --git a/Lang/Haskell/Miller-Rabin-primality-test b/Lang/Haskell/Miller-Rabin-primality-test
deleted file mode 120000
index c41f1ba06c..0000000000
--- a/Lang/Haskell/Miller-Rabin-primality-test
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Miller-Rabin-primality-test/Haskell
\ No newline at end of file
diff --git a/Lang/Haskell/Quaternion-type b/Lang/Haskell/Quaternion-type
deleted file mode 120000
index 14aca84bfa..0000000000
--- a/Lang/Haskell/Quaternion-type
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Quaternion-type/Haskell
\ No newline at end of file
diff --git a/Lang/Haskell/Sorting-Algorithms-Circle-Sort b/Lang/Haskell/Sorting-Algorithms-Circle-Sort
deleted file mode 120000
index 7f6f1559db..0000000000
--- a/Lang/Haskell/Sorting-Algorithms-Circle-Sort
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Sorting-Algorithms-Circle-Sort/Haskell
\ No newline at end of file
diff --git a/Lang/Icon/Miller-Rabin-primality-test b/Lang/Icon/Miller-Rabin-primality-test
deleted file mode 120000
index 0a9d526a8b..0000000000
--- a/Lang/Icon/Miller-Rabin-primality-test
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Miller-Rabin-primality-test/Icon
\ No newline at end of file
diff --git a/Lang/Idris/Quaternion-type b/Lang/Idris/Quaternion-type
deleted file mode 120000
index 6489466168..0000000000
--- a/Lang/Idris/Quaternion-type
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Quaternion-type/Idris
\ No newline at end of file
diff --git a/Lang/J/Bioinformatics-base-count b/Lang/J/Bioinformatics-base-count
deleted file mode 120000
index 78c6127b60..0000000000
--- a/Lang/J/Bioinformatics-base-count
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Bioinformatics-base-count/J
\ No newline at end of file
diff --git a/Lang/J/Meissel-Mertens-constant b/Lang/J/Meissel-Mertens-constant
deleted file mode 120000
index 04eb0042a3..0000000000
--- a/Lang/J/Meissel-Mertens-constant
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Meissel-Mertens-constant/J
\ No newline at end of file
diff --git a/Lang/J/Quaternion-type b/Lang/J/Quaternion-type
deleted file mode 120000
index 0868577467..0000000000
--- a/Lang/J/Quaternion-type
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Quaternion-type/J
\ No newline at end of file
diff --git a/Lang/J/Sorting-Algorithms-Circle-Sort b/Lang/J/Sorting-Algorithms-Circle-Sort
deleted file mode 120000
index c9563959dd..0000000000
--- a/Lang/J/Sorting-Algorithms-Circle-Sort
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Sorting-Algorithms-Circle-Sort/J
\ No newline at end of file
diff --git a/Lang/Java/Bioinformatics-base-count b/Lang/Java/Bioinformatics-base-count
deleted file mode 120000
index a3d5761560..0000000000
--- a/Lang/Java/Bioinformatics-base-count
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Bioinformatics-base-count/Java
\ No newline at end of file
diff --git a/Lang/Java/Meissel-Mertens-constant b/Lang/Java/Meissel-Mertens-constant
deleted file mode 120000
index f7dce3ca3d..0000000000
--- a/Lang/Java/Meissel-Mertens-constant
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Meissel-Mertens-constant/Java
\ No newline at end of file
diff --git a/Lang/Java/Miller-Rabin-primality-test b/Lang/Java/Miller-Rabin-primality-test
deleted file mode 120000
index 5708188da1..0000000000
--- a/Lang/Java/Miller-Rabin-primality-test
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Miller-Rabin-primality-test/Java
\ No newline at end of file
diff --git a/Lang/Java/Quaternion-type b/Lang/Java/Quaternion-type
deleted file mode 120000
index 3cf154640d..0000000000
--- a/Lang/Java/Quaternion-type
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Quaternion-type/Java
\ No newline at end of file
diff --git a/Lang/Java/Sorting-Algorithms-Circle-Sort b/Lang/Java/Sorting-Algorithms-Circle-Sort
deleted file mode 120000
index 2c7141e7c3..0000000000
--- a/Lang/Java/Sorting-Algorithms-Circle-Sort
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Sorting-Algorithms-Circle-Sort/Java
\ No newline at end of file
diff --git a/Lang/JavaScript/Bioinformatics-base-count b/Lang/JavaScript/Bioinformatics-base-count
deleted file mode 120000
index 033fba4ffa..0000000000
--- a/Lang/JavaScript/Bioinformatics-base-count
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Bioinformatics-base-count/JavaScript
\ No newline at end of file
diff --git a/Lang/JavaScript/Meissel-Mertens-constant b/Lang/JavaScript/Meissel-Mertens-constant
deleted file mode 120000
index 8dd5c0b197..0000000000
--- a/Lang/JavaScript/Meissel-Mertens-constant
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Meissel-Mertens-constant/JavaScript
\ No newline at end of file
diff --git a/Lang/JavaScript/Miller-Rabin-primality-test b/Lang/JavaScript/Miller-Rabin-primality-test
deleted file mode 120000
index 41f625032e..0000000000
--- a/Lang/JavaScript/Miller-Rabin-primality-test
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Miller-Rabin-primality-test/JavaScript
\ No newline at end of file
diff --git a/Lang/JavaScript/Quaternion-type b/Lang/JavaScript/Quaternion-type
deleted file mode 120000
index e2a6535526..0000000000
--- a/Lang/JavaScript/Quaternion-type
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Quaternion-type/JavaScript
\ No newline at end of file
diff --git a/Lang/Jq/Bioinformatics-base-count b/Lang/Jq/Bioinformatics-base-count
deleted file mode 120000
index 87df406d18..0000000000
--- a/Lang/Jq/Bioinformatics-base-count
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Bioinformatics-base-count/Jq
\ No newline at end of file
diff --git a/Lang/Jq/Quaternion-type b/Lang/Jq/Quaternion-type
deleted file mode 120000
index 36df977f17..0000000000
--- a/Lang/Jq/Quaternion-type
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Quaternion-type/Jq
\ No newline at end of file
diff --git a/Lang/Jq/Sorting-Algorithms-Circle-Sort b/Lang/Jq/Sorting-Algorithms-Circle-Sort
deleted file mode 120000
index acb625912d..0000000000
--- a/Lang/Jq/Sorting-Algorithms-Circle-Sort
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Sorting-Algorithms-Circle-Sort/Jq
\ No newline at end of file
diff --git a/Lang/Julia/Bioinformatics-base-count b/Lang/Julia/Bioinformatics-base-count
deleted file mode 120000
index 37835d6558..0000000000
--- a/Lang/Julia/Bioinformatics-base-count
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Bioinformatics-base-count/Julia
\ No newline at end of file
diff --git a/Lang/Julia/Meissel-Mertens-constant b/Lang/Julia/Meissel-Mertens-constant
deleted file mode 120000
index 24fa8f526c..0000000000
--- a/Lang/Julia/Meissel-Mertens-constant
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Meissel-Mertens-constant/Julia
\ No newline at end of file
diff --git a/Lang/Julia/Miller-Rabin-primality-test b/Lang/Julia/Miller-Rabin-primality-test
deleted file mode 120000
index 1a7339a0d3..0000000000
--- a/Lang/Julia/Miller-Rabin-primality-test
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Miller-Rabin-primality-test/Julia
\ No newline at end of file
diff --git a/Lang/Julia/Quaternion-type b/Lang/Julia/Quaternion-type
deleted file mode 120000
index 8a462d73ba..0000000000
--- a/Lang/Julia/Quaternion-type
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Quaternion-type/Julia
\ No newline at end of file
diff --git a/Lang/Julia/Sorting-Algorithms-Circle-Sort b/Lang/Julia/Sorting-Algorithms-Circle-Sort
deleted file mode 120000
index a8c5c2c2be..0000000000
--- a/Lang/Julia/Sorting-Algorithms-Circle-Sort
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Sorting-Algorithms-Circle-Sort/Julia
\ No newline at end of file
diff --git a/Lang/K/Empty-program b/Lang/K/Empty-program
deleted file mode 120000
index f255a9c6f6..0000000000
--- a/Lang/K/Empty-program
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Empty-program/K
\ No newline at end of file
diff --git a/Lang/Kotlin/Bioinformatics-base-count b/Lang/Kotlin/Bioinformatics-base-count
deleted file mode 120000
index 998809c6ab..0000000000
--- a/Lang/Kotlin/Bioinformatics-base-count
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Bioinformatics-base-count/Kotlin
\ No newline at end of file
diff --git a/Lang/Kotlin/Miller-Rabin-primality-test b/Lang/Kotlin/Miller-Rabin-primality-test
deleted file mode 120000
index 4a724f8c08..0000000000
--- a/Lang/Kotlin/Miller-Rabin-primality-test
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Miller-Rabin-primality-test/Kotlin
\ No newline at end of file
diff --git a/Lang/Kotlin/Quaternion-type b/Lang/Kotlin/Quaternion-type
deleted file mode 120000
index a85b316d4c..0000000000
--- a/Lang/Kotlin/Quaternion-type
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Quaternion-type/Kotlin
\ No newline at end of file
diff --git a/Lang/Kotlin/Sorting-Algorithms-Circle-Sort b/Lang/Kotlin/Sorting-Algorithms-Circle-Sort
deleted file mode 120000
index 74cde5ab2a..0000000000
--- a/Lang/Kotlin/Sorting-Algorithms-Circle-Sort
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Sorting-Algorithms-Circle-Sort/Kotlin
\ No newline at end of file
diff --git a/Lang/LSE/Empty-program b/Lang/LSE/Empty-program
deleted file mode 120000
index 16856f6969..0000000000
--- a/Lang/LSE/Empty-program
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Empty-program/LSE
\ No newline at end of file
diff --git a/Lang/Lambdatalk/Bioinformatics-base-count b/Lang/Lambdatalk/Bioinformatics-base-count
deleted file mode 120000
index 03508c2431..0000000000
--- a/Lang/Lambdatalk/Bioinformatics-base-count
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Bioinformatics-base-count/Lambdatalk
\ No newline at end of file
diff --git a/Lang/Liberty-BASIC/Miller-Rabin-primality-test b/Lang/Liberty-BASIC/Miller-Rabin-primality-test
deleted file mode 120000
index 01eccc1a73..0000000000
--- a/Lang/Liberty-BASIC/Miller-Rabin-primality-test
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Miller-Rabin-primality-test/Liberty-BASIC
\ No newline at end of file
diff --git a/Lang/Liberty-BASIC/Quaternion-type b/Lang/Liberty-BASIC/Quaternion-type
deleted file mode 120000
index 33da9602b0..0000000000
--- a/Lang/Liberty-BASIC/Quaternion-type
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Quaternion-type/Liberty-BASIC
\ No newline at end of file
diff --git a/Lang/Logo/Associative-array-Creation b/Lang/Logo/Associative-array-Creation
deleted file mode 120000
index 3776b1b4e9..0000000000
--- a/Lang/Logo/Associative-array-Creation
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Associative-array-Creation/Logo
\ No newline at end of file
diff --git a/Lang/Lua/Bioinformatics-base-count b/Lang/Lua/Bioinformatics-base-count
deleted file mode 120000
index cb9548dcc8..0000000000
--- a/Lang/Lua/Bioinformatics-base-count
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Bioinformatics-base-count/Lua
\ No newline at end of file
diff --git a/Lang/Lua/Empty-program b/Lang/Lua/Empty-program
deleted file mode 120000
index 451d4b192d..0000000000
--- a/Lang/Lua/Empty-program
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Empty-program/Lua
\ No newline at end of file
diff --git a/Lang/Lua/Miller-Rabin-primality-test b/Lang/Lua/Miller-Rabin-primality-test
deleted file mode 120000
index 45a2ff22f4..0000000000
--- a/Lang/Lua/Miller-Rabin-primality-test
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Miller-Rabin-primality-test/Lua
\ No newline at end of file
diff --git a/Lang/Lua/Quaternion-type b/Lang/Lua/Quaternion-type
deleted file mode 120000
index 09499b7f9c..0000000000
--- a/Lang/Lua/Quaternion-type
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Quaternion-type/Lua
\ No newline at end of file
diff --git a/Lang/Lua/Sorting-Algorithms-Circle-Sort b/Lang/Lua/Sorting-Algorithms-Circle-Sort
deleted file mode 120000
index e6dc299d24..0000000000
--- a/Lang/Lua/Sorting-Algorithms-Circle-Sort
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Sorting-Algorithms-Circle-Sort/Lua
\ No newline at end of file
diff --git a/Lang/M2000-Interpreter/00-LANG.txt b/Lang/M2000-Interpreter/00-LANG.txt
index 5e1cdf3a46..5d4d3cba07 100644
--- a/Lang/M2000-Interpreter/00-LANG.txt
+++ b/Lang/M2000-Interpreter/00-LANG.txt
@@ -471,4 +471,26 @@ M2000 Interpreter can work with Structures and Buffers. Buffer is a memory block
\\
Print Eval(P, 0!x)=1212.12~, Eval(P, 0!y)=21.1212~
}
-Kappa
\ No newline at end of file
+Kappa
+Module Kappa {
+ Function Theta(x) {
+ Structure Points_single {
+ x as single
+ y as single
+ }
+ Buffer Clear Points as Points_single*x
+ =Points
+ }
+ P=Theta(100)
+ Print Len(P)=800 ' 2x4x100 bytes
+ ' new way to use fields of structure
+ P[0]|x=1212.12
+ P[0]|y=21.1212
+ Print Eval(P, 0!x)=1212.12~, Eval(P, 0!y)=21.1212~
+ Print P[0]|x=1212.12~, P[0]|y=21.1212~
+ P[4]=P[0] ' copy of structure at offser 4*len of structrure Points_single
+ ' p(0) is address of first struct, p(4) is address of 5th struct
+ Print P[4]|x=1212.12~, P[4]|y=21.1212~, p(4)-p(0)=32
+}
+Kappa
+
\ No newline at end of file
diff --git a/Lang/M2000-Interpreter/Bioinformatics-base-count b/Lang/M2000-Interpreter/Bioinformatics-base-count
deleted file mode 120000
index a75bd15fc5..0000000000
--- a/Lang/M2000-Interpreter/Bioinformatics-base-count
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Bioinformatics-base-count/M2000-Interpreter
\ No newline at end of file
diff --git a/Lang/M2000-Interpreter/Miller-Rabin-primality-test b/Lang/M2000-Interpreter/Miller-Rabin-primality-test
deleted file mode 120000
index 70c84948c0..0000000000
--- a/Lang/M2000-Interpreter/Miller-Rabin-primality-test
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Miller-Rabin-primality-test/M2000-Interpreter
\ No newline at end of file
diff --git a/Lang/M2000-Interpreter/Quaternion-type b/Lang/M2000-Interpreter/Quaternion-type
deleted file mode 120000
index 7027a86930..0000000000
--- a/Lang/M2000-Interpreter/Quaternion-type
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Quaternion-type/M2000-Interpreter
\ No newline at end of file
diff --git a/Lang/M4/Empty-program b/Lang/M4/Empty-program
deleted file mode 120000
index 3ce502532c..0000000000
--- a/Lang/M4/Empty-program
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Empty-program/M4
\ No newline at end of file
diff --git a/Lang/MATLAB/Bioinformatics-base-count b/Lang/MATLAB/Bioinformatics-base-count
deleted file mode 120000
index 2622a73422..0000000000
--- a/Lang/MATLAB/Bioinformatics-base-count
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Bioinformatics-base-count/MATLAB
\ No newline at end of file
diff --git a/Lang/ML-I/Empty-program b/Lang/ML-I/Empty-program
deleted file mode 120000
index 48b06f2449..0000000000
--- a/Lang/ML-I/Empty-program
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Empty-program/ML-I
\ No newline at end of file
diff --git a/Lang/Maple/Empty-program b/Lang/Maple/Empty-program
deleted file mode 120000
index f9fceb04a1..0000000000
--- a/Lang/Maple/Empty-program
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Empty-program/Maple
\ No newline at end of file
diff --git a/Lang/Maple/Quaternion-type b/Lang/Maple/Quaternion-type
deleted file mode 120000
index dc174952ef..0000000000
--- a/Lang/Maple/Quaternion-type
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Quaternion-type/Maple
\ No newline at end of file
diff --git a/Lang/Mathematica/Bioinformatics-base-count b/Lang/Mathematica/Bioinformatics-base-count
deleted file mode 120000
index 986950c20f..0000000000
--- a/Lang/Mathematica/Bioinformatics-base-count
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Bioinformatics-base-count/Mathematica
\ No newline at end of file
diff --git a/Lang/Mathematica/Empty-program b/Lang/Mathematica/Empty-program
deleted file mode 120000
index 7445caa973..0000000000
--- a/Lang/Mathematica/Empty-program
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Empty-program/Mathematica
\ No newline at end of file
diff --git a/Lang/Mathematica/Meissel-Mertens-constant b/Lang/Mathematica/Meissel-Mertens-constant
deleted file mode 120000
index 8d1d0df59d..0000000000
--- a/Lang/Mathematica/Meissel-Mertens-constant
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Meissel-Mertens-constant/Mathematica
\ No newline at end of file
diff --git a/Lang/Mathematica/Miller-Rabin-primality-test b/Lang/Mathematica/Miller-Rabin-primality-test
deleted file mode 120000
index 400d0fb0e3..0000000000
--- a/Lang/Mathematica/Miller-Rabin-primality-test
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Miller-Rabin-primality-test/Mathematica
\ No newline at end of file
diff --git a/Lang/Mathematica/Quaternion-type b/Lang/Mathematica/Quaternion-type
deleted file mode 120000
index 700c56b146..0000000000
--- a/Lang/Mathematica/Quaternion-type
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Quaternion-type/Mathematica
\ No newline at end of file
diff --git a/Lang/Mathematica/Sorting-Algorithms-Circle-Sort b/Lang/Mathematica/Sorting-Algorithms-Circle-Sort
deleted file mode 120000
index 9ff1fc78ae..0000000000
--- a/Lang/Mathematica/Sorting-Algorithms-Circle-Sort
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Sorting-Algorithms-Circle-Sort/Mathematica
\ No newline at end of file
diff --git a/Lang/Maxima/Meissel-Mertens-constant b/Lang/Maxima/Meissel-Mertens-constant
deleted file mode 120000
index ea7cea2fda..0000000000
--- a/Lang/Maxima/Meissel-Mertens-constant
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Meissel-Mertens-constant/Maxima
\ No newline at end of file
diff --git a/Lang/Maxima/Miller-Rabin-primality-test b/Lang/Maxima/Miller-Rabin-primality-test
deleted file mode 120000
index 331b953779..0000000000
--- a/Lang/Maxima/Miller-Rabin-primality-test
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Miller-Rabin-primality-test/Maxima
\ No newline at end of file
diff --git a/Lang/MelonBasic/Empty-program b/Lang/MelonBasic/Empty-program
deleted file mode 120000
index 8fb3b62c73..0000000000
--- a/Lang/MelonBasic/Empty-program
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Empty-program/MelonBasic
\ No newline at end of file
diff --git a/Lang/Mercury/Miller-Rabin-primality-test b/Lang/Mercury/Miller-Rabin-primality-test
deleted file mode 120000
index 6022def69b..0000000000
--- a/Lang/Mercury/Miller-Rabin-primality-test
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Miller-Rabin-primality-test/Mercury
\ No newline at end of file
diff --git a/Lang/Mercury/Quaternion-type b/Lang/Mercury/Quaternion-type
deleted file mode 120000
index 34fd045795..0000000000
--- a/Lang/Mercury/Quaternion-type
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Quaternion-type/Mercury
\ No newline at end of file
diff --git a/Lang/MiniScript/Empty-program b/Lang/MiniScript/Empty-program
deleted file mode 120000
index 60da45f9ae..0000000000
--- a/Lang/MiniScript/Empty-program
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Empty-program/MiniScript
\ No newline at end of file
diff --git a/Lang/Modula-2/00-LANG.txt b/Lang/Modula-2/00-LANG.txt
index 854aa29a1a..62faf6e14c 100644
--- a/Lang/Modula-2/00-LANG.txt
+++ b/Lang/Modula-2/00-LANG.txt
@@ -26,4 +26,11 @@ Modula-2 was designed by Niklaus Wirth at ETH Zurich as a systems implementation
* [http://sourceforge.net/projects/schwarzerkaffee Schwarzer Kaffee]
==Modula-2 on IRC==
-* [irc://irc.freenode.net/#modula-2 irc://irc.freenode.net/#modula-2]
\ No newline at end of file
+* [irc://irc.freenode.net/#modula-2 irc://irc.freenode.net/#modula-2]
+
+===See also===
+* [[Modula-3]]
+* [[Oberon-07]]
+* [[Oberon-2]]
+* [[Component Pascal]]
+* [[Zonnon]]
\ No newline at end of file
diff --git a/Lang/Modula-3/00-LANG.txt b/Lang/Modula-3/00-LANG.txt
index 582f870540..aaa0f4b8bf 100644
--- a/Lang/Modula-3/00-LANG.txt
+++ b/Lang/Modula-3/00-LANG.txt
@@ -21,4 +21,11 @@ Its main implementation is [[Critical Mass Modula-3]].
Modula-3 influenced a few languages such as [[C Sharp|C#]], [[Java]], [[Ocaml]] and [[Python]].
==Links==
-* [http://en.wikipedia.org/wiki/Modula-3 Modula-3 at Wikipedia]
\ No newline at end of file
+* [http://en.wikipedia.org/wiki/Modula-3 Modula-3 at Wikipedia]
+
+===See also===
+* [[Modula-2]]
+* [[Oberon-07]]
+* [[Oberon-2]]
+* [[Component Pascal]]
+* [[Zonnon]]
\ No newline at end of file
diff --git a/Lang/Modula-3/Comments b/Lang/Modula-3/Comments
deleted file mode 120000
index 8c3489c305..0000000000
--- a/Lang/Modula-3/Comments
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Comments/Modula-3
\ No newline at end of file
diff --git a/Lang/NS-HUBASIC/Empty-program b/Lang/NS-HUBASIC/Empty-program
deleted file mode 120000
index 8edcb8591a..0000000000
--- a/Lang/NS-HUBASIC/Empty-program
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Empty-program/NS-HUBASIC
\ No newline at end of file
diff --git a/Lang/Nickle/00-LANG.txt b/Lang/Nickle/00-LANG.txt
index 53bb3afeae..e2643c2540 100644
--- a/Lang/Nickle/00-LANG.txt
+++ b/Lang/Nickle/00-LANG.txt
@@ -19,7 +19,7 @@ Other datatypes include multi-dimensional arrays, strings, structures, tagged un
The reference implementation includes an interactive top level with byte code compilation before evaluation.
Example:
-/* Arrays to JSON */
+/* Arrays to JSON */
autoimport JSON;
int [*] d = {1,2,3};
poly [*] p = {1, "abc", 42};
@@ -39,7 +39,8 @@ print f;
for (int i = 0; i < dim(p); i++) {
printf("%v ", p[i]);
}
-printf("\n");
+printf("\n");
+
{{out}}
prompt$ nickle sampler.5c
diff --git a/Lang/Nim/Bioinformatics-base-count b/Lang/Nim/Bioinformatics-base-count
deleted file mode 120000
index 14fcd687ff..0000000000
--- a/Lang/Nim/Bioinformatics-base-count
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Bioinformatics-base-count/Nim
\ No newline at end of file
diff --git a/Lang/Nim/Meissel-Mertens-constant b/Lang/Nim/Meissel-Mertens-constant
deleted file mode 120000
index 760c7d7443..0000000000
--- a/Lang/Nim/Meissel-Mertens-constant
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Meissel-Mertens-constant/Nim
\ No newline at end of file
diff --git a/Lang/Nim/Miller-Rabin-primality-test b/Lang/Nim/Miller-Rabin-primality-test
deleted file mode 120000
index 1ce4ac13f6..0000000000
--- a/Lang/Nim/Miller-Rabin-primality-test
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Miller-Rabin-primality-test/Nim
\ No newline at end of file
diff --git a/Lang/Nim/Quaternion-type b/Lang/Nim/Quaternion-type
deleted file mode 120000
index 384e273bfc..0000000000
--- a/Lang/Nim/Quaternion-type
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Quaternion-type/Nim
\ No newline at end of file
diff --git a/Lang/Nim/Sorting-Algorithms-Circle-Sort b/Lang/Nim/Sorting-Algorithms-Circle-Sort
deleted file mode 120000
index 80141c2866..0000000000
--- a/Lang/Nim/Sorting-Algorithms-Circle-Sort
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Sorting-Algorithms-Circle-Sort/Nim
\ No newline at end of file
diff --git a/Lang/OCaml/Quaternion-type b/Lang/OCaml/Quaternion-type
deleted file mode 120000
index cc65de3875..0000000000
--- a/Lang/OCaml/Quaternion-type
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Quaternion-type/OCaml
\ No newline at end of file
diff --git a/Lang/Oberon-07/00-LANG.txt b/Lang/Oberon-07/00-LANG.txt
index 3e769f71f7..fecc62a2b8 100644
--- a/Lang/Oberon-07/00-LANG.txt
+++ b/Lang/Oberon-07/00-LANG.txt
@@ -13,4 +13,18 @@
Oberon-07 contains a WHILE loop that allows multiple conditions and statements - similar to the loop in [[wp:Guarded_Command_Language|Edsgar Dijkstra's Guarded Command Language]], though with different syntax and without non-determinism. See [[Loops/N_plus_one_half#Oberon-07]] for an example.
-mov eax, [ebp+8] ; $8B8508000000 -> load the current stack address + 8 into the accumulator
-mov eax, [eax] ; $8B00 -> load memory pointed to by accumulator into accumulator
-mov ebx, [ebp+12] ; $8B9D0C000000-> load the current stack address + 12 into working register
-add [ebx],eax ; $0103 -> add accumulator to memory pointed to by working register
+mov eax, [ebp+8] ; $8B8508000000 -> Load the value at (EBP + 8) into EAX (1st function argument)
+mov eax, [eax] ; $8B00 -> Dereference EAX (load the value from the address stored in EAX)
+mov ebx, [ebp+12] ; $8B9D0C000000-> Load the value at (EBP + 12) into EBX (2nd function argument)
+add [ebx],eax ; $0103 -> Add EAX to the value stored at the address in EBX
So the language has stacked pointers (all parameters are passed by reference) to the two numbers via a number to another number and then it calls this code which gets the first number, and adds it to the second. Hopefully this example shows how high level and low level Plain English is at the same time.
@@ -251,4 +251,212 @@ https://forums.parallax.com/discussion/163792/plain-english-programming a long r
* [https://forums.parallax.com/discussion/163792/plain-english-programming Plain English Programming]
==Todo==
-[[Reports:Tasks_not_implemented_in_PlainEnglish]]
\ No newline at end of file
+[[Reports:Tasks_not_implemented_in_PlainEnglish]]
+
+=Plain English Sources=
+[https://en.WikipediA.org/wiki/Integrated_development_environment IDE ]
+and Compiler.
+==Creators==
+* Gerry Rzeppa (Father)
+[https://www.quora.com/profile/Gerry-Rzeppa Quora Profile]
+[https://www.linkedin.com/in/gerry-rzeppa-17b8051b/ LinkedIn Profile]
+[https://twitter.com/gerryrzeppa Twitter Profile]
+[https://github.com/GerryRzeppa GitHub Profile]
+* Dan Rzeppa (Son)
+[https://github.com/danrzeppa GitHub Profile]
+
+==Contributors==
+* Elender Góis Gallas (Plain Portuguese Creator)
+[https://www.quora.com/profile/Elender-G%C3%B3is-Gallas-%E3%82%A8%E3%83%AC%E3%83%B3%E3%83%87-%E3%82%AC%E3%83%A9%E3%82%B9 Quora Profile]
+[https://www.linkedin.com/in/elender/ LinkedIn Profile]
+[https://twitter.com/elenderg Twitter Profile]
+[https://github.com/elenderg GitHub Profile]
+* Pablo Cayuela (Plain Spanish Creator)
+[https://www.linkedin.com/in/pablo-cayuela-a42b019/ LinkedIn Profile]
+
+==Copyright Owner==
+* The Osmosian Order
+** [http://www.Osmosian.com/ The Osmosian Order of Plain English Programmers] Brochure
+*** [http://www.osmosian.com/manifesto.pdf The Osmosian Manifesto]
+** [https://OsmosianPlainEnglishProgramming.blog/ Wordpress Blog] IDE including Compiler==
+===Creator supplied===
+*[http://www.osmosian.com/cal-3040.zip cal-3040] 2006/08/14
+**[http://www.osmosian.com/ebnf EBNF]
+**[http://www.osmosian.com/instructions.pdf instructions]
+*[http://www.osmosian.com/cal-4700.zip cal-4700] 2017/01/27
+
+===GitHub===
+*[https://GitHub.com/GerryRzeppa/osmosian /GerryRzeppa/osmosian] cal-3040
+*[https://GitHub.com/Folds/osmosian /Folds/osmosian] cal-3040 (Unauthorized)
+*[https://GitHub.com/elenderg/Portugues-Puro /elenderg/Portugues-Puro] cal-4700 Translated to Portuguese
+
+==Forums==
+===[https://www.AnandTech.com/ AnandTech]===
+*[https://forums.anandtech.com/threads/natural-language-programming.2358744/ Natural Language Programming: Good Idea? Yes Maybe No]
+*[https://forums.anandtech.com/threads/conversational-storytelling-with-javascript.2410448/ Conversational Storytelling with JavaScript]
+*[https://forums.anandtech.com/threads/natural-language-programming-english-and-or-español.2559516/ Natural Language Programming -- English and/or Español]
+*[https://forums.anandtech.com/threads/learning-programming.2406202/#post-36858285 Learning programming]
+*[https://forums.anandtech.com/threads/official-free-tools-thread.199156/page-4#post-36861957 Official Free Tools Thread | Plain English contribution]
+*[https://news.yCombinator.com/item?id=8719957 Plain English Programming (2013)]
+*[https://news.yCombinator.com/item?id=19355965 Do You Approve the Plain English?]
+===[https://Forum.Arduino.cc/ Arduino]===
+*[https://forum.arduino.cc/t/plain-english-programming/371096/15 Plain English Programming]
+===[https://groups.google.com/g/comp.compilers/ comp.compilers]===
+*[https://groups.google.com/g/comp.compilers/c/p30I_zVRlps/m/9UshbYjqZzwJ Writing A Plain English Compiler]
+*[https://groups.google.com/g/comp.compilers/c/4t3_Dq6foFA/m/CYfdnKMBkAsJ Re: A Plain English Compiler]
+===[https://www.GeeksForGeeks.org/ GeeksForGeeks]===
+*[https://www.geeksforgeeks.org/the-malevolent-mathemagician-natural-language-programming/ The Malevolent Mathemagician | Natural Language Programming]
+*[https://www.geeksforgeeks.org/creating-wysiwyg-document-editor/ Creating WYSIWYG Document Editor | Natural Language Programming]
+*[https://www.geeksforgeeks.org/a-kobayashi-maru-approach-to-finding-primes/ A Kobayashi Maru Approach to Finding Primes]
+*[https://www.geeksforgeeks.org/natural-language-programming-sorting/ Sorting | Natural Language Programming]
+*[https://www.geeksforgeeks.org/natural-language-programming-teaching-kids/ Natural Language Programming — Teaching Kids]
+*[https://www.geeksforgeeks.org/natural-language-programming/ Natural Language Programming]
+===[https://IntFiction.org/ Interactive Fiction Community Forum]===
+*[https://intfiction.org/t/writer-wanted-for-a-conversational-storytelling-project/6169 Writer wanted for a “Conversational Storytelling” project]
+*[https://intfiction.org/t/inform-system-developers-do-you-approve-the-plain-english-programming/42213 Inform system developers, do you approve the Plain English Programming?]
+===[https://Forums.Parallax.com/ Parallax Forums]===
+*[https://forums.parallax.com/discussion/163792/plain-english-programming Plain English Programming]
+===[https://www.PC-Control.co.uk/ PC Control Limited]===
+*[https://www.pc-control.co.uk/control/articles/article10.php Automated Maze solver using a servo hawk]
+**[https://www.pc-control.co.uk/control/articles/images/photo%2009%20-%20definitions.png photo 09 - definitions]
+**[https://www.pc-control.co.uk/control/articles/images/photo%2010%20-%20low-level%20helper%20routines.png photo 10 - low-level helper routines]
+**[https://www.pc-control.co.uk/control/articles/images/photo%2011%20-%20mid-level%20helper%20routines.png photo 11 - mid-level helper routines]
+**[https://www.pc-control.co.uk/control/articles/images/photo%2012%20-%20high-level%20helper%20routines.png photo 12 - high-level helper routines]
+**[https://www.pc-control.co.uk/control/articles/images/photo%2013%20-%20main%20routine.png photo 13 - main routine]
+**[https://www.pc-control.co.uk/control/articles/images/photo%2014%20-%20terminal%20output.png photo 14 - terminal output]
+===[https://www.Quora.com/ Quora]===
+*Jul 06, 2021 - [https://www.quora.com/What-can-a-beginner-programmer-use-as-a-programming-IDE-I-tried-using-Visual-Studio-Express-but-it-was-too-hard-to-use-and-understand-Is-there-anything-else-I-can-use/answer/Gerry-Rzeppa What can a beginner programmer use as a programming IDE? I tried using Visual Studio Express but it was too hard to use and understand. Is there anything else I can use?]
+**"To get started with Plain English, see here (it’s fast, friendly, and free):"
+**Reference to another Gerry Rzeppa Quora article: Jun 27, 2021 - [https://www.quora.com/Is-there-a-right-way-to-learn-to-code-1/answer/Gerry-Rzeppa Is there a right way to learn to code?]
+*Jul 06, 2021 - [https://www.quora.com/How-often-when-puzzling-out-a-solution-to-a-problem-do-you-think-or-say-aloud-Are-we-asking-the-right-question-questions/answer/Gerry-Rzeppa How often when puzzling out a solution to a problem, do you think or say aloud, “Are we asking the right question/questions?”]
+**"Almost every time."
+**Reference to another Gerry Rzeppa Quora article: May 11, 2021 [https://www.quora.com/What-IDE-has-impressed-you-with-its-ease-of-use-and-how-productive-were-you-with-it/answer/Gerry-Rzeppa What IDE has impressed you with its ease of use, and how productive were you with it?]
+*Jul 06, 2021 - [https://www.quora.com/What-are-the-best-examples-of-poetry-written-in-programming-languages/answer/Gerry-Rzeppa What are the best examples of poetry written in programming languages?]
+**A poem written in Plain English that, when run, makes the picture the poem describes.
+*Jul 05, 2021 - [https://www.quora.com/What-is-the-character-limit-for-one-line-of-code-you-go-by/answer/Gerry-Rzeppa What is the character limit for one line of code you go by?]
+**"... if handwritten code fits on the screen, it’s okay by me."
+*Jul 05, 2021 - [https://www.quora.com/How-is-a-one-dimensional-character-array-and-a-string-similar/answer/Gerry-Rzeppa How is a one-dimensional character array and a string similar?]
+
+**Strings
+**Substrings
+**String Riders
+*Jun 27, 2021 - [https://www.quora.com/Is-there-a-right-way-to-learn-to-code-1/answer/Gerry-Rzeppa Is there a right way to learn to code?]
+**A offering of the Plain English IDE and personal tutoring.
+*Jun 10, 2021 - [https://www.quora.com/Is-there-any-way-to-write-genuine-self-modifying-code-in-Windows/answer/Gerry-Rzeppa Is there any way to write genuine self-modifying code in Windows?]
+
+**Memory Map
+**Memory Pointers
+*Jun 10, 2021 - [https://www.quora.com/How-can-I-write-a-Python-program-where-a-bunch-of-students-will-be-assigned-thesis-themes-using-the-FIFO-method/answer/Gerry-Rzeppa How can I write a Python program where a bunch of students will be assigned thesis themes using the FIFO method?]
+** Use of path variable.
+** Iterative development.
+** Relation of item in a list and the name of the list.
+** Screen space management.
+** Use of "backwards".
+*Jun 09, 2021 - [https://www.quora.com/How-do-computers-execute-if-statements-to-the-core-machine-code-and-opcodes/answer/Gerry-Rzeppa How do computers execute if statements to the core machine code and opcodes?]
+
+** List command and explanation of display produced
+** Memory Map
+** Uses [https://defuse.ca/online-x86-assembler.htm Online x86 and x64 Intel Instruction Assembler] to disassemble code in the List output.
+** Offers free “How to Write a Plain English Compiler in Plain English” course via email.
+*Jun 08, 2021 - [https://www.quora.com/How-can-I-draw-the-flag-of-a-country-in-C-beginner/answer/Gerry-Rzeppa How can I draw the flag of a country in C#? (beginner)]
+** Make a box
+** Center the box
+** Draw and fill the box
+** Stroke
+*Jun 07, 2021 - [https://www.quora.com/Is-it-wise-to-ask-query-like-why-curly-braces-are-preferred-in-C-instead-of-opening-and-closing-bracket-when-writing-functions-or-we-just-need-to-memorize-that-as-a-random-rule-Is-there-any-book-which-deals-with/answer/Gerry-Rzeppa Is it wise to ask query like why curly braces are preferred in C instead of opening and closing bracket when writing functions, or we just need to memorize that as a random rule? Is there any book which deals with such miscellaneous things about C?]
+** “Arbitrary and unnecessary rule”
+*Jun 06, 2021 - [https://www.quora.com/How-would-I-go-about-creating-dots-and-boxes-in-Java/answer/Gerry-Rzeppa How would I go about creating dots and boxes in Java?]
+*Jun 06, 2021 - [https://www.quora.com/How-can-I-write-a-menu-driven-program-to-perform-following-operations-on-the-stack-using-array-a-i-Push-ii-Pop-iii-Peek/answer/Gerry-Rzeppa How can I write a menu-driven program to perform the following operations on the stack using array- a (i) Push (ii) Pop (iii) Peek?]
+*Jun 06, 2021 - [https://www.quora.com/How-do-I-make-a-countdown-and-when-it-finishes-it-shows-a-text-in-coding-I-want-to-add-a-picture-as-a-border-or-what-else-to-countdown/answer/Gerry-Rzeppa How do I make a countdown and when it finishes, it shows a text in coding? I want to add a picture as a border or what else to countdown.]
+*Jun 06, 2021 - [https://www.quora.com/What-is-recursion-Can-you-explain-the-main-principles-of-recursions-Can-you-do-the-code-algorithm-of-the-Fibonacci-series-using-recursion/answer/Gerry-Rzeppa What is recursion? Can you explain the main principles of recursions? Can you do the code/algorithm of the Fibonacci series using recursion?]
+*Jun 06, 2021 - [https://www.quora.com/How-do-you-find-the-intersection-point-between-a-line-and-a-rectangle-algorithm-geometry-line-intersection-development/answer/Gerry-Rzeppa What is recursion? How do you find the intersection point between a line and a rectangle (algorithm, geometry, line, intersection, development)?]
+*Jun 06, 2021 - [https://www.quora.com/How-do-you-handle-algorithms-to-create-polygons-no-Thiesen-Voronoi-Python-Shapely-Voronoi-development/answer/Gerry-Rzeppa How do you handle algorithms to create polygons (no Thiesen/Voronoi) (Python, Shapely, Voronoi, development)?]
+*Jun 04, 2021 - [https://www.quora.com/I-want-to-get-into-programming-What-languages-should-I-learn-first/answer/Gerry-Rzeppa I want to get into programming. What languages should I learn first?]
+*Jun 04, 2021 - [https://www.quora.com/How-do-I-make-a-programme-using-codes/answer/Gerry-Rzeppa How do I make a programme using codes?]
+*Jun 04, 2021 - [https://www.quora.com/Why-is-Hello-World-the-default-line-in-programming-languages/answer/Gerry-Rzeppa Why is "Hello World" the default line in programming languages?]
+*Jun 04, 2021 - [https://www.quora.com/Why-cant-I-find-any-real-photo-of-a-compiler-Is-it-too-small/answer/Gerry-Rzeppa Why can't I find any real photo of a compiler? Is it too small?]
+*Jun 03, 2021 - [https://www.quora.com/Why-must-the-starting-value-of-a-control-variable-be-less-than-the-ending-value-in-a-for-loop-expression/answer/Gerry-Rzeppa Why must the starting value of a control variable be less than the ending value in a for loop expression?]
+*Jun 03, 2021 - [https://www.quora.com/What-is-the-purpose-of-initialization-of-counter-variable-in-a-loop/answer/Gerry-Rzeppa What is the purpose of "initialization of counter variable" in a loop?]
+*Jun 03, 2021 - [https://www.quora.com/What-is-the-nature-of-a-variable-with-real-life-examples/answer/Gerry-Rzeppa What is the nature of a variable with real life examples?]
+*Jun 03, 2021 - [https://www.quora.com/Why-is-UML-a-significant-area-of-study/answer/Gerry-Rzeppa Why is UML a significant area of study?]
+*May 29, 2021 [https://www.quora.com/Is-it-easier-to-write-an-interpreter-than-a-compiler-Why/answer/Gerry-Rzeppa Is it easier to write an interpreter than a compiler? Why?]
+**"Yes. An interpreter can be written with less knowledge of the hardware and operating system."
+**Reference to another Gerry Rzeppa Quora article: May 18, 2021 [https://www.quora.com/How-do-I-make-programming-language/answer/Gerry-Rzeppa How do I make programming language?]
+*May 18, 2021 [https://www.quora.com/How-do-I-make-programming-language/answer/Gerry-Rzeppa How do I make programming language?]
+**Reference to another Gerry Rzeppa Quora article: Dec 22, 2020 [https://www.quora.com/How-do-you-start-writing-your-interpreter-from-scratch/answer/Gerry-Rzeppa How do you start writing your interpreter from scratch?]
+**Reference to another Gerry Rzeppa Quora article: Aug 30, 2020 [https://www.quora.com/What-is-a-compiler-and-the-stages-of-a-compiler/answer/Gerry-Rzeppa What is a compiler and the stages of a compiler?]
+*May 11, 2021 [https://www.quora.com/What-IDE-has-impressed-you-with-its-ease-of-use-and-how-productive-were-you-with-it/answer/Gerry-Rzeppa What IDE has impressed you with its ease of use, and how productive were you with it?]
+*Apr 28, 2021 - [https://www.quora.com/I-need-some-good-project-related-to-data-structure-I-am-a-2rd-year-computer-science-student-What-is-your-suggestion/answer/Gerry-Rzeppa I need some good project related to data structure. I am a 2rd year computer science student. What is your suggestion?]
+
+**Data types
+***Fundamental
+****byte
+****record
+***Pointers
+****Generic
+****Typed
+***Strings
+***Things
+****Stacks
+****Queues
+****Hashed Indices
+**Memory Map
+**WYSIWYG document editor
+*Apr 12, 2021 - [https://www.quora.com/What-is-the-relationship-between-a-compiler-algorithm-and-data-structure/answer/Gerry-Rzeppa What is the relationship between a compiler, algorithm, and data structure?]
+** "A compiler uses data structures and algorithms to translate high-level source code into low-level executable machine code."
+** Discussion of the Plain English compiler
+*Mar 29, 2021 - [https://www.quora.com/What-is-the-most-interesting-Python-algorithm-in-less-than-ten-lines-of-code/answer/Gerry-Rzeppa What is the most interesting Python algorithm in less than ten lines of code?]
+**Lindenmayer interpreter
+*Mar 27, 2021 - [https://www.quora.com/What-is-the-best-way-to-present-an-algorithm/answer/Gerry-Rzeppa What is the best way to present an algorithm?]
+**Three-step process
+*Mar 24, 2021 - [https://www.quora.com/Why-is-it-hard-to-understand-linked-lists-in-programming/answer/Gerry-Rzeppa Why is it hard to understand linked lists in programming?]
+**Discuss Plain English linked list.
+*Dec 22, 2020 [https://www.quora.com/How-do-you-start-writing-your-interpreter-from-scratch/answer/Gerry-Rzeppa How do you start writing your interpreter from scratch?]
+** “primitive” BASIC editor/interpreter
+*Oct 03, 2020 - [https://www.quora.com/In-procedural-programming-how-do-you-plan-your-code-without-UML/answer/Gerry-Rzeppa In procedural programming, how do you plan your code without UML?]
+**Osmosian maxim: “If it’s hard, it’s wrong.”
+**Pair Programming
+**"During the winter of 2005-2006, we wrote (and documented) 25,000 lines of Plain English code in just six months ..."
+**'“Just tell us what you need, sonny, and we’ll show you how to live without it.”'
+*Aug 30, 2020 [https://www.quora.com/What-is-a-compiler-and-the-stages-of-a-compiler/answer/Gerry-Rzeppa What is a compiler and the stages of a compiler?]
+**Structure of the Plain English compiler.
+*Jul 09, 2020 - [https://www.quora.com/Who-can-print-this-string-Hello-world-more-smartly-and-clearly/answer/Gerry-Rzeppa Who can print this string "Hello world" more smartly and clearly?]
+**Plain English program to print in a circle.
+**Español Llano (Plain Spanish) program to print in a circle.
+*Jun 08, 2020 - [https://www.quora.com/Why-do-some-programmers-write-their-own-compilers/answer/Gerry-Rzeppa Why do some programmers write their own compilers?]
+**'My elder son and I wrote our own Plain English compiler and IDE, in Plain English, originally, for three reasons. We wanted to know:'
+***'1. Is it easier to program when you don’t have to translate your natural-language thoughts into an alternate syntax?'
+***'2. Can natural languages be parsed in a relatively “sloppy” manner (as humans apparently parse them) and still provide a stable enough environment for productive programming?'
+***'3. Can low-level programs (like compilers) be conveniently and efficiently written in high level languages (like English)?
+**'Turns out the answers to all of three questions is, “Yes!”'
+
+==Successor Project (Trial)==
+*[https://www.indiegogo.com/projects/the-hybrid-programming-language#/ The Hybrid Programming Language] - Plain English with snippets of formulas and graphics where needed
\ No newline at end of file
diff --git a/Lang/Pluto/00-LANG.txt b/Lang/Pluto/00-LANG.txt
index debf9ec69a..80e65c9293 100644
--- a/Lang/Pluto/00-LANG.txt
+++ b/Lang/Pluto/00-LANG.txt
@@ -31,6 +31,12 @@ Here is a list of custom libraries used on Rosetta Code:
|-
|13 || [[:Category:Pluto-uchar|uchar]] || 14 || [[:Category:Pluto-gchar|gchar]]
|-
+|15 || [[:Category:Pluto-matrix|matrix]] || 16 || [[:Category:Pluto-poly|poly]]
+|-
+|17 || [[:Category:Pluto-audio|audio]] || 18 || [[:Category:Pluto-bitmap|bitmap]]
+|-
+|19 || [[:Category:Pluto-lsystem|lsystem]] || 20 || [[:Category:Pluto-bignum|bignum]]
+|-
|}
== To do ==
diff --git a/Lang/PowerShell/Quaternion-type b/Lang/PowerShell/Quaternion-type
deleted file mode 120000
index 60f8156bec..0000000000
--- a/Lang/PowerShell/Quaternion-type
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Quaternion-type/PowerShell
\ No newline at end of file
diff --git a/Lang/Prolog/Miller-Rabin-primality-test b/Lang/Prolog/Miller-Rabin-primality-test
deleted file mode 120000
index 77f0bc56fd..0000000000
--- a/Lang/Prolog/Miller-Rabin-primality-test
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Miller-Rabin-primality-test/Prolog
\ No newline at end of file
diff --git a/Lang/Prolog/Quaternion-type b/Lang/Prolog/Quaternion-type
deleted file mode 120000
index 458f5f70bc..0000000000
--- a/Lang/Prolog/Quaternion-type
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Quaternion-type/Prolog
\ No newline at end of file
diff --git a/Lang/PureBasic/Bioinformatics-base-count b/Lang/PureBasic/Bioinformatics-base-count
deleted file mode 120000
index 16be5f27be..0000000000
--- a/Lang/PureBasic/Bioinformatics-base-count
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Bioinformatics-base-count/PureBasic
\ No newline at end of file
diff --git a/Lang/PureBasic/Meissel-Mertens-constant b/Lang/PureBasic/Meissel-Mertens-constant
deleted file mode 120000
index 81f0bd26b3..0000000000
--- a/Lang/PureBasic/Meissel-Mertens-constant
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Meissel-Mertens-constant/PureBasic
\ No newline at end of file
diff --git a/Lang/PureBasic/Miller-Rabin-primality-test b/Lang/PureBasic/Miller-Rabin-primality-test
deleted file mode 120000
index af69162304..0000000000
--- a/Lang/PureBasic/Miller-Rabin-primality-test
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Miller-Rabin-primality-test/PureBasic
\ No newline at end of file
diff --git a/Lang/PureBasic/Quaternion-type b/Lang/PureBasic/Quaternion-type
deleted file mode 120000
index 6551ed8e89..0000000000
--- a/Lang/PureBasic/Quaternion-type
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Quaternion-type/PureBasic
\ No newline at end of file
diff --git a/Lang/Python/Bioinformatics-base-count b/Lang/Python/Bioinformatics-base-count
deleted file mode 120000
index 7f8a0873e8..0000000000
--- a/Lang/Python/Bioinformatics-base-count
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Bioinformatics-base-count/Python
\ No newline at end of file
diff --git a/Lang/Python/Meissel-Mertens-constant b/Lang/Python/Meissel-Mertens-constant
deleted file mode 120000
index 04fd530b92..0000000000
--- a/Lang/Python/Meissel-Mertens-constant
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Meissel-Mertens-constant/Python
\ No newline at end of file
diff --git a/Lang/Python/Miller-Rabin-primality-test b/Lang/Python/Miller-Rabin-primality-test
deleted file mode 120000
index 4ec507954a..0000000000
--- a/Lang/Python/Miller-Rabin-primality-test
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Miller-Rabin-primality-test/Python
\ No newline at end of file
diff --git a/Lang/Python/Quaternion-type b/Lang/Python/Quaternion-type
deleted file mode 120000
index 4219e34b85..0000000000
--- a/Lang/Python/Quaternion-type
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Quaternion-type/Python
\ No newline at end of file
diff --git a/Lang/Python/Sorting-Algorithms-Circle-Sort b/Lang/Python/Sorting-Algorithms-Circle-Sort
deleted file mode 120000
index 3e7a80b339..0000000000
--- a/Lang/Python/Sorting-Algorithms-Circle-Sort
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Sorting-Algorithms-Circle-Sort/Python
\ No newline at end of file
diff --git a/Lang/QBasic/Repeat-a-string b/Lang/QBasic/Repeat-a-string
deleted file mode 120000
index 4c99978a73..0000000000
--- a/Lang/QBasic/Repeat-a-string
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Repeat-a-string/QBasic
\ No newline at end of file
diff --git a/Lang/Quackery/00-LANG.txt b/Lang/Quackery/00-LANG.txt
index 7eab14d4c5..b70d597b46 100644
--- a/Lang/Quackery/00-LANG.txt
+++ b/Lang/Quackery/00-LANG.txt
@@ -3,7 +3,7 @@
{{language programming paradigm|Imperative}}
Quackery is an open-source, lightweight, entry-level concatenative language for educational and recreational programming, and an extensible compiler for a hypothetical processor, the Quackery Engine.
-It is coded as a Python 3 function in about 48k of Pythonscript, about half of which is a string of Quackery code.
+It is coded as a Python 3 function in about 50k of Pythonscript, about half of which is a string of Quackery code.
The Quackery GitHub repository, which includes the Quackery manual "The Book of Quackery" as a pdf, is at [https://github.com/GordonCharlton/Quackery github.com/GordonCharlton/Quackery].
diff --git a/Lang/Quackery/Bioinformatics-base-count b/Lang/Quackery/Bioinformatics-base-count
deleted file mode 120000
index 65cab8d1ed..0000000000
--- a/Lang/Quackery/Bioinformatics-base-count
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Bioinformatics-base-count/Quackery
\ No newline at end of file
diff --git a/Lang/Quackery/Miller-Rabin-primality-test b/Lang/Quackery/Miller-Rabin-primality-test
deleted file mode 120000
index d8e4ec56b5..0000000000
--- a/Lang/Quackery/Miller-Rabin-primality-test
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Miller-Rabin-primality-test/Quackery
\ No newline at end of file
diff --git a/Lang/Quackery/Sorting-Algorithms-Circle-Sort b/Lang/Quackery/Sorting-Algorithms-Circle-Sort
deleted file mode 120000
index e4abaee49d..0000000000
--- a/Lang/Quackery/Sorting-Algorithms-Circle-Sort
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Sorting-Algorithms-Circle-Sort/Quackery
\ No newline at end of file
diff --git a/Lang/Quite-BASIC/Empty-program b/Lang/Quite-BASIC/Empty-program
deleted file mode 120000
index fb2bfba5b2..0000000000
--- a/Lang/Quite-BASIC/Empty-program
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Empty-program/Quite-BASIC
\ No newline at end of file
diff --git a/Lang/R/Bioinformatics-base-count b/Lang/R/Bioinformatics-base-count
deleted file mode 120000
index 2ca416a985..0000000000
--- a/Lang/R/Bioinformatics-base-count
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Bioinformatics-base-count/R
\ No newline at end of file
diff --git a/Lang/R/Quaternion-type b/Lang/R/Quaternion-type
deleted file mode 120000
index 2e826895b9..0000000000
--- a/Lang/R/Quaternion-type
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Quaternion-type/R
\ No newline at end of file
diff --git a/Lang/REBOL/00-LANG.txt b/Lang/REBOL/00-LANG.txt
deleted file mode 100644
index f5919f4e5a..0000000000
--- a/Lang/REBOL/00-LANG.txt
+++ /dev/null
@@ -1,5 +0,0 @@
-{{stub}}{{language|REBOL
-|site=http://rebol.com}}
-REBOL stands for Relative Expression Based Object Language.
-
-See also: [https://rosettacode.org/wiki/Category:Rebol Category:Rebol]
\ No newline at end of file
diff --git a/Lang/REBOL/00-META.yaml b/Lang/REBOL/00-META.yaml
deleted file mode 100644
index 58070bb517..0000000000
--- a/Lang/REBOL/00-META.yaml
+++ /dev/null
@@ -1,2 +0,0 @@
----
-from: http://rosettacode.org/wiki/Category:REBOL
diff --git a/Lang/REBOL/100-doors b/Lang/REBOL/100-doors
deleted file mode 120000
index 3c604849c4..0000000000
--- a/Lang/REBOL/100-doors
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/100-doors/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/15-puzzle-game b/Lang/REBOL/15-puzzle-game
deleted file mode 120000
index ca19266202..0000000000
--- a/Lang/REBOL/15-puzzle-game
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/15-puzzle-game/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/9-billion-names-of-God-the-integer b/Lang/REBOL/9-billion-names-of-God-the-integer
deleted file mode 120000
index d19b039600..0000000000
--- a/Lang/REBOL/9-billion-names-of-God-the-integer
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/9-billion-names-of-God-the-integer/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/99-bottles-of-beer b/Lang/REBOL/99-bottles-of-beer
deleted file mode 120000
index 464d38e243..0000000000
--- a/Lang/REBOL/99-bottles-of-beer
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/99-bottles-of-beer/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/A+B b/Lang/REBOL/A+B
deleted file mode 120000
index a6531c3ec1..0000000000
--- a/Lang/REBOL/A+B
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/A+B/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Abstract-type b/Lang/REBOL/Abstract-type
deleted file mode 120000
index c01205f584..0000000000
--- a/Lang/REBOL/Abstract-type
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Abstract-type/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Accumulator-factory b/Lang/REBOL/Accumulator-factory
deleted file mode 120000
index 9f94ac82f1..0000000000
--- a/Lang/REBOL/Accumulator-factory
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Accumulator-factory/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Ackermann-function b/Lang/REBOL/Ackermann-function
deleted file mode 120000
index bb556d5ce8..0000000000
--- a/Lang/REBOL/Ackermann-function
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Ackermann-function/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Add-a-variable-to-a-class-instance-at-runtime b/Lang/REBOL/Add-a-variable-to-a-class-instance-at-runtime
deleted file mode 120000
index 901f7e7487..0000000000
--- a/Lang/REBOL/Add-a-variable-to-a-class-instance-at-runtime
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Add-a-variable-to-a-class-instance-at-runtime/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Align-columns b/Lang/REBOL/Align-columns
deleted file mode 120000
index 67ffa18d54..0000000000
--- a/Lang/REBOL/Align-columns
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Align-columns/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Amicable-pairs b/Lang/REBOL/Amicable-pairs
deleted file mode 120000
index 238ed42eb6..0000000000
--- a/Lang/REBOL/Amicable-pairs
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Amicable-pairs/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Animation b/Lang/REBOL/Animation
deleted file mode 120000
index 0fccfbad33..0000000000
--- a/Lang/REBOL/Animation
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Animation/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Anonymous-recursion b/Lang/REBOL/Anonymous-recursion
deleted file mode 120000
index 5c9e13cbb0..0000000000
--- a/Lang/REBOL/Anonymous-recursion
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Anonymous-recursion/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Apply-a-callback-to-an-array b/Lang/REBOL/Apply-a-callback-to-an-array
deleted file mode 120000
index a9a331e92d..0000000000
--- a/Lang/REBOL/Apply-a-callback-to-an-array
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Apply-a-callback-to-an-array/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Arithmetic-Integer b/Lang/REBOL/Arithmetic-Integer
deleted file mode 120000
index acafb7724e..0000000000
--- a/Lang/REBOL/Arithmetic-Integer
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Arithmetic-Integer/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Array-concatenation b/Lang/REBOL/Array-concatenation
deleted file mode 120000
index 679c10ed62..0000000000
--- a/Lang/REBOL/Array-concatenation
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Array-concatenation/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Array-length b/Lang/REBOL/Array-length
deleted file mode 120000
index d083adde64..0000000000
--- a/Lang/REBOL/Array-length
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Array-length/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Arrays b/Lang/REBOL/Arrays
deleted file mode 120000
index 9fc95551ee..0000000000
--- a/Lang/REBOL/Arrays
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Arrays/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Averages-Arithmetic-mean b/Lang/REBOL/Averages-Arithmetic-mean
deleted file mode 120000
index de8cb5e395..0000000000
--- a/Lang/REBOL/Averages-Arithmetic-mean
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Averages-Arithmetic-mean/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Averages-Median b/Lang/REBOL/Averages-Median
deleted file mode 120000
index 96ef2cd694..0000000000
--- a/Lang/REBOL/Averages-Median
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Averages-Median/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Calendar b/Lang/REBOL/Calendar
deleted file mode 120000
index f396941538..0000000000
--- a/Lang/REBOL/Calendar
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Calendar/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Check-that-file-exists b/Lang/REBOL/Check-that-file-exists
deleted file mode 120000
index 70f5435458..0000000000
--- a/Lang/REBOL/Check-that-file-exists
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Check-that-file-exists/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Classes b/Lang/REBOL/Classes
deleted file mode 120000
index f823823847..0000000000
--- a/Lang/REBOL/Classes
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Classes/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Comma-quibbling b/Lang/REBOL/Comma-quibbling
deleted file mode 120000
index b2f7530541..0000000000
--- a/Lang/REBOL/Comma-quibbling
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Comma-quibbling/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Comments b/Lang/REBOL/Comments
deleted file mode 120000
index 2dad54191c..0000000000
--- a/Lang/REBOL/Comments
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Comments/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Copy-a-string b/Lang/REBOL/Copy-a-string
deleted file mode 120000
index 8babad9959..0000000000
--- a/Lang/REBOL/Copy-a-string
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Copy-a-string/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Create-a-file b/Lang/REBOL/Create-a-file
deleted file mode 120000
index 3089537d01..0000000000
--- a/Lang/REBOL/Create-a-file
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Create-a-file/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Date-format b/Lang/REBOL/Date-format
deleted file mode 120000
index 33ce065e87..0000000000
--- a/Lang/REBOL/Date-format
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Date-format/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Date-manipulation b/Lang/REBOL/Date-manipulation
deleted file mode 120000
index 2722a008ce..0000000000
--- a/Lang/REBOL/Date-manipulation
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Date-manipulation/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Day-of-the-week b/Lang/REBOL/Day-of-the-week
deleted file mode 120000
index 82d7509a60..0000000000
--- a/Lang/REBOL/Day-of-the-week
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Day-of-the-week/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Delete-a-file b/Lang/REBOL/Delete-a-file
deleted file mode 120000
index 66f14845d7..0000000000
--- a/Lang/REBOL/Delete-a-file
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Delete-a-file/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Detect-division-by-zero b/Lang/REBOL/Detect-division-by-zero
deleted file mode 120000
index b0ccafd718..0000000000
--- a/Lang/REBOL/Detect-division-by-zero
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Detect-division-by-zero/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Determine-if-a-string-is-numeric b/Lang/REBOL/Determine-if-a-string-is-numeric
deleted file mode 120000
index 045a0ae13f..0000000000
--- a/Lang/REBOL/Determine-if-a-string-is-numeric
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Determine-if-a-string-is-numeric/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Documentation b/Lang/REBOL/Documentation
deleted file mode 120000
index daa69740d8..0000000000
--- a/Lang/REBOL/Documentation
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Documentation/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Dot-product b/Lang/REBOL/Dot-product
deleted file mode 120000
index 0e405ceca0..0000000000
--- a/Lang/REBOL/Dot-product
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Dot-product/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Dynamic-variable-names b/Lang/REBOL/Dynamic-variable-names
deleted file mode 120000
index dc26f8842e..0000000000
--- a/Lang/REBOL/Dynamic-variable-names
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Dynamic-variable-names/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Echo-server b/Lang/REBOL/Echo-server
deleted file mode 120000
index e5f15ce096..0000000000
--- a/Lang/REBOL/Echo-server
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Echo-server/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Empty-program b/Lang/REBOL/Empty-program
deleted file mode 120000
index 15b162acc2..0000000000
--- a/Lang/REBOL/Empty-program
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Empty-program/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Environment-variables b/Lang/REBOL/Environment-variables
deleted file mode 120000
index 1742700711..0000000000
--- a/Lang/REBOL/Environment-variables
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Environment-variables/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Execute-Brain- b/Lang/REBOL/Execute-Brain-
deleted file mode 120000
index 5d49896311..0000000000
--- a/Lang/REBOL/Execute-Brain-
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Execute-Brain-/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Execute-a-system-command b/Lang/REBOL/Execute-a-system-command
deleted file mode 120000
index 6177e36583..0000000000
--- a/Lang/REBOL/Execute-a-system-command
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Execute-a-system-command/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/FTP b/Lang/REBOL/FTP
deleted file mode 120000
index 7ab1c53c58..0000000000
--- a/Lang/REBOL/FTP
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/FTP/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Factorial b/Lang/REBOL/Factorial
deleted file mode 120000
index 8643656c0a..0000000000
--- a/Lang/REBOL/Factorial
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Factorial/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/File-input-output b/Lang/REBOL/File-input-output
deleted file mode 120000
index 30e510fb5d..0000000000
--- a/Lang/REBOL/File-input-output
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/File-input-output/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/File-size b/Lang/REBOL/File-size
deleted file mode 120000
index 61c4252f32..0000000000
--- a/Lang/REBOL/File-size
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/File-size/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Filter b/Lang/REBOL/Filter
deleted file mode 120000
index d25c807398..0000000000
--- a/Lang/REBOL/Filter
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Filter/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Find-the-last-Sunday-of-each-month b/Lang/REBOL/Find-the-last-Sunday-of-each-month
deleted file mode 120000
index c54d330170..0000000000
--- a/Lang/REBOL/Find-the-last-Sunday-of-each-month
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Find-the-last-Sunday-of-each-month/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/First-class-functions b/Lang/REBOL/First-class-functions
deleted file mode 120000
index 729d2ef773..0000000000
--- a/Lang/REBOL/First-class-functions
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/First-class-functions/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Fixed-length-records b/Lang/REBOL/Fixed-length-records
deleted file mode 120000
index c6d6d1ea72..0000000000
--- a/Lang/REBOL/Fixed-length-records
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Fixed-length-records/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/FizzBuzz b/Lang/REBOL/FizzBuzz
deleted file mode 120000
index 5fada5dc79..0000000000
--- a/Lang/REBOL/FizzBuzz
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/FizzBuzz/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Flatten-a-list b/Lang/REBOL/Flatten-a-list
deleted file mode 120000
index c63e60f1ae..0000000000
--- a/Lang/REBOL/Flatten-a-list
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Flatten-a-list/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Flow-control-structures b/Lang/REBOL/Flow-control-structures
deleted file mode 120000
index 02978f970b..0000000000
--- a/Lang/REBOL/Flow-control-structures
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Flow-control-structures/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Formatted-numeric-output b/Lang/REBOL/Formatted-numeric-output
deleted file mode 120000
index 6231201b56..0000000000
--- a/Lang/REBOL/Formatted-numeric-output
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Formatted-numeric-output/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Function-composition b/Lang/REBOL/Function-composition
deleted file mode 120000
index 00fbef410f..0000000000
--- a/Lang/REBOL/Function-composition
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Function-composition/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Function-definition b/Lang/REBOL/Function-definition
deleted file mode 120000
index 24045b17c8..0000000000
--- a/Lang/REBOL/Function-definition
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Function-definition/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Generic-swap b/Lang/REBOL/Generic-swap
deleted file mode 120000
index 252d05095f..0000000000
--- a/Lang/REBOL/Generic-swap
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Generic-swap/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Greatest-common-divisor b/Lang/REBOL/Greatest-common-divisor
deleted file mode 120000
index 66251fda3d..0000000000
--- a/Lang/REBOL/Greatest-common-divisor
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Greatest-common-divisor/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Greatest-element-of-a-list b/Lang/REBOL/Greatest-element-of-a-list
deleted file mode 120000
index bf835b648c..0000000000
--- a/Lang/REBOL/Greatest-element-of-a-list
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Greatest-element-of-a-list/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/HTTP b/Lang/REBOL/HTTP
deleted file mode 120000
index 7ade844f73..0000000000
--- a/Lang/REBOL/HTTP
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/HTTP/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Hailstone-sequence b/Lang/REBOL/Hailstone-sequence
deleted file mode 120000
index f668d98fe0..0000000000
--- a/Lang/REBOL/Hailstone-sequence
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Hailstone-sequence/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Hello-world-Graphical b/Lang/REBOL/Hello-world-Graphical
deleted file mode 120000
index 65375f6063..0000000000
--- a/Lang/REBOL/Hello-world-Graphical
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Hello-world-Graphical/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Hello-world-Newline-omission b/Lang/REBOL/Hello-world-Newline-omission
deleted file mode 120000
index a1ab230770..0000000000
--- a/Lang/REBOL/Hello-world-Newline-omission
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Hello-world-Newline-omission/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Hello-world-Text b/Lang/REBOL/Hello-world-Text
deleted file mode 120000
index 417f675e90..0000000000
--- a/Lang/REBOL/Hello-world-Text
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Hello-world-Text/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Higher-order-functions b/Lang/REBOL/Higher-order-functions
deleted file mode 120000
index e0da7764d4..0000000000
--- a/Lang/REBOL/Higher-order-functions
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Higher-order-functions/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Horners-rule-for-polynomial-evaluation b/Lang/REBOL/Horners-rule-for-polynomial-evaluation
deleted file mode 120000
index 3ed4d272a6..0000000000
--- a/Lang/REBOL/Horners-rule-for-polynomial-evaluation
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Horners-rule-for-polynomial-evaluation/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Hostname b/Lang/REBOL/Hostname
deleted file mode 120000
index 00509fe88c..0000000000
--- a/Lang/REBOL/Hostname
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Hostname/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Increment-a-numerical-string b/Lang/REBOL/Increment-a-numerical-string
deleted file mode 120000
index 0b8ae5b473..0000000000
--- a/Lang/REBOL/Increment-a-numerical-string
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Increment-a-numerical-string/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Inheritance-Single b/Lang/REBOL/Inheritance-Single
deleted file mode 120000
index 8790c38450..0000000000
--- a/Lang/REBOL/Inheritance-Single
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Inheritance-Single/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Input-loop b/Lang/REBOL/Input-loop
deleted file mode 120000
index 81d9914a81..0000000000
--- a/Lang/REBOL/Input-loop
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Input-loop/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Integer-comparison b/Lang/REBOL/Integer-comparison
deleted file mode 120000
index 6f12d33801..0000000000
--- a/Lang/REBOL/Integer-comparison
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Integer-comparison/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Interactive-programming-repl- b/Lang/REBOL/Interactive-programming-repl-
deleted file mode 120000
index a2a59ee516..0000000000
--- a/Lang/REBOL/Interactive-programming-repl-
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Interactive-programming-repl-/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/JSON b/Lang/REBOL/JSON
deleted file mode 120000
index bbdd962074..0000000000
--- a/Lang/REBOL/JSON
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/JSON/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Josephus-problem b/Lang/REBOL/Josephus-problem
deleted file mode 120000
index d092745290..0000000000
--- a/Lang/REBOL/Josephus-problem
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Josephus-problem/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Keyboard-macros b/Lang/REBOL/Keyboard-macros
deleted file mode 120000
index 4c918106f7..0000000000
--- a/Lang/REBOL/Keyboard-macros
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Keyboard-macros/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Knuth-shuffle b/Lang/REBOL/Knuth-shuffle
deleted file mode 120000
index e1ef5ac835..0000000000
--- a/Lang/REBOL/Knuth-shuffle
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Knuth-shuffle/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Last-Friday-of-each-month b/Lang/REBOL/Last-Friday-of-each-month
deleted file mode 120000
index 592b3befd7..0000000000
--- a/Lang/REBOL/Last-Friday-of-each-month
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Last-Friday-of-each-month/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Leap-year b/Lang/REBOL/Leap-year
deleted file mode 120000
index e1fde0d2a0..0000000000
--- a/Lang/REBOL/Leap-year
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Leap-year/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Literals-Integer b/Lang/REBOL/Literals-Integer
deleted file mode 120000
index c018808d2d..0000000000
--- a/Lang/REBOL/Literals-Integer
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Literals-Integer/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Logical-operations b/Lang/REBOL/Logical-operations
deleted file mode 120000
index b2be03cb20..0000000000
--- a/Lang/REBOL/Logical-operations
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Logical-operations/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Loop-over-multiple-arrays-simultaneously b/Lang/REBOL/Loop-over-multiple-arrays-simultaneously
deleted file mode 120000
index 509d196c87..0000000000
--- a/Lang/REBOL/Loop-over-multiple-arrays-simultaneously
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Loop-over-multiple-arrays-simultaneously/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Loops-Break b/Lang/REBOL/Loops-Break
deleted file mode 120000
index b12b588bcd..0000000000
--- a/Lang/REBOL/Loops-Break
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Loops-Break/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Loops-Continue b/Lang/REBOL/Loops-Continue
deleted file mode 120000
index 620f8d42c2..0000000000
--- a/Lang/REBOL/Loops-Continue
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Loops-Continue/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Loops-Do-while b/Lang/REBOL/Loops-Do-while
deleted file mode 120000
index a092621ef7..0000000000
--- a/Lang/REBOL/Loops-Do-while
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Loops-Do-while/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Loops-Downward-for b/Lang/REBOL/Loops-Downward-for
deleted file mode 120000
index e956288e68..0000000000
--- a/Lang/REBOL/Loops-Downward-for
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Loops-Downward-for/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Loops-For b/Lang/REBOL/Loops-For
deleted file mode 120000
index 9c59f991f0..0000000000
--- a/Lang/REBOL/Loops-For
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Loops-For/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Loops-For-with-a-specified-step b/Lang/REBOL/Loops-For-with-a-specified-step
deleted file mode 120000
index 3174e4899e..0000000000
--- a/Lang/REBOL/Loops-For-with-a-specified-step
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Loops-For-with-a-specified-step/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Loops-Foreach b/Lang/REBOL/Loops-Foreach
deleted file mode 120000
index 98cc61392e..0000000000
--- a/Lang/REBOL/Loops-Foreach
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Loops-Foreach/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Loops-Increment-loop-index-within-loop-body b/Lang/REBOL/Loops-Increment-loop-index-within-loop-body
deleted file mode 120000
index 1d1b2df2c6..0000000000
--- a/Lang/REBOL/Loops-Increment-loop-index-within-loop-body
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Loops-Increment-loop-index-within-loop-body/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Loops-Infinite b/Lang/REBOL/Loops-Infinite
deleted file mode 120000
index cd80f1fc2f..0000000000
--- a/Lang/REBOL/Loops-Infinite
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Loops-Infinite/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Loops-N-plus-one-half b/Lang/REBOL/Loops-N-plus-one-half
deleted file mode 120000
index 530a004b19..0000000000
--- a/Lang/REBOL/Loops-N-plus-one-half
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Loops-N-plus-one-half/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Loops-Nested b/Lang/REBOL/Loops-Nested
deleted file mode 120000
index fad704e1b5..0000000000
--- a/Lang/REBOL/Loops-Nested
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Loops-Nested/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Loops-While b/Lang/REBOL/Loops-While
deleted file mode 120000
index 7caecdb43d..0000000000
--- a/Lang/REBOL/Loops-While
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Loops-While/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Loops-With-multiple-ranges b/Lang/REBOL/Loops-With-multiple-ranges
deleted file mode 120000
index bd25edb4b9..0000000000
--- a/Lang/REBOL/Loops-With-multiple-ranges
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Loops-With-multiple-ranges/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Loops-Wrong-ranges b/Lang/REBOL/Loops-Wrong-ranges
deleted file mode 120000
index a8f17c4209..0000000000
--- a/Lang/REBOL/Loops-Wrong-ranges
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Loops-Wrong-ranges/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/MD5 b/Lang/REBOL/MD5
deleted file mode 120000
index 5cb019110c..0000000000
--- a/Lang/REBOL/MD5
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/MD5/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Mad-Libs b/Lang/REBOL/Mad-Libs
deleted file mode 120000
index db4b8d6171..0000000000
--- a/Lang/REBOL/Mad-Libs
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Mad-Libs/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Menu b/Lang/REBOL/Menu
deleted file mode 120000
index 3b0b7dc2de..0000000000
--- a/Lang/REBOL/Menu
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Menu/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Multiplication-tables b/Lang/REBOL/Multiplication-tables
deleted file mode 120000
index 1b70d39ee9..0000000000
--- a/Lang/REBOL/Multiplication-tables
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Multiplication-tables/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Mutual-recursion b/Lang/REBOL/Mutual-recursion
deleted file mode 120000
index cb2de22d29..0000000000
--- a/Lang/REBOL/Mutual-recursion
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Mutual-recursion/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Null-object b/Lang/REBOL/Null-object
deleted file mode 120000
index 0b324069d2..0000000000
--- a/Lang/REBOL/Null-object
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Null-object/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Number-reversal-game b/Lang/REBOL/Number-reversal-game
deleted file mode 120000
index a23e4203b5..0000000000
--- a/Lang/REBOL/Number-reversal-game
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Number-reversal-game/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Object-serialization b/Lang/REBOL/Object-serialization
deleted file mode 120000
index 71f73b27eb..0000000000
--- a/Lang/REBOL/Object-serialization
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Object-serialization/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Palindrome-detection b/Lang/REBOL/Palindrome-detection
deleted file mode 120000
index 45e3490dd4..0000000000
--- a/Lang/REBOL/Palindrome-detection
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Palindrome-detection/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Percentage-difference-between-images b/Lang/REBOL/Percentage-difference-between-images
deleted file mode 120000
index 47e0c29027..0000000000
--- a/Lang/REBOL/Percentage-difference-between-images
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Percentage-difference-between-images/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Perfect-numbers b/Lang/REBOL/Perfect-numbers
deleted file mode 120000
index 888589d0dd..0000000000
--- a/Lang/REBOL/Perfect-numbers
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Perfect-numbers/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Polyspiral b/Lang/REBOL/Polyspiral
deleted file mode 120000
index 70a487676d..0000000000
--- a/Lang/REBOL/Polyspiral
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Polyspiral/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Primality-by-trial-division b/Lang/REBOL/Primality-by-trial-division
deleted file mode 120000
index 6e14471054..0000000000
--- a/Lang/REBOL/Primality-by-trial-division
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Primality-by-trial-division/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Program-termination b/Lang/REBOL/Program-termination
deleted file mode 120000
index 7c4ce8b3c8..0000000000
--- a/Lang/REBOL/Program-termination
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Program-termination/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Queue-Definition b/Lang/REBOL/Queue-Definition
deleted file mode 120000
index aa21697e36..0000000000
--- a/Lang/REBOL/Queue-Definition
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Queue-Definition/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Queue-Usage b/Lang/REBOL/Queue-Usage
deleted file mode 120000
index 488c4682f8..0000000000
--- a/Lang/REBOL/Queue-Usage
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Queue-Usage/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Quine b/Lang/REBOL/Quine
deleted file mode 120000
index 391f27dc9c..0000000000
--- a/Lang/REBOL/Quine
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Quine/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Read-a-specific-line-from-a-file b/Lang/REBOL/Read-a-specific-line-from-a-file
deleted file mode 120000
index fc3cb7c086..0000000000
--- a/Lang/REBOL/Read-a-specific-line-from-a-file
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Read-a-specific-line-from-a-file/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Read-entire-file b/Lang/REBOL/Read-entire-file
deleted file mode 120000
index 8d1ffdb8c8..0000000000
--- a/Lang/REBOL/Read-entire-file
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Read-entire-file/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Regular-expressions b/Lang/REBOL/Regular-expressions
deleted file mode 120000
index cc056f3dfc..0000000000
--- a/Lang/REBOL/Regular-expressions
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Regular-expressions/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Remove-duplicate-elements b/Lang/REBOL/Remove-duplicate-elements
deleted file mode 120000
index 989597f93c..0000000000
--- a/Lang/REBOL/Remove-duplicate-elements
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Remove-duplicate-elements/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Rename-a-file b/Lang/REBOL/Rename-a-file
deleted file mode 120000
index d5b1f76dba..0000000000
--- a/Lang/REBOL/Rename-a-file
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Rename-a-file/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Repeat-a-string b/Lang/REBOL/Repeat-a-string
deleted file mode 120000
index df3bda003c..0000000000
--- a/Lang/REBOL/Repeat-a-string
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Repeat-a-string/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Reverse-a-string b/Lang/REBOL/Reverse-a-string
deleted file mode 120000
index 4fa66fa042..0000000000
--- a/Lang/REBOL/Reverse-a-string
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Reverse-a-string/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Rot-13 b/Lang/REBOL/Rot-13
deleted file mode 120000
index 344b9949b8..0000000000
--- a/Lang/REBOL/Rot-13
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Rot-13/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Runtime-evaluation b/Lang/REBOL/Runtime-evaluation
deleted file mode 120000
index 4f29a7904a..0000000000
--- a/Lang/REBOL/Runtime-evaluation
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Runtime-evaluation/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Runtime-evaluation-In-an-environment b/Lang/REBOL/Runtime-evaluation-In-an-environment
deleted file mode 120000
index 00ac88948d..0000000000
--- a/Lang/REBOL/Runtime-evaluation-In-an-environment
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Runtime-evaluation-In-an-environment/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/SHA-1 b/Lang/REBOL/SHA-1
deleted file mode 120000
index b430af646a..0000000000
--- a/Lang/REBOL/SHA-1
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/SHA-1/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/SHA-256 b/Lang/REBOL/SHA-256
deleted file mode 120000
index b5f39ed805..0000000000
--- a/Lang/REBOL/SHA-256
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/SHA-256/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Search-a-list b/Lang/REBOL/Search-a-list
deleted file mode 120000
index 30c4450829..0000000000
--- a/Lang/REBOL/Search-a-list
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Search-a-list/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Semordnilap b/Lang/REBOL/Semordnilap
deleted file mode 120000
index fee60064bb..0000000000
--- a/Lang/REBOL/Semordnilap
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Semordnilap/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Send-email b/Lang/REBOL/Send-email
deleted file mode 120000
index 7a102c33ea..0000000000
--- a/Lang/REBOL/Send-email
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Send-email/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Shell-one-liner b/Lang/REBOL/Shell-one-liner
deleted file mode 120000
index 3efd76bee3..0000000000
--- a/Lang/REBOL/Shell-one-liner
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Shell-one-liner/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Simple-database b/Lang/REBOL/Simple-database
deleted file mode 120000
index 2171f3e8b2..0000000000
--- a/Lang/REBOL/Simple-database
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Simple-database/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Simple-windowed-application b/Lang/REBOL/Simple-windowed-application
deleted file mode 120000
index 3eb2f5011a..0000000000
--- a/Lang/REBOL/Simple-windowed-application
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Simple-windowed-application/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Sleep b/Lang/REBOL/Sleep
deleted file mode 120000
index 49498dee8f..0000000000
--- a/Lang/REBOL/Sleep
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Sleep/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Sort-an-integer-array b/Lang/REBOL/Sort-an-integer-array
deleted file mode 120000
index be40906bd3..0000000000
--- a/Lang/REBOL/Sort-an-integer-array
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Sort-an-integer-array/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Sort-stability b/Lang/REBOL/Sort-stability
deleted file mode 120000
index 7a6119bc4e..0000000000
--- a/Lang/REBOL/Sort-stability
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Sort-stability/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Sorting-algorithms-Insertion-sort b/Lang/REBOL/Sorting-algorithms-Insertion-sort
deleted file mode 120000
index 5a9f9f2f24..0000000000
--- a/Lang/REBOL/Sorting-algorithms-Insertion-sort
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Sorting-algorithms-Insertion-sort/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Stack b/Lang/REBOL/Stack
deleted file mode 120000
index 70bb3936ee..0000000000
--- a/Lang/REBOL/Stack
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Stack/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Stair-climbing-puzzle b/Lang/REBOL/Stair-climbing-puzzle
deleted file mode 120000
index 935f1a3925..0000000000
--- a/Lang/REBOL/Stair-climbing-puzzle
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Stair-climbing-puzzle/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/String-case b/Lang/REBOL/String-case
deleted file mode 120000
index 2279191d8d..0000000000
--- a/Lang/REBOL/String-case
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/String-case/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/String-concatenation b/Lang/REBOL/String-concatenation
deleted file mode 120000
index 8be78ed69f..0000000000
--- a/Lang/REBOL/String-concatenation
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/String-concatenation/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/String-interpolation-included- b/Lang/REBOL/String-interpolation-included-
deleted file mode 120000
index 1158cc37bc..0000000000
--- a/Lang/REBOL/String-interpolation-included-
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/String-interpolation-included-/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/String-length b/Lang/REBOL/String-length
deleted file mode 120000
index 06c8f5cbd6..0000000000
--- a/Lang/REBOL/String-length
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/String-length/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Substring b/Lang/REBOL/Substring
deleted file mode 120000
index ae87eb5a53..0000000000
--- a/Lang/REBOL/Substring
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Substring/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Sum-and-product-of-an-array b/Lang/REBOL/Sum-and-product-of-an-array
deleted file mode 120000
index 5ce08d6535..0000000000
--- a/Lang/REBOL/Sum-and-product-of-an-array
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Sum-and-product-of-an-array/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Symmetric-difference b/Lang/REBOL/Symmetric-difference
deleted file mode 120000
index 27c9c680ad..0000000000
--- a/Lang/REBOL/Symmetric-difference
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Symmetric-difference/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/System-time b/Lang/REBOL/System-time
deleted file mode 120000
index 7ea31d4a27..0000000000
--- a/Lang/REBOL/System-time
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/System-time/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Take-notes-on-the-command-line b/Lang/REBOL/Take-notes-on-the-command-line
deleted file mode 120000
index f00a0f5d0a..0000000000
--- a/Lang/REBOL/Take-notes-on-the-command-line
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Take-notes-on-the-command-line/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Tokenize-a-string b/Lang/REBOL/Tokenize-a-string
deleted file mode 120000
index ee10fb0551..0000000000
--- a/Lang/REBOL/Tokenize-a-string
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Tokenize-a-string/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Towers-of-Hanoi b/Lang/REBOL/Towers-of-Hanoi
deleted file mode 120000
index a173272546..0000000000
--- a/Lang/REBOL/Towers-of-Hanoi
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Towers-of-Hanoi/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Tree-traversal b/Lang/REBOL/Tree-traversal
deleted file mode 120000
index 0c44bbca9b..0000000000
--- a/Lang/REBOL/Tree-traversal
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Tree-traversal/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Trigonometric-functions b/Lang/REBOL/Trigonometric-functions
deleted file mode 120000
index 8f4c11188c..0000000000
--- a/Lang/REBOL/Trigonometric-functions
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Trigonometric-functions/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/User-input-Graphical b/Lang/REBOL/User-input-Graphical
deleted file mode 120000
index 001538e055..0000000000
--- a/Lang/REBOL/User-input-Graphical
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/User-input-Graphical/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/User-input-Text b/Lang/REBOL/User-input-Text
deleted file mode 120000
index b81fcf9c85..0000000000
--- a/Lang/REBOL/User-input-Text
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/User-input-Text/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Variadic-function b/Lang/REBOL/Variadic-function
deleted file mode 120000
index c3eb7c285d..0000000000
--- a/Lang/REBOL/Variadic-function
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Variadic-function/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Web-scraping b/Lang/REBOL/Web-scraping
deleted file mode 120000
index 4c37db2bfe..0000000000
--- a/Lang/REBOL/Web-scraping
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Web-scraping/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Window-creation b/Lang/REBOL/Window-creation
deleted file mode 120000
index d3c3450624..0000000000
--- a/Lang/REBOL/Window-creation
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Window-creation/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/XML-Input b/Lang/REBOL/XML-Input
deleted file mode 120000
index f96cb4fd5e..0000000000
--- a/Lang/REBOL/XML-Input
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/XML-Input/REBOL
\ No newline at end of file
diff --git a/Lang/REBOL/Y-combinator b/Lang/REBOL/Y-combinator
deleted file mode 120000
index 492c58627d..0000000000
--- a/Lang/REBOL/Y-combinator
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Y-combinator/REBOL
\ No newline at end of file
diff --git a/Lang/REXX/00-LANG.txt b/Lang/REXX/00-LANG.txt
index fd028fe2bc..592349f719 100644
--- a/Lang/REXX/00-LANG.txt
+++ b/Lang/REXX/00-LANG.txt
@@ -30,8 +30,9 @@ Using Classic REXX closely resembles pseudo code and many languages like Basic o
Some items that might differ from what you are familiar with.
cmake_minimum_required(VERSION 3.13)
include(pico_sdk_import.cmake)
@@ -67,10 +67,13 @@ pico_enable_stdio_usb(hello 1)
pico_enable_stdio_uart(hello 0)
pico_add_extra_outputs(hello)
+
see source program on hello world rosetta code
cmake -DPython3_EXECUTABLE=C:\Users\Vincent\AppData\Local\Microsoft\WindowsApps\python3.10.exe -DPICO_PLATFORM=rp2350-riscv -DPICO_TOOLCHAIN_PATH=E:\Pico2\tools\bin -DPICO_SDK_PATH=..\..\..\pico-sdk -G "NMake Makefiles" ..
+see instructions list on chapter 3.8.1.6. Alphabetical list of instructions on rp2350 datasheet
+
[[Category:Assembler language]]
[[Category:Assembly]]
\ No newline at end of file
diff --git a/Lang/Racket/Bioinformatics-base-count b/Lang/Racket/Bioinformatics-base-count
deleted file mode 120000
index e2d3d89548..0000000000
--- a/Lang/Racket/Bioinformatics-base-count
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Bioinformatics-base-count/Racket
\ No newline at end of file
diff --git a/Lang/Racket/Miller-Rabin-primality-test b/Lang/Racket/Miller-Rabin-primality-test
deleted file mode 120000
index db07b51bff..0000000000
--- a/Lang/Racket/Miller-Rabin-primality-test
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Miller-Rabin-primality-test/Racket
\ No newline at end of file
diff --git a/Lang/Racket/Quaternion-type b/Lang/Racket/Quaternion-type
deleted file mode 120000
index 88e3ea41c9..0000000000
--- a/Lang/Racket/Quaternion-type
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Quaternion-type/Racket
\ No newline at end of file
diff --git a/Lang/Racket/Sorting-Algorithms-Circle-Sort b/Lang/Racket/Sorting-Algorithms-Circle-Sort
deleted file mode 120000
index 4c351d18cc..0000000000
--- a/Lang/Racket/Sorting-Algorithms-Circle-Sort
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Sorting-Algorithms-Circle-Sort/Racket
\ No newline at end of file
diff --git a/Lang/Raku/Bioinformatics-base-count b/Lang/Raku/Bioinformatics-base-count
deleted file mode 120000
index 7d4ea3da69..0000000000
--- a/Lang/Raku/Bioinformatics-base-count
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Bioinformatics-base-count/Raku
\ No newline at end of file
diff --git a/Lang/Raku/Meissel-Mertens-constant b/Lang/Raku/Meissel-Mertens-constant
deleted file mode 120000
index 5a835b7f73..0000000000
--- a/Lang/Raku/Meissel-Mertens-constant
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Meissel-Mertens-constant/Raku
\ No newline at end of file
diff --git a/Lang/Raku/Miller-Rabin-primality-test b/Lang/Raku/Miller-Rabin-primality-test
deleted file mode 120000
index 5ec2c83bd9..0000000000
--- a/Lang/Raku/Miller-Rabin-primality-test
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Miller-Rabin-primality-test/Raku
\ No newline at end of file
diff --git a/Lang/Raku/Quaternion-type b/Lang/Raku/Quaternion-type
deleted file mode 120000
index 3333adafb6..0000000000
--- a/Lang/Raku/Quaternion-type
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Quaternion-type/Raku
\ No newline at end of file
diff --git a/Lang/Raku/Sorting-Algorithms-Circle-Sort b/Lang/Raku/Sorting-Algorithms-Circle-Sort
deleted file mode 120000
index 1ba8b44162..0000000000
--- a/Lang/Raku/Sorting-Algorithms-Circle-Sort
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Sorting-Algorithms-Circle-Sort/Raku
\ No newline at end of file
diff --git a/Lang/RapidQ/M-bius-function b/Lang/RapidQ/M-bius-function
deleted file mode 120000
index 72bc6192fb..0000000000
--- a/Lang/RapidQ/M-bius-function
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/M-bius-function/RapidQ
\ No newline at end of file
diff --git a/Lang/Red/Quaternion-type b/Lang/Red/Quaternion-type
deleted file mode 120000
index 7b5fc87ddd..0000000000
--- a/Lang/Red/Quaternion-type
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Quaternion-type/Red
\ No newline at end of file
diff --git a/Lang/Ring/Bioinformatics-base-count b/Lang/Ring/Bioinformatics-base-count
deleted file mode 120000
index 291f269ac6..0000000000
--- a/Lang/Ring/Bioinformatics-base-count
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Bioinformatics-base-count/Ring
\ No newline at end of file
diff --git a/Lang/Ring/Empty-program b/Lang/Ring/Empty-program
deleted file mode 120000
index 05941ac0c2..0000000000
--- a/Lang/Ring/Empty-program
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Empty-program/Ring
\ No newline at end of file
diff --git a/Lang/Ring/Miller-Rabin-primality-test b/Lang/Ring/Miller-Rabin-primality-test
deleted file mode 120000
index dd0885b5c9..0000000000
--- a/Lang/Ring/Miller-Rabin-primality-test
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Miller-Rabin-primality-test/Ring
\ No newline at end of file
diff --git a/Lang/Ring/Sorting-Algorithms-Circle-Sort b/Lang/Ring/Sorting-Algorithms-Circle-Sort
deleted file mode 120000
index de0338125a..0000000000
--- a/Lang/Ring/Sorting-Algorithms-Circle-Sort
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Sorting-Algorithms-Circle-Sort/Ring
\ No newline at end of file
diff --git a/Lang/Robotic/Empty-program b/Lang/Robotic/Empty-program
deleted file mode 120000
index 5e2d95817a..0000000000
--- a/Lang/Robotic/Empty-program
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Empty-program/Robotic
\ No newline at end of file
diff --git a/Lang/Ruby/Bioinformatics-base-count b/Lang/Ruby/Bioinformatics-base-count
deleted file mode 120000
index af92d7709c..0000000000
--- a/Lang/Ruby/Bioinformatics-base-count
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Bioinformatics-base-count/Ruby
\ No newline at end of file
diff --git a/Lang/Ruby/Miller-Rabin-primality-test b/Lang/Ruby/Miller-Rabin-primality-test
deleted file mode 120000
index d7cbf43733..0000000000
--- a/Lang/Ruby/Miller-Rabin-primality-test
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Miller-Rabin-primality-test/Ruby
\ No newline at end of file
diff --git a/Lang/Ruby/Quaternion-type b/Lang/Ruby/Quaternion-type
deleted file mode 120000
index c1af2a1904..0000000000
--- a/Lang/Ruby/Quaternion-type
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Quaternion-type/Ruby
\ No newline at end of file
diff --git a/Lang/Ruby/Sorting-Algorithms-Circle-Sort b/Lang/Ruby/Sorting-Algorithms-Circle-Sort
deleted file mode 120000
index 022b44ef66..0000000000
--- a/Lang/Ruby/Sorting-Algorithms-Circle-Sort
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Sorting-Algorithms-Circle-Sort/Ruby
\ No newline at end of file
diff --git a/Lang/Run-BASIC/Meissel-Mertens-constant b/Lang/Run-BASIC/Meissel-Mertens-constant
deleted file mode 120000
index 44168b020e..0000000000
--- a/Lang/Run-BASIC/Meissel-Mertens-constant
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Meissel-Mertens-constant/Run-BASIC
\ No newline at end of file
diff --git a/Lang/Run-BASIC/Miller-Rabin-primality-test b/Lang/Run-BASIC/Miller-Rabin-primality-test
deleted file mode 120000
index 13b7319b57..0000000000
--- a/Lang/Run-BASIC/Miller-Rabin-primality-test
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Miller-Rabin-primality-test/Run-BASIC
\ No newline at end of file
diff --git a/Lang/Rust/Bioinformatics-base-count b/Lang/Rust/Bioinformatics-base-count
deleted file mode 120000
index 412ded1361..0000000000
--- a/Lang/Rust/Bioinformatics-base-count
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Bioinformatics-base-count/Rust
\ No newline at end of file
diff --git a/Lang/Rust/Meissel-Mertens-constant b/Lang/Rust/Meissel-Mertens-constant
deleted file mode 120000
index 30f216e193..0000000000
--- a/Lang/Rust/Meissel-Mertens-constant
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Meissel-Mertens-constant/Rust
\ No newline at end of file
diff --git a/Lang/Rust/Miller-Rabin-primality-test b/Lang/Rust/Miller-Rabin-primality-test
deleted file mode 120000
index 937aebe94f..0000000000
--- a/Lang/Rust/Miller-Rabin-primality-test
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Miller-Rabin-primality-test/Rust
\ No newline at end of file
diff --git a/Lang/Rust/Quaternion-type b/Lang/Rust/Quaternion-type
deleted file mode 120000
index 92c25b946f..0000000000
--- a/Lang/Rust/Quaternion-type
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Quaternion-type/Rust
\ No newline at end of file
diff --git a/Lang/Rust/Sorting-Algorithms-Circle-Sort b/Lang/Rust/Sorting-Algorithms-Circle-Sort
deleted file mode 120000
index 924c0eb5ac..0000000000
--- a/Lang/Rust/Sorting-Algorithms-Circle-Sort
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Sorting-Algorithms-Circle-Sort/Rust
\ No newline at end of file
diff --git a/Lang/Scala/Miller-Rabin-primality-test b/Lang/Scala/Miller-Rabin-primality-test
deleted file mode 120000
index 28de5ef463..0000000000
--- a/Lang/Scala/Miller-Rabin-primality-test
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Miller-Rabin-primality-test/Scala
\ No newline at end of file
diff --git a/Lang/Scala/Quaternion-type b/Lang/Scala/Quaternion-type
deleted file mode 120000
index 15f3eda4c9..0000000000
--- a/Lang/Scala/Quaternion-type
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Quaternion-type/Scala
\ No newline at end of file
diff --git a/Lang/Scala/Sorting-Algorithms-Circle-Sort b/Lang/Scala/Sorting-Algorithms-Circle-Sort
deleted file mode 120000
index 5b9f057951..0000000000
--- a/Lang/Scala/Sorting-Algorithms-Circle-Sort
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Sorting-Algorithms-Circle-Sort/Scala
\ No newline at end of file
diff --git a/Lang/Scheme/Empty-program b/Lang/Scheme/Empty-program
deleted file mode 120000
index ee1ee662be..0000000000
--- a/Lang/Scheme/Empty-program
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Empty-program/Scheme
\ No newline at end of file
diff --git a/Lang/Scheme/Miller-Rabin-primality-test b/Lang/Scheme/Miller-Rabin-primality-test
deleted file mode 120000
index 644cc32269..0000000000
--- a/Lang/Scheme/Miller-Rabin-primality-test
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Miller-Rabin-primality-test/Scheme
\ No newline at end of file
diff --git a/Lang/Scilab/Empty-program b/Lang/Scilab/Empty-program
deleted file mode 120000
index 0cb8f21cc3..0000000000
--- a/Lang/Scilab/Empty-program
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Empty-program/Scilab
\ No newline at end of file
diff --git a/Lang/Seed7/Miller-Rabin-primality-test b/Lang/Seed7/Miller-Rabin-primality-test
deleted file mode 120000
index 298c8872f9..0000000000
--- a/Lang/Seed7/Miller-Rabin-primality-test
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Miller-Rabin-primality-test/Seed7
\ No newline at end of file
diff --git a/Lang/Seed7/Quaternion-type b/Lang/Seed7/Quaternion-type
deleted file mode 120000
index d621b24ce0..0000000000
--- a/Lang/Seed7/Quaternion-type
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Quaternion-type/Seed7
\ No newline at end of file
diff --git a/Lang/Set-lang/Empty-program b/Lang/Set-lang/Empty-program
deleted file mode 120000
index e6f84e5a85..0000000000
--- a/Lang/Set-lang/Empty-program
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Empty-program/Set-lang
\ No newline at end of file
diff --git a/Lang/Sidef/Empty-program b/Lang/Sidef/Empty-program
deleted file mode 120000
index c7465e3077..0000000000
--- a/Lang/Sidef/Empty-program
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Empty-program/Sidef
\ No newline at end of file
diff --git a/Lang/Sidef/Meissel-Mertens-constant b/Lang/Sidef/Meissel-Mertens-constant
deleted file mode 120000
index 7eda1518da..0000000000
--- a/Lang/Sidef/Meissel-Mertens-constant
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Meissel-Mertens-constant/Sidef
\ No newline at end of file
diff --git a/Lang/Sidef/Miller-Rabin-primality-test b/Lang/Sidef/Miller-Rabin-primality-test
deleted file mode 120000
index 5bb5523a0e..0000000000
--- a/Lang/Sidef/Miller-Rabin-primality-test
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Miller-Rabin-primality-test/Sidef
\ No newline at end of file
diff --git a/Lang/Sidef/Quaternion-type b/Lang/Sidef/Quaternion-type
deleted file mode 120000
index 5e28a5e41d..0000000000
--- a/Lang/Sidef/Quaternion-type
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Quaternion-type/Sidef
\ No newline at end of file
diff --git a/Lang/Sidef/Sorting-Algorithms-Circle-Sort b/Lang/Sidef/Sorting-Algorithms-Circle-Sort
deleted file mode 120000
index e866329cad..0000000000
--- a/Lang/Sidef/Sorting-Algorithms-Circle-Sort
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Sorting-Algorithms-Circle-Sort/Sidef
\ No newline at end of file
diff --git a/Lang/SimpleCode/Empty-program b/Lang/SimpleCode/Empty-program
deleted file mode 120000
index dc55c70d09..0000000000
--- a/Lang/SimpleCode/Empty-program
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Empty-program/SimpleCode
\ No newline at end of file
diff --git a/Lang/Slate/Empty-program b/Lang/Slate/Empty-program
deleted file mode 120000
index cea8e90b74..0000000000
--- a/Lang/Slate/Empty-program
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Empty-program/Slate
\ No newline at end of file
diff --git a/Lang/Smalltalk/Miller-Rabin-primality-test b/Lang/Smalltalk/Miller-Rabin-primality-test
deleted file mode 120000
index e3a303744d..0000000000
--- a/Lang/Smalltalk/Miller-Rabin-primality-test
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Miller-Rabin-primality-test/Smalltalk
\ No newline at end of file
diff --git a/Lang/Sparkling/Empty-program b/Lang/Sparkling/Empty-program
deleted file mode 120000
index 519287810d..0000000000
--- a/Lang/Sparkling/Empty-program
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Empty-program/Sparkling
\ No newline at end of file
diff --git a/Lang/Standard-ML/Miller-Rabin-primality-test b/Lang/Standard-ML/Miller-Rabin-primality-test
deleted file mode 120000
index ba4b002043..0000000000
--- a/Lang/Standard-ML/Miller-Rabin-primality-test
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Miller-Rabin-primality-test/Standard-ML
\ No newline at end of file
diff --git a/Lang/Swift/Bioinformatics-base-count b/Lang/Swift/Bioinformatics-base-count
deleted file mode 120000
index c497b7a9fe..0000000000
--- a/Lang/Swift/Bioinformatics-base-count
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Bioinformatics-base-count/Swift
\ No newline at end of file
diff --git a/Lang/Swift/Empty-program b/Lang/Swift/Empty-program
deleted file mode 120000
index 2c1baaa481..0000000000
--- a/Lang/Swift/Empty-program
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Empty-program/Swift
\ No newline at end of file
diff --git a/Lang/Swift/Miller-Rabin-primality-test b/Lang/Swift/Miller-Rabin-primality-test
deleted file mode 120000
index 08a41b9961..0000000000
--- a/Lang/Swift/Miller-Rabin-primality-test
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Miller-Rabin-primality-test/Swift
\ No newline at end of file
diff --git a/Lang/Swift/Quaternion-type b/Lang/Swift/Quaternion-type
deleted file mode 120000
index d74f88c4be..0000000000
--- a/Lang/Swift/Quaternion-type
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Quaternion-type/Swift
\ No newline at end of file
diff --git a/Lang/Swift/Sorting-Algorithms-Circle-Sort b/Lang/Swift/Sorting-Algorithms-Circle-Sort
deleted file mode 120000
index 367310fdad..0000000000
--- a/Lang/Swift/Sorting-Algorithms-Circle-Sort
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Sorting-Algorithms-Circle-Sort/Swift
\ No newline at end of file
diff --git a/Lang/Symsyn/Empty-program b/Lang/Symsyn/Empty-program
deleted file mode 120000
index 73cbdf1eb6..0000000000
--- a/Lang/Symsyn/Empty-program
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Empty-program/Symsyn
\ No newline at end of file
diff --git a/Lang/Tcl/Bioinformatics-base-count b/Lang/Tcl/Bioinformatics-base-count
deleted file mode 120000
index 2d2ea8e987..0000000000
--- a/Lang/Tcl/Bioinformatics-base-count
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Bioinformatics-base-count/Tcl
\ No newline at end of file
diff --git a/Lang/Tcl/Miller-Rabin-primality-test b/Lang/Tcl/Miller-Rabin-primality-test
deleted file mode 120000
index 5e3095425f..0000000000
--- a/Lang/Tcl/Miller-Rabin-primality-test
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Miller-Rabin-primality-test/Tcl
\ No newline at end of file
diff --git a/Lang/Tcl/Quaternion-type b/Lang/Tcl/Quaternion-type
deleted file mode 120000
index 50905d75b8..0000000000
--- a/Lang/Tcl/Quaternion-type
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Quaternion-type/Tcl
\ No newline at end of file
diff --git a/Lang/Trith/Empty-program b/Lang/Trith/Empty-program
deleted file mode 120000
index a3056b4a8b..0000000000
--- a/Lang/Trith/Empty-program
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Empty-program/Trith
\ No newline at end of file
diff --git a/Lang/True-BASIC/Meissel-Mertens-constant b/Lang/True-BASIC/Meissel-Mertens-constant
deleted file mode 120000
index fd72ec2c53..0000000000
--- a/Lang/True-BASIC/Meissel-Mertens-constant
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Meissel-Mertens-constant/True-BASIC
\ No newline at end of file
diff --git a/Lang/Uiua/00-LANG.txt b/Lang/Uiua/00-LANG.txt
index 820e780454..f3cc2f1ee5 100644
--- a/Lang/Uiua/00-LANG.txt
+++ b/Lang/Uiua/00-LANG.txt
@@ -7,8 +7,9 @@
|LCT=yes}}
{{language programming paradigm|array}}
{{language programming paradigm|functional|array}}
+From [https://www.uiua.org uiua.org]:
-Uiua (''wee-wuh'') is a general purpose, stack-based, array-oriented programming language with a focus on simplicity, beauty, and tacit code.
+"Uiua (''wee-wuh'') is a general purpose, stack-based, array-oriented programming language with a focus on simplicity, beauty, and tacit code.
Uiua has a simple, context-free, LL(3) grammar. Code runs from right to left, top to bottom, with only one precedence rule. As operators are to the left of their operands, Uiua code reads a little bit like a Lisp, but with fewer parentheses.
@@ -18,7 +19,10 @@ Uiua's one and only composite data type, the array, is based on those of APL, J,
Unlike other array languages, Uiua does not have monadic and dyadic versions of each glyph. Every glyph does only one thing, so you don't need to parse an entire expression to know which version it is.
-Find out more, and run code in your browser at https://www.uiua.org
+Find out more, and run code in your browser at [https://www.uiua.org https://www.uiua.org]."
+
+===Note===
+The Uiua programming language uses a custom font and colorful syntax highlighting to increase the readability of its code. As such syntax highlighting is not possible to display on this wiki, it is recommended to paste code into [https://www.uiua.org/pad the online Uiua pad] (or a [https://www.uiua.org/install#editor-support supported editor]) to view code more easily.
==Todo==
[https://rosettacode.org/wiki/Tasks_not_implemented_in_Uiua Tasks not implemented in Uiua]
\ No newline at end of file
diff --git a/Lang/UnixPipes/00-LANG.txt b/Lang/UnixPipes/00-LANG.txt
index 8a315a0473..421b024690 100644
--- a/Lang/UnixPipes/00-LANG.txt
+++ b/Lang/UnixPipes/00-LANG.txt
@@ -13,7 +13,7 @@ Using utilities from, [http://packages.debian.org/unstable/utils/moreutils moreu
Defining unfold as the opposite of xargs, i.e take a list of arguments and send them one at a time.
The definition would be
-
+
|cat unfold
num=$1
while read xxx; do
@@ -27,7 +27,7 @@ done
4 5 6
7 8
-
+
== Deleted solutions ==
We delete a UnixPipes solution when it is too similar to its UNIX Shell equivalent, or when it is incorrect (but the UNIX Shell solution is correct).
diff --git a/Lang/Uxntal/Bioinformatics-base-count b/Lang/Uxntal/Bioinformatics-base-count
deleted file mode 120000
index f9af105afe..0000000000
--- a/Lang/Uxntal/Bioinformatics-base-count
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Bioinformatics-base-count/Uxntal
\ No newline at end of file
diff --git a/Lang/V-(Vlang)/00-LANG.txt b/Lang/V-(Vlang)/00-LANG.txt
index d8ee4e2c69..56c1cc8279 100644
--- a/Lang/V-(Vlang)/00-LANG.txt
+++ b/Lang/V-(Vlang)/00-LANG.txt
@@ -21,13 +21,15 @@ V is an easier to learn, read, and use language.
[https://vlang.io V] first appeared in 2019 in a trial web sandbox, "The V Playground".
-V's design has been influenced by Go, Oberon, Rust, Swift, Kotlin, and Python. [https://github.com/vlang/v/wiki/FAQ For V's FAQ]
+V's design and history has been influenced by Go, C, Oberon, Rust, Swift, Kotlin, and Python.
-V's sources are published at [https://github.com/vlang/v GitHub], presently on version [https://github.com/vlang/v/releases 0.4.x].
+V's sources are published at [https://github.com/vlang/v GitHub], presently on version [https://github.com/vlang/v/releases 0.5.x].
+
+V's [https://github.com/vlang/v/wiki/FAQ FAQ] and [https://github.com/vlang/v/blob/master/ROADMAP.md roadmap] to see its validity, promise, and delivery of features.
V's compiler tool is similar in implementation to a multi purpose command processor: ''prompt$ v help''
-V language review and documentation are [https://github.com/vlang/v/blob/master/doc/docs.md here].
+V language review and documentation is [https://github.com/vlang/v/blob/master/doc/docs.md here] for the professional, student, or as a hobby.
==Helpful links==
* [https://en.everybodywiki.com/V_(programming_language) V in Wiki]
@@ -35,6 +37,7 @@ V language review and documentation are [https://github.com/vlang/v/blob/master/
* [https://www.youtube.com/watch?v=pchEsYwA74Q V language overview and introduction] on behalf of the Sydney Computing Society
* [https://www.youtube.com/watch?v=_dIAcNp9bJs V language overview and presentation] for IBM
* Some of the code snippets are available at the archived [//github.com/v-community/v_rosetta V-Community (V Rosetta) GitHub]
+* For venturing into how to contribute, join, or help the V project can be found [https://github.com/vlang/v/blob/master/CONTRIBUTING.md#how-to-help-and-contribute-to-the-v-project here].
* More info on the below can be found at [https://modules.vlang.io/ modules used by V]
{| class="wikitable"
diff --git a/Lang/V-(Vlang)/Bioinformatics-base-count b/Lang/V-(Vlang)/Bioinformatics-base-count
deleted file mode 120000
index 93867218eb..0000000000
--- a/Lang/V-(Vlang)/Bioinformatics-base-count
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Bioinformatics-base-count/V-(Vlang)
\ No newline at end of file
diff --git a/Lang/V-(Vlang)/Sorting-Algorithms-Circle-Sort b/Lang/V-(Vlang)/Sorting-Algorithms-Circle-Sort
deleted file mode 120000
index 90876b0ca9..0000000000
--- a/Lang/V-(Vlang)/Sorting-Algorithms-Circle-Sort
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Sorting-Algorithms-Circle-Sort/V-(Vlang)
\ No newline at end of file
diff --git a/Lang/VBA/Quaternion-type b/Lang/VBA/Quaternion-type
deleted file mode 120000
index b9d823193e..0000000000
--- a/Lang/VBA/Quaternion-type
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Quaternion-type/VBA
\ No newline at end of file
diff --git a/Lang/VBScript/Bioinformatics-base-count b/Lang/VBScript/Bioinformatics-base-count
deleted file mode 120000
index 27b49dfc57..0000000000
--- a/Lang/VBScript/Bioinformatics-base-count
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Bioinformatics-base-count/VBScript
\ No newline at end of file
diff --git a/Lang/Visual-Basic-.NET/Quaternion-type b/Lang/Visual-Basic-.NET/Quaternion-type
deleted file mode 120000
index 111784d7c2..0000000000
--- a/Lang/Visual-Basic-.NET/Quaternion-type
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Quaternion-type/Visual-Basic-.NET
\ No newline at end of file
diff --git a/Lang/Wee-Basic/Empty-program b/Lang/Wee-Basic/Empty-program
deleted file mode 120000
index 132197773e..0000000000
--- a/Lang/Wee-Basic/Empty-program
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Empty-program/Wee-Basic
\ No newline at end of file
diff --git a/Lang/Wren/Bioinformatics-base-count b/Lang/Wren/Bioinformatics-base-count
deleted file mode 120000
index 620c92bb71..0000000000
--- a/Lang/Wren/Bioinformatics-base-count
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Bioinformatics-base-count/Wren
\ No newline at end of file
diff --git a/Lang/Wren/Empty-program b/Lang/Wren/Empty-program
deleted file mode 120000
index e0842518a1..0000000000
--- a/Lang/Wren/Empty-program
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Empty-program/Wren
\ No newline at end of file
diff --git a/Lang/Wren/Meissel-Mertens-constant b/Lang/Wren/Meissel-Mertens-constant
deleted file mode 120000
index 2a9c71a439..0000000000
--- a/Lang/Wren/Meissel-Mertens-constant
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Meissel-Mertens-constant/Wren
\ No newline at end of file
diff --git a/Lang/Wren/Miller-Rabin-primality-test b/Lang/Wren/Miller-Rabin-primality-test
deleted file mode 120000
index 26f77867d2..0000000000
--- a/Lang/Wren/Miller-Rabin-primality-test
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Miller-Rabin-primality-test/Wren
\ No newline at end of file
diff --git a/Lang/Wren/Quaternion-type b/Lang/Wren/Quaternion-type
deleted file mode 120000
index 42a26f0111..0000000000
--- a/Lang/Wren/Quaternion-type
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Quaternion-type/Wren
\ No newline at end of file
diff --git a/Lang/Wren/Sorting-Algorithms-Circle-Sort b/Lang/Wren/Sorting-Algorithms-Circle-Sort
deleted file mode 120000
index 3d8f8916cb..0000000000
--- a/Lang/Wren/Sorting-Algorithms-Circle-Sort
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Sorting-Algorithms-Circle-Sort/Wren
\ No newline at end of file
diff --git a/Lang/X86-64-Assembly/Miller-Rabin-primality-test b/Lang/X86-64-Assembly/Miller-Rabin-primality-test
deleted file mode 120000
index 0607272f30..0000000000
--- a/Lang/X86-64-Assembly/Miller-Rabin-primality-test
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Miller-Rabin-primality-test/X86-64-Assembly
\ No newline at end of file
diff --git a/Lang/XPL0/Bioinformatics-base-count b/Lang/XPL0/Bioinformatics-base-count
deleted file mode 120000
index 485c648b6c..0000000000
--- a/Lang/XPL0/Bioinformatics-base-count
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Bioinformatics-base-count/XPL0
\ No newline at end of file
diff --git a/Lang/XPL0/Meissel-Mertens-constant b/Lang/XPL0/Meissel-Mertens-constant
deleted file mode 120000
index 8f73d24896..0000000000
--- a/Lang/XPL0/Meissel-Mertens-constant
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Meissel-Mertens-constant/XPL0
\ No newline at end of file
diff --git a/Lang/XPL0/Quaternion-type b/Lang/XPL0/Quaternion-type
deleted file mode 120000
index 03ac35a45d..0000000000
--- a/Lang/XPL0/Quaternion-type
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Quaternion-type/XPL0
\ No newline at end of file
diff --git a/Lang/XPL0/Sorting-Algorithms-Circle-Sort b/Lang/XPL0/Sorting-Algorithms-Circle-Sort
deleted file mode 120000
index a68d7b0426..0000000000
--- a/Lang/XPL0/Sorting-Algorithms-Circle-Sort
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Sorting-Algorithms-Circle-Sort/XPL0
\ No newline at end of file
diff --git a/Lang/YAMLScript/00-LANG.txt b/Lang/YAMLScript/00-LANG.txt
index 53f8a21c4a..7e44330500 100644
--- a/Lang/YAMLScript/00-LANG.txt
+++ b/Lang/YAMLScript/00-LANG.txt
@@ -49,4 +49,67 @@ Test the new installation:
-e, --eval YSEXPR Evaluate a YS expression
...
-See https://yamlscript.org for more information.
\ No newline at end of file
+See https://yamlscript.org for more information.
+
+==Adding YS Entries to Rosetta Code==
+
+Here's a YS program that you can use to format a YS program and it's output to a MediaWiki text to insert into a Rosetta Code task page:
+
+
+#!/usr/bin/env ys-0
+
+# Create a Rosetta Code entry for a YS program:
+
+defn main(program *args):
+ say: |-
+
+ =={{header|YAMLScript}}==
+
+ $chomp(program:read)
+
+
+ when-not ENV.NO_OUT.?:
+ command =: "ys $program$fmt-args(args)"
+ output =: bash(command).out:chomp
+ say: |-
+
+ {{out}}
+
+ $ $command
+ $output
+ </pre>
+
+defn fmt-args(args):
+ args =: !:joins
+ map _ args:
+ \(re-matches(/[-+,.:\w]+/ _:S)
+ .if(_ pr-str(_)))
+ when args.?: " $args"
+
+
+You run it like this:
+
+
+$ ys rosetta-code-ys-entry fibonacci-sequence.ys 5
+
+=={{header|YAMLScript}}==
+
+!YS-v0
+
+defn main(n=10):
+ loop a 0, b 1, i 1:
+ say: a
+ when i < n:
+ recur: b, (a + b), i.++
+
+
+{{out}}
+
+$ ys fibonacci-sequence.ys 5
+0
+1
+1
+2
+3
+</pre>
+
\ No newline at end of file
diff --git a/Lang/Yabasic/Empty-program b/Lang/Yabasic/Empty-program
deleted file mode 120000
index 86460983fb..0000000000
--- a/Lang/Yabasic/Empty-program
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Empty-program/Yabasic
\ No newline at end of file
diff --git a/Lang/Yabasic/Meissel-Mertens-constant b/Lang/Yabasic/Meissel-Mertens-constant
deleted file mode 120000
index 2300a0e96d..0000000000
--- a/Lang/Yabasic/Meissel-Mertens-constant
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Meissel-Mertens-constant/Yabasic
\ No newline at end of file
diff --git a/Lang/ZX-Spectrum-Basic/Sorting-Algorithms-Circle-Sort b/Lang/ZX-Spectrum-Basic/Sorting-Algorithms-Circle-Sort
deleted file mode 120000
index c34f35480d..0000000000
--- a/Lang/ZX-Spectrum-Basic/Sorting-Algorithms-Circle-Sort
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Sorting-Algorithms-Circle-Sort/ZX-Spectrum-Basic
\ No newline at end of file
diff --git a/Lang/Zkl/Bioinformatics-base-count b/Lang/Zkl/Bioinformatics-base-count
deleted file mode 120000
index f344937ca4..0000000000
--- a/Lang/Zkl/Bioinformatics-base-count
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Bioinformatics-base-count/Zkl
\ No newline at end of file
diff --git a/Lang/Zkl/Miller-Rabin-primality-test b/Lang/Zkl/Miller-Rabin-primality-test
deleted file mode 120000
index 92bfcfa6ff..0000000000
--- a/Lang/Zkl/Miller-Rabin-primality-test
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Miller-Rabin-primality-test/Zkl
\ No newline at end of file
diff --git a/Lang/Zkl/Quaternion-type b/Lang/Zkl/Quaternion-type
deleted file mode 120000
index d36f19dd00..0000000000
--- a/Lang/Zkl/Quaternion-type
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Quaternion-type/Zkl
\ No newline at end of file
diff --git a/Lang/Zkl/Sorting-Algorithms-Circle-Sort b/Lang/Zkl/Sorting-Algorithms-Circle-Sort
deleted file mode 120000
index 6de597a14d..0000000000
--- a/Lang/Zkl/Sorting-Algorithms-Circle-Sort
+++ /dev/null
@@ -1 +0,0 @@
-../../Task/Sorting-Algorithms-Circle-Sort/Zkl
\ No newline at end of file
diff --git a/Lang/Zonnon/00-LANG.txt b/Lang/Zonnon/00-LANG.txt
index 8a95e192c9..e4a45b3fa4 100644
--- a/Lang/Zonnon/00-LANG.txt
+++ b/Lang/Zonnon/00-LANG.txt
@@ -3,4 +3,11 @@
|site=http://www.zonnon.ethz.ch/
|LCT=yes
}}
-Zonnon is a general-purpose programming language in the [[Pascal]], [[Modula-2]] and [[Oberon]] family. It retains an emphasis on simplicity, clear syntax and separation of concerns whilst focusing on concurrency and ease of composition and expression. Unification of abstractions is at the heart of its design and this is reflected in its conceptual model based on modules, objects, definitions and implementations. Zonnon offers a new computing model based on active objects with their interaction defined by syntax controlled dialogs. It also introduces new features including operator overloading and exception handling, and is specifically designed to be platform independent.
\ No newline at end of file
+Zonnon is a general-purpose programming language in the [[Pascal]], [[Modula-2]] and [[Oberon]] family. It retains an emphasis on simplicity, clear syntax and separation of concerns whilst focusing on concurrency and ease of composition and expression. Unification of abstractions is at the heart of its design and this is reflected in its conceptual model based on modules, objects, definitions and implementations. Zonnon offers a new computing model based on active objects with their interaction defined by syntax controlled dialogs. It also introduces new features including operator overloading and exception handling, and is specifically designed to be platform independent.
+
+===See also===
+* [[Oberon-07]]
+* [[Oberon-2]]
+* [[Component Pascal]]
+* [[Modula-2]]
+* [[Modula-3]]
\ No newline at end of file
diff --git a/Task/100-doors/11l/100-doors.11l b/Task/100-doors/11l/100-doors.11l
index 3783f3ff5a..2808744415 100644
--- a/Task/100-doors/11l/100-doors.11l
+++ b/Task/100-doors/11l/100-doors.11l
@@ -1,5 +1,5 @@
V doors = [0B] * 100
-L(i) 100
+L(i) 0.<100
L(j) (i .< 100).step(i + 1)
doors[j] = !doors[j]
print(‘Door ’(i + 1)‘: ’(I doors[i] {‘open’} E ‘close’))
diff --git a/Task/100-doors/8080-Assembly/100-doors-2.8080 b/Task/100-doors/8080-Assembly/100-doors-2.8080
index 48acc304f5..d5cb28c55f 100644
--- a/Task/100-doors/8080-Assembly/100-doors-2.8080
+++ b/Task/100-doors/8080-Assembly/100-doors-2.8080
@@ -1,58 +1,45 @@
- ;------------------------------------------------------
- ; useful equates
- ;------------------------------------------------------
wboot equ 0 ; jump to BIOS warm boot routine
-bdos equ 5 ; BDOS entry
-conout equ 2 ; BDOS console output function
+bdos equ 5 ; BDOS entry
+conout equ 2 ; BDOS console output function
putstr equ 9 ; BDOS print string function
-ndoors equ 100
+ndoors equ 100 ; number of doors
;
org 100h
lxi sp,stack ; set our own stack
- lxi d,signon ; print signon message
+ lxi d,intro ; print introductory message
mvi c,putstr
- call bdos
+ call bdos
;
- ; generate sequence of squares from 1 to specified limit
+ ; generate sequence of squares to specified limit
+ ; HL holds the current square
+ ; DE holds the increment
+ ; BC holds the negative of the limit
;
-gensqr:
- lxi h,1 ; starting value of square
+gensqr: lxi h,1 ; starting value of square
lxi d,3 ; starting value of increment
- lxi b,ndoors+1
-sqrs2:
- call cmpbchl ; have we exceeded the limit?
- jnc done ; we're finished
- call putdec ; otherwise print current square
- mvi a,' ' ; separate with a space
- call putchr
- dad d ; square += incrememnt
- inx d ; increment += 2
+ lxi b,-ndoors
+sqrs2: call putdec ; otherwise print current square
+ mvi a,' ' ; separate with a space
+ call putchr
+ push h ; have we reached the limit?
+ dad b
+ pop h
+ jc done ; CY if HL > limit
+ dad d ; square += incrememnt
+ inx d ; increment += 2
inx d
- jmp sqrs2 ; repeat until finished
+ jmp sqrs2 ; repeat until finished
;
-done: jmp wboot ; exit to command prompt
- ;
- ;---------------------------------------------------
- ; 16-bit unsigned comparison of HL and BC
- ; if HL = BC then Z flag set
- ; if HL < BC then CY flag set (NC if HL >= BC)
- ;------------------------------------------------------
-cmpbchl:
- mov a,h
- cmp b
- rnz
- mov a,l
- cmp c
- ret
+done: jmp wboot ; exit with warm boot
;---------------------------------------------------
; console output of char in A register
;---------------------------------------------------
-putchr: push h
- push d
- push b
+putchr: push h
+ push d
+ push b
mov e,a
mvi c,conout
- call bdos
+ call bdos
pop b
pop d
pop h
@@ -61,9 +48,9 @@ putchr: push h
; Output decimal number to console
; HL holds 16-bit unsigned binary number to print
;---------------------------------------------------
-putdec: push b
- push d
- push h
+putdec: push b
+ push d
+ push h
lxi b,-10
lxi d,-1
putdec2:
@@ -78,7 +65,7 @@ putdec2:
cnz putdec ; recursive call
mov a,e
adi '0'
- call putchr
+ call putchr
pop h
pop d
pop b
@@ -86,7 +73,7 @@ putdec2:
;---------------------------------------------------
; data area and stack
;---------------------------------------------------
-signon: db 'The open doors are: $'
+intro: db 'The open doors are: $'
stack equ $+128 ; 64-level stack
;
end
diff --git a/Task/100-doors/Ada/100-doors-1.ada b/Task/100-doors/Ada/100-doors-1.ada
deleted file mode 100644
index fd746501f2..0000000000
--- a/Task/100-doors/Ada/100-doors-1.ada
+++ /dev/null
@@ -1,22 +0,0 @@
-with Ada.Text_Io; use Ada.Text_Io;
-
- procedure Doors is
- type Door_State is (Closed, Open);
- type Door_List is array(Positive range 1..100) of Door_State;
- The_Doors : Door_List := (others => Closed);
- begin
- for I in 1..100 loop
- for J in The_Doors'range loop
- if J mod I = 0 then
- if The_Doors(J) = Closed then
- The_Doors(J) := Open;
- else
- The_Doors(J) := Closed;
- end if;
- end if;
- end loop;
- end loop;
- for I in The_Doors'range loop
- Put_Line(Integer'Image(I) & " is " & Door_State'Image(The_Doors(I)));
- end loop;
- end Doors;
diff --git a/Task/100-doors/Ada/100-doors-2.ada b/Task/100-doors/Ada/100-doors-2.ada
deleted file mode 100644
index 0af233cef5..0000000000
--- a/Task/100-doors/Ada/100-doors-2.ada
+++ /dev/null
@@ -1,16 +0,0 @@
-with Ada.Text_Io; use Ada.Text_Io;
- with Ada.Numerics.Elementary_Functions; use Ada.Numerics.Elementary_Functions;
-
- procedure Doors_Optimized is
- Num : Float;
- begin
- for I in 1..100 loop
- Num := Sqrt(Float(I));
- Put(Integer'Image(I) & " is ");
- if Float'Floor(Num) = Num then
- Put_Line("Opened");
- else
- Put_Line("Closed");
- end if;
- end loop;
- end Doors_Optimized;
diff --git a/Task/100-doors/Agena/100-doors.agena b/Task/100-doors/Agena/100-doors.agena
deleted file mode 100644
index 18c9cb1963..0000000000
--- a/Task/100-doors/Agena/100-doors.agena
+++ /dev/null
@@ -1,19 +0,0 @@
-# find the first few squares via the unoptimised door flipping method
-scope
-
- local doorMax := 100;
- local door;
- create register door( doorMax );
-
- # set all doors to closed
- for i to doorMax do door[ i ] := false od;
-
- # repeatedly flip the doors
- for i to doorMax do
- for j from i to doorMax by i do door[ j ] := not door[ j ] od
- od;
-
- # display the results
- for i to doorMax do if door[ i ] then write( " ", i ) fi od; print()
-
-epocs
diff --git a/Task/100-doors/AutoIt/100-doors.autoit b/Task/100-doors/AutoIt/100-doors.autoit
deleted file mode 100644
index d8988366c6..0000000000
--- a/Task/100-doors/AutoIt/100-doors.autoit
+++ /dev/null
@@ -1,17 +0,0 @@
-#include
-$doors = 100
-
-;door array, 0 = closed, 1 = open
-Local $door[$doors +1]
-
-For $ii = 1 To $doors
- For $i = $ii To $doors Step $ii
- $door[$i] = Not $door[$i]
- next
-Next
-
-;display to screen
-For $i = 1 To $doors
- ConsoleWrite (Number($door[$i])& " ")
- If Mod($i,10) = 0 Then ConsoleWrite(@CRLF)
-Next
diff --git a/Task/100-doors/AutoLISP/100-doors.l b/Task/100-doors/AutoLISP/100-doors.l
deleted file mode 100644
index d4a0ebbe77..0000000000
--- a/Task/100-doors/AutoLISP/100-doors.l
+++ /dev/null
@@ -1,18 +0,0 @@
-(defun CreateDoors (n / doors)
- (repeat n
- (setq doors (cons nil doors))
- )
-)
-
-(defun Doors (doors / cnt)
- (setq cnt 0)
- (mapcar
- '(lambda (d)
- (zerop (rem (sqrt (setq cnt (1+ cnt))) 1))
- )
- doors
- )
-)
-
-> (Doors (CreateDoors 100))
-(T nil nil T nil nil nil nil T nil nil nil nil nil nil T nil nil nil nil nil nil nil nil T nil nil nil nil nil nil nil nil nil nil T nil nil nil nil nil nil nil nil nil nil nil nil T nil nil nil nil nil nil nil nil nil nil nil nil nil nil T nil nil nil nil nil nil nil nil nil nil nil nil nil nil nil nil T nil nil nil nil nil nil nil nil nil nil nil nil nil nil nil nil nil nil T nil nil nil nil nil nil nil nil nil nil nil nil nil nil nil nil nil nil nil nil T nil nil nil nil nil nil nil nil nil nil nil nil nil nil nil nil nil nil nil nil nil nil T nil nil nil nil nil nil nil nil nil nil nil nil nil nil nil nil nil nil nil nil nil nil nil nil T nil nil nil nil nil nil nil nil nil nil nil nil nil nil nil nil nil nil nil nil nil nil nil nil nil nil T nil nil nil nil)
diff --git a/Task/100-doors/COBOL/100-doors.cobol b/Task/100-doors/COBOL/100-doors.cobol
deleted file mode 100644
index c33e3bb962..0000000000
--- a/Task/100-doors/COBOL/100-doors.cobol
+++ /dev/null
@@ -1,33 +0,0 @@
- IDENTIFICATION DIVISION.
- PROGRAM-ID. 100Doors.
-
- DATA DIVISION.
- WORKING-STORAGE SECTION.
- 01 Current-n PIC 9(3).
- 01 StepSize PIC 9(3).
- 01 DoorTable.
- 02 Doors PIC 9(1) OCCURS 100 TIMES.
- 88 ClosedDoor VALUE ZERO.
- 01 Idx PIC 9(3).
-
- PROCEDURE DIVISION.
- Begin.
- INITIALIZE DoorTable
- PERFORM VARYING StepSize FROM 1 BY 1 UNTIL StepSize > 100
- PERFORM VARYING Current-n FROM StepSize BY StepSize
- UNTIL Current-n > 100
- SUBTRACT Doors (Current-n) FROM 1 GIVING Doors (Current-n)
- END-PERFORM
- END-PERFORM
-
- PERFORM VARYING Idx FROM 1 BY 1
- UNTIL Idx > 100
- IF ClosedDoor (Idx)
- DISPLAY Idx " is closed."
- ELSE
- DISPLAY Idx " is open."
- END-IF
- END-PERFORM
-
- STOP RUN
- .
diff --git a/Task/100-doors/Coq/100-doors-1.coq b/Task/100-doors/Coq/100-doors-1.coq
deleted file mode 100644
index a37db1f5d0..0000000000
--- a/Task/100-doors/Coq/100-doors-1.coq
+++ /dev/null
@@ -1,26 +0,0 @@
-Require Import List.
-
-Fixpoint rep {A} (a : A) n :=
- match n with
- | O => nil
- | S n' => a::(rep a n')
- end.
-
-Fixpoint flip (l : list bool) (n k : nat) : list bool :=
- match l with
- | nil => nil
- | cons h t => match k with
- | O => (negb h) :: (flip t n n)
- | S k' => h :: (flip t n k')
- end
- end.
-
-Definition flipeach l n := flip l n n.
-
-Fixpoint flipwhile l n :=
- match n with
- | O => flipeach l 0
- | S n' => flipwhile (flipeach l (S n')) n'
- end.
-
-Definition prison cells := flipwhile (rep false cells) cells.
diff --git a/Task/100-doors/Coq/100-doors-2.coq b/Task/100-doors/Coq/100-doors-2.coq
deleted file mode 100644
index c3f1f1158f..0000000000
--- a/Task/100-doors/Coq/100-doors-2.coq
+++ /dev/null
@@ -1,13 +0,0 @@
-Require Import List.
-
-Fixpoint prisoo' nd n k accu :=
- match nd with
- | O => rev accu
- | S nd' => let ra := match k with
- | O => (true, S n, (n + n))
- | S k' => (false, n, k')
- end in
- prisoo' nd' (snd (fst ra)) (snd ra) ((fst (fst ra))::accu)
- end.
-
-Definition prisoo cells := prisoo' cells 1 0 nil.
diff --git a/Task/100-doors/Coq/100-doors-3.coq b/Task/100-doors/Coq/100-doors-3.coq
deleted file mode 100644
index 56df2e7103..0000000000
--- a/Task/100-doors/Coq/100-doors-3.coq
+++ /dev/null
@@ -1 +0,0 @@
-Goal prison 100 = prisoo 100. compute. reflexivity. Qed.
diff --git a/Task/100-doors/Coq/100-doors-4.coq b/Task/100-doors/Coq/100-doors-4.coq
deleted file mode 100644
index c469094c8e..0000000000
--- a/Task/100-doors/Coq/100-doors-4.coq
+++ /dev/null
@@ -1 +0,0 @@
-Goal forall n, prison n = prisoo n. Abort.
diff --git a/Task/100-doors/Elena/100-doors.elena b/Task/100-doors/Elena/100-doors.elena
index dd7db1e5c7..b376bcd9da 100644
--- a/Task/100-doors/Elena/100-doors.elena
+++ b/Task/100-doors/Elena/100-doors.elena
@@ -1,7 +1,7 @@
import system'routines;
import extensions;
-public program()
+public Program()
{
var Doors := Array.allocate(100).populate::(n=>false);
for(int i := 0; i < 100; i++)
diff --git a/Task/100-doors/Emacs-Lisp/100-doors-1.l b/Task/100-doors/Emacs-Lisp/100-doors-1.l
deleted file mode 100644
index 518fbd4193..0000000000
--- a/Task/100-doors/Emacs-Lisp/100-doors-1.l
+++ /dev/null
@@ -1,83 +0,0 @@
-(defun create-doors ()
- "Returns a list of closed doors
-
-Each door only has two status: open or closed.
-If a door is closed it has the value 0, if it's open it has the value 1."
- (let ((return_value '(0))
- ;; There is already a door in the return_value, so k starts at 1
- ;; otherwise we would need to compare k against 99 and not 100 in
- ;; the while loop
- (k 1))
- (while (< k 100)
- (setq return_value (cons 0 return_value))
- (setq k (+ 1 k)))
- return_value))
-
-(defun toggle-single-door (doors)
- "Toggle the stat of the door at the `car' position of the DOORS list
-
-DOORS is a list of integers with either the value 0 or 1 and it represents
-a row of doors.
-
-Returns a list where the `car' of the list has it's value toggled (if open
-it becomes closed, if closed it becomes open)."
- (if (= (car doors) 1)
- (cons 0 (cdr doors))
- (cons 1 (cdr doors))))
-
-(defun toggle-doors (doors step original-step)
- "Step through all elements of the doors' list and toggle a door when step is 1
-
-DOORS is a list of integers with either the value 0 or 1 and it represents
-a row of doors.
-STEP is the number of doors we still need to transverse before we arrive
-at a door that has to be toggled.
-ORIGINAL-STEP is the value of the argument step when this function is
-called for the first time.
-
-Returns a list of doors"
- (cond ((null doors)
- '())
- ((= step 1)
- (cons (car (toggle-single-door doors))
- (toggle-doors (cdr doors) original-step original-step)))
- (t
- (cons (car doors)
- (toggle-doors (cdr doors) (- step 1) original-step)))))
-
-(defun main-program ()
- "The main loop for the program"
- (let ((doors_list (create-doors))
- (k 1)
- ;; We need to define max-specpdl-size and max-specpdl-size to big
- ;; numbers otherwise the loop reaches the max recursion depth and
- ;; throws an error.
- ;; If you want more information about these variables, press Ctrl
- ;; and h at the same time and then press v and then type the name
- ;; of the variable that you want to read the documentation.
- (max-specpdl-size 5000)
- (max-lisp-eval-depth 2000))
- (while (< k 101)
- (setq doors_list (toggle-doors doors_list k k))
- (setq k (+ 1 k)))
- doors_list))
-
-(defun print-doors (doors)
- "This function prints the values of the doors into the current buffer.
-
-DOORS is a list of integers with either the value 0 or 1 and it represents
-a row of doors.
-"
- ;; As in the main-program function, we need to set the variable
- ;; max-lisp-eval-depth to a big number so it doesn't reach max recursion
- ;; depth.
- (let ((max-lisp-eval-depth 5000))
- (unless (null doors)
- (insert (int-to-string (car doors)))
- (print-doors (cdr doors)))))
-
-;; Returns a list with the final solution
-(main-program)
-
-;; Print the final solution on the buffer
-(print-doors (main-program))
diff --git a/Task/100-doors/Emacs-Lisp/100-doors-2.l b/Task/100-doors/Emacs-Lisp/100-doors-2.l
deleted file mode 100644
index 66b2cff437..0000000000
--- a/Task/100-doors/Emacs-Lisp/100-doors-2.l
+++ /dev/null
@@ -1,16 +0,0 @@
-(defun one-hundred-doors(initial-state)
- "Turn doors in INITIAL-STATE according to 100 Doors problem."
- (interactive "nEnter initial doors' state (as a number): ")
- (cl-loop for x from 1 to 100
- do (cl-loop for y from (1- x) to 99 by x
- do (setq initial-state (logxor initial-state (ash 1 y)))))
- (let ((counter 1)
- (open-doors nil))
- (while (> initial-state 0)
- (when (eq (mod initial-state 2) 1)
- (push counter open-doors))
- (cl-incf counter)
- (setq initial-state (/ initial-state 2)))
- (message "Open doors are %s" (reverse open-doors))))
-
-(one-hundred-doors 0)
diff --git a/Task/100-doors/Euphoria/100-doors.ex b/Task/100-doors/Euphoria/100-doors.ex
deleted file mode 100644
index 989e2a7ae4..0000000000
--- a/Task/100-doors/Euphoria/100-doors.ex
+++ /dev/null
@@ -1,23 +0,0 @@
--- doors.ex
-include std/console.e
-sequence doors
-doors = repeat( 0, 100 ) -- 1 to 100, initialised to false
-
-for pass = 1 to 100 do
- for door = pass to 100 by pass do
- --printf( 1, "%d", doors[door] )
- --printf( 1, "%d", not doors[door] )
- doors[door] = not doors[door]
- end for
-end for
-
-sequence oc
-
-for i = 1 to 100 do
- if doors[i] then
- oc = "open"
- else
- oc = "closed"
- end if
- printf( 1, "door %d is %s\n", { i, oc } )
-end for
diff --git a/Task/100-doors/Haxe/100-doors-1.haxe b/Task/100-doors/Haxe/100-doors-1.haxe
deleted file mode 100644
index f4cab3c8b8..0000000000
--- a/Task/100-doors/Haxe/100-doors-1.haxe
+++ /dev/null
@@ -1,23 +0,0 @@
-class Main
-{
- static public function main()
- {
- findOpenDoors( 100 );
- }
-
- static function findOpenDoors( n : Int )
- {
- var door = [];
- for( i in 0...n + 1 ){ door[ i ] = false; }
- for( i in 1...n + 1 ){
- var j = i;
- while( j <= n ){
- door[ j ] = ! door[ j ];
- j += i;
- }
- }
- for( i in 1...n + 1 ){
- if( door[ i ] ){ Sys.print( ' $i' ); }
- }
- }
-}
diff --git a/Task/100-doors/Haxe/100-doors-2.haxe b/Task/100-doors/Haxe/100-doors-2.haxe
deleted file mode 100644
index 30853b01fb..0000000000
--- a/Task/100-doors/Haxe/100-doors-2.haxe
+++ /dev/null
@@ -1,18 +0,0 @@
-class RosettaDemo
-{
- static public function main()
- {
- findOpenLockers(100);
- }
-
- static function findOpenLockers(n : Int)
- {
- var i = 1;
-
- while((i*i) <= n)
- {
- Sys.println(i*i);
- i++;
- }
- }
-}
diff --git a/Task/100-doors/Informix-4GL/100-doors-2.4gl b/Task/100-doors/Informix-4GL/100-doors-2.4gl
index 77483d70d0..6a8949775e 100644
--- a/Task/100-doors/Informix-4GL/100-doors-2.4gl
+++ b/Task/100-doors/Informix-4GL/100-doors-2.4gl
@@ -2,7 +2,7 @@
(for i (range 1 101)
i2 (range (dec i) 100 i)
- (var! doors (set-at [i2] (! (i2 doors))))
+ (var! doors (set-at [i2] (not (i2 doors))))
(continue))
(-> (xmap vec doors)
diff --git a/Task/100-doors/OPL/100-doors.opl b/Task/100-doors/OPL/100-doors.opl
index e5026a3076..097dc00ccd 100644
--- a/Task/100-doors/OPL/100-doors.opl
+++ b/Task/100-doors/OPL/100-doors.opl
@@ -1,9 +1,4 @@
-REM Author.....: Eva Broccoli
-REM Date.......: 23 May 2025
-REM Description: OPL solution for "100 doors" task on https://rosettacode.org
-REM Tested with: Psion Series 3a & Series 5
-REM Contact....: eva.klassen@kittymail.com
-
+REM https://github.com/Eva-Broccoli/OPL-Rosetta-Code/blob/main/A100door.opl
PROC main:
LOCAL door%(100),i%,j%
i%=1
diff --git a/Task/100-doors/Odin/100-doors-1.odin b/Task/100-doors/Odin/100-doors-1.odin
index b4fcc95bd6..7169d3893a 100644
--- a/Task/100-doors/Odin/100-doors-1.odin
+++ b/Task/100-doors/Odin/100-doors-1.odin
@@ -1,24 +1,22 @@
-package main
+package doors
import "core:fmt"
main :: proc() {
- using fmt
+ doors: [100]bool
- Door_State :: enum {Closed, Open}
+ for every_n := 1; every_n < len(doors); every_n += 1 {
+ i := every_n - 1
+ for true {
+ if i >= len(doors) do break
- doors := [?]Door_State { 0..<100 = .Closed }
+ doors[i] = !doors[i]
- for i in 1..=100 {
- for j := i-1; j < 100; j += i {
- if doors[j] == .Closed {
- doors[j] = .Open
- } else {
- doors[j] = .Closed
- }
- }
- }
- for state, i in doors {
- println("Door: ",int(i+1)," -> ",state)
- }
+ i += every_n
+ }
+ }
+
+ for &door, i in doors {
+ if door do fmt.printf("%d ", i + 1)
+ }
}
diff --git a/Task/100-doors/Odin/100-doors-2.odin b/Task/100-doors/Odin/100-doors-2.odin
index 77e9cd99ef..b4fcc95bd6 100644
--- a/Task/100-doors/Odin/100-doors-2.odin
+++ b/Task/100-doors/Odin/100-doors-2.odin
@@ -1,7 +1,6 @@
package main
import "core:fmt"
-import "core:math"
main :: proc() {
using fmt
@@ -11,12 +10,15 @@ main :: proc() {
doors := [?]Door_State { 0..<100 = .Closed }
for i in 1..=100 {
- res := math.sqrt_f64( f64(i) )
- if math.mod_f64( res, 1) == 0 {
- doors[i-1] = .Open
- } else {
- doors[i-1] = .Closed
- }
- println("Door: ", i, " -> ", doors[i-1])
+ for j := i-1; j < 100; j += i {
+ if doors[j] == .Closed {
+ doors[j] = .Open
+ } else {
+ doors[j] = .Closed
+ }
+ }
+ }
+ for state, i in doors {
+ println("Door: ",int(i+1)," -> ",state)
}
}
diff --git a/Task/100-doors/PowerShell/100-doors-1.psh b/Task/100-doors/PowerShell/100-doors-1.psh
deleted file mode 100644
index 816268d1b7..0000000000
--- a/Task/100-doors/PowerShell/100-doors-1.psh
+++ /dev/null
@@ -1,14 +0,0 @@
-$doors = @(0..99)
-for($i=0; $i -lt 100; $i++) {
- $doors[$i] = 0 # start with all doors closed
-}
-for($i=0; $i -lt 100; $i++) {
- $step = $i + 1
- for($j=$i; $j -lt 100; $j = $j + $step) {
- $doors[$j] = $doors[$j] -bxor 1
- }
-}
-foreach($doornum in 1..100) {
- if($doors[($doornum-1)] -eq $true) {"$doornum open"}
- else {"$doornum closed"}
-}
diff --git a/Task/100-doors/PowerShell/100-doors-2.psh b/Task/100-doors/PowerShell/100-doors-2.psh
deleted file mode 100644
index 896a25e1fb..0000000000
--- a/Task/100-doors/PowerShell/100-doors-2.psh
+++ /dev/null
@@ -1,37 +0,0 @@
-function Get-DoorState($NumberOfDoors)
-{
- begin
- {
- $Doors = @()
- $Multiple = 1
- }
-
- process
- {
- for ($i = 1; $i -le $NumberOfDoors; $i++)
- {
- $Door = [pscustomobject]@{
- Name = $i
- Open = $false
- }
-
- $Doors += $Door
- }
-
- While ($Multiple -le $NumberOfDoors)
- {
- Foreach ($Door in $Doors)
- {
- if ($Door.name % $Multiple -eq 0)
- {
- If ($Door.open -eq $False){$Door.open = $True}
- Else {$Door.open = $False}
- }
- }
-
- $Multiple++
- }
- }
-
- end {$Doors}
-}
diff --git a/Task/100-doors/PowerShell/100-doors-3.psh b/Task/100-doors/PowerShell/100-doors-3.psh
deleted file mode 100644
index acc1a5f397..0000000000
--- a/Task/100-doors/PowerShell/100-doors-3.psh
+++ /dev/null
@@ -1,2 +0,0 @@
-$doors = 1..100 | ForEach-Object {0}
-1..100 | ForEach-Object { $a=$_;1..100 | Where-Object { -not ( $_ % $a ) } | ForEach-Object { $doors[$_-1] = $doors[$_-1] -bxor 1 }; if ( $doors[$a-1] ) { "door opened" } else { "door closed" } }
diff --git a/Task/100-doors/PowerShell/100-doors-4.psh b/Task/100-doors/PowerShell/100-doors-4.psh
deleted file mode 100644
index c7903f1a70..0000000000
--- a/Task/100-doors/PowerShell/100-doors-4.psh
+++ /dev/null
@@ -1,3 +0,0 @@
-$doors = 1..100 | ForEach-Object {0}
-$visited = 1..100
-1..100 | ForEach-Object { $a=$_;$visited[0..([math]::floor(100/$a)-1)] | Where-Object { -not ( $_ % $a ) } | ForEach-Object { $doors[$_-1] = $doors[$_-1] -bxor 1;$visited[$_/$a-1]+=($_/$a) }; if ( $doors[$a-1] ) { "door opened" } else { "door closed" } }
diff --git a/Task/100-doors/PowerShell/100-doors-5.psh b/Task/100-doors/PowerShell/100-doors-5.psh
deleted file mode 100644
index 9012ac03a5..0000000000
--- a/Task/100-doors/PowerShell/100-doors-5.psh
+++ /dev/null
@@ -1,3 +0,0 @@
-1..100|foreach-object {$pipe += "toggle $_ |"} -begin {$pipe=""}
-filter toggle($pass) {$_.door = $_.door -xor !($_.index % $pass);$_}
-invoke-expression "1..100| foreach-object {@{index=`$_;door=`$false}} | $pipe out-host"
diff --git a/Task/100-doors/PowerShell/100-doors-6.psh b/Task/100-doors/PowerShell/100-doors-6.psh
deleted file mode 100644
index fc185f3853..0000000000
--- a/Task/100-doors/PowerShell/100-doors-6.psh
+++ /dev/null
@@ -1,6 +0,0 @@
-Workflow Calc-Doors {
- Foreach –parallel ($number in 1..100) {
- "Door " + $number.ToString("0000") + ": " + @{$true="Closed";$false="Open"}[([Math]::pow($number, 0.5)%1) -ne 0]
- }
-}
-Calc-Doors | sort
diff --git a/Task/100-doors/PowerShell/100-doors-7.psh b/Task/100-doors/PowerShell/100-doors-7.psh
deleted file mode 100644
index 1714f382c9..0000000000
--- a/Task/100-doors/PowerShell/100-doors-7.psh
+++ /dev/null
@@ -1 +0,0 @@
-1..10|%{"Door "+ $_*$_ + " is open"}
diff --git a/Task/100-doors/Python/100-doors-5.py b/Task/100-doors/Python/100-doors-5.py
index c3f39a49a6..96e57804d7 100644
--- a/Task/100-doors/Python/100-doors-5.py
+++ b/Task/100-doors/Python/100-doors-5.py
@@ -1,6 +1,2 @@
for i in range(1, 101):
- if i**0.5 % 1:
- state='closed'
- else:
- state='open'
- print("Door {}:{}".format(i, state))
+ print(f"Door {i}:{"closed" if i**0.5 % 1 else "open"}")
diff --git a/Task/100-doors/Python/100-doors-6.py b/Task/100-doors/Python/100-doors-6.py
index 7524fc9970..b42230ac44 100644
--- a/Task/100-doors/Python/100-doors-6.py
+++ b/Task/100-doors/Python/100-doors-6.py
@@ -1 +1 @@
-for i in range(1,11): print("Door %s is open" % i**2)
+for i in range(1,11): print(f"Door {i**2} is open")
diff --git a/Task/100-doors/REBOL/100-doors-1.rebol b/Task/100-doors/REBOL/100-doors-1.rebol
deleted file mode 100644
index aa422858bd..0000000000
--- a/Task/100-doors/REBOL/100-doors-1.rebol
+++ /dev/null
@@ -1,5 +0,0 @@
-doors: array/initial 100 'closed
-repeat i 100 [
- door: at doors i
- forskip door i [change door either 'open = first door ['closed] ['open]]
-]
diff --git a/Task/100-doors/REBOL/100-doors-2.rebol b/Task/100-doors/REBOL/100-doors-2.rebol
deleted file mode 100644
index b8428a69d9..0000000000
--- a/Task/100-doors/REBOL/100-doors-2.rebol
+++ /dev/null
@@ -1,26 +0,0 @@
-;; Create a bitset with capacity for 100 bits (representing 100 doors)
-;; Each bit represents a door state: 0 = closed, 1 = open
-doors: make bitset! 100
-
-;; Outer loop: Make 100 passes (i = 1 to 100)
-repeat i 100 [
- ;; Inner loop: Check each door position (j = 1 to 100)
- repeat j 100 [
- ;; If door j index is divisible by pass number i (no remainder)
- if zero? (j // i) [
- ;; Toggle the door's bit:
- ;; doors/:j accesses door j in the bitset
- ;; 'not' flips the bit value (0 -> 1, 1 -> 0)
- doors/:j: not doors/:j
- ]
- ]
-]
-
-;; Final loop: Check which doors are open, print their numbers
-repeat i 100 [
- ;; If door i's bit is set (open)
- if doors/:i [
- ;; Print the door's number and that it is open
- print ["door" i "is open"]
- ]
-]
diff --git a/Task/100-doors/REBOL/100-doors-3.rebol b/Task/100-doors/REBOL/100-doors-3.rebol
deleted file mode 100644
index 318cdd4a11..0000000000
--- a/Task/100-doors/REBOL/100-doors-3.rebol
+++ /dev/null
@@ -1,6 +0,0 @@
-;; Loop variable i from 1 to 10 (since 10^2 = 100, covers doors 1 to 100)
-repeat i 10 [
- ;; Print that door number (i squared) is open
- ;; These are exactly the doors with perfect square numbers: 1, 4, 9, ..., 100
- print ["door" (i * i) "is open"]
-]
diff --git a/Task/100-doors/VBScript/100-doors.vb b/Task/100-doors/VBScript/100-doors.vb
deleted file mode 100644
index b0ccc343de..0000000000
--- a/Task/100-doors/VBScript/100-doors.vb
+++ /dev/null
@@ -1,21 +0,0 @@
-Dim doorIsOpen(100), pass, currentDoor, text
-
-For currentDoor = 0 To 99
- doorIsOpen(currentDoor) = False
-Next
-
-For pass = 0 To 99
- For currentDoor = pass To 99 Step pass + 1
- doorIsOpen(currentDoor) = Not doorIsOpen(currentDoor)
- Next
-Next
-
-For currentDoor = 0 To 99
- text = "Door #" & currentDoor + 1 & " is "
- If doorIsOpen(currentDoor) Then
- text = text & "open."
- Else
- text = text & "closed."
- End If
- WScript.Echo(text)
-Next
diff --git a/Task/100-doors/VHDL/100-doors-1.vhdl b/Task/100-doors/VHDL/100-doors-1.vhdl
deleted file mode 100644
index 605574c224..0000000000
--- a/Task/100-doors/VHDL/100-doors-1.vhdl
+++ /dev/null
@@ -1,28 +0,0 @@
-library IEEE;
-use IEEE.STD_LOGIC_1164.ALL;
-
-entity DOORS is
- port (CLK: in std_logic; OUTPUT: out std_logic_vector(1 to 100));
-end DOORS;
-
-architecture Behavioral of DOORS is
-begin
- process (CLK)
- variable TEMP: std_logic_vector(1 to 100);
- begin
- --setup closed doors
- TEMP := (others => '0');
-
- --looping through
- for i in 1 to TEMP'length loop
- for j in i to TEMP'length loop
- if (j mod i) = 0 then
- TEMP(j) := not TEMP(j);
- end if;
- end loop;
- end loop;
-
- --assign output
- OUTPUT <= TEMP;
- end process;
-end Behavioral;
diff --git a/Task/100-doors/VHDL/100-doors-2.vhdl b/Task/100-doors/VHDL/100-doors-2.vhdl
deleted file mode 100644
index d63de9a7ac..0000000000
--- a/Task/100-doors/VHDL/100-doors-2.vhdl
+++ /dev/null
@@ -1,34 +0,0 @@
-LIBRARY ieee;
-USE ieee.std_logic_1164.all;
-
-
-entity doors is
- port (
- clk : in std_logic;
- reset : in std_logic;
- door : buffer std_logic_vector(1 to 100)
- );
-end entity doors;
-
-
-architecture rtl of doors is
- signal step : integer range 1 to 101;
- signal addr : integer range 1 to 201;
-begin
- proc_step: process(clk, reset)
- begin
- if reset = '1' then
- step <= 1;
- addr <= 1;
- door <= (others => '0');
- elsif rising_edge(clk) then
- if addr <= 100 then
- door(addr) <= not door(addr);
- addr <= addr + step;
- elsif step <= 100 then
- addr <= step + 1;
- step <= step + 1;
- end if;
- end if;
- end process;
-end;
diff --git a/Task/100-prisoners/11l/100-prisoners.11l b/Task/100-prisoners/11l/100-prisoners.11l
index f8e57ab878..0bacfb4489 100644
--- a/Task/100-prisoners/11l/100-prisoners.11l
+++ b/Task/100-prisoners/11l/100-prisoners.11l
@@ -5,7 +5,7 @@ F play_random(n)
L 0 .< n
random:shuffle(&in_drawer)
V found = 0B
- L(prisoner) 100
+ L(prisoner) 0.<100
found = 0B
L(reveal) random:sample(sampler, 50)
V card = in_drawer[reveal]
@@ -24,7 +24,7 @@ F play_optimal(n)
L 0 .< n
random:shuffle(&in_drawer)
V found = 0B
- L(prisoner) 100
+ L(prisoner) 0.<100
V reveal = prisoner
found = 0B
L 50
diff --git a/Task/100-prisoners/Ada/100-prisoners-1.ada b/Task/100-prisoners/Ada/100-prisoners-1.ada
deleted file mode 100644
index 0758b5ec27..0000000000
--- a/Task/100-prisoners/Ada/100-prisoners-1.ada
+++ /dev/null
@@ -1,23 +0,0 @@
-package Prisoners is
-
- type Win_Percentage is digits 2 range 0.0 .. 100.0;
- type Drawers is array (1 .. 100) of Positive;
-
- function Play_Game
- (Repetitions : in Positive;
- Strategy : not null access function
- (Cupboard : in Drawers; Max_Prisoners : Integer;
- Max_Attempts : Integer; Prisoner_Number : Integer) return Boolean)
- return Win_Percentage;
- -- Play the game with a specified number of repetitions, the chosen strategy
- -- is passed to this function
-
- function Optimal_Strategy
- (Cupboard : in Drawers; Max_Prisoners : Integer; Max_Attempts : Integer;
- Prisoner_Number : Integer) return Boolean;
-
- function Random_Strategy
- (Cupboard : in Drawers; Max_Prisoners : Integer; Max_Attempts : Integer;
- Prisoner_Number : Integer) return Boolean;
-
-end Prisoners;
diff --git a/Task/100-prisoners/Ada/100-prisoners-2.ada b/Task/100-prisoners/Ada/100-prisoners-2.ada
deleted file mode 100644
index f37ded4cb6..0000000000
--- a/Task/100-prisoners/Ada/100-prisoners-2.ada
+++ /dev/null
@@ -1,128 +0,0 @@
-pragma Ada_2012;
-with Ada.Numerics.Discrete_Random;
-with Ada.Text_IO; use Ada.Text_IO;
-
-package body Prisoners is
-
- subtype Drawer_Range is Positive range 1 .. 100;
- package Random_Drawer is new Ada.Numerics.Discrete_Random (Drawer_Range);
- use Random_Drawer;
-
- -- Helper procedures to initialise and shuffle the drawers
-
- procedure Swap (A, B : Positive; Cupboard : in out Drawers) is
- Temp : Positive;
- begin
- Temp := Cupboard (B);
- Cupboard (B) := Cupboard (A);
- Cupboard (A) := Temp;
- end Swap;
-
- procedure Shuffle (Cupboard : in out Drawers) is
- G : Generator;
- begin
- Reset (G);
- for I in Cupboard'Range loop
- Swap (I, Random (G), Cupboard);
- end loop;
- end Shuffle;
-
- procedure Initialise_Drawers (Cupboard : in out Drawers) is
- begin
- for I in Cupboard'Range loop
- Cupboard (I) := I;
- end loop;
- Shuffle (Cupboard);
- end Initialise_Drawers;
-
- -- The two strategies for playing the game
-
- function Optimal_Strategy
- (Cupboard : in Drawers; Max_Prisoners : Integer; Max_Attempts : Integer;
- Prisoner_Number : Integer) return Boolean
- is
- Current_Card : Positive;
- begin
- Current_Card := Cupboard (Prisoner_Number);
- if Current_Card = Prisoner_Number then
- return True;
- else
- for I in Integer range 1 .. Max_Attempts loop
- Current_Card := Cupboard (Current_Card);
- if Current_Card = Prisoner_Number then
- return True;
- end if;
- end loop;
- end if;
- return False;
- end Optimal_Strategy;
-
- function Random_Strategy
- (Cupboard : in Drawers; Max_Prisoners : Integer; Max_Attempts : Integer;
- Prisoner_Number : Integer) return Boolean
- is
- Current_Card : Positive;
- G : Generator;
- begin
- Reset (G);
- Current_Card := Cupboard (Prisoner_Number);
- if Current_Card = Prisoner_Number then
- return True;
- else
- for I in Integer range 1 .. Max_Attempts loop
- Current_Card := Cupboard (Random (G));
- if Current_Card = Prisoner_Number then
- return True;
- end if;
- end loop;
- end if;
- return False;
- end Random_Strategy;
-
- function Prisoners_Attempts
- (Cupboard : in Drawers; Max_Prisoners : Integer; Max_Attempts : Integer;
- Strategy : not null access function
- (Cupboard : in Drawers; Max_Prisoners : Integer;
- Max_Attempts : Integer; Prisoner_Number : Integer) return Boolean)
- return Boolean
- is
- begin
- for Prisoner_Number in Integer range 1 .. Max_Prisoners loop
- if not Strategy
- (Cupboard, Max_Prisoners, Max_Attempts, Prisoner_Number)
- then
- return False;
- end if;
- end loop;
- return True;
- end Prisoners_Attempts;
-
- -- The function to play the game itself
-
- function Play_Game
- (Repetitions : in Positive;
- Strategy : not null access function
- (Cupboard : in Drawers; Max_Prisoners : Integer;
- Max_Attempts : Integer; Prisoner_Number : Integer) return Boolean)
- return Win_Percentage
- is
- Cupboard : Drawers;
- Win, Game_Count : Natural := 0;
- Number_Of_Prisoners : constant Integer := 100;
- Max_Attempts : constant Integer := 50;
- begin
- loop
- Initialise_Drawers (Cupboard);
- if Prisoners_Attempts
- (Cupboard => Cupboard, Max_Prisoners => Number_Of_Prisoners,
- Max_Attempts => Max_Attempts, Strategy => Strategy)
- then
- Win := Win + 1;
- end if;
- Game_Count := Game_Count + 1;
- exit when Game_Count = Repetitions;
- end loop;
- return Win_Percentage ((Float (Win) / Float (Repetitions)) * 100.0);
- end Play_Game;
-
-end Prisoners;
diff --git a/Task/100-prisoners/Ada/100-prisoners-3.ada b/Task/100-prisoners/Ada/100-prisoners-3.ada
deleted file mode 100644
index fafdb76a09..0000000000
--- a/Task/100-prisoners/Ada/100-prisoners-3.ada
+++ /dev/null
@@ -1,17 +0,0 @@
-with Prisoners; use Prisoners;
-with Ada.Text_IO; use Ada.Text_IO;
-
-procedure Main is
- Wins : Win_Percentage;
- package Win_Percentage_IO is new Float_IO (Win_Percentage);
-begin
- Wins := Play_Game (100_000, Optimal_Strategy'Access);
- Put ("Optimal Strategy = ");
- Win_Percentage_IO.Put (Wins, 2, 2, 0);
- Put ("%");
- New_Line;
- Wins := Play_Game (100_000, Random_Strategy'Access);
- Put ("Random Strategy = ");
- Win_Percentage_IO.Put (Wins, 2, 2, 0);
- Put ("%");
-end Main;
diff --git a/Task/100-prisoners/D/100-prisoners.d b/Task/100-prisoners/D/100-prisoners.d
index 04986ae37c..5c70291510 100644
--- a/Task/100-prisoners/D/100-prisoners.d
+++ b/Task/100-prisoners/D/100-prisoners.d
@@ -37,7 +37,7 @@ bool playRandom() {
double exec(const size_t n, bool function() play) {
size_t success = 0;
- for (int i = n; i > 0; i--) {
+ for (size_t i = n; i > 0; i--) {
if (play()) {
success++;
}
diff --git a/Task/100-prisoners/PowerShell/100-prisoners.psh b/Task/100-prisoners/PowerShell/100-prisoners.psh
deleted file mode 100644
index 6bcb37f11a..0000000000
--- a/Task/100-prisoners/PowerShell/100-prisoners.psh
+++ /dev/null
@@ -1,121 +0,0 @@
-### Clear Screen from old Output
-Clear-Host
-
-Function RandomOpening ()
- {
- $Prisoners = 1..100 | Sort-Object {Get-Random}
- $Cupboard = 1..100 | Sort-Object {Get-Random}
- ## Loop for the Prisoners
- $Survived = $true
- for ($I=1;$I -le 100;$i++)
- {
- $OpeningListe = 1..100 | Sort-Object {Get-Random}
- $Gefunden = $false
- ## Loop for the trys of every prisoner
- for ($X=1;$X -le 50;$X++)
- {
- $OpenNumber = $OpeningListe[$X]
- IF ($Cupboard[$OpenNumber] -eq $Prisoners[$I])
- {
- $Gefunden = $true
- }
- ## Cancel loop if prisoner found his number (yeah i know, dirty way ^^ )
- IF ($Gefunden)
- {
- $X = 55
- }
- }
- IF ($Gefunden -eq $false)
- {
- $I = 120
- $Survived = $false
- }
- }
- Return $Survived
- }
-
- Function StrategyOpening ()
- {
- $Prisoners = 1..100 | Sort-Object {Get-Random}
- $Cupboard = 1..100 | Sort-Object {Get-Random}
- $Survived = $true
- for ($I=1;$I -le 100;$i++)
- {
- $Gefunden = $false
- $OpeningNumber = $Prisoners[$I-1]
- for ($X=1;$X -le 50;$X++)
- {
- IF ($Cupboard[$OpeningNumber-1] -eq $Prisoners[$I-1])
- {
- $Gefunden = $true
- }
- else
- {
- $OpeningNumber = $Cupboard[$OpeningNumber-1]
- }
- IF ($Gefunden)
- {
- $X = 55
- }
- }
- IF ($Gefunden -eq $false)
- {
- $I = 120
- $Survived = $false
- }
- }
- Return $Survived
- }
-
-$MaxRounds = 10000
-
-Function TestRandom
- {
- $WinnerRandom = 0
- for ($Round = 1; $Round -le $MaxRounds;$Round++)
- {
- IF (($Round%1000) -eq 0)
- {
- $Time = Get-Date
- Write-Host "Currently we are at rount $Round at $Time"
- }
- $Rueckgabewert = RandomOpening
- IF ($Rueckgabewert)
- {
- $WinnerRandom++
- }
- }
-
- $Prozent = (100/$MaxRounds)*$WinnerRandom
- Write-Host "There are $WinnerRandom survivors whit random opening. This is $Prozent percent"
- }
-
-Function TestStrategy
- {
- $WinnersStrategy = 0
- for ($Round = 1; $Round -le $MaxRounds;$Round++)
- {
- IF (($Round%1000) -eq 0)
- {
- $Time = Get-Date
- Write-Host "Currently we are at $Round at $Time"
- }
- $Rueckgabewert = StrategyOpening
- IF ($Rueckgabewert)
- {
- $WinnersStrategy++
- }
- }
-
- $Prozent = (100/$MaxRounds)*$WinnersStrategy
- Write-Host "There are $WinnersStrategy survivors whit strategic opening. This is $Prozent percent"
- }
-
-Function Main ()
- {
- Clear-Host
- TestRandom
- TestStrategy
- }
-
-Main
diff --git a/Task/100-prisoners/VBScript/100-prisoners.vb b/Task/100-prisoners/VBScript/100-prisoners.vb
deleted file mode 100644
index 9e21f34467..0000000000
--- a/Task/100-prisoners/VBScript/100-prisoners.vb
+++ /dev/null
@@ -1,62 +0,0 @@
-option explicit
-const npris=100
-const ntries=50
-const ntests=1000.
-dim drawer(100),opened(100),i
-for i=1 to npris: drawer(i)=i:next
-shuffle drawer
-wscript.echo rf(tests(false)/ntests*100,10," ") &" % success for random"
-wscript.echo rf(tests(true) /ntests*100,10," ") &" % success for optimal strategy"
-
-function rf(v,n,s) rf=right(string(n,s)& v,n):end function
-
-sub shuffle(d) 'knut's shuffle
-dim i,j,t
-randomize timer
-for i=1 to npris
- j=int(rnd()*i+1)
- t=d(i):d(i)=d(j):d(j)=t
-next
-end sub
-
-function tests(strat)
-dim cntp,i,j
-tests=0
-for i=1 to ntests
- shuffle drawer
- cntp=0
- if strat then
- for j=1 to npris
- if not trystrat(j) then exit for
- next
- else
- for j=1 to npris
- if not tryrand(j) then exit for
- next
- end if
- if j>=npris then tests=tests+1
-next
-end function
-
-function tryrand(pris)
- dim i,r
- erase opened
- for i=1 to ntries
- do
- r=int(rnd*npris+1)
- loop until opened(r)=false
- opened(r)=true
- if drawer(r)= pris then tryrand=true : exit function
- next
- tryrand=false
-end function
-
-function trystrat(pris)
- dim i,r
- r=pris
- for i=1 to ntries
- if drawer(r)= pris then trystrat=true :exit function
- r=drawer(r)
- next
- trystrat=false
-end function
diff --git a/Task/15-puzzle-game/Ada/15-puzzle-game-1.ada b/Task/15-puzzle-game/Ada/15-puzzle-game-1.ada
deleted file mode 100644
index 634015c5bc..0000000000
--- a/Task/15-puzzle-game/Ada/15-puzzle-game-1.ada
+++ /dev/null
@@ -1,16 +0,0 @@
-generic
- Rows, Cols: Positive;
- with function Name(N: Natural) return String; -- with Pre => (N < Rows*Cols);
- -- Name(0) shall return the name for the empty tile
-package Generic_Puzzle is
-
- subtype Row_Type is Positive range 1 .. Rows;
- subtype Col_Type is Positive range 1 .. Cols;
- type Moves is (Up, Down, Left, Right);
- type Move_Arr is array(Moves) of Boolean;
-
- function Get_Point(Row: Row_Type; Col: Col_Type) return String;
- function Possible return Move_Arr;
- procedure Move(The_Move: Moves);
-
-end Generic_Puzzle;
diff --git a/Task/15-puzzle-game/Ada/15-puzzle-game-2.ada b/Task/15-puzzle-game/Ada/15-puzzle-game-2.ada
deleted file mode 100644
index 86a2432cb1..0000000000
--- a/Task/15-puzzle-game/Ada/15-puzzle-game-2.ada
+++ /dev/null
@@ -1,57 +0,0 @@
-package body Generic_Puzzle is
-
- Field: array(Row_Type, Col_Type) of Natural;
- Current_R: Row_Type := Rows;
- Current_C: Col_Type := Cols;
- -- invariant: Field(Current_R, Current_C=0)
- -- and for all R, C: Field(R, C) < R*C
- -- and for all (R, C) /= (RR, CC): Field(R, C) /= Field(RR, CC)
-
- function Get_Point(Row: Row_Type; Col: Col_Type) return String is
- (Name(Field(Row, Col)));
-
- function Possible return Move_Arr is
- (Up => Current_R > 1, Down => Current_R < Rows,
- Left => Current_C > 1, Right => Current_C < Cols);
-
- procedure Move(The_Move: Moves) is
- Old_R: Row_Type; Old_C: Col_Type; N: Natural;
- begin
- if not Possible(The_Move) then
- raise Constraint_Error with "attempt to make impossible move";
- else
- -- remember current row and column
- Old_R := Current_R;
- Old_C := Current_C;
-
- -- move the virtual cursor to a new position
- case The_Move is
- when Up => Current_R := Current_R - 1;
- when Down => Current_R := Current_R + 1;
- when Left => Current_C := Current_C - 1;
- when Right => Current_C := Current_C + 1;
- end case;
-
- -- swap the tiles on the board
- N := Field(Old_R, Old_C);
- Field(Old_R, Old_C) := Field(Current_R, Current_C);
- Field(Current_R, Current_C) := N;
- end if;
- end Move;
-
-begin
- declare -- set field to its basic setting
- N: Positive := 1;
- begin
- for R in Row_Type loop
- for C in Col_Type loop
- if (R /= Current_R) or else (C /= Current_C) then
- Field(R, C) := N;
- N := N + 1;
- else
- Field(R, C) := 0;
- end if;
- end loop;
- end loop;
- end;
-end Generic_Puzzle;
diff --git a/Task/15-puzzle-game/Ada/15-puzzle-game-3.ada b/Task/15-puzzle-game/Ada/15-puzzle-game-3.ada
deleted file mode 100644
index 67ca38ab0a..0000000000
--- a/Task/15-puzzle-game/Ada/15-puzzle-game-3.ada
+++ /dev/null
@@ -1,72 +0,0 @@
-with Generic_Puzzle, Ada.Text_IO,
- Ada.Numerics.Discrete_Random, Ada.Command_Line;
-
-procedure Puzzle_15 is
-
- function Image(N: Natural) return String is
- (if N=0 then " " elsif N < 10 then " " & Integer'Image(N)
- else Integer'Image(N));
-
- package Puzzle is new Generic_Puzzle(Rows => 4, Cols => 4, Name => Image);
-
- package Rnd is new Ada.Numerics.Discrete_Random(Puzzle.Moves);
- Rand_Gen: Rnd.Generator;
-
- Level: Natural := (if Ada.Command_Line.Argument_Count = 0 then 10
- else Natural'Value(Ada.Command_Line.Argument(1)));
- Initial_Moves: Natural := (2**(Level/2) + 2**((1+Level)/2))/2;
- Texts: constant array(Puzzle.Moves) of String(1..9) :=
- ("u,U,^,8: ", "d,D,v,2: ", "l,L,<,4: ", "r,R,>,6: ");
- Move_Counter: Natural := 0;
- Command: Character;
-
- begin
- -- randomize board
- for I in 1 .. Initial_Moves loop
- declare
- M: Puzzle.Moves := Rnd.Random(Rand_Gen);
- begin
- if Puzzle.Possible(M) then
- Puzzle.Move(M);
- end if;
- end;
- end loop;
-
- -- read command and perform move
- loop
- -- Print board
- for R in Puzzle.Row_Type loop
- for C in Puzzle.Col_Type loop
- Ada.Text_IO.Put(Puzzle.Get_Point(R, C));
- end loop;
- Ada.Text_IO.New_Line;
- end loop;
- Ada.Text_IO.Get(Command);
- begin
- case Command is
- when 'u' | 'U' | '^' | '8' =>
- Ada.Text_IO.Put_Line("Up!"); Puzzle.Move(Puzzle.Up);
- when 'd' | 'D' | 'v' | '2' =>
- Ada.Text_IO.Put_Line("Down!"); Puzzle.Move(Puzzle.Down);
- when 'l' | 'L' | '<' | '4' =>
- Ada.Text_IO.Put_Line("Left!"); Puzzle.Move(Puzzle.Left);
- when 'r' | 'R' | '>' | '6' =>
- Ada.Text_IO.Put_Line("Right!"); Puzzle.Move(Puzzle.Right);
- when '!' =>
- Ada.Text_IO.Put_Line(Natural'Image(Move_Counter) & " moves!");
- exit;
- when others =>
- raise Constraint_Error with "wrong input";
- end case;
- Move_Counter := Move_Counter + 1;
- exception when Constraint_Error =>
- Ada.Text_IO.Put_Line("Possible Moves and Commands:");
- for M in Puzzle.Moves loop
- if Puzzle.Possible(M) then
- Ada.Text_IO.Put(Texts(M) & Puzzle.Moves'Image(M) & " ");
- end if;
- end loop;
- Ada.Text_IO.Put_Line("!: Quit");
- end;
- end loop;
-end Puzzle_15;
diff --git a/Task/15-puzzle-game/Ada/15-puzzle-game-4.ada b/Task/15-puzzle-game/Ada/15-puzzle-game-4.ada
deleted file mode 100644
index 8452c72460..0000000000
--- a/Task/15-puzzle-game/Ada/15-puzzle-game-4.ada
+++ /dev/null
@@ -1 +0,0 @@
- package Puzzle is new Generic_Puzzle(Rows => 3, Cols => 3, Name => Image);
diff --git a/Task/15-puzzle-game/Arturo/15-puzzle-game.arturo b/Task/15-puzzle-game/Arturo/15-puzzle-game.arturo
index 4d08ffb095..9dcfaaed59 100644
--- a/Task/15-puzzle-game/Arturo/15-puzzle-game.arturo
+++ b/Task/15-puzzle-game/Arturo/15-puzzle-game.arturo
@@ -107,17 +107,13 @@ validMovement?: $[
movement :literal
][
pos: game\playerPosition
- case [movement]
- when? [='up]
- -> return (not? in? pos [0..3])
- when? [='down]
- -> return (not? in? pos [12..15])
- when? [='left]
- -> return (not? in? pos [0 4 8 12])
- when? [='right]
- -> return (not? in? pos [3 7 11 15])
- else
- -> return false
+ case movement [
+ 'up -> return (not? in? pos [0..3])
+ 'down -> return (not? in? pos [12..15])
+ 'left -> return (not? in? pos [0 4 8 12])
+ 'right -> return (not? in? pos [3 7 11 15])
+ any -> return false
+ ]
]
@@ -130,13 +126,14 @@ validMovement?: $[
;; will be returned the same input as a :string
parseInput: $[inp :string][
lowerInp: lower inp
- case [lowerInp]
- when? [="w"] -> return 'up
- when? [="a"] -> return 'left
- when? [="s"] -> return 'down
- when? [="d"] -> return 'right
- when? [="q"] -> return 'quit
- else -> return inp
+ case lowerInp [
+ "w" -> return 'up
+ "a" -> return 'left
+ "s" -> return 'down
+ "d" -> return 'right
+ "q" -> return 'quit
+ any -> return inp
+ ]
]
;; Moves the player in Game's Table
@@ -155,7 +152,7 @@ movePlayer: $[
playerPosition :integer
relativePosition :integer
][
- try [
+ if throws? [
; 'otherPosition is the real index of the 'relativePosition
otherPosition: + playerPosition relativePosition
@@ -168,20 +165,16 @@ movePlayer: $[
; -- Updates player's status
game\playerPosition: otherPosition
game\movements: inc game\movements
- ] else -> panic "'movement didn't checked."
+ ] -> panic "'movement didn't checked."
]
- case [movement]
- when? [='up]
- -> (updateGame game position (neg 4))
- when? [='down]
- -> (updateGame game position (4))
- when? [='left]
- -> (updateGame game position (neg 1))
- when? [='right]
- -> (updateGame game position (1))
- else -> panic "'movement didn't checked."
-
+ case movement [
+ 'up -> updateGame game position neg 4
+ 'down -> updateGame game position 4
+ 'left -> updateGame game position neg 1
+ 'right -> updateGame game position 1
+ any -> panic "movement didn't check."
+ ]
]
endGame: $[
@@ -209,13 +202,12 @@ runGame: $[sampleTable :block][
-> endGame "Exiting game..."
validInp: validInput? command
- if? validInp [
+ switch validInp [
validMov: validMovement? game command
(validMov)?
-> movePlayer game command
-> printWrongMovement command
- ] else
- -> printWrongInput command
+ ] -> printWrongInput command
if sampleTable = game
-> endGame "Congratulations! You won!"
diff --git a/Task/15-puzzle-game/COBOL/15-puzzle-game.cobol b/Task/15-puzzle-game/COBOL/15-puzzle-game.cobol
deleted file mode 100644
index 1ce6bdcbbe..0000000000
--- a/Task/15-puzzle-game/COBOL/15-puzzle-game.cobol
+++ /dev/null
@@ -1,151 +0,0 @@
- >>SOURCE FORMAT FREE
-*> This code is dedicated to the public domain
-*> This is GNUCOBOL 2.0
-identification division.
-program-id. fifteen.
-environment division.
-configuration section.
-repository. function all intrinsic.
-data division.
-working-storage section.
-
-01 r pic 9.
-01 r-empty pic 9.
-01 r-to pic 9.
-01 r-from pic 9.
-
-01 c pic 9.
-01 c-empty pic 9.
-01 c-to pic 9.
-01 c-from pic 9.
-
-01 display-table.
- 03 display-row occurs 4.
- 05 display-cell occurs 4 pic 99.
-
-01 tile-number pic 99.
-01 tile-flags pic x(16).
-
-01 display-move value spaces.
- 03 tile-id pic 99.
-
-01 row-separator pic x(21) value all '.'.
-01 column-separator pic x(3) value ' . '.
-
-01 inversions pic 99.
-01 current-tile pic 99.
-
-01 winning-display pic x(32) value
- '01020304'
- & '05060708'
- & '09101112'
- & '13141500'.
-
-procedure division.
-start-fifteen.
- display 'start fifteen puzzle'
- display ' enter a two-digit tile number and press to move'
- display ' press only to exit'
-
- *> tables with an odd number of inversions are not solvable
- perform initialize-table with test after until inversions = 0
- perform show-table
- accept display-move
- perform until display-move = spaces
- perform move-tile
- perform show-table
- move spaces to display-move
- accept display-move
- end-perform
- stop run
- .
-initialize-table.
- compute tile-number = random(seconds-past-midnight) *> seed only
- move spaces to tile-flags
- move 0 to current-tile inversions
- perform varying r from 1 by 1 until r > 4
- after c from 1 by 1 until c > 4
- perform with test after
- until tile-flags(tile-number + 1:1) = space
- compute tile-number = random() * 100
- compute tile-number = mod(tile-number, 16)
- end-perform
- move 'x' to tile-flags(tile-number + 1:1)
- if tile-number > 0 and < current-tile
- add 1 to inversions
- end-if
- move tile-number to display-cell(r,c) current-tile
- end-perform
- compute inversions = mod(inversions,2)
- .
-show-table.
- if display-table = winning-display
- display 'winning'
- end-if
- display space row-separator
- perform varying r from 1 by 1 until r > 4
- perform varying c from 1 by 1 until c > 4
- display column-separator with no advancing
- if display-cell(r,c) = 00
- display ' ' with no advancing
- move r to r-empty
- move c to c-empty
- else
- display display-cell(r,c) with no advancing
- end-if
- end-perform
- display column-separator
- end-perform
- display space row-separator
- .
-move-tile.
- if not (tile-id numeric and tile-id >= 01 and <= 15)
- display 'invalid tile number'
- exit paragraph
- end-if
-
- *> find the entered tile-id row and column (r,c)
- perform varying r from 1 by 1 until r > 4
- after c from 1 by 1 until c > 4
- if display-cell(r,c) = tile-id
- exit perform
- end-if
- end-perform
-
- *> show-table filled (r-empty,c-empty)
- evaluate true
- when r = r-empty
- if c-empty < c
- *> shift left
- perform varying c-to from c-empty by 1 until c-to > c
- compute c-from = c-to + 1
- move display-cell(r-empty,c-from) to display-cell(r-empty,c-to)
- end-perform
- else
- *> shift right
- perform varying c-to from c-empty by -1 until c-to < c
- compute c-from = c-to - 1
- move display-cell(r-empty,c-from) to display-cell(r-empty,c-to)
- end-perform
- end-if
- move 00 to display-cell(r,c)
- when c = c-empty
- if r-empty < r
- *>shift up
- perform varying r-to from r-empty by 1 until r-to > r
- compute r-from = r-to + 1
- move display-cell(r-from,c-empty) to display-cell(r-to,c-empty)
- end-perform
- else
- *> shift down
- perform varying r-to from r-empty by -1 until r-to < r
- compute r-from = r-to - 1
- move display-cell(r-from,c-empty) to display-cell(r-to,c-empty)
- end-perform
- end-if
- move 00 to display-cell(r,c)
- when other
- display 'invalid move'
- end-evaluate
- .
-end program fifteen.
diff --git a/Task/15-puzzle-game/PowerShell/15-puzzle-game.psh b/Task/15-puzzle-game/PowerShell/15-puzzle-game.psh
deleted file mode 100644
index 72bca40e20..0000000000
--- a/Task/15-puzzle-game/PowerShell/15-puzzle-game.psh
+++ /dev/null
@@ -1,259 +0,0 @@
-#15 Puzzle Game
-$Script:Neighbours = @{
- "1" = @("2","5")
- "2" = @("1","3","6")
- "3" = @("2","4","7")
- "4" = @("3","8")
- "5" = @("1","6","9")
- "6" = @("2","5","7","10")
- "7" = @("3","6","8","11")
- "8" = @("4","7","12")
- "9" = @("5","10","13")
- "10" = @("6","9","11","14")
- "11" = @("7","10","12","15")
- "12" = @("8","11","0")
- "13" = @("9","14")
- "14" = @("10","13","15")
- "15" = @("11","14","0")
- "0" = @("12","15")
-}
-$script:blank = ''
-#region XAML window definition
-$xaml = @'
-
-
-
-
-
-
-
-
-'@
-#endregion
-
-#region Code Behind
-function Convert-XAMLtoWindow
-{
- param
- (
- [Parameter(Mandatory=$true)]
- [string]
- $XAML
- )
-
- Add-Type -AssemblyName PresentationFramework
-
- $reader = [XML.XMLReader]::Create([IO.StringReader]$XAML)
- $result = [Windows.Markup.XAMLReader]::Load($reader)
- $reader.Close()
- $reader = [XML.XMLReader]::Create([IO.StringReader]$XAML)
- while ($reader.Read())
- {
- $name=$reader.GetAttribute('Name')
- if (!$name) { $name=$reader.GetAttribute('x:Name') }
- if($name)
- {$result | Add-Member NoteProperty -Name $name -Value $result.FindName($name) -Force}
- }
- $reader.Close()
- $result
-}
-function Show-WPFWindow
-{
- param
- (
- [Parameter(Mandatory=$true)]
- [Windows.Window]
- $Window
- )
-
- $result = $null
- $null = $window.Dispatcher.InvokeAsync{
- $result = $window.ShowDialog()
- Set-Variable -Name result -Value $result -Scope 1
- }.Wait()
- $result
-}
-#endregion Code Behind
-
-#region Convert XAML to Window
-$window = Convert-XAMLtoWindow -XAML $xaml
-
-#endregion
-
-#region Define Event Handlers
-function Test-Victory{
- #Evaluate if all the labels are in the correct position
- $victory = $true
- foreach($num in 1..15){
- if([int]$window."b_$num".Content -ne $num){$victory = $false;break}
- }
- return($victory)
-}
-function Test-Move($Number){
- #Number is a string of the pressed button number.
- if($Script:Neighbours[$Number] -contains $script:blank){
- return($true)
- } else {
- return($false)
- }
-}
-Function Move-Tile($Number,$Bypass){
- if((!(Test-Victory)) -or $Bypass){
- if(Test-Move $Number){
- #Set the new window label
- $window."B_$script:blank".content = $window."B_$Number".content
- $window."B_$script:blank".background = $window."B_$Number".background
- $window."B_$Number".background = "#FFDDDDDD"
- #Set the new blank window label
- $window."B_$Number".content = ''
- #Enable the old blank tile
- $window."B_$script:blank".isenabled = $true
- #disable the new blank tile
- $window."B_$Number".isenabled = $false
- #set the new blank
- $script:blank = $Number
- }
- }
-}
-function Move-TileRandom{
- $lastmove = "1"
- for($i=0;$i -lt 500;$i++){
- $move = $Script:Neighbours[$script:blank] | Where-Object {$_ -ne $lastmove} | Get-Random
- $lastmove = $move
- Move-Tile $move $true
- }
-}
-function Set-TileColour($Tile){
- #I was curious about setting tiles to a checkerboard pattern at this stage. It's probably far better to just define it in the xaml
- #Ignore the blank tile
- if($Tile -ne 0){
- #check if the row of the tile is odd or even
- if((([math]::floor(($Tile - 1)/4)) % 2 -eq 0)){
- #check if the tile is odd or even
- if($Tile % 2 -eq 0){
- $window."B_$Tile".Background = "#FFFF7878"
- } else {
- $window."B_$Tile".Background = "#FF9696FF"
- }
- }else{
- if($Tile % 2 -eq 0){
- $window."B_$Tile".Background = "#FF9696FF"
- } else {
- $window."B_$Tile".Background = "#FFFF7878"
- }
- }
- } else {
- $window.B_0.Background = "#FFDDDDDD"
- }
-}
-$window.B_1.add_Click{
- $n = "1"
- move-tile $n
-}
-$window.B_2.add_Click{
- $n = "2"
- move-tile $n
-}
-$window.B_3.add_Click{
- $n = "3"
- move-tile $n
-}
-$window.B_4.add_Click{
- $n = "4"
- move-tile $n
-}
-$window.B_5.add_Click{
- $n = "5"
- move-tile $n
-}
-$window.B_6.add_Click{
- $n = "6"
- move-tile $n
-}
-$window.B_7.add_Click{
- $n = "7"
- move-tile $n
-}
-$window.B_8.add_Click{
- $n = "8"
- move-tile $n
-}
-$window.B_9.add_Click{
- $n = "9"
- move-tile $n
-}
-$window.B_10.add_Click{
- $n = "10"
- move-tile $n
-}
-$window.B_11.add_Click{
- $n = "11"
- move-tile $n
-}
-$window.B_12.add_Click{
- $n = "12"
- move-tile $n
-}
-$window.B_13.add_Click{
- $n = "13"
- move-tile $n
-}
-$window.B_14.add_Click{
- $n = "14"
- move-tile $n
-}
-$window.B_15.add_Click{
- $n = "15"
- move-tile $n
-}
-$window.B_0.add_Click{
- $n = "0"
- move-tile $n
-}
-
-$window.B_Jumble.add_Click{
- Move-TileRandom
-}
-#endregion Event Handlers
-(([math]::floor(("9" - 1)/4)) % 2 -eq 0)
-#region Manipulate Window Content
-#initial processing of tiles
-$array = 0..15 | ForEach-Object {"{0:00}" -f $_}
-0..15 | ForEach-Object {if($array[$_] -ne '00'){$window."B_$_".content = $array[$_]} else {$window."B_$_".content = '';$script:blank = "$_";$window."B_$_".isenabled = $false};Set-TileColour $_}
-#Shove them around a bit
-Move-TileRandom
-#endregion
-# Show Window
-$result = Show-WPFWindow -Window $window
diff --git a/Task/15-puzzle-game/REBOL/15-puzzle-game.rebol b/Task/15-puzzle-game/REBOL/15-puzzle-game.rebol
deleted file mode 100644
index 93c61650ad..0000000000
--- a/Task/15-puzzle-game/REBOL/15-puzzle-game.rebol
+++ /dev/null
@@ -1,6 +0,0 @@
-rebol [] random/seed now g: [style t box red [
- if not find [0x108 108x0 0x-108 -108x0] face/offset - e/offset [exit]
- x: face/offset face/offset: e/offset e/offset: x] across
-] x: random repeat i 15 [append x:[] i] repeat i 15 [
- repend g ['t mold x/:i random white] if find [4 8 12] i [append g 'return]
-] append g [e: box] view layout g
diff --git a/Task/15-puzzle-game/VBScript/15-puzzle-game.vb b/Task/15-puzzle-game/VBScript/15-puzzle-game.vb
deleted file mode 100644
index 76ee77dfde..0000000000
--- a/Task/15-puzzle-game/VBScript/15-puzzle-game.vb
+++ /dev/null
@@ -1,108 +0,0 @@
-'----------------15 game-------------------------------------
-'WARNING: this script uses ANSI escape codes to position items on console so
-'it won't work in Windows from XP to 8.1 where Microsoft removed ANSI support...
-'Windows 10, 11 or 98 are ok!!!
-
-option explicit
-const maxshuffle=100 'level
-
-dim ans0:ans0=chr(27)&"["
-dim anscls:anscls=ans0 & "2J"
-
-dim dirs:dirs=array(6,-1,-6,1)
-dim a:a=array(-1,-1,-1,-1,-1,-1,_
- -1, 1, 2, 3, 4,-1,_
- -1, 5, 6, 7, 8,-1,_
- -1, 9,10,11,12,-1,_
- -1,13,14,15, 0,-1,_
- -1,-1,-1,-1,-1,-1)
-dim b(35)
-dim pos0
-dim s:s=Array("W+Enter: up Z+Enter: down A+Enter: left S+Enter right ",_
- "Bad move!! ",_
- "You did it! Another game? [y/n]+Enter ",_
- "Bye! ")
-
-
-do
- shuffle
- draw
- toxy 10,1,s(0)
- do
- if usr(wait()) then
- draw
- toxy 10,1,s(0)
- else
- toxy 10,1,s(1)
- end if
- loop until checkend
- toxy 10,1,s(2)
-loop until wait()="n"
-toxy 10,1,s(3)
-
-function wait():
- toxy 11,1,"":
- wait=left(lcase(wscript.stdin.readline),1):
-end function
-
-sub toxy(x,y,s)
- wscript.StdOut.Write ans0 & x & ";" & y & "H"& " "& s
-end sub
-
-sub draw
- dim i,j
- wscript.stdout.write anscls
- for i=0 to 3 'row
- for j=0 to 3 'col
- toxy (j*2)+2,(i*3)+3,iif(b(j*6+i+7)<>0,b(j*6+i+7)," ")
- next
- next
- toxy 10,1,""
-end sub
-
-
-function checkend
- dim i
- for i=0 to ubound(a)
- if (b(i)<>a(i)) then checkend=false : exit function
- next
- checkend=true
-end function
-
-function move(d)
- dim p1
- p1=pos0+d
- if b(p1) <>-1 then
- b(pos0)=b(p1):
- b(p1)=0:
- pos0=p1:
- move=true
- else
- move=false
- end if
-end function
-
-sub shuffle
- dim cnt,r,i
- randomize timer
- for i=0 to ubound(a):b(i)=a(i):next
- pos0=28
- cnt=0
- do
- r=int(rnd*4)
- if move(dirs(r))=true then cnt=cnt+1
- loop until cnt=maxshuffle
-end sub
-
-function iif(a,b,c): if a then iif=b else iif=c end if:end function
-
-function usr(a)
- dim d
- select case lcase(a)
- case "w" :d=-6
- case "z" :d=6
- case "a" :d=-1
- case "s" :d=1
- end select
- usr= move(d)
-end function
diff --git a/Task/15-puzzle-solver/Ada/15-puzzle-solver.ada b/Task/15-puzzle-solver/Ada/15-puzzle-solver.ada
deleted file mode 100644
index ad09518d34..0000000000
--- a/Task/15-puzzle-solver/Ada/15-puzzle-solver.ada
+++ /dev/null
@@ -1,192 +0,0 @@
-with Ada.Text_IO;
-
-procedure Puzzle_15 is
-
- type Direction is (Up, Down, Left, Right);
- type Row_Type is range 0 .. 3;
- type Col_Type is range 0 .. 3;
- type Tile_Type is range 0 .. 15;
-
- To_Col : constant array (Tile_Type) of Col_Type :=
- (3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2);
- To_Row : constant array (Tile_Type) of Row_Type :=
- (3, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3);
-
- type Board_Type is array (Row_Type, Col_Type) of Tile_Type;
-
- Solved_Board : constant Board_Type :=
- ((1, 2, 3, 4),
- (5, 6, 7, 8),
- (9, 10, 11, 12),
- (13, 14, 15, 0));
-
- type Try_Type is
- record
- Board : Board_Type;
- Move : Direction;
- Cost : Integer;
- Row : Row_Type;
- Col : Col_Type;
- end record;
-
- Stack : array (0 .. 100) of Try_Type;
- Top : Natural := 0;
- Iteration_Count : Natural := 0;
-
- procedure Move_Down is
- Board : Board_Type := Stack (Top).Board;
- Row : constant Row_Type := Stack (Top).Row;
- Col : constant Col_Type := Stack (Top).Col;
- Tile : constant Tile_Type := Board (Row + 1, Col);
- Penalty : constant Integer :=
- (if To_Row (Tile) <= Row then 0 else 1);
- begin
- Board (Row, Col) := Tile;
- Board (Row + 1, Col) := 0;
- Stack (Top + 1) := (Board => Board,
- Move => Down,
- Row => Row + 1,
- Col => Col,
- Cost => Stack (Top).Cost + Penalty);
- end Move_Down;
-
- procedure Move_Up is
- Board : Board_Type := Stack (Top).Board;
- Row : constant Row_Type := Stack (Top).Row;
- Col : constant Col_Type := Stack (Top).Col;
- Tile : constant Tile_Type := Board (Row - 1, Col);
- Penalty : constant Integer :=
- (if To_Row (Tile) >= Row then 0 else 1);
- begin
- Board (Row, Col) := Tile;
- Board (Row - 1, Col) := 0;
- Stack (Top + 1) := (Board => Board,
- Move => Up,
- Row => Row - 1,
- Col => Col,
- Cost => Stack (Top).Cost + Penalty);
- end Move_Up;
-
- procedure Move_Left is
- Board : Board_Type := Stack (Top).Board;
- Row : constant Row_Type := Stack (Top).Row;
- Col : constant Col_Type := Stack (Top).Col;
- Tile : constant Tile_Type := Board (Row, Col - 1);
- Penalty : constant Integer :=
- (if To_Col (Tile) >= Col then 0 else 1);
- begin
- Board (Row, Col) := Tile;
- Board (Row, Col - 1) := 0;
- Stack (Top + 1) := (Board => Board,
- Move => Left,
- Row => Row,
- Col => Col - 1,
- Cost => Stack (Top).Cost + Penalty);
- end Move_Left;
-
- procedure Move_Right is
- Board : Board_Type := Stack (Top).Board;
- Row : constant Row_Type := Stack (Top).Row;
- Col : constant Col_Type := Stack (Top).Col;
- Tile : constant Tile_Type := Board (Row, Col + 1);
- Penalty : constant Integer :=
- (if To_Col (Tile) <= Col then 0 else 1);
- begin
- Board (Row, Col) := Tile;
- Board (Row, Col + 1) := 0;
- Stack (Top + 1) := (Board => Board,
- Move => Right,
- Row => Row,
- Col => Col + 1,
- Cost => Stack (Top).Cost + Penalty);
- end Move_Right;
-
- function Is_Solution return Boolean;
-
- function Test_Moves return Boolean is
- begin
- if
- Stack (Top).Move /= Down and then
- Stack (Top).Row /= Row_Type'First
- then
- Move_Up;
- Top := Top + 1;
- if Is_Solution then return True; end if;
- Top := Top - 1;
- end if;
-
- if
- Stack (Top).Move /= Up and then
- Stack (Top).Row /= Row_Type'Last
- then
- Move_Down;
- Top := Top + 1;
- if Is_Solution then return True; end if;
- Top := Top - 1;
- end if;
-
- if
- Stack (Top).Move /= Right and then
- Stack (Top).Col /= Col_Type'First
- then
- Move_Left;
- Top := Top + 1;
- if Is_Solution then return True; end if;
- Top := Top - 1;
- end if;
-
- if
- Stack (Top).Move /= Left and then
- Stack (Top).Col /= Col_Type'Last
- then
- Move_Right;
- Top := Top + 1;
- if Is_Solution then return True; end if;
- Top := Top - 1;
- end if;
-
- return False;
- end Test_Moves;
-
- function Is_Solution return Boolean is
- use Ada.Text_IO;
- begin
- if Stack (Top).Board = Solved_Board then
- Put ("Solved in " & Top'Image & " moves: ");
- for R in 1 .. Top loop
- Put (String'(Stack (R).Move'Image) (1));
- end loop;
- New_Line;
- return True;
- end if;
- if Stack (Top).Cost <= Iteration_Count then
- return Test_Moves;
- end if;
- return False;
- end Is_Solution;
-
- procedure Solve (Row : in Row_Type;
- Col : in Col_Type;
- Board : in Board_Type) is
- begin
- pragma Assert (Board (Row, Col) = 0);
- Top := 0;
- Iteration_Count := 0;
- Stack (Top) := (Board => Board,
- Row => Row,
- Col => Col,
- Move => Down,
- Cost => 0);
- while not Is_Solution loop
- Iteration_Count := Iteration_Count + 1;
- end loop;
- end Solve;
-
-begin
- Solve (Row => 2,
- Col => 0,
- Board => ((15, 14, 1, 6),
- (9, 11, 4, 12),
- (0, 10, 7, 3),
- (13, 8, 5, 2)));
-end Puzzle_15;
diff --git a/Task/15-puzzle-solver/Uiua/15-puzzle-solver.uiua b/Task/15-puzzle-solver/Uiua/15-puzzle-solver.uiua
index b557fe56b6..2ee70f4190 100644
--- a/Task/15-puzzle-solver/Uiua/15-puzzle-solver.uiua
+++ b/Task/15-puzzle-solver/Uiua/15-puzzle-solver.uiua
@@ -1,41 +1,31 @@
# Solve a 15 puzzle https://rosettacode.org/wiki/15_puzzle_solver#Uiua
-# Experimental!
-T ← ↯4_4 ↻1⇡16
-# Return shuffled copy of the input.
-Shuffle ← ⊏⊸(⍏[⍥⚂]⧻)
-# Positions of the numbers (not 0)
-Pos ← ≡(⊢⊚⌕)↘1⇡16¤
+T ← ↯4_4 ↻1⇡16
+Pos ← ≡(⊢⊚⌕)↘1⇡16¤ # Positions of the numbers (not 0)
# Applying a very gentle weighting to certain cells massively
# speeds up the algorithm
-Weights ← [[2 1 1 2] [2 1 1 2] [2 1 1 2] [2 1 1 1]]
-Distance ← /+×⊡:Weights:≡/+⌵-⊙.∩Pos
+Weights ← [[2 1 1 2] [2 1 1 2] [2 1 1 2] [2 1 1 1]]
+Distance ← /+×⊡: Weights :≡/+⌵-⊙.∩Pos
Heuristic ← Distance T
-# Four possible neighbours
Nfour ← [[1 0] [¯1 0] [0 1] [0 ¯1]]
-# Actual neighbours at a point.
-ValidN ← ≡(⊂)⊙¤:⟜(▽⊸(≥0≡/↧)▽⊸(<4≡/↥)+Nfour)¤
-# Precalculate them.
-ValidNs ← ⊞(□ ValidN⊟)⇡4 ⇡4
-# Get the valid (from to) moves from this cell.
-Moves ← °□⊡:ValidNs⊢⊚⌕0
-# Swap the values at the indexes [0 1] [a b 2 3] -> [b a 2 3]
-Swap ← ⍜(⊡|∘◌) ⊃(⇌⊙∘|⊡)
-# List the possible next positions for a position
-Next ← ⊙◌≡(Swap ⊙.)⊙¤⊸Moves
+ValidN ← ≡⊟⊙¤▽≡/↧×⊃(≡₀<4|≡₀≥0).+Nfour¤. # Actual neighbours at a point.
+ValidNs ← ⊞(□ValidN⊟).⇡4 # Precalculate them.
+
+Moves ← °□⊡:ValidNs⊢⊚⌕0 # Get valid (from to) moves from grid.
+Swap ← ⍜⊡⇌ # Swap the values at the indexes
+Next ← ⊸≡⋅1 ≡Swap⊙¤⊸Moves # Next positions, set costs=1
+
Solve ← (
- &p"Running..."&p.
- ⍜nowastar(Next|Heuristic|≍T)
+ &p$"Solving: _".
+ ⍜now (⊢path(Next|≍|Heuristic):T)
&p$"_ seconds"
- # Track the movement of the 0 between adjacent steps.
- ≡(/-)◫2◇≡(⊢⊚⌕0)⇌⊢
- # Map each to a direction string and join.
- /⊂⇌≡⍣("d" °¯1_0|"u" °1_0|"r" °0_¯1|"l" °0_1|∘)
+ ≡/-⧈∘2◇≡(⊢⊚⌕0)⇌⊢ # Track the movement of the 0
+ ⇌˜≡get¤mapNfour"udlr" # Map to directions
)
-# Uncomment one of the following lines to try random grids
+# Uncomment one of the following lines to try these grids
# ⍥(Swap⊡⊸(⌊×⚂⧻)⊸Moves)90 T
# [[2 14 6 4] [5 1 3 8] [9 10 7 11] [13 0 15 12]] # Simple 40 shuffles
# [[5 1 2 3] [6 10 7 4] [13 9 11 8] [14 0 15 12]] # Simple 12 steps
diff --git a/Task/2048/Ada/2048.ada b/Task/2048/Ada/2048.ada
deleted file mode 100644
index 1bc75e8695..0000000000
--- a/Task/2048/Ada/2048.ada
+++ /dev/null
@@ -1,177 +0,0 @@
-with Ada.Text_IO; use Ada.Text_IO;
-with System.Random_Numbers;
-procedure Play_2048 is
- -- ----- Keyboard management
- type t_Keystroke is (Up, Down, Right, Left, Quit, Restart, Invalid);
- -- Redefining this standard procedure as function to allow Get_Keystroke as an expression function
- function Get_Immediate return Character is
- begin
- return Answer : Character do Ada.Text_IO.Get_Immediate(Answer);
- end return;
- end Get_Immediate;
- Arrow_Prefix : constant Character := Character'Val(224); -- works for windows
- function Get_Keystroke return t_Keystroke is
- (case Get_Immediate is
- when 'Q' | 'q' => Quit,
- when 'R' | 'r' => Restart,
- when 'W' | 'w' => Left,
- when 'A' | 'a' => Up,
- when 'S' | 's' => Down,
- when 'D' | 'd' => Right,
- -- Windows terminal
- when Arrow_Prefix => (case Character'Pos(Get_Immediate) is
- when 72 => Up,
- when 75 => Left,
- when 77 => Right,
- when 80 => Down,
- when others => Invalid),
- -- Unix escape sequences
- when ASCII.ESC => (case Get_Immediate is
- when '[' => (case Get_Immediate is
- when 'A' => Up,
- when 'B' => Down,
- when 'C' => Right,
- when 'D' => Left,
- when others => Invalid),
- when others => Invalid),
- when others => Invalid);
-
- -- ----- Game data
- function Random_Int is new System.Random_Numbers.Random_Discrete(Integer);
- type t_List is array (Positive range <>) of Natural;
- subtype t_Row is t_List (1..4);
- type t_Board is array (1..4) of t_Row;
- Board : t_Board;
- New_Board : t_Board;
- Blanks : Natural;
- Score : Natural;
- Generator : System.Random_Numbers.Generator;
-
- -- ----- Displaying the board
- procedure Display_Board is
- Horizontal_Rule : constant String := "+----+----+----+----+";
- function Center (Value : in String) return String is
- ((1..(2-(Value'Length-1)/2) => ' ') & -- Add leading spaces
- Value(Value'First+1..Value'Last) & -- Trim the leading space of the raw number image
- (1..(2-Value'Length/2) => ' ')); -- Add trailing spaces
- begin
- Put_Line (Horizontal_Rule);
- for Row of Board loop
- for Cell of Row loop
- Put('|' & (if Cell = 0 then " " else Center(Cell'Img)));
- end loop;
- Put_Line("|");
- Put_Line (Horizontal_Rule);
- end loop;
- Put_Line("Score =" & Score'Img);
- end Display_Board;
-
- -- ----- Game mechanics
- procedure Add_Block is
- Block_Offset : Positive := Random_Int(Generator, 1, Blanks);
- begin
- Blanks := Blanks-1;
- for Row of Board loop
- for Cell of Row loop
- if Cell = 0 then
- if Block_Offset = 1 then
- Cell := (if Random_Int(Generator,1,10) = 1 then 4 else 2);
- return;
- else
- Block_Offset := Block_Offset-1;
- end if;
- end if;
- end loop;
- end loop;
- end Add_Block;
-
- procedure Reset_Game is
- begin
- Board := (others => (others => 0));
- Blanks := 16;
- Score := 0;
- Add_Block;
- Add_Block;
- end Reset_Game;
-
- -- Moving and merging will always be performed leftward, hence the following transforms
- function HFlip (What : in t_Row) return t_Row is
- (What(4),What(3),What(2),What(1));
- function VFlip (What : in t_Board) return t_Board is
- (HFlip(What(1)),HFlip(What(2)),HFlip(What(3)),HFlip(What(4)));
- function Transpose (What : in t_Board) return t_Board is
- begin
- return Answer : t_Board do
- for Row in t_Board'Range loop
- for Column in t_Row'Range loop
- Answer(Column)(Row) := What(Row)(Column);
- end loop;
- end loop;
- end return;
- end Transpose;
-
- -- For moving/merging, recursive expression functions will be used, but they
- -- can't contain statements, hence the following sub-function used by Merge
- function Add_Blank (Delta_Score : in Natural) return t_List is
- begin
- Blanks := Blanks+1;
- Score := Score+Delta_Score;
- return (1 => 0);
- end Add_Blank;
-
- function Move_Row (What : in t_List) return t_List is
- (if What'Length = 1 then What
- elsif What(What'First) = 0
- then Move_Row(What(What'First+1..What'Last)) & (1 => 0)
- else (1 => What(What'First)) & Move_Row(What(What'First+1..What'Last)));
-
- function Merge (What : in t_List) return t_List is
- (if What'Length <= 1 or else What(What'First) = 0 then What
- elsif What(What'First) = What(What'First+1)
- then (1 => 2*What(What'First)) & Merge(What(What'First+2..What'Last)) & Add_Blank(What(What'First))
- else (1 => What(What'First)) & Merge(What(What'First+1..What'Last)));
-
- function Move (What : in t_Board) return t_Board is
- (Merge(Move_Row(What(1))),Merge(Move_Row(What(2))),Merge(Move_Row(What(3))),Merge(Move_Row(What(4))));
-
-begin
- System.Random_Numbers.Reset(Generator);
-
- Main_Loop: loop
- Reset_Game;
- Game_Loop: loop
- Display_Board;
- case Get_Keystroke is
- when Restart => exit Game_Loop;
- when Quit => exit Main_Loop;
- when Left => New_Board := Move(Board);
- when Right => New_Board := VFlip(Move(VFlip(Board)));
- when Up => New_Board := Transpose(Move(Transpose(Board)));
- when Down => New_Board := Transpose(VFlip(Move(VFlip(Transpose(Board)))));
- when others => null;
- end case;
-
- if New_Board = Board then
- Put_Line ("Invalid move...");
- elsif (for some Row of New_Board => (for some Cell of Row => Cell = 2048)) then
- Display_Board;
- Put_Line ("Win !");
- exit Main_Loop;
- else
- Board := New_Board;
- Add_Block; -- OK since the board has changed
- if Blanks = 0
- and then (for all Row in 1..4 =>
- (for all Column in 1..3 =>
- (Board(Row)(Column) /= Board(Row)(Column+1))))
- and then (for all Row in 1..3 =>
- (for all Column in 1..4 =>
- (Board(Row)(Column) /= Board(Row+1)(Column)))) then
- Display_Board;
- Put_Line ("Lost !");
- exit Main_Loop;
- end if;
- end if;
- end loop Game_Loop;
- end loop Main_Loop;
-end Play_2048;
diff --git a/Task/2048/EasyLang/2048.easy b/Task/2048/EasyLang/2048.easy
index 079064a289..668578b1de 100644
--- a/Task/2048/EasyLang/2048.easy
+++ b/Task/2048/EasyLang/2048.easy
@@ -29,7 +29,7 @@ proc show .
gcolor 765
grect x y 19 19
v = brd[i]
- h = 2 * floor log10 v
+ h = 2 * floor log v 10
gcolor 000
gtext x + 7 - h y + 7 brd[i]
.
diff --git a/Task/2048/Zig/2048.zig b/Task/2048/Zig/2048.zig
index 2f59b71609..ffe55ff922 100644
--- a/Task/2048/Zig/2048.zig
+++ b/Task/2048/Zig/2048.zig
@@ -1,228 +1,362 @@
+// git repository at https://codeberg.org/Vulwsztyn/2048_zig
const std = @import("std");
-const io = std.io;
-const Random = std.Random;
+const builtin = @import("builtin");
-// UserMove enum representing possible moves
-const UserMove = enum {
- Up,
- Down,
- Left,
- Right,
+const Io = std.Io;
+const Random = std.Random;
+const fmt = std.fmt;
+
+const mibu = @import("mibu");
+const color = mibu.color;
+const events = mibu.events;
+const term = mibu.term;
+const cursor = mibu.cursor;
+
+// You can change these constants to modify the game behavior
+const ROW_SIZE = 4; // program won't work if less than 2
+const COL_SIZE = 4; // program won't work if less than 2
+const TARGET_SCORE = 11; // 2^11 = 2048
+const PROBABILITY_OF_FOUR_NUMERATOR = 10;
+const PROBABILITY_OF_FOUR_DENOMINATOR = 100; // these 2 work in tandem to give chance of spawning a 4 instead of 2
+
+const Dir = enum { up, down, left, right };
+const Action = union(enum) {
+ Move: Dir,
+ Quit,
+ Noop,
};
-// Game field type
-const Field = [4][4]u32;
-
-// Function to print the current game state
-fn printGame(field: *const Field) void {
- for (field) |row| {
- std.debug.print("{any}\n", .{row});
- }
-}
-
-// Function to get a user move
-fn getUserMove() !UserMove {
- const stdin = std.io.getStdIn().reader();
- var buf: [2]u8 = undefined; // Buffer for input (character + newline)
-
- while (true) {
- const bytesRead = try stdin.read(&buf);
- if (bytesRead < 1) continue;
-
- switch (buf[0]) {
- 'a' => return UserMove.Left,
- 'w' => return UserMove.Up,
- 's' => return UserMove.Down,
- 'd' => return UserMove.Right,
- else => {
- std.debug.print("input was {c}: invalid character should be a,s,w or d\n", .{buf[0]});
- },
+fn spawn(comptime X: usize, comptime Y: usize, matrix_p: *[X][Y]u8, rand: Random) void {
+ var buffer: [X * Y]u8 = undefined;
+ var zero_indices = std.ArrayListUnmanaged(u8).initBuffer(&buffer);
+ for (matrix_p, 0..) |row, i| {
+ for (row, 0..) |val, j| {
+ if (val == 0) {
+ zero_indices.appendBounded(@intCast(i * Y + j)) catch unreachable;
+ }
}
}
+ const random_index = rand.intRangeAtMost(u8, 0, @intCast(zero_indices.items.len - 1));
+ const chosen = zero_indices.items[random_index];
+ const row = chosen / Y;
+ const col = chosen % Y;
+ const value: u8 = if (rand.intRangeAtMost(u8, 0, PROBABILITY_OF_FOUR_DENOMINATOR) < PROBABILITY_OF_FOUR_NUMERATOR) 2 else 1;
+ matrix_p[row][col] = value;
}
-// This function implements user moves.
-// For every element, it checks if the element is zero.
-// If the element is zero, it looks against the direction of movement if any
-// element is not zero, then moves it to its place and checks for a matching element.
-// If the element is not zero, it looks for a match. If no match is found,
-// it looks for the next element.
-fn doGameStep(step: UserMove, field: *Field) void {
- switch (step) {
- .Left => {
- for (field) |*row| {
- for (0..4) |col| {
- for ((col + 1)..4) |my_testCol| {
- if (row[my_testCol] != 0) {
- if (row[col] == 0) {
- row[col] += row[my_testCol];
- row[my_testCol] = 0;
- } else if (row[col] == row[my_testCol]) {
- row[col] += row[my_testCol];
- row[my_testCol] = 0;
- break;
- } else {
- break;
- }
- }
- }
- }
- }
+fn additives_for_previous(dir: Dir) [2]i8 {
+ // assuming that for a move in a direction, we look at the values at the end
+ // and check backwards
+ // e.g. for up, we look at the top row and check downwards
+ // so we return 1, 0 meaning one row down, same column
+ switch (dir) {
+ .up => {
+ return .{ 1, 0 };
},
- .Right => {
- for (field) |*row| {
- var col: i32 = 3;
- while (col >= 0) : (col -= 1) {
- var my_testCol: i32 = col - 1;
- while (my_testCol >= 0) : (my_testCol -= 1) {
- if (row[@intCast(my_testCol)] != 0) {
- if (row[@intCast(col)] == 0) {
- row[@intCast(col)] += row[@intCast(my_testCol)];
- row[@intCast(my_testCol)] = 0;
- } else if (row[@intCast(col)] == row[@intCast(my_testCol)]) {
- row[@intCast(col)] += row[@intCast(my_testCol)];
- row[@intCast(my_testCol)] = 0;
- break;
- } else {
- break;
- }
- }
- }
- }
- }
+ .down => {
+ return .{ -1, 0 };
},
- .Down => {
- for (0..4) |col_idx| {
- const col = col_idx; // Convert to immutable
- var row: i32 = 3;
- while (row >= 0) : (row -= 1) {
- var my_testRow: i32 = row - 1;
- while (my_testRow >= 0) : (my_testRow -= 1) {
- if (field[@intCast(my_testRow)][col] != 0) {
- if (field[@intCast(row)][col] == 0) {
- field[@intCast(row)][col] += field[@intCast(my_testRow)][col];
- field[@intCast(my_testRow)][col] = 0;
- } else if (field[@intCast(row)][col] == field[@intCast(my_testRow)][col]) {
- field[@intCast(row)][col] += field[@intCast(my_testRow)][col];
- field[@intCast(my_testRow)][col] = 0;
- break;
- } else {
- break;
- }
- }
- }
- }
- }
+ .left => {
+ return .{ 0, 1 };
},
- .Up => {
- for (0..4) |col| {
- for (0..4) |row| {
- for ((row + 1)..4) |my_testRow| {
- if (field[my_testRow][col] != 0) {
- if (field[row][col] == 0) {
- field[row][col] += field[my_testRow][col];
- field[my_testRow][col] = 0;
- } else if (field[row][col] == field[my_testRow][col]) {
- field[row][col] += field[my_testRow][col];
- field[my_testRow][col] = 0;
- break;
- } else {
- break;
- }
- }
- }
- }
- }
+ .right => {
+ return .{ 0, -1 };
},
}
}
-
-// Spawn a new number (2 or 4) in a random empty cell
-fn spawn(field: *Field, random: Random) void {
- while (true) {
- const x = random.uintLessThan(usize, 16); // Random position 0-15
- const row = x % 4;
- const col = (x / 4) % 4;
-
- if (field[row][col] == 0) {
- // 10% chance for a 4, 90% chance for a 2
- if (random.uintLessThan(usize, 10) == 0) {
- field[row][col] = 4;
- } else {
- field[row][col] = 2;
- }
- break;
- }
- }
-}
-
-// Check if fields are equal
-fn areFieldsEqual(a: *const Field, b: *const Field) bool {
- for (0..4) |i| {
- for (0..4) |j| {
- if (a[i][j] != b[i][j]) return false;
- }
- }
- return true;
-}
-
-// Check if player has won (any tile equals 2048)
-fn checkWin(field: *const Field) bool {
- for (field) |row| {
- for (row) |cell| {
- if (cell == 2048) return true;
+fn is_move_possible(comptime X: usize, comptime Y: usize, matrix_p: [X][Y]u8, dir: Dir) bool {
+ // checks if move is possible by checking if any tile can be moved or combined
+ const additives = additives_for_previous(dir);
+ for (0..X) |i| {
+ const i_signed: i8 = @intCast(i);
+ const new_i = i_signed + additives[0];
+ if (new_i < 0 or new_i >= X) continue;
+ for (0..Y) |j| {
+ const j_signed: i8 = @intCast(j);
+ const new_j = j_signed + additives[1];
+ if (new_j < 0 or new_j >= Y) continue;
+ const val = matrix_p[i][j];
+ const prev_val = matrix_p[@intCast(new_i)][@intCast(new_j)];
+ if (val != 0 and val == prev_val) return true;
+ if (val == 0 and prev_val != 0) return true;
}
}
return false;
}
-pub fn main() !void {
- var prng = std.Random.DefaultPrng.init(@intCast(std.time.milliTimestamp()));
- const random = prng.random();
+fn is_game_lost(comptime X: usize, comptime Y: usize, matrix_p: [X][Y]u8) bool {
+ // checks if move in any direction is possible
+ for (std.meta.tags(Dir)) |dir| {
+ if (is_move_possible(X, Y, matrix_p, dir)) {
+ return false;
+ }
+ }
+ return true;
+}
- var field: Field = [_][4]u32{[_]u32{0} ** 4} ** 4;
- var my_test: Field = undefined;
-
- gameLoop: while (true) {
- // Check if there's still an open space
- @memcpy(&my_test, &field);
- spawn(&field, random);
-
- // Check if any valid moves remain
- var validMoveExists = false;
- const moves = [_]UserMove{ .Up, .Down, .Left, .Right };
-
- for (moves) |move| {
- @memcpy(&my_test, &field);
- doGameStep(move, &my_test);
-
- if (!areFieldsEqual(&my_test, &field)) {
- validMoveExists = true;
- break;
+fn is_game_won(comptime X: usize, comptime Y: usize, matrix_p: [X][Y]u8) bool {
+ for (matrix_p) |row| {
+ for (row) |val| {
+ if (val >= TARGET_SCORE) {
+ return true;
}
}
+ }
+ return false;
+}
- if (!validMoveExists) {
- std.debug.print("No more valid moves, you lose\n", .{});
- break :gameLoop;
- }
+fn last_positions(comptime X: usize, comptime Y: usize, dir: Dir, gpa: std.mem.Allocator) std.ArrayList([2]u8) {
+ // see comment in additives_for_previous
+ // e.g. for move up we start at the top row and go downwards
+ // this function returns the list positions in the top row (for that scenario)
+ var list: std.ArrayList([2]u8) = .empty;
+ switch (dir) {
+ .up => {
+ for (0..Y) |i| {
+ list.append(gpa, .{ 0, @intCast(i) }) catch unreachable;
+ }
+ },
+ .down => {
+ for (0..Y) |i| {
+ list.append(gpa, .{ X - 1, @intCast(i) }) catch unreachable;
+ }
+ },
+ .left => {
+ for (0..X) |i| {
+ list.append(gpa, .{ @intCast(i), 0 }) catch unreachable;
+ }
+ },
+ .right => {
+ for (0..X) |i| {
+ list.append(gpa, .{ @intCast(i), X - 1 }) catch unreachable;
+ }
+ },
+ }
+ return list;
+}
- // Print the current game state
- printGame(&field);
- std.debug.print("move the blocks\n", .{});
-
- // Get and apply user move
- @memcpy(&my_test, &field);
- while (areFieldsEqual(&my_test, &field)) {
- const move = try getUserMove();
- doGameStep(move, &field);
- }
-
- // Check win condition
- if (checkWin(&field)) {
- printGame(&field);
- std.debug.print("You Won!!\n", .{});
- break :gameLoop;
+fn move_matrix(comptime X: usize, comptime Y: usize, matrix_p: *[X][Y]u8, dir: Dir) void {
+ const gpa = std.heap.page_allocator;
+ const additives = additives_for_previous(dir);
+ var postions = last_positions(X, Y, dir, gpa);
+ defer postions.deinit(gpa);
+ std.debug.print("\n", .{});
+ for (postions.items) |pos| {
+ var target_row: i8 = @intCast(pos[0]);
+ var target_col: i8 = @intCast(pos[1]);
+ var target_val: u8 = matrix_p[pos[0]][pos[1]];
+ var current_row: i8 = target_row;
+ var current_col: i8 = target_col;
+ while (true) {
+ current_row += additives[0];
+ current_col += additives[1];
+ const went_out_of_bounds = current_row < 0 or current_row >= (X) or
+ current_col < 0 or current_col >= (Y);
+ if (went_out_of_bounds) {
+ break;
+ }
+ const current_val: u8 = matrix_p[@intCast(current_row)][@intCast(current_col)];
+ if (current_val == 0) {
+ // nothing to do,
+ continue;
+ }
+ if (target_val != 0 and target_val != current_val) {
+ // cannot combine, move target forward
+ // e.g 0 0 2 4 (for was target, now 2 becomes target)
+ matrix_p[@intCast(current_row)][@intCast(current_col)] = 0;
+ target_row = (target_row) + (additives[0]);
+ target_col = (target_col) + (additives[1]);
+ matrix_p[@intCast(target_row)][@intCast(target_col)] = current_val;
+ target_val = matrix_p[@intCast(target_row)][@intCast(target_col)];
+ continue;
+ }
+ if (target_val == 0) {
+ // move current to target
+ // e.g 0 0 2 0 -> 0 0 0 2 (2 remains target, since we want 0 2 2 0 to become 0 0 0 4)
+ matrix_p[@intCast(target_row)][@intCast(target_col)] = current_val;
+ target_val = current_val;
+ } else {
+ // combine
+ // e.g 0 0 2 2 -> 0 0 0 4 (with rightmost zero becoming target, since the movements are not greedy)
+ matrix_p[@intCast(target_row)][@intCast(target_col)] = target_val + 1;
+ target_val = 0;
+ target_row = target_row + (additives[0]);
+ target_col = target_col + (additives[1]);
+ }
+ // both in case of move and combine we clear current
+ matrix_p[@intCast(current_row)][@intCast(current_col)] = 0;
+ }
+ }
+}
+
+fn print(comptime X: usize, comptime Y: usize, matrix_p: [X][Y]u8, stdout: *Io.Writer) !void {
+ for (matrix_p, 0..) |row, i| {
+ try cursor.goTo(stdout, 1, 2 + i);
+ var buf: [100]u8 = undefined;
+ const all_together_slice = buf[0..];
+ for (row) |val| {
+ const value = if (val != 0) std.math.pow(u16, 2, @intCast(val)) else 0;
+ const value_as_str = if (val > 0) try fmt.bufPrint(all_together_slice, "{d}", .{value}) else "_";
+
+ try color.fg256(stdout, if (val > 1) @enumFromInt(val) else color.Color.white); // sets colour based on value
+ try stdout.print("{s:>5} ", .{value_as_str}); // prints with padding
+ }
+ try stdout.print("\x1b[K\n", .{});
+ }
+}
+
+fn init_matrix(comptime X: usize, comptime Y: usize, matrix_p: *[X][Y]u8) void {
+ // initializes matrix to all zeros
+ for (matrix_p) |*row| {
+ for (row) |*val| {
+ val.* = @intCast(0);
+ }
+ }
+}
+
+fn action_from_event(next: events.Event) Action {
+ switch (next) {
+ .key => |k| switch (k.code) {
+ .char => |c| switch (c) {
+ 'c' => {
+ return .Quit;
+ },
+ 'q' => {
+ return .Quit;
+ },
+ 'w' => {
+ return .{ .Move = .up };
+ },
+ 's' => {
+ return .{ .Move = .down };
+ },
+ 'a' => {
+ return .{ .Move = .left };
+ },
+ 'd' => {
+ return .{ .Move = .right };
+ },
+ 'h' => {
+ return .{ .Move = .left };
+ },
+ 'j' => {
+ return .{ .Move = .down };
+ },
+ 'k' => {
+ return .{ .Move = .up };
+ },
+ 'l' => {
+ return .{ .Move = .right };
+ },
+ else => {
+ return .Noop;
+ },
+ },
+ .up => {
+ return .{ .Move = .up };
+ },
+ .down => {
+ return .{ .Move = .down };
+ },
+ .left => {
+ return .{ .Move = .left };
+ },
+ .right => {
+ return .{ .Move = .right };
+ },
+ else => {
+ return .Noop;
+ },
+ },
+ else => {
+ return .Noop;
+ },
+ }
+}
+
+pub fn main() !void {
+ const row_size = ROW_SIZE;
+ const col_size = COL_SIZE;
+ var seed: u64 = undefined;
+ try std.posix.getrandom(std.mem.asBytes(&seed));
+
+ var prng = Random.DefaultPrng.init(seed);
+ const rand = prng.random();
+
+ var stdout_buffer: [1024]u8 = undefined;
+
+ const stdin = std.fs.File.stdin();
+ var stdout_file = std.fs.File.stdout();
+ var stdout_writer = stdout_file.writer(&stdout_buffer);
+ const stdout = &stdout_writer.interface;
+
+ if (!std.posix.isatty(stdin.handle)) {
+ try stdout.print("The current file descriptor is not a referring to a terminal.\n", .{});
+ return;
+ }
+
+ if (builtin.os.tag == .windows) {
+ try mibu.enableWindowsVTS(stdout.handle);
+ }
+
+ // Enable terminal raw mode, its very recommended when listening for events
+ var raw_term = try term.enableRawMode(stdin.handle);
+ defer raw_term.disableRawMode() catch {
+ std.debug.print("Failed to disable raw mode\n", .{});
+ };
+
+ try term.enterAlternateScreen(stdout);
+ defer term.exitAlternateScreen(stdout) catch {
+ std.debug.print("Failed to exit alternate screen\n", .{});
+ };
+
+ try cursor.hide(stdout);
+ defer cursor.show(stdout) catch {
+ std.debug.print("Failed to show cursor\n", .{});
+ };
+
+ try cursor.goTo(stdout, 1, 1);
+ try mibu.style.italic(stdout, true);
+
+ var matrix: [row_size][col_size]u8 = undefined;
+
+ init_matrix(row_size, col_size, &matrix);
+
+ spawn(row_size, col_size, &matrix, rand);
+ try stdout.print("move with wsad, hjkl, or arrows; quit with c or q\x1b[K\n", .{}); // prints with padding
+
+ try print(row_size, col_size, matrix, stdout);
+
+ try stdout.flush();
+
+ while (true) {
+ try cursor.goTo(stdout, 1, 2);
+ const next = try events.next(stdin);
+ const action = action_from_event(next);
+ switch (action) {
+ .Quit => break,
+ .Noop => continue,
+ .Move => |dir| {
+ if (is_move_possible(row_size, col_size, matrix, dir)) {
+ move_matrix(row_size, col_size, &matrix, dir);
+ try print(row_size, col_size, matrix, stdout);
+ if (is_game_won(row_size, col_size, matrix)) {
+ try cursor.goTo(stdout, 1, row_size + 3);
+ try stdout.print("You won! Congratulations!\n", .{});
+ try stdout.flush();
+ break;
+ }
+ spawn(row_size, col_size, &matrix, rand);
+ try print(row_size, col_size, matrix, stdout);
+ if (is_game_lost(row_size, col_size, matrix)) {
+ try cursor.goTo(stdout, 1, (row_size + 3));
+ try stdout.print("Game over! No more moves possible!\n", .{});
+ try stdout.flush();
+ break;
+ }
+ }
+ try stdout.flush();
+ },
}
}
}
diff --git a/Task/21-game/Ada/21-game.ada b/Task/21-game/Ada/21-game.ada
deleted file mode 100644
index 55f3a6efb8..0000000000
--- a/Task/21-game/Ada/21-game.ada
+++ /dev/null
@@ -1,108 +0,0 @@
-with Ada.Text_IO;
-with Ada.Numerics.Discrete_Random;
-
-procedure Game_21 is
-
- procedure Put (Item : String) is
- begin
- for Char of Item loop
- Ada.Text_IO.Put (Char);
- delay 0.010;
- end loop;
- end Put;
-
- procedure New_Line is
- begin
- Ada.Text_IO.New_Line;
- end New_Line;
-
- procedure Put_Line (Item : String) is
- begin
- Put (Item);
- New_Line;
- end Put_LIne;
-
- type Player_Kind is (Human, Computer);
- type Score_Type is range 0 .. 21;
- subtype Amount_Range is Score_Type range 1 .. 3;
-
- package Amount_Generators is
- new Ada.Numerics.Discrete_Random (Amount_Range);
-
- Gen : Amount_Generators.Generator;
- Total : Score_Type := 0;
- Choice : Character;
- Player : Player_Kind;
- Amount : Amount_Range;
-begin
- Amount_Generators.Reset (Gen);
-
- Put_Line ("--- The 21 Game ---"); New_Line;
-
- Put ("Who is starting human or computer (h/c) ? ");
- Ada.Text_IO.Get_Immediate (Choice);
- New_Line;
-
- case Choice is
- when 'c' | 'C' => Player := Computer;
- when 'h' | 'H' => Player := Human;
- when others => return;
- end case;
-
- Play_Loop : loop
- New_Line;
- Put ("Runing total is "); Put (Total'Image); New_Line;
- New_Line;
-
- case Player is
-
- when Human =>
- Put_Line ("It is your turn !");
- Input_Loop : loop
- Put ("Enter choice 1 .. 3 (0 to end) : ");
- Ada.Text_IO.Get_Immediate (Choice);
-
- case Choice is
- when '1' .. '3' =>
- Amount := Amount_Range'Value ("" & Choice);
- exit Input_Loop;
-
- when '0' =>
- exit Play_Loop;
-
- when others =>
- Put_Line ("Choice must be in 1 .. 3");
- end case;
- end loop Input_Loop;
- New_Line;
-
- when Computer =>
- delay 1.500;
- Amount := Amount_Generators.Random (Gen);
- Put ("Computer chooses: "); Put (Amount'Image); New_Line;
- delay 0.800;
-
- end case;
-
- New_Line;
- Amount := Score_Type'Min (Amount, Score_Type'Last - Total);
- Put (" "); Put (Total'Image); Put (" + "); Put (Amount'Image); Put (" = ");
- Total := Total + Amount;
- Put (Total'Image);
- New_Line;
-
- if Total = 21 then
- New_Line;
- Put ("... and we have a WINNER !!"); New_Line;
- delay 0.500;
- Put_Line (" ... and the winner is ...");
- delay 1.000;
- Put_Line (" " & Player'Image);
- exit;
- end if;
-
- Player := (case Player is
- when Computer => Human,
- when Human => Computer);
- end loop Play_Loop;
-end Game_21;
diff --git a/Task/21-game/Arturo/21-game.arturo b/Task/21-game/Arturo/21-game.arturo
index 3b62d3b212..a4c0d5eb0f 100644
--- a/Task/21-game/Arturo/21-game.arturo
+++ b/Task/21-game/Arturo/21-game.arturo
@@ -5,7 +5,7 @@ print "-----------------------------"
players: ["A" "B"]
currentPlayer: sample players
nextPlayer: first players -- currentPlayer
-runningTotal: new 0
+runningTotal: 0
num: 0
getNum: function [][
diff --git a/Task/21-game/AutoHotkey/21-game.ahk b/Task/21-game/AutoHotkey/21-game.ahk
index 89fc54b3c2..ba112f623d 100644
--- a/Task/21-game/AutoHotkey/21-game.ahk
+++ b/Task/21-game/AutoHotkey/21-game.ahk
@@ -6,7 +6,7 @@ Gui, add, text, xs vT, Total : 00
Gui, add, text, xs vComputer, Computer Dealt 00
Gui, add, text, xs Section, Player 1
loop, 3
- Gui, add, button, x+5 vPlayer1_%A_Index% gTotal, % A_Index
+ Gui, add, button, x+5 vPlayer1_%A_Index% gTotal, % A_Index
Gui, add, button, xs vReset gReset, reset
Gui show,, 21 Game
Winners := [1,5,9,13,17,21]
@@ -18,13 +18,13 @@ total := 0
GuiControl,, T, % "Total : " SubStr("00" Total, -1)
GuiControl,, Computer, % "Computer Waiting"
Loop 3
- GuiControl, Enable, % "Player1_" A_Index
+ GuiControl, Enable, % "Player1_" A_Index
Random, rnd, 0, 1
if rnd
{
- Loop 3
- GuiControl, Disable, % "Player1_" A_Index
- gosub ComputerTurn
+ Loop 3
+ GuiControl, Disable, % "Player1_" A_Index
+ gosub ComputerTurn
}
return
;-----------------------------------
@@ -34,12 +34,12 @@ Total += Added
GuiControl,, T, % "Total : " SubStr("00" Total, -1)
if (total >= 21)
{
- MsgBox % "Player 1 Wins"
- gosub reset
- return
+ MsgBox % "Player 1 Wins"
+ gosub reset
+ return
}
Loop 3
- GuiControl, Disable, % "Player1_" A_Index
+ GuiControl, Disable, % "Player1_" A_Index
gosub, ComputerTurn
return
;-----------------------------------
@@ -48,38 +48,38 @@ Gui, Submit, NoHide
Sleep 500
if RadioE
{
- if (total < 13)
- RadioC := true
- else
- RadioH := true
+ if (total < 13)
+ RadioC := true
+ else
+ RadioH := true
}
if RadioC
{
- Random, Deal, 1, 3
- total += Deal
+ Random, Deal, 1, 3
+ total += Deal
}
if RadioH
{
- for i, v in Winners
- if (total >= v)
- continue
- else
- {
- Deal := v - total
- if Deal > 3
- Random, Deal, 1, 3
- total += Deal
- break
- }
+ for i, v in Winners
+ if (total >= v)
+ continue
+ else
+ {
+ Deal := v - total
+ if Deal > 3
+ Random, Deal, 1, 3
+ total += Deal
+ break
+ }
}
GuiControl,, T, % "Total : " SubStr("00" Total, -1)
GuiControl,, Computer, % "Computer Dealt " Deal
if (total=21)
{
- MsgBox Computer Wins
- gosub, reset
+ MsgBox Computer Wins
+ gosub, reset
}
else
- Loop 3
- GuiControl, Enable, % "Player1_" A_Index
+ Loop 3
+ GuiControl, Enable, % "Player1_" A_Index
return
diff --git a/Task/21-game/GDScript/21-game.gd b/Task/21-game/GDScript/21-game.gd
index 78f190267d..009e2e3a9a 100644
--- a/Task/21-game/GDScript/21-game.gd
+++ b/Task/21-game/GDScript/21-game.gd
@@ -8,81 +8,81 @@ const target: int = 21
# -1 is returned to request quit
func get_player_choice(total: int) -> int:
- while true:
- printraw("Player's choice: ")
- var input: String = OS.read_string_from_stdin().strip_edges()
+ while true:
+ printraw("Player's choice: ")
+ var input: String = OS.read_string_from_stdin().strip_edges()
- if input == "quit":
- return -1
+ if input == "quit":
+ return -1
- if not input.is_valid_int():
- print("Please input an integer.")
- continue
+ if not input.is_valid_int():
+ print("Please input an integer.")
+ continue
- var input_int := int(input)
- if input_int < 1 or input_int > 3:
- print("Please pick a number from 1 to 3")
- continue
+ var input_int := int(input)
+ if input_int < 1 or input_int > 3:
+ print("Please pick a number from 1 to 3")
+ continue
- if input_int + total > target:
- print("Please do not exceed a total of %d" % target)
- continue
+ if input_int + total > target:
+ print("Please do not exceed a total of %d" % target)
+ continue
- return input_int
+ return input_int
- # This is required since Godot does not detect the unreachable code path
- OS.crash("unreachable")
- return 0
+ # This is required since Godot does not detect the unreachable code path
+ OS.crash("unreachable")
+ return 0
func get_computer_choice(total: int) -> int:
- # This can be shortened using max() if you do not have type checking OCD
- var remaining: int = target - total
- return randi_range(1, 3 if remaining > 3 else remaining)
+ # This can be shortened using max() if you do not have type checking OCD
+ var remaining: int = target - total
+ return randi_range(1, 3 if remaining > 3 else remaining)
func play() -> void:
- print("""\
+ print("""\
Welcome to the 21 game.
Type quit to exit.""")
- var total: int = 0
- var player: Player
- match randi_range(1, 2):
- 1:
- player = Player.Human
- print("You will go first.")
- 2:
- player = Player.Computer
- print("The computer will go first.")
+ var total: int = 0
+ var player: Player
+ match randi_range(1, 2):
+ 1:
+ player = Player.Human
+ print("You will go first.")
+ 2:
+ player = Player.Computer
+ print("The computer will go first.")
- while true:
- print("\nThe total is %d" % total)
+ while true:
+ print("\nThe total is %d" % total)
- var choice: int
- match player:
- Player.Human:
- choice = get_player_choice(total)
- if choice == -1:
- return
- Player.Computer:
- choice = get_computer_choice(total)
- print("The computer plays %d" % choice)
- assert(1 <= choice and choice <= 3)
+ var choice: int
+ match player:
+ Player.Human:
+ choice = get_player_choice(total)
+ if choice == -1:
+ return
+ Player.Computer:
+ choice = get_computer_choice(total)
+ print("The computer plays %d" % choice)
+ assert(1 <= choice and choice <= 3)
- total += choice
- if total == target:
- match player:
- Player.Human: print("You win!")
- Player.Computer: print("The computer won, you lose.")
- return
- assert(total < target)
+ total += choice
+ if total == target:
+ match player:
+ Player.Human: print("You win!")
+ Player.Computer: print("The computer won, you lose.")
+ return
+ assert(total < target)
- match player:
- Player.Human: player = Player.Computer
- Player.Computer: player = Player.Human
+ match player:
+ Player.Human: player = Player.Computer
+ Player.Computer: player = Player.Human
func _process(_delta: float) -> bool:
- randomize()
- play()
- return true
+ randomize()
+ play()
+ return true
diff --git a/Task/21-game/Python/21-game-1.py b/Task/21-game/Python/21-game-1.py
index 61db2b29a5..fa4bcbcfdc 100644
--- a/Task/21-game/Python/21-game-1.py
+++ b/Task/21-game/Python/21-game-1.py
@@ -1,62 +1,62 @@
from random import randint
def start():
- game_count=0
- print("Enter q to quit at any time.\nThe computer will choose first.\nRunning total is now {}".format(game_count))
- roundno=1
- while game_count<21:
- print("\nROUND {}: \n".format(roundno))
- t = select_count(game_count)
- game_count = game_count+t
- print("Running total is now {}\n".format(game_count))
- if game_count>=21:
- print("So, commiserations, the computer has won!")
- return 0
- t = request_count()
- if not t:
- print('OK,quitting the game')
- return -1
- game_count = game_count+t
- print("Running total is now {}\n".format(game_count))
- if game_count>=21:
- print("So, congratulations, you've won!")
- return 1
- roundno+=1
+ game_count=0
+ print("Enter q to quit at any time.\nThe computer will choose first.\nRunning total is now {}".format(game_count))
+ roundno=1
+ while game_count<21:
+ print("\nROUND {}: \n".format(roundno))
+ t = select_count(game_count)
+ game_count = game_count+t
+ print("Running total is now {}\n".format(game_count))
+ if game_count>=21:
+ print("So, commiserations, the computer has won!")
+ return 0
+ t = request_count()
+ if not t:
+ print('OK,quitting the game')
+ return -1
+ game_count = game_count+t
+ print("Running total is now {}\n".format(game_count))
+ if game_count>=21:
+ print("So, congratulations, you've won!")
+ return 1
+ roundno+=1
def select_count(game_count):
- '''selects a random number if the game_count is less than 18. otherwise chooses the winning number'''
- if game_count<18:
- t= randint(1,3)
- else:
- t = 21-game_count
- print("The computer chooses {}".format(t))
- return t
+ '''selects a random number if the game_count is less than 18. otherwise chooses the winning number'''
+ if game_count<18:
+ t= randint(1,3)
+ else:
+ t = 21-game_count
+ print("The computer chooses {}".format(t))
+ return t
def request_count():
- '''request user input between 1,2 and 3. It will continue till either quit(q) or one of those numbers is requested.'''
- t=""
- while True:
- try:
- t = raw_input('Your choice 1 to 3 :')
- if int(t) in [1,2,3]:
- return int(t)
- else:
- print("Out of range, try again")
- except:
- if t=="q":
- return None
- else:
- print("Invalid Entry, try again")
+ '''request user input between 1,2 and 3. It will continue till either quit(q) or one of those numbers is requested.'''
+ t=""
+ while True:
+ try:
+ t = raw_input('Your choice 1 to 3 :')
+ if int(t) in [1,2,3]:
+ return int(t)
+ else:
+ print("Out of range, try again")
+ except:
+ if t=="q":
+ return None
+ else:
+ print("Invalid Entry, try again")
c=0
m=0
r=True
while r:
- o = start()
- if o==-1:
- break
- else:
- c+=1 if o==0 else 0
- m+=1 if o==1 else 0
- print("Computer wins {0} game, human wins {1} games".format(c,m))
- t = raw_input("Another game?(press y to continue):")
- r = (t=="y")
+ o = start()
+ if o==-1:
+ break
+ else:
+ c+=1 if o==0 else 0
+ m+=1 if o==1 else 0
+ print("Computer wins {0} game, human wins {1} games".format(c,m))
+ t = raw_input("Another game?(press y to continue):")
+ r = (t=="y")
diff --git a/Task/21-game/Ring/21-game.ring b/Task/21-game/Ring/21-game.ring
index 51094dea5e..06bcf1934e 100644
--- a/Task/21-game/Ring/21-game.ring
+++ b/Task/21-game/Ring/21-game.ring
@@ -100,9 +100,9 @@ func choose(ch,ym)
ok
func msgBox(text) {
- m = new qMessageBox(win1) {
- setWindowTitle("21 Game")
- setText(text)
- show()
- }
+ m = new qMessageBox(win1) {
+ setWindowTitle("21 Game")
+ setText(text)
+ show()
+ }
}
diff --git a/Task/24-game-Solve/COBOL/24-game-solve.cobol b/Task/24-game-Solve/COBOL/24-game-solve.cobol
deleted file mode 100644
index 086cf6c30b..0000000000
--- a/Task/24-game-Solve/COBOL/24-game-solve.cobol
+++ /dev/null
@@ -1,446 +0,0 @@
- >>SOURCE FORMAT FREE
-*> This code is dedicated to the public domain
-*> This is GNUCobol 2.0
-identification division.
-program-id. twentyfoursolve.
-environment division.
-configuration section.
-repository. function all intrinsic.
-input-output section.
-file-control.
- select count-file
- assign to count-file-name
- file status count-file-status
- organization line sequential.
-data division.
-file section.
-fd count-file.
-01 count-record pic x(7).
-
-working-storage section.
-01 count-file-name pic x(64) value 'solutioncounts'.
-01 count-file-status pic xx.
-
-01 command-area.
- 03 nd pic 9.
- 03 number-definition.
- 05 n occurs 4 pic 9.
- 03 number-definition-9 redefines number-definition
- pic 9(4).
- 03 command-input pic x(16).
- 03 command pic x(5).
- 03 number-count pic 9999.
- 03 l1 pic 99.
- 03 l2 pic 99.
- 03 expressions pic zzz,zzz,zz9.
-
-01 number-validation.
- 03 px pic 99.
- 03 permutations value
- '1234'
- & '1243'
- & '1324'
- & '1342'
- & '1423'
- & '1432'
-
- & '2134'
- & '2143'
- & '2314'
- & '2341'
- & '2413'
- & '2431'
-
- & '3124'
- & '3142'
- & '3214'
- & '3241'
- & '3423'
- & '3432'
-
- & '4123'
- & '4132'
- & '4213'
- & '4231'
- & '4312'
- & '4321'.
- 05 permutation occurs 24 pic x(4).
- 03 cpx pic 9.
- 03 current-permutation pic x(4).
- 03 od1 pic 9.
- 03 od2 pic 9.
- 03 od3 pic 9.
- 03 operator-definitions pic x(4) value '+-*/'.
- 03 cox pic 9.
- 03 current-operators pic x(3).
- 03 rpn-forms value
- 'nnonono'
- & 'nnonnoo'
- & 'nnnonoo'
- & 'nnnoono'
- & 'nnnnooo'.
- 05 rpn-form occurs 5 pic x(7).
- 03 rpx pic 9.
- 03 current-rpn-form pic x(7).
-
-01 calculation-area.
- 03 oqx pic 99.
- 03 output-queue pic x(7).
- 03 work-number pic s9999.
- 03 top-numerator pic s9999 sign leading separate.
- 03 top-denominator pic s9999 sign leading separate.
- 03 rsx pic 9.
- 03 result-stack occurs 8.
- 05 numerator pic s9999.
- 05 denominator pic s9999.
- 03 divide-by-zero-error pic x.
-
-01 totals.
- 03 s pic 999.
- 03 s-lim pic 999 value 600.
- 03 s-max pic 999 value 0.
- 03 solution occurs 600 pic x(7).
- 03 sc pic 999.
- 03 sc1 pic 999.
- 03 sc2 pic 9.
- 03 sc-max pic 999 value 0.
- 03 sc-lim pic 999 value 600.
- 03 solution-counts value zeros.
- 05 solution-count occurs 600 pic 999.
- 03 ns pic 9999.
- 03 ns-max pic 9999 value 0.
- 03 ns-lim pic 9999 value 6561.
- 03 number-solutions occurs 6561.
- 05 ns-number pic x(4).
- 05 ns-count pic 999.
- 03 record-counts pic 9999.
- 03 total-solutions pic 9999.
-
-01 infix-area.
- 03 i pic 9.
- 03 i-s pic 9.
- 03 i-s1 pic 9.
- 03 i-work pic x(16).
- 03 i-stack occurs 7 pic x(13).
-
-procedure division.
-start-twentyfoursolve.
- display 'start twentyfoursolve'
- perform display-instructions
- perform get-command
- perform until command-input = spaces
- display space
- initialize command number-count
- unstring command-input delimited by all space
- into command number-count
- move command-input to number-definition
- move spaces to command-input
- evaluate command
- when 'h'
- when 'help'
- perform display-instructions
- when 'list'
- if ns-max = 0
- perform load-solution-counts
- end-if
- perform list-counts
- when 'show'
- if ns-max = 0
- perform load-solution-counts
- end-if
- perform show-numbers
- when other
- if number-definition-9 not numeric
- display 'invalid number'
- else
- perform get-solutions
- perform display-solutions
- end-if
- end-evaluate
- if command-input = spaces
- perform get-command
- end-if
- end-perform
- display 'exit twentyfoursolve'
- stop run
- .
-display-instructions.
- display space
- display 'enter a number as four integers from 1-9 to see its solutions'
- display 'enter list to see counts of solutions for all numbers'
- display 'enter show to see numbers having solutions'
- display ' ends the program'
- .
-get-command.
- display space
- move spaces to command-input
- display '(h for help)?' with no advancing
- accept command-input
- .
-ask-for-more.
- display space
- move 0 to l1
- add 1 to l2
- if l2 = 10
- display 'more ()?' with no advancing
- accept command-input
- move 0 to l2
- end-if
- .
-list-counts.
- add 1 to sc-max giving sc
- display 'there are ' sc ' solution counts'
- display space
- display 'solutions/numbers'
- move 0 to l1
- move 0 to l2
- perform varying sc from 1 by 1 until sc > sc-max
- or command-input <> spaces
- if solution-count(sc) > 0
- subtract 1 from sc giving sc1 *> offset to capture zero counts
- display sc1 '/' solution-count(sc) space with no advancing
- add 1 to l1
- if l1 = 8
- perform ask-for-more
- end-if
- end-if
- end-perform
- if l1 > 0
- display space
- end-if
- .
-show-numbers. *> with number-count solutions
- add 1 to number-count giving sc1 *> offset for zero count
- evaluate true
- when number-count >= sc-max
- display 'no number has ' number-count ' solutions'
- exit paragraph
- when solution-count(sc1) = 1 and number-count = 1
- display '1 number has 1 solution'
- when solution-count(sc1) = 1
- display '1 number has ' number-count ' solutions'
- when number-count = 1
- display solution-count(sc1) ' numbers have 1 solution'
- when other
- display solution-count(sc1) ' numbers have ' number-count ' solutions'
- end-evaluate
- display space
- move 0 to l1
- move 0 to l2
- perform varying ns from 1 by 1 until ns > ns-max
- or command-input <> spaces
- if ns-count(ns) = number-count
- display ns-number(ns) space with no advancing
- add 1 to l1
- if l1 = 14
- perform ask-for-more
- end-if
- end-if
- end-perform
- if l1 > 0
- display space
- end-if
- .
-display-solutions.
- evaluate s-max
- when 0 display number-definition ' has no solutions'
- when 1 display number-definition ' has 1 solution'
- when other display number-definition ' has ' s-max ' solutions'
- end-evaluate
- display space
- move 0 to l1
- move 0 to l2
- perform varying s from 1 by 1 until s > s-max
- or command-input <> spaces
- *> convert rpn solution(s) to infix
- move 0 to i-s
- perform varying i from 1 by 1 until i > 7
- if solution(s)(i:1) >= '1' and <= '9'
- add 1 to i-s
- move solution(s)(i:1) to i-stack(i-s)
- else
- subtract 1 from i-s giving i-s1
- move spaces to i-work
- string '(' i-stack(i-s1) solution(s)(i:1) i-stack(i-s) ')'
- delimited by space into i-work
- move i-work to i-stack(i-s1)
- subtract 1 from i-s
- end-if
- end-perform
- display solution(s) space i-stack(1) space space with no advancing
- add 1 to l1
- if l1 = 3
- perform ask-for-more
- end-if
- end-perform
- if l1 > 0
- display space
- end-if
- .
-load-solution-counts.
- move 0 to ns-max *> numbers and their solution count
- move 0 to sc-max *> solution counts
- move spaces to count-file-status
- open input count-file
- if count-file-status <> '00'
- perform create-count-file
- move 0 to ns-max *> numbers and their solution count
- move 0 to sc-max *> solution counts
- open input count-file
- end-if
- read count-file
- move 0 to record-counts
- move zeros to solution-counts
- perform until count-file-status <> '00'
- add 1 to record-counts
- perform increment-ns-max
- move count-record to number-solutions(ns-max)
- add 1 to ns-count(ns-max) giving sc *> offset 1 for zero counts
- if sc > sc-lim
- display 'sc ' sc ' exceeds sc-lim ' sc-lim
- stop run
- end-if
- if sc > sc-max
- move sc to sc-max
- end-if
- add 1 to solution-count(sc)
- read count-file
- end-perform
- close count-file
- .
-create-count-file.
- open output count-file
- display 'Counting solutions for all numbers'
- display 'We will examine 9*9*9*9 numbers'
- display 'For each number we will examine 4! permutations of the digits'
- display 'For each permutation we will examine 4*4*4 combinations of operators'
- display 'For each permutation and combination we will examine 5 rpn forms'
- display 'We will count the number of unique solutions for the given number'
- display 'Each number and its counts will be written to file ' trim(count-file-name)
- compute expressions = 9*9*9*9*factorial(4)*4*4*4*5
- display 'So we will evaluate ' trim(expressions) ' statements'
- display 'This will take a few minutes'
- display 'In the future if ' trim(count-file-name) ' exists, this step will be bypassed'
- move 0 to record-counts
- move 0 to total-solutions
- perform varying n(1) from 1 by 1 until n(1) = 0
- perform varying n(2) from 1 by 1 until n(2) = 0
- display n(1) n(2) '..' *> show progress
- perform varying n(3) from 1 by 1 until n(3) = 0
- perform varying n(4) from 1 by 1 until n(4) = 0
- perform get-solutions
- perform increment-ns-max
- move number-definition to ns-number(ns-max)
- move s-max to ns-count(ns-max)
- move number-solutions(ns-max) to count-record
- write count-record
- add s-max to total-solutions
- add 1 to record-counts
- add 1 to ns-count(ns-max) giving sc *> offset by 1 for zero counts
- if sc > sc-lim
- display 'error: ' sc ' solution count exceeds ' sc-lim
- stop run
- end-if
- add 1 to solution-count(sc)
- end-perform
- end-perform
- end-perform
- end-perform
- close count-file
- display record-counts ' numbers and counts written to ' trim(count-file-name)
- display total-solutions ' total solutions'
- display space
- .
-increment-ns-max.
- if ns-max >= ns-lim
- display 'error: numbers exceeds ' ns-lim
- stop run
- end-if
- add 1 to ns-max
- .
-get-solutions.
- move 0 to s-max
- perform varying px from 1 by 1 until px > 24
- move permutation(px) to current-permutation
- perform varying od1 from 1 by 1 until od1 > 4
- move operator-definitions(od1:1) to current-operators(1:1)
- perform varying od2 from 1 by 1 until od2 > 4
- move operator-definitions(od2:1) to current-operators(2:1)
- perform varying od3 from 1 by 1 until od3 > 4
- move operator-definitions(od3:1) to current-operators(3:1)
- perform varying rpx from 1 by 1 until rpx > 5
- move rpn-form(rpx) to current-rpn-form
- move 0 to cpx cox
- move spaces to output-queue
- perform varying oqx from 1 by 1 until oqx > 7
- if current-rpn-form(oqx:1) = 'n'
- add 1 to cpx
- move current-permutation(cpx:1) to nd
- move n(nd) to output-queue(oqx:1)
- else
- add 1 to cox
- move current-operators(cox:1) to output-queue(oqx:1)
- end-if
- end-perform
- perform evaluate-rpn
- if divide-by-zero-error = space
- and 24 * top-denominator = top-numerator
- perform varying s from 1 by 1 until s > s-max
- or solution(s) = output-queue
- continue
- end-perform
- if s > s-max
- if s >= s-lim
- display 'error: solutions ' s ' for ' number-definition ' exceeds ' s-lim
- stop run
- end-if
- move s to s-max
- move output-queue to solution(s-max)
- end-if
- end-if
- end-perform
- end-perform
- end-perform
- end-perform
- end-perform
- .
-evaluate-rpn.
- move space to divide-by-zero-error
- move 0 to rsx *> stack depth
- perform varying oqx from 1 by 1 until oqx > 7
- if output-queue(oqx:1) >= '1' and <= '9'
- *> push the digit onto the stack
- add 1 to rsx
- move top-numerator to numerator(rsx)
- move top-denominator to denominator(rsx)
- move output-queue(oqx:1) to top-numerator
- move 1 to top-denominator
- else
- *> apply the operation
- evaluate output-queue(oqx:1)
- when '+'
- compute top-numerator = top-numerator * denominator(rsx)
- + top-denominator * numerator(rsx)
- compute top-denominator = top-denominator * denominator(rsx)
- when '-'
- compute top-numerator = top-denominator * numerator(rsx)
- - top-numerator * denominator(rsx)
- compute top-denominator = top-denominator * denominator(rsx)
- when '*'
- compute top-numerator = top-numerator * numerator(rsx)
- compute top-denominator = top-denominator * denominator(rsx)
- when '/'
- compute work-number = numerator(rsx) * top-denominator
- compute top-denominator = denominator(rsx) * top-numerator
- if top-denominator = 0
- move 'y' to divide-by-zero-error
- exit paragraph
- end-if
- move work-number to top-numerator
- end-evaluate
- *> pop the stack
- subtract 1 from rsx
- end-if
- end-perform
- .
-end program twentyfoursolve.
diff --git a/Task/24-game/Ada/24-game.ada b/Task/24-game/Ada/24-game.ada
deleted file mode 100644
index b090308975..0000000000
--- a/Task/24-game/Ada/24-game.ada
+++ /dev/null
@@ -1,172 +0,0 @@
-with Ada.Float_Text_IO;
-with Ada.Text_IO;
-with Ada.Numerics.Discrete_Random;
-procedure Game_24 is
- subtype Digit is Character range '1' .. '9';
- package Random_Digit is new Ada.Numerics.Discrete_Random (Digit);
- Exp_Error : exception;
- Digit_Generator : Random_Digit.Generator;
- Given_Digits : array (1 .. 4) of Digit;
- Float_Value : constant array (Digit) of Float :=
- (1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0);
- function Apply_Op (L, R : Float; Op : Character) return Float is
- begin
- case Op is
- when '+' =>
- return L + R;
- when '-' =>
- return L - R;
- when '*' =>
- return L * R;
- when '/' =>
- return L / R;
- when others =>
- Ada.Text_IO.Put_Line ("Unexpected operator: " & Op);
- raise Exp_Error;
- end case;
- end Apply_Op;
- function Eval_Exp (E : String) return Float is
- Flt : Float;
- First : Positive := E'First;
- Last : Positive;
- function Match_Paren (Start : Positive) return Positive is
- Pos : Positive := Start + 1;
- Level : Natural := 1;
- begin
- loop
- if Pos > E'Last then
- Ada.Text_IO.Put_Line ("Unclosed parentheses.");
- raise Exp_Error;
- elsif E (Pos) = '(' then
- Level := Level + 1;
- elsif E (Pos) = ')' then
- Level := Level - 1;
- exit when Level = 0;
- end if;
- Pos := Pos + 1;
- end loop;
- return Pos;
- end Match_Paren;
- begin
- if E (First) = '(' then
- Last := Match_Paren (First);
- Flt := Eval_Exp (E (First + 1 .. Last - 1));
- elsif E (First) in Digit then
- Last := First;
- Flt := Float_Value (E (First));
- else
- Ada.Text_IO.Put_Line ("Unexpected character: " & E (First));
- raise Exp_Error;
- end if;
- loop
- if Last = E'Last then
- return Flt;
- elsif Last = E'Last - 1 then
- Ada.Text_IO.Put_Line ("Unexpected end of expression.");
- raise Exp_Error;
- end if;
- First := Last + 2;
- if E (First) = '(' then
- Last := Match_Paren (First);
- Flt := Apply_Op (Flt, Eval_Exp (E (First + 1 .. Last - 1)),
- Op => E (First - 1));
- elsif E (First) in Digit then
- Last := First;
- Flt := Apply_Op (Flt, Float_Value (E (First)),
- Op => E (First - 1));
- else
- Ada.Text_IO.Put_Line ("Unexpected character: " & E (First));
- raise Exp_Error;
- end if;
- end loop;
- end Eval_Exp;
-begin
- Ada.Text_IO.Put_Line ("24 Game");
- Ada.Text_IO.Put_Line ("- Enter Q to Quit");
- Ada.Text_IO.Put_Line ("- Enter N for New digits");
- Ada.Text_IO.Put_Line ("Note: Operators are evaluated left-to-right");
- Ada.Text_IO.Put_Line (" (use parentheses to override)");
- Random_Digit.Reset (Digit_Generator);
- <>
- Ada.Text_IO.Put_Line ("Generating 4 digits...");
- for I in Given_Digits'Range loop
- Given_Digits (I) := Random_Digit.Random (Digit_Generator);
- end loop;
- <>
- Ada.Text_IO.Put ("Your Digits:");
- for I in Given_Digits'Range loop
- Ada.Text_IO.Put (" " & Given_Digits (I));
- end loop;
- Ada.Text_IO.New_Line;
- Ada.Text_IO.Put ("Enter your Expression: ");
- declare
- Value : Float;
- Response : constant String := Ada.Text_IO.Get_Line;
- Prev_Ch : Character := ' ';
- Unused_Digits : array (Given_Digits'Range) of Boolean :=
- (others => True);
- begin
- if Response = "n" or Response = "N" then
- goto GEN_DIGITS;
- end if;
- if Response = "q" or Response = "Q" then
- return;
- end if;
- -- check input
- for I in Response'Range loop
- declare
- Ch : constant Character := Response (I);
- Found : Boolean;
- begin
- if Ch in Digit then
- if Prev_Ch in Digit then
- Ada.Text_IO.Put_Line ("Illegal multi-digit number used.");
- goto GET_EXP;
- end if;
- Found := False;
- for J in Given_Digits'Range loop
- if Unused_Digits (J) and then
- Given_Digits (J) = Ch then
- Unused_Digits (J) := False;
- Found := True;
- exit;
- end if;
- end loop;
- if not Found then
- Ada.Text_IO.Put_Line ("Illegal number used: " & Ch);
- goto GET_EXP;
- end if;
- elsif Ch /= '(' and Ch /= ')' and Ch /= '+' and
- Ch /= '-' and Ch /= '*' and Ch /= '/' then
- Ada.Text_IO.Put_Line ("Illegal character used: " & Ch);
- goto GET_EXP;
- end if;
- Prev_Ch := Ch;
- end;
- end loop;
- -- check all digits used
- for I in Given_Digits'Range loop
- if Unused_Digits (I) then
- Ada.Text_IO.Put_Line ("Digit not used: " & Given_Digits (I));
- goto GET_EXP;
- end if;
- end loop;
- -- check value
- begin
- Value := Eval_Exp (Response);
- exception
- when Exp_Error =>
- goto GET_EXP; -- Message displayed by Eval_Exp;
- end;
- if abs (Value - 24.0) > 0.001 then
- Ada.Text_IO.Put ("Value ");
- Ada.Float_Text_IO.Put (Value, Fore => 0, Aft => 3, Exp => 0);
- Ada.Text_IO.Put_Line (" is not 24!");
- goto GET_EXP;
- else
- Ada.Text_IO.Put_Line ("You won!");
- Ada.Text_IO.Put_Line ("Enter N for a new game, or try another solution.");
- goto GET_EXP;
- end if;
- end;
-end Game_24;
diff --git a/Task/24-game/Arturo/24-game.arturo b/Task/24-game/Arturo/24-game.arturo
index a44398760e..0175c79a13 100644
--- a/Task/24-game/Arturo/24-game.arturo
+++ b/Task/24-game/Arturo/24-game.arturo
@@ -28,11 +28,10 @@ result: 0
while [result<>24][
got: input "Enter an expression to form 24: "
blo: to :block got
- if? validExpression? blo [
+ switch validExpression? blo [
result: do blo
print ["The result is:" result]
- ]
- else [
+ ][
print "Invalid expression. Please try again!"
]
print ""
diff --git a/Task/24-game/AutoIt/24-game.autoit b/Task/24-game/AutoIt/24-game.autoit
deleted file mode 100644
index c1edd1282a..0000000000
--- a/Task/24-game/AutoIt/24-game.autoit
+++ /dev/null
@@ -1,74 +0,0 @@
-;AutoIt Script Example
-;by Daniel Barnes
-;spam me at djbarnes at orcon dot net dot en zed
-;13/08/2012
-
-;Choose four random digits (1-9) with repetitions allowed:
-global $digits
-FOR $i = 1 TO 4
- $digits &= Random(1,9,1)
-NEXT
-
-While 1
- main()
-WEnd
-
-Func main()
- $text = "Enter an equation (using all of, and only, the single digits "&$digits &")"&@CRLF
- $text &= "which evaluates to exactly 24. Only multiplication (*) division (/)"&@CRLF
- $text &= "addition (+) and subtraction (-) operations and parentheses are allowed:"
- $input = InputBox ("24 Game",$text,"","",400,150)
- If @error Then exit
-
- ;remove any spaces in input
- $input = StringReplace($input," ","")
-
- ;check correct characters were used
- For $i = 1 To StringLen($input)
- $chr = StringMid($input,$i,1)
- If Not StringInStr("123456789*/+-()",$chr) Then
- MsgBox (0, "ERROR","Invalid character used: '"&$chr&"'")
- return
- endif
- Next
-
- ;validate the equation uses all of the 4 characters, and nothing else
- $test = $input
- $test = StringReplace($test,"(","")
- $test = StringReplace($test,")","")
-
- ;validate the length of the input - if its not 7 characters long then the user has done something wrong
- If StringLen ($test) <> 7 Then
- MsgBox (0,"ERROR","The equation "&$test&" is invalid")
- return
- endif
-
- $test = StringReplace($test,"/","")
- $test = StringReplace($test,"*","")
- $test = StringReplace($test,"-","")
- $test = StringReplace($test,"+","")
-
- For $i = 1 To StringLen($digits)
- $digit = StringMid($digits,$i,1)
- For $ii = 1 To StringLen($test)
- If StringMid($test,$ii,1) = $digit Then
- $test = StringLeft($test,$ii-1) & StringRight($test,StringLen($test)-$ii)
- ExitLoop
- endif
- Next
- Next
- If $test <> "" Then
- MsgBox (0, "ERROR", "The equation didn't use all 4 characters, and nothing else!")
- return
- endif
-
- $try = Execute($input)
-
- If $try = 24 Then
- MsgBox (0, "24 Game","Well done. Your equation ("&$input&") = 24!")
- Exit
- Else
- MsgBox (0, "24 Game","Fail. Your equation ("&$input&") = "&$try&"!")
- return
- endif
-EndFunc
diff --git a/Task/24-game/COBOL/24-game.cobol b/Task/24-game/COBOL/24-game.cobol
deleted file mode 100644
index 8041901235..0000000000
--- a/Task/24-game/COBOL/24-game.cobol
+++ /dev/null
@@ -1,843 +0,0 @@
- >>SOURCE FORMAT FREE
-*> This code is dedicated to the public domain
-*> This is GNUCobol 2.0
-identification division.
-program-id. twentyfour.
-environment division.
-configuration section.
-repository. function all intrinsic.
-data division.
-working-storage section.
-01 p pic 999.
-01 p1 pic 999.
-01 p-max pic 999 value 38.
-01 program-syntax pic x(494) value
-*>statement = expression;
- '001 001 000 n'
- & '002 000 004 ='
- & '003 005 000 n'
- & '004 000 002 ;'
-*>expression = term, {('+'|'-') term,};
- & '005 005 000 n'
- & '006 000 016 ='
- & '007 017 000 n'
- & '008 000 015 {'
- & '009 011 013 ('
- & '010 001 000 t'
- & '011 013 000 |'
- & '012 002 000 t'
- & '013 000 009 )'
- & '014 017 000 n'
- & '015 000 008 }'
- & '016 000 006 ;'
-*>term = factor, {('*'|'/') factor,};
- & '017 017 000 n'
- & '018 000 028 ='
- & '019 029 000 n'
- & '020 000 027 {'
- & '021 023 025 ('
- & '022 003 000 t'
- & '023 025 000 |'
- & '024 004 000 t'
- & '025 000 021 )'
- & '026 029 000 n'
- & '027 000 020 }'
- & '028 000 018 ;'
-*>factor = ('(' expression, ')' | digit,);
- & '029 029 000 n'
- & '030 000 038 ='
- & '031 035 037 ('
- & '032 005 000 t'
- & '033 005 000 n'
- & '034 006 000 t'
- & '035 037 000 |'
- & '036 000 000 n'
- & '037 000 031 )'
- & '038 000 030 ;'.
-01 filler redefines program-syntax.
- 03 p-entry occurs 038.
- 05 p-address pic 999.
- 05 filler pic x.
- 05 p-definition pic 999.
- 05 p-alternate redefines p-definition pic 999.
- 05 filler pic x.
- 05 p-matching pic 999.
- 05 filler pic x.
- 05 p-symbol pic x.
-
-01 t pic 999.
-01 t-len pic 99 value 6.
-01 terminal-symbols
- pic x(210) value
- '01 + '
- & '01 - '
- & '01 * '
- & '01 / '
- & '01 ( '
- & '01 ) '.
-01 filler redefines terminal-symbols.
- 03 terminal-symbol-entry occurs 6.
- 05 terminal-symbol-len pic 99.
- 05 filler pic x.
- 05 terminal-symbol pic x(32).
-
-01 nt pic 999.
-01 nt-lim pic 99 value 5.
-01 nonterminal-statements pic x(294) value
- "000 ....,....,....,....,....,....,....,....,....,"
- & "001 statement = expression; "
- & "005 expression = term, {('+'|'-') term,}; "
- & "017 term = factor, {('*'|'/') factor,}; "
- & "029 factor = ('(' expression, ')' | digit,); "
- & "036 digit; ".
-01 filler redefines nonterminal-statements.
- 03 nonterminal-statement-entry occurs 5.
- 05 nonterminal-statement-number pic 999.
- 05 filler pic x.
- 05 nonterminal-statement pic x(45).
-
-01 indent pic x(64) value all '| '.
-01 interpreter-stack.
- 03 r pic 99. *> previous top of stack
- 03 s pic 99. *> current top of stack
- 03 s-max pic 99 value 32.
- 03 s-entry occurs 32.
- 05 filler pic x(2) value 'p='.
- 05 s-p pic 999. *> callers return address
- 05 filler pic x(4) value ' sc='.
- 05 s-start-control pic 999. *> sequence start address
- 05 filler pic x(4) value ' ec='.
- 05 s-end-control pic 999. *> sequence end address
- 05 filler pic x(4) value ' al='.
- 05 s-alternate pic 999. *> the next alternate
- 05 filler pic x(3) value ' r='.
- 05 s-result pic x. *> S success, F failure, N no result
- 05 filler pic x(3) value ' c='.
- 05 s-count pic 99. *> successes in a sequence
- 05 filler pic x(3) value ' x='.
- 05 s-repeat pic 99. *> repeats in a {} sequence
- 05 filler pic x(4) value ' nt='.
- 05 s-nt pic 99. *> current nonterminal
-
-01 language-area.
- 03 l pic 99.
- 03 l-lim pic 99.
- 03 l-len pic 99 value 1.
- 03 nd pic 9.
- 03 number-definitions.
- 05 n occurs 4 pic 9.
- 03 nu pic 9.
- 03 number-use.
- 05 u occurs 4 pic x.
- 03 statement.
- 05 c occurs 32.
- 07 c9 pic 9.
-
-01 number-validation.
- 03 p4 pic 99.
- 03 p4-lim pic 99 value 24.
- 03 permutations-4 pic x(96) value
- '1234'
- & '1243'
- & '1324'
- & '1342'
- & '1423'
- & '1432'
- & '2134'
- & '2143'
- & '2314'
- & '2341'
- & '2413'
- & '2431'
- & '3124'
- & '3142'
- & '3214'
- & '3241'
- & '3423'
- & '3432'
- & '4123'
- & '4132'
- & '4213'
- & '4231'
- & '4312'
- & '4321'.
- 03 filler redefines permutations-4.
- 05 permutation-4 occurs 24 pic x(4).
- 03 current-permutation-4 pic x(4).
- 03 cpx pic 9.
- 03 od1 pic 9.
- 03 od2 pic 9.
- 03 odx pic 9.
- 03 od-lim pic 9 value 4.
- 03 operator-definitions pic x(4) value '+-*/'.
- 03 current-operators pic x(3).
- 03 co3 pic 9.
- 03 rpx pic 9.
- 03 rpx-lim pic 9 value 4.
- 03 valid-rpn-forms pic x(28) value
- 'nnonono'
- & 'nnnonoo'
- & 'nnnoono'
- & 'nnnnooo'.
- 03 filler redefines valid-rpn-forms.
- 05 rpn-form occurs 4 pic x(7).
- 03 current-rpn-form pic x(7).
-
-01 calculation-area.
- 03 osx pic 99.
- 03 operator-stack pic x(32).
- 03 oqx pic 99.
- 03 oqx1 pic 99.
- 03 output-queue pic x(32).
- 03 work-number pic s9999.
- 03 top-numerator pic s9999 sign leading separate.
- 03 top-denominator pic s9999 sign leading separate.
- 03 rsx pic 9.
- 03 result-stack occurs 8.
- 05 numerator pic s9999.
- 05 denominator pic s9999.
-
-01 error-found pic x.
-01 divide-by-zero-error pic x.
-
-*> diagnostics
-01 NL pic x value x'0A'.
-01 NL-flag pic x value space.
-01 display-level pic x value '0'.
-01 loop-lim pic 9999 value 1500.
-01 loop-count pic 9999 value 0.
-01 message-area value spaces.
- 03 message-level pic x.
- 03 message-value pic x(128).
-
-*> input and examples
-01 instruction pic x(32) value spaces.
-01 tsx pic 99.
-01 tsx-lim pic 99 value 14.
-01 test-statements.
- 03 filler pic x(32) value '1234;1 + 2 + 3 + 4'.
- 03 filler pic x(32) value '1234;1 * 2 * 3 * 4'.
- 03 filler pic x(32) value '1234;((1)) * (((2 * 3))) * 4'.
- 03 filler pic x(32) value '1234;((1)) * ((2 * 3))) * 4'.
- 03 filler pic x(32) value '1234;(1 + 2 + 3 + 4'.
- 03 filler pic x(32) value '1234;)1 + 2 + 3 + 4'.
- 03 filler pic x(32) value '1234;1 * * 2 * 3 * 4'.
- 03 filler pic x(32) value '5679;6 - (5 - 7) * 9'.
- 03 filler pic x(32) value '1268;((1 * (8 * 6) / 2))'.
- 03 filler pic x(32) value '4583;-5-3+(8*4)'.
- 03 filler pic x(32) value '4583;8 * 4 - 5 - 3'.
- 03 filler pic x(32) value '4583;8 * 4 - (5 + 3)'.
- 03 filler pic x(32) value '1223;1 * 3 / (2 - 2)'.
- 03 filler pic x(32) value '2468;(6 * 8) / 4 / 2'.
-01 filler redefines test-statements.
- 03 filler occurs 14.
- 05 test-numbers pic x(4).
- 05 filler pic x.
- 05 test-statement pic x(27).
-
-procedure division.
-start-twentyfour.
- display 'start twentyfour'
- perform generate-numbers
- display 'type h to see instructions'
- accept instruction
- perform until instruction = spaces or 'q'
- evaluate true
- when instruction = 'h'
- perform display-instructions
- when instruction = 'n'
- perform generate-numbers
- when instruction(1:1) = 'm'
- move instruction(2:4) to number-definitions
- perform validate-number
- if divide-by-zero-error = space
- and 24 * top-denominator = top-numerator
- display number-definitions ' is solved by ' output-queue(1:oqx)
- else
- display number-definitions ' is not solvable'
- end-if
- when instruction = 'd0' or 'd1' or 'd2' or 'd3'
- move instruction(2:1) to display-level
- when instruction = 'e'
- display 'examples:'
- perform varying tsx from 1 by 1
- until tsx > tsx-lim
- move spaces to statement
- move test-numbers(tsx) to number-definitions
- move test-statement(tsx) to statement
- perform evaluate-statement
- perform show-result
- end-perform
- when other
- move instruction to statement
- perform evaluate-statement
- perform show-result
- end-evaluate
- move spaces to instruction
- display 'instruction? ' with no advancing
- accept instruction
- end-perform
-
- display 'exit twentyfour'
- stop run
- .
-generate-numbers.
- perform with test after until divide-by-zero-error = space
- and 24 * top-denominator = top-numerator
- compute n(1) = random(seconds-past-midnight) * 10 *> seed
- perform varying nd from 1 by 1 until nd > 4
- compute n(nd) = random() * 10
- perform until n(nd) <> 0
- compute n(nd) = random() * 10
- end-perform
- end-perform
- perform validate-number
- end-perform
- display NL 'numbers:' with no advancing
- perform varying nd from 1 by 1 until nd > 4
- display space n(nd) with no advancing
- end-perform
- display space
- .
-validate-number.
- perform varying p4 from 1 by 1 until p4 > p4-lim
- move permutation-4(p4) to current-permutation-4
- perform varying od1 from 1 by 1 until od1 > od-lim
- move operator-definitions(od1:1) to current-operators(1:1)
- perform varying od2 from 1 by 1 until od2 > od-lim
- move operator-definitions(od2:1) to current-operators(2:1)
- perform varying odx from 1 by 1 until odx > od-lim
- move operator-definitions(odx:1) to current-operators(3:1)
- perform varying rpx from 1 by 1 until rpx > rpx-lim
- move rpn-form(rpx) to current-rpn-form
- move 0 to cpx co3
- move spaces to output-queue
- move 7 to oqx
- perform varying oqx1 from 1 by 1 until oqx1 > oqx
- if current-rpn-form(oqx1:1) = 'n'
- add 1 to cpx
- move current-permutation-4(cpx:1) to nd
- move n(nd) to output-queue(oqx1:1)
- else
- add 1 to co3
- move current-operators(co3:1) to output-queue(oqx1:1)
- end-if
- end-perform
- end-perform
- perform evaluate-rpn
- if divide-by-zero-error = space
- and 24 * top-denominator = top-numerator
- exit paragraph
- end-if
- end-perform
- end-perform
- end-perform
- end-perform
- .
-display-instructions.
- display '1) Type h to repeat these instructions.'
- display '2) The program will display four randomly-generated'
- display ' single-digit numbers and will then prompt you to enter'
- display ' an arithmetic expression followed by to sum'
- display ' the given numbers to 24.'
- display ' The four numbers may contain duplicates and the entered'
- display ' expression must reference all the generated numbers and duplicates.'
- display ' Warning: the program converts the entered infix expression'
- display ' to a reverse polish notation (rpn) expression'
- display ' which is then interpreted from RIGHT to LEFT.'
- display ' So, for instance, 8*4 - 5 - 3 will not sum to 24.'
- display '3) Type n to generate a new set of four numbers.'
- display ' The program will ensure the generated numbers are solvable.'
- display '4) Type m#### (e.g. m1234) to create a fixed set of numbers'
- display ' for testing purposes.'
- display ' The program will test the solvability of the entered numbers.'
- display ' For example, m1234 is solvable and m9999 is not solvable.'
- display '5) Type d0, d1, d2 or d3 followed by to display none or'
- display ' increasingly detailed diagnostic information as the program evaluates'
- display ' the entered expression.'
- display '6) Type e to see a list of example expressions and results'
- display '7) Type or q to exit the program'
- .
-show-result.
- if error-found = 'y'
- or divide-by-zero-error = 'y'
- exit paragraph
- end-if
- display 'statement in RPN is' space output-queue
- evaluate true
- when top-numerator = 0
- when top-denominator = 0
- when 24 * top-denominator <> top-numerator
- display 'result (' top-numerator '/' top-denominator ') is not 24'
- when other
- display 'result is 24'
- end-evaluate
- .
-evaluate-statement.
- compute l-lim = length(trim(statement))
-
- display NL 'numbers:' space n(1) space n(2) space n(3) space n(4)
- move number-definitions to number-use
- display 'statement is' space statement
-
- move 1 to l
- move 0 to loop-count
- move space to error-found
-
- move 0 to osx oqx
- move spaces to output-queue
-
- move 1 to p
- move 1 to nt
- move 0 to s
- perform increment-s
- perform display-start-nonterminal
- perform increment-p
-
- *>===================================
- *> interpret ebnf
- *>===================================
- perform until s = 0
- or error-found = 'y'
-
- evaluate true
-
- when p-symbol(p) = 'n'
- and p-definition(p) = 000 *> a variable
- perform test-variable
- if s-result(s) = 'S'
- perform increment-l
- end-if
- perform increment-p
-
- when p-symbol(p) = 'n'
- and p-address(p) <> p-definition(p) *> nonterminal reference
- move p to s-p(s)
- move p-definition(p) to p
-
- when p-symbol(p) = 'n'
- and p-address(p) = p-definition(p) *> nonterminal definition
- perform increment-s
- perform display-start-nonterminal
- perform increment-p
-
- when p-symbol(p) = '=' *> nonterminal control
- move p to s-start-control(s)
- move p-matching(p) to s-end-control(s)
- perform increment-p
-
- when p-symbol(p) = ';' *> end nonterminal
- perform display-end-control
- perform display-end-nonterminal
- perform decrement-s
- if s > 0
- evaluate true
- when s-result(r) = 'S'
- perform set-success
- when s-result(r) = 'F'
- perform set-failure
- end-evaluate
- move s-p(s) to p
- perform increment-p
- perform display-continue-nonterminal
- end-if
-
- when p-symbol(p) = '{' *> start repeat sequence
- perform increment-s
- perform display-start-control
- move p to s-start-control(s)
- move p-alternate(p) to s-alternate(s)
- move p-matching(p) to s-end-control(s)
- move 0 to s-count(s)
- perform increment-p
-
- when p-symbol(p) = '}' *> end repeat sequence
- perform display-end-control
- evaluate true
- when s-result(s) = 'S' *> repeat the sequence
- perform display-repeat-control
- perform set-nothing
- add 1 to s-repeat(s)
- move s-start-control(s) to p
- perform increment-p
- when other
- perform decrement-s
- evaluate true
- when s-result(r) = 'N'
- and s-repeat(r) = 0 *> no result
- perform increment-p
- when s-result(r) = 'N'
- and s-repeat(r) > 0 *> no result after success
- perform set-success
- perform increment-p
- when other *> fail the sequence
- perform increment-p
- end-evaluate
- end-evaluate
-
- when p-symbol(p) = '(' *> start sequence
- perform increment-s
- perform display-start-control
- move p to s-start-control(s)
- move p-alternate(p) to s-alternate(s)
- move p-matching(p) to s-end-control(s)
- move 0 to s-count(s)
- perform increment-p
-
- when p-symbol(p) = ')' *> end sequence
- perform display-end-control
- perform decrement-s
- evaluate true
- when s-result(r) = 'S' *> success
- perform set-success
- perform increment-p
- when s-result(r) = 'N' *> no result
- perform set-failure
- perform increment-p
- when other *> fail the sequence
- perform set-failure
- perform increment-p
- end-evaluate
-
- when p-symbol(p) = '|' *> alternate
- evaluate true
- when s-result(s) = 'S' *> exit the sequence
- perform display-skip-alternate
- move s-end-control(s) to p
- when other
- perform display-take-alternate
- move p-alternate(p) to s-alternate(s) *> the next alternate
- perform increment-p
- perform set-nothing
- end-evaluate
-
- when p-symbol(p) = 't' *> terminal
- move p-definition(p) to t
- move terminal-symbol-len(t) to t-len
- perform display-terminal
- evaluate true
- when statement(l:t-len) = terminal-symbol(t)(1:t-len) *> successful match
- perform set-success
- perform display-recognize-terminal
- perform process-token
- move t-len to l-len
- perform increment-l
- perform increment-p
- when s-alternate(s) <> 000 *> we are in an alternate sequence
- move s-alternate(s) to p
- when other *> fail the sequence
- perform set-failure
- move s-end-control(s) to p
- end-evaluate
-
- when other *> end control
- perform display-control-failure *> shouldnt happen
-
- end-evaluate
-
- end-perform
-
- evaluate true *> at end of evaluation
- when error-found = 'y'
- continue
- when l <= l-lim *> not all tokens parsed
- display 'error: invalid statement'
- perform statement-error
- when number-use <> spaces
- display 'error: not all numbers were used: ' number-use
- move 'y' to error-found
- end-evaluate
- .
-increment-l.
- evaluate true
- when l > l-lim *> end of statement
- continue
- when other
- add l-len to l
- perform varying l from l by 1
- until c(l) <> space
- or l > l-lim
- continue
- end-perform
- move 1 to l-len
- if l > l-lim
- perform end-tokens
- end-if
- end-evaluate
- .
-increment-p.
- evaluate true
- when p >= p-max
- display 'at' space p ' parse overflow'
- space 's=<' s space s-entry(s) '>'
- move 'y' to error-found
- when other
- add 1 to p
- perform display-statement
- end-evaluate
- .
-increment-s.
- evaluate true
- when s >= s-max
- display 'at' space p ' stack overflow '
- space 's=<' s space s-entry(s) '>'
- move 'y' to error-found
- when other
- move s to r
- add 1 to s
- initialize s-entry(s)
- move 'N' to s-result(s)
- move p to s-p(s)
- move nt to s-nt(s)
- end-evaluate
- .
-decrement-s.
- if s > 0
- move s to r
- subtract 1 from s
- if s > 0
- move s-nt(s) to nt
- end-if
- end-if
- .
-set-failure.
- move 'F' to s-result(s)
- if s-count(s) > 0
- display 'sequential parse failure'
- perform statement-error
- end-if
- .
-set-success.
- move 'S' to s-result(s)
- add 1 to s-count(s)
- .
-set-nothing.
- move 'N' to s-result(s)
- move 0 to s-count(s)
- .
-statement-error.
- display statement
- move spaces to statement
- move '^ syntax error' to statement(l:)
- display statement
- move 'y' to error-found
- .
-*>=====================
-*> twentyfour semantics
-*>=====================
-test-variable.
- *> check validity
- perform varying nd from 1 by 1 until nd > 4
- or c(l) = n(nd)
- continue
- end-perform
- *> check usage
- perform varying nu from 1 by 1 until nu > 4
- or c(l) = u(nu)
- continue
- end-perform
- evaluate true
- when l > l-lim
- perform set-failure
- when c9(l) not numeric
- perform set-failure
- when nd > 4
- display 'invalid number'
- perform statement-error
- when nu > 4
- display 'number already used'
- perform statement-error
- when other
- move space to u(nu)
- perform set-success
- add 1 to oqx
- move c(l) to output-queue(oqx:1)
- end-evaluate
- .
-*> ==================================
-*> Dijkstra Shunting-Yard Algorithm
-*> to convert infix to rpn
-*> ==================================
-process-token.
- evaluate true
- when c(l) = '('
- add 1 to osx
- move c(l) to operator-stack(osx:1)
- when c(l) = ')'
- perform varying osx from osx by -1 until osx < 1
- or operator-stack(osx:1) = '('
- add 1 to oqx
- move operator-stack(osx:1) to output-queue(oqx:1)
- end-perform
- if osx < 1
- display 'parenthesis error'
- perform statement-error
- exit paragraph
- end-if
- subtract 1 from osx
- when (c(l) = '+' or '-') and (operator-stack(osx:1) = '*' or '/')
- *> lesser operator precedence
- add 1 to oqx
- move operator-stack(osx:1) to output-queue(oqx:1)
- move c(l) to operator-stack(osx:1)
- when other
- *> greater operator precedence
- add 1 to osx
- move c(l) to operator-stack(osx:1)
- end-evaluate
- .
-end-tokens.
- *> 1) copy stacked operators to the output-queue
- perform varying osx from osx by -1 until osx < 1
- or operator-stack(osx:1) = '('
- add 1 to oqx
- move operator-stack(osx:1) to output-queue(oqx:1)
- end-perform
- if osx > 0
- display 'parenthesis error'
- perform statement-error
- exit paragraph
- end-if
- *> 2) evaluate the rpn statement
- perform evaluate-rpn
- if divide-by-zero-error = 'y'
- display 'divide by zero error'
- end-if
- .
-evaluate-rpn.
- move space to divide-by-zero-error
- move 0 to rsx *> stack depth
- perform varying oqx1 from 1 by 1 until oqx1 > oqx
- if output-queue(oqx1:1) >= '1' and <= '9'
- *> push current data onto the stack
- add 1 to rsx
- move top-numerator to numerator(rsx)
- move top-denominator to denominator(rsx)
- move output-queue(oqx1:1) to top-numerator
- move 1 to top-denominator
- else
- *> apply the operation
- evaluate true
- when output-queue(oqx1:1) = '+'
- compute top-numerator = top-numerator * denominator(rsx)
- + top-denominator * numerator(rsx)
- compute top-denominator = top-denominator * denominator(rsx)
- when output-queue(oqx1:1) = '-'
- compute top-numerator = top-denominator * numerator(rsx)
- - top-numerator * denominator(rsx)
- compute top-denominator = top-denominator * denominator(rsx)
- when output-queue(oqx1:1) = '*'
- compute top-numerator = top-numerator * numerator(rsx)
- compute top-denominator = top-denominator * denominator(rsx)
- when output-queue(oqx1:1) = '/'
- compute work-number = numerator(rsx) * top-denominator
- compute top-denominator = denominator(rsx) * top-numerator
- if top-denominator = 0
- move 'y' to divide-by-zero-error
- exit paragraph
- end-if
- move work-number to top-numerator
- end-evaluate
- *> pop the stack
- subtract 1 from rsx
- end-if
- end-perform
- .
-*>====================
-*> diagnostic displays
-*>====================
-display-start-nonterminal.
- perform varying nt from nt-lim by -1 until nt < 1
- or p-definition(p) = nonterminal-statement-number(nt)
- continue
- end-perform
- if nt > 0
- move '1' to NL-flag
- string '1' indent(1:s + s) 'at ' s space p ' start ' trim(nonterminal-statement(nt))
- into message-area perform display-message
- move nt to s-nt(s)
- end-if
- .
-display-continue-nonterminal.
- move s-nt(s) to nt
- string '1' indent(1:s + s) 'at ' s space p space p-symbol(p) ' continue ' trim(nonterminal-statement(nt)) ' with result ' s-result(s)
- into message-area perform display-message
- .
-display-end-nonterminal.
- move s-nt(s) to nt
- move '2' to NL-flag
- string '1' indent(1:s + s) 'at ' s space p ' end ' trim(nonterminal-statement(nt)) ' with result ' s-result(s)
- into message-area perform display-message
- .
-display-start-control.
- string '2' indent(1:s + s) 'at ' s space p ' start ' p-symbol(p) ' in ' trim(nonterminal-statement(nt))
- into message-area perform display-message
- .
-display-repeat-control.
- string '2' indent(1:s + s) 'at ' s space p ' repeat ' p-symbol(p) ' in ' trim(nonterminal-statement(nt)) ' with result ' s-result(s)
- into message-area perform display-message
- .
-display-end-control.
- string '2' indent(1:s + s) 'at ' s space p ' end ' p-symbol(p) ' in ' trim(nonterminal-statement(nt)) ' with result ' s-result(s)
- into message-area perform display-message
- .
-display-take-alternate.
- string '2' indent(1:s + s) 'at ' s space p ' take alternate' ' in ' trim(nonterminal-statement(nt))
- into message-area perform display-message
- .
-display-skip-alternate.
- string '2' indent(1:s + s) 'at ' s space p ' skip alternate' ' in ' trim(nonterminal-statement(nt))
- into message-area perform display-message
- .
-display-terminal.
- string '1' indent(1:s + s) 'at ' s space p
- ' compare ' statement(l:t-len) ' to ' terminal-symbol(t)(1:t-len)
- ' in ' trim(nonterminal-statement(nt))
- into message-area perform display-message
- .
-display-recognize-terminal.
- string '1' indent(1:s + s) 'at ' s space p ' recognize terminal: ' c(l) ' in ' trim(nonterminal-statement(nt))
- into message-area perform display-message
- .
-display-recognize-variable.
- string '1' indent(1:s + s) 'at ' s space p ' recognize digit: ' c(l) ' in ' trim(nonterminal-statement(nt))
- into message-area perform display-message
- .
-display-statement.
- compute p1 = p - s-start-control(s)
- string '3' indent(1:s + s) 'at ' s space p
- ' statement: ' s-start-control(s) '/' p1
- space p-symbol(p) space s-result(s)
- ' in ' trim(nonterminal-statement(nt))
- into message-area perform display-message
- .
-display-control-failure.
- display loop-count space indent(1:s + s) 'at' space p ' control failure' ' in ' trim(nonterminal-statement(nt))
- display loop-count space indent(1:s + s) ' ' 'p=<' p p-entry(p) '>'
- display loop-count space indent(1:s + s) ' ' 's=<' s space s-entry(s) '>'
- display loop-count space indent(1:s + s) ' ' 'l=<' l space c(l)'>'
- perform statement-error
- .
-display-message.
- if display-level = 1
- move space to NL-flag
- end-if
- evaluate true
- when loop-count > loop-lim *> loop control
- display 'display count exceeds ' loop-lim
- stop run
- when message-level <= display-level
- evaluate true
- when NL-flag = '1'
- display NL loop-count space trim(message-value)
- when NL-flag = '2'
- display loop-count space trim(message-value) NL
- when other
- display loop-count space trim(message-value)
- end-evaluate
- end-evaluate
- add 1 to loop-count
- move spaces to message-area
- move space to NL-flag
- .
-end program twentyfour.
diff --git a/Task/24-game/Elena/24-game.elena b/Task/24-game/Elena/24-game.elena
index b363901a03..2a65ccecd2 100644
--- a/Task/24-game/Elena/24-game.elena
+++ b/Task/24-game/Elena/24-game.elena
@@ -3,6 +3,8 @@ import system'collections;
import system'dynamic;
import extensions;
+// --- Expression ---
+
class ExpressionTree
{
object _tree;
@@ -95,6 +97,8 @@ class ExpressionTree
<= readLeaves(list,_tree);
}
+// --- Game ---
+
class TwentyFourGame
{
object theNumbers;
@@ -108,10 +112,10 @@ class TwentyFourGame
{
theNumbers := new object[]
{
- 1 + randomGenerator.nextInt(9),
- 1 + randomGenerator.nextInt(9),
- 1 + randomGenerator.nextInt(9),
- 1 + randomGenerator.nextInt(9)
+ 1 + Random.nextInt(9),
+ 1 + Random.nextInt(9),
+ 1 + Random.nextInt(9),
+ 1 + Random.nextInt(9)
}
}
@@ -184,7 +188,7 @@ extension gameOp
}
catch(Exception e)
{
- Console.printLine:"An error occurred. Check your input and try again."
+ Console.printLine("An error occurred. Check your input and try again.")
}
};
@@ -193,7 +197,9 @@ extension gameOp
}
}
-public program()
+// --- Program ---
+
+public Program()
{
var game := new TwentyFourGame().help();
diff --git a/Task/24-game/PowerShell/24-game.psh b/Task/24-game/PowerShell/24-game.psh
deleted file mode 100644
index eb31215f4a..0000000000
--- a/Task/24-game/PowerShell/24-game.psh
+++ /dev/null
@@ -1,73 +0,0 @@
-CLS
-
-Function isNumeric ($x)
-{
- $x2 = 0
- $isNum = [System.Int32]::TryParse($x,[ref]$x2)
-Return $isNum
-}
-
-$NumberArray = @()
-While( $NumberArray.Count -lt 4 ){
- $NumberArray += Random -Minimum 1 -Maximum 10
-}
-
-Write-Host @"
-Welcome to the 24 game!
-
-Here are your numbers: $($NumberArray -join ",").
-Use division, multiplication, subtraction and addition to get 24 as a result with these 4 numbers.
-"@
-
-Do
-{
-$Wrong = 0
-$EndResult = $null
-$TempChar = $null
-$TempChar2 = $null
-$Count = $null
-
-$AllowableCharacters = $NumberArray + "+-*/()".ToCharArray()
- $Result = Read-Host
- Foreach($Char in $Result.ToCharArray())
- {
- If( $AllowableCharacters -notcontains $Char ){ $Wrong = 1 }
- }
-
- If($Wrong -eq 1)
- {
- Write-Warning "Wrong input! Please use only the given numbers."
- }
- Foreach($Char in $Result.ToCharArray())
- {
- If((IsNumeric $TempChar) -AND (IsNumeric $Char))
- {
- Write-Warning "Wrong input! Combining two or more numbers together is not allowed!"
- }
- $TempChar = $Char
- }
- Foreach($Char in $Result.ToCharArray())
- {
- If(IsNumeric $Char)
- {
- $Count++
- }
- }
- If($Count -eq 4)
- {
- $EndResult = Invoke-Expression $Result
- If($EndResult -eq 24)
- {
- Write-Host "`nYou've won the game!"
- }
- Else
- {
- Write-Host "`n$EndResult is not 24! Too bad."
- }
- }
- Else
- {
- Write-Warning "Wrong input! You did not supply four numbers."
- }
-}
-While($EndResult -ne 24)
diff --git a/Task/4-rings-or-4-squares-puzzle/Ada/4-rings-or-4-squares-puzzle.ada b/Task/4-rings-or-4-squares-puzzle/Ada/4-rings-or-4-squares-puzzle.ada
deleted file mode 100644
index 3a28415449..0000000000
--- a/Task/4-rings-or-4-squares-puzzle/Ada/4-rings-or-4-squares-puzzle.ada
+++ /dev/null
@@ -1,68 +0,0 @@
-with Ada.Text_IO;
-
-procedure Puzzle_Square_4 is
-
- procedure Four_Rings (Low, High : in Natural; Unique, Show : in Boolean) is
- subtype Test_Range is Natural range Low .. High;
-
- type Value_List is array (Positive range <>) of Natural;
- function Is_Unique (Values : Value_List) return Boolean is
- Count : array (Test_Range) of Natural := (others => 0);
- begin
- for Value of Values loop
- Count (Value) := Count (Value) + 1;
- if Count (Value) > 1 then
- return False;
- end if;
- end loop;
- return True;
- end Is_Unique;
-
- function Is_Valid (A,B,C,D,E,F,G : in Natural) return Boolean is
- Ring_1 : constant Integer := A + B;
- Ring_2 : constant Integer := B + C + D;
- Ring_3 : constant Integer := D + E + F;
- Ring_4 : constant Integer := F + G;
- begin
- return
- Ring_1 = Ring_2 and
- Ring_1 = Ring_3 and
- Ring_1 = Ring_4;
- end Is_Valid;
-
- use Ada.Text_IO;
- Count : Natural := 0;
- begin
- for A in Test_Range loop
- for B in Test_Range loop
- for C in Test_Range loop
- for D in Test_Range loop
- for E in Test_Range loop
- for F in Test_Range loop
- for G in Test_Range loop
- if Is_Valid (A,B,C,D,E,F,G) then
- if not Unique or (Unique and Is_Unique ((A,B,C,D,E,F,G))) then
- Count := Count + 1;
- if Show then
- Put_Line (A'Image & B'Image & C'Image & D'Image & E'Image & F'Image & G'Image);
- end if;
- end if;
- end if;
- end loop;
- end loop;
- end loop;
- end loop;
- end loop;
- end loop;
- end loop;
- Put_Line ("There are " & Count'Image &
- (if Unique then " unique " else " non-unique ") &
- "solutions in " & Low'Image & " .." & High'Image);
- New_Line;
- end Four_Rings;
-
-begin
- Four_Rings (Low => 1, High => 7, Unique => True, Show => True);
- Four_Rings (Low => 3, High => 9, Unique => True, Show => True);
- Four_Rings (Low => 0, High => 9, Unique => False, Show => False);
-end Puzzle_Square_4;
diff --git a/Task/9-billion-names-of-God-the-integer/Ada/9-billion-names-of-god-the-integer.ada b/Task/9-billion-names-of-God-the-integer/Ada/9-billion-names-of-god-the-integer.ada
deleted file mode 100644
index f9f18eb461..0000000000
--- a/Task/9-billion-names-of-God-the-integer/Ada/9-billion-names-of-god-the-integer.ada
+++ /dev/null
@@ -1,142 +0,0 @@
-with Ada.Text_IO;
-with Ada.Numerics.Big_Numbers.Big_Integers;
-
-procedure Names_Of_God is
-
- NN : constant := 100_000;
- Row_Count : constant := 25;
- Max_Column : constant := 79;
-
- package Triangle is
- procedure Print;
- end Triangle;
-
- package Row_Summer is
- procedure Calc (N : Integer);
- procedure Put_Sums;
- end Row_Summer;
-
- package body Row_Summer is
- use Ada.Text_IO;
- use Ada.Numerics.Big_Numbers.Big_Integers;
-
- P : array (0 .. NN + 1) of Big_Integer := (1, others => 0);
-
- procedure Calc (N : Integer) is
- begin
- P (N) := 0;
-
- for K in 1 .. N + 1 loop
- declare
- Add : constant Boolean := K mod 2 /= 0;
- D_1 : constant Integer := N - K * (3 * K - 1) / 2;
- D_2 : constant Integer := D_1 - K;
- begin
- exit when D_1 < 0;
-
- if Add
- then P (N) := P (N) + P (D_1);
- else P (N) := P (N) - P (D_1);
- end if;
-
- exit when D_2 < 0;
-
- if Add
- then P (N) := P (N) + P (D_2);
- else P (N) := P (N) - P (D_2);
- end if;
- end;
- end loop;
- end Calc;
-
- procedure Put_Wrapped (Item : Big_Integer) is
- Image : constant String := To_String (Item);
- begin
- Set_Col (11);
- for I in Image'Range loop
- if Ada.Text_IO.Col >= Max_Column then
- Set_Col (12);
- end if;
- Put (Image (I));
- end loop;
- end Put_Wrapped;
-
- procedure Put_Sums
- is
- package Integer_IO is new Ada.Text_IO.Integer_IO (Integer);
-
- Printout : constant array (Natural range <>) of Integer :=
- (23, 123, 1234, 12_345, 20_000, 30_000, 40_000, 50_000, NN);
-
- Next : Natural := Printout'First;
- begin
- for A in 1 .. Printout (Printout'Last) loop
- Calc (A);
- if A = Printout (Next) then
- Put ("G (");
- Integer_IO.Put (A, Width => 0);
- Put (")");
- Put_Wrapped (P (A));
- New_Line;
- Next := Next + 1;
- end if;
- end loop;
- end Put_Sums;
-
- end Row_Summer;
-
- package body Triangle is
-
- Triangle : array (0 .. Row_Count,
- 0 .. Row_Count) of Integer := (others => (others => 0));
-
- procedure Calculate is
- begin
- Triangle (1,1) := 1;
- Triangle (2,1) := 1;
- Triangle (2,2) := 1;
- Triangle (3,1) := 1;
- Triangle (3,2) := 1;
- Triangle (3,3) := 1;
- for Row in 4 .. Row_Count loop
- for Col in 1 .. Row loop
- if Col * 2 > Row then
- Triangle (Row, Col) := Triangle (Row - 1, Col - 1);
- else
- Triangle (Row, Col) :=
- Triangle (Row - 1, Col - 1) +
- Triangle (Row - Col, Col);
- end if;
- end loop;
- end loop;
- end Calculate;
-
- procedure Print
- is
- use Ada.Text_IO;
- Width : array (1 .. Row_Count) of Natural := (others => 0);
- begin
- for Row in 1 .. Row_count loop
- for Col in 1 .. Row loop
- Width (Row) := Width (Row) + Triangle (Row, Col)'Image'Length;
- end loop;
- end loop;
-
- for Row in 1 .. Row_Count loop
- Set_Col (1 + Positive_Count (1 + Width (Width'Last)
- - Width (Row)) / 2);
- for Col in 1 .. Row loop
- Put (Triangle (Row, Col)'Image);
- end loop;
- New_Line;
- end loop;
- end Print;
-
- begin
- Calculate;
- end Triangle;
-
-begin
- Triangle.Print;
- Row_Summer.Put_Sums;
-end Names_Of_God;
diff --git a/Task/9-billion-names-of-God-the-integer/Groovy/9-billion-names-of-god-the-integer.groovy b/Task/9-billion-names-of-God-the-integer/Groovy/9-billion-names-of-god-the-integer.groovy
index fed2cfdfba..006cf36944 100644
--- a/Task/9-billion-names-of-God-the-integer/Groovy/9-billion-names-of-god-the-integer.groovy
+++ b/Task/9-billion-names-of-God-the-integer/Groovy/9-billion-names-of-god-the-integer.groovy
@@ -1,4 +1,4 @@
-def partitions(c)
+static def partitions(c)
{
def p=[];
diff --git a/Task/9-billion-names-of-God-the-integer/REBOL/9-billion-names-of-god-the-integer.rebol b/Task/9-billion-names-of-God-the-integer/REBOL/9-billion-names-of-god-the-integer.rebol
deleted file mode 100644
index 4c937e4e34..0000000000
--- a/Task/9-billion-names-of-God-the-integer/REBOL/9-billion-names-of-god-the-integer.rebol
+++ /dev/null
@@ -1,101 +0,0 @@
-Rebol [
- title: "Rosetta code: 9 billion names of God the integer"
- file: %9_billion_names_of_God_the_integer.r3
- url: https://rosettacode.org/wiki/9_billion_names_of_God_the_integer
- needs: 3.0.0
- note: {Based on Red language version}
-]
-names-of-god: function/with [
- row [integer!] "row number (>= 1)"
- /show "Display intermediate results"
- /all "When showing, print all intermediate data"
-][
- ;; Validate input - require row >= 1, otherwise trigger a runtime error
- assert [row >= 1]
-
- ;; If /show refinement is used, display results for the given row
- if show [
- ;; Ensure nums/:row is computed; if not, recursively compute it
- unless nums/:row [names-of-god row]
-
- ;; Loop from 1 to row
- repeat i row [
- either all [ ;; If /all refinement is used, display extra details
- probe reduce [i nums/:i sums/:i] ;; Show index, sequence, and sum
- ][
- print nums/:i ;; Otherwise, just print the sequence
- ]
- ]
- ]
-
- ;; Compute a new row from scratch (if row not already computed)...
- unless sum: sums/:row [
- out: clear [] ;; Temporary storage for row's elements
- half: to integer! row / 2 ;; Middle position of the row
-
- ;; Ensure all required previous rows exist; generate missing ones
- if row - 1 > last: length? nums [
- repeat i row - last - 1 [
- names-of-god last + i
- ]
- ]
-
- ;; Build the `out` block for this row
- repeat col row - 1 [
- ;; Special case: the middle element
- either col = (half + 1) [
- append out at nums/(row - 1) half ;; Insert from previous row's middle
- break ;; Stop building here
- ][
- ;; General case: append sum-part of two earlier sequences
- append out sum-part nums/(row - col) col
- ]
- ]
-
- ;; Compute the sum of the row
- sum: 0.0
- forall out [
- sum: sum + out/1
- ]
-
- ;; Cache the computed row and its sum
- sums/:row: sum
- nums/:row: copy out
- clear out
- ]
- sums/:row ;; Return sum of the row
-][
- ;; ===== WITH BLOCK (local helper definitions and persistent state) =====
-
- ;; Helper function: sum the first `count` elements from the given block `nums`
- sum-part: function [nums [block!] count [integer!]][
- out: 0.0
- loop count [
- out: out + nums/1
- if empty? nums: next nums [break] ;; Stop if we've exhausted the block
- ]
- ;; If within integer range, convert to integer
- if out <= 0#7fffffffffffffff [out: to integer! out]
- out
- ]
-
- ;; Persistent storage for each computed row (map! with row → sequence)
- ;; Start with base cases:
- ;; row 1 = [1]
- ;; row 2 = [1 1]
- nums: make map! [1 [1] 2 [1 1]]
-
- ;; Persistent storage for row sums (map! with row → sum)
- ;; Base sums: row 1 sum = 1, row 2 sum = 2
- sums: make map! [1 1 2 2]
-]
-
-
-
-print "rows: ^/"
-names-of-god/show 25
-
-print "^/sums: ^/"
-probe names-of-god 23
-probe names-of-god 123
-probe names-of-god 1234
diff --git a/Task/99-bottles-of-beer/Ada/99-bottles-of-beer-1.ada b/Task/99-bottles-of-beer/Ada/99-bottles-of-beer-1.ada
deleted file mode 100644
index 6086882d32..0000000000
--- a/Task/99-bottles-of-beer/Ada/99-bottles-of-beer-1.ada
+++ /dev/null
@@ -1,12 +0,0 @@
-with Ada.Text_Io; use Ada.Text_Io;
-
- procedure Bottles is
- begin
- for X in reverse 1..99 loop
- Put_Line(Integer'Image(X) & " bottles of beer on the wall");
- Put_Line(Integer'Image(X) & " bottles of beer");
- Put_Line("Take one down, pass it around");
- Put_Line(Integer'Image(X - 1) & " bottles of beer on the wall");
- New_Line;
- end loop;
- end Bottles;
diff --git a/Task/99-bottles-of-beer/Ada/99-bottles-of-beer-2.ada b/Task/99-bottles-of-beer/Ada/99-bottles-of-beer-2.ada
deleted file mode 100644
index e93a47998b..0000000000
--- a/Task/99-bottles-of-beer/Ada/99-bottles-of-beer-2.ada
+++ /dev/null
@@ -1,39 +0,0 @@
-with Ada.Text_Io; use Ada.Text_Io;
-
-procedure Tasking_99_Bottles is
- subtype Num_Bottles is Natural range 1..99;
- task Print is
- entry Set (Num_Bottles);
- end Print;
- task body Print is
- Num : Natural;
- begin
- for I in reverse Num_Bottles'range loop
- select
- accept
- Set(I) do -- Rendezvous with Counter task I
- Num := I;
- end Set;
- Put_Line(Integer'Image(Num) & " bottles of beer on the wall");
- Put_Line(Integer'Image(Num) & " bottles of beer");
- Put_Line("Take one down, pass it around");
- Put_Line(Integer'Image(Num - 1) & " bottles of beer on the wall");
- New_Line;
- or terminate; -- end when all Counter tasks have completed
- end select;
- end loop;
- end Print;
- task type Counter(I : Num_Bottles);
- task body Counter is
- begin
- Print.Set(I);
- end Counter;
- type Task_Access is access Counter;
-
- Task_List : array(Num_Bottles) of Task_Access;
-
-begin
- for I in Task_List'range loop -- Create 99 Counter tasks
- Task_List(I) := new Counter(I);
- end loop;
-end Tasking_99_Bottles;
diff --git a/Task/99-bottles-of-beer/Arturo/99-bottles-of-beer.arturo b/Task/99-bottles-of-beer/Arturo/99-bottles-of-beer.arturo
index 36bb34201e..a751484f40 100644
--- a/Task/99-bottles-of-beer/Arturo/99-bottles-of-beer.arturo
+++ b/Task/99-bottles-of-beer/Arturo/99-bottles-of-beer.arturo
@@ -6,9 +6,8 @@ loop 99..1 'i [
print ~"Take one down, pass it around!"
if 1=i-1 -> s: ""
- if? i>1 [
+ switch i>1 [
print ~"|i-1| bottle|s| of beer on the wall!"
print ""
- ]
- else -> print "No more bottles of beer on the wall!"
+ ] -> print "No more bottles of beer on the wall!"
]
diff --git a/Task/99-bottles-of-beer/COBOL/99-bottles-of-beer-1.cobol b/Task/99-bottles-of-beer/COBOL/99-bottles-of-beer-1.cobol
deleted file mode 100644
index 6dd44ed15c..0000000000
--- a/Task/99-bottles-of-beer/COBOL/99-bottles-of-beer-1.cobol
+++ /dev/null
@@ -1,104 +0,0 @@
-identification division.
-program-id. ninety-nine.
-environment division.
-data division.
-working-storage section.
-01 counter pic 99.
- 88 no-bottles-left value 0.
- 88 one-bottle-left value 1.
-
-01 parts-of-counter redefines counter.
- 05 tens pic 9.
- 05 digits pic 9.
-
-01 after-ten-words.
- 05 filler pic x(7) value spaces.
- 05 filler pic x(7) value "Twenty".
- 05 filler pic x(7) value "Thirty".
- 05 filler pic x(7) value "Forty".
- 05 filler pic x(7) value "Fifty".
- 05 filler pic x(7) value "Sixty".
- 05 filler pic x(7) value "Seventy".
- 05 filler pic x(7) value "Eighty".
- 05 filler pic x(7) value "Ninety".
- 05 filler pic x(7) value spaces.
-
-01 after-ten-array redefines after-ten-words.
- 05 atens occurs 10 times pic x(7).
-
-01 digit-words.
- 05 filler pic x(9) value "One".
- 05 filler pic x(9) value "Two".
- 05 filler pic x(9) value "Three".
- 05 filler pic x(9) value "Four".
- 05 filler pic x(9) value "Five".
- 05 filler pic x(9) value "Six".
- 05 filler pic x(9) value "Seven".
- 05 filler pic x(9) value "Eight".
- 05 filler pic x(9) value "Nine".
- 05 filler pic x(9) value "Ten".
- 05 filler pic x(9) value "Eleven".
- 05 filler pic x(9) value "Twelve".
- 05 filler pic x(9) value "Thirteen".
- 05 filler pic x(9) value "Fourteen".
- 05 filler pic x(9) value "Fifteen".
- 05 filler pic x(9) value "Sixteen".
- 05 filler pic x(9) value "Seventeen".
- 05 filler pic x(9) value "Eighteen".
- 05 filler pic x(9) value "Nineteen".
- 05 filler pic x(9) value spaces.
-
-01 digit-array redefines digit-words.
- 05 adigits occurs 20 times pic x(9).
-
-01 number-name pic x(15).
-
-procedure division.
-100-main section.
-100-setup.
- perform varying counter from 99 by -1 until no-bottles-left
- perform 100-show-number
- display " of beer on the wall"
- perform 100-show-number
- display " of beer"
- display "Take " with no advancing
- if one-bottle-left
- display "it " with no advancing
- else
- display "one " with no advancing
- end-if
- display "down and pass it round"
- subtract 1 from counter giving counter
- perform 100-show-number
- display " of beer on the wall"
- add 1 to counter giving counter
- display space
- end-perform.
- display "No more bottles of beer on the wall"
- display "No more bottles of beer"
- display "Go to the store and buy some more"
- display "Ninety Nine bottles of beer on the wall"
- stop run.
-
-100-show-number.
- if no-bottles-left
- display "No more" with no advancing
- else
- if counter < 20
- display function trim( adigits( counter ) ) with no advancing
- else
- if counter < 100
- move spaces to number-name
- string atens( tens ) delimited by space, space delimited by size, adigits( digits ) delimited by space into number-name
- display function trim( number-name) with no advancing
- end-if
- end-if
- end-if.
- if one-bottle-left
- display " bottle" with no advancing
- else
- display " bottles" with no advancing
- end-if.
-
-100-end.
-end-program.
diff --git a/Task/99-bottles-of-beer/COBOL/99-bottles-of-beer-2.cobol b/Task/99-bottles-of-beer/COBOL/99-bottles-of-beer-2.cobol
deleted file mode 100644
index 3da47d3761..0000000000
--- a/Task/99-bottles-of-beer/COBOL/99-bottles-of-beer-2.cobol
+++ /dev/null
@@ -1,122 +0,0 @@
-identification division.
-program-id. ninety-nine.
-environment division.
-data division.
-working-storage section.
-01 counter pic 99.
- 88 no-bottles-left value 0.
- 88 one-bottle-left value 1.
-
-01 parts-of-counter redefines counter.
- 05 tens pic 9.
- 05 digits pic 9.
-
-01 after-ten-words.
- 05 filler pic x(7) value spaces.
- 05 filler pic x(7) value "Twenty".
- 05 filler pic x(7) value "Thirty".
- 05 filler pic x(7) value "Forty".
- 05 filler pic x(7) value "Fifty".
- 05 filler pic x(7) value "Sixty".
- 05 filler pic x(7) value "Seventy".
- 05 filler pic x(7) value "Eighty".
- 05 filler pic x(7) value "Ninety".
- 05 filler pic x(7) value spaces.
-
-01 after-ten-array redefines after-ten-words.
- 05 atens occurs 10 times pic x(7).
-
-01 digit-words.
- 05 filler pic x(9) value "One".
- 05 filler pic x(9) value "Two".
- 05 filler pic x(9) value "Three".
- 05 filler pic x(9) value "Four".
- 05 filler pic x(9) value "Five".
- 05 filler pic x(9) value "Six".
- 05 filler pic x(9) value "Seven".
- 05 filler pic x(9) value "Eight".
- 05 filler pic x(9) value "Nine".
- 05 filler pic x(9) value "Ten".
- 05 filler pic x(9) value "Eleven".
- 05 filler pic x(9) value "Twelve".
- 05 filler pic x(9) value "Thirteen".
- 05 filler pic x(9) value "Fourteen".
- 05 filler pic x(9) value "Fifteen".
- 05 filler pic x(9) value "Sixteen".
- 05 filler pic x(9) value "Seventeen".
- 05 filler pic x(9) value "Eighteen".
- 05 filler pic x(9) value "Nineteen".
- 05 filler pic x(9) value spaces.
-
-01 digit-array redefines digit-words.
- 05 adigits occurs 20 times pic x(9).
-
-01 number-name pic x(15).
-
-01 stringified pic x(30).
-01 outline pic x(50).
-01 other-numbers.
- 03 n pic 999.
- 03 r pic 999.
-
-procedure division.
-100-main section.
-100-setup.
- perform varying counter from 99 by -1 until no-bottles-left
- move spaces to outline
- perform 100-show-number
- string stringified delimited by "|", space, "of beer on the wall" into outline end-string
- display outline end-display
- move spaces to outline
- string stringified delimited by "|", space, "of beer" into outline end-string
- display outline end-display
- move spaces to outline
- move "Take" to outline
- if one-bottle-left
- string outline delimited by space, space, "it" delimited by size, space, "|" into outline end-string
- else
- string outline delimited by space, space, "one" delimited by size, space, "|" into outline end-string
- end-if
- string outline delimited by "|", "down and pass it round" delimited by size into outline end-string
- display outline end-display
- move spaces to outline
- subtract 1 from counter giving counter end-subtract
- perform 100-show-number
- string stringified delimited by "|", space, "of beer on the wall" into outline end-string
- display outline end-display
- add 1 to counter giving counter end-add
- display space end-display
- end-perform.
- display "No more bottles of beer on the wall"
- display "No more bottles of beer"
- display "Go to the store and buy some more"
- display "Ninety-Nine bottles of beer on the wall"
- stop run.
-
-100-show-number.
- if no-bottles-left
- move "No more|" to stringified
- else
- if counter < 20
- string function trim( adigits( counter ) ), "|" into stringified
- else
- if counter < 100
- move spaces to number-name
- string atens( tens ) delimited by space, space delimited by size, adigits( digits ) delimited by space into number-name end-string
- move function trim( number-name) to stringified
- divide counter by 10 giving n remainder r end-divide
- if r not = zero
- inspect stringified replacing first space by "-"
- end-if
- inspect stringified replacing first space by "|"
- end-if
- end-if
- end-if.
- if one-bottle-left
- string stringified delimited by "|", space, "bottle|" delimited by size into stringified end-string
- else
- string stringified delimited by "|", space, "bottles|" delimited by size into stringified end-string
- end-if.
-
-100-end.
-end-program.
diff --git a/Task/99-bottles-of-beer/COBOL/99-bottles-of-beer-3.cobol b/Task/99-bottles-of-beer/COBOL/99-bottles-of-beer-3.cobol
deleted file mode 100644
index 6a73ccd099..0000000000
--- a/Task/99-bottles-of-beer/COBOL/99-bottles-of-beer-3.cobol
+++ /dev/null
@@ -1,16 +0,0 @@
-program-id. ninety-nine.
-data division.
-working-storage section.
-01 cnt pic 99.
-
-procedure division.
-
- perform varying cnt from 99 by -1 until cnt < 1
- display cnt " bottles of beer on the wall"
- display cnt " bottles of beer"
- display "Take one down, pass it around"
- subtract 1 from cnt
- display cnt " bottles of beer on the wall"
- add 1 to cnt
- display space
- end-perform.
diff --git a/Task/99-bottles-of-beer/Chapel/99-bottles-of-beer.chapel b/Task/99-bottles-of-beer/Chapel/99-bottles-of-beer.chapel
deleted file mode 100644
index b6e07cf851..0000000000
--- a/Task/99-bottles-of-beer/Chapel/99-bottles-of-beer.chapel
+++ /dev/null
@@ -1,68 +0,0 @@
-/***********************************************************************
- * Chapel implementation of "99 bottles of beer"
- *
- * by Brad Chamberlain and Steve Deitz
- * 07/13/2006 in Knoxville airport while waiting for flight home from
- * HPLS workshop
- * compiles and runs with chpl compiler version 1.7.0
- * for more information, contact: chapel_info@cray.com
- *
- *
- * Notes:
- * o as in all good parallel computations, boundary conditions
- * constitute the vast bulk of complexity in this code (invite Brad to
- * tell you about his zany boundary condition simplification scheme)
- * o uses type inference for variables, arguments
- * o relies on integer->string coercions
- * o uses named argument passing (for documentation purposes only)
- ***********************************************************************/
-
-// allow executable command-line specification of number of bottles
-// (e.g., ./a.out -snumBottles=999999)
-config const numBottles = 99;
-const numVerses = numBottles+1;
-
-// a domain to describe the space of lyrics
-var LyricsSpace: domain(1) = {1..numVerses};
-
-// array of lyrics
-var Lyrics: [LyricsSpace] string;
-
-// parallel computation of lyrics array
-[verse in LyricsSpace] Lyrics(verse) = computeLyric(verse);
-
-// as in any good parallel language, I/O to stdout is serialized.
-// (Note that I/O to a file could be parallelized using a parallel
-// prefix computation on the verse strings' lengths with file seeking)
-writeln(Lyrics);
-
-
-// HELPER FUNCTIONS:
-
-proc computeLyric(verseNum) {
- var bottleNum = numBottles - (verseNum - 1);
- var nextBottle = (bottleNum + numVerses - 1)%numVerses;
- return "\n" // disguise space used to separate elements in array I/O
- + describeBottles(bottleNum, startOfVerse=true) + " on the wall, "
- + describeBottles(bottleNum) + ".\n"
- + computeAction(bottleNum)
- + describeBottles(nextBottle) + " on the wall.\n";
-}
-
-
-proc describeBottles(bottleNum, startOfVerse:bool = false) {
-// NOTE: bool should not be necessary here (^^^^); working around bug
- var bottleDescription = if (bottleNum) then bottleNum:string
- else (if startOfVerse then "N"
- else "n")
- + "o more";
- return bottleDescription
- + " bottle" + (if (bottleNum == 1) then "" else "s")
- + " of beer";
-}
-
-
-proc computeAction(bottleNum) {
- return if (bottleNum == 0) then "Go to the store and buy some more, "
- else "Take one down and pass it around, ";
-}
diff --git a/Task/99-bottles-of-beer/EasyLang/99-bottles-of-beer.easy b/Task/99-bottles-of-beer/EasyLang/99-bottles-of-beer.easy
index f1f30f9082..deabe7c1be 100644
--- a/Task/99-bottles-of-beer/EasyLang/99-bottles-of-beer.easy
+++ b/Task/99-bottles-of-beer/EasyLang/99-bottles-of-beer.easy
@@ -1,18 +1,15 @@
func$ bottle num .
- if num = 1
- return "bottle"
- .
- return "bottles"
+ if num = 1 : return "1 bottle"
+ return num & " bottles"
.
-#
i = 99
repeat
- print i & " " & bottle i & " of beer on the wall"
- print i & " " & bottle i & " of beer"
+ print bottle i & " of beer on the wall"
+ print bottle i & " of beer"
print "Take one down, pass it around"
i -= 1
until i = 0
- print i & " " & bottle i & " of beer on the wall"
+ print bottle i & " of beer on the wall"
print ""
.
print "No more bottles of beer on the wall"
diff --git a/Task/99-bottles-of-beer/Elena/99-bottles-of-beer.elena b/Task/99-bottles-of-beer/Elena/99-bottles-of-beer.elena
index f80cd1b687..496eaa2e0c 100644
--- a/Task/99-bottles-of-beer/Elena/99-bottles-of-beer.elena
+++ b/Task/99-bottles-of-beer/Elena/99-bottles-of-beer.elena
@@ -27,7 +27,7 @@ extension bottleOp
};
}
-public program()
+public Program()
{
var bottles := 99;
diff --git a/Task/99-bottles-of-beer/Emacs-Lisp/99-bottles-of-beer.l b/Task/99-bottles-of-beer/Emacs-Lisp/99-bottles-of-beer.l
deleted file mode 100644
index 06de0487a8..0000000000
--- a/Task/99-bottles-of-beer/Emacs-Lisp/99-bottles-of-beer.l
+++ /dev/null
@@ -1,7 +0,0 @@
-(let ((i 99))
- (while (> i 0)
- (message "%d bottles of beer on the wall" i)
- (message "%d bottles of beer" i)
- (message "Take one down, pass it around")
- (message "%d bottles of beer on the wall" (1- i))
- (setq i (1- i))))
diff --git a/Task/99-bottles-of-beer/Euphoria/99-bottles-of-beer-1.ex b/Task/99-bottles-of-beer/Euphoria/99-bottles-of-beer-1.ex
deleted file mode 100644
index 1a39847370..0000000000
--- a/Task/99-bottles-of-beer/Euphoria/99-bottles-of-beer-1.ex
+++ /dev/null
@@ -1,28 +0,0 @@
-constant
- bottles = "bottles",
- bottle = "bottle"
-
-procedure beers (integer how_much)
- sequence word1 = bottles, word2 = bottles
- switch how_much do
- case 2 then
- word2 = bottle
- case 1 then
- word1 = bottle
- word2 = bottle
- end switch
-
- printf (1,
- "%d %s of beer on the wall \n" &
- "%d %s of beer \n" &
- "Take one down, and pass it around \n" &
- "%d %s of beer on the wall \n\n",
- { how_much, word1,
- how_much, word1,
- how_much-1, word2 }
- )
-end procedure
-
-for a = 99 to 1 by -1 do
- beers (a)
-end for
diff --git a/Task/99-bottles-of-beer/Euphoria/99-bottles-of-beer-2.ex b/Task/99-bottles-of-beer/Euphoria/99-bottles-of-beer-2.ex
deleted file mode 100644
index 87fadd640a..0000000000
--- a/Task/99-bottles-of-beer/Euphoria/99-bottles-of-beer-2.ex
+++ /dev/null
@@ -1,17 +0,0 @@
--- An alternate version
-
-include std/console.e
-
-sequence howmany = {"No more bottles","%d bottle","","s"}
-
-for beer = 99 to 1 by -1 do
- display(`
- [1] bottles of beer on the wall,
- [1] bottles of beer.
- Take one down, drink it right down,
- [2][3] of beer.
- `,{beer,
- sprintf(howmany[(beer>1)+1],beer-1),
- howmany[(beer>2)+3]
- })
-end for
diff --git a/Task/99-bottles-of-beer/Euphoria/99-bottles-of-beer-3.ex b/Task/99-bottles-of-beer/Euphoria/99-bottles-of-beer-3.ex
deleted file mode 100644
index 917a75b87b..0000000000
--- a/Task/99-bottles-of-beer/Euphoria/99-bottles-of-beer-3.ex
+++ /dev/null
@@ -1,20 +0,0 @@
--- yet another version:
-
-include std/console.e
-
-object stanza = {
-"[] bottles of beer on the wall,",
-"[] bottles of beer,",
-"take one down, and pass it around,"
-}
-
-object bottles = 99
-
-loop do
- display(stanza[1],bottles)
- display(stanza[2],bottles)
- display(stanza[3])
- bottles -= 1
- display(stanza[1]&"\n",{bottles})
-until bottles = 0
-end loop
diff --git a/Task/99-bottles-of-beer/Haxe/99-bottles-of-beer-1.haxe b/Task/99-bottles-of-beer/Haxe/99-bottles-of-beer-1.haxe
deleted file mode 100644
index 67fc36e3a6..0000000000
--- a/Task/99-bottles-of-beer/Haxe/99-bottles-of-beer-1.haxe
+++ /dev/null
@@ -1,33 +0,0 @@
-class RosettaDemo
-{
- static public function main()
- {
- singBottlesOfBeer(100);
- }
-
- static function singBottlesOfBeer(bottles : Int)
- {
- var plural : String = 's';
-
- while (bottles >= 1)
- {
- Sys.println(bottles + " bottle" + plural + " of beer on the wall,");
- Sys.println(bottles + " bottle" + plural + " of beer!");
- Sys.println("Take one down, pass it around,");
- if (bottles - 1 == 1)
- {
- plural = '';
- }
-
- if (bottles > 1)
- {
- Sys.println(bottles-1 + " bottle" + plural + " of beer on the wall!\n");
- }
- else
- {
- Sys.println("No more bottles of beer on the wall!");
- }
- bottles--;
- }
- }
-}
diff --git a/Task/99-bottles-of-beer/Haxe/99-bottles-of-beer-2.haxe b/Task/99-bottles-of-beer/Haxe/99-bottles-of-beer-2.haxe
deleted file mode 100644
index 7eefbfec58..0000000000
--- a/Task/99-bottles-of-beer/Haxe/99-bottles-of-beer-2.haxe
+++ /dev/null
@@ -1,33 +0,0 @@
-class Bottles {
-
- static public function main () : Void {
- singBottlesOfBeer(100);
- }
-
-
- macro static public function singBottlesOfBeer (bottles:Int) {
- var lines = [];
- var s : String = 's';
-
- var song : String = '';
- while( bottles >= 1 ){
- song += '$bottles bottle$s of beer on the wall,\n';
- song += '$bottles bottle$s of beer!\n';
- song += 'Take one down, pass it around,\n';
-
- bottles --;
-
- if( bottles > 1 ){
- song += '$bottles bottles of beer on the wall!\n\n';
- }else if( bottles == 1 ){
- s = '';
- song += '$bottles bottle of beer on the wall!\n\n';
- }else{
- song += 'No more bottles of beer on the wall!\n';
- }
- }
-
- return macro Sys.print($v{song});
- }
-
-}
diff --git a/Task/99-bottles-of-beer/REBOL/99-bottles-of-beer-1.rebol b/Task/99-bottles-of-beer/REBOL/99-bottles-of-beer-1.rebol
deleted file mode 100644
index cb2d53ca48..0000000000
--- a/Task/99-bottles-of-beer/REBOL/99-bottles-of-beer-1.rebol
+++ /dev/null
@@ -1,19 +0,0 @@
-rebol [
- Title: "99 Bottles of Beer"
- URL: http://rosettacode.org/wiki/99_Bottles_of_Beer
-]
-
-; The 'bottles' function maintains correct grammar.
-
-bottles: func [n /local b][
- b: either 1 = n ["bottle"]["bottles"]
- if 0 = n [n: "no"]
- reform [n b]
-]
-
-for n 99 1 -1 [print [
- bottles n "of beer on the wall" crlf
- bottles n "of beer" crlf
- "Take one down, pass it around" crlf
- bottles n - 1 "of beer on the wall" crlf
-]]
diff --git a/Task/99-bottles-of-beer/REBOL/99-bottles-of-beer-2.rebol b/Task/99-bottles-of-beer/REBOL/99-bottles-of-beer-2.rebol
deleted file mode 100644
index c18e5da9e0..0000000000
--- a/Task/99-bottles-of-beer/REBOL/99-bottles-of-beer-2.rebol
+++ /dev/null
@@ -1,9 +0,0 @@
-for i 99 1 -1 [
- x: rejoin [
- i b: " bottles of beer" o: " on the wall. " i b
- ". Take one down, pass it around. " (i - 1) b o "^/"
- ]
- r: :replace j: "bottles" k: "bottle"
- switch i [1 [r x j k r at x 10 j k r x "0" "No"] 2 [r at x 40 j k]]
- print x
-] halt
diff --git a/Task/99-bottles-of-beer/REBOL/99-bottles-of-beer-3.rebol b/Task/99-bottles-of-beer/REBOL/99-bottles-of-beer-3.rebol
deleted file mode 100644
index 700b665832..0000000000
--- a/Task/99-bottles-of-beer/REBOL/99-bottles-of-beer-3.rebol
+++ /dev/null
@@ -1 +0,0 @@
-for i 99 1 -1[print rejoin[i b:" bottles of beer"o:" on the wall. "i b". Take one down, pass it around. "(i - 1)b o"^/"]]
diff --git a/Task/99-bottles-of-beer/YAMLScript/99-bottles-of-beer-1.ys b/Task/99-bottles-of-beer/YAMLScript/99-bottles-of-beer-1.ys
index 5dc37d24c9..30910edf41 100644
--- a/Task/99-bottles-of-beer/YAMLScript/99-bottles-of-beer-1.ys
+++ b/Task/99-bottles-of-beer/YAMLScript/99-bottles-of-beer-1.ys
@@ -1,4 +1,4 @@
-!YS-v0
+!ys-0
defn main(number=99):
each num (number .. 1):
diff --git a/Task/A+B/11l/a+b.11l b/Task/A+B/11l/a+b.11l
index 2eea3c99c2..fada22ecf1 100644
--- a/Task/A+B/11l/a+b.11l
+++ b/Task/A+B/11l/a+b.11l
@@ -1 +1 @@
-print(sum(input().split(‘ ’, group_delimiters' 1B).map(i -> Int(i))))
+print(sum(input().split(‘ ’, group_delimiters' 1B).map(Int)))
diff --git a/Task/A+B/Ada/a+b-1.ada b/Task/A+B/Ada/a+b-1.ada
deleted file mode 100644
index e3b3a1d3b7..0000000000
--- a/Task/A+B/Ada/a+b-1.ada
+++ /dev/null
@@ -1,10 +0,0 @@
--- Standard I/O Streams
-
-with Ada.Integer_Text_Io;
-procedure APlusB is
- A, B : Integer;
-begin
- Ada.Integer_Text_Io.Get (Item => A);
- Ada.Integer_Text_Io.Get (Item => B);
- Ada.Integer_Text_Io.Put (A+B);
-end APlusB;
diff --git a/Task/A+B/Ada/a+b-2.ada b/Task/A+B/Ada/a+b-2.ada
deleted file mode 100644
index b38ce0b316..0000000000
--- a/Task/A+B/Ada/a+b-2.ada
+++ /dev/null
@@ -1,12 +0,0 @@
-with Ada.Text_IO;
-
-procedure A_Plus_B is
- type Small_Integers is range -2_000 .. +2_000;
- subtype Input_Values is Small_Integers range -1_000 .. +1_000;
- package IO is new Ada.Text_IO.Integer_IO (Num => Small_Integers);
- A, B : Input_Values;
-begin
- IO.Get (A);
- IO.Get (B);
- IO.Put (A + B, Width => 4, Base => 10);
-end A_Plus_B;
diff --git a/Task/A+B/AutoIt/a+b-1.autoit b/Task/A+B/AutoIt/a+b-1.autoit
deleted file mode 100644
index 120e568c0a..0000000000
--- a/Task/A+B/AutoIt/a+b-1.autoit
+++ /dev/null
@@ -1,7 +0,0 @@
-;AutoIt Version: 3.2.10.0
-$num = "45 54"
-consolewrite ("Sum of " & $num & " is: " & sum($num))
-Func sum($numbers)
- $numm = StringSplit($numbers," ")
- Return $numm[1]+$numm[$numm[0]]
-EndFunc
diff --git a/Task/A+B/AutoIt/a+b-2.autoit b/Task/A+B/AutoIt/a+b-2.autoit
deleted file mode 100644
index bb6bfba619..0000000000
--- a/Task/A+B/AutoIt/a+b-2.autoit
+++ /dev/null
@@ -1,22 +0,0 @@
-ConsoleWrite("# A+B:" & @CRLF)
-
-Func Sum($inp)
- Local $num = StringSplit($inp, " "), $sum = 0
- For $i = 1 To $num[0]
-;~ ConsoleWrite("# num["&$i&"]:" & $num[$i] & @CRLF) ;;
- $sum = $sum + $num[$i]
- Next
- Return $sum
-EndFunc ;==>Sum
-
-$inp = "17 4"
-$res = Sum($inp)
-ConsoleWrite($inp & " --> " & $res & @CRLF)
-
-$inp = "999 42 -999"
-ConsoleWrite($inp & " --> " & Sum($inp) & @CRLF)
-
-; In calculations, text counts as 0,
-; so the program works correctly even with this input:
-Local $inp = "999x y 42 -999", $res = Sum($inp)
-ConsoleWrite($inp & " --> " & $res & @CRLF)
diff --git a/Task/A+B/Batch-File/a+b-3.bat b/Task/A+B/Batch-File/a+b-3.bat
index f89aab8525..46420dac6d 100644
--- a/Task/A+B/Batch-File/a+b-3.bat
+++ b/Task/A+B/Batch-File/a+b-3.bat
@@ -1,6 +1 @@
-::aplusb.cmd
-@echo off
-setlocal
-set /a c=%~1
-echo %c%
-endlocal
+doskey add=setlocal^& set a=$1^& set b=$2^& set /a res=a+b^& endlocal
diff --git a/Task/A+B/COBOL/a+b-1.cobol b/Task/A+B/COBOL/a+b-1.cobol
deleted file mode 100644
index 48ce2239b2..0000000000
--- a/Task/A+B/COBOL/a+b-1.cobol
+++ /dev/null
@@ -1,20 +0,0 @@
- IDENTIFICATION DIVISION.
- PROGRAM-ID. A-Plus-B.
-
- DATA DIVISION.
- WORKING-STORAGE SECTION.
- 01 A PIC S9(5).
- 01 B PIC S9(5).
-
- 01 A-B-Sum PIC S9(5).
-
- PROCEDURE DIVISION.
- ACCEPT A
- ACCEPT B
-
- ADD A TO B GIVING A-B-Sum
-
- DISPLAY A-B-Sum
-
- GOBACK
- .
diff --git a/Task/A+B/COBOL/a+b-2.cobol b/Task/A+B/COBOL/a+b-2.cobol
deleted file mode 100644
index bc62e7f35e..0000000000
--- a/Task/A+B/COBOL/a+b-2.cobol
+++ /dev/null
@@ -1,38 +0,0 @@
- IDENTIFICATION DIVISION.
- PROGRAM-ID. A-Plus-B.
- AUTHOR. Bill Gunshannon.
- INSTALLATION. Home.
- DATE-WRITTEN. 25 December 2021.
- ************************************************************
- ** Program Abstract:
- ** A re-worked version that more closely matches the
- ** desired format. Both numbers are taken in on one
- ** line separated by spaces. Sum is formated to remove
- ** leading zeros and/or spaces.
- ************************************************************
-
-
- DATA DIVISION.
- WORKING-STORAGE SECTION.
- 01 Input-Data PIC X(16).
- 01 A PIC S9(5).
- 01 B PIC S9(5).
-
- 01 A-B-Sum PIC -----9.
-
- PROCEDURE DIVISION.
- DISPLAY "Input pairs of numbers separated by spaces."
- DISPLAY "Enter q to exit."
- PERFORM WITH TEST BEFORE
- UNTIL Input-Data = "q" or Input-Data = "Q"
- ACCEPT Input-Data
- IF Input-Data NOT = "q" and Input-Data NOT = "Q"
- UNSTRING Input-Data DELIMITED BY SPACES
- INTO A B
- ADD A TO B GIVING A-B-Sum
-
- DISPLAY "Sum = " FUNCTION TRIM(A-B-Sum)
- END-IF
- END-PERFORM.
-
- STOP RUN.
diff --git a/Task/A+B/Elena/a+b-1.elena b/Task/A+B/Elena/a+b-1.elena
index afa03ef6c5..d585433b10 100644
--- a/Task/A+B/Elena/a+b-1.elena
+++ b/Task/A+B/Elena/a+b-1.elena
@@ -1,6 +1,6 @@
import extensions;
-public program()
+public Program()
{
var A := Integer.new();
var B := Integer.new();
diff --git a/Task/A+B/Elena/a+b-2.elena b/Task/A+B/Elena/a+b-2.elena
index b79d01d958..a1042363c6 100644
--- a/Task/A+B/Elena/a+b-2.elena
+++ b/Task/A+B/Elena/a+b-2.elena
@@ -1,7 +1,7 @@
import system'routines;
import extensions;
-public program()
+public Program()
{
Console.printLine(Console.readLine()
.split()
diff --git a/Task/A+B/Emacs-Lisp/a+b.l b/Task/A+B/Emacs-Lisp/a+b.l
deleted file mode 100644
index af2bf33f16..0000000000
--- a/Task/A+B/Emacs-Lisp/a+b.l
+++ /dev/null
@@ -1,5 +0,0 @@
-(let* ((input (read-from-minibuffer ""))
- (numbers (mapcar #'string-to-number (split-string input)))
- (a (car numbers))
- (b (cadr numbers)))
- (message "%d" (+ a b)))
diff --git a/Task/A+B/Euphoria/a+b.ex b/Task/A+B/Euphoria/a+b.ex
deleted file mode 100644
index d757131d03..0000000000
--- a/Task/A+B/Euphoria/a+b.ex
+++ /dev/null
@@ -1,12 +0,0 @@
-include get.e
-
-function snd(sequence s)
- return s[2]
-end function
-
-integer a,b
-
-a = snd(get(0))
-b = snd(get(0))
-
-printf(1," %d\n",a+b)
diff --git a/Task/A+B/PowerShell/a+b-1.psh b/Task/A+B/PowerShell/a+b-1.psh
deleted file mode 100644
index 71016e0aaa..0000000000
--- a/Task/A+B/PowerShell/a+b-1.psh
+++ /dev/null
@@ -1,2 +0,0 @@
-$a,$b = -split "$input"
-[int]$a + [int]$b
diff --git a/Task/A+B/PowerShell/a+b-2.psh b/Task/A+B/PowerShell/a+b-2.psh
deleted file mode 100644
index 52eff18595..0000000000
--- a/Task/A+B/PowerShell/a+b-2.psh
+++ /dev/null
@@ -1,2 +0,0 @@
-$a,$b = -split (Read-Host)
-[int]$a + [int]$b
diff --git a/Task/A+B/PowerShell/a+b-3.psh b/Task/A+B/PowerShell/a+b-3.psh
deleted file mode 100644
index a2139f6c26..0000000000
--- a/Task/A+B/PowerShell/a+b-3.psh
+++ /dev/null
@@ -1,3 +0,0 @@
-filter add {
- return [int]$args[0] + [int]$args[1]
-}
diff --git a/Task/A+B/PowerShell/a+b-4.psh b/Task/A+B/PowerShell/a+b-4.psh
deleted file mode 100644
index 04adb7b18a..0000000000
--- a/Task/A+B/PowerShell/a+b-4.psh
+++ /dev/null
@@ -1 +0,0 @@
-add 2 3
diff --git a/Task/A+B/REBOL/a+b.rebol b/Task/A+B/REBOL/a+b.rebol
deleted file mode 100644
index 003613d500..0000000000
--- a/Task/A+B/REBOL/a+b.rebol
+++ /dev/null
@@ -1 +0,0 @@
-forever [x: load input print x/1 + x/2]
diff --git a/Task/A+B/REXX/a+b.rexx b/Task/A+B/REXX/a+b.rexx
index 928b14cfbb..787c3a6be7 100644
--- a/Task/A+B/REXX/a+b.rexx
+++ b/Task/A+B/REXX/a+b.rexx
@@ -1,5 +1,5 @@
--- 1 Jun 2025
-include Settings
+-- 23 Aug 2025
+include Setting
say 'A+B'
say version
diff --git a/Task/A+B/VBScript/a+b-1.vb b/Task/A+B/VBScript/a+b-1.vb
deleted file mode 100644
index 70ec9e210e..0000000000
--- a/Task/A+B/VBScript/a+b-1.vb
+++ /dev/null
@@ -1,6 +0,0 @@
-s=InputBox("Enter two numbers separated by a blank")
-t=Split(s)
-a=CInt(t(0))
-b=CInt(t(1))
-c=a+b
-MsgBox c
diff --git a/Task/A+B/VBScript/a+b-2.vb b/Task/A+B/VBScript/a+b-2.vb
deleted file mode 100644
index 08f40b34e4..0000000000
--- a/Task/A+B/VBScript/a+b-2.vb
+++ /dev/null
@@ -1,37 +0,0 @@
-Option Explicit
-Dim a, b
-Select Case WScript.Arguments.Count
- Case 0 'No arguments, prompt for them.
- WScript.Echo "Enter values for a and b"
- a = WScript.Stdin.ReadLine
- if Instr(a, " ") > 0 then 'If two variables were passed
- b = Split(a)(1)
- a = Split(a)(0)
- else
- WScript.Echo "Enter value for b"
- b = WScript.Stdin.ReadLine
- end if
- Case 1 'One argument, assume it's an input file, e.g. "in.txt"
- Dim FSO : Set FSO = CreateObject("Scripting.FileSystemObject")
- With FSO.OpenTextFile(WScript.Arguments(0), 1)
- a = .ReadLine
- b = Split(a)(1)
- a = Split(a)(0)
- .Close
- End With
- Case 2 'Two arguments, assume they are values
- a = WScript.Arguments(0)
- b = WScript.Arguments(1)
-End Select
-'At this point, a and b are strings as entered, make them numbers
-a = CInt(a)
-b = CInt(b)
-
-'Write the sum
-Wscript.Echo a + b
-if 1 = WScript.Arguments.Count then
- With FSO.CreateTextFile("out.txt")
- .WriteLine a + b
- .Close
- End With
-end if
diff --git a/Task/A+B/VHDL/a+b.vhdl b/Task/A+B/VHDL/a+b.vhdl
deleted file mode 100644
index 5eea2b5c05..0000000000
--- a/Task/A+B/VHDL/a+b.vhdl
+++ /dev/null
@@ -1,23 +0,0 @@
-LIBRARY std;
-USE std.TEXTIO.all;
-
-
-entity test is
-end entity test;
-
-
-architecture beh of test is
-begin
- process
- variable line_in, line_out : line;
- variable a,b : integer;
- begin
- readline(INPUT, line_in);
- read(line_in, a);
- read(line_in, b);
-
- write(line_out, a+b);
- writeline(OUTPUT, line_out);
- wait; -- needed to stop the execution
- end process;
-end architecture beh;
diff --git a/Task/ABC-problem/8080-Assembly/abc-problem.8080 b/Task/ABC-problem/8080-Assembly/abc-problem.8080
index e6c7c4d5f4..1c9a496782 100644
--- a/Task/ABC-problem/8080-Assembly/abc-problem.8080
+++ b/Task/ABC-problem/8080-Assembly/abc-problem.8080
@@ -1,77 +1,77 @@
- org 100h
- jmp test
- ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
- ;;; Subroutine 'blocks': takes a $-terminated string in
- ;;; DE containing a word, and checks whether it can be
- ;;; written with the blocks.
- ;;; Returns: carry flag set if word is accepted.
- ;;; Uses registers: A, B, D, E, H, L
-blocks: push d ; Store string pointer
- lxi h,blockslist ; At the start, all blocks are
- lxi d,blocksavail ; available
- mvi b,40
-blocksinit: mov a,m
- stax d
- inx h
- inx d
- dcr b
- jnz blocksinit
- pop d ; Restore string pointer
-blockschar: ldax d ; Get current character
- cpi '$' ; End of string?
- stc ; Set carry flag (accept string)
- rz ; And then we're done
- ani 0DFh ; Make uppercase
- lxi h,blocksavail ; Is it available?
- mvi b,40
-blockscheck: cmp m
- jz blocksaccept ; Yes, we found it
- inx h ; Try next available char
- dcr b
- jnz blockscheck
- ana a ; Char unavailable, clear
- ret ; carry and stop.
-blocksaccept: mvi m,0 ; We've now used this char
- mov a,l ; And its blockmate
- xri 1
- mov l,a
- mvi m,0
- inx d ; Try next char in string
- jmp blockschar
- ;; Note: 'blocksavail' must not cross page boundary
-blockslist: db 'BOXKDQCPNAGTRETGQDFSJWHUVIANOBERFSLYPCZM'
-blocksavail: ds 40
- ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
- ;;; Test code: run the subroutine on the given words.
-test: lxi h,words
-doword: mov e,m ; Get pointer to next word
- inx h
- mov d,m
- inx h
- mov a,e ; If zero, end of word list
- ora d
- rz
- push h ; Save pointer to list
- push d ; Save pointer to word
- mvi c,9 ; Write word to console
- call 5
- pop d ; Retrieve word ponter
- call blocks ; Run the 'blocks' routine
- lxi d,yes ; Say 'yes',
- jc yesno ; if the carry is set.
- lxi d,no ; Otherwise, say 'no'.
-yesno: mvi c,9
- call 5
- pop h ; Restore list pointer
- jmp doword ; Do next word
-yes: db ': Yes',13,10,'$'
-no: db ': No',13,10,'$'
-words: dw wrda,wrdbark,wrdbook,wrdtreat,wrdcommon
- dw wrdsquad,wrdconfuse,0
-wrda: db 'A$'
-wrdbark: db 'BARK$'
-wrdbook: db 'BOOK$'
-wrdtreat: db 'TREAT$'
-wrdcommon: db 'COMMON$'
-wrdsquad: db 'SQUAD$'
-wrdconfuse: db 'CONFUSE$'
+ org 100h
+ jmp test
+ ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+ ;;; Subroutine 'blocks': takes a $-terminated string in
+ ;;; DE containing a word, and checks whether it can be
+ ;;; written with the blocks.
+ ;;; Returns: carry flag set if word is accepted.
+ ;;; Uses registers: A, B, D, E, H, L
+blocks: push d ; Store string pointer
+ lxi h,blockslist ; At the start, all blocks are
+ lxi d,blocksavail ; available
+ mvi b,40
+blocksinit: mov a,m
+ stax d
+ inx h
+ inx d
+ dcr b
+ jnz blocksinit
+ pop d ; Restore string pointer
+blockschar: ldax d ; Get current character
+ cpi '$' ; End of string?
+ stc ; Set carry flag (accept string)
+ rz ; And then we're done
+ ani 0DFh ; Make uppercase
+ lxi h,blocksavail ; Is it available?
+ mvi b,40
+blockscheck: cmp m
+ jz blocksaccept ; Yes, we found it
+ inx h ; Try next available char
+ dcr b
+ jnz blockscheck
+ ana a ; Char unavailable, clear
+ ret ; carry and stop.
+blocksaccept: mvi m,0 ; We've now used this char
+ mov a,l ; And its blockmate
+ xri 1
+ mov l,a
+ mvi m,0
+ inx d ; Try next char in string
+ jmp blockschar
+ ;; Note: 'blocksavail' must not cross page boundary
+blockslist: db 'BOXKDQCPNAGTRETGQDFSJWHUVIANOBERFSLYPCZM'
+blocksavail: ds 40
+ ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+ ;;; Test code: run the subroutine on the given words.
+test: lxi h,words
+doword: mov e,m ; Get pointer to next word
+ inx h
+ mov d,m
+ inx h
+ mov a,e ; If zero, end of word list
+ ora d
+ rz
+ push h ; Save pointer to list
+ push d ; Save pointer to word
+ mvi c,9 ; Write word to console
+ call 5
+ pop d ; Retrieve word ponter
+ call blocks ; Run the 'blocks' routine
+ lxi d,yes ; Say 'yes',
+ jc yesno ; if the carry is set.
+ lxi d,no ; Otherwise, say 'no'.
+yesno: mvi c,9
+ call 5
+ pop h ; Restore list pointer
+ jmp doword ; Do next word
+yes: db ': Yes',13,10,'$'
+no: db ': No',13,10,'$'
+words: dw wrda,wrdbark,wrdbook,wrdtreat,wrdcommon
+ dw wrdsquad,wrdconfuse,0
+wrda: db 'A$'
+wrdbark: db 'BARK$'
+wrdbook: db 'BOOK$'
+wrdtreat: db 'TREAT$'
+wrdcommon: db 'COMMON$'
+wrdsquad: db 'SQUAD$'
+wrdconfuse: db 'CONFUSE$'
diff --git a/Task/ABC-problem/8086-Assembly/abc-problem.8086 b/Task/ABC-problem/8086-Assembly/abc-problem.8086
index ca056dc17a..260f99738a 100644
--- a/Task/ABC-problem/8086-Assembly/abc-problem.8086
+++ b/Task/ABC-problem/8086-Assembly/abc-problem.8086
@@ -1,63 +1,63 @@
- cpu 8086
- bits 16
- org 100h
-section .text
- jmp demo
- ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
- ;;; Subroutine "blocks": see if the $-terminated string in DS:BX
- ;;; can be written with the blocks.
- ;;; Returns: carry flag set if word is accepted.
- ;;; Uses registers: AL, BX, CX, SI, DI
- ;;; Assumes CS=DS=ES
-blocks: mov si,.list ; Set all blocks available
- mov di,.avail
- mov cx,20
- rep movsw
-.char: mov al,[bx] ; Get current character
- inc bx
- cmp al,'$' ; Are we at the end?
- je .ok ; Then the string is accepted
- mov cx,40 ; If not, check if block is available
- mov di,.avail
- repne scasb
- test cx,cx ; This clears the carry flag
- jz .out ; If zero, block is not available
- dec di ; Zero out the block we found
- mov [di],ch ; CH is guaranteed 0 here
- xor di,1 ; Point at other character on block
- mov [di],ch ; Zero out that one too.
- jmp .char
-.ok: stc
-.out: ret
-.list: db 'BOXKDQCPNAGTRETGQDFSJWHUVIANOBERFSLYPCZM'
-.avail: db ' '
- ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
- ;;; Test code: run the subroutine on the given words
-demo: mov bp,words
-wrd: mov dx,[bp] ; Get word
- test dx,dx ; End of words?
- jz stop
- mov ah,9 ; Print word
- int 21h
- mov bx,dx ; Run subroutine
- call blocks
- mov dx,yes ; Print yes or no depending on carry
- jc print
- mov dx,no
-print: mov ah,9
- int 21h
- inc bp
- inc bp
- jmp wrd
-stop: ret
-section .data
-yes: db ': Yes',13,10,'$'
-no: db ': No',13,10,'$'
-words: dw .a,.bark,.book,.treat,.cmn,.squad,.confs,0
-.a: db 'A$'
-.bark: db 'BARK$'
-.book: db 'BOOK$'
-.treat: db 'TREAT$'
-.cmn: db 'COMMON$'
-.squad: db 'SQUAD$'
-.confs: db 'CONFUSE$'
+ cpu 8086
+ bits 16
+ org 100h
+section .text
+ jmp demo
+ ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+ ;;; Subroutine "blocks": see if the $-terminated string in DS:BX
+ ;;; can be written with the blocks.
+ ;;; Returns: carry flag set if word is accepted.
+ ;;; Uses registers: AL, BX, CX, SI, DI
+ ;;; Assumes CS=DS=ES
+blocks: mov si,.list ; Set all blocks available
+ mov di,.avail
+ mov cx,20
+ rep movsw
+.char: mov al,[bx] ; Get current character
+ inc bx
+ cmp al,'$' ; Are we at the end?
+ je .ok ; Then the string is accepted
+ mov cx,40 ; If not, check if block is available
+ mov di,.avail
+ repne scasb
+ test cx,cx ; This clears the carry flag
+ jz .out ; If zero, block is not available
+ dec di ; Zero out the block we found
+ mov [di],ch ; CH is guaranteed 0 here
+ xor di,1 ; Point at other character on block
+ mov [di],ch ; Zero out that one too.
+ jmp .char
+.ok: stc
+.out: ret
+.list: db 'BOXKDQCPNAGTRETGQDFSJWHUVIANOBERFSLYPCZM'
+.avail: db ' '
+ ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+ ;;; Test code: run the subroutine on the given words
+demo: mov bp,words
+wrd: mov dx,[bp] ; Get word
+ test dx,dx ; End of words?
+ jz stop
+ mov ah,9 ; Print word
+ int 21h
+ mov bx,dx ; Run subroutine
+ call blocks
+ mov dx,yes ; Print yes or no depending on carry
+ jc print
+ mov dx,no
+print: mov ah,9
+ int 21h
+ inc bp
+ inc bp
+ jmp wrd
+stop: ret
+section .data
+yes: db ': Yes',13,10,'$'
+no: db ': No',13,10,'$'
+words: dw .a,.bark,.book,.treat,.cmn,.squad,.confs,0
+.a: db 'A$'
+.bark: db 'BARK$'
+.book: db 'BOOK$'
+.treat: db 'TREAT$'
+.cmn: db 'COMMON$'
+.squad: db 'SQUAD$'
+.confs: db 'CONFUSE$'
diff --git a/Task/ABC-problem/8th/abc-problem.8th b/Task/ABC-problem/8th/abc-problem.8th
index f5b7f80c51..6869fcd656 100644
--- a/Task/ABC-problem/8th/abc-problem.8th
+++ b/Task/ABC-problem/8th/abc-problem.8th
@@ -171,8 +171,8 @@ var ix
' chkokpath s:each \ | path
rdrop \
success @ \ success
- if \
- break \
+ if \
+ break \
then
;
diff --git a/Task/ABC-problem/Ada/abc-problem.ada b/Task/ABC-problem/Ada/abc-problem.ada
deleted file mode 100644
index 28ac345566..0000000000
--- a/Task/ABC-problem/Ada/abc-problem.ada
+++ /dev/null
@@ -1,78 +0,0 @@
-with Ada.Characters.Handling;
-use Ada.Characters.Handling;
-
-
-package Abc is
- type Block_Faces is array(1..2) of Character;
- type Block_List is array(positive range <>) of Block_Faces;
- function Can_Make_Word(W: String; Blocks: Block_List) return Boolean;
-end Abc;
-
-
-package body Abc is
-
-function Can_Make_Word(W: String; Blocks: Block_List) return Boolean is
- Used : array(Blocks'Range) of Boolean := (Others => False);
- subtype wIndex is Integer range W'First..W'Last;
- wPos : wIndex;
-begin
- if W'Length = 0 then
- return True;
- end if;
- wPos := W'First;
- while True loop
- declare
- C : Character := To_Upper(W(wPos));
- X : constant wIndex := wPos;
- begin
- for I in Blocks'Range loop
- if (not Used(I)) then
- if C = To_Upper(Blocks(I)(1)) or C = To_Upper(Blocks(I)(2)) then
- Used(I) := True;
- if wPos = W'Last then
- return True;
- end if;
- wPos := wIndex'Succ(wPos);
- exit;
- end if;
- end if;
- end loop;
- if X = wPos then
- return False;
- end if;
- end;
- end loop;
- return False;
-end Can_Make_Word;
-
-end Abc;
-
-with Ada.Text_IO, Ada.Strings.Unbounded, Abc;
-use Ada.Text_IO, Ada.Strings.Unbounded, Abc;
-
-procedure Abc_Problem is
- Blocks : Block_List := (
- ('B','O'), ('X','K'), ('D','Q'), ('C','P')
- , ('N','A'), ('G','T'), ('R','E'), ('T','G')
- , ('Q','D'), ('F','S'), ('J','W'), ('H','U')
- , ('V','I'), ('A','N'), ('O','B'), ('E','R')
- , ('F','S'), ('L','Y'), ('P','C'), ('Z','M')
- );
- function "+" (S : String) return Unbounded_String renames To_Unbounded_String;
- words : array(positive range <>) of Unbounded_String := (
- +"A"
- , +"BARK"
- , +"BOOK"
- , +"TREAT"
- , +"COMMON"
- , +"SQUAD"
- , +"CONFUSE"
- -- Border cases:
- -- , +"CONFUSE2"
- -- , +""
- );
-begin
- for I in words'Range loop
- Put_Line ( To_String(words(I)) & ": " & Boolean'Image(Can_Make_Word(To_String(words(I)),Blocks)) );
- end loop;
-end Abc_Problem;
diff --git a/Task/ABC-problem/Arturo/abc-problem.arturo b/Task/ABC-problem/Arturo/abc-problem.arturo
index 7ec68fd2ef..5365095039 100644
--- a/Task/ABC-problem/Arturo/abc-problem.arturo
+++ b/Task/ABC-problem/Arturo/abc-problem.arturo
@@ -16,8 +16,8 @@ canMakeWord?: function [wrd][
ref: new blocks
loop split wrd 'chr [
cib: charInBlock chr ref
- if? cib = ø [ return false ]
- else [ ref: remove ref .index cib ]
+ switch cib = ø [ return false ]
+ [ ref: remove ref .index cib ]
]
return true
]
diff --git a/Task/ABC-problem/AutoHotkey/abc-problem-1.ahk b/Task/ABC-problem/AutoHotkey/abc-problem-1.ahk
index 448f692c2b..d92688964d 100644
--- a/Task/ABC-problem/AutoHotkey/abc-problem-1.ahk
+++ b/Task/ABC-problem/AutoHotkey/abc-problem-1.ahk
@@ -1,24 +1,24 @@
isWordPossible(blocks, word){
- o := {}
- loop, parse, blocks, `n, `r
- o.Insert(A_LoopField)
- loop, parse, word
- if !(r := isWordPossible_contains(o, A_LoopField, word))
- return 0
- return 1
+ o := {}
+ loop, parse, blocks, `n, `r
+ o.Insert(A_LoopField)
+ loop, parse, word
+ if !(r := isWordPossible_contains(o, A_LoopField, word))
+ return 0
+ return 1
}
isWordPossible_contains(byref o, letter, word){
- loop 2 {
- for k,v in o
- if Instr(v,letter)
- {
- StringReplace, op, v,% letter
- if RegExMatch(op, "[" word "]")
- sap := k
- else added := 1 , sap := k
- if added
- return "1" o.remove(sap)
- }
- added := 1
- }
+ loop 2 {
+ for k,v in o
+ if Instr(v,letter)
+ {
+ StringReplace, op, v,% letter
+ if RegExMatch(op, "[" word "]")
+ sap := k
+ else added := 1 , sap := k
+ if added
+ return "1" o.remove(sap)
+ }
+ added := 1
+ }
}
diff --git a/Task/ABC-problem/AutoHotkey/abc-problem-2.ahk b/Task/ABC-problem/AutoHotkey/abc-problem-2.ahk
index dff93522ac..c68d69b1f4 100644
--- a/Task/ABC-problem/AutoHotkey/abc-problem-2.ahk
+++ b/Task/ABC-problem/AutoHotkey/abc-problem-2.ahk
@@ -34,5 +34,5 @@ CONFUSE
)"
loop, parse, wordlist, `n
- out .= A_LoopField " - " isWordPossible(blocks, A_LoopField) "`n"
+ out .= A_LoopField " - " isWordPossible(blocks, A_LoopField) "`n"
msgbox % out
diff --git a/Task/ABC-problem/BASIC256/abc-problem.basic b/Task/ABC-problem/BASIC256/abc-problem.basic
index e448382b74..9458ea9532 100644
--- a/Task/ABC-problem/BASIC256/abc-problem.basic
+++ b/Task/ABC-problem/BASIC256/abc-problem.basic
@@ -5,42 +5,42 @@ b = int((length(blocks$) /3) + 1)
dim blk$(b)
for i = 1 to length(makeWord$)
- wrd$ = word$(makeWord$,i,",")
- dim hit(b)
- n = 0
- if wrd$ = "" then exit for
- for k = 1 to length(wrd$)
- w$ = upper(mid(wrd$,k,1))
- for j = 1 to b
- if hit[j] = 0 then
- if w$ = left(word$(blocks$,j,","),1) or w$ = right(word$(blocks$,j,","),1) then
- hit[j] = 1
- n += 1
- exit for
- end if
- end if
- next j
- next k
- print wrd$; chr(9);
- if n = length(wrd$) then print " True" else print " False"
+ wrd$ = word$(makeWord$,i,",")
+ dim hit(b)
+ n = 0
+ if wrd$ = "" then exit for
+ for k = 1 to length(wrd$)
+ w$ = upper(mid(wrd$,k,1))
+ for j = 1 to b
+ if hit[j] = 0 then
+ if w$ = left(word$(blocks$,j,","),1) or w$ = right(word$(blocks$,j,","),1) then
+ hit[j] = 1
+ n += 1
+ exit for
+ end if
+ end if
+ next j
+ next k
+ print wrd$; chr(9);
+ if n = length(wrd$) then print " True" else print " False"
next i
end
function word$(sr$, wn, delim$)
- j = wn
- if j = 0 then j += 1
- res$ = "" : s$ = sr$ : d$ = delim$
- if d$ = "" then d$ = " "
- sd = length(d$) : sl = length(s$)
- while true
- n = instr(s$,d$) : j -= 1
- if j = 0 then
- if n = 0 then res$ = s$ else res$ = mid(s$,1,n-1)
- return res$
- end if
- if n = 0 then return res$
- if n = sl - sd then res$ = "" : return res$
- sl2 = sl-n : s$ = mid(s$,n+1,sl2) : sl = sl2
- end while
- return res$
+ j = wn
+ if j = 0 then j += 1
+ res$ = "" : s$ = sr$ : d$ = delim$
+ if d$ = "" then d$ = " "
+ sd = length(d$) : sl = length(s$)
+ while true
+ n = instr(s$,d$) : j -= 1
+ if j = 0 then
+ if n = 0 then res$ = s$ else res$ = mid(s$,1,n-1)
+ return res$
+ end if
+ if n = 0 then return res$
+ if n = sl - sd then res$ = "" : return res$
+ sl2 = sl-n : s$ = mid(s$,n+1,sl2) : sl = sl2
+ end while
+ return res$
end function
diff --git a/Task/ABC-problem/Ballerina/abc-problem.ballerina b/Task/ABC-problem/Ballerina/abc-problem.ballerina
index 0428dff997..6210e2d24b 100644
--- a/Task/ABC-problem/Ballerina/abc-problem.ballerina
+++ b/Task/ABC-problem/Ballerina/abc-problem.ballerina
@@ -3,7 +3,7 @@ import ballerina/io;
function r(string word, string[] bl) returns boolean {
if word == "" { return true; }
int c = word[0].toBytes()[0] | 32;
- foreach int i in 0.. blocks =
- new List() { "bo", "xk", "dq", "cp", "na", "gt", "re", "tg", "qd", "fs",
- "jw", "hu", "vi", "an", "ob", "er", "fs", "ly", "pc", "zm" };
- List words = new List() {
- "A", "BARK", "BOOK", "TREAT", "COMMON", "SQUAD", "CONFUSE"};
-
- var solver = new ABC(blocks);
-
- foreach( var word in words)
- {
- Console.WriteLine("{0} :{1}", word, solver.CanMake(word));
- }
+ List blocks =
+ new List() { "bo", "xk", "dq", "cp", "na", "gt", "re", "tg", "qd", "fs",
+ "jw", "hu", "vi", "an", "ob", "er", "fs", "ly", "pc", "zm" };
+ List words = new List() {
+ "A", "BARK", "BOOK", "TREAT", "COMMON", "SQUAD", "CONFUSE"};
+
+ var solver = new ABC(blocks);
+
+ foreach( var word in words)
+ {
+ Console.WriteLine("{0} :{1}", word, solver.CanMake(word));
+ }
}
class ABC
{
- readonly Dictionary> _blockDict = new Dictionary>();
- bool[] _used;
- int _nextBlock;
+ readonly Dictionary> _blockDict = new Dictionary>();
+ bool[] _used;
+ int _nextBlock;
- readonly List _blocks;
+ readonly List _blocks;
- private void AddBlockChar(char c)
- {
- if (!_blockDict.ContainsKey(c))
- {
- _blockDict[c] = new List();
- }
- _blockDict[c].Add(_nextBlock);
- }
+ private void AddBlockChar(char c)
+ {
+ if (!_blockDict.ContainsKey(c))
+ {
+ _blockDict[c] = new List();
+ }
+ _blockDict[c].Add(_nextBlock);
+ }
- private void AddBlock(string block)
- {
- AddBlockChar(block[0]);
- AddBlockChar(block[1]);
- _nextBlock++;
- }
+ private void AddBlock(string block)
+ {
+ AddBlockChar(block[0]);
+ AddBlockChar(block[1]);
+ _nextBlock++;
+ }
- public ABC(List blocks)
- {
- _blocks = blocks;
- foreach (var block in blocks)
- {
- AddBlock(block);
- }
- }
+ public ABC(List blocks)
+ {
+ _blocks = blocks;
+ foreach (var block in blocks)
+ {
+ AddBlock(block);
+ }
+ }
- public bool CanMake(string word)
- {
- word = word.ToLower();
- if (word.Length > _blockDict.Count)
- {
- return false;
- }
- _used = new bool[_blocks.Count];
- return TryMake(word);
- }
+ public bool CanMake(string word)
+ {
+ word = word.ToLower();
+ if (word.Length > _blockDict.Count)
+ {
+ return false;
+ }
+ _used = new bool[_blocks.Count];
+ return TryMake(word);
+ }
- public bool TryMake(string word)
- {
- if (word == string.Empty)
- {
- return true;
- }
- var blocks = _blockDict[word[0]].Where(b => !_used[b]);
- foreach (var block in blocks)
- {
- _used[block] = true;
- if (TryMake(word.Substring(1)))
- {
- return true;
- }
- _used[block] = false;
- }
- return false;
- }
+ public bool TryMake(string word)
+ {
+ if (word == string.Empty)
+ {
+ return true;
+ }
+ var blocks = _blockDict[word[0]].Where(b => !_used[b]);
+ foreach (var block in blocks)
+ {
+ _used[block] = true;
+ if (TryMake(word.Substring(1)))
+ {
+ return true;
+ }
+ _used[block] = false;
+ }
+ return false;
+ }
}
diff --git a/Task/ABC-problem/C/abc-problem.c b/Task/ABC-problem/C/abc-problem.c
index 0a798cd2c4..6e248837a9 100644
--- a/Task/ABC-problem/C/abc-problem.c
+++ b/Task/ABC-problem/C/abc-problem.c
@@ -3,39 +3,39 @@
int can_make_words(char **b, char *word)
{
- int i, ret = 0, c = toupper(*word);
+ int i, ret = 0, c = toupper(*word);
#define SWAP(a, b) if (a != b) { char * tmp = a; a = b; b = tmp; }
- if (!c) return 1;
- if (!b[0]) return 0;
+ if (!c) return 1;
+ if (!b[0]) return 0;
- for (i = 0; b[i] && !ret; i++) {
- if (b[i][0] != c && b[i][1] != c) continue;
- SWAP(b[i], b[0]);
- ret = can_make_words(b + 1, word + 1);
- SWAP(b[i], b[0]);
- }
+ for (i = 0; b[i] && !ret; i++) {
+ if (b[i][0] != c && b[i][1] != c) continue;
+ SWAP(b[i], b[0]);
+ ret = can_make_words(b + 1, word + 1);
+ SWAP(b[i], b[0]);
+ }
- return ret;
+ return ret;
}
int main(void)
{
- char* blocks[] = {
- "BO", "XK", "DQ", "CP", "NA",
- "GT", "RE", "TG", "QD", "FS",
- "JW", "HU", "VI", "AN", "OB",
- "ER", "FS", "LY", "PC", "ZM",
- 0 };
+ char* blocks[] = {
+ "BO", "XK", "DQ", "CP", "NA",
+ "GT", "RE", "TG", "QD", "FS",
+ "JW", "HU", "VI", "AN", "OB",
+ "ER", "FS", "LY", "PC", "ZM",
+ 0 };
- char *words[] = {
- "", "A", "BARK", "BOOK", "TREAT", "COMMON", "SQUAD", "Confuse", 0
- };
+ char *words[] = {
+ "", "A", "BARK", "BOOK", "TREAT", "COMMON", "SQUAD", "Confuse", 0
+ };
- char **w;
- for (w = words; *w; w++)
- printf("%s\t%d\n", *w, can_make_words(blocks, *w));
+ char **w;
+ for (w = words; *w; w++)
+ printf("%s\t%d\n", *w, can_make_words(blocks, *w));
- return 0;
+ return 0;
}
diff --git a/Task/ABC-problem/Component-Pascal/abc-problem.pas b/Task/ABC-problem/Component-Pascal/abc-problem.pas
index 1f278709b7..caa5e1d04f 100644
--- a/Task/ABC-problem/Component-Pascal/abc-problem.pas
+++ b/Task/ABC-problem/Component-Pascal/abc-problem.pas
@@ -1,84 +1,84 @@
MODULE ABCProblem;
IMPORT
- StdLog, DevCommanders, TextMappers;
+ StdLog, DevCommanders, TextMappers;
CONST
- notfound = -1;
-TYPE
- String = ARRAY 3 OF CHAR;
+ notfound = -1;
+TYPE
+ String = ARRAY 3 OF CHAR;
VAR
- blocks : ARRAY 20 OF String;
-
+ blocks : ARRAY 20 OF String;
+
PROCEDURE Check(s: ARRAY OF CHAR): BOOLEAN;
VAR
- used: SET;
- i,blockIndex: INTEGER;
-
- PROCEDURE GetBlockFor(c: CHAR): INTEGER;
- VAR
- i: INTEGER;
- BEGIN
- c := CAP(c);
- i := 0;
- WHILE (i < LEN(blocks)) DO
- IF (c = blocks[i][0]) OR (c = blocks[i][1]) THEN
- IF ~(i IN used) THEN RETURN i END
- END;
- INC(i)
- END;
- RETURN notfound
- END GetBlockFor;
-
+ used: SET;
+ i,blockIndex: INTEGER;
+
+ PROCEDURE GetBlockFor(c: CHAR): INTEGER;
+ VAR
+ i: INTEGER;
+ BEGIN
+ c := CAP(c);
+ i := 0;
+ WHILE (i < LEN(blocks)) DO
+ IF (c = blocks[i][0]) OR (c = blocks[i][1]) THEN
+ IF ~(i IN used) THEN RETURN i END
+ END;
+ INC(i)
+ END;
+ RETURN notfound
+ END GetBlockFor;
+
BEGIN
- used := {};
- FOR i := 0 TO LEN(s$) - 1 DO
- blockIndex := GetBlockFor(s[i]);
- IF blockIndex = notfound THEN
- RETURN FALSE
- ELSE
- INCL(used,blockIndex)
- END
- END;
- RETURN TRUE
-END Check;
+ used := {};
+ FOR i := 0 TO LEN(s$) - 1 DO
+ blockIndex := GetBlockFor(s[i]);
+ IF blockIndex = notfound THEN
+ RETURN FALSE
+ ELSE
+ INCL(used,blockIndex)
+ END
+ END;
+ RETURN TRUE
+END Check;
PROCEDURE CanMakeWord*;
VAR
- s: TextMappers.Scanner;
+ s: TextMappers.Scanner;
BEGIN
- s.ConnectTo(DevCommanders.par.text);
- s.SetPos(DevCommanders.par.beg);
- s.Scan;
- WHILE (~s.rider.eot) DO
- IF (s.type = TextMappers.char) & (s.char = '~') THEN
- RETURN
- ELSIF (s.type = TextMappers.string) THEN
- StdLog.String(s.string);StdLog.String(":> ");
- StdLog.Bool(Check(s.string));StdLog.Ln
- END;
- s.Scan
- END
+ s.ConnectTo(DevCommanders.par.text);
+ s.SetPos(DevCommanders.par.beg);
+ s.Scan;
+ WHILE (~s.rider.eot) DO
+ IF (s.type = TextMappers.char) & (s.char = '~') THEN
+ RETURN
+ ELSIF (s.type = TextMappers.string) THEN
+ StdLog.String(s.string);StdLog.String(":> ");
+ StdLog.Bool(Check(s.string));StdLog.Ln
+ END;
+ s.Scan
+ END
END CanMakeWord;
BEGIN
- blocks[0] := "BO";
- blocks[1] := "XK";
- blocks[2] := "DQ";
- blocks[3] := "CP";
- blocks[4] := "NA";
- blocks[5] := "GT";
- blocks[6] := "RE";
- blocks[7] := "TG";
- blocks[8] := "QD";
- blocks[9] := "FS";
- blocks[10] := "JW";
- blocks[11] := "HU";
- blocks[12] := "VI";
- blocks[13] := "AN";
- blocks[14] := "OB";
- blocks[15] := "ER";
- blocks[16] := "FS";
- blocks[17] := "LY";
- blocks[18] := "PC";
- blocks[19] := "ZM";
-
+ blocks[0] := "BO";
+ blocks[1] := "XK";
+ blocks[2] := "DQ";
+ blocks[3] := "CP";
+ blocks[4] := "NA";
+ blocks[5] := "GT";
+ blocks[6] := "RE";
+ blocks[7] := "TG";
+ blocks[8] := "QD";
+ blocks[9] := "FS";
+ blocks[10] := "JW";
+ blocks[11] := "HU";
+ blocks[12] := "VI";
+ blocks[13] := "AN";
+ blocks[14] := "OB";
+ blocks[15] := "ER";
+ blocks[16] := "FS";
+ blocks[17] := "LY";
+ blocks[18] := "PC";
+ blocks[19] := "ZM";
+
END ABCProblem.
diff --git a/Task/ABC-problem/EMal/abc-problem.emal b/Task/ABC-problem/EMal/abc-problem.emal
index 3fba5d142a..66f28bfaa3 100644
--- a/Task/ABC-problem/EMal/abc-problem.emal
+++ b/Task/ABC-problem/EMal/abc-problem.emal
@@ -24,5 +24,5 @@ writeLine("word".padEnd(11, " "), "|", "canMakeWord", "|", "isCorrect")
for each text word in words
writeLine(word.padEnd(11, " "), "|",
(text!canMakeWord(word)).padEnd(11, " "), "|",
- (canMakeWord(word) æ checks[wordIndex]))
+ (canMakeWord(word) æ checks[wordIndex]))
end
diff --git a/Task/ABC-problem/EchoLisp/abc-problem.l b/Task/ABC-problem/EchoLisp/abc-problem.l
index 20f3578009..1eca19b9fd 100644
--- a/Task/ABC-problem/EchoLisp/abc-problem.l
+++ b/Task/ABC-problem/EchoLisp/abc-problem.l
@@ -1,16 +1,15 @@
(lib 'list) ;; list-delete
(define BLOCKS '("BO" "XK" "DQ" "CP" "NA" "GT" "RE" "TG" "QD" "FS"
- "JW" "HU" "VI" "AN" "OB" "ER" "FS" "LY" "PC" "ZM" ))
-
+ "JW" "HU" "VI" "AN" "OB" "ER" "FS" "LY" "PC" "ZM" ))
+
(define WORDS '("A" "BARK" "BOOK" "TREAT" "COMMON" "SQUAD" "CONFUSE"))
-
+
(define (spell word blocks)
(cond
- ((string-empty? word) #t)
- ((empty? blocks) #f)
- (else
- (for/or [(block blocks)]
- #:continue (not (string-match block (string-first word)))
- (spell (string-rest word) (list-delete blocks block))))))
-
+ ((string-empty? word) #t)
+ ((empty? blocks) #f)
+ (else
+ (for/or [(block blocks)]
+ #:continue (not (string-match block (string-first word)))
+ (spell (string-rest word) (list-delete blocks block))))))
diff --git a/Task/ABC-problem/Elena/abc-problem.elena b/Task/ABC-problem/Elena/abc-problem.elena
index 2525c26eed..4b068c9957 100644
--- a/Task/ABC-problem/Elena/abc-problem.elena
+++ b/Task/ABC-problem/Elena/abc-problem.elena
@@ -27,14 +27,14 @@ extension op
}
}
-public program()
+public Program()
{
- var blocks := new string[]{"BO", "XK", "DQ", "CP", "NA",
- "GT", "RE", "TG", "QD", "FS",
- "JW", "HU", "VI", "AN", "OB",
- "ER", "FS", "LY", "PC", "ZM"};
+ auto blocks := new const string[]{"BO", "XK", "DQ", "CP", "NA",
+ "GT", "RE", "TG", "QD", "FS",
+ "JW", "HU", "VI", "AN", "OB",
+ "ER", "FS", "LY", "PC", "ZM"};
- var words := new string[]{"", "A", "BARK", "BOOK", "TREAT", "COMMON", "SQUAD", "Confuse"};
+ auto words := new const string[]{"", "A", "BARK", "BOOK", "TREAT", "COMMON", "SQUAD", "Confuse"};
Enumerator e := words.enumerator();
e.next();
diff --git a/Task/ABC-problem/Euphoria/abc-problem.ex b/Task/ABC-problem/Euphoria/abc-problem.ex
deleted file mode 100644
index efa3352600..0000000000
--- a/Task/ABC-problem/Euphoria/abc-problem.ex
+++ /dev/null
@@ -1,35 +0,0 @@
-include std/text.e
-
-sequence blocks = {{'B','O'},{'X','K'},{'D','Q'},{'C','P'},{'N','A'},
- {'G','T'},{'R','E'},{'T','G'},{'Q','D'},{'F','S'},
- {'J','W'},{'H','U'},{'V','I'},{'A','N'},{'O','B'},
- {'E','R'},{'F','S'},{'L','Y'},{'P','C'},{'Z','M'}}
-sequence words = {"A","BarK","BOOK","TrEaT","COMMON","SQUAD","CONFUSE"}
-
-sequence current_word
-sequence temp
-integer matches
-
-for i = 1 to length(words) do
- current_word = upper(words[i])
- temp = blocks
- matches = 0
- for j = 1 to length(current_word) do
- for k = 1 to length(temp) do
- if find(current_word[j],temp[k]) then
- temp = remove(temp,k)
- matches += 1
- exit
- end if
- end for
- if length(current_word) = matches then
- printf(1,"%s: TRUE\n",{words[i]})
- exit
- end if
- end for
- if length(current_word) != matches then
- printf(1,"%s: FALSE\n",{words[i]})
- end if
-end for
-
-if getc(0) then end if
diff --git a/Task/ABC-problem/FBSL/abc-problem.fbsl b/Task/ABC-problem/FBSL/abc-problem.fbsl
index 9c34a6ea72..1ef125fe0f 100644
--- a/Task/ABC-problem/FBSL/abc-problem.fbsl
+++ b/Task/ABC-problem/FBSL/abc-problem.fbsl
@@ -1,44 +1,44 @@
#APPTYPE CONSOLE
SUB MAIN()
- BlockCheck("A")
- BlockCheck("BARK")
- BlockCheck("BooK")
- BlockCheck("TrEaT")
- BlockCheck("comMON")
- BlockCheck("sQuAd")
- BlockCheck("Confuse")
- pause
+ BlockCheck("A")
+ BlockCheck("BARK")
+ BlockCheck("BooK")
+ BlockCheck("TrEaT")
+ BlockCheck("comMON")
+ BlockCheck("sQuAd")
+ BlockCheck("Confuse")
+ pause
END SUB
FUNCTION BlockCheck(str)
- print str " " iif( Blockable( str ), "can", "cannot" ) " be spelled with blocks."
+ print str " " iif( Blockable( str ), "can", "cannot" ) " be spelled with blocks."
END FUNCTION
FUNCTION Blockable(str AS STRING)
- DIM blocks AS STRING = "BOXKDQCPNAGTRETGQDFSJWHUVIANOBERFSLYPCZM"
- DIM C AS STRING = ""
- DIM POS AS INTEGER = 0
-
- FOR DIM I = 1 TO LEN(str)
- C = str{i}
- POS = INSTR(BLOCKS, C, 0, 1) 'case insensitive
- IF POS > 0 THEN
- 'if the pos is odd, it's the first of the pair
- IF POS MOD 2 = 1 THEN
- 'so clear the first and the second
- poke(@blocks + pos - 1," ")
- poke(@blocks + pos," ")
- 'otherwise, it's the last of the pair
- ELSE
- 'clear the second and the first
- poke(@blocks + pos - 1," ")
- poke(@blocks + pos - 2," ")
- END IF
- ELSE
- 'not found, so can't be spelled
- RETURN FALSE
- END IF
- NEXT
- 'got thru to here, so can be spelled
- RETURN TRUE
+ DIM blocks AS STRING = "BOXKDQCPNAGTRETGQDFSJWHUVIANOBERFSLYPCZM"
+ DIM C AS STRING = ""
+ DIM POS AS INTEGER = 0
+
+ FOR DIM I = 1 TO LEN(str)
+ C = str{i}
+ POS = INSTR(BLOCKS, C, 0, 1) 'case insensitive
+ IF POS > 0 THEN
+ 'if the pos is odd, it's the first of the pair
+ IF POS MOD 2 = 1 THEN
+ 'so clear the first and the second
+ poke(@blocks + pos - 1," ")
+ poke(@blocks + pos," ")
+ 'otherwise, it's the last of the pair
+ ELSE
+ 'clear the second and the first
+ poke(@blocks + pos - 1," ")
+ poke(@blocks + pos - 2," ")
+ END IF
+ ELSE
+ 'not found, so can't be spelled
+ RETURN FALSE
+ END IF
+ NEXT
+ 'got thru to here, so can be spelled
+ RETURN TRUE
END FUNCTION
diff --git a/Task/ABC-problem/Fortran/abc-problem-2.f b/Task/ABC-problem/Fortran/abc-problem-2.f
index 0c0d917d24..186802c418 100644
--- a/Task/ABC-problem/Fortran/abc-problem-2.f
+++ b/Task/ABC-problem/Fortran/abc-problem-2.f
@@ -1,264 +1,264 @@
- MODULE PLAYPEN !Messes with a set of alphabet blocks.
- INTEGER MSG !Output unit number.
- PARAMETER (MSG = 6) !Standard output.
- INTEGER MS !I dislike unidentified constants...
- PARAMETER (MS = 2) !So this is the maximum number of lettered sides.
- INTEGER LETTER(26),SUPPLY(26) !For counting the alphabet.
+ MODULE PLAYPEN !Messes with a set of alphabet blocks.
+ INTEGER MSG !Output unit number.
+ PARAMETER (MSG = 6) !Standard output.
+ INTEGER MS !I dislike unidentified constants...
+ PARAMETER (MS = 2) !So this is the maximum number of lettered sides.
+ INTEGER LETTER(26),SUPPLY(26) !For counting the alphabet.
CONTAINS
- SUBROUTINE SWAP(I,J) !This really should be known to the compiler.
- INTEGER I,J,K !Which could generate in-place code,
- K = I !Using registers, maybe.
- I = J !Or maybe, there are special op-codes.
- J = K !Rather than this clunkiness.
- END SUBROUTINE SWAP !And it should be for any type of thingy.
+ SUBROUTINE SWAP(I,J) !This really should be known to the compiler.
+ INTEGER I,J,K !Which could generate in-place code,
+ K = I !Using registers, maybe.
+ I = J !Or maybe, there are special op-codes.
+ J = K !Rather than this clunkiness.
+ END SUBROUTINE SWAP !And it should be for any type of thingy.
INTEGER FUNCTION LSTNB(TEXT) !Sigh. Last Not Blank.
Concocted yet again by R.N.McLean (whom God preserve) December MM.
Code checking reveals that the Compaq compiler generates a copy of the string and then finds the length of that when using the latter-day intrinsic LEN_TRIM. Madness!
-Can't DO WHILE (L.GT.0 .AND. TEXT(L:L).LE.' ') !Control chars. regarded as spaces.
+Can't DO WHILE (L.GT.0 .AND. TEXT(L:L).LE.' ') !Control chars. regarded as spaces.
Curse the morons who think it good that the compiler MIGHT evaluate logical expressions fully.
Crude GO TO rather than a DO-loop, because compilers use a loop counter as well as updating the index variable.
Comparison runs of GNASH showed a saving of ~3% in its mass-data reading through the avoidance of DO in LSTNB alone.
Crappy code for character comparison of varying lengths is avoided by using ICHAR which is for single characters only.
Checking the indexing of CHARACTER variables for bounds evoked astounding stupidities, such as calculating the length of TEXT(L:L) by subtracting L from L!
Comparison runs of GNASH showed a saving of ~25-30% in its mass data scanning for this, involving all its two-dozen or so single-character comparisons, not just in LSTNB.
- CHARACTER*(*),INTENT(IN):: TEXT !The bumf. If there must be copy-in, at least there need not be copy back.
- INTEGER L !The length of the bumf.
- L = LEN(TEXT) !So, what is it?
- 1 IF (L.LE.0) GO TO 2 !Are we there yet?
- IF (ICHAR(TEXT(L:L)).GT.ICHAR(" ")) GO TO 2 !Control chars are regarded as spaces also.
- L = L - 1 !Step back one.
- GO TO 1 !And try again.
- 2 LSTNB = L !The last non-blank, possibly zero.
- RETURN !Unsafe to use LSTNB as a variable.
- END FUNCTION LSTNB !Compilers can bungle it.
+ CHARACTER*(*),INTENT(IN):: TEXT !The bumf. If there must be copy-in, at least there need not be copy back.
+ INTEGER L !The length of the bumf.
+ L = LEN(TEXT) !So, what is it?
+ 1 IF (L.LE.0) GO TO 2 !Are we there yet?
+ IF (ICHAR(TEXT(L:L)).GT.ICHAR(" ")) GO TO 2 !Control chars are regarded as spaces also.
+ L = L - 1 !Step back one.
+ GO TO 1 !And try again.
+ 2 LSTNB = L !The last non-blank, possibly zero.
+ RETURN !Unsafe to use LSTNB as a variable.
+ END FUNCTION LSTNB !Compilers can bungle it.
- SUBROUTINE LETTERCOUNT(TEXT) !Count the occurrences of A-Z.
- CHARACTER*(*) TEXT !The text to inspect.
- INTEGER I,K !Assistants.
- DO I = 1,LEN(TEXT) !Step through the text.
- K = ICHAR(TEXT(I:I)) - ICHAR("A") + 1 !This presumes that A-Z have contiguous codes!
- IF (K.GE.1 .AND. K.LE.26) LETTER(K) = LETTER(K) + 1 !Not so with EBCDIC!!
- END DO !On to the next letter.
- END SUBROUTINE LETTERCOUNT !Be careful with LETTER.
+ SUBROUTINE LETTERCOUNT(TEXT) !Count the occurrences of A-Z.
+ CHARACTER*(*) TEXT !The text to inspect.
+ INTEGER I,K !Assistants.
+ DO I = 1,LEN(TEXT) !Step through the text.
+ K = ICHAR(TEXT(I:I)) - ICHAR("A") + 1 !This presumes that A-Z have contiguous codes!
+ IF (K.GE.1 .AND. K.LE.26) LETTER(K) = LETTER(K) + 1 !Not so with EBCDIC!!
+ END DO !On to the next letter.
+ END SUBROUTINE LETTERCOUNT !Be careful with LETTER.
- SUBROUTINE UPCASE(TEXT) !In the absence of an intrinsic...
+ SUBROUTINE UPCASE(TEXT) !In the absence of an intrinsic...
Converts any lower case letters in TEXT to upper case...
Concocted yet again by R.N.McLean (whom God preserve) December MM.
Converting from a DO loop evades having both an iteration counter to decrement and an index variable to adjust.
- CHARACTER*(*) TEXT !The stuff to be modified.
-c CHARACTER*26 LOWER,UPPER !Tables. a-z may not be contiguous codes.
+ CHARACTER*(*) TEXT !The stuff to be modified.
+c CHARACTER*26 LOWER,UPPER !Tables. a-z may not be contiguous codes.
c PARAMETER (LOWER = "abcdefghijklmnopqrstuvwxyz")
c PARAMETER (UPPER = "ABCDEFGHIJKLMNOPQRSTUVWXYZ")
CAREFUL!! The below relies on a-z and A-Z being contiguous, as is NOT the case with EBCDIC.
- INTEGER I,L,IT !Fingers.
- L = LEN(TEXT) !Get a local value, in case LEN engages in oddities.
- I = L !Start at the end and work back..
- 1 IF (I.LE.0) RETURN !Are we there yet? Comparison against zero should not require a subtraction.
-c IT = INDEX(LOWER,TEXT(I:I)) !Well?
-c IF (IT .GT. 0) TEXT(I:I) = UPPER(IT:IT) !One to convert?
- IT = ICHAR(TEXT(I:I)) - ICHAR("a") !More symbols precede "a" than "A".
- IF (IT.GE.0 .AND. IT.LE.25) TEXT(I:I) = CHAR(IT + ICHAR("A")) !In a-z? Convert!
- I = I - 1 !Back one.
- GO TO 1 !Inspect..
- END SUBROUTINE UPCASE !Easy.
+ INTEGER I,L,IT !Fingers.
+ L = LEN(TEXT) !Get a local value, in case LEN engages in oddities.
+ I = L !Start at the end and work back..
+ 1 IF (I.LE.0) RETURN !Are we there yet? Comparison against zero should not require a subtraction.
+c IT = INDEX(LOWER,TEXT(I:I)) !Well?
+c IF (IT .GT. 0) TEXT(I:I) = UPPER(IT:IT) !One to convert?
+ IT = ICHAR(TEXT(I:I)) - ICHAR("a") !More symbols precede "a" than "A".
+ IF (IT.GE.0 .AND. IT.LE.25) TEXT(I:I) = CHAR(IT + ICHAR("A")) !In a-z? Convert!
+ I = I - 1 !Back one.
+ GO TO 1 !Inspect..
+ END SUBROUTINE UPCASE !Easy.
- SUBROUTINE ORDERSIDE(LETTER) !Puts the letters into order.
- CHARACTER*(*) LETTER !The letters.
- INTEGER I,N,H !Assistants.
- CHARACTER*1 T !A scratchpad.
- LOGICAL CURSE !A bit.
- N = LEN(LETTER) !So, how many letters?
- H = N - 1 !Last - First, and not +1.
- IF (H.LE.0) RETURN !Ha ha.
- 1 H = MAX(1,H*10/13) !The special feature.
- IF (H.EQ.9 .OR. H.EQ.10) H = 11 !A twiddle.
- CURSE = .FALSE. !So far, so good.
- DO I = N - H,1,-1 !If H = 1, this is a BubbleSort.
- IF (LETTER(I:I).LT.LETTER(I + H:I + H)) THEN !One compare.
- T = LETTER(I:I) !One swap.
- LETTER(I:I) = LETTER(I + H:I + H) !Alas, no SWAP(A,B)
- LETTER(I + H:I + H) = T !Is recognised by the compiler.
- CURSE = .TRUE. !If once a tiger is seen...
- END IF !So much for that comparison.
- END DO !On to the next.
+ SUBROUTINE ORDERSIDE(LETTER) !Puts the letters into order.
+ CHARACTER*(*) LETTER !The letters.
+ INTEGER I,N,H !Assistants.
+ CHARACTER*1 T !A scratchpad.
+ LOGICAL CURSE !A bit.
+ N = LEN(LETTER) !So, how many letters?
+ H = N - 1 !Last - First, and not +1.
+ IF (H.LE.0) RETURN !Ha ha.
+ 1 H = MAX(1,H*10/13) !The special feature.
+ IF (H.EQ.9 .OR. H.EQ.10) H = 11 !A twiddle.
+ CURSE = .FALSE. !So far, so good.
+ DO I = N - H,1,-1 !If H = 1, this is a BubbleSort.
+ IF (LETTER(I:I).LT.LETTER(I + H:I + H)) THEN !One compare.
+ T = LETTER(I:I) !One swap.
+ LETTER(I:I) = LETTER(I + H:I + H) !Alas, no SWAP(A,B)
+ LETTER(I + H:I + H) = T !Is recognised by the compiler.
+ CURSE = .TRUE. !If once a tiger is seen...
+ END IF !So much for that comparison.
+ END DO !On to the next.
IF (CURSE .OR. H.GT.1) GO TO 1!Another pass?
- END SUBROUTINE ORDERSIDE !Simple enough.
- SUBROUTINE ORDERBLOCKS(N,SOME) !Puts the collection of blocks into order.
- INTEGER N !The number of blocks.
- CHARACTER*(*) SOME(:) !Their lists of letters.
- INTEGER I,H !Assistants.
- CHARACTER*(LEN(SOME(1))) T !A scratchpad matching an element of SOME.
- LOGICAL CURSE !Since there is still no SWAP(SOME(I),SOME(I + H)).
- H = N - 1 !So here comes another CombSort.
- IF (H.LE.0) RETURN !With standard suspicion.
- 1 H = MAX(1,H*10/13) !This is the outer loop.
- IF (H.EQ.9 .OR. H.EQ.10) H = 11 !This is a fiddle.
- CURSE = .FALSE. !Start the next pass in hope.
- DO I = N - H,1,-1 !Going backwards, just for fun.
- IF (SOME(I).LT.SOME(I + H)) THEN !So then?
- T = SOME(I) !Disorder.
- SOME(I) = SOME(I + H) !So once again,
- SOME(I + H) = T !Swap the two miscreants.
- CURSE = .TRUE. !And remember.
- END IF !So much for that comparison.
- END DO !On to the next.
+ END SUBROUTINE ORDERSIDE !Simple enough.
+ SUBROUTINE ORDERBLOCKS(N,SOME) !Puts the collection of blocks into order.
+ INTEGER N !The number of blocks.
+ CHARACTER*(*) SOME(:) !Their lists of letters.
+ INTEGER I,H !Assistants.
+ CHARACTER*(LEN(SOME(1))) T !A scratchpad matching an element of SOME.
+ LOGICAL CURSE !Since there is still no SWAP(SOME(I),SOME(I + H)).
+ H = N - 1 !So here comes another CombSort.
+ IF (H.LE.0) RETURN !With standard suspicion.
+ 1 H = MAX(1,H*10/13) !This is the outer loop.
+ IF (H.EQ.9 .OR. H.EQ.10) H = 11 !This is a fiddle.
+ CURSE = .FALSE. !Start the next pass in hope.
+ DO I = N - H,1,-1 !Going backwards, just for fun.
+ IF (SOME(I).LT.SOME(I + H)) THEN !So then?
+ T = SOME(I) !Disorder.
+ SOME(I) = SOME(I + H) !So once again,
+ SOME(I + H) = T !Swap the two miscreants.
+ CURSE = .TRUE. !And remember.
+ END IF !So much for that comparison.
+ END DO !On to the next.
IF (CURSE .OR. H.GT.1) GO TO 1!Are we there yet?
- END SUBROUTINE ORDERBLOCKS !Not much code, but ringing the changes is still tedious.
+ END SUBROUTINE ORDERBLOCKS !Not much code, but ringing the changes is still tedious.
- SUBROUTINE PLAY(N,SOME) !Mess about with the collection of blocks.
- INTEGER N !Their number.
- CHARACTER*(*) SOME(:) !Their letters.
- INTEGER NH,HIT(N) !A list of blocks.
- INTEGER B,I,J,K,L,M !Assistants.
- CHARACTER*1 C !A letter of the moment.
- L = LEN(SOME(1)) !The maximum number of letters to any block.
+ SUBROUTINE PLAY(N,SOME) !Mess about with the collection of blocks.
+ INTEGER N !Their number.
+ CHARACTER*(*) SOME(:) !Their letters.
+ INTEGER NH,HIT(N) !A list of blocks.
+ INTEGER B,I,J,K,L,M !Assistants.
+ CHARACTER*1 C !A letter of the moment.
+ L = LEN(SOME(1)) !The maximum number of letters to any block.
Cast the collection on to the floor.
- WRITE (MSG,1) N,L,SOME !Announce the set as it is supplied.
+ WRITE (MSG,1) N,L,SOME !Announce the set as it is supplied.
1 FORMAT (I7," blocks, with at most",I2," letters:",66(1X,A))
Change the "orientation" of some blocks.
- DO B = 1,N !Step through each block.
- CALL UPCASE(SOME(B)) !Paranoia rules.
- CALL ORDERSIDE(SOME(B)) !Put its letter list into order.
- END DO !On to the next block.
- WRITE (MSG,2) SOME !Reveal the orderly array.
+ DO B = 1,N !Step through each block.
+ CALL UPCASE(SOME(B)) !Paranoia rules.
+ CALL ORDERSIDE(SOME(B)) !Put its letter list into order.
+ END DO !On to the next block.
+ WRITE (MSG,2) SOME !Reveal the orderly array.
2 FORMAT (6X,"... the letters in reverse order:",66(1X,A))
Collate the collection of blocks.
- CALL ORDERBLOCKS(N,SOME) !Now order the blocks by their letters.
- WRITE (MSG,3) SOME !Reveal them in neato order.
+ CALL ORDERBLOCKS(N,SOME) !Now order the blocks by their letters.
+ WRITE (MSG,3) SOME !Reveal them in neato order.
3 FORMAT (7X,"... the blocks in reverse order:",66(1X,A))
Count the appearances of the letters of the alphabet.
- LETTER = 0 !Enough of shuffling blocks around.
- DO B = 1,N !Now inspect their collective letters.
- CALL LETTERCOUNT(SOME(B)) !A block's worth at a go.
- END DO !On to the next block.
- SUPPLY = LETTER !Save the counts of supplied letters.
- WRITE (MSG,4) (CHAR(ICHAR("A") + I - 1),I = 1,26),SUPPLY !Results.
- 4 FORMAT (15X,"Letters of the alphabet:",26A,/, !First, a line with A ... Z.
- 1 11X,"... number thereof supplied:",26I) !Then a line of the associated counts.
+ LETTER = 0 !Enough of shuffling blocks around.
+ DO B = 1,N !Now inspect their collective letters.
+ CALL LETTERCOUNT(SOME(B)) !A block's worth at a go.
+ END DO !On to the next block.
+ SUPPLY = LETTER !Save the counts of supplied letters.
+ WRITE (MSG,4) (CHAR(ICHAR("A") + I - 1),I = 1,26),SUPPLY !Results.
+ 4 FORMAT (15X,"Letters of the alphabet:",26A,/, !First, a line with A ... Z.
+ 1 11X,"... number thereof supplied:",26I) !Then a line of the associated counts.
Check for blocks with duplicated letters.
- WRITE (MSG,5) !Announce.
- 5 FORMAT (8X,"Blocks with duplicated letters:",$) !Further output impends.
- M = 0 !No duplication found.
- DO B = 1,N !So step through each block.
- JJ:DO J = 2,L !Inspecting successive letters of the block,
- IF (SOME(B)(J:J).LE." ") EXIT JJ !Provided they've not run out.
- DO K = 1,J - 1 !To see if it has appeared earlier.
+ WRITE (MSG,5) !Announce.
+ 5 FORMAT (8X,"Blocks with duplicated letters:",$) !Further output impends.
+ M = 0 !No duplication found.
+ DO B = 1,N !So step through each block.
+ JJ:DO J = 2,L !Inspecting successive letters of the block,
+ IF (SOME(B)(J:J).LE." ") EXIT JJ !Provided they've not run out.
+ DO K = 1,J - 1 !To see if it has appeared earlier.
IF (SOME(B)(K:K).LE." ") EXIT JJ!Reverse order means that spaces will be at the end!
- IF (SOME(B)(J:J).EQ.SOME(B)(K:K)) THEN !Well?
- M = M + 1 !A match!
- WRITE (MSG,6) SOME(B) !Name the block.
- 6 FORMAT (1X,A,$) !With further output still impending,
- EXIT JJ !And give up on this block.
- END IF !One duplicated letter is sufficient for its downfall.
- END DO !Next letter up.
- END DO JJ !On to the next letter of the block.
- END DO !On to the next block.
- CALL HIC(M) !Show the count and end the line.
+ IF (SOME(B)(J:J).EQ.SOME(B)(K:K)) THEN !Well?
+ M = M + 1 !A match!
+ WRITE (MSG,6) SOME(B) !Name the block.
+ 6 FORMAT (1X,A,$) !With further output still impending,
+ EXIT JJ !And give up on this block.
+ END IF !One duplicated letter is sufficient for its downfall.
+ END DO !Next letter up.
+ END DO JJ !On to the next letter of the block.
+ END DO !On to the next block.
+ CALL HIC(M) !Show the count and end the line.
Check for duplicate blocks, knowing that the array of blocks is ordered.
- WRITE (MSG,7) !Announce.
- 7 FORMAT (21X,"Duplicated blocks:",$) !Again, leave the line dangling.
- K = 0 !No duplication found.
- B = 1 !Syncopation.
- 70 B = B + 1 !Advance one.
- IF (B.GT.N) GO TO 72 !Are we there yet?
- IF (SOME(B).NE.SOME(B - 1)) GO TO 70 !No match? Search on.
- K = K + 1 !A match is counted.
- WRITE (MSG,6) SOME(B) !Name it.
- 71 B = B + 1 !And speed through continued matching.
- IF (B.GT.N) GO TO 72 !Unless we're of the end.
- IF (SOME(B).EQ.SOME(B - 1)) GO TO 71 !Continued matching?
- GO TO 70 !Mismatch: resume the normal scan.
- 72 CALL HIC(K) !So much for that.
+ WRITE (MSG,7) !Announce.
+ 7 FORMAT (21X,"Duplicated blocks:",$) !Again, leave the line dangling.
+ K = 0 !No duplication found.
+ B = 1 !Syncopation.
+ 70 B = B + 1 !Advance one.
+ IF (B.GT.N) GO TO 72 !Are we there yet?
+ IF (SOME(B).NE.SOME(B - 1)) GO TO 70 !No match? Search on.
+ K = K + 1 !A match is counted.
+ WRITE (MSG,6) SOME(B) !Name it.
+ 71 B = B + 1 !And speed through continued matching.
+ IF (B.GT.N) GO TO 72 !Unless we're of the end.
+ IF (SOME(B).EQ.SOME(B - 1)) GO TO 71 !Continued matching?
+ GO TO 70 !Mismatch: resume the normal scan.
+ 72 CALL HIC(K) !So much for that.
Check for duplicated letters across different blocks.
- IF (ALL(SUPPLY.LE.1)) RETURN !Unless there are no duplicated letters.
- WRITE (MSG,8) !Announce.
- 8 FORMAT ("Duplicated letters on different blocks:",$) !More to come.
- K = 0 !Start another count.
- DO I = 1,26 !A well-known span.
- IF (SUPPLY(I).LE.1) CYCLE !Any duplicated letters?
+ IF (ALL(SUPPLY.LE.1)) RETURN !Unless there are no duplicated letters.
+ WRITE (MSG,8) !Announce.
+ 8 FORMAT ("Duplicated letters on different blocks:",$) !More to come.
+ K = 0 !Start another count.
+ DO I = 1,26 !A well-known span.
+ IF (SUPPLY(I).LE.1) CYCLE !Any duplicated letters?
C = CHAR(ICHAR("A") + I - 1)!Yes. This is the character.
- NH = 0 !So, how many blocks contribute?
- DO B = 1,N !Find out.
- IF (INDEX(SOME(B),C).GT.0) THEN !On this block?
- NH = NH + 1 !Yes.
- HIT(NH) = B !Keep track of which.
- END IF !So much for that block.
- END DO !On to the next.
- IF (ANY(SOME(HIT(2:NH)) .NE. SOME(HIT(1)))) THEN !All have the same collection of letters?
- K = K + 1 !No!
- WRITE (MSG,9) C !Name the heterogenously supported letter.
- 9 FORMAT (A,$) !Use the same spacing even though one character only.
- END IF !So much for that letter's search.
- END DO !On to the next letter.
- CALL HIC(K) !Finish the line with the count report.
- CONTAINS !This is used often enough.
- SUBROUTINE HIC(N) !But has very specific context.
- INTEGER N !The count.
- IF (N.LE.0) WRITE (MSG,*) "None." !Yes, we have no bananas.
- IF (N.GT.0) WRITE (MSG,*) N !Either way, end the line.
- END SUBROUTINE HIC !This service routine is not needed elsewhere.
- END SUBROUTINE PLAY !Look mummy! All the blockses are neatened!
+ NH = 0 !So, how many blocks contribute?
+ DO B = 1,N !Find out.
+ IF (INDEX(SOME(B),C).GT.0) THEN !On this block?
+ NH = NH + 1 !Yes.
+ HIT(NH) = B !Keep track of which.
+ END IF !So much for that block.
+ END DO !On to the next.
+ IF (ANY(SOME(HIT(2:NH)) .NE. SOME(HIT(1)))) THEN !All have the same collection of letters?
+ K = K + 1 !No!
+ WRITE (MSG,9) C !Name the heterogenously supported letter.
+ 9 FORMAT (A,$) !Use the same spacing even though one character only.
+ END IF !So much for that letter's search.
+ END DO !On to the next letter.
+ CALL HIC(K) !Finish the line with the count report.
+ CONTAINS !This is used often enough.
+ SUBROUTINE HIC(N) !But has very specific context.
+ INTEGER N !The count.
+ IF (N.LE.0) WRITE (MSG,*) "None." !Yes, we have no bananas.
+ IF (N.GT.0) WRITE (MSG,*) N !Either way, end the line.
+ END SUBROUTINE HIC !This service routine is not needed elsewhere.
+ END SUBROUTINE PLAY !Look mummy! All the blockses are neatened!
- LOGICAL FUNCTION CANBLOCK(WORD,N,SOME) !Can the blocks spell out the word?
+ LOGICAL FUNCTION CANBLOCK(WORD,N,SOME) !Can the blocks spell out the word?
Creates a move tree based on the letters of WORD and for each, the blocks available.
- CHARACTER*(*) WORD !The word to spell out.
- INTEGER N !The number of blocks.
- CHARACTER*(*) SOME(:) !The blocks and their letters.
- INTEGER NA,AVAIL(N) !Say not the struggle naught availeth!
- INTEGER NMOVE(LEN(WORD)) !I need a list of acceptable blocks,
- INTEGER MOVE(LEN(WORD),N) !One list for each letter of WORD.
- INTEGER I,L,S !Assistants.
- CHARACTER*1 C !The letter of the moment.
- CANBLOCK = .FALSE. !Initial pessimism.
- L = LSTNB(WORD) !Ignore trailing spaces.
- IF (L.GT.N) RETURN !Enough blocks?
- LETTER = 0 !To make rabbit stew,
- CALL LETTERCOUNT(WORD(1:L)) !First catch your rabbit.
- IF (ANY(SUPPLY .LT. LETTER)) RETURN !The larder is lacking.
- NA = N !Prepare a list.
- FORALL (I = 1:N) AVAIL(I) = I !That fingers every block.
- I = 0 !Step through the letters of the WORD.
+ CHARACTER*(*) WORD !The word to spell out.
+ INTEGER N !The number of blocks.
+ CHARACTER*(*) SOME(:) !The blocks and their letters.
+ INTEGER NA,AVAIL(N) !Say not the struggle naught availeth!
+ INTEGER NMOVE(LEN(WORD)) !I need a list of acceptable blocks,
+ INTEGER MOVE(LEN(WORD),N) !One list for each letter of WORD.
+ INTEGER I,L,S !Assistants.
+ CHARACTER*1 C !The letter of the moment.
+ CANBLOCK = .FALSE. !Initial pessimism.
+ L = LSTNB(WORD) !Ignore trailing spaces.
+ IF (L.GT.N) RETURN !Enough blocks?
+ LETTER = 0 !To make rabbit stew,
+ CALL LETTERCOUNT(WORD(1:L)) !First catch your rabbit.
+ IF (ANY(SUPPLY .LT. LETTER)) RETURN !The larder is lacking.
+ NA = N !Prepare a list.
+ FORALL (I = 1:N) AVAIL(I) = I !That fingers every block.
+ I = 0 !Step through the letters of the WORD.
Chug through the letters of the WORD.
- 1 I = I + 1 !One letter after the other.
- IF (I.GT.L) GO TO 100 !Yay! We're through!
- C = WORD(I:I) !The letter of the moment.
- NMOVE(I) = 0 !No moves known at this new level.
- DO S = 1,NA !So, look for them amongst the available slots.
- IF (INDEX(SOME(AVAIL(S)),C) .GT. 0) THEN !A hit?
- NMOVE(I) = NMOVE(I) + 1 !Yes! Count up another possible move.
- MOVE(I,NMOVE(I)) = S !Remember its slot.
- END IF !So much for that block.
- END DO !On to the next.
- 2 IF (NMOVE(I).GT.0) THEN !Have we any moves?
- S = MOVE(I,NMOVE(I)) !Yes! Recover the last found.
- NMOVE(I) = NMOVE(I) - 1 !Uncount, as it is about to be used.
- IF (S.NE.NA) CALL SWAP(AVAIL(S),AVAIL(NA)) !This block is no longer available.
- NA = NA - 1 !Shift the boundary back.
- GO TO 1 !Try the next letter!
- END IF !But if we can't find a move at that level...
- I = I - 1 !Retreat a level.
- IF (I.LE.0) RETURN !Oh dear!
- S = MOVE(I,NMOVE(I) + 1) !Undo the move that had been made at this level.
- NA = NA + 1 !And make its block is re-available.
- IF (S.NE.NA) CALL SWAP(AVAIL(S),AVAIL(NA)) !Move it back.
- GO TO 2 !See what moves remain at this level.
+ 1 I = I + 1 !One letter after the other.
+ IF (I.GT.L) GO TO 100 !Yay! We're through!
+ C = WORD(I:I) !The letter of the moment.
+ NMOVE(I) = 0 !No moves known at this new level.
+ DO S = 1,NA !So, look for them amongst the available slots.
+ IF (INDEX(SOME(AVAIL(S)),C) .GT. 0) THEN !A hit?
+ NMOVE(I) = NMOVE(I) + 1 !Yes! Count up another possible move.
+ MOVE(I,NMOVE(I)) = S !Remember its slot.
+ END IF !So much for that block.
+ END DO !On to the next.
+ 2 IF (NMOVE(I).GT.0) THEN !Have we any moves?
+ S = MOVE(I,NMOVE(I)) !Yes! Recover the last found.
+ NMOVE(I) = NMOVE(I) - 1 !Uncount, as it is about to be used.
+ IF (S.NE.NA) CALL SWAP(AVAIL(S),AVAIL(NA)) !This block is no longer available.
+ NA = NA - 1 !Shift the boundary back.
+ GO TO 1 !Try the next letter!
+ END IF !But if we can't find a move at that level...
+ I = I - 1 !Retreat a level.
+ IF (I.LE.0) RETURN !Oh dear!
+ S = MOVE(I,NMOVE(I) + 1) !Undo the move that had been made at this level.
+ NA = NA + 1 !And make its block is re-available.
+ IF (S.NE.NA) CALL SWAP(AVAIL(S),AVAIL(NA)) !Move it back.
+ GO TO 2 !See what moves remain at this level.
Completed!
- 100 CANBLOCK = .TRUE. !That's a relief.
- END FUNCTION CANBLOCK !Some revisions might have been made.
- END MODULE PLAYPEN !No sand here.
+ 100 CANBLOCK = .TRUE. !That's a relief.
+ END FUNCTION CANBLOCK !Some revisions might have been made.
+ END MODULE PLAYPEN !No sand here.
- USE PLAYPEN !Just so.
- INTEGER HAVE,TESTS !Parameters for the specified problem.
- PARAMETER (HAVE = 20, TESTS = 7) !Number of blocks, number of tests.
- CHARACTER*(MS) BLOCKS(HAVE) !Have blocks, will juggle.
- DATA BLOCKS/"BO","XK","DQ","CP","NA","GT","RE","TG","QD","FS", !The specified set
- 1 "JW","HU","VI","AN","OB","ER","FS","LY","PC","ZM"/ !Of letter blocks.
- CHARACTER*8 WORD(TESTS) !Now for the specified test words.
- LOGICAL ANS(TESTS),T,F !And the given results.
- PARAMETER (T = .TRUE., F = .FALSE.) !Enable a more compact specification.
- DATA WORD/"A","BARK","BOOK","TREAT","COMMON","SQUAD","CONFUSE"/ !So that these
- DATA ANS/ T , T , F , T , F , T , T / !Can be aligned.
+ USE PLAYPEN !Just so.
+ INTEGER HAVE,TESTS !Parameters for the specified problem.
+ PARAMETER (HAVE = 20, TESTS = 7) !Number of blocks, number of tests.
+ CHARACTER*(MS) BLOCKS(HAVE) !Have blocks, will juggle.
+ DATA BLOCKS/"BO","XK","DQ","CP","NA","GT","RE","TG","QD","FS", !The specified set
+ 1 "JW","HU","VI","AN","OB","ER","FS","LY","PC","ZM"/ !Of letter blocks.
+ CHARACTER*8 WORD(TESTS) !Now for the specified test words.
+ LOGICAL ANS(TESTS),T,F !And the given results.
+ PARAMETER (T = .TRUE., F = .FALSE.) !Enable a more compact specification.
+ DATA WORD/"A","BARK","BOOK","TREAT","COMMON","SQUAD","CONFUSE"/ !So that these
+ DATA ANS/ T , T , F , T , F , T , T / !Can be aligned.
LOGICAL YAY
INTEGER I
@@ -266,7 +266,7 @@ Completed!
1 FORMAT ("Arranges alphabet blocks, attending only to the ",
1 "letters on the blocks, and ignoring case and orientation.",/)
- CALL PLAY(HAVE,BLOCKS) !Some fun first.
+ CALL PLAY(HAVE,BLOCKS) !Some fun first.
WRITE (MSG,'(/"Now to see if some words can be spelled out.")')
DO I = 1,TESTS
diff --git a/Task/ABC-problem/Go/abc-problem.go b/Task/ABC-problem/Go/abc-problem.go
index 5ad1a85f59..0f28ef1f06 100644
--- a/Task/ABC-problem/Go/abc-problem.go
+++ b/Task/ABC-problem/Go/abc-problem.go
@@ -1,39 +1,39 @@
package main
import (
- "fmt"
- "strings"
+ "fmt"
+ "strings"
)
func newSpeller(blocks string) func(string) bool {
- bl := strings.Fields(blocks)
- return func(word string) bool {
- return r(word, bl)
- }
+ bl := strings.Fields(blocks)
+ return func(word string) bool {
+ return r(word, bl)
+ }
}
func r(word string, bl []string) bool {
- if word == "" {
- return true
- }
- c := word[0] | 32
- for i, b := range bl {
- if c == b[0]|32 || c == b[1]|32 {
- bl[i], bl[0] = bl[0], b
- if r(word[1:], bl[1:]) == true {
- return true
- }
- bl[i], bl[0] = bl[0], bl[i]
- }
- }
- return false
+ if word == "" {
+ return true
+ }
+ c := word[0] | 32
+ for i, b := range bl {
+ if c == b[0]|32 || c == b[1]|32 {
+ bl[i], bl[0] = bl[0], b
+ if r(word[1:], bl[1:]) == true {
+ return true
+ }
+ bl[i], bl[0] = bl[0], bl[i]
+ }
+ }
+ return false
}
func main() {
- sp := newSpeller(
- "BO XK DQ CP NA GT RE TG QD FS JW HU VI AN OB ER FS LY PC ZM")
- for _, word := range []string{
- "A", "BARK", "BOOK", "TREAT", "COMMON", "SQUAD", "CONFUSE"} {
- fmt.Println(word, sp(word))
- }
+ sp := newSpeller(
+ "BO XK DQ CP NA GT RE TG QD FS JW HU VI AN OB ER FS LY PC ZM")
+ for _, word := range []string{
+ "A", "BARK", "BOOK", "TREAT", "COMMON", "SQUAD", "CONFUSE"} {
+ fmt.Println(word, sp(word))
+ }
}
diff --git a/Task/ABC-problem/Insitux/abc-problem.insitux b/Task/ABC-problem/Insitux/abc-problem.insitux
index aba0f2cc01..6dd31fc0b6 100644
--- a/Task/ABC-problem/Insitux/abc-problem.insitux
+++ b/Task/ABC-problem/Insitux/abc-problem.insitux
@@ -7,5 +7,5 @@
(.. and (map in-block? word)))
(-> ["A" "bark" "Book" "TREAT" "Common" "squaD" "CoNFuSe"] ; Notice case insensitivity
- (map #(str % " => " (can-make-word %)))
+ (map #"{%} => {can-make-word %}")
(join ", "))
diff --git a/Task/ABC-problem/Lang/abc-problem.lang b/Task/ABC-problem/Lang/abc-problem.lang
index 0e8e9d7054..8444fcad66 100644
--- a/Task/ABC-problem/Lang/abc-problem.lang
+++ b/Task/ABC-problem/Lang/abc-problem.lang
@@ -1,37 +1,37 @@
fp.canMakeWord = ($word, $blocks) -> {
- if(!$word) {
- return 1
- }
-
- $word = fn.toLower($word)
-
- $c $= $word[0]
- $i = 0
- while($i < @$blocks) {
- $block $= fn.toLower($blocks[$i])
-
- if($block[0] != $c && $block[1] != $c) {
- $i += 1
-
- con.continue
- }
-
- $blocksCopy $= ^$blocks
- fn.listRemoveAt($blocksCopy, $i)
-
- if(fp.canMakeWord(fn.substring($word, 1), $blocksCopy)) {
- return 1
- }
-
- $i += 1
- }
-
- return 0
+ if(!$word) {
+ return 1
+ }
+
+ $word = fn.toLower($word)
+
+ $c $= $word[0]
+ $i = 0
+ while($i < @$blocks) {
+ $block $= fn.toLower($blocks[$i])
+
+ if($block[0] != $c && $block[1] != $c) {
+ $i += 1
+
+ con.continue
+ }
+
+ $blocksCopy $= ^$blocks
+ fn.listRemoveAt($blocksCopy, $i)
+
+ if(fp.canMakeWord(fn.substring($word, 1), $blocksCopy)) {
+ return 1
+ }
+
+ $i += 1
+ }
+
+ return 0
}
$blocks = fn.listOf(BO, XK, DQ, CP, NA, GT, RE, TG, QD, FS, JW, HU, VI, AN, OB, ER, FS, LY, PC, ZM)
$word
foreach($[word], [\e, A, BARK, BOOK, TREAT, COMMON, SQUAD, CONFUSE, Treat, cOmMoN]) {
- fn.printf(%s: %s%n, $word, fp.canMakeWord($word, $blocks))
+ fn.printf(%s: %s%n, $word, fp.canMakeWord($word, $blocks))
}
diff --git a/Task/ABC-problem/Lua/abc-problem.lua b/Task/ABC-problem/Lua/abc-problem.lua
index 3e18d4914a..9effcd462c 100644
--- a/Task/ABC-problem/Lua/abc-problem.lua
+++ b/Task/ABC-problem/Lua/abc-problem.lua
@@ -1,31 +1,31 @@
blocks = {
- {"B","O"}; {"X","K"}; {"D","Q"}; {"C","P"};
- {"N","A"}; {"G","T"}; {"R","E"}; {"T","G"};
- {"Q","D"}; {"F","S"}; {"J","W"}; {"H","U"};
- {"V","I"}; {"A","N"}; {"O","B"}; {"E","R"};
- {"F","S"}; {"L","Y"}; {"P","C"}; {"Z","M"};
- };
+ {"B","O"}; {"X","K"}; {"D","Q"}; {"C","P"};
+ {"N","A"}; {"G","T"}; {"R","E"}; {"T","G"};
+ {"Q","D"}; {"F","S"}; {"J","W"}; {"H","U"};
+ {"V","I"}; {"A","N"}; {"O","B"}; {"E","R"};
+ {"F","S"}; {"L","Y"}; {"P","C"}; {"Z","M"};
+ };
function canUse(table, letter)
- for i,v in pairs(blocks) do
- if (v[1] == letter:upper() or v[2] == letter:upper()) and table[i] then
- table[i] = false;
- return true;
- end
- end
- return false;
+ for i,v in pairs(blocks) do
+ if (v[1] == letter:upper() or v[2] == letter:upper()) and table[i] then
+ table[i] = false;
+ return true;
+ end
+ end
+ return false;
end
function canMake(Word)
- local Taken = {};
- for i,v in pairs(blocks) do
- table.insert(Taken,true);
- end
- local found = true;
- for i = 1,#Word do
- if not canUse(Taken,Word:sub(i,i)) then
- found = false;
- end
- end
- print(found)
+ local Taken = {};
+ for i,v in pairs(blocks) do
+ table.insert(Taken,true);
+ end
+ local found = true;
+ for i = 1,#Word do
+ if not canUse(Taken,Word:sub(i,i)) then
+ found = false;
+ end
+ end
+ print(found)
end
diff --git a/Task/ABC-problem/MAXScript/abc-problem-1.max b/Task/ABC-problem/MAXScript/abc-problem-1.max
index c05646f32e..0da376fc34 100644
--- a/Task/ABC-problem/MAXScript/abc-problem-1.max
+++ b/Task/ABC-problem/MAXScript/abc-problem-1.max
@@ -1,98 +1,98 @@
-- This is the blocks array
global GlobalBlocks = #("BO","XK","DQ","CP","NA", \
- "GT","RE","TG","QD","FS", \
- "JW","HU","VI","AN","OB", \
- "ER","FS","LY","PC","ZM")
+ "GT","RE","TG","QD","FS", \
+ "JW","HU","VI","AN","OB", \
+ "ER","FS","LY","PC","ZM")
-- This function returns true if "_str" is part of "_word", false otherwise
fn occurs _str _word =
(
- if _str != undefined and _word != undefined then
- (
- matchpattern _word pattern:("*"+_str+"*")
- ) else return false
+ if _str != undefined and _word != undefined then
+ (
+ matchpattern _word pattern:("*"+_str+"*")
+ ) else return false
)
-- This is the main function
fn isWordPossible word blocks: = -- blocks is a keyword argument
(
- word = toupper word -- convert the string to upper case, to make it case insensitive
- if blocks == unsupplied do blocks = GlobalBlocks
- -- if blocks (keyword argument) is unsupplied, use the global blocks array (this is for recursion)
-
- blocks = deepcopy blocks
+ word = toupper word -- convert the string to upper case, to make it case insensitive
+ if blocks == unsupplied do blocks = GlobalBlocks
+ -- if blocks (keyword argument) is unsupplied, use the global blocks array (this is for recursion)
- local pos = 1 -- start at the beginning of the word
- local solvedLetters = #() -- this array stores the indices of solved letters
-
- while pos <= word.count do -- loop through every character in the word
- (
- local possibleBlocks = #() -- this array stores the blocks which can be used to make that letter
- for b = 1 to Blocks.count do -- this loop finds all the possible blocks that can be used to make that letter
- (
- if occurs word[pos] blocks[b] do
- (
- appendifunique possibleBlocks b
- )
- )
- if possibleBlocks.count > 0 then -- if it found any blocks
- (
- if possibleBlocks.count == 1 then -- if it found one block, then continue
- (
- appendifunique solvedLetters pos
- deleteitem blocks possibleblocks[1]
- pos += 1
- )
- else -- if it found more than one
- (
- for b = 1 to possibleBlocks.count do -- loop through every possible block
- (
- local possibleBlock = blocks[possibleBlocks[b]]
- local blockFirstLetter = possibleBlock[1]
- local blockSecondLetter = possibleBlock[2]
- local matchingLetter = if blockFirstLetter == word[pos] then 1 else 2
- -- ^ this is the index of the matching letter on the block
-
- local notMatchingIndex = if matchingLetter == 1 then 2 else 1
- local notMatchingLetter = possibleBlock[notMatchingIndex]
- -- ^ this is the other letter on the block
-
- if occurs notMatchingLetter (substring word (pos+1) -1) then
- ( -- if the other letter occurs in the rest of the word
- local removedBlocks = deepcopy blocks -- copy the current blocks array
- deleteitem removedBlocks possibleBlocks[b] -- remove the item from the copied array
-
- -- recursively check if the word is possible if that block is taken away from the array:
- if (isWordPossible (substring word (pos+1) -1) blocks:removedBlocks) then
- ( -- if it is, then remove the block and move to next character
- appendifunique solvedLetters pos
- deleteitem blocks possibleblocks[1]
- pos += 1
- exit
- )
- else
- ( -- if it isn't and it looped through every possible block, then the word is not possible
- if b == possibleBlocks.count do return false
- )
- )
- else
- ( -- if the other letter on this block doesn't occur in the rest of the word, then the letter is solved, continue
- appendifunique solvedLetters pos
- deleteitem blocks possibleblocks[b]
- pos += 1
- exit
- )
- )
- )
- ) else return false -- if it didn't find any blocks, then return false
- )
+ blocks = deepcopy blocks
- makeuniquearray solvedLetters -- make sure there are no duplicates in the solved array
- if solvedLetters.count != word.count then return false -- if number of solved letters is not equal to word length
- else
- ( -- this checks if all the solved letters are the same as the word
- check = ""
- for bit in solvedLetters do append check word[bit]
- if check == word then return true else return false
- )
+ local pos = 1 -- start at the beginning of the word
+ local solvedLetters = #() -- this array stores the indices of solved letters
+
+ while pos <= word.count do -- loop through every character in the word
+ (
+ local possibleBlocks = #() -- this array stores the blocks which can be used to make that letter
+ for b = 1 to Blocks.count do -- this loop finds all the possible blocks that can be used to make that letter
+ (
+ if occurs word[pos] blocks[b] do
+ (
+ appendifunique possibleBlocks b
+ )
+ )
+ if possibleBlocks.count > 0 then -- if it found any blocks
+ (
+ if possibleBlocks.count == 1 then -- if it found one block, then continue
+ (
+ appendifunique solvedLetters pos
+ deleteitem blocks possibleblocks[1]
+ pos += 1
+ )
+ else -- if it found more than one
+ (
+ for b = 1 to possibleBlocks.count do -- loop through every possible block
+ (
+ local possibleBlock = blocks[possibleBlocks[b]]
+ local blockFirstLetter = possibleBlock[1]
+ local blockSecondLetter = possibleBlock[2]
+ local matchingLetter = if blockFirstLetter == word[pos] then 1 else 2
+ -- ^ this is the index of the matching letter on the block
+
+ local notMatchingIndex = if matchingLetter == 1 then 2 else 1
+ local notMatchingLetter = possibleBlock[notMatchingIndex]
+ -- ^ this is the other letter on the block
+
+ if occurs notMatchingLetter (substring word (pos+1) -1) then
+ ( -- if the other letter occurs in the rest of the word
+ local removedBlocks = deepcopy blocks -- copy the current blocks array
+ deleteitem removedBlocks possibleBlocks[b] -- remove the item from the copied array
+
+ -- recursively check if the word is possible if that block is taken away from the array:
+ if (isWordPossible (substring word (pos+1) -1) blocks:removedBlocks) then
+ ( -- if it is, then remove the block and move to next character
+ appendifunique solvedLetters pos
+ deleteitem blocks possibleblocks[1]
+ pos += 1
+ exit
+ )
+ else
+ ( -- if it isn't and it looped through every possible block, then the word is not possible
+ if b == possibleBlocks.count do return false
+ )
+ )
+ else
+ ( -- if the other letter on this block doesn't occur in the rest of the word, then the letter is solved, continue
+ appendifunique solvedLetters pos
+ deleteitem blocks possibleblocks[b]
+ pos += 1
+ exit
+ )
+ )
+ )
+ ) else return false -- if it didn't find any blocks, then return false
+ )
+
+ makeuniquearray solvedLetters -- make sure there are no duplicates in the solved array
+ if solvedLetters.count != word.count then return false -- if number of solved letters is not equal to word length
+ else
+ ( -- this checks if all the solved letters are the same as the word
+ check = ""
+ for bit in solvedLetters do append check word[bit]
+ if check == word then return true else return false
+ )
)
diff --git a/Task/ABC-problem/MAXScript/abc-problem-3.max b/Task/ABC-problem/MAXScript/abc-problem-3.max
index 4681f1b686..3aeab87682 100644
--- a/Task/ABC-problem/MAXScript/abc-problem-3.max
+++ b/Task/ABC-problem/MAXScript/abc-problem-3.max
@@ -1,30 +1,30 @@
fn isWordPossible2 word =
(
- Blocks = #("BO","XK","DQ","CP","NA", \
- "GT","RE","TG","QD","FS", \
- "JW","HU","VI","AN","OB", \
- "ER","FS","LY","PC","ZM")
+ Blocks = #("BO","XK","DQ","CP","NA", \
+ "GT","RE","TG","QD","FS", \
+ "JW","HU","VI","AN","OB", \
+ "ER","FS","LY","PC","ZM")
word = toupper word
- local pos = 1
- local solvedLetters = #()
- while pos <= word.count do
- (
- for i = 1 to blocks.count do
- (
- if (matchpattern blocks[i] pattern:("*"+word[pos]+"*")) then
- (
- deleteitem blocks i
- appendifunique solvedLetters pos
- pos +=1
- exit
- )
- else if i == blocks.count do return false
- )
- )
- if solvedLetters.count == word.count then
- (
- local check = ""
- for bit in solvedLetters do append check word[bit]
- if check == word then return true else return false
- ) else return false
+ local pos = 1
+ local solvedLetters = #()
+ while pos <= word.count do
+ (
+ for i = 1 to blocks.count do
+ (
+ if (matchpattern blocks[i] pattern:("*"+word[pos]+"*")) then
+ (
+ deleteitem blocks i
+ appendifunique solvedLetters pos
+ pos +=1
+ exit
+ )
+ else if i == blocks.count do return false
+ )
+ )
+ if solvedLetters.count == word.count then
+ (
+ local check = ""
+ for bit in solvedLetters do append check word[bit]
+ if check == word then return true else return false
+ ) else return false
)
diff --git a/Task/ABC-problem/Maple/abc-problem.maple b/Task/ABC-problem/Maple/abc-problem.maple
index 98312bccce..0937c92c58 100644
--- a/Task/ABC-problem/Maple/abc-problem.maple
+++ b/Task/ABC-problem/Maple/abc-problem.maple
@@ -1,23 +1,23 @@
canSpell := proc(w)
- local blocks, i, j, word, letterFound;
- blocks := Array([["B", "O"], ["X", "K"], ["D", "Q"], ["C", "P"], ["N", "A"], ["G", "T"], ["R", "E"], ["T", "G"],
+ local blocks, i, j, word, letterFound;
+ blocks := Array([["B", "O"], ["X", "K"], ["D", "Q"], ["C", "P"], ["N", "A"], ["G", "T"], ["R", "E"], ["T", "G"],
["Q", "D"], ["F", "S"], ["J", "W"], ["H", "U"], ["V", "I"], ["A", "N"], ["O", "B"], ["E", "R"],
["F", "S"], ["L", "Y"], ["P", "C"], ["Z", "M"]]);
- word := StringTools[UpperCase](convert(w, string));
- for i to length(word) do
- letterFound := false;
- for j to numelems(blocks)/2 do
- if not letterFound and (substring(word, i) = blocks[j,1] or substring(word, i) = blocks[j,2]) then
- blocks[j,1] := undefined;
- blocks[j,2] := undefined;
- letterFound := true;
- end if;
- end do;
- if not letterFound then
- return false;
- end if;
- end do;
- return true;
+ word := StringTools[UpperCase](convert(w, string));
+ for i to length(word) do
+ letterFound := false;
+ for j to numelems(blocks)/2 do
+ if not letterFound and (substring(word, i) = blocks[j,1] or substring(word, i) = blocks[j,2]) then
+ blocks[j,1] := undefined;
+ blocks[j,2] := undefined;
+ letterFound := true;
+ end if;
+ end do;
+ if not letterFound then
+ return false;
+ end if;
+ end do;
+ return true;
end proc:
seq(printf("%a: %a\n", i, canSpell(i)), i in [a, Bark, bOok, treat, COMMON, squad, confuse]);
diff --git a/Task/ABC-problem/PowerBASIC/abc-problem.basic b/Task/ABC-problem/PowerBASIC/abc-problem.basic
index ff524d89eb..4a29562c45 100644
--- a/Task/ABC-problem/PowerBASIC/abc-problem.basic
+++ b/Task/ABC-problem/PowerBASIC/abc-problem.basic
@@ -20,7 +20,7 @@
'1.Once a letter on a block is used that block cannot be used again
'2.The function should be case-insensitive
'3. Show your output on this page for the following words:
-' A, BARK, BOOK, TREAT, COMMON, SQUAD, CONFUSE
+' A, BARK, BOOK, TREAT, COMMON, SQUAD, CONFUSE
'-----------------------------------------------------------------------------
' G l o b a l C o n s t a n t s
'
diff --git a/Task/ABC-problem/PowerShell/abc-problem.psh b/Task/ABC-problem/PowerShell/abc-problem.psh
deleted file mode 100644
index 9fd301dcac..0000000000
--- a/Task/ABC-problem/PowerShell/abc-problem.psh
+++ /dev/null
@@ -1,117 +0,0 @@
-<#
-.Synopsis
- ABC Problem
-.DESCRIPTION
- You are given a collection of ABC blocks. Just like the ones you had when you were a kid.
- There are twenty blocks with two letters on each block. You are guaranteed to have a
- complete alphabet amongst all sides of the blocks
- blocks = "BO","XK","DQ","CP","NA","GT","RE","TG","QD","FS","JW","HU","VI","AN","OB","ER","FS","LY","PC","ZM"
- The goal of this task is to write a function that takes a string and can determine whether
- you can spell the word with the given collection of blocks.
-
- The rules are simple:
- 1.Once a letter on a block is used that block cannot be used again
- 2.The function should be case-insensitive
- 3. Show your output on this page for the following words:
- >>> can_make_word("A")
- True
- >>> can_make_word("BARK")
- True
- >>> can_make_word("BOOK")
- False
- >>> can_make_word("TREAT")
- True
- >>> can_make_word("COMMON")
- False
- >>> can_make_word("SQUAD")
- True
- >>> can_make_word("CONFUSE")
- True
-
- Using the examples below you can either see just the value or
- status and the values using the verbose switch
-
-.EXAMPLE
- test-blocks -testword confuse
-
-.EXAMPLE
- test-blocks -testword confuse -verbose
-
-#>
-
-function test-blocks
-{
- [CmdletBinding()]
- # [OutputType([int])]
- Param
- (
- # word to test against blocks
- [Parameter(Mandatory = $true,
- ValueFromPipelineByPropertyName = $true)]
- $testword
-
- )
-
- $word = $testword
-
- #define array of blocks
- [System.Collections.ArrayList]$blockarray = "BO", "XK", "DQ", "CP", "NA", "GT", "RE", "TG", "QD", "FS", "JW", "HU", "VI", "AN", "OB", "ER", "FS", "LY", "PC", "ZM"
-
- #send word to chararray
- $chararray = $word.ToCharArray()
- $chars = $chararray
-
- #get the character count
- $charscount = $chars.count
-
- #get the initial count of the blocks
- $blockcount = $blockarray.Count
-
- #find out how many blocks should be left from the difference
- #of the blocks and characters in the word - 1 letter/1 block
- $correctblockcount = $blockcount - $charscount
-
- #loop through the characters in the word
- foreach ($char in $chars)
- {
-
- #loop through the blocks
- foreach ($block in $blockarray)
- {
-
- #check the current character against each letter on the current block
- #and break if found so the array can reload
- if ($char -in $block[0] -or $char -in $block[1])
- {
-
- write-verbose "match for letter - $char - removing block $block"
- $blockarray.Remove($block)
- break
-
- }
-
- }
-
- }
- #get final count of blocks left in array to determine if the word was
- #correctly made
- $finalblockcount = $blockarray.count
- if ($finalblockcount -ne $correctblockcount)
- {
- write-verbose "$word : $false "
- return $false
- }
- else
- {
- write-verbose "$word : $true "
- return $true
- }
-
-}
-
-#loop all the words and pass them to the function
-$wordlist = "a", "bark", "book", "treat", "common", "squad", "confuse"
-foreach ($word in $wordlist)
-{
- test-blocks -testword $word -Verbose
-}
diff --git a/Task/ABC-problem/Prolog/abc-problem-1.pro b/Task/ABC-problem/Prolog/abc-problem-1.pro
index 99d543c21b..90c7559163 100644
--- a/Task/ABC-problem/Prolog/abc-problem-1.pro
+++ b/Task/ABC-problem/Prolog/abc-problem-1.pro
@@ -1,22 +1,22 @@
abc_problem :-
- maplist(abc_problem, ['', 'A', bark, bOOk, treAT, 'COmmon', sQuaD, 'CONFUSE']).
+ maplist(abc_problem, ['', 'A', bark, bOOk, treAT, 'COmmon', sQuaD, 'CONFUSE']).
abc_problem(Word) :-
- L = [[b,o],[x,k],[d,q],[c,p],[n,a],[g,t],[r,e],[t,g],[q,d],[f,s],
- [j,w],[h,u],[v,i],[a,n],[o,b],[e,r],[f,s],[l,y],[p,c],[z,m]],
+ L = [[b,o],[x,k],[d,q],[c,p],[n,a],[g,t],[r,e],[t,g],[q,d],[f,s],
+ [j,w],[h,u],[v,i],[a,n],[o,b],[e,r],[f,s],[l,y],[p,c],[z,m]],
- ( abc_problem(L, Word)
- -> format('~w OK~n', [Word])
- ; format('~w KO~n', [Word])).
+ ( abc_problem(L, Word)
+ -> format('~w OK~n', [Word])
+ ; format('~w KO~n', [Word])).
abc_problem(L, Word) :-
- atom_chars(Word, C_Words),
- maplist(downcase_atom, C_Words, D_Words),
- can_makeword(L, D_Words).
+ atom_chars(Word, C_Words),
+ maplist(downcase_atom, C_Words, D_Words),
+ can_makeword(L, D_Words).
can_makeword(_L, []).
can_makeword(L, [H | T]) :-
- ( select([H, _], L, L1); select([_, H], L, L1)),
- can_makeword(L1, T).
+ ( select([H, _], L, L1); select([_, H], L, L1)),
+ can_makeword(L1, T).
diff --git a/Task/ABC-problem/SNOBOL4/abc-problem.sno b/Task/ABC-problem/SNOBOL4/abc-problem.sno
index b8cb880ab1..0ed5f49e73 100644
--- a/Task/ABC-problem/SNOBOL4/abc-problem.sno
+++ b/Task/ABC-problem/SNOBOL4/abc-problem.sno
@@ -4,46 +4,46 @@
* Read in blocks to construct the blocks string
in1
- line = replace(input,&lcase,&ucase) :f(in1end)
- line ? breakx(' ') . pre ' ' rem . post :f(in1end)
- blocks = blocks "," pre post
- :(in1)
+ line = replace(input,&lcase,&ucase) :f(in1end)
+ line ? breakx(' ') . pre ' ' rem . post :f(in1end)
+ blocks = blocks "," pre post
+ :(in1)
in1end
* Function to determine if a word can be constructed with the given blocks
- define('abc(blocks,word)s,i,let')
- abcpat = (breakx(',') ',') . pre (*let len(1) | len(1) *let) rem . post
- :(abc_end)
+ define('abc(blocks,word)s,i,let')
+ abcpat = (breakx(',') ',') . pre (*let len(1) | len(1) *let) rem . post
+ :(abc_end)
abc
- eq(size(word),0) :s(abc3)
- s = replace(word,&lcase,&ucase)
- i = 0
+ eq(size(word),0) :s(abc3)
+ s = replace(word,&lcase,&ucase)
+ i = 0
abc2
- i = lt(i,size(s)) i + 1 :f(abc4)
- let = substr(s,i,1)
- blocks ? abcpat = pre post :f(abc3)
- :(abc2)
+ i = lt(i,size(s)) i + 1 :f(abc4)
+ let = substr(s,i,1)
+ blocks ? abcpat = pre post :f(abc3)
+ :(abc2)
abc3
- abc = 'False' :(abc5)
+ abc = 'False' :(abc5)
abc4
- abc = 'True' :(abc5)
+ abc = 'True' :(abc5)
abc5
- output = lpad('can_make_word("' word '"): ',26) abc
- abc = ""
- :(return)
+ output = lpad('can_make_word("' word '"): ',26) abc
+ abc = ""
+ :(return)
abc_end
* Check words
-* output = abc(blocks,"")
-* output = abc(blocks," ")
- output = abc(blocks,'A')
- output = abc(blocks,'bark')
- output = abc(blocks,'BOOK')
- output = abc(blocks,'TrEAT')
- output = abc(blocks,'COMMON')
- output = abc(blocks,'SQUAD')
- output = abc(blocks,'CONFUSE')
-
+* output = abc(blocks,"")
+* output = abc(blocks," ")
+ output = abc(blocks,'A')
+ output = abc(blocks,'bark')
+ output = abc(blocks,'BOOK')
+ output = abc(blocks,'TrEAT')
+ output = abc(blocks,'COMMON')
+ output = abc(blocks,'SQUAD')
+ output = abc(blocks,'CONFUSE')
+
* The blocks are entered below, after the following END label
END
b o
diff --git a/Task/ABC-problem/SenseTalk/abc-problem-1.sensetalk b/Task/ABC-problem/SenseTalk/abc-problem-1.sensetalk
index abbfa87d9a..ca1dcb76f7 100644
--- a/Task/ABC-problem/SenseTalk/abc-problem-1.sensetalk
+++ b/Task/ABC-problem/SenseTalk/abc-problem-1.sensetalk
@@ -1,41 +1,41 @@
function CanMakeWord word
- put [
- ("B", "O"),
- ("X", "K"),
- ("D", "Q"),
- ("C", "P"),
- ("N", "A"),
- ("G", "T"),
- ("R", "E"),
- ("T", "G"),
- ("Q", "D"),
- ("F", "S"),
- ("J", "W"),
- ("H", "U"),
- ("V", "I"),
- ("A", "N"),
- ("O", "B"),
- ("E", "R"),
- ("F", "S"),
- ("L", "Y"),
- ("P", "C"),
- ("Z", "M")
- ] into blocks
-
- repeat with each character letter of word
- put False into found
- repeat with each item block of blocks by reference
- if item 1 of block is letter ignoring case or item 2 of block is letter ignoring case
- delete block
- put True into found
- exit repeat
- end if
- end repeat
- if found is False
- return False
- end if
- end repeat
- return True
-
+ put [
+ ("B", "O"),
+ ("X", "K"),
+ ("D", "Q"),
+ ("C", "P"),
+ ("N", "A"),
+ ("G", "T"),
+ ("R", "E"),
+ ("T", "G"),
+ ("Q", "D"),
+ ("F", "S"),
+ ("J", "W"),
+ ("H", "U"),
+ ("V", "I"),
+ ("A", "N"),
+ ("O", "B"),
+ ("E", "R"),
+ ("F", "S"),
+ ("L", "Y"),
+ ("P", "C"),
+ ("Z", "M")
+ ] into blocks
+
+ repeat with each character letter of word
+ put False into found
+ repeat with each item block of blocks by reference
+ if item 1 of block is letter ignoring case or item 2 of block is letter ignoring case
+ delete block
+ put True into found
+ exit repeat
+ end if
+ end repeat
+ if found is False
+ return False
+ end if
+ end repeat
+ return True
+
end CanMakeWord
diff --git a/Task/ABC-problem/SenseTalk/abc-problem-2.sensetalk b/Task/ABC-problem/SenseTalk/abc-problem-2.sensetalk
index 8949df06a2..7bbcd3910d 100644
--- a/Task/ABC-problem/SenseTalk/abc-problem-2.sensetalk
+++ b/Task/ABC-problem/SenseTalk/abc-problem-2.sensetalk
@@ -1,11 +1,11 @@
repeat with each item word in [
- "A",
- "BARK",
- "BOOK",
- "TREAT",
- "COMMON",
- "SQUAD",
- "CONFUSE"
+ "A",
+ "BARK",
+ "BOOK",
+ "TREAT",
+ "COMMON",
+ "SQUAD",
+ "CONFUSE"
]
- put CanMakeWord(word)
+ put CanMakeWord(word)
end repeat
diff --git a/Task/ABC-problem/SequenceL/abc-problem-1.sequencel b/Task/ABC-problem/SequenceL/abc-problem-1.sequencel
index 57f03ba268..eabaaedc4f 100644
--- a/Task/ABC-problem/SequenceL/abc-problem-1.sequencel
+++ b/Task/ABC-problem/SequenceL/abc-problem-1.sequencel
@@ -2,28 +2,28 @@ import ;
import ;
main(args(2)) :=
- let
- result[i] := args[i] ++ ": " ++ boolToString(can_make_word(args[i], InitBlocks));
- in
- delimit(result, '\n');
+ let
+ result[i] := args[i] ++ ": " ++ boolToString(can_make_word(args[i], InitBlocks));
+ in
+ delimit(result, '\n');
InitBlocks := ["BO", "XK", "DQ", "CP", "NA", "GT", "RE", "TG", "QD", "FS", "JW", "HU", "VI", "AN", "OB", "ER", "FS", "LY", "PC", "ZM"];
-
+
can_make_word(word(1), blocks(2)) :=
- let
- choices[i] := i when some(blocks[i] = toUpper(head(word)));
- blocksAfterChoice[i] := blocks[(1 ... (choices[i] - 1)) ++ ((choices[i] + 1) ... size(blocks))];
- in
- true when size(word) = 0
- else
- false when size(choices) = 0
- else
- some(can_make_word(tail(word), blocksAfterChoice));
-
+ let
+ choices[i] := i when some(blocks[i] = toUpper(head(word)));
+ blocksAfterChoice[i] := blocks[(1 ... (choices[i] - 1)) ++ ((choices[i] + 1) ... size(blocks))];
+ in
+ true when size(word) = 0
+ else
+ false when size(choices) = 0
+ else
+ some(can_make_word(tail(word), blocksAfterChoice));
+
toUpper(letter(0)) :=
- let
- ascii := asciiToInt(letter);
- in
- letter when ascii >= 65 and ascii <= 90
- else
- intToAscii(ascii - 32);
+ let
+ ascii := asciiToInt(letter);
+ in
+ letter when ascii >= 65 and ascii <= 90
+ else
+ intToAscii(ascii - 32);
diff --git a/Task/ABC-problem/SequenceL/abc-problem-2.sequencel b/Task/ABC-problem/SequenceL/abc-problem-2.sequencel
index a82214ee48..11b30e8581 100644
--- a/Task/ABC-problem/SequenceL/abc-problem-2.sequencel
+++ b/Task/ABC-problem/SequenceL/abc-problem-2.sequencel
@@ -3,29 +3,29 @@ import ;
import ;
main(args(2)) :=
- let
- result[i] := args[i] ++ ": " ++ boolToString(can_make_word(args[i], InitBlocks));
- in
- delimit(result, '\n');
+ let
+ result[i] := args[i] ++ ": " ++ boolToString(can_make_word(args[i], InitBlocks));
+ in
+ delimit(result, '\n');
InitBlocks := "BO XK DQ CP NA GT RE TG QD FS JW HU VI AN OB ER FS LY PC ZM";
-
+
can_make_word(word(1), blocks(1)) :=
- let
- regEx := "(\\a" ++ [toUpper(head(word))] ++ "|" ++ [toUpper(head(word))] ++ "\\a)";
-
- newBlocks := replaceFirst(blocks, regEx, "");
- in
- true when size(word) = 0
- else
- false when size(newBlocks) = size(blocks)
- else
- can_make_word(tail(word), newBlocks);
+ let
+ regEx := "(\\a" ++ [toUpper(head(word))] ++ "|" ++ [toUpper(head(word))] ++ "\\a)";
+
+ newBlocks := replaceFirst(blocks, regEx, "");
+ in
+ true when size(word) = 0
+ else
+ false when size(newBlocks) = size(blocks)
+ else
+ can_make_word(tail(word), newBlocks);
toUpper(letter(0)) :=
- let
- ascii := asciiToInt(letter);
- in
- letter when ascii >= 65 and ascii <= 90
- else
- intToAscii(ascii - 32);
+ let
+ ascii := asciiToInt(letter);
+ in
+ letter when ascii >= 65 and ascii <= 90
+ else
+ intToAscii(ascii - 32);
diff --git a/Task/ABC-problem/Smalltalk/abc-problem.st b/Task/ABC-problem/Smalltalk/abc-problem.st
index d6a10f2fbe..3b23286677 100644
--- a/Task/ABC-problem/Smalltalk/abc-problem.st
+++ b/Task/ABC-problem/Smalltalk/abc-problem.st
@@ -1,21 +1,21 @@
ABCPuzzle>>test
- #('A' 'BARK' 'BOOK' 'TreaT' 'COMMON' 'sQUAD' 'CONFuSE') do: [ :each |
- Transcript crShow: each, ': ', (self solveFor: each) asString ]
+ #('A' 'BARK' 'BOOK' 'TreaT' 'COMMON' 'sQUAD' 'CONFuSE') do: [ :each |
+ Transcript crShow: each, ': ', (self solveFor: each) asString ]
ABCPuzzle>>solveFor: letters
- | blocks |
- blocks := #('BO' 'XK' 'DQ' 'CP' 'NA' 'GT' 'RE' 'TG' 'QD' 'FS' 'JW' 'HU' 'VI' 'AN' 'OB' 'ER' 'FS' 'LY' 'PC' 'ZM').
- ^ self solveFor: letters asUppercase with: blocks asOrderedCollection
+ | blocks |
+ blocks := #('BO' 'XK' 'DQ' 'CP' 'NA' 'GT' 'RE' 'TG' 'QD' 'FS' 'JW' 'HU' 'VI' 'AN' 'OB' 'ER' 'FS' 'LY' 'PC' 'ZM').
+ ^ self solveFor: letters asUppercase with: blocks asOrderedCollection
ABCPuzzle>>solveFor: letters with: blocks
- | l ldash matches |
- letters isEmpty ifTrue: [ ^ true ].
- l := letters first.
- ldash := letters allButFirst.
- matches := blocks select: [ :b | b includes: l ].
- matches isEmpty ifTrue: [ ^ false ].
- matches do: [ :m | | bdash |
- bdash := blocks copy.
- bdash remove: m.
- (self solveFor: ldash with: bdash) ifTrue: [ ^ true ] ].
- ^ false
+ | l ldash matches |
+ letters isEmpty ifTrue: [ ^ true ].
+ l := letters first.
+ ldash := letters allButFirst.
+ matches := blocks select: [ :b | b includes: l ].
+ matches isEmpty ifTrue: [ ^ false ].
+ matches do: [ :m | | bdash |
+ bdash := blocks copy.
+ bdash remove: m.
+ (self solveFor: ldash with: bdash) ifTrue: [ ^ true ] ].
+ ^ false
diff --git a/Task/ABC-problem/Swift/abc-problem-2.swift b/Task/ABC-problem/Swift/abc-problem-2.swift
index 026a22d936..be73620266 100644
--- a/Task/ABC-problem/Swift/abc-problem-2.swift
+++ b/Task/ABC-problem/Swift/abc-problem-2.swift
@@ -1,20 +1,20 @@
import Swift
func canMake(word: String) -> Bool {
- var blocks = [
- "BO", "XK", "DQ", "CP", "NA", "GT", "RE", "TG", "QD", "FS",
- "JW", "HU", "VI", "AN", "OB", "ER", "FS", "LY", "PC", "ZM"
- ]
-
- for letter in word.uppercased().characters {
- guard let index = blocks.index(where: { $0.characters.contains(letter) }) else {
- return false
- }
-
- blocks.remove(at: index)
- }
-
- return true
+ var blocks = [
+ "BO", "XK", "DQ", "CP", "NA", "GT", "RE", "TG", "QD", "FS",
+ "JW", "HU", "VI", "AN", "OB", "ER", "FS", "LY", "PC", "ZM"
+ ]
+
+ for letter in word.uppercased().characters {
+ guard let index = blocks.index(where: { $0.characters.contains(letter) }) else {
+ return false
+ }
+
+ blocks.remove(at: index)
+ }
+
+ return true
}
let words = ["a", "bARK", "boOK", "TreAt", "CoMmon", "SquAd", "CONFUse"]
diff --git a/Task/ABC-problem/Tcl/abc-problem.tcl b/Task/ABC-problem/Tcl/abc-problem.tcl
index d3f4b8f321..7dab1aa0e6 100644
--- a/Task/ABC-problem/Tcl/abc-problem.tcl
+++ b/Task/ABC-problem/Tcl/abc-problem.tcl
@@ -2,16 +2,16 @@ package require Tcl 8.6
proc abc {word {blocks {BO XK DQ CP NA GT RE TG QD FS JW HU VI AN OB ER FS LY PC ZM}}} {
set abc {{letters blocks abc} {
- set rest [lassign $letters ch]
- set i 0
- foreach blk $blocks {
- if {$ch in $blk && (![llength $rest]
- || [apply $abc $rest [lreplace $blocks $i $i] $abc])} {
- return true
- }
- incr i
- }
- return false
+ set rest [lassign $letters ch]
+ set i 0
+ foreach blk $blocks {
+ if {$ch in $blk && (![llength $rest]
+ || [apply $abc $rest [lreplace $blocks $i $i] $abc])} {
+ return true
+ }
+ incr i
+ }
+ return false
}}
return [apply $abc [split $word ""] [lmap b $blocks {split $b ""}] $abc]
}
diff --git a/Task/ABC-problem/Transd/abc-problem.transd b/Task/ABC-problem/Transd/abc-problem.transd
index 3ac73650a8..b0bf878924 100644
--- a/Task/ABC-problem/Transd/abc-problem.transd
+++ b/Task/ABC-problem/Transd/abc-problem.transd
@@ -2,7 +2,7 @@
MainModule: {
blocks: ["BO", "XK", "DQ", "CP", "NA", "GT", "RE", "TG", "QD", "FS",
- "JW", "HU", "VI", "AN", "OB", "ER", "FS", "LY", "PC", "ZM"],
+ "JW", "HU", "VI", "AN", "OB", "ER", "FS", "LY", "PC", "ZM"],
words: ["A","BARK","BOOK","TREAT","COMMON","SQUAD","CONFUSE"],
testMake: Lambda Bool>(λ
@@ -16,7 +16,7 @@ MainModule: {
)
(ret false)
),
- _start: (lambda
+ _start: (lambda
(for word in words do
(lout :boolalpha word " : "
(exec testMake word blocks))
diff --git a/Task/ABC-problem/Ultimate++/abc-problem.ultimate++ b/Task/ABC-problem/Ultimate++/abc-problem.ultimate++
index 13a35283ad..fbfcebdcc0 100644
--- a/Task/ABC-problem/Ultimate++/abc-problem.ultimate++
+++ b/Task/ABC-problem/Ultimate++/abc-problem.ultimate++
@@ -19,84 +19,84 @@ using namespace Upp;
int can_make_words(char **b, char *word)
{
- int i, ret = 0, c = toupper(*word);
-
- if (!c) return 1;
- if (!b[0]) return 0;
-
- for (i = 0; b[i] && !ret; i++) {
- if (b[i][0] != c && b[i][1] != c) continue;
- Swap(b[i], b[0]); // It needs to be Swap and not SWAP
- ret = can_make_words(b + 1, word + 1);
- Swap(b[i], b[0]); // It needs to be Swap instead of SWAP
- }
- return ret;
+ int i, ret = 0, c = toupper(*word);
+
+ if (!c) return 1;
+ if (!b[0]) return 0;
+
+ for (i = 0; b[i] && !ret; i++) {
+ if (b[i][0] != c && b[i][1] != c) continue;
+ Swap(b[i], b[0]); // It needs to be Swap and not SWAP
+ ret = can_make_words(b + 1, word + 1);
+ Swap(b[i], b[0]); // It needs to be Swap instead of SWAP
+ }
+ return ret;
}
//C++
bool can_create_word(const std::string& w, const list_t& vals) {
- std::set used;
- while (used.size() < w.size()) {
- const char c = toupper(w[used.size()]);
- uint32_t x = used.size();
- for (uint32_t i = 0, ii = vals.size(); i < ii; ++i) {
- if (used.find(i) == used.end()) {
- if (toupper(vals[i].first) == c || toupper(vals[i].second) == c) {
- used.insert(i);
- break;
- }
- }
- }
- if (x == used.size()) break;
- }
- return used.size() == w.size();
+ std::set used;
+ while (used.size() < w.size()) {
+ const char c = toupper(w[used.size()]);
+ uint32_t x = used.size();
+ for (uint32_t i = 0, ii = vals.size(); i < ii; ++i) {
+ if (used.find(i) == used.end()) {
+ if (toupper(vals[i].first) == c || toupper(vals[i].second) == c) {
+ used.insert(i);
+ break;
+ }
+ }
+ }
+ if (x == used.size()) break;
+ }
+ return used.size() == w.size();
}
// U++
CONSOLE_APP_MAIN
{
- // C
- char* blocks[] =
- {
- (char*)"BO", (char*)"XK", (char*)"DQ", (char*)"CP",
- (char*)"NA", (char*)"GT", (char*)"RE", (char*)"TG",
- (char*)"QD", (char*)"FS", (char*)"JW", (char*)"HU",
- (char*)"VI", (char*)"AN", (char*)"OB", (char*)"ER",
- (char*)"FS", (char*)"LY", (char*)"PC", (char*)"ZM", 0
- };
+ // C
+ char* blocks[] =
+ {
+ (char*)"BO", (char*)"XK", (char*)"DQ", (char*)"CP",
+ (char*)"NA", (char*)"GT", (char*)"RE", (char*)"TG",
+ (char*)"QD", (char*)"FS", (char*)"JW", (char*)"HU",
+ (char*)"VI", (char*)"AN", (char*)"OB", (char*)"ER",
+ (char*)"FS", (char*)"LY", (char*)"PC", (char*)"ZM", 0
+ };
- char *words[] =
- {
- (char*)"", (char*)"A", (char*)"BARK", (char*)"BOOK",
- (char*)"TREAT", (char*)"COMMON", (char*)"SQUAD", (char*)"Confuse", 0
- };
-
- char **w;
- for (w = words; *w; w++)
- printf("%s\t%d\n", *w, can_make_words(blocks, *w));
-
- printf("\n");
-
- // C++
- list_t vals{ {'B', 'O'}, {'X', 'K'}, {'D', 'Q'}, {'C', 'P'},
- {'N', 'A'}, {'G', 'T'}, {'R', 'E'}, {'T', 'G'}, {'Q', 'D'},
- {'F', 'S'}, {'J', 'W'}, {'H', 'U'}, {'V', 'I'}, {'A', 'N'},
- {'O', 'B'}, {'E', 'R'}, {'F', 'S'}, {'L', 'Y'}, {'P', 'C'},
- {'Z', 'M'}
- };
- std::vector wordsb{"A", "BARK", "BOOK", "TREAT", "COMMON", "SQUAD", "Confuse"};
- for (const std::string& w : wordsb) {
- std::cout << w << ": " << std::boolalpha << can_create_word(w, vals) << ".\n";
- }
- std::cout << "\n";
-
+ char *words[] =
+ {
+ (char*)"", (char*)"A", (char*)"BARK", (char*)"BOOK",
+ (char*)"TREAT", (char*)"COMMON", (char*)"SQUAD", (char*)"Confuse", 0
+ };
-
- const Vector& cmdline = CommandLine();
- for(int i = 0; i < cmdline.GetCount(); i++) {
- }
+ char **w;
+ for (w = words; *w; w++)
+ printf("%s\t%d\n", *w, can_make_words(blocks, *w));
+
+ printf("\n");
+
+ // C++
+ list_t vals{ {'B', 'O'}, {'X', 'K'}, {'D', 'Q'}, {'C', 'P'},
+ {'N', 'A'}, {'G', 'T'}, {'R', 'E'}, {'T', 'G'}, {'Q', 'D'},
+ {'F', 'S'}, {'J', 'W'}, {'H', 'U'}, {'V', 'I'}, {'A', 'N'},
+ {'O', 'B'}, {'E', 'R'}, {'F', 'S'}, {'L', 'Y'}, {'P', 'C'},
+ {'Z', 'M'}
+ };
+ std::vector wordsb{"A", "BARK", "BOOK", "TREAT", "COMMON", "SQUAD", "Confuse"};
+ for (const std::string& w : wordsb) {
+ std::cout << w << ": " << std::boolalpha << can_create_word(w, vals) << ".\n";
+ }
+ std::cout << "\n";
+
+
+
+ const Vector& cmdline = CommandLine();
+ for(int i = 0; i < cmdline.GetCount(); i++) {
+ }
}
diff --git a/Task/ABC-problem/V-(Vlang)/abc-problem.v b/Task/ABC-problem/V-(Vlang)/abc-problem.v
index fbda461417..cf760dbe08 100644
--- a/Task/ABC-problem/V-(Vlang)/abc-problem.v
+++ b/Task/ABC-problem/V-(Vlang)/abc-problem.v
@@ -1,29 +1,29 @@
const
(
- blocks = ["BO","XK","DQ","CP","NA","GT","RE","TG","QD","FS","JW","HU","VI","AN","OB","ER","FS","LY","PC","ZM"]
- words = ["A", BARK","BOOK","TREAT","COMMON","SQUAD","CONFUSE"]
+ blocks = ["BO","XK","DQ","CP","NA","GT","RE","TG","QD","FS","JW","HU","VI","AN","OB","ER","FS","LY","PC","ZM"]
+ words = ["A", BARK","BOOK","TREAT","COMMON","SQUAD","CONFUSE"]
)
fn main() {
- for word in words {
- println('>>> can_make_word("${word.to_upper()}"): ')
- if check_word(word, blocks) == true {println('True')} else {println('False')}
- }
+ for word in words {
+ println('>>> can_make_word("${word.to_upper()}"): ')
+ if check_word(word, blocks) == true {println('True')} else {println('False')}
+ }
}
fn check_word(word string, blocks []string) bool {
- mut tblocks := blocks.clone()
- mut found := false
- for chr in word {
- found = false
- for idx, _ in tblocks {
- if tblocks[idx].contains(chr.ascii_str()) == true {
- tblocks[idx] =''
- found = true
- break
- }
- }
- if found == false {return found}
- }
- return found
+ mut tblocks := blocks.clone()
+ mut found := false
+ for chr in word {
+ found = false
+ for idx, _ in tblocks {
+ if tblocks[idx].contains(chr.ascii_str()) == true {
+ tblocks[idx] =''
+ found = true
+ break
+ }
+ }
+ if found == false {return found}
+ }
+ return found
}
diff --git a/Task/ABC-problem/Yabasic/abc-problem.basic b/Task/ABC-problem/Yabasic/abc-problem.basic
index c2e561b9f7..d7db87519a 100644
--- a/Task/ABC-problem/Yabasic/abc-problem.basic
+++ b/Task/ABC-problem/Yabasic/abc-problem.basic
@@ -1,28 +1,28 @@
letters$ = "BO,XK,DQ,CP,NA,GT,RE,TG,QD,FS,JW,HU,VI,AN,OB,ER,FS,LY,PC,ZM"
sub canMake(letters$, word$)
- local i, j, p, n, pairs$(1)
-
- n = token(letters$, pairs$(), ",")
- word$ = upper$(word$)
-
- for i = 1 to len(word$)
- for j = 1 to n
- p = instr(pairs$(j), mid$(word$, i, 1))
- if p then
- pairs$(j) = ""
- break
- end if
- next j
- if not p return false
- next i
- return true
+ local i, j, p, n, pairs$(1)
+
+ n = token(letters$, pairs$(), ",")
+ word$ = upper$(word$)
+
+ for i = 1 to len(word$)
+ for j = 1 to n
+ p = instr(pairs$(j), mid$(word$, i, 1))
+ if p then
+ pairs$(j) = ""
+ break
+ end if
+ next j
+ if not p return false
+ next i
+ return true
end sub
-print "a = ", canMake(letters$, "a") // 1 = true
-print "bark = ", canMake(letters$, "Bark") // 1
-print "book = ", canMake(letters$, "BooK") // 0 = false
-print "treat = ", canMake(letters$, "TREAt") // 1
-print "common = ", canMake(letters$, "common") // 0
-print "squad = ", canMake(letters$, "squad") // 1
-print "confuse = ", canMake(letters$, "confuse") // 1
+print "a = ", canMake(letters$, "a") // 1 = true
+print "bark = ", canMake(letters$, "Bark") // 1
+print "book = ", canMake(letters$, "BooK") // 0 = false
+print "treat = ", canMake(letters$, "TREAt") // 1
+print "common = ", canMake(letters$, "common") // 0
+print "squad = ", canMake(letters$, "squad") // 1
+print "confuse = ", canMake(letters$, "confuse") // 1
diff --git a/Task/ABC-problem/Zkl/abc-problem.zkl b/Task/ABC-problem/Zkl/abc-problem.zkl
index 66da4854fc..a34c775681 100644
--- a/Task/ABC-problem/Zkl/abc-problem.zkl
+++ b/Task/ABC-problem/Zkl/abc-problem.zkl
@@ -1,14 +1,14 @@
var blocks=T("BO", "XK", "DQ", "CP", "NA", "GT", "RE", "TG", "QD", "FS",
- "JW", "HU", "VI", "AN", "OB", "ER", "FS", "LY", "PC", "ZM", );
+ "JW", "HU", "VI", "AN", "OB", "ER", "FS", "LY", "PC", "ZM", );
fcn can_make_word(word){
fcn(blks,word){
if (not word) return(True); // bottom of recursion
foreach b in (blks){ n:=__bWalker.idx;
- if(not b.holds(word[0])) continue; // letter not on this block
- blks.del(n); // remove this block from pile
- if (self.fcn(blks,word[1,*])) return(True); // try remaining blocks
- blks.insert(n,b); // put block back in pile: backtracking
+ if(not b.holds(word[0])) continue; // letter not on this block
+ blks.del(n); // remove this block from pile
+ if (self.fcn(blks,word[1,*])) return(True); // try remaining blocks
+ blks.insert(n,b); // put block back in pile: backtracking
}
False; // out of blocks but not out of word
}(blocks.copy(),word.toUpper())
diff --git a/Task/ABC-problem/Zonnon/abc-problem.zonnon b/Task/ABC-problem/Zonnon/abc-problem.zonnon
index c0dde3c245..731ebadcf1 100644
--- a/Task/ABC-problem/Zonnon/abc-problem.zonnon
+++ b/Task/ABC-problem/Zonnon/abc-problem.zonnon
@@ -1,87 +1,87 @@
module Main;
type
- Block = record
- l,r: char;
- used: boolean;
- end Block;
+ Block = record
+ l,r: char;
+ used: boolean;
+ end Block;
var
- blocks: array 20 of Block;
+ blocks: array 20 of Block;
procedure Exists(c: char): boolean;
var
- i: integer;
- r: boolean;
+ i: integer;
+ r: boolean;
begin
- r := false;i := 0;
- while ~r & (i < len(blocks)) do
- if ~(blocks[i].used) then
- r := (blocks[i].l = cap(c)) or (blocks[i].r = cap(c));
- blocks[i].used := r;
- end;
- inc(i)
- end;
- return r
+ r := false;i := 0;
+ while ~r & (i < len(blocks)) do
+ if ~(blocks[i].used) then
+ r := (blocks[i].l = cap(c)) or (blocks[i].r = cap(c));
+ blocks[i].used := r;
+ end;
+ inc(i)
+ end;
+ return r
end Exists;
procedure CanMakeWord(s: string);
var
- i: integer;
- made: boolean;
+ i: integer;
+ made: boolean;
begin
- made := true;
- for i := 0 to len(s) - 1 do
- made := made & Exists(s[i])
- end;
- writeln(s:20,"?",made);
- Clean()
+ made := true;
+ for i := 0 to len(s) - 1 do
+ made := made & Exists(s[i])
+ end;
+ writeln(s:20,"?",made);
+ Clean()
end CanMakeWord;
procedure Clean();
var
- i: integer;
+ i: integer;
begin
- for i := 0 to len(blocks) - 1 do
- blocks[i].used := false
- end
+ for i := 0 to len(blocks) - 1 do
+ blocks[i].used := false
+ end
end Clean;
procedure InitBlock(i:integer;l,r:char);
begin
- blocks[i].l := l;blocks[i].r := r;
- blocks[i].used := false;
+ blocks[i].l := l;blocks[i].r := r;
+ blocks[i].used := false;
end InitBlock;
procedure Init;
begin
- InitBlock(0,'B','O');
- InitBlock(1,'X','K');
- InitBlock(2,'D','Q');
- InitBlock(3,'C','Q');
- InitBlock(4,'N','A');
- InitBlock(5,'G','T');
- InitBlock(6,'R','E');
- InitBlock(7,'T','G');
- InitBlock(8,'Q','D');
- InitBlock(9,'F','S');
- InitBlock(10,'J','W');
- InitBlock(11,'H','U');
- InitBlock(12,'V','I');
- InitBlock(13,'A','N');
- InitBlock(14,'O','B');
- InitBlock(15,'E','R');
- InitBlock(16,'F','S');
- InitBlock(17,'L','Y');
- InitBlock(18,'P','C');
- InitBlock(19,'Z','M')
+ InitBlock(0,'B','O');
+ InitBlock(1,'X','K');
+ InitBlock(2,'D','Q');
+ InitBlock(3,'C','Q');
+ InitBlock(4,'N','A');
+ InitBlock(5,'G','T');
+ InitBlock(6,'R','E');
+ InitBlock(7,'T','G');
+ InitBlock(8,'Q','D');
+ InitBlock(9,'F','S');
+ InitBlock(10,'J','W');
+ InitBlock(11,'H','U');
+ InitBlock(12,'V','I');
+ InitBlock(13,'A','N');
+ InitBlock(14,'O','B');
+ InitBlock(15,'E','R');
+ InitBlock(16,'F','S');
+ InitBlock(17,'L','Y');
+ InitBlock(18,'P','C');
+ InitBlock(19,'Z','M')
end Init;
begin
- Init();
- CanMakeWord("A");
- CanMakeWord("BARK");
- CanMakeWord("BOOK");
- CanMakeWord("TREAT");
- CanMakeWord("COMMON");
- CanMakeWord("confuse");
+ Init();
+ CanMakeWord("A");
+ CanMakeWord("BARK");
+ CanMakeWord("BOOK");
+ CanMakeWord("TREAT");
+ CanMakeWord("COMMON");
+ CanMakeWord("confuse");
end Main.
diff --git a/Task/ADFGVX-cipher/11l/adfgvx-cipher.11l b/Task/ADFGVX-cipher/11l/adfgvx-cipher.11l
index e1dd671422..739e221d0a 100644
--- a/Task/ADFGVX-cipher/11l/adfgvx-cipher.11l
+++ b/Task/ADFGVX-cipher/11l/adfgvx-cipher.11l
@@ -3,8 +3,8 @@ V adfgvx = ‘ADFGVX’
F encrypt(plainText, polybius, key)
V s = ‘’
L(ch) plainText
- L(r) 6
- L(c) 6
+ L(r) 0.<6
+ L(c) 0.<6
I polybius[r][c] == ch
s ‘’= :adfgvx[r]‘’:adfgvx[c]
@@ -43,8 +43,8 @@ F decrypt(cipherText, polybius, key)
V polybius = [[Char("\0")] * 6] * 6
V alphabet = ‘ABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789’
random:shuffle(&alphabet)
-L(r) 6
- L(c) 6
+L(r) 0.<6
+ L(c) 0.<6
polybius[r][c] = alphabet[6 * r + c]
print("6 x 6 Polybius square:\n")
diff --git a/Task/AKS-test-for-primes/11l/aks-test-for-primes.11l b/Task/AKS-test-for-primes/11l/aks-test-for-primes.11l
index 110ea6ed1e..dc2fcec555 100644
--- a/Task/AKS-test-for-primes/11l/aks-test-for-primes.11l
+++ b/Task/AKS-test-for-primes/11l/aks-test-for-primes.11l
@@ -12,7 +12,7 @@ F aks_test(p)
R !any(ex[0 .< (len)-1].map(mult -> mult % @p != 0))
print(‘# p: (x-1)^p for small p’)
-L(p) 12
+L(p) 0.<12
print(‘#3: #.’.format(p, enumerate(expand_x_1(p)).map((n, e) -> ‘#.#.#.’.format(‘+’ * (e >= 0), e, I n {(‘x^#.’.format(n))} E ‘’)).join(‘ ’)))
print("\n# small primes using the aks test")
diff --git a/Task/AKS-test-for-primes/Ada/aks-test-for-primes.ada b/Task/AKS-test-for-primes/Ada/aks-test-for-primes.ada
deleted file mode 100644
index 0ea9ed95f6..0000000000
--- a/Task/AKS-test-for-primes/Ada/aks-test-for-primes.ada
+++ /dev/null
@@ -1,88 +0,0 @@
-with Ada.Text_IO;
-
-procedure Test_For_Primes is
-
- type Pascal_Triangle_Type is array (Natural range <>) of Long_Long_Integer;
-
- function Calculate_Pascal_Triangle (N : in Natural) return Pascal_Triangle_Type is
- Pascal_Triangle : Pascal_Triangle_Type (0 .. N);
- begin
- Pascal_Triangle (0) := 1;
- for I in Pascal_Triangle'First .. Pascal_Triangle'Last - 1 loop
- Pascal_Triangle (1 + I) := 1;
- for J in reverse 1 .. I loop
- Pascal_Triangle (J) := Pascal_Triangle (J - 1) - Pascal_Triangle (J);
- end loop;
- Pascal_Triangle (0) := -Pascal_Triangle (0);
- end loop;
- return Pascal_Triangle;
- end Calculate_Pascal_Triangle;
-
- function Is_Prime (N : Integer) return Boolean is
- I : Integer;
- Result : Boolean := True;
- Pascal_Triangle : constant Pascal_Triangle_Type := Calculate_Pascal_Triangle (N);
- begin
- I := N / 2;
- while Result and I > 1 loop
- Result := Result and Pascal_Triangle (I) mod Long_Long_Integer (N) = 0;
- I := I - 1;
- end loop;
- return Result;
- end Is_Prime;
-
- function Image (N : in Long_Long_Integer;
- Sign : in Boolean := False) return String is
- Image : constant String := N'Image;
- begin
- if N < 0 then
- return Image;
- else
- if Sign then
- return "+" & Image (Image'First + 1 .. Image'Last);
- else
- return Image (Image'First + 1 .. Image'Last);
- end if;
- end if;
- end Image;
-
- procedure Show (Triangle : in Pascal_Triangle_Type) is
- use Ada.Text_IO;
- Begin
- for I in reverse Triangle'Range loop
- Put (Image (Triangle (I), Sign => True));
- Put ("x^");
- Put (Image (Long_Long_Integer (I)));
- Put (" ");
- end loop;
- end Show;
-
- procedure Show_Pascal_Triangles is
- use Ada.Text_IO;
- begin
- for N in 0 .. 9 loop
- declare
- Pascal_Triangle : constant Pascal_Triangle_Type := Calculate_Pascal_Triangle (N);
- begin
- Put ("(x-1)^" & Image (Long_Long_Integer (N)) & " = ");
- Show (Pascal_Triangle);
- New_Line;
- end;
- end loop;
- end Show_Pascal_Triangles;
-
- procedure Show_Primes is
- use Ada.Text_IO;
- begin
- for N in 2 .. 63 loop
- if Is_Prime (N) then
- Put (N'Image);
- end if;
- end loop;
- New_Line;
- end Show_Primes;
-
-begin
- Show_Pascal_Triangles;
- Show_Primes;
-end Test_For_Primes;
diff --git a/Task/AKS-test-for-primes/Elena/aks-test-for-primes.elena b/Task/AKS-test-for-primes/Elena/aks-test-for-primes.elena
index 714dc0f0ae..bda73a4cdf 100644
--- a/Task/AKS-test-for-primes/Elena/aks-test-for-primes.elena
+++ b/Task/AKS-test-for-primes/Elena/aks-test-for-primes.elena
@@ -50,7 +50,7 @@ singleton AksTest
}
}
-public program()
+public Program()
{
for (int n := 0; n < 10; n += 1) {
AksTest.coef(n);
diff --git a/Task/AKS-test-for-primes/PowerShell/aks-test-for-primes.psh b/Task/AKS-test-for-primes/PowerShell/aks-test-for-primes.psh
deleted file mode 100644
index c79bcdf5e7..0000000000
--- a/Task/AKS-test-for-primes/PowerShell/aks-test-for-primes.psh
+++ /dev/null
@@ -1,84 +0,0 @@
-# AKS test for primes
-
-$script:PasTriMax = 61 # for long type of Pascal triangle numbers
-
-function Pascal-Triangle {
- # Calculate the n'th line 0.. middle
- param(
- [int]$N
- )
-
- $pasTri = [long[]]::new([math]::Ceiling(($N + 2) / 2))
- $pasTri[0] = 1
- [int]$j = 1
- while ($j -le $N) {
- $j++
- [int]$k = [math]::Floor($j / 2)
- $pasTri[$k] = $pasTri[$k - 1]
- for (; $k -ge 1; $k--) {
- $pasTri[$k] += $pasTri[$k - 1]
- }
- }
- # Now: $j -eq ($N + 1), so $k -eq [math]::Floor(($N + 1) / 2)
- return $pasTri
-}
-
-function Expand-Poly {
- param ([int]$N)
-
- if ($N -gt $script:PasTriMax) {
- throw "$N is out of range"
- }
- switch($N) {
- 0 {Write-Output "(x-1)^0 = 1"}
- 1 {Write-Output "(x-1)^1 = x-1"}
- default {
- $VZ = @('+', '-')
- $pasTri = Pascal-Triangle($N)
- [string]$outTri = @()
- $outTri += "(x-1)^$N = x^$N"
- [bool]$bVz = $true
- [int]$nDiv2 = [math]::Floor($N / 2)
- for ([int]$j = $N - 1; $j -gt $nDiv2; $j--) {
- $outTri += "$($VZ[$bVz]) $($pasTri[$N - $j])*x^$j"
- $bVz = -not $bVz
- }
- for ([int]$j = $nDiv2; $j -gt 1; $j--) {
- $outTri += "$($VZ[$bVz]) $($pasTri[$j])*x^$j"
- $bVz = -not $bVz
- }
- $outTri += "$($VZ[$bVz]) $($pasTri[1])*x"
- $bVz = -not $bVz
- $outTri += "$($VZ[$bVz]) $($pasTri[0])"
- Write-Output $outTri
- }
- }
-}
-
-function Is-Prime {
- param([int]$N)
-
- if ($N -gt $script:PasTriMax) {
- throw "$N is out of range"
- }
- $pasTri = Pascal-Triangle($N)
- [bool]$res = $true
- [int]$i = [math]::Floor($N / 2)
- while ($res -and ($i -gt 1)) {
- $res = $res -and ($pasTri[$i] % $N -eq 0)
- $i--
- }
- return $res
-}
-
-# Test program
-foreach ($n in 0..9) {
- Expand-Poly($n)
-}
-[string]$primes = @()
-foreach ($n in 2..$script:PasTriMax) {
- if (Is-Prime($n)) {
- $primes += "{0,3}" -f $n
- }
-}
-Write-Output $primes
diff --git a/Task/AKS-test-for-primes/REXX/aks-test-for-primes-2.rexx b/Task/AKS-test-for-primes/REXX/aks-test-for-primes-2.rexx
index 80afc0c295..c900672143 100644
--- a/Task/AKS-test-for-primes/REXX/aks-test-for-primes-2.rexx
+++ b/Task/AKS-test-for-primes/REXX/aks-test-for-primes-2.rexx
@@ -1,5 +1,5 @@
--- 28 Jul 2025
-include Settings
+-- 23 Aug 2025
+include Setting
arg p
if p = '' then
p = 10
diff --git a/Task/AVL-tree/Ada/avl-tree.ada b/Task/AVL-tree/Ada/avl-tree.ada
deleted file mode 100644
index 23f26aef02..0000000000
--- a/Task/AVL-tree/Ada/avl-tree.ada
+++ /dev/null
@@ -1,241 +0,0 @@
-with Ada.Text_IO, Ada.Finalization, Ada.Unchecked_Deallocation;
-
-procedure Main is
-
- generic
- type Key_Type is private;
- with function "<"(a, b : Key_Type) return Boolean is <>;
- with function "="(a, b : Key_Type) return Boolean is <>;
- with function "<="(a, b : Key_Type) return Boolean is <>;
- package AVL_Tree is
- type Tree is tagged limited private;
- function insert(self : in out Tree; key : Key_Type) return Boolean;
- procedure delete(self : in out Tree; key : Key_Type);
- procedure print_balance(self : in out Tree);
-
- private
- type Height_Amt is range -1 .. Integer'Last;
-
- -- Since only one key is inserted before each rebalance, the balance of
- -- all trees/subtrees will stay in range -2 .. 2
- type Balance_Amt is range -2 .. 2;
-
- type Node;
- type Node_Ptr is access Node;
- type Node is new Ada.Finalization.Limited_Controlled with record
- left, right, parent : Node_Ptr := null;
- key : Key_Type;
- balance : Balance_Amt := 0;
- end record;
- overriding procedure Finalize(self : in out Node);
- subtype Node_Parent is Ada.Finalization.Limited_Controlled;
-
- type Tree is new Ada.Finalization.Limited_Controlled with record
- root : Node_Ptr := null;
- end record;
- overriding procedure Finalize(self : in out Tree);
-
- end AVL_Tree;
-
- package body AVL_Tree is
-
- procedure Free_Node is new Ada.Unchecked_Deallocation(Node, Node_Ptr);
-
- overriding procedure Finalize(self : in out Node) is
- begin
- Free_Node(self.left);
- Free_Node(self.right);
- end Finalize;
-
- overriding procedure Finalize(self : in out Tree) is
- begin
- Free_Node(self.root);
- end Finalize;
-
-
- function height(n : Node_Ptr) return Height_Amt is
- begin
- if n = null then
- return -1;
- else
- return 1 + Height_Amt'Max(height(n.left), height(n.right));
- end if;
- end height;
-
- procedure set_balance(n : not null Node_Ptr) is
- begin
- n.balance := Balance_Amt(height(n.right) - height(n.left));
- end set_balance;
-
- procedure update_parent(parent : Node_Ptr; new_child : Node_Ptr; old_child : Node_Ptr) is
- begin
- if parent /= null then
- if parent.right = old_child then
- parent.right := new_child;
- else
- parent.left := new_child;
- end if;
- end if;
- end update_parent;
-
- function rotate_left(a : not null Node_Ptr) return Node_Ptr is
- b : Node_Ptr := a.right;
- begin
- b.parent := a.parent;
- a.right := b.left;
- if a.right /= null then
- a.right.parent := a;
- end if;
- b.left := a;
- a.parent := b;
- update_parent(parent => b.parent, new_child => b, old_child => a);
-
- set_balance(a);
- set_balance(b);
- return b;
- end rotate_left;
-
- function rotate_right(a : not null Node_Ptr) return Node_Ptr is
- b : Node_Ptr := a.left;
- begin
- b.parent := a.parent;
- a.left := b.right;
- if a.left /= null then
- a.left.parent := a;
- end if;
- b.right := a;
- a.parent := b;
- update_parent(parent => b.parent, new_child => b, old_child => a);
-
- set_balance(a);
- set_balance(b);
- return b;
- end rotate_right;
-
- function rotate_left_right(n : not null Node_Ptr) return Node_Ptr is
- begin
- n.left := rotate_left(n.left);
- return rotate_right(n);
- end rotate_left_right;
-
- function rotate_right_left(n : not null Node_Ptr) return Node_Ptr is
- begin
- n.right := rotate_right(n.right);
- return rotate_left(n);
- end rotate_right_left;
-
- procedure rebalance(self : in out Tree; n : not null Node_Ptr) is
- new_n : Node_Ptr := n;
- begin
- set_balance(new_n);
- if new_n.balance = -2 then
- if height(new_n.left.left) >= height(new_n.left.right) then
- new_n := rotate_right(new_n);
- else
- new_n := rotate_left_right(new_n);
- end if;
- elsif new_n.balance = 2 then
- if height(new_n.right.right) >= height(new_n.right.left) then
- new_n := rotate_left(new_n);
- else
- new_n := rotate_right_left(new_n);
- end if;
- end if;
-
- if new_n.parent /= null then
- rebalance(self, new_n.parent);
- else
- self.root := new_n;
- end if;
- end rebalance;
-
- function new_node(key : Key_Type) return Node_Ptr is
- (new Node'(Node_Parent with key => key, others => <>));
-
- function insert(self : in out Tree; key : Key_Type) return Boolean is
- curr, parent : Node_Ptr;
- go_left : Boolean;
- begin
- if self.root = null then
- self.root := new_node(key);
- return True;
- end if;
-
- curr := self.root;
- while curr.key /= key loop
- parent := curr;
- go_left := key < curr.key;
- curr := (if go_left then curr.left else curr.right);
- if curr = null then
- if go_left then
- parent.left := new_node(key);
- parent.left.parent := parent;
- else
- parent.right := new_node(key);
- parent.right.parent := parent;
- end if;
- rebalance(self, parent);
- return True;
- end if;
- end loop;
- return False;
- end insert;
-
- procedure delete(self : in out Tree; key : Key_Type) is
- successor, parent, child : Node_Ptr := self.root;
- to_delete : Node_Ptr := null;
- begin
- if self.root = null then
- return;
- end if;
-
- while child /= null loop
- parent := successor;
- successor := child;
- child := (if successor.key <= key then successor.right else successor.left);
- if successor.key = key then
- to_delete := successor;
- end if;
- end loop;
-
- if to_delete = null then
- return;
- end if;
- to_delete.key := successor.key;
- child := (if successor.left = null then successor.right else successor.left);
- if self.root.key = key then
- self.root := child;
- else
- update_parent(parent => parent, new_child => child, old_child => successor);
- rebalance(self, parent);
- end if;
- Free_Node(successor);
- end delete;
-
- procedure print_balance(n : Node_Ptr) is
- begin
- if n /= null then
- print_balance(n.left);
- Ada.Text_IO.Put(n.balance'Image);
- print_balance(n.right);
- end if;
- end print_balance;
-
- procedure print_balance(self : in out Tree) is
- begin
- print_balance(self.root);
- end print_balance;
- end AVL_Tree;
-
- package Int_AVL_Tree is new AVL_Tree(Integer);
-
- tree : Int_AVL_Tree.Tree;
- success : Boolean;
-begin
- for i in 1 .. 10 loop
- success := tree.insert(i);
- end loop;
- Ada.Text_IO.Put("Printing balance: ");
- tree.print_balance;
- Ada.Text_IO.New_Line;
-end Main;
diff --git a/Task/AVL-tree/Emacs-Lisp/avl-tree.l b/Task/AVL-tree/Emacs-Lisp/avl-tree.l
deleted file mode 100644
index f639c21adc..0000000000
--- a/Task/AVL-tree/Emacs-Lisp/avl-tree.l
+++ /dev/null
@@ -1,212 +0,0 @@
-(defvar avl-all-nodes (make-vector 100 nil))
-(defvar avl-root-node nil "root node")
-
-(defun avl-create-node (key parent)
- (copy-tree `((:key . ,key) (:balance . nil) (:height . nil)
- (:left . nil) (:right . nil) (:parent . ,parent))))
-
-(defun avl-node (pos)
- (if (or (null pos) (> pos (1- (length avl-all-nodes))))
- nil
- (aref avl-all-nodes pos)))
-
-(defun avl-node-prop (noderef &rest props)
- (if (null noderef)
- nil
- (progn
- ;;(when (integerp noderef) (setq node (avl-node node)))
- (let ((val noderef))
- (dolist (prop props)
- (if (null (avl-node val))
- (setq val nil)
- (progn
- (setq val (alist-get prop (avl-node val))))))
- val)
- )
- )
- )
-
-
-(defun avl-set-prop (node &rest props-and-value)
- (when (integerp node) (setq node (avl-node node)))
- (when (< (length props-and-value) 2)
- (error "Both property name and value must be given."))
- (let (noderef (props (seq-take props-and-value (1- (length props-and-value))))
- (value (seq-elt props-and-value (1- (length props-and-value)))))
- (when (> (length props) 0)
- (dolist (prop (seq-take props (1- (length props))))
- (if (null node)
- (progn (setq noderef nil) (setq node nil))
- (progn
- (setq noderef (alist-get prop node))
- (setq node (avl-node noderef))))))
-
- (if (or (null (last props)) (null node))
- nil
- (setcdr (assoc (car (last props)) node) value))))
-
-
-(defun avl-height (noderef)
- (or (avl-node-prop noderef :height) -1))
-
-(defun avl-reheight (noderef)
- (if (null noderef)
- nil
- (avl-set-prop noderef :height
- (1+ (max (avl-height (avl-node-prop noderef :left))
- (avl-height (avl-node-prop noderef :right)))))))
-
-(defun avl-setbalance (noderef)
- ;;(when (integerp node) (setq node (avl-node node)))
- (avl-reheight noderef)
- (avl-set-prop noderef :balance
- (- (avl-height (avl-node-prop noderef :right))
- (avl-height (avl-node-prop noderef :left)))))
-
-(defun avl-add-node (key parent)
- (let (result (idx 0))
- (cl-loop for idx from 0 to (1- (seq-length avl-all-nodes))
- while (null result) do
- (when (null (aref avl-all-nodes idx))
- (aset avl-all-nodes idx (avl-create-node key parent))
- (setq result idx)))
- result))
-
-(defun avl-insert (key)
- (if (null avl-root-node)
- (progn (setq avl-root-node (avl-add-node key nil)) avl-root-node)
- (progn
- (let ((n avl-root-node) (end-loop nil) parent go-left result)
- (while (not end-loop)
- (if (equal key (avl-node-prop n :key))
- (setq end-loop 't)
- (progn
- (setq parent n)
- (setq go-left (> (avl-node-prop n :key) key))
- (setq n (if go-left
- (avl-node-prop n :left)
- (avl-node-prop n :right)))
-
- (when (null n)
- (setq result (avl-add-node key parent))
- (if go-left
- (progn
- (avl-set-prop parent :left result))
- (progn
- (avl-set-prop parent :right result)))
- (avl-rebalance parent) ;;rebalance
- (setq end-loop 't)))))
- result))))
-
-
-(defun avl-rotate-left (noderef)
- (when (not (integerp noderef)) (error "parameter must be an integer"))
- (let ((a noderef) b)
- (setq b (avl-node-prop a :right))
- (avl-set-prop b :parent (avl-node-prop a :parent))
-
- (avl-set-prop a :right (avl-node-prop b :left))
-
- (when (avl-node-prop a :right) (avl-set-prop a :right :parent a))
-
- (avl-set-prop b :left a)
- (avl-set-prop a :parent b)
-
- (when (not (null (avl-node-prop b :parent)))
- (if (equal (avl-node-prop b :parent :right) a)
- (avl-set-prop b :parent :right b)
- (avl-set-prop b :parent :left b)))
-
- (avl-setbalance a)
- (avl-setbalance b)
- b))
-
-
-
-(defun avl-rotate-right (node-idx)
- (when (not (integerp node-idx)) (error "parameter must be an integer"))
- (let ((a node-idx) b)
- (setq b (avl-node-prop a :left))
- (avl-set-prop b :parent (avl-node-prop a :parent))
-
- (avl-set-prop a :left (avl-node-prop b :right))
-
- (when (avl-node-prop a :right) (avl-set-prop a :right :parent a))
-
- (avl-set-prop b :left a)
- (avl-set-prop a :parent b)
-
- (when (not (null (avl-node-prop b :parent)))
- (if (equal (avl-node-prop b :parent :right) a)
- (avl-set-prop b :parent :right b)
- (avl-set-prop b :parent :left b)))
-
- (avl-setbalance a)
- (avl-setbalance b)
- b))
-
-(defun avl-rotate-left-then-right (noderef)
- (avl-set-prop noderef :left (avl-rotate-left (avl-node-prop noderef :left)))
- (avl-rotate-right noderef))
-
-(defun avl-rotate-right-then-left (noderef)
- (avl-set-prop noderef :right (avl-rotate-left (avl-node-prop noderef :right)))
- (avl-rotate-left noderef))
-
-(defun avl-rebalance (noderef)
- (avl-setbalance noderef)
- (cond
- ((equal -2 (avl-node-prop noderef :balance))
- (if (>= (avl-height (avl-node-prop noderef :left :left))
- (avl-height (avl-node-prop noderef :left :right)))
- (setq noderef (avl-rotate-right noderef))
- (setq noderef (avl-rotate-left-then-right noderef)))
- )
- ((equal 2 (avl-node-prop noderef :balance))
- (if (>= (avl-height (avl-node-prop noderef :right :right))
- (avl-height (avl-node-prop noderef :right :left)))
- (setq noderef (avl-rotate-left noderef))
- (setq noderef (avl-rotate-right-then-left noderef)))))
-
- (if (not (null (avl-node-prop noderef :parent)))
- (avl-rebalance (avl-node-prop noderef :parent))
- (setq avl-root-node noderef)))
-
-
-(defun avl-delete (noderef)
- (when noderef
- (when (and (null (avl-node-prop noderef :left))
- (null (avl-node-prop noderef :right)))
- (if (null (avl-node-prop noderef :parent))
- (setq avl-root-node nil)
- (let ((parent (avl-node-prop noderef :parent)))
- (if (equal noderef (avl-node-prop parent :left))
- (avl-set-prop parent :left nil)
- (avl-set-prop parent :right nil))
- (avl-rebalance parent))))
-
- (if (not (null (avl-node-prop noderef :left)))
- (let ((child (avl-node-prop noderef :left)))
- (while (not (null (avl-node-prop child :right)))
- (setq child (avl-node-prop child :right)))
- (avl-set-prop noderef :key (avl-node-prop child :key))
- (avl-delete child))
- (let ((child (avl-node-prop noderef :right)))
- (while (not (null (avl-node-prop child :left)))
- (setq child (avl-node-prop child :left)))
- (avl-set-prop noderef :key (avl-node-prop child :key))
- (avl-delete child)))))
-
-;; Main procedure
-(let ((cnt 10) balances)
- (fillarray avl-all-nodes nil)
- (setq avl-root-node nil)
-
- (dotimes (val cnt)
- (avl-insert (1+ val)))
-
- (setq balances (seq-map (lambda (x) (or (avl-node-prop x :balance) 0))
- (number-sequence 0 (1- cnt))))
-
- (message "Inserting values 1 to %d" cnt)
- (message "Printing balance: %s" (string-join (seq-map (lambda (x) (format "%S" x)) balances) " ")))
diff --git a/Task/Abbreviations-automatic/Ada/abbreviations-automatic.ada b/Task/Abbreviations-automatic/Ada/abbreviations-automatic.ada
deleted file mode 100644
index 94a8c878f4..0000000000
--- a/Task/Abbreviations-automatic/Ada/abbreviations-automatic.ada
+++ /dev/null
@@ -1,71 +0,0 @@
-with Ada.Containers.Indefinite_Vectors;
-with Ada.Strings.Fixed;
-with Ada.Strings.Maps;
-with Ada.Text_IO;
-
-procedure Abbreviations is
-
- package String_Vectors is
- new Ada.Containers.Indefinite_Vectors (Index_Type => Positive,
- Element_Type => String);
- use Ada.Text_IO, String_Vectors;
-
- function Split (Line : String) return Vector is
- Result : Vector;
- First : Natural;
- Last : Natural := Line'First - 1;
- begin
- while Last + 1 in Line'Range loop
- Ada.Strings.Fixed.Find_Token
- (Line, Ada.Strings.Maps.To_Set (" "), Last + 1,
- Ada.Strings.Outside, First, Last);
- exit when Last = 0;
- Append (Result, Line (First .. Last));
- end loop;
- return Result;
- end Split;
-
- function Abbrev_Length (Items : Vector) return Natural is
- use type Ada.Containers.Count_Type;
- Max : Natural := 0;
- Abbrevs : Vector;
- begin
- for Item of Items loop
- Max := Natural'Max (Max, Item'Length);
- end loop;
-
- for Length in 1 .. Max loop
- Abbrevs := Empty_Vector;
- for Item of Items loop
- declare
- Last : constant Natural
- := Natural'Min (Item'Last, Item'First + Length - 1);
-
- Abbrev : String renames Item (Item'First .. Last);
- begin
- exit when Abbrevs.Contains (Abbrev);
- Abbrevs.Append (Abbrev);
- end;
- end loop;
- if Abbrevs.Length = Items.Length then
- return Length;
- end if;
- end loop;
- return 0;
- end Abbrev_Length;
-
- procedure Process (Line : String) is
- package Natural_IO is new Ada.Text_IO.Integer_IO (Natural);
- Words : constant Vector := Split (Line);
- Length : constant Natural := Abbrev_Length (Words);
- begin
- Natural_IO.Put (Length, Width => 2);
- Put (" ");
- Put_Line (Line);
- end Process;
-
-begin
- while not End_Of_File loop
- Process (Get_Line);
- end loop;
-end Abbreviations;
diff --git a/Task/Abbreviations-automatic/COBOL/abbreviations-automatic.cobol b/Task/Abbreviations-automatic/COBOL/abbreviations-automatic.cobol
deleted file mode 100644
index 617cf60927..0000000000
--- a/Task/Abbreviations-automatic/COBOL/abbreviations-automatic.cobol
+++ /dev/null
@@ -1,158 +0,0 @@
- IDENTIFICATION DIVISION.
- PROGRAM-ID. AUTO-ABBREVIATIONS.
-
- ENVIRONMENT DIVISION.
-
- INPUT-OUTPUT SECTION.
- FILE-CONTROL.
- SELECT DOW ASSIGN TO "days-of-week.txt"
- ORGANIZATION IS LINE SEQUENTIAL.
-
- DATA DIVISION.
- FILE SECTION.
- FD DOW.
- 01 DOW-FILE PIC X(200).
-
- WORKING-STORAGE SECTION. *> a.k.a. variables
- 01 DOW-LINE PIC X(200).
- 01 ENDO PIC 9(1).
- 01 ENDO2 PIC 9(1).
- 01 CURDAY PIC X(50).
- 01 ABPTR PIC 999.
- 01 LINE-NUM PIC 9(3) VALUE 1.
- 01 CHARAMT PIC 9(3) VALUE 1.
- 01 LARGESTCHARAMT PIC 9(3).
- 01 DAYNUM PIC 9(3) VALUE 1.
- 01 ABRESTART PIC 9(1).
- 01 CURABBR PIC X(50).
- 01 TMP1 PIC 9(3).
- 01 TMP2 PIC 9(3).
- 01 TINDEX PIC 9(3) VALUE 1.
- 01 ABBRLIST.
- 05 ABBRITEM PIC X(50) OCCURS 7 TIMES.
-
-
- PROCEDURE DIVISION.
- OPEN INPUT DOW.
- PERFORM UNTIL ENDO = 1
- READ DOW INTO DOW-LINE
- AT END MOVE 1 TO ENDO
- NOT AT END PERFORM
- *> loop through each line
- IF DOW-LINE = "" THEN
- DISPLAY ""
- ELSE
- MOVE 0 TO ENDO2
- MOVE 0 TO CHARAMT
-
- PERFORM UNTIL ENDO2 > 0
- MOVE 1 TO ABPTR
- MOVE 1 TO DAYNUM
- MOVE 0 TO ABRESTART
-
- ADD 1 TO CHARAMT
-
- *> reset the abbreviation table
- MOVE 1 TO TINDEX
- PERFORM 7 TIMES
- MOVE SPACE TO ABBRITEM(TINDEX)
- ADD 1 TO TINDEX
- END-PERFORM
-
- *> loop through each day
- PERFORM 7 TIMES
- UNSTRING DOW-LINE DELIMITED BY SPACE
- INTO CURDAY
- WITH POINTER ABPTR
- END-UNSTRING
-
- MOVE 0 TO TMP1
- MOVE 0 TO TMP2
- INSPECT CURDAY
- TALLYING TMP1 FOR ALL CHARACTERS
- INSPECT CURDAY
- TALLYING TMP2 FOR ALL SPACE
- SUBTRACT TMP2 FROM TMP1
- IF TMP1 > LARGESTCHARAMT THEN
- MOVE TMP1 TO LARGESTCHARAMT
- END-IF
-
- *> not enough days error
- IF CURDAY = "" THEN
- MOVE 3 TO ENDO2
- END-IF
-
- MOVE CURDAY(1:CHARAMT) TO CURABBR
-
- *> check if the current abbreviation is already taken
- MOVE 1 TO TINDEX
- PERFORM 7 TIMES
- IF ABBRITEM(TINDEX) = CURABBR THEN
- MOVE 1 TO ABRESTART
- END-IF
- ADD 1 TO TINDEX
- END-PERFORM
-
- MOVE CURABBR TO ABBRITEM(DAYNUM)
-
- ADD 1 TO DAYNUM
-
- END-PERFORM
-
- IF ABRESTART = 0 THEN
- MOVE 1 TO ENDO2
- END-IF
-
- *> identical days error
- IF CHARAMT > LARGESTCHARAMT THEN
- MOVE 2 TO ENDO2
- END-IF
-
- END-PERFORM
-
- DISPLAY "Line " LINE-NUM ": " WITH NO ADVANCING
-
- IF ENDO2 = 3 THEN
- DISPLAY "Error: not enough " WITH NO ADVANCING
- DISPLAY "days"
- ELSE IF ENDO2 = 2 THEN
- DISPLAY "Error: identical " WITH NO ADVANCING
- DISPLAY "days"
- ELSE
- DISPLAY CHARAMT ": " WITH NO ADVANCING
-
- *> loop through each day and display its abbreviation
- MOVE 1 TO TINDEX
- PERFORM 7 TIMES
- MOVE ABBRITEM(TINDEX) TO CURABBR
-
- MOVE 0 TO TMP1
- MOVE 0 TO TMP2
- INSPECT CURABBR
- TALLYING TMP1 FOR ALL CHARACTERS
- INSPECT CURABBR
- TALLYING TMP2 FOR TRAILING SPACES
- SUBTRACT TMP2 FROM TMP1
-
- DISPLAY CURABBR(1:TMP1) WITH NO ADVANCING
- DISPLAY "." WITH NO ADVANCING
-
- IF TINDEX < 7 THEN
- DISPLAY SPACE WITH NO ADVANCING
- ELSE
- DISPLAY X"0a" WITH NO ADVANCING *> go to next line
- END-IF
-
- ADD 1 TO TINDEX
- END-PERFORM
- END-IF
-
- END-IF
-
- END-PERFORM
- END-READ
-
- ADD 1 TO LINE-NUM
- END-PERFORM.
- CLOSE DOW.
- STOP RUN.
diff --git a/Task/Abbreviations-automatic/Emacs-Lisp/abbreviations-automatic.l b/Task/Abbreviations-automatic/Emacs-Lisp/abbreviations-automatic.l
deleted file mode 100644
index 8877dc684b..0000000000
--- a/Task/Abbreviations-automatic/Emacs-Lisp/abbreviations-automatic.l
+++ /dev/null
@@ -1,36 +0,0 @@
-(defun abbreviate-list (list-of-days abbreviation-length)
- "Take each element of LIST-OF-DAYS and abbreviate to ABBREVIATION-LENGTH."
- (let ((abbrev-list)
- (abbrev-element))
- (dolist (one-element list-of-days) ; loop through each day of week
-;; if the day of week is at least as long as the abbreviation
- (if (>= (length one-element) abbreviation-length) ; if day >= abbreviation length
- (setq abbrev-element (substring one-element 0 abbreviation-length)) ; abbreviate the day of the week
- (setq abbrev-element one-element)) ; otherwise don't abbreviate
- (push abbrev-element abbrev-list)) ; put the abbreviated/non-abbreviated day on our list
- abbrev-list)) ; return the list of abbreviated days
-
-(defun cycle-days (list-of-days)
- "Find shortest unique abbreviation in LIST-OF-DAYS list."
- (let ((abbrev-list)
- (abbrev-length 1)
- (current-abbrev)
- (looking-for-shortest-list t))
- (if (= (length list-of-days) 0) ; if list-of-days is empty (i.e., blank line)
- (setq looking-for-shortest-list nil)) ; then don't look for the shortest unique abbreviations
- (while looking-for-shortest-list ; as long as we are looking for the shortest unique abbreviations
- (setq abbrev-list (abbreviate-list list-of-days abbrev-length)) ; get a list of abbreviated day names
- (if (= (length list-of-days) (length (seq-uniq abbrev-list))) ; if abbreviated list has no duplicates
- (progn
- (message (format "%d %s" abbrev-length list-of-days)) ; then in echo buffer show length and days
- (setq looking-for-shortest-list nil)) ; also, then don't look for the shortest unique abbreviations
- (setq abbrev-length (+ abbrev-length 1)))))) ; else increase the length of the abbreviation; loop to while
-
-(defun days-of-week ()
- "Find minimum abbreviation length of days of week."
- (let ((current-line-list))
- (find-file "Days_of_week.txt") ; open file or switch to buffer
- (beginning-of-buffer) ; go to the top of the buffer
- (dolist (current-line (split-string (buffer-string) "\n")) ; go line by line through buffer
- (setq current-line-list (split-string current-line " ")) ; change each line into list of days of week
- (cycle-days current-line-list))))
diff --git a/Task/Abbreviations-automatic/VBScript/abbreviations-automatic.vb b/Task/Abbreviations-automatic/VBScript/abbreviations-automatic.vb
deleted file mode 100644
index daaf4f3a31..0000000000
--- a/Task/Abbreviations-automatic/VBScript/abbreviations-automatic.vb
+++ /dev/null
@@ -1,36 +0,0 @@
-sub print(s) wscript.stdout.writeline s :end sub
-
-set d=createobject("Scripting.Dictionary")
-set fso=createobject("Scripting.Filesystemobject")
-
-const fn="weekdays_ansi.txt"
-sfn=WScript.ScriptFullName
-sfn= Left(sfn, InStrRev(sfn, "\"))
-set f=fso.opentextfile(sfn & fn,1)
-
-while not f.atendofstream
- s=f.readline
- if s=vbNullString then
- print " "
- else
- a=split(trim(s)," ")
- for abrlen=1 to 14
- d.removeall
- for wd=0 to 6
- k=left(a(wd),abrlen)
- if d.exists(k) then
- exit for
- else
- d.add k,""
- end if
- next 'wd
- if wd>6 then exit for
- next 'abrlen
- b=right(" " & abrlen,2)
- for wd=0 to 6
- b=b &" "& left(a(wd),abrlen)
- next
- print b
- end if
-wend 'line
-f.close
diff --git a/Task/Abbreviations-easy/Ada/abbreviations-easy.ada b/Task/Abbreviations-easy/Ada/abbreviations-easy.ada
deleted file mode 100644
index 17dbc7a2c5..0000000000
--- a/Task/Abbreviations-easy/Ada/abbreviations-easy.ada
+++ /dev/null
@@ -1,98 +0,0 @@
-with Ada.Characters.Handling;
-with Ada.Containers.Indefinite_Vectors;
-with Ada.Strings.Fixed;
-with Ada.Strings.Maps.Constants;
-with Ada.Text_IO;
-
-procedure Abbreviations_Easy is
-
- package Command_Vectors
- is new Ada.Containers.Indefinite_Vectors (Index_Type => Positive,
- Element_Type => String);
- use Command_Vectors;
-
- Commands : Vector;
-
- procedure Append (Word_List : String) is
- use Ada.Strings;
- First : Positive := Word_List'First;
- Last : Natural;
- begin
- loop
- Fixed.Find_Token (Word_List,
- Set => Maps.Constants.Letter_Set,
- From => First,
- Test => Inside,
- First => First,
- Last => Last);
- exit when Last = 0;
- Commands.Append (Word_List (First .. Last));
- exit when Last = Word_List'Last;
- First := Last + 1;
- end loop;
- end Append;
-
- function Match (Word : String) return String is
- use Ada.Strings;
- use Ada.Characters.Handling;
- Upper_Word : constant String := To_Upper (Word);
- Prefix_First : Positive;
- Prefix_Last : Natural;
- begin
- if Word = "" then
- return "";
- end if;
-
- for Command of Commands loop
- Fixed.Find_Token (Command, Maps.Constants.Upper_Set, Inside,
- Prefix_First, Prefix_Last);
- declare
- Upper_Prefix : constant String := Command (Prefix_First .. Prefix_Last);
- Upper_Command : constant String := To_Upper (Command);
- Valid_Length : constant Boolean := Word'Length >= Upper_Prefix'Length;
- Match_Length : constant Natural := Natural'Min (Word'Length,
- Command'Length);
- Valid_Match : constant Boolean
- := Fixed.Head (Upper_Word, Upper_Word'Length)
- = Fixed.Head (Upper_Command, Upper_Word'Length);
- begin
- if Valid_Length and Valid_Match then
- return Upper_Command;
- end if;
- end;
- end loop;
- return "*error*";
- end Match;
-
- procedure Put_Match (To : String) is
- use Ada.Text_IO;
- M : constant String := Match (To);
- begin
- Put ("Match to '"); Put (To);
- Put ("' is '"); Put (M);
- Put_Line ("'");
- end Put_Match;
-
- procedure A (Item : String) renames Append;
-begin
- A ("Add ALTer BAckup Bottom CAppend Change SCHANGE CInsert CLAst COMPress COpy");
- A ("COUnt COVerlay CURsor DELete CDelete Down DUPlicate Xedit EXPand EXTract Find");
- A ("NFind NFINDUp NFUp CFind FINdup FUp FOrward GET Help HEXType Input POWerinput");
- A ("Join SPlit SPLTJOIN LOAD Locate CLocate LOWercase UPPercase LPrefix MACRO");
- A ("MErge MODify MOve MSG Next Overlay PARSE PREServe PURge PUT PUTD Query QUIT");
- A ("READ RECover REFRESH RENum REPeat Replace CReplace RESet RESTore RGTLEFT");
- A ("RIght LEft SAVE SET SHift SI SORT SOS STAck STATus TOP TRAnsfer Type Up");
-
- Put_Match ("riG");
- Put_Match ("rePEAT");
- Put_Match ("copies");
- Put_Match ("put");
- Put_Match ("mo");
- Put_Match ("rest");
- Put_Match ("types");
- Put_Match ("fup.");
- Put_Match ("6");
- Put_Match ("poweRin");
- Put_Match ("");
- Put_Match ("o");
-end Abbreviations_Easy;
diff --git a/Task/Abbreviations-easy/Euphoria/abbreviations-easy.ex b/Task/Abbreviations-easy/Euphoria/abbreviations-easy.ex
deleted file mode 100644
index a840e20d63..0000000000
--- a/Task/Abbreviations-easy/Euphoria/abbreviations-easy.ex
+++ /dev/null
@@ -1,35 +0,0 @@
-include std/text.e -- for upper conversion
-include std/console.e -- for display
-include std/sequence.e
-
-sequence ct = """
-Add ALTer BAckup Bottom CAppend Change SCHANGE CInsert CLAst COMPress COpy
-COUnt COVerlay CURsor DELete CDelete Down DUPlicate Xedit EXPand EXTract Find
-NFind NFINDUp NFUp CFind FINdup FUp FOrward GET Help HEXType Input POWerinput
-Join SPlit SPLTJOIN LOAD Locate CLocate LOWercase UPPercase LPrefix MACRO
-MErge MODify MOve MSG Next Overlay PARSE PREServe PURge PUT PUTD Query QUIT
-READ RECover REFRESH RENum REPeat Replace CReplace RESet RESTore RGTLEFT
-RIght LEft SAVE SET SHift SI SORT SOS STAck STATus TOP TRAnsfer Type Up
-"""
-ct = upper(split(join(split(ct,"\n")," ")," "))
-
-object input = remove_all("\n",upper(remove_all("",split(gets(0)))))
-display(validate(input))
-
--------------------------------
-function validate(object words)
--------------------------------
-object results = repeat("*error*",length(words)) -- build an output list;
-integer x
-for i = 1 to length(words) do
- words[i] = remove_all('\n',words[i]) -- final word in input line (may) have \n, get rid of it;
- for j = 1 to length(ct) do
- x = match(words[i],ct[j])
- if x = 1 then
- results[i] = ct[j] -- replace this slot in the output list with the "found" word;
- exit -- and don't look further into the list;
- end if
- end for
-end for
-return flatten(join(results," ")) -- convert sequence of strings into one string, words separated by a single space;
-end function
diff --git a/Task/Abbreviations-easy/PowerShell/abbreviations-easy.psh b/Task/Abbreviations-easy/PowerShell/abbreviations-easy.psh
deleted file mode 100644
index ad178249f3..0000000000
--- a/Task/Abbreviations-easy/PowerShell/abbreviations-easy.psh
+++ /dev/null
@@ -1,44 +0,0 @@
-<# Start with a string of the commands #>
-$cmdTableStr =
-"Add ALTer BAckup Bottom CAppend Change SCHANGE CInsert CLAst COMPress COpy
- COUnt COVerlay CURsor DELete CDelete Down DUPlicate Xedit EXPand EXTract Find
- NFind NFINDUp NFUp CFind FINdup FUp FOrward GET Help HEXType Input POWerinput
- Join SPlit SPLTJOIN LOAD Locate CLocate LOWercase UPPercase LPrefix MACRO
- MErge MODify MOve MSG Next Overlay PARSE PREServe PURge PUT PUTD Query QUIT
- READ RECover REFRESH RENum REPeat Replace CReplace RESet RESTore RGTLEFT
- RIght LEft SAVE SET SHift SI SORT SOS STAck STATus TOP TRAnsfer Type Up"
-<# String of inputs #>
-$userWordStr = "riG rePEAT copies put mo rest types fup. 6 poweRin"
-
-$outputStr = $null # Set this string to null only so all variables are intialized
-
-$cmdTabArray = @() # Arrays for the commands and the inputs
-$userWordArray = @()
-
-<# Split the strings into arrays using a space as the delimiter.
- This also removes "blank" entries, which fits the requirement
- "A blank input (or a null input) should return a null string." #>
-$cmdTabArray = $cmdTableStr.Split(" ", [System.StringSplitOptions]::RemoveEmptyEntries)
-$userWordArray = $userWordStr.Split(" ", [System.StringSplitOptions]::RemoveEmptyEntries)
-
-<# Begins a loop to iterate through the inputs #>
-foreach($word in $userWordArray)
-{
- $match = $false # Variable set to false so that if a match is never found, the "*error*" string can be appended
- foreach($cmd in $cmdTabArray)
- {
- <# This test: 1) ensures inputs match the leading characters of the command
- 2) are abbreviations of the command
- 3) the abbreviations is at least the number of capital characters in the command #>
- if($cmd -like "$word*" -and ($word.Length -ge ($cmd -creplace '[a-z]').Length))
- {
- $outputStr += $cmd.ToUpper() + " " # Adds the command in all caps to the output string
- $match = $true # Sets the variable so that "*error*" is not appended
- break # Break keep the loop from continuing and wasting time once a match was found
- }
- }
- if($match -eq $false){ $outputStr += "*error* " } # Appends error if no match was found
-}
-# Below lines display the input and output
-"User text: " + $userWordStr
-"Full text: " + $outputStr
diff --git a/Task/Abbreviations-simple/Ada/abbreviations-simple.ada b/Task/Abbreviations-simple/Ada/abbreviations-simple.ada
deleted file mode 100644
index 89413455d5..0000000000
--- a/Task/Abbreviations-simple/Ada/abbreviations-simple.ada
+++ /dev/null
@@ -1,130 +0,0 @@
-with Ada.Characters.Handling;
-with Ada.Containers.Vectors;
-with Ada.Strings.Fixed;
-with Ada.Strings.Maps.Constants;
-with Ada.Strings.Unbounded;
-with Ada.Text_IO;
-
-procedure Abbreviations_Simple is
-
- use Ada.Strings.Unbounded;
- subtype Ustring is Unbounded_String;
-
- type Word_Entry is record
- Word : Ustring;
- Min : Natural;
- end record;
-
- package Command_Vectors
- is new Ada.Containers.Vectors (Index_Type => Positive,
- Element_Type => Word_Entry);
-
- Commands : Command_Vectors.Vector;
- Last_Word : Ustring;
- Last_Was_Word : Boolean := False;
-
- procedure Append (Word_List : String) is
- use Ada.Strings;
-
- function Is_Word (Item : String) return Boolean
- is (Fixed.Count (Item, Maps.Constants.Letter_Set) /= 0);
-
- procedure Process (Token : String) is
- begin
- if Is_Word (Token) then
- if Last_Was_Word then
- Commands.Append ((Word => Last_Word,
- Min => Length (Last_Word)));
- end if;
- Last_Word := To_Unbounded_String (Token);
- Last_Was_Word := True;
-
- else -- Token is expected to be decimal
- Commands.Append ((Word => Last_Word,
- Min => Natural'Value (Token)));
- Last_Was_Word := False;
- end if;
- end Process;
-
- Token_First : Positive := Word_List'First;
- Token_Last : Natural;
- begin
- while Token_First in Word_List'Range loop
-
- Fixed.Find_Token (Word_List, Maps.Constants.Alphanumeric_Set,
- Token_First, Inside,
- Token_First, Token_Last);
- exit when Token_Last = 0;
-
- Process (Word_List (Token_First .. Token_Last));
-
- Token_First := Token_Last + 1;
- end loop;
- end Append;
-
- function Match (Word : String) return String is
- use Ada.Characters.Handling;
- use Ada.Strings.Fixed;
- Result : Ustring := To_Unbounded_String ("*error*");
- Min : Natural := 0;
- Upper_Word : constant String := To_Upper (Word);
- begin
- if Upper_Word = "" then
- return "";
- end if;
-
- for Candidate of Commands loop
- declare
- Upper_Cand : constant String := To_Upper (To_String (Candidate.Word));
- Length : constant Natural := Natural'Max (Candidate.Min,
- Upper_Word'Length);
- Upper_Abbrev_Cand : constant String := Head (Upper_Cand, Length);
- Upper_Abbrev_Word : constant String := Head (Upper_Word, Length);
- begin
- if Upper_Word = Upper_Cand
- and then Upper_Word'Length > Min
- then
- Result := To_Unbounded_String (Upper_Cand);
- Min := Upper_Word'Length;
- elsif Upper_Abbrev_Word = Upper_Abbrev_Cand
- and then Upper_Abbrev_Word'Length > Min
- then
- Result := To_Unbounded_String (Upper_Cand);
- Min := Upper_Abbrev_Word'Length;
- end if;
- end;
- end loop;
- return To_String (Result);
- end Match;
-
- procedure Put_Match (To : String) is
- use Ada.Text_IO;
- begin
- Put ("Match to '"); Put (To);
- Put ("' is '"); Put (Match (To));
- Put_Line ("'");
- end Put_Match;
-
- procedure A (Item : String) renames Append;
-begin
- A ("add 1 alter 3 backup 2 bottom 1 Cappend 2 change 1 Schange Cinsert 2 Clast 3");
- A ("compress 4 copy 2 count 3 Coverlay 3 cursor 3 delete 3 Cdelete 2 down 1 duplicate");
- A ("3 xEdit 1 expand 3 extract 3 find 1 Nfind 2 Nfindup 6 NfUP 3 Cfind 2 findUP 3 fUP 2");
- A ("forward 2 get help 1 hexType 4 input 1 powerInput 3 join 1 split 2 spltJOIN load");
- A ("locate 1 Clocate 2 lowerCase 3 upperCase 3 Lprefix 2 macro merge 2 modify 3 move 2");
- A ("msg next 1 overlay 1 parse preserve 4 purge 3 put putD query 1 quit read recover 3");
- A ("refresh renum 3 repeat 3 replace 1 Creplace 2 reset 3 restore 4 rgtLEFT right 2 left");
- A ("2 save set shift 2 si sort sos stack 3 status 4 top transfer 3 type 1 up 1");
-
- Put_Match ("riG");
- Put_Match ("rePEAT");
- Put_Match ("copies");
- Put_Match ("put");
- Put_Match ("mo");
- Put_Match ("rest");
- Put_Match ("types");
- Put_Match ("fup.");
- Put_Match ("6");
- Put_Match ("poweRin");
- Put_Match ("");
-end Abbreviations_Simple;
diff --git a/Task/Abbreviations-simple/EasyLang/abbreviations-simple.easy b/Task/Abbreviations-simple/EasyLang/abbreviations-simple.easy
index ffbc7cc06f..0441040ea0 100644
--- a/Task/Abbreviations-simple/EasyLang/abbreviations-simple.easy
+++ b/Task/Abbreviations-simple/EasyLang/abbreviations-simple.easy
@@ -17,8 +17,9 @@ func$ toupper s$ .
return r$
.
for tok$ in toks$[]
- if number tok$ <> 0
- cnt[$] = number tok$
+ n = number tok$
+ if error = 0
+ cnt[$] = n
else
cmd$[] &= toupper tok$
cnt[] &= 999
diff --git a/Task/Abbreviations-simple/VBScript/abbreviations-simple.vb b/Task/Abbreviations-simple/VBScript/abbreviations-simple.vb
deleted file mode 100644
index 23328381b6..0000000000
--- a/Task/Abbreviations-simple/VBScript/abbreviations-simple.vb
+++ /dev/null
@@ -1,88 +0,0 @@
-option explicit
-
-function iif(c,t,f) if c then iif=t else iif=f end if: end function
-function usrin(pr) wscript.stdout.write vbcrlf &pr &": ":usrin= wscript.stdin.readline:end function
-
-sub do_abbrev
- dim j, sm,n,n0,a
- for each j in m
- sm=trim(lcase(j.submatches(0)))
- n0=iif (j.submatches(1)="",1, j.submatches(1))
- n=1
- do
- a=left(sm,n)
- if not d.exists(a) then
- d.add a,sm
- else
- if len(a)=len(sm) then
- d(a)=sm
- elseif len(d(a))>len(a) then
- d(a)=null
- end if
- end if
- n=n+1
- loop until n>len(sm)
- next
-end sub
-'output sorted
-
-sub display
- dim d2,k,j,kk,mm
- set d2=createobject("Scripting.dictionary")
- for each k in d
- kk=d(k)
- if not isnull(kk) then
- if not d2.exists(kk) then
- d2.add kk,k
- else
- d2(kk)= d2(kk) & " " & k
- end if
- end if
- next
- for each j in m
- mm=trim(lcase(j.submatches(0)))
- wscript.echo left(mm&space(15),15),d2(mm)
- next
- wscript.echo
- set d2=nothing
-end sub
-
-sub test
- wscript.echo vbcrlf&"test:"
- dim a,i,k,s1
- do
- s1= lcase(usrin("Command?"))
- if trim(s1)="" then wscript.quit
- a=split(trim(s1)," ")
- for i=0 to ubound(a)
- if a(i)<>"" then
- wscript.stdout.write iif (d.exists(a(i)), ucase(d(a(i)))," **ERROR**")& " "
- end if
- next
- loop
-end sub
-
-'main program
-dim s:s=_
- "add 1 alter 3 backup 2 bottom 1 Cappend 2 change 1 Schange Cinsert 2 Clast 3 "&_
- "compress 4 copy 2 count 3 Coverlay 3 cursor 3 delete 3 Cdelete 2 down 1 duplicate "&_
- "3 xEdit 1 expand 3 extract 3 find 1 Nfind 2 Nfindup 6 NfUP 3 Cfind 2 findUP 3 fUP 2 "&_
- "forward 2 get help 1 hexType 4 input 1 powerInput 3 join 1 split 2 spltJOIN load "&_
- "locate 1 Clocate 2 lowerCase 3 upperCase 3 Lprefix 2 macro merge 2 modify 3 move 2 "&_
- "msg next 1 overlay 1 parse preserve 4 purge 3 put putD query 1 quit read recover 3 "&_
- "refresh renum 3 repeat 3 replace 1 Creplace 2 reset 3 restore 4 rgtLEFT right 2 left "&_
- "2 save set shift 2 si sort sos stack 3 status 4 top transfer 3 type 1 up 1 "
-dim m,d
-
-'use regexp to separate input
-with new regexp
- .pattern="([a-z]+?)\s+(\d?)"
- .global=true
- .ignorecase=true
- set m=.execute(s)
-end with
-
-set d=createobject("Scripting.dictionary")
-do_abbrev
-'display
-test
diff --git a/Task/Abelian-sandpile-model-Identity/11l/abelian-sandpile-model-identity.11l b/Task/Abelian-sandpile-model-Identity/11l/abelian-sandpile-model-identity.11l
index 2021c0f350..0ff0137379 100644
--- a/Task/Abelian-sandpile-model-Identity/11l/abelian-sandpile-model-identity.11l
+++ b/Task/Abelian-sandpile-model-Identity/11l/abelian-sandpile-model-identity.11l
@@ -2,7 +2,7 @@ T Sandpile
DefaultDict[(Int, Int), Int] grid
F (gridtext)
- V array = gridtext.split_py().map(x -> Int(x))
+ V array = gridtext.split((‘ ’, "\n")).map(Int)
L(x) array
.grid[(L.index I/ 3, L.index % 3)] = x
@@ -39,21 +39,25 @@ T Sandpile
F String()
[String] txt
- L(row) 3
+ L(row) 0.<3
txt.append((0.<3).map(col -> String(@.grid[(@row, col)])).join(‘ ’))
R txt.join("\n")
-V unstable = Sandpile(‘4 3 3
- 3 1 2
- 0 2 3’)
-V s1 = Sandpile(‘1 2 0
- 2 1 1
- 0 1 3’)
-V s2 = Sandpile(‘2 1 3
- 1 0 1
- 0 1 0’)
-V s3 = Sandpile(‘3 3 3 3 3 3 3 3 3’)
-V s3_id = Sandpile(‘2 1 2 1 0 1 2 1 2’)
+V unstable = Sandpile(|‘4 3 3
+ 3 1 2
+ 0 2 3’)
+V s1 = Sandpile(|‘1 2 0
+ 2 1 1
+ 0 1 3’)
+V s2 = Sandpile(|‘2 1 3
+ 1 0 1
+ 0 1 0’)
+V s3 = Sandpile(|‘3 3 3
+ 3 3 3
+ 3 3 3’)
+V s3_id = Sandpile(|‘2 1 2
+ 1 0 1
+ 2 1 2’)
print(unstable)
print()
diff --git a/Task/Abelian-sandpile-model-Identity/Ada/abelian-sandpile-model-identity-1.ada b/Task/Abelian-sandpile-model-Identity/Ada/abelian-sandpile-model-identity-1.ada
deleted file mode 100644
index 2683729e0b..0000000000
--- a/Task/Abelian-sandpile-model-Identity/Ada/abelian-sandpile-model-identity-1.ada
+++ /dev/null
@@ -1,15 +0,0 @@
--- Works with Ada 2012
-
-package Abelian_Sandpile is
- Limit : constant Integer := 4;
-
- type Sandpile is array (0 .. 2, 0 .. 2) of Natural with
- Default_Component_Value => 0;
-
- procedure Stabalize (Pile : in out Sandpile);
- function Is_Stable (Pile : in Sandpile) return Boolean;
- procedure Topple (Pile : in out Sandpile);
- function "+" (Left, Right : Sandpile) return Sandpile;
- procedure Print(PIle : in Sandpile);
-
-end Abelian_Sandpile;
diff --git a/Task/Abelian-sandpile-model-Identity/Ada/abelian-sandpile-model-identity-2.ada b/Task/Abelian-sandpile-model-Identity/Ada/abelian-sandpile-model-identity-2.ada
deleted file mode 100644
index 8e38a56088..0000000000
--- a/Task/Abelian-sandpile-model-Identity/Ada/abelian-sandpile-model-identity-2.ada
+++ /dev/null
@@ -1,85 +0,0 @@
-with Ada.Text_Io; use Ada.Text_IO;
-
-package body Abelian_Sandpile is
-
- ---------------
- -- Stabalize --
- ---------------
-
- procedure Stabalize (Pile : in out Sandpile) is
- begin
- while not Is_Stable(Pile) loop
- Topple(Pile);
- end loop;
- end Stabalize;
-
- ---------------
- -- Is_Stable --
- ---------------
-
- function Is_Stable (Pile : in Sandpile) return Boolean is
- begin
- return (for all E of Pile => E < Limit);
- end Is_Stable;
-
- ------------
- -- Topple --
- ------------
-
- procedure Topple (Pile : in out Sandpile) is
- begin
- outer:
- for Row in Pile'Range(1) loop
- for Col in Pile'Range(2) loop
- if Pile(Row, Col) >= Limit then
- Pile(Row, Col) := Pile(Row, Col) - Limit;
- if Row > 0 then
- Pile(Row - 1, Col) := Pile(Row -1, Col) + 1;
- end if;
- if Row < Pile'Last(1) then
- Pile(Row + 1, Col) := Pile(Row + 1, Col) + 1;
- end if;
- if Col > 0 then
- Pile(Row, Col - 1) := Pile(Row, Col - 1) + 1;
- end if;
- if Col < Pile'Last(2) then
- Pile(Row, Col + 1) := Pile(Row, Col + 1) + 1;
- end if;
-
- exit outer;
- end if;
- end loop;
- end loop outer;
- end Topple;
-
- ---------
- -- "+" --
- ---------
-
- function "+" (Left, Right : Sandpile) return Sandpile is
- Result : Sandpile;
- begin
- for I in Sandpile'Range(1) loop
- for J in Sandpile'Range(2) loop
- Result(I, J) := Left(I, J) + Right(I, J);
- end loop;
- end loop;
- Stabalize(Result);
- return Result;
- end "+";
-
- -----------
- -- Print --
- -----------
-
- procedure Print(Pile : in Sandpile) is
- begin
- for row in Pile'Range(1) loop
- for col in Pile'Range(2) loop
- Put(Integer'Image(Pile(row, col)));
- end loop;
- New_Line;
- end loop;
- New_Line;
- end Print;
-end Abelian_Sandpile;
diff --git a/Task/Abelian-sandpile-model-Identity/Ada/abelian-sandpile-model-identity-3.ada b/Task/Abelian-sandpile-model-Identity/Ada/abelian-sandpile-model-identity-3.ada
deleted file mode 100644
index 350d3736a7..0000000000
--- a/Task/Abelian-sandpile-model-Identity/Ada/abelian-sandpile-model-identity-3.ada
+++ /dev/null
@@ -1,46 +0,0 @@
-with Ada.Text_IO; use Ada.Text_IO;
-with Abelian_Sandpile; use Abelian_Sandpile;
-
-procedure Main is
- sp : Sandpile := ((4, 3, 3), (3, 1, 2), (0, 2, 3));
- s1 : Sandpile := ((1, 2, 0), (2, 1, 1), (0, 1, 3));
- s2 : Sandpile := ((2, 1, 3), (1, 0, 1), (0, 1, 0));
- s3 : Sandpile := ((3, 3, 3), (3, 3, 3), (3, 3, 3));
- s3_id : Sandpile := ((2, 1, 2), (1, 0, 1), (2, 1, 2));
- sum1 : Sandpile := s1 + s2;
- sum2 : Sandpile := s2 + s1;
- sum3 : Sandpile := s3 + s3_id;
- sum4 : Sandpile := s3_id + s3_id;
-
-begin
- Put_Line ("Avalanche:");
- while not Is_Stable (sp) loop
- Print (sp);
- Put_Line ("stable? " & Boolean'Image (Is_Stable (sp)));
- New_Line;
- Topple (sp);
- end loop;
- Print (sp);
- Put_Line ("stable? " & Boolean'Image (Is_Stable (sp)));
- New_Line;
-
- Put_Line ("Commutivity:");
- Put_Line ("s1 + s2 equals s2 + s2? " & Boolean'Image (sum1 = sum2));
- New_Line;
- Put_Line ("S1 : s2 =");
- Print (sum1);
- New_Line;
- Put_Line ("s2 + s1 =");
- Print (sum2);
- New_Line;
-
- Put_Line ("Identity:");
- Put_Line ("s3 + s3_id equals s3? " & Boolean'Image (sum3 = s3));
- Put_Line ("s3_id + s3_id equals s3_id? " & Boolean'Image (sum4 = s3_id));
- New_Line;
- Put_Line ("s3 + s3_id =");
- Print (sum3);
- Put_Line ("s3_id + s3_id =");
- Print (sum4);
-
-end Main;
diff --git a/Task/Abelian-sandpile-model-Identity/Java/abelian-sandpile-model-identity.java b/Task/Abelian-sandpile-model-Identity/Java/abelian-sandpile-model-identity.java
index 53353b220e..9791ef33f9 100644
--- a/Task/Abelian-sandpile-model-Identity/Java/abelian-sandpile-model-identity.java
+++ b/Task/Abelian-sandpile-model-Identity/Java/abelian-sandpile-model-identity.java
@@ -3,104 +3,104 @@ import java.util.List;
public final class AbelianSandpileModel {
- public static void main(String[] aArgs) {
- Sandpile avalanche = new Sandpile(List.of( 4, 3, 3, 3, 1, 2, 0, 2, 3 ));
- System.out.println("Avalanche reduction to stable state:");
- avalanche.display();
- System.out.println(" ==> ");
- avalanche.stabilise();
- avalanche.display();
-
- Sandpile s1 = new Sandpile(List.of( 1, 2, 0, 2, 1, 1, 0, 1, 3 ));
- Sandpile s2 = new Sandpile(List.of( 2, 1, 3, 1, 0, 1, 0, 1, 0 ));
- Sandpile sum1 = s1.add(s2);
- Sandpile sum2 = s2.add(s1);
- System.out.println(System.lineSeparator() + "Commutativity of addition" + System.lineSeparator());
- System.out.println("Sandpile1 + Sandpile2:");
- sum1.display();
- System.out.println("Sandpile2 + Sandpile1:");
- sum2.display();
- System.out.println("Sandpile1 + Sandpile2 = Sandpile2 + Sandpile1: " + sum1.equals(sum2));
-
- Sandpile s3 = new Sandpile(List.of( 3, 3, 3, 3, 3, 3, 3, 3, 3 ));
- Sandpile s3_id = new Sandpile(List.of( 2, 1, 2, 1, 0, 1, 2, 1, 2 ));
- Sandpile sum3 = s3.add(s3_id);
- Sandpile sum4 = s3_id.add(s3_id);
- System.out.println(System.lineSeparator() + "Identity Sandpile" + System.lineSeparator());
- System.out.println("Sandpile3 + Sandpile3_id:");
- sum3.display();
- System.out.println("Sandpile3_id + Sandpile3_id:");
- sum4.display();
- }
+ public static void main(String[] aArgs) {
+ Sandpile avalanche = new Sandpile(List.of( 4, 3, 3, 3, 1, 2, 0, 2, 3 ));
+ System.out.println("Avalanche reduction to stable state:");
+ avalanche.display();
+ System.out.println(" ==> ");
+ avalanche.stabilise();
+ avalanche.display();
+
+ Sandpile s1 = new Sandpile(List.of( 1, 2, 0, 2, 1, 1, 0, 1, 3 ));
+ Sandpile s2 = new Sandpile(List.of( 2, 1, 3, 1, 0, 1, 0, 1, 0 ));
+ Sandpile sum1 = s1.add(s2);
+ Sandpile sum2 = s2.add(s1);
+ System.out.println(System.lineSeparator() + "Commutativity of addition" + System.lineSeparator());
+ System.out.println("Sandpile1 + Sandpile2:");
+ sum1.display();
+ System.out.println("Sandpile2 + Sandpile1:");
+ sum2.display();
+ System.out.println("Sandpile1 + Sandpile2 = Sandpile2 + Sandpile1: " + sum1.equals(sum2));
+
+ Sandpile s3 = new Sandpile(List.of( 3, 3, 3, 3, 3, 3, 3, 3, 3 ));
+ Sandpile s3_id = new Sandpile(List.of( 2, 1, 2, 1, 0, 1, 2, 1, 2 ));
+ Sandpile sum3 = s3.add(s3_id);
+ Sandpile sum4 = s3_id.add(s3_id);
+ System.out.println(System.lineSeparator() + "Identity Sandpile" + System.lineSeparator());
+ System.out.println("Sandpile3 + Sandpile3_id:");
+ sum3.display();
+ System.out.println("Sandpile3_id + Sandpile3_id:");
+ sum4.display();
+ }
}
final class Sandpile {
-
+
public Sandpile(List aList) {
- if ( aList.size() != CELL_COUNT ) {
- throw new IllegalArgumentException("Initialiser list must contain " + CELL_COUNT + " elements");
- }
- cells = new ArrayList(aList);
+ if ( aList.size() != CELL_COUNT ) {
+ throw new IllegalArgumentException("Initialiser list must contain " + CELL_COUNT + " elements");
+ }
+ cells = new ArrayList(aList);
}
public void stabilise() {
- while ( ! isStable() ) {
+ while ( ! isStable() ) {
topple();
- }
+ }
}
public boolean isStable() {
- return cells.stream().noneMatch( i -> i >= CELL_LIMIT );
+ return cells.stream().noneMatch( i -> i >= CELL_LIMIT );
}
public void topple() {
- for ( int i = 0; i < CELL_COUNT; i++ ) {
- if ( cells.get(i) >= CELL_LIMIT ) {
- cells.set(i, cells.get(i) - CELL_LIMIT);
- final int row = rowIndex(i);
- final int col = colIndex(i);
- if ( row > 0 ) {
- increment(row - 1, col);
- }
- if ( row + 1 < ROW_COUNT ) {
- increment(row + 1, col);
- }
- if ( col > 0 ) {
- increment(row, col - 1);
- }
- if ( col + 1 < COL_COUNT ) {
- increment(row, col + 1);
- }
- }
- }
+ for ( int i = 0; i < CELL_COUNT; i++ ) {
+ if ( cells.get(i) >= CELL_LIMIT ) {
+ cells.set(i, cells.get(i) - CELL_LIMIT);
+ final int row = rowIndex(i);
+ final int col = colIndex(i);
+ if ( row > 0 ) {
+ increment(row - 1, col);
+ }
+ if ( row + 1 < ROW_COUNT ) {
+ increment(row + 1, col);
+ }
+ if ( col > 0 ) {
+ increment(row, col - 1);
+ }
+ if ( col + 1 < COL_COUNT ) {
+ increment(row, col + 1);
+ }
+ }
+ }
}
public Sandpile add(Sandpile aOther) {
- List list = new ArrayList();
- for ( int i = 0; i < CELL_COUNT; i++ ) {
+ List list = new ArrayList();
+ for ( int i = 0; i < CELL_COUNT; i++ ) {
list.add(cells.get(i) + aOther.cells.get(i));
- }
- Sandpile result = new Sandpile(list);
+ }
+ Sandpile result = new Sandpile(list);
result.stabilise();
return result;
}
public boolean equals(Sandpile aOther) {
- return cells.equals(aOther.cells);
+ return cells.equals(aOther.cells);
}
public void display() {
- for ( int i = 0; i < CELL_COUNT; i++ ) {
- System.out.print(cells.get(i));
- System.out.print( ( colIndex(i + 1) == 0 ) ? System.lineSeparator() : " ");
- }
+ for ( int i = 0; i < CELL_COUNT; i++ ) {
+ System.out.print(cells.get(i));
+ System.out.print( ( colIndex(i + 1) == 0 ) ? System.lineSeparator() : " ");
+ }
}
- private void increment(int aRow, int aCol) {
- final int index = cellIndex(aRow, aCol);
- cells.set(index, cells.get(index) + 1);
- }
+ private void increment(int aRow, int aCol) {
+ final int index = cellIndex(aRow, aCol);
+ cells.set(index, cells.get(index) + 1);
+ }
private static int cellIndex(int aRow, int aCol) {
return aRow * COL_COUNT + aCol;
@@ -113,12 +113,12 @@ final class Sandpile {
private static int colIndex(int aCellIndex) {
return aCellIndex % COL_COUNT;
}
-
+
private List cells;
- private static final int ROW_COUNT = 3;
- private static final int COL_COUNT = 3;
- private static final int CELL_COUNT = ROW_COUNT * COL_COUNT;
- private static final int CELL_LIMIT = 4;
-
+ private static final int ROW_COUNT = 3;
+ private static final int COL_COUNT = 3;
+ private static final int CELL_COUNT = ROW_COUNT * COL_COUNT;
+ private static final int CELL_LIMIT = 4;
+
}
diff --git a/Task/Abelian-sandpile-model-Identity/Pluto/abelian-sandpile-model-identity.pluto b/Task/Abelian-sandpile-model-Identity/Pluto/abelian-sandpile-model-identity.pluto
index 867e535547..f0918a7649 100644
--- a/Task/Abelian-sandpile-model-Identity/Pluto/abelian-sandpile-model-identity.pluto
+++ b/Task/Abelian-sandpile-model-Identity/Pluto/abelian-sandpile-model-identity.pluto
@@ -24,7 +24,7 @@ class Sandpile
for i = 1, 9 do
if self.a[i] > 3 then
self.a[i] -= 4
- for self.neighbors[i] as j do ++self.a[j] end
+ for self.neighbors[i] as j do self.a[j] += 1 end
return
end
end
diff --git a/Task/Abelian-sandpile-model-Identity/Red/abelian-sandpile-model-identity.red b/Task/Abelian-sandpile-model-Identity/Red/abelian-sandpile-model-identity.red
index fd19c28c14..c11dff51d1 100644
--- a/Task/Abelian-sandpile-model-Identity/Red/abelian-sandpile-model-identity.red
+++ b/Task/Abelian-sandpile-model-Identity/Red/abelian-sandpile-model-identity.red
@@ -1,71 +1,71 @@
Red [Purpose: "implement Abelian sandpile model"]
sadd: make object! [
- comb: function [pile1 [series!] pile2 [series!]] [
- repeat r 3 [
- repeat c 3 [
- pile2/:r/:c: pile2/:r/:c + pile1/:r/:c
- ]
- ]
- check pile2
- ]
- check: func [pile [series!]] [
- stable: true row: col: none
- repeat r 3[
- repeat c 3[
- if pile/:r/:c >= 4 [
- stable: false
- pile/:r/:c: pile/:r/:c - 4
- row: r col: c
- break]
- ]
- if stable = false [break]
- ]
- unless stable = false [print trim/with mold/only pile "[]" exit]
- spill pile row col
- ]
- spill: func [pile [series!] r [integer!] c [integer!]] [
- neigh: reduce [
- right: reduce [r c - 1] up: reduce [r + 1 c]
- left: reduce [r c + 1] down: reduce [r - 1 c]
- ]
- foreach n neigh [
- unless any [(pile/(n/1) = none) (pile/(n/1)/(n/2) = none)] [
- pile/(n/1)/(n/2): pile/(n/1)/(n/2) + 1
- ]
- ]
- check pile
- ]
+ comb: function [pile1 [series!] pile2 [series!]] [
+ repeat r 3 [
+ repeat c 3 [
+ pile2/:r/:c: pile2/:r/:c + pile1/:r/:c
+ ]
+ ]
+ check pile2
+ ]
+ check: func [pile [series!]] [
+ stable: true row: col: none
+ repeat r 3[
+ repeat c 3[
+ if pile/:r/:c >= 4 [
+ stable: false
+ pile/:r/:c: pile/:r/:c - 4
+ row: r col: c
+ break]
+ ]
+ if stable = false [break]
+ ]
+ unless stable = false [print trim/with mold/only pile "[]" exit]
+ spill pile row col
+ ]
+ spill: func [pile [series!] r [integer!] c [integer!]] [
+ neigh: reduce [
+ right: reduce [r c - 1] up: reduce [r + 1 c]
+ left: reduce [r c + 1] down: reduce [r - 1 c]
+ ]
+ foreach n neigh [
+ unless any [(pile/(n/1) = none) (pile/(n/1)/(n/2) = none)] [
+ pile/(n/1)/(n/2): pile/(n/1)/(n/2) + 1
+ ]
+ ]
+ check pile
+ ]
]
s1: [
- [1 2 0]
- [2 1 1]
- [0 1 3]
+ [1 2 0]
+ [2 1 1]
+ [0 1 3]
]
s2: [
- [2 1 3]
- [1 0 1]
- [0 1 0]
+ [2 1 3]
+ [1 0 1]
+ [0 1 0]
]
s3: [
- [3 3 3]
- [3 3 3]
- [3 3 3]
+ [3 3 3]
+ [3 3 3]
+ [3 3 3]
]
s3_id: [
- [2 1 2]
- [1 0 1]
- [2 1 2]
+ [2 1 2]
+ [1 0 1]
+ [2 1 2]
]
ex: [
- [4 3 3]
- [3 1 2]
- [0 2 3]
+ [4 3 3]
+ [3 1 2]
+ [0 2 3]
]
sadd/check copy/deep ex
diff --git a/Task/Abelian-sandpile-model/Ada/abelian-sandpile-model.ada b/Task/Abelian-sandpile-model/Ada/abelian-sandpile-model.ada
deleted file mode 100644
index 10aa915326..0000000000
--- a/Task/Abelian-sandpile-model/Ada/abelian-sandpile-model.ada
+++ /dev/null
@@ -1,67 +0,0 @@
-pragma Ada_2022;
-with Ada.Command_Line; use Ada.Command_Line;
-with Ada.Text_IO; use Ada.Text_IO;
-procedure Abelian_Sandpile is
- type Grid_2D is array (Positive range <>, Positive range <>) of Natural;
-
- procedure Write_PPM (Grid : Grid_2D; Filename : String) is
- PPM_File : File_Type;
- begin
- Create (PPM_File, Out_File, Filename);
- Put_Line (PPM_File, "P3");
- Put_Line (PPM_File, Grid'Length (1)'Image & Grid'Length (2)'Image);
- Put_Line (PPM_File, "7");
- for Y in 1 .. Grid'Length (2) loop
- for X in 1 .. Grid'Length (1) loop
- case Grid (X, Y) is
- when 0 => Put_Line (PPM_File, "0 0 0"); -- black
- when 1 => Put_Line (PPM_File, "0 7 0"); -- green
- when 2 => Put_Line (PPM_File, "7 0 7"); -- lilac
- when 3 => Put_Line (PPM_File, "7 7 0"); -- yellow
- when others => Put_Line (PPM_File, "0 0 7"); -- blue, shouldn't happen
- end case;
- end loop;
- end loop;
- Close (PPM_File);
- end Write_PPM;
-begin
- if Argument_Count /= 2 then
- Put_Line ("Error: Must specify ");
- else
- declare
- Initial_Height : constant Positive := Positive'Value (Argument (1));
- Grid_Size : constant Positive := Positive'Value (Argument (2));
- Sandpile : Grid_2D (1 .. Grid_Size, 1 .. Grid_Size) := [others => [others => 0]];
- More_To_Do : Boolean := True;
- Overspill : Natural;
- begin
- Sandpile (Grid_Size / 2, Grid_Size / 2) := Initial_Height;
- while More_To_Do loop
- More_To_Do := False;
- for X in 1 .. Grid_Size loop
- for Y in 1 .. Grid_Size loop
- if Sandpile (X, Y) >= 4 then
- Overspill := Sandpile (X, Y) / 4;
- Sandpile (X, Y) := @ mod 4;
- More_To_Do := True;
- if X > 1 then
- Sandpile (X - 1, Y) := @ + Overspill;
- end if;
- if Y > 1 then
- Sandpile (X, Y - 1) := @ + Overspill;
- end if;
- if X < Grid_Size then
- Sandpile (X + 1, Y) := @ + Overspill;
- end if;
- if Y < Grid_Size then
- Sandpile (X, Y + 1) := @ + Overspill;
- end if;
- end if;
- end loop;
- end loop;
- end loop;
- if Grid_Size < 16 then Put_Line (Sandpile'Image); end if;
- Write_PPM (Sandpile, "sandpile.ppm");
- end;
- end if;
-end Abelian_Sandpile;
diff --git a/Task/Abelian-sandpile-model/Pluto/abelian-sandpile-model.pluto b/Task/Abelian-sandpile-model/Pluto/abelian-sandpile-model.pluto
index 0a161fb42c..561300de49 100644
--- a/Task/Abelian-sandpile-model/Pluto/abelian-sandpile-model.pluto
+++ b/Task/Abelian-sandpile-model/Pluto/abelian-sandpile-model.pluto
@@ -28,7 +28,7 @@ class Sandpile
for i = 1, #self.a do
if self.a[i] > 3 then
self.a[i] -= 4
- for self.neighbors[i] as j do ++self.a[j] end
+ for self.neighbors[i] as j do self.a[j] += 1 end
end
end
end
diff --git a/Task/Abstract-type/Ada/abstract-type-1.ada b/Task/Abstract-type/Ada/abstract-type-1.ada
deleted file mode 100644
index ec6e7dfe56..0000000000
--- a/Task/Abstract-type/Ada/abstract-type-1.ada
+++ /dev/null
@@ -1,3 +0,0 @@
-type Queue is limited interface;
-procedure Enqueue (Lounge : in out Queue; Item : in out Element) is abstract;
-procedure Dequeue (Lounge : in out Queue; Item : in out Element) is abstract;
diff --git a/Task/Abstract-type/Ada/abstract-type-2.ada b/Task/Abstract-type/Ada/abstract-type-2.ada
deleted file mode 100644
index 09512a4fd8..0000000000
--- a/Task/Abstract-type/Ada/abstract-type-2.ada
+++ /dev/null
@@ -1,2 +0,0 @@
-type Scheduler is task interface;
-procedure Plan (Manager : in out Scheduler; Activity : in out Job) is abstract;
diff --git a/Task/Abstract-type/Ada/abstract-type-3.ada b/Task/Abstract-type/Ada/abstract-type-3.ada
deleted file mode 100644
index 712648f9b7..0000000000
--- a/Task/Abstract-type/Ada/abstract-type-3.ada
+++ /dev/null
@@ -1,10 +0,0 @@
-with Ada.Finalization;
-...
-type Node is abstract new Ada.Finalization.Limited_Controlled and Queue with record
- Previous : not null access Node'Class := Node'Unchecked_Access;
- Next : not null access Node'Class := Node'Unchecked_Access;
-end record;
-overriding procedure Finalize (X : in out Node); -- Removes the node from its list if any
-overriding procedure Dequeue (Lounge : in out Node; Item : in out Element);
-overriding procedure Enqueue (Lounge : in out Node; Item : in out Element);
-procedure Process (X : in out Node) is abstract; -- To be implemented
diff --git a/Task/Abstract-type/COBOL/abstract-type.cobol b/Task/Abstract-type/COBOL/abstract-type.cobol
deleted file mode 100644
index 3010951b3c..0000000000
--- a/Task/Abstract-type/COBOL/abstract-type.cobol
+++ /dev/null
@@ -1,68 +0,0 @@
- IDENTIFICATION DIVISION.
- INTERFACE-ID. Shape.
-
- PROCEDURE DIVISION.
-
- IDENTIFICATION DIVISION.
- METHOD-ID. perimeter.
- DATA DIVISION.
- LINKAGE SECTION.
- 01 ret USAGE FLOAT-LONG.
- PROCEDURE DIVISION RETURNING ret.
- END METHOD perimeter.
-
- IDENTIFICATION DIVISION.
- METHOD-ID. shape-area.
- DATA DIVISION.
- LINKAGE SECTION.
- 01 ret USAGE FLOAT-LONG.
- PROCEDURE DIVISION RETURNING ret.
- END METHOD shape-area.
-
- END INTERFACE Shape.
-
-
- IDENTIFICATION DIVISION.
- CLASS-ID. Rectangle.
-
- ENVIRONMENT DIVISION.
- CONFIGURATION SECTION.
- REPOSITORY.
- INTERFACE Shape.
-
- IDENTIFICATION DIVISION.
- OBJECT IMPLEMENTS Shape.
- DATA DIVISION.
- WORKING-STORAGE SECTION.
- 01 width USAGE FLOAT-LONG PROPERTY.
- 01 height USAGE FLOAT-LONG PROPERTY.
-
- PROCEDURE DIVISION.
-
- IDENTIFICATION DIVISION.
- METHOD-ID. perimeter.
- DATA DIVISION.
- LINKAGE SECTION.
- 01 ret USAGE FLOAT-LONG.
- PROCEDURE DIVISION RETURNING ret.
- COMPUTE
- ret = width * 2.0 + height * 2.0
- END-COMPUTE
- GOBACK.
- END METHOD perimeter.
-
- IDENTIFICATION DIVISION.
- METHOD-ID. shape-area.
- DATA DIVISION.
- LINKAGE SECTION.
- 01 ret USAGE FLOAT-LONG.
- PROCEDURE DIVISION RETURNING ret.
- COMPUTE
- ret = width * height
- END-COMPUTE
- GOBACK.
- END METHOD shape-area.
-
- END OBJECT.
-
- END CLASS Rectangle.
diff --git a/Task/Abstract-type/Haxe/abstract-type-1.haxe b/Task/Abstract-type/Haxe/abstract-type-1.haxe
deleted file mode 100644
index 91134488e5..0000000000
--- a/Task/Abstract-type/Haxe/abstract-type-1.haxe
+++ /dev/null
@@ -1,44 +0,0 @@
-interface Vocal {
- public function speak():String;
-}
-
-interface Gravitational {
- public function getWeight():Int;
-}
-
-abstract class Dog implements Vocal implements Gravitational {
- public function speak():String {
- return "Woof";
- }
-
- public function new() {}
-}
-
-class Chihuahua extends Dog {
- public function getWeight():Int {
- return 5;
- }
-}
-
-class GreatDane extends Dog {
- public function getWeight():Int {
- return 150;
- }
-}
-
-class Main {
- static public function main():Void {
- var dogs:Array = [];
-
- var david = new Chihuahua();
- var goliath = new GreatDane();
-
- dogs.push(david);
- dogs.push(goliath);
-
- for (dog in dogs) {
- trace(dog.speak());
- trace(dog.getWeight());
- }
- }
-}
diff --git a/Task/Abstract-type/Haxe/abstract-type-2.haxe b/Task/Abstract-type/Haxe/abstract-type-2.haxe
deleted file mode 100644
index 7745ff6089..0000000000
--- a/Task/Abstract-type/Haxe/abstract-type-2.haxe
+++ /dev/null
@@ -1,3 +0,0 @@
-class abstraction()
- abstract method compare(l,r) # generates runerr(700, "method compare()")
-end
diff --git a/Task/Abstract-type/PowerShell/abstract-type-1.psh b/Task/Abstract-type/PowerShell/abstract-type-1.psh
deleted file mode 100644
index c1c82d3b36..0000000000
--- a/Task/Abstract-type/PowerShell/abstract-type-1.psh
+++ /dev/null
@@ -1,92 +0,0 @@
-#Requires -Version 5.0
-
-Class Player
-{
- <#
- Properties: Name, Team, Position and Number
- #>
- [string]$Name
-
- [ValidateSet("Baltimore Ravens","Cincinnati Bengals","Cleveland Browns","Pittsburgh Steelers",
- "Chicago Bears","Detroit Lions","Green Bay Packers","Minnesota Vikings",
- "Houston Texans","Indianapolis Colts","Jacksonville Jaguars","Tennessee Titans",
- "Atlanta Falcons","Carolina Panthers","New Orleans Saints","Tampa Bay Buccaneers",
- "Buffalo Bills","Miami Dolphins","New England Patriots","New York Jets",
- "Dallas Cowboys","New York Giants","Philadelphia Eagles","Washington Redskins",
- "Denver Broncos","Kansas City Chiefs","Oakland Raiders","San Diego Chargers",
- "Arizona Cardinals","Los Angeles Rams","San Francisco 49ers","Seattle Seahawks")]
- [string]$Team
-
- [ValidateSet("C","G","T","QB","RB","WR","TE","DT","DE","ILB","OLB","CB","S","K","H","LS","P","KOS","R")]
- [string]$Position
-
- [ValidateRange(0,99)]
- [int]$Number
-
- <#
- Constructor: Creates a new Player object, with the specified Name, Team, Position and Number.
- #>
- Player([string]$Name, [string]$Team, [string]$Position, [int]$Number)
- {
- $this.Name = (Get-Culture).TextInfo.ToTitleCase("$Name")
- $this.Team = (Get-Culture).TextInfo.ToTitleCase("$Team")
- $this.Position = $Position.ToUpper()
- $this.Number = $Number
- }
-
- <#
- Methods: Trade the player to a different team (optional parameters for methods in PowerShell 5 classes are not available. Boo!!)
- An overloaded method is a method with the same name as another method but in a different context,
- in this case with different parameters.
- #>
- Trade([string]$NewTeam)
- {
- [string[]]$league = "Baltimore Ravens","Cincinnati Bengals","Cleveland Browns","Pittsburgh Steelers",
- "Chicago Bears","Detroit Lions","Green Bay Packers","Minnesota Vikings",
- "Houston Texans","Indianapolis Colts","Jacksonville Jaguars","Tennessee Titans",
- "Atlanta Falcons","Carolina Panthers","New Orleans Saints","Tampa Bay Buccaneers",
- "Buffalo Bills","Miami Dolphins","New England Patriots","New York Jets",
- "Dallas Cowboys","New York Giants","Philadelphia Eagles","Washington Redskins",
- "Denver Broncos","Kansas City Chiefs","Oakland Raiders","San Diego Chargers",
- "Arizona Cardinals","Los Angeles Rams","San Francisco 49ers","Seattle Seahawks"
-
- if ($NewTeam -in $league | Where-Object {$_ -notmatch $this.Team})
- {
- $this.Team = (Get-Culture).TextInfo.ToTitleCase("$NewTeam")
- }
- else
- {
- throw "Invalid Team"
- }
- }
-
- Trade([string]$NewTeam, [int]$NewNumber)
- {
- [string[]]$league = "Baltimore Ravens","Cincinnati Bengals","Cleveland Browns","Pittsburgh Steelers",
- "Chicago Bears","Detroit Lions","Green Bay Packers","Minnesota Vikings",
- "Houston Texans","Indianapolis Colts","Jacksonville Jaguars","Tennessee Titans",
- "Atlanta Falcons","Carolina Panthers","New Orleans Saints","Tampa Bay Buccaneers",
- "Buffalo Bills","Miami Dolphins","New England Patriots","New York Jets",
- "Dallas Cowboys","New York Giants","Philadelphia Eagles","Washington Redskins",
- "Denver Broncos","Kansas City Chiefs","Oakland Raiders","San Diego Chargers",
- "Arizona Cardinals","Los Angeles Rams","San Francisco 49ers","Seattle Seahawks"
-
- if ($NewTeam -in $league | Where-Object {$_ -notmatch $this.Team})
- {
- $this.Team = (Get-Culture).TextInfo.ToTitleCase("$NewTeam")
- }
- else
- {
- throw "Invalid Team"
- }
-
- if ($NewNumber -in 0..99)
- {
- $this.Number = $NewNumber
- }
- else
- {
- throw "Invalid Number"
- }
- }
-}
diff --git a/Task/Abstract-type/PowerShell/abstract-type-2.psh b/Task/Abstract-type/PowerShell/abstract-type-2.psh
deleted file mode 100644
index a0711e85f9..0000000000
--- a/Task/Abstract-type/PowerShell/abstract-type-2.psh
+++ /dev/null
@@ -1,2 +0,0 @@
-$player1 = [Player]::new("sam bradford", "philadelphia eagles", "qb", 7)
-$player1
diff --git a/Task/Abstract-type/PowerShell/abstract-type-3.psh b/Task/Abstract-type/PowerShell/abstract-type-3.psh
deleted file mode 100644
index 4c2ddc606c..0000000000
--- a/Task/Abstract-type/PowerShell/abstract-type-3.psh
+++ /dev/null
@@ -1,2 +0,0 @@
-$player1.Trade("minnesota vikings", 8)
-$player1
diff --git a/Task/Abstract-type/PowerShell/abstract-type-4.psh b/Task/Abstract-type/PowerShell/abstract-type-4.psh
deleted file mode 100644
index 7cd5678d1b..0000000000
--- a/Task/Abstract-type/PowerShell/abstract-type-4.psh
+++ /dev/null
@@ -1,2 +0,0 @@
-$player2 = [Player]::new("demarco murray", "philadelphia eagles", "rb", 29)
-$player2
diff --git a/Task/Abstract-type/PowerShell/abstract-type-5.psh b/Task/Abstract-type/PowerShell/abstract-type-5.psh
deleted file mode 100644
index 1b65e884e8..0000000000
--- a/Task/Abstract-type/PowerShell/abstract-type-5.psh
+++ /dev/null
@@ -1,2 +0,0 @@
-$player2.Trade("tennessee titans")
-$player2
diff --git a/Task/Abstract-type/REBOL/abstract-type.rebol b/Task/Abstract-type/REBOL/abstract-type.rebol
deleted file mode 100644
index 184d2223f1..0000000000
--- a/Task/Abstract-type/REBOL/abstract-type.rebol
+++ /dev/null
@@ -1,44 +0,0 @@
-REBOL [
- Title: "Abstract Type"
- URL: http://rosettacode.org/wiki/Abstract_type
-]
-
-; The "shape" class is an abstract class -- it defines the "pen"
-; property and "line" method, but "size" and "draw" are undefined and
-; unimplemented.
-
-shape: make object! [
- pen: "X"
- size: none
-
- line: func [count][loop count [prin self/pen] prin crlf]
- draw: does [none]
-]
-
-; The "box" class inherits from "shape" and provides the missing
-; information for drawing boxes.
-
-box: make shape [
- size: 10
- draw: does [loop self/size [line self/size]]
-]
-
-; "rectangle" also inherits from "shape", but handles the
-; implementation very differently.
-
-rectangle: make shape [
- size: 20x10
- draw: does [loop self/size/y [line self/size/x]]
-]
-
-; Unlike some languages discussed, REBOL has absolutely no qualms
-; about instantiating an "abstract" class -- that's how I created the
-; derived classes of "rectangle" and "box", after all.
-
-s: make shape [] s/draw ; Nothing happens.
-
-print "A box:"
-b: make box [pen: "O" size: 5] b/draw
-
-print "^/A rectangle:"
-r: make rectangle [size: 32x5] r/draw
diff --git a/Task/Abstract-type/ReScript/abstract-type.re b/Task/Abstract-type/ReScript/abstract-type.re
deleted file mode 100644
index 63c57c4e0c..0000000000
--- a/Task/Abstract-type/ReScript/abstract-type.re
+++ /dev/null
@@ -1 +0,0 @@
-type t
diff --git a/Task/Abundant-deficient-and-perfect-number-classifications/Ada/abundant-deficient-and-perfect-number-classifications.ada b/Task/Abundant-deficient-and-perfect-number-classifications/Ada/abundant-deficient-and-perfect-number-classifications.ada
deleted file mode 100644
index 6f066bde65..0000000000
--- a/Task/Abundant-deficient-and-perfect-number-classifications/Ada/abundant-deficient-and-perfect-number-classifications.ada
+++ /dev/null
@@ -1,35 +0,0 @@
-with Ada.Text_IO, Generic_Divisors;
-
-procedure ADB_Classification is
- function Same(P: Positive) return Positive is (P);
- package Divisor_Sum is new Generic_Divisors
- (Result_Type => Natural, None => 0, One => Same, Add => "+");
-
- type Class_Type is (Deficient, Perfect, Abundant);
-
- function Class(D_Sum, N: Natural) return Class_Type is
- (if D_Sum < N then Deficient
- elsif D_Sum = N then Perfect
- else Abundant);
-
- Cls: Class_Type;
- Results: array (Class_Type) of Natural := (others => 0);
-
- package NIO is new Ada.Text_IO.Integer_IO(Natural);
- package CIO is new Ada.Text_IO.Enumeration_IO(Class_Type);
-begin
- for N in 1 .. 20_000 loop
- Cls := Class(Divisor_Sum.Process(N), N);
- Results(Cls) := Results(Cls)+1;
- end loop;
- for Class in Results'Range loop
- CIO.Put(Class, 12);
- NIO.Put(Results(Class), 8);
- Ada.Text_IO.New_Line;
- end loop;
- Ada.Text_IO.Put_Line("--------------------");
- Ada.Text_IO.Put("Sum ");
- NIO.Put(Results(Deficient)+Results(Perfect)+Results(Abundant), 8);
- Ada.Text_IO.New_Line;
- Ada.Text_IO.Put_Line("====================");
-end ADB_Classification;
diff --git a/Task/Abundant-deficient-and-perfect-number-classifications/Arturo/abundant-deficient-and-perfect-number-classifications.arturo b/Task/Abundant-deficient-and-perfect-number-classifications/Arturo/abundant-deficient-and-perfect-number-classifications.arturo
index 7821776907..df1055fd73 100644
--- a/Task/Abundant-deficient-and-perfect-number-classifications/Arturo/abundant-deficient-and-perfect-number-classifications.arturo
+++ b/Task/Abundant-deficient-and-perfect-number-classifications/Arturo/abundant-deficient-and-perfect-number-classifications.arturo
@@ -1,15 +1,16 @@
properDivisors: function [n]->
(factors n) -- n
-abundant: new 0 deficient: new 0 perfect: new 0
+[abundant, deficient, perfect]: 0
loop 1..20000 'x [
s: sum properDivisors x
- case [s]
- when? [ inc 'deficient
- when? [>x] -> inc 'abundant
- else -> inc 'perfect
+ when.has: s [
+ [< x] -> inc 'deficient
+ [> x] -> inc 'abundant
+ true -> inc 'perfect
+ ]
]
print ["Found" abundant "abundant,"
diff --git a/Task/Abundant-deficient-and-perfect-number-classifications/BASIC/abundant-deficient-and-perfect-number-classifications.basic b/Task/Abundant-deficient-and-perfect-number-classifications/BASIC/abundant-deficient-and-perfect-number-classifications.basic
deleted file mode 100644
index 53f97b74c8..0000000000
--- a/Task/Abundant-deficient-and-perfect-number-classifications/BASIC/abundant-deficient-and-perfect-number-classifications.basic
+++ /dev/null
@@ -1,11 +0,0 @@
-10 DEFINT A-Z: LM=20000
-20 DIM P(LM)
-30 FOR I=1 TO LM: P(I)=-32767: NEXT
-40 FOR I=1 TO LM/2: FOR J=I+I TO LM STEP I: P(J)=P(J)+I: NEXT: NEXT
-50 FOR I=1 TO LM
-60 X=I-32767
-70 IF P(I) i Then
- Abundant = Abundant + 1
- End If
-Next
-WScript.Echo "Deficient = " & Deficient & vbCrLf &_
- "Perfect = " & Perfect & vbCrLf &_
- "Abundant = " & Abundant
diff --git a/Task/Abundant-odd-numbers/ALGOL-68/abundant-odd-numbers.alg b/Task/Abundant-odd-numbers/ALGOL-68/abundant-odd-numbers.alg
index cc24a232e3..c7fd5ea18b 100644
--- a/Task/Abundant-odd-numbers/ALGOL-68/abundant-odd-numbers.alg
+++ b/Task/Abundant-odd-numbers/ALGOL-68/abundant-odd-numbers.alg
@@ -1,4 +1,4 @@
-BEGIN # find some abundant odd numbers - numbers wose the proper divisor sum #
+BEGIN # find some abundant odd numbers - numbers where the proper divisor sum #
# is bigger than the number itself #
# returns the sum of the proper divisors of n #
diff --git a/Task/Abundant-odd-numbers/Ada/abundant-odd-numbers.ada b/Task/Abundant-odd-numbers/Ada/abundant-odd-numbers.ada
deleted file mode 100644
index e4f4870bf6..0000000000
--- a/Task/Abundant-odd-numbers/Ada/abundant-odd-numbers.ada
+++ /dev/null
@@ -1,57 +0,0 @@
-with Ada.Text_IO, Generic_Divisors;
-
-procedure Odd_Abundant is
- function Same(P: Positive) return Positive is (P);
-
- package Divisor_Sum is new Generic_Divisors
- (Result_Type => Natural, None => 0, One => Same, Add => "+");
-
- function Abundant(N: Positive) return Boolean is
- (Divisor_Sum.Process(N) > N);
-
- package NIO is new Ada.Text_IO.Integer_IO(Natural);
-
- Current: Positive := 1;
-
- procedure Print_Abundant_Line
- (Idx: Positive; N: Positive; With_Idx: Boolean:= True) is
- begin
- if With_Idx then
- NIO.Put(Idx, 6); Ada.Text_IO.Put(" |");
- else
- Ada.Text_IO.Put(" *** |");
- end if;
- NIO.Put(N, 12); Ada.Text_IO.Put(" | ");
- NIO.Put(Divisor_Sum.Process(N), 12); Ada.Text_IO.New_Line;
- end Print_Abundant_Line;
-
-begin
- -- the first 25 abundant odd numbers
- Ada.Text_IO.Put_Line(" index | number | proper divisor sum ");
- Ada.Text_IO.Put_Line("-------+-------------+--------------------");
- for I in 1 .. 25 loop
- while not Abundant(Current) loop
- Current := Current + 2;
- end loop;
- Print_Abundant_Line(I, Current);
- Current := Current + 2;
- end loop;
-
- -- the one thousandth abundant odd number
- Ada.Text_IO.Put_Line("-------+-------------+--------------------");
- for I in 26 .. 1_000 loop
- Current := Current + 2;
- while not Abundant(Current) loop
- Current := Current + 2;
- end loop;
- end loop;
- Print_Abundant_Line(1000, Current);
-
- -- the first abundant odd number greater than 10**9
- Ada.Text_IO.Put_Line("-------+-------------+--------------------");
- Current := 10**9+1;
- while not Abundant(Current) loop
- Current := Current + 2;
- end loop;
- Print_Abundant_Line(1, Current, False);
-end Odd_Abundant;
diff --git a/Task/Abundant-odd-numbers/Agena/abundant-odd-numbers.agena b/Task/Abundant-odd-numbers/Agena/abundant-odd-numbers.agena
index 498c14b6a4..4f74aaf032 100644
--- a/Task/Abundant-odd-numbers/Agena/abundant-odd-numbers.agena
+++ b/Task/Abundant-odd-numbers/Agena/abundant-odd-numbers.agena
@@ -35,7 +35,7 @@ scope # find some abundant snumbers
fi;
odd_number +:= 2
od;
- printf( "1000th abundant odd number:\n %d proper divisor sum: %d\n", odd_number, d_sum );
+ printf( "1000th abundant odd number:\n %d proper divisor sum: %d\n", odd_number - 2, d_sum );
# first odd abundant number > one billion
odd_number := 1_000_000_001;
local found := false;
@@ -43,7 +43,7 @@ scope # find some abundant snumbers
d_sum := divisor_sum( odd_number );
if d_sum > odd_number then
found := true;
- print( "First abundant odd_number > 1 000 000 000:" );
+ print( "First abundant odd number > 1 000 000 000:" );
printf( " %d proper divisor sum: %d\n", odd_number, d_sum );
fi;
odd_number +:= 2
diff --git a/Task/Abundant-odd-numbers/Arturo/abundant-odd-numbers.arturo b/Task/Abundant-odd-numbers/Arturo/abundant-odd-numbers.arturo
index 54cdd1ed18..69b212de1c 100644
--- a/Task/Abundant-odd-numbers/Arturo/abundant-odd-numbers.arturo
+++ b/Task/Abundant-odd-numbers/Arturo/abundant-odd-numbers.arturo
@@ -1,7 +1,7 @@
abundant?: function [n]-> (2*n) < sum factors n
print "the first 25 abundant odd numbers:"
-[i, found]: @[new 1, new 0]
+[i, found]: [1, 0]
while [found<25][
if abundant? i [
inc 'found
@@ -10,7 +10,7 @@ while [found<25][
'i + 2
]
-[i, found]: @[new 1, new 0]
+[i, found]: [1, 0]
while [found<1000][
if abundant? i [
inc 'found
@@ -19,7 +19,7 @@ while [found<1000][
]
print ["the 1000th abundant odd number:" i-2 "=> sum:" sum factors i-2]
-i: new 1 + 10^9
+i: 1 + 10^9
while ø [
if abundant? i [
print ["the first abundant odd number greater than one billion (10^9):" i "=> sum:" sum factors i]
diff --git a/Task/Abundant-odd-numbers/AutoHotkey/abundant-odd-numbers-1.ahk b/Task/Abundant-odd-numbers/AutoHotkey/abundant-odd-numbers-1.ahk
index 50aad3e044..b4b30cb205 100644
--- a/Task/Abundant-odd-numbers/AutoHotkey/abundant-odd-numbers-1.ahk
+++ b/Task/Abundant-odd-numbers/AutoHotkey/abundant-odd-numbers-1.ahk
@@ -1,20 +1,20 @@
Abundant(num){
- sum := 0, str := ""
- for n, bool in proper_divisors(num)
- sum += n, str .= (str?"+":"") n
- return sum > num ? str " = " sum : 0
+ sum := 0, str := ""
+ for n, bool in proper_divisors(num)
+ sum += n, str .= (str?"+":"") n
+ return sum > num ? str " = " sum : 0
}
proper_divisors(n) {
- Array := []
- if n = 1
- return Array
- Array[1] := true
- x := Floor(Sqrt(n))
- loop, % x+1
- if !Mod(n, i:=A_Index+1) && (floor(n/i) < n)
- Array[floor(n/i)] := true
- Loop % n/x
- if !Mod(n, i:=A_Index+1) && (i < n)
- Array[i] := true
- return Array
+ Array := []
+ if n = 1
+ return Array
+ Array[1] := true
+ x := Floor(Sqrt(n))
+ loop, % x+1
+ if !Mod(n, i:=A_Index+1) && (floor(n/i) < n)
+ Array[floor(n/i)] := true
+ Loop % n/x
+ if !Mod(n, i:=A_Index+1) && (i < n)
+ Array[i] := true
+ return Array
}
diff --git a/Task/Abundant-odd-numbers/AutoHotkey/abundant-odd-numbers-2.ahk b/Task/Abundant-odd-numbers/AutoHotkey/abundant-odd-numbers-2.ahk
index 8b551ae094..34c363a283 100644
--- a/Task/Abundant-odd-numbers/AutoHotkey/abundant-odd-numbers-2.ahk
+++ b/Task/Abundant-odd-numbers/AutoHotkey/abundant-odd-numbers-2.ahk
@@ -1,25 +1,25 @@
output := "First 25 abundant odd numbers:`n"
while (count<1000)
{
- oddNum := 2*A_Index-1
- if (str := Abundant(oddNum))
- {
- count++
- if (count<=25)
- output .= oddNum " " str "`n"
- if (count = 1000)
- output .= "`nOne thousandth abundant odd number:`n" oddNum " " str "`n"
- }
+ oddNum := 2*A_Index-1
+ if (str := Abundant(oddNum))
+ {
+ count++
+ if (count<=25)
+ output .= oddNum " " str "`n"
+ if (count = 1000)
+ output .= "`nOne thousandth abundant odd number:`n" oddNum " " str "`n"
+ }
}
count := 0
while !count
{
- num := 2*A_Index -1 + 1000000000
- if (str := Abundant(num))
- {
- count++
- output .= "`nFirst abundant odd number greater than one billion:`n" num " " str "`n"
- }
+ num := 2*A_Index -1 + 1000000000
+ if (str := Abundant(num))
+ {
+ count++
+ output .= "`nFirst abundant odd number greater than one billion:`n" num " " str "`n"
+ }
}
MsgBox % output
return
diff --git a/Task/Abundant-odd-numbers/BASIC256/abundant-odd-numbers.basic b/Task/Abundant-odd-numbers/BASIC256/abundant-odd-numbers.basic
index 2815f44149..90948ba7ab 100644
--- a/Task/Abundant-odd-numbers/BASIC256/abundant-odd-numbers.basic
+++ b/Task/Abundant-odd-numbers/BASIC256/abundant-odd-numbers.basic
@@ -3,37 +3,37 @@ contar = 0
sumaDiv = 0
function SumaDivisores(n)
- # Devuelve la suma de los divisores propios de n
- suma = 1
- i = int(sqr(n))
+ # Devuelve la suma de los divisores propios de n
+ suma = 1
+ i = int(sqr(n))
- for d = 2 to i
- if n % d = 0 then
- suma += d
- otroD = n \ d
- if otroD <> d Then suma += otroD
- end if
- Next d
- Return suma
+ for d = 2 to i
+ if n % d = 0 then
+ suma += d
+ otroD = n \ d
+ if otroD <> d Then suma += otroD
+ end if
+ Next d
+ Return suma
End Function
# Encontrar los números requeridos por la tarea:
# primeros 25 números abundantes impares
Print "Los primeros 25 números impares abundantes:"
While contar < 25
- sumaDiv = SumaDivisores(numimpar)
- If sumaDiv > numimpar Then
- contar += 1
- Print numimpar & " suma divisoria adecuada: " & sumaDiv
- End If
- numimpar += 2
+ sumaDiv = SumaDivisores(numimpar)
+ If sumaDiv > numimpar Then
+ contar += 1
+ Print numimpar & " suma divisoria adecuada: " & sumaDiv
+ End If
+ numimpar += 2
End While
# 1000er número impar abundante
While contar < 1000
- sumaDiv = SumaDivisores(numimpar)
- If sumaDiv > numimpar Then contar += 1
- numimpar += 2
+ sumaDiv = SumaDivisores(numimpar)
+ If sumaDiv > numimpar Then contar += 1
+ numimpar += 2
End While
Print Chr(10) & "1000º número impar abundante:"
Print " " & (numimpar - 2) & " suma divisoria adecuada: " & sumaDiv
@@ -42,12 +42,12 @@ Print " " & (numimpar - 2) & " suma divisoria adecuada: " & sumaDiv
numimpar = 1000000001
encontrado = False
While Not encontrado
- sumaDiv = SumaDivisores(numimpar)
- If sumaDiv > numimpar Then
- encontrado = True
- Print Chr(10) & "Primer número impar abundante > 1 000 000 000:"
- Print " " & numimpar & " suma divisoria adecuada: " & sumaDiv
- End If
- numimpar += 2
+ sumaDiv = SumaDivisores(numimpar)
+ If sumaDiv > numimpar Then
+ encontrado = True
+ Print Chr(10) & "Primer número impar abundante > 1 000 000 000:"
+ Print " " & numimpar & " suma divisoria adecuada: " & sumaDiv
+ End If
+ numimpar += 2
End While
End
diff --git a/Task/Abundant-odd-numbers/MiniScript/abundant-odd-numbers.mini b/Task/Abundant-odd-numbers/MiniScript/abundant-odd-numbers.mini
index fdfd80abff..0b8a265086 100644
--- a/Task/Abundant-odd-numbers/MiniScript/abundant-odd-numbers.mini
+++ b/Task/Abundant-odd-numbers/MiniScript/abundant-odd-numbers.mini
@@ -1,44 +1,44 @@
divisorSum = function(n)
- ans = 0
- i = 1
- while i * i <= n
- if n % i == 0 then
- ans += i
- j = floor(n / i)
- if j != i then ans += j
- end if
- i += 1
- end while
- return ans
+ ans = 0
+ i = 1
+ while i * i <= n
+ if n % i == 0 then
+ ans += i
+ j = floor(n / i)
+ if j != i then ans += j
+ end if
+ i += 1
+ end while
+ return ans
end function
cnt = 0
n = 1
while cnt < 25
- sum = divisorSum(n) - n
- if sum > n then
- print n + ": " + sum
- cnt += 1
- end if
- n += 2
+ sum = divisorSum(n) - n
+ if sum > n then
+ print n + ": " + sum
+ cnt += 1
+ end if
+ n += 2
end while
while true
- sum = divisorSum(n) - n
- if sum > n then
- cnt += 1
- if cnt == 1000 then break
- end if
- n += 2
+ sum = divisorSum(n) - n
+ if sum > n then
+ cnt += 1
+ if cnt == 1000 then break
+ end if
+ n += 2
end while
print "The 1000th abundant number is " + n + " with a proper divisor sum of " + sum
n = 1000000001
while true
- sum = divisorSum(n) - n
- if sum > n and n > 1000000000 then break
- n += 2
+ sum = divisorSum(n) - n
+ if sum > n and n > 1000000000 then break
+ n += 2
end while
print "The first abundant number > 1b is " + n + " with a proper divisor sum of " + sum
diff --git a/Task/Abundant-odd-numbers/Phix/abundant-odd-numbers.phix b/Task/Abundant-odd-numbers/Phix/abundant-odd-numbers.phix
index 0523828383..60613a891a 100644
--- a/Task/Abundant-odd-numbers/Phix/abundant-odd-numbers.phix
+++ b/Task/Abundant-odd-numbers/Phix/abundant-odd-numbers.phix
@@ -1,23 +1,22 @@
-(phixonline)-->
- function abundantOdd ( integer n , done , lim , bool printAll )
- while done < lim do
- atom tot = sum ( factors ( n ,- 1 ))
- if tot > n then
- done += 1
- if printAll or done = lim then
- string ln = iff ( printAll ? sprintf ( "%2d. " , done ): "" )
- printf ( 1 , "%s%,6d (proper sum:%,d)\n" ,{ ln , n , tot })
- end if
- end if
- n += 2
- end while
- printf ( 1 , "\n" )
- return n
- end function
- printf ( 1 , "The first 25 abundant odd numbers are:\n" )
- integer n = abundantOdd ( 1 , 0 , 25 , true )
- printf ( 1 , "The one thousandth abundant odd number is:" )
- {} = abundantOdd ( n , 25 , 1000 , false )
- printf ( 1 , "The first abundant odd number above one billion is:" )
- {} = abundantOdd ( 1e9 + 1 , 0 , 1 , false )
- iterator
Walker.zero().tweak(fcn(rn){
n:=rn.value;
while(True){
- sum:=0;
- foreach d in ([3.. n.toFloat().sqrt().toInt(), 2]){
- if( (y:=n/d) *d != n) continue;
- sum += ((y==d) and y or y+d)
- }
- if(sum>n){ rn.set(n+2); return(n) }
- n+=2;
+ sum:=0;
+ foreach d in ([3.. n.toFloat().sqrt().toInt(), 2]){
+ if( (y:=n/d) *d != n) continue;
+ sum += ((y==d) and y or y+d)
+ }
+ if(sum>n){ rn.set(n+2); return(n) }
+ n+=2;
}
}.fp(Ref(startAt.isOdd and startAt or startAt+1)))
}
diff --git a/Task/Accumulator-factory/Ada/accumulator-factory-1.ada b/Task/Accumulator-factory/Ada/accumulator-factory-1.ada
deleted file mode 100644
index 7a2d4fde69..0000000000
--- a/Task/Accumulator-factory/Ada/accumulator-factory-1.ada
+++ /dev/null
@@ -1,11 +0,0 @@
-with Accumulator;
-with Ada.Text_IO; use Ada.Text_IO;
-
-procedure Example is
- package A is new Accumulator;
- package B is new Accumulator;
-begin
- Put_Line (Integer'Image (A.The_Function (5)));
- Put_Line (Integer'Image (B.The_Function (3)));
- Put_Line (Float'Image (A.The_Function (2.3)));
-end;
diff --git a/Task/Accumulator-factory/Ada/accumulator-factory-2.ada b/Task/Accumulator-factory/Ada/accumulator-factory-2.ada
deleted file mode 100644
index 90f6fbbec0..0000000000
--- a/Task/Accumulator-factory/Ada/accumulator-factory-2.ada
+++ /dev/null
@@ -1,11 +0,0 @@
-generic package Accumulator is
-
--- This Ada generic package represents an accumulator factory.
--- The required function is provided as The_Function.
--- The first call to The_Function sets the initial value.
--- (Marius Amado-Alves)
-
- function The_Function (X : Integer) return Integer;
- function The_Function (X : Integer) return Float;
- function The_Function (X : Float) return Float;
-end;
diff --git a/Task/Accumulator-factory/Ada/accumulator-factory-3.ada b/Task/Accumulator-factory/Ada/accumulator-factory-3.ada
deleted file mode 100644
index 4d3ccb7a5f..0000000000
--- a/Task/Accumulator-factory/Ada/accumulator-factory-3.ada
+++ /dev/null
@@ -1,64 +0,0 @@
-package body Accumulator is
-
--- The accumulator lives through three states. It is in Virgin_State
--- before any use of The_Function. It changes to Integer_State or
--- Float_State, according to the input type used. The accumulation is
--- memorized in variable I or F, according to the state. Float_State,
--- once reached, is never left. A Float output on an Integer_State is
--- simply a conversion, sans effect on state. (Marius Amado-Alves)
-
- type State_T is (Virgin_State, Integer_State, Float_State);
- State : State_T := Virgin_State;
- I : Integer;
- F : Float;
-
- function The_Function (X : Float) return Float is
- begin
- case State is
- when Virgin_State =>
- State := Float_State;
- F := X;
- return F;
- when Integer_State =>
- State := Float_State;
- F := Float (I) + X;
- return F;
- when Float_State =>
- F := F + X;
- return F;
- end case;
- end;
-
- function The_Function (X : Integer) return Float is
- begin
- case State is
- when Virgin_State =>
- State := Integer_State;
- I := X;
- return Float (I);
- when Integer_State =>
- I := I + X;
- return Float (I);
- when Float_State =>
- F := F + Float (X);
- return F;
- end case;
- end;
-
- function The_Function (X : Integer) return Integer is
- begin
- case State is
- when Virgin_State =>
- State := Integer_State;
- I := X;
- return I;
- when Integer_State =>
- I := I + X;
- return I;
- when Float_State =>
- F := F + Float (X);
- return Integer (F);
- end case;
- end;
-
-end;
diff --git a/Task/Accumulator-factory/Elena/accumulator-factory.elena b/Task/Accumulator-factory/Elena/accumulator-factory.elena
index ca3b64dd19..16e02b3b7b 100644
--- a/Task/Accumulator-factory/Elena/accumulator-factory.elena
+++ b/Task/Accumulator-factory/Elena/accumulator-factory.elena
@@ -1,16 +1,16 @@
function(acc)
= (n => acc.append(n));
-accumulator(n)
+Accumulator(n)
= function(new Variable(n));
-public program()
+public Program()
{
- var x := accumulator(1);
+ var x := Accumulator(1);
x(5);
- var y := accumulator(3);
+ var y := Accumulator(3);
Console.write(x(2.3r))
}
diff --git a/Task/Accumulator-factory/PowerShell/accumulator-factory-1.psh b/Task/Accumulator-factory/PowerShell/accumulator-factory-1.psh
deleted file mode 100644
index 9d6b0bc910..0000000000
--- a/Task/Accumulator-factory/PowerShell/accumulator-factory-1.psh
+++ /dev/null
@@ -1,4 +0,0 @@
-function Get-Accumulator ([double]$Start)
-{
- {param([double]$Plus) return $script:Start += $Plus}.GetNewClosure()
-}
diff --git a/Task/Accumulator-factory/PowerShell/accumulator-factory-2.psh b/Task/Accumulator-factory/PowerShell/accumulator-factory-2.psh
deleted file mode 100644
index 35ce2c8ca6..0000000000
--- a/Task/Accumulator-factory/PowerShell/accumulator-factory-2.psh
+++ /dev/null
@@ -1,3 +0,0 @@
-$total = Get-Accumulator -Start 1
-& $total -Plus 5.0 | Out-Null
-& $total -Plus 2.3
diff --git a/Task/Accumulator-factory/REBOL/accumulator-factory-1.rebol b/Task/Accumulator-factory/REBOL/accumulator-factory-1.rebol
deleted file mode 100644
index 0738505b60..0000000000
--- a/Task/Accumulator-factory/REBOL/accumulator-factory-1.rebol
+++ /dev/null
@@ -1,11 +0,0 @@
-make-acc-gen: func [start-val] [
- use [state] [
- state: start-val
- func [value] [
- state: state + value
- ]
- ]
-]
-gen: make-acc-gen 1
-print gen 5 ;== 6
-print gen 2.3 ;== 8.3
diff --git a/Task/Accumulator-factory/REBOL/accumulator-factory-2.rebol b/Task/Accumulator-factory/REBOL/accumulator-factory-2.rebol
deleted file mode 100644
index 02468d5450..0000000000
--- a/Task/Accumulator-factory/REBOL/accumulator-factory-2.rebol
+++ /dev/null
@@ -1,25 +0,0 @@
-;; Define a generator function 'gen' with an optional refinement '/init'
-;; - 'value' is a required number passed to the function
-;; - '/init' is an optional refinement for initialization
-gen: function/with [value [number!] /init] [
-
- ;; If '/init' refinement is used, initialize state and exit immediately
- if init [
- state: value ;; Set the initial state to the provided value
- exit ;; Exit, so nothing else in the function is run
- ]
-
- ;; If not initializing, add 'value' to 'state'
- state: state + value
-
- ;; The function returns the new state each call
-][state: 0] ;; 'state' is a local variable, initialized once per definition (persistent closure)
-
-;; Initialize the 'state' value of gen to 1 by calling it with '/init'
-gen/init 1
-
-;; Call gen with 5: Adds 5 to state and prints the result (should print 6)
-print gen 5
-
-;; Call gen with 2.3: Adds 2.3 to state and prints the result (should print 8.3)
-print gen 2.3
diff --git a/Task/Accumulator-factory/VBScript/accumulator-factory-1.vb b/Task/Accumulator-factory/VBScript/accumulator-factory-1.vb
deleted file mode 100644
index 0973ec6443..0000000000
--- a/Task/Accumulator-factory/VBScript/accumulator-factory-1.vb
+++ /dev/null
@@ -1,10 +0,0 @@
-class accumulator
- dim A
- public default function acc(x)
- A = A + x
- acc = A
- end function
- public property get accum
- accum = A
- end property
-end class
diff --git a/Task/Accumulator-factory/VBScript/accumulator-factory-2.vb b/Task/Accumulator-factory/VBScript/accumulator-factory-2.vb
deleted file mode 100644
index c61351aaad..0000000000
--- a/Task/Accumulator-factory/VBScript/accumulator-factory-2.vb
+++ /dev/null
@@ -1,8 +0,0 @@
-dim a
-set a = new accumulator
-x = a( 1 )
-a 5
-dim b
-set b = new accumulator
-b 3
-wscript.echo a(2.3)
diff --git a/Task/Achilles-numbers/Ada/achilles-numbers.ada b/Task/Achilles-numbers/Ada/achilles-numbers.ada
deleted file mode 100644
index 054f448da3..0000000000
--- a/Task/Achilles-numbers/Ada/achilles-numbers.ada
+++ /dev/null
@@ -1,205 +0,0 @@
-pragma Ada_2022;
-
-with Ada.Text_IO;
-with Ada.Numerics; use Ada.Numerics;
-with Ada.Numerics.Long_Elementary_Functions;
-use Ada.Numerics.Long_Elementary_Functions;
-with Ada.Strings; use Ada.Strings;
-with Ada.Strings.Fixed; use Ada.Strings.Fixed;
-with Prime_Numbers;
-
-procedure Achilles_Numbers is
-
- package Long_Integer_Prime_Numbers is new Prime_Numbers
- (Integer, 0, 1, 2);
- use Long_Integer_Prime_Numbers;
-
- -- A powerful number N is such that for every primer factor P of it
- -- P^2 also divides N
- -- Is_Powerful function decomposes the given number N in its prime factors
- -- and then it checks if each factor squared is a divisor of N
- function Is_Powerful (Number : Natural) return Boolean is
- List : constant Number_List := Decompose (Integer (Number));
- begin
- for Index in List'Range loop
- declare
- N : constant Long_Long_Integer := Long_Long_Integer (Number);
- F : constant Long_Long_Integer := Long_Long_Integer (List (Index));
- begin
- if N mod (F * F) /= 0 then
- return False;
- end if;
- end;
- end loop;
-
- return True;
- end Is_Powerful;
-
- -- The Is_Power function checks if a given number N can be written
- -- as a power of two integers that are > 1
- -- It makes use of the mathematical expression N = A^B
- -- taking Log(N) = Log (A^B) equals to B = Log (N) / Log (A)
- -- where the solutions are when B is an integer > 1
- function Is_Power (N : Integer) return Boolean is
-
- function Is_Almost_Equal (A : Long_Float;
- B : Long_Float) return Boolean is
- Epsilon : constant := 0.000_000_000_000_001;
- begin
- if abs (A - B) < Epsilon then
- return True;
- else
- return False;
- end if;
- end Is_Almost_Equal;
-
- A : Integer := 2;
- B : Long_Float;
- Log_Of_N : constant Long_Float := Log (Long_Float (N), 2.0);
- begin
- if N = 1 then
- return True;
- end if;
-
- while True loop
- B := Log_Of_N / Log (Long_Float (A), 2.0);
-
- if Is_Almost_Equal (B, Long_Float (Integer (B)))
- and then Integer (B) > 1
- then
- return True;
- end if;
-
- exit when A * A > N;
- A := @ + 1;
- end loop;
-
- return False;
-
- end Is_Power;
-
- -- An Achilles number is a powerful number that can't be expressed
- -- as a power
- function Is_Achilles (N : Integer) return Boolean is
- begin
- if Is_Powerful (N) then
- if Is_Power (N) = False then
- return True;
- end if;
- end if;
-
- return False;
- end Is_Achilles;
-
- -- Calculates the Euler totient of a number
- function Totient (N : Integer) return Integer is
- Tot : Integer := N;
- I : Integer;
- N2 : Integer := N;
- begin
- I := 2;
- while I * I <= N2 loop
- if N2 mod I = 0 then
- while N2 mod I = 0 loop
- N2 := N2 / I;
- end loop;
- Tot := Tot - Tot / I;
- end if;
-
- if I = 2 then
- I := 1;
- end if;
- I := I + 2;
- end loop;
-
- if N2 > 1 then
- Tot := Tot - Tot / N2;
- end if;
-
- return Tot;
- end Totient;
-
- -- A Strong Achilles number is an Achilles number whose Euler Totient
- -- is also an Achilles number
- function Is_Strong_Achilles (N : Integer) return Boolean is
- begin
- if Is_Achilles (N) then
- if Is_Achilles (Totient (N)) then
- return True;
- end if;
- end if;
-
- return False;
- end Is_Strong_Achilles;
-
- -- Counts the digits in a number by taking the string from
- -- its 'Image attribute, trimming it and counting the characters
- function Count_Digits (N : Integer) return Natural is
- Integer_Str : constant String := Trim (N'Image, Both);
- begin
- return Integer_Str'Length;
- end Count_Digits;
-
-begin
- -- Find the first 50 Achilles numbers
- declare
- N : Integer := 1;
- Count : Integer := 1;
- begin
- Ada.Text_IO.Put_Line ("First 50 Achilles numbers:");
-
- while Count <= 50 loop
-
- if Is_Achilles (N) then
- Count := @ + 1;
- Ada.Text_IO.Put (N'Image & " ");
- end if;
-
- N := @ + 1;
- end loop;
-
- Ada.Text_IO.New_Line;
- end;
-
- -- Find the first 20 Strong Achilles numbers
- declare
- N : Integer := 1;
- Count : Integer := 1;
- begin
- Ada.Text_IO.Put_Line ("First 20 Strong Achilles numbers:");
-
- while Count <= 20 loop
-
- if Is_Strong_Achilles (N) then
- Count := @ + 1;
- Ada.Text_IO.Put (N'Image & " ");
- end if;
-
- N := @ + 1;
- end loop;
-
- Ada.Text_IO.New_Line;
- end;
-
- -- Count numbers with digits
- declare
- Counts : array (2 .. 6) of Natural := [others => 0];
- N : Integer := 1;
- begin
- Ada.Text_IO.Put_Line ("Number of Achilles numbers with:");
-
- while Count_Digits (N) <= Counts'Last loop
-
- -- Ada.Text_IO.Put_Line ("Testing: " & N'Image);
-
- if Is_Achilles (N) then
- Counts (Count_Digits (N)) := @ + 1;
- end if;
- N := @ + 1;
- end loop;
-
- for I in Counts'Range loop
- Ada.Text_IO.Put_Line (I'Image & " digits: " & Counts (I)'Image);
- end loop;
- end;
-end Achilles_Numbers;
diff --git a/Task/Achilles-numbers/EasyLang/achilles-numbers.easy b/Task/Achilles-numbers/EasyLang/achilles-numbers.easy
index fda73a8936..c84b968a4a 100644
--- a/Task/Achilles-numbers/EasyLang/achilles-numbers.easy
+++ b/Task/Achilles-numbers/EasyLang/achilles-numbers.easy
@@ -1,23 +1,24 @@
-func gcd n d .
+fastfunc gcd n d .
if d = 0 : return n
return gcd d (n mod d)
.
-func totient n .
- for m = 1 to n
+fastfunc totient n .
+ m = 1
+ while m <= n
if gcd m n = 1 : tot += 1
+ m += 1
.
return tot
.
-func isPowerful m .
+fastfunc isPowerful m .
n = m
f = 2
l = sqrt m
if m <= 1 : return 0
while 1 = 1
- q = n div f
if n mod f = 0
if m mod (f * f) <> 0 : return 0
- n = q
+ n = n div f
if f > n : return 1
else
f += 1
@@ -28,7 +29,7 @@ func isPowerful m .
.
.
.
-func isAchilles n .
+fastfunc isAchilles n .
if isPowerful n = 0 : return 0
m = 2
a = m * m
@@ -46,29 +47,27 @@ func isAchilles n .
.
print "First 50 Achilles numbers:"
n = 1
-repeat
+while cnt < 50
if isAchilles n = 1
write n & " "
- num += 1
+ cnt += 1
+ if cnt mod 10 = 0 : print ""
.
n += 1
- until num >= 50
.
print ""
-print ""
print "First 20 strong Achilles numbers:"
-num = 0
+cnt = 0
n = 1
-repeat
+while cnt < 20
if isAchilles n = 1 and isAchilles totient n = 1
write n & " "
- num += 1
+ cnt += 1
+ if cnt mod 10 = 0 : print ""
.
n += 1
- until num >= 20
.
print ""
-print ""
print "Number of Achilles numbers with 2 to 5 digits:"
a = 10
b = 100
diff --git a/Task/Achilles-numbers/Phix/achilles-numbers.phix b/Task/Achilles-numbers/Phix/achilles-numbers.phix
index 933e7e375a..3ebdef5c6e 100644
--- a/Task/Achilles-numbers/Phix/achilles-numbers.phix
+++ b/Task/Achilles-numbers/Phix/achilles-numbers.phix
@@ -1,62 +1,67 @@
-(phixonline)-->
- with javascript_semantics
- requires ( "1.0.2" ) -- [join_by(fmt)]
- atom t0 = time ()
- constant maxDigits = iff ( platform ()= JS ? 10 : 12 )
- integer pps = new_dict ()
+with javascript_semantics
+requires("1.0.2") -- [join_by(fmt)]
+atom t0 = time()
+constant maxDigits = iff(platform()=JS?10:12)
+integer pps = new_dict()
- procedure getPerfectPowers ( integer maxExp )
- atom hi = power ( 10 , maxExp )
- integer imax = floor ( sqrt ( hi ))
- for i = 2 to imax do
- atom p = i
- while true do
- p *= i
- if p >= hi then exit end if
- setd ( p , true , pps )
- end while
- end for
- end procedure
+procedure getPerfectPowers(integer maxExp)
+ atom hi = power(10, maxExp), t1 = time()+1
+ integer imax = floor(sqrt(hi))
+ for i=2 to imax do
+ atom p = i
+ while true do
+ p *= i
+ if p>=hi then exit end if
+ setd(p,true,pps)
+ end while
+ if time()>t1 then
+ progress("getting perfect powers, %d/%d\r",{i,imax})
+ t1 = time()+1
+ end if
+ end for
+ progress("")
+end procedure
- function get_achilles ( integer minExp , maxExp )
- atom lo10 = power ( 10 , minExp ),
- hi10 = power ( 10 , maxExp )
- integer bmax = floor ( power ( hi10 , 1 / 3 )),
- amax = floor ( sqrt ( hi10 ))
- sequence achilles = {}
- for b = 2 to bmax do
- atom b3 = b * b * b
- for a = 2 to amax do
- atom p = b3 * a * a
- if p >= hi10 then exit end if
- if p >= lo10 then
- integer node = getd_index ( p , pps )
- if node = NULL then
- achilles &= p
- end if
- end if
- end for
- end for
- achilles = unique ( achilles )
- return achilles
- end function
+function get_achilles(integer minExp, maxExp)
+ atom lo10 = power(10,minExp),
+ hi10 = power(10,maxExp)
+ integer bmax = floor(power(hi10,1/3)),
+ amax = floor(sqrt(hi10))
+ sequence achilles = {}
+ for b=2 to bmax do
+ atom b3 = b * b * b
+ for a=2 to amax do
+ atom p = b3 * a * a
+ if p>=hi10 then exit end if
+ if p>=lo10 then
+ integer node = getd_index(p,pps)
+ if node=NULL then
+ achilles &= p
+ end if
+ end if
+ end for
+ end for
+ achilles = unique(achilles)
+ return achilles
+end function
- getPerfectPowers ( maxDigits )
- sequence achilles = get_achilles ( 1 , 5 )
+getPerfectPowers(maxDigits)
- function strong_achilles ( integer n )
- integer totient = sum ( sq_eq ( apply ( true , gcd ,{ tagset ( n ), n }), 1 ))
- return find ( totient , achilles )
- end function
+sequence achilles = get_achilles(1,5),
+ a = join_by(achilles[1..50],1,10," ",fmt:="%4d")
+printf(1,"First 50 Achilles numbers:\n%s\n",{a})
- sequence a = join_by ( achilles [ 1 .. 50 ], 1 , 10 , " " , fmt := "%4d" ),
- sa = filter ( achilles , strong_achilles )[ 1 .. 30 ],
- ssa = join_by ( sa , 1 , 10 , " " , fmt := "%5d" )
+function strong_achilles(integer n)
+ integer totient = sum(sq_eq(apply(true,gcd,{tagset(n),n}),1))
+ return find(totient,achilles)
+end function
- printf ( 1 , "First 50 Achilles numbers:\n%s\n" ,{ a })
- printf ( 1 , "First 30 strong Achilles numbers:\n%s\n" ,{ ssa })
- for d = 2 to maxDigits do
- printf ( 1 , "Achilles numbers with %d digits:%d\n" ,{ d , length ( get_achilles ( d - 1 , d ))})
- end for
- ? elapsed ( time ()- t0 )
-
- class wobbly dynamic
- -- (pre-define a few fields/methods if you like)
- end class
- wobbly wobble = new()
- ?wobble.jelly -- 0
- --?wobble["jelly"] -- for dynamic names use []
- wobble.jelly = "green"
- ?wobble.jelly -- "green"
-
- with javascript_semantics
- function additive ( string p ) return is_prime ( sum ( sq_sub ( p , '0' ))) end function
- sequence res = filter ( apply ( get_primes_le ( 500 ), sprint ), additive )
- printf ( 1 , "%d additive primes found: %s\n" ,{ length ( res ), join ( shorten ( res , "" , 6 ))})
-
- --
- -- demo\rosetta\Pattern_matching.exw
- -- =================================
- --
- -- 1). Lightly modified copy of demo\rosetta\VisualiseTree.exw
+-- demo\rosetta\Pattern_matching.exw
+-- Lightly modified copy of demo\rosetta\VisualiseTree.exw
+with javascript_semantics
- with javascript_semantics
+-- To the theme tune of the Milk Tray Ad iyrt,
+-- All because the Windows console hates utf8:
+constant TL = '\#DA', -- aka '┌'
+ VT = '\#B3', -- aka '│'
+ BL = '\#C0', -- aka '└'
+ HZ = '\#C4', -- aka '─'
+ HS = "\#C4" -- (string version of HZ)
- -- To the theme tune of the Milk Tray Ad iyrt,
- -- All because the Windows console hates utf8:
- constant TL = '\#DA ', -- aka '┌'
- VT = '\#B3 ', -- aka '│'
- BL = '\#C0 ', -- aka '└'
- HZ = '\#C4 ', -- aka '─'
- HS = "\#C4" -- (string version of HZ)
+function w1252_to_utf8(string s)
+ if platform()!=WINDOWS then
+ s = substitute_all(s,{ TL, VT, BL, HZ},
+ {"┌","│","└","─"})
+ end if
+ return s
+end function
+--
- function w1252_to_utf8 ( string s )
- if platform ()!= WINDOWS then
- s = substitute_all ( s ,{ TL , VT , BL , HZ },
- { "┌" , "│" , "└" , "─" })
- end if
- return s
- end function
- --</hates utf8>
+procedure visualise_tree(object tree, string root=HS)
+ if atom(tree) then
+ puts(1,"\n")
+ else
+ object {colour,left,v,right} = tree
+ integer g = root[$]
+ if sequence(left) then
+ root[$] = iff(g=TL or g=HZ?' ':VT)
+ visualise_tree(left,root&TL)
+ end if
+ root[$] = g
+ printf(1,"%s%s%v\n",{w1252_to_utf8(root),colour,v})
+ if sequence(right) then
+ root[$] = iff(g=TL?VT:' ')
+ visualise_tree(right,root&BL)
+ end if
+ end if
+end procedure
+--
- procedure visualise_tree ( object tree , string root = HS )
- if atom ( tree ) then
- puts ( 1 , "<empty>\n" )
- else
- object { colour , left , v , right } = tree
- integer g = root [$]
- if sequence ( left ) then
- root [$] = iff ( g = TL or g = HZ ? ' ' : VT )
- visualise_tree ( left , root & TL )
- end if
- root [$] = g
- printf ( 1 , "%s%s%v\n" ,{ w1252_to_utf8 ( root ), colour , v })
- if sequence ( right ) then
- root [$] = iff ( g = TL ? VT : ' ' )
- visualise_tree ( right , root & BL )
- end if
- end if
- end procedure
- --</copy VisualiseTree>
+-- 2). Imagine the following is in a file, say algebraic_data_types.e - not quite generic enough
+-- for inclusion in builtins, but not exactly difficult to copy/maintain per-project either.
- -- 2). Imagine the following is in a file, say algebraic_data_types.e - not quite generic enough
- -- for inclusion in builtins, but not exactly difficult to copy/maintain per-project either.
+function match_one(sequence key, object t)
+ sequence res = {}
+ if sequence(t)
+ and length(key)==length(t) then
+ for i=1 to length(key) do
+ object ki = key[i], ti = t[i]
+ if sequence(ki) and not string(ki) then
+ sequence r2 = match_one(ki,ti)
+ if r2={} then res = {} exit end if
+ res &= r2
+ else
+ if ki=0 then
+ res = append(res,ti)
+ else
+ if ki!=ti then res = {} exit end if
+ end if
+ end if
+ end for
+ end if
+ return res
+end function
- function match_one ( sequence key , object t )
- sequence res = {}
- if sequence ( t )
- and length ( key )== length ( t ) then
- for i = 1 to length ( key ) do
- object ki = key [ i ], ti = t [ i ]
- if sequence ( ki ) and not string ( ki ) then
- sequence r2 = match_one ( ki , ti )
- if r2 ={} then res = {} exit end if
- res &= r2
- else
- if ki = 0 then
- res = append ( res , ti )
- else
- if ki != ti then res = {} exit end if
- end if
- end if
- end for
- end if
- return res
- end function
+/*global*/ function match_algebraic(sequence set, t)
+ sequence s
+ for i=1 to length(set) do
+ s = match_one(set[i],t)
+ if length(s) then exit end if
+ end for
+ return s
+end function
+--
- /*global*/ function match_algebraic ( sequence set , t )
- sequence s
- for i = 1 to length ( set ) do
- s = match_one ( set [ i ], t )
- if length ( s ) then exit end if
- end for
- return s
- end function
- --</algebraic_data_types.e>
+-- 3). The actual task
- -- 3). The actual task
+constant B = "B", R = "R"
- constant B = "B" , R = "R"
+function balance(sequence t)
+ sequence s = match_algebraic({{B,{R,{R,0,0,0},0,0},0,0},
+ {B,{R,0,0,{R,0,0,0}},0,0},
+ {B,0,0,{R,{R,0,0,0},0,0}},
+ {B,0,0,{R,0,0,{R,0,0,0}}}},t)
+ if length(s) then
+ object {a,x,b,y,c,z,d} = s
+ t = {R,{B,a,x,b},y,{B,c,z,d}}
+ end if
+ return t
+end function
- function balance ( sequence t )
- sequence s = match_algebraic ({{ B ,{ R ,{ R , 0 , 0 , 0 }, 0 , 0 }, 0 , 0 },
- { B ,{ R , 0 , 0 ,{ R , 0 , 0 , 0 }}, 0 , 0 },
- { B , 0 , 0 ,{ R ,{ R , 0 , 0 , 0 }, 0 , 0 }},
- { B , 0 , 0 ,{ R , 0 , 0 ,{ R , 0 , 0 , 0 }}}}, t )
- if length ( s ) then
- object { a , x , b , y , c , z , d } = s
- t = { R ,{ B , a , x , b }, y ,{ B , c , z , d }}
- end if
- return t
- end function
+function ins(object tree, object leaf)
+ if tree=NULL then
+ tree = {R,NULL,leaf,NULL}
+ else
+ object {c,l,k,r} = tree
+ if leaf!=k then
+ if leaffunction ins ( object tree , object leaf )
- if tree = NULL then
- tree = { R , NULL , leaf , NULL }
- else
- object { c , l , k , r } = tree
- if leaf != k then
- if leaf < k then l = ins ( l , leaf )
- else r = ins ( r , leaf )
- end if
- tree = balance ({ c , l , k , r })
- end if
- end if
- return tree
- end function
+function tree_insert(object tree, object leaf)
+ tree = ins(tree,leaf)
+ tree[1] = B
+ return tree
+end function
- function tree_insert ( object tree , object leaf )
- tree = ins ( tree , leaf )
- tree [ 1 ] = B
- return tree
- end function
+sequence stuff = shuffle(tagset(10))
+object tree = NULL
+for i=1 to length(stuff) do
+ tree = tree_insert(tree,stuff[i])
+end for
+visualise_tree(tree)
- sequence stuff = shuffle ( tagset ( 10 ))
- object tree = NULL
- for i = 1 to length ( stuff ) do
- tree = tree_insert ( tree , stuff [ i ])
- end for
- visualise_tree ( tree )
-
- ? "done"
- {} = wait_key ()
-
- sequence res = columnize ({ tagset ( 5 )}) -- ie {{1},{2},{3},{4},{5}}
- integer n = 2 , found = 0
- while found < 50 do
- integer l = length ( prime_factors ( n , true ))
- if l <= 5 and length ( res [ l ])<= 10 then
- res [ l ] &= n
- found += 1
- end if
- n += 1
- end while
- string fmt = "k = %d: " & join ( repeat ( "%4d" , 10 ))& "\n"
- for i = 1 to 5 do
- printf ( 1 , fmt , res [ i ])
- end for
-
- function amb1 ( sequence sets , object res = 0 , integer idx = 1 )
- integer ch = 0 ,
- pass = 0
- if idx > length ( sets ) then
- pass = 1
- else
- if res = 0 then
- res = repeat ( 0 , length ( sets ))
- else
- res = deep_copy ( res )
- ch = sets [ idx - 1 ][ res [ idx - 1 ]][$]
- end if
- for k = 1 to length ( sets [ idx ]) do
- if ch = 0 or sets [ idx ][ k ][ 1 ]= ch then
- res [ idx ] = k
- { pass , res } = amb1 ( sets , res , idx + 1 )
- if pass then exit end if
- end if
- end for
- end if
- return { pass , res }
- end function
+with javascript_semantics
- sequence sets = {{ "the" , "that" , "a" },
- { "frog" , "elephant" , "thing" },
- { "walked" , "treaded" , "grows" },
- { "slowly" , "quickly" }}
- { integer pass , sequence res } = amb1 ( sets )
- if pass then
- puts ( 1 , "success: " )
- for i = 1 to length ( sets ) do
- res [ i ] = sets [ i ][ res [ i ]]
- end for
- ? res
- else
- puts ( 1 , "failure\n" )
- end if
-
- function amb ( sequence sets , integer testrid , integer resrid =- 1 , object res = 0 , integer idx = 1 )
- integer flag = ( res == 0 ),
- pass = 0
- if idx > length ( sets ) then
- pass = 1
- if resrid !=- 1 then
- resrid ( sets , res )
- end if
- else
- if flag then
- res = repeat ( 0 , length ( sets ))
- end if
- for k = 1 to length ( sets [ idx ]) do
- res [ idx ] = k
- if flag or testrid ( sets , deep_copy ( res ), idx ) then
- { pass , res } = amb ( sets , testrid , resrid , deep_copy ( res ), idx + 1 )
- if pass and resrid =- 1 then exit end if
- end if
- end for
- end if
- return { pass , res }
- end function
+with javascript_semantics
+function amb(sequence sets, integer testrid, resrid=-1, idx=1, object res=0)
+ bool flag = (res==0),
+ pass = false
+ if idx>length(sets) then
+ pass = true
+ if resrid!=-1 then
+ resrid(sets,res)
+ end if
+ else
+ if flag then
+ res = repeat(0,length(sets))
+ end if
+ for k=1 to length(sets[idx]) do
+ res[idx] = k
+ if flag or testrid(sets,deep_copy(res),idx) then
+ {pass,res} = amb(sets,testrid,resrid,idx+1,deep_copy(res))
+ if pass and resrid=-1 then exit end if
+ end if
+ end for
+ end if
+ return {pass,res}
+end function
- function pairable ( sequence sets , sequence res , integer idx )
- return sets [ idx - 1 ][ res [ idx - 1 ]][$] = sets [ idx ][ res [ idx ]][ 1 ]
- end function
+function pairable(sequence sets, res, integer idx)
+ return sets[idx-1][res[idx-1]][$] = sets[idx][res[idx]][1]
+end function
- procedure AMB_Show ( sequence sets , sequence res )
- res = deep_copy ( res )
- for i = 1 to length ( sets ) do
- res [ i ] = sets [ i ][ res [ i ]]
- end for
- printf ( 1 , "success: %v\n" ,{ res })
- end procedure
+procedure AMB_Show(sequence sets, res)
+ res = deep_copy(res)
+ for i=1 to length(sets) do
+ res[i] = sets[i][res[i]]
+ end for
+ printf(1,"success: %v\n",{res})
+end procedure
- function pythagorean ( sequence /*sets*/ , sequence res , integer idx )
- -- (note that res[idx]==sets[idx][res[idx]] in all cases)
- integer { x , y , z } = res
- return idx < 3 or ( x * x + y * y = z * z )
- end function
+function pythagorean(sequence /*sets*/, sequence res, integer idx)
+-- (note that res[idx]==sets[idx][res[idx]] in all cases)
+ integer {x,y,z} = res
+ return idx<3 or (x*x+y*y=z*z)
+end function
- procedure pythag_show ( sequence /*sets*/ , sequence res )
- printf ( 1 , "success: %v\n" ,{ res })
- end procedure
+procedure pythag_show(sequence /*sets*/, sequence res)
+ printf(1,"success: %v\n",{res})
+end procedure
- -- see http://www.randomhacks.net/articles/2005/10/11/amb-operator
- function not8 ( sequence sets , sequence res , integer idx )
- -- (note that idx==2 in all cases)
- -- (at the last moment, I flipped the test, after realising that
- -- someone had completely misunderstood the original article...
- -- return sets[1][res[1]]*sets[idx][res[idx]]!=8
- return sets [ 1 ][ res [ 1 ]]* sets [ idx ][ res [ idx ]]= 8
- end function
+-- see http://www.randomhacks.net/articles/2005/10/11/amb-operator
+function not8(sequence sets, sequence res, integer idx)
+-- (note that idx==2 in all cases)
+-- (at the last moment, I flipped the test, after realising that
+-- someone had completely misunderstood the original article...
+-- return sets[1][res[1]]*sets[idx][res[idx]]!=8
+ return sets[1][res[1]]*sets[idx][res[idx]]=8
+end function
- procedure not8_show ( sequence sets , sequence res )
- puts ( 1 , "success: " )
- ?{ sets [ 1 ][ res [ 1 ]], sets [ 2 ][ res [ 2 ]]}
- end procedure
+procedure not8_show(sequence sets, sequence res)
+ puts(1,"success: ")
+ ?{sets[1][res[1]],sets[2][res[2]]}
+end procedure
- sequence sets = {{ "the" , "that" , "a" },
- { "frog" , "elephant" , "thing" },
- { "walked" , "treaded" , "grows" },
- { "slowly" , "quickly" }}
- sequence sets2 = repeat ( tagset ( 11 ), 3 )
- sequence sets3 = {{ 1 , 2 , 3 }, { 4 , 5 , 6 }}
- puts ( 1 , "\nThe original:\n" )
- {} = amb ( sets , pairable , AMB_Show )
- puts ( 1 , "\nSmall Pythagorean triples problem:\n" )
- {} = amb ( sets2 , pythagorean , pythag_show )
- puts ( 1 , "\nSome strange not 8 problem:\n" ) -- (now fixed)
- {} = amb ( sets3 , not8 , not8_show )
-
- with javascript_semantics
- for m = 1 to 20000 do
- integer n = sum ( factors ( m ,- 1 ))
- if m < n and m = sum ( factors ( n ,- 1 )) then ?{ m , n } end if
- end for
-( (len,words), ...)
if(ws.len()>1){ // two or more anagrams
r:=List(); n:=ws[0].len(); // length of these anagrams
foreach idx,w in (ws.enumerate()){
- foreach w2 in (ws[idx+1,*]){
- if(Utils.zipWith('!=,w,w2).filter().len()==n)
- r.write(T(w,w2));
- }
+ foreach w2 in (ws[idx+1,*]){
+ if(Utils.zipWith('!=,w,w2).filter().len()==n)
+ r.write(T(w,w2));
+ }
}
if(r) return(r.insert(0,n));
}
diff --git a/Task/Anagrams-Deranged-anagrams/Zkl/anagrams-deranged-anagrams-2.zkl b/Task/Anagrams-Deranged-anagrams/Zkl/anagrams-deranged-anagrams-2.zkl
index ce697554b4..bca11af0eb 100644
--- a/Task/Anagrams-Deranged-anagrams/Zkl/anagrams-deranged-anagrams-2.zkl
+++ b/Task/Anagrams-Deranged-anagrams/Zkl/anagrams-deranged-anagrams-2.zkl
@@ -3,7 +3,7 @@ nws:=words.values.pump(List,fcn(ws){ //-->( (len,words), ...)
n:=ws[0].len(); // length of these anagrams
r:=Utils.Helpers.permute(ws).filter('wrap(ws2){
n == Utils.zipWith('!=,ws2.xplode()).filter().len();
- });
+ });
if(r) return(n,r[0]); // L(L("glove","vogel"))-->L(5,L("glove","vogel"))
}
Void.Skip
diff --git a/Task/Anagrams/00-TASK.txt b/Task/Anagrams/00-TASK.txt
index 1668245967..c66b1c36f9 100644
--- a/Task/Anagrams/00-TASK.txt
+++ b/Task/Anagrams/00-TASK.txt
@@ -1,7 +1,7 @@
When two or more words are composed of the same characters, but in a different order, they are called [[wp:Anagram|anagrams]].
;Task
-Using the word list at http://wiki.puzzlers.org/pub/wordlists/unixdict.txt,
+Using the word list at http://wiki.puzzlers.org/pub/wordlists/unixdict.txt or [https://raw.githubusercontent.com/thundergnat/rc-run/refs/heads/master/rc/resources/unixdict.txt here],
constant units = { "degrees" , "gradians" , "mils" , "radians" },
- turns = { 1 / 360 , 1 / 400 , 1 / 6400 , 0.5 / PI }
+with javascript_semantics
+constant units = {"degrees","gradians","mils","radians"},
+ turns = {1/360,1/400,1/6400,0.5/PI}
- function convert ( atom a , integer fdx , tdx )
- return remainder ( a * turns [ fdx ], 1 )/ turns [ tdx ]
- end function
+function convert(atom a, unit, tgt)
+ return remainder(a*unit,1)/tgt
+end function
- constant tests = {- 2 ,- 1 , 0 , 1 , 2 , 2 * PI , 16 , 57.2957795 , 359 , 399 , 6399 , 1000000 }
- printf ( 1 , " angle unit %9s %9s %9s %9s\n" , units )
- for i = 1 to length ( tests ) do
- for fdx = 1 to length ( units ) do
- printf ( 1 , "%9g %-8s" ,{ tests [ i ], units [ fdx ]})
- for tdx = 1 to length ( units ) do
- printf ( 1 , " %9g" , convert ( tests [ i ], fdx , tdx ))
- end for
- puts ( 1 , "\n" )
- end for
- puts ( 1 , "\n" )
- end for
- count of proper divisors. 1-->1, wrong but OK here
{ [1.. (n + 1)/2 + 1].reduce('wrap(p,i){ p + (n%i==0 and n!=i) }) }
-fcn antiPrimes{ // -->iterator
+fcn antiPrimes{ // -->iterator
Walker.chain([2..59],[60..*,30]).tweak(fcn(c,rlast){
last,mx := rlast.value, properDivsN(c);
if(mx<=last) return(Void.Skip);
rlast.set(mx);
c
- }.fp1(Ref(0))).push(1); // 1 has no proper divisors
+ }.fp1(Ref(0))).push(1); // 1 has no proper divisors
}
diff --git a/Task/Append-a-record-to-the-end-of-a-text-file/Ada/append-a-record-to-the-end-of-a-text-file.ada b/Task/Append-a-record-to-the-end-of-a-text-file/Ada/append-a-record-to-the-end-of-a-text-file.ada
deleted file mode 100644
index 66f9801439..0000000000
--- a/Task/Append-a-record-to-the-end-of-a-text-file/Ada/append-a-record-to-the-end-of-a-text-file.ada
+++ /dev/null
@@ -1,120 +0,0 @@
-with Ada.Text_IO; use Ada.Text_IO;
-with Ada.Integer_Text_IO; use Ada.Integer_Text_IO;
-with Ada.Strings.Bounded;
-
-procedure Main is
- package data_string is new Ada.Strings.Bounded.Generic_Bounded_Length(80);
- use data_string;
-
- type GCOSE_Rec is record
- Full_Name : Bounded_String;
- Office : Bounded_String;
- Extension : Bounded_String;
- Homephone : Bounded_String;
- Email : Bounded_String;
- end record;
-
- type Password_Rec is record
- Account : Bounded_String;
- Password : Bounded_String;
- Uid : Natural;
- Gid : Natural;
- GCOSE : GCOSE_Rec;
- Directory : Bounded_String;
- Shell : Bounded_String;
- end record;
-
- function To_String(Item : GCOSE_Rec) return String is
- begin
- return To_String(Item.Full_Name) & "," &
- To_String(Item.Office) & "," &
- To_String(Item.Extension) & "," &
- To_String(Item.Homephone) & "," &
- To_String(Item.Email);
- end To_String;
-
- function To_String(Item : Password_Rec) return String is
- uid_str : string(1..4);
- gid_str : string(1..4);
- Temp : String(1..5);
- begin
- Temp := Item.Uid'Image;
- uid_str := Temp(2..5);
- Temp := Item.Gid'Image;
- gid_str := Temp(2..5);
- return To_String(Item.Account) & ":" &
- To_String(Item.Password) & ":" &
- uid_str & ":" & gid_str & ":" &
- To_String(Item.GCOSE) & ":" &
- To_String(Item.Directory) & ":" &
- To_String(Item.Shell);
- end To_String;
-
- Pwd_List : array (1..3) of Password_Rec;
-
- Filename : String := "password.txt";
- The_File : File_Type;
- Line : String(1..256);
- Length : Natural;
-begin
- Pwd_List(1) := (Account => To_Bounded_String("jsmith"),
- Password => To_Bounded_String("x"),
- Uid => 1001, GID => 1000,
- GCOSE => (Full_Name => To_Bounded_String("Joe Smith"),
- Office => To_Bounded_String("Room 1007"),
- Extension => To_Bounded_String("(234)555-8917"),
- Homephone => To_Bounded_String("(234)555-0077"),
- email => To_Bounded_String("jsmith@rosettacode.org")),
- directory => To_Bounded_String("/home/jsmith"),
- shell => To_Bounded_String("/bin/bash"));
- Pwd_List(2) := (Account => To_Bounded_String("jdoe"),
- Password => To_Bounded_String("x"),
- Uid => 1002, GID => 1000,
- GCOSE => (Full_Name => To_Bounded_String("Jane Doe"),
- Office => To_Bounded_String("Room 1004"),
- Extension => To_Bounded_String("(234)555-8914"),
- Homephone => To_Bounded_String("(234)555-0044"),
- email => To_Bounded_String("jdoe@rosettacode.org")),
- directory => To_Bounded_String("/home/jdoe"),
- shell => To_Bounded_String("/bin/bash"));
- Pwd_List(3) := (Account => To_Bounded_String("xyz"),
- Password => To_Bounded_String("x"),
- Uid => 1003, GID => 1000,
- GCOSE => (Full_Name => To_Bounded_String("X Yz"),
- Office => To_Bounded_String("Room 1003"),
- Extension => To_Bounded_String("(234)555-8913"),
- Homephone => To_Bounded_String("(234)555-0033"),
- email => To_Bounded_String("xyz@rosettacode.org")),
- directory => To_Bounded_String("/home/xyz"),
- shell => To_Bounded_String("/bin/bash"));
- Create(File => The_File,
- Mode => Out_File,
- Name => Filename);
-
- for I in 1..2 loop
- Put_Line(File => The_File,
- Item => To_String(Pwd_List(I)));
- end loop;
- Reset(File => The_File,
- Mode => In_File);
- while not End_Of_File(The_File) loop
- Get_Line(File => The_File,
- Item => Line,
- Last => Length);
- Put_Line(Line(1..Length));
- end loop;
- New_Line;
- Reset(File => The_File,
- Mode => Append_File);
- Put_Line(File => The_File,
- Item => To_String(Pwd_List(3)));
- Reset(File => The_File,
- Mode => In_File);
- while not End_Of_File(The_File) loop
- Get_Line(File => The_File,
- Item => Line,
- Last => Length);
- Put_Line(Line(1..Length));
- end loop;
- Close(The_File);
-end Main;
diff --git a/Task/Append-a-record-to-the-end-of-a-text-file/COBOL/append-a-record-to-the-end-of-a-text-file.cobol b/Task/Append-a-record-to-the-end-of-a-text-file/COBOL/append-a-record-to-the-end-of-a-text-file.cobol
deleted file mode 100644
index 50332e8791..0000000000
--- a/Task/Append-a-record-to-the-end-of-a-text-file/COBOL/append-a-record-to-the-end-of-a-text-file.cobol
+++ /dev/null
@@ -1,272 +0,0 @@
- *> Tectonics:
- *> cobc -xj append.cob
- *> cobc -xjd -DDEBUG append.cob
- *> ***************************************************************
- identification division.
- program-id. append.
-
- environment division.
- configuration section.
- repository.
- function all intrinsic.
-
- input-output section.
- file-control.
- select pass-file
- assign to pass-filename
- organization is line sequential
- status is pass-status.
-
- REPLACE ==:LRECL:== BY ==2048==.
-
- data division.
- file section.
- fd pass-file record varying depending on pass-length.
- 01 fd-pass-record.
- 05 filler pic x occurs 0 to :LRECL: times
- depending on pass-length.
-
- working-storage section.
- 01 pass-filename.
- 05 filler value "passfile".
- 01 pass-status pic xx.
- 88 ok-status values '00' thru '09'.
- 88 eof-pass value '10'.
-
- 01 pass-length usage index.
- 01 total-length usage index.
-
- 77 file-action pic x(11).
-
- 01 pass-record.
- 05 account pic x(64).
- 88 key-account value "xyz".
- 05 password pic x(64).
- 05 uid pic z(4)9.
- 05 gid pic z(4)9.
- 05 details.
- 10 fullname pic x(128).
- 10 office pic x(128).
- 10 extension pic x(32).
- 10 homephone pic x(32).
- 10 email pic x(256).
- 05 homedir pic x(256).
- 05 shell pic x(256).
-
- 77 colon pic x value ":".
- 77 comma-mark pic x value ",".
- 77 newline pic x value x"0a".
-
- *> ***************************************************************
- procedure division.
- main-routine.
- perform initial-fill
-
- >>IF DEBUG IS DEFINED
- display "Initial data:"
- perform show-records
- >>END-IF
-
- perform append-record
-
- >>IF DEBUG IS DEFINED
- display newline "After append:"
- perform show-records
- >>END-IF
-
- perform verify-append
- goback
- .
-
- *> ***************************************************************
- initial-fill.
- perform open-output-pass-file
-
- move "jsmith" to account
- move "x" to password
- move 1001 to uid
- move 1000 to gid
- move "Joe Smith" to fullname
- move "Room 1007" to office
- move "(234)555-8917" to extension
- move "(234)555-0077" to homephone
- move "jsmith@rosettacode.org" to email
- move "/home/jsmith" to homedir
- move "/bin/bash" to shell
- perform write-pass-record
-
- move "jdoe" to account
- move "x" to password
- move 1002 to uid
- move 1000 to gid
- move "Jane Doe" to fullname
- move "Room 1004" to office
- move "(234)555-8914" to extension
- move "(234)555-0044" to homephone
- move "jdoe@rosettacode.org" to email
- move "/home/jdoe" to homedir
- move "/bin/bash" to shell
- perform write-pass-record
-
- perform close-pass-file
- .
-
- *> **********************
- check-pass-file.
- if not ok-status then
- perform file-error
- end-if
- .
-
- *> **********************
- check-pass-with-eof.
- if not ok-status and not eof-pass then
- perform file-error
- end-if
- .
-
- *> **********************
- file-error.
- display "error " file-action space pass-filename
- space pass-status upon syserr
- move 1 to return-code
- goback
- .
-
- *> **********************
- append-record.
- move "xyz" to account
- move "x" to password
- move 1003 to uid
- move 1000 to gid
- move "X Yz" to fullname
- move "Room 1003" to office
- move "(234)555-8913" to extension
- move "(234)555-0033" to homephone
- move "xyz@rosettacode.org" to email
- move "/home/xyz" to homedir
- move "/bin/bash" to shell
-
- perform open-extend-pass-file
- perform write-pass-record
- perform close-pass-file
- .
-
- *> **********************
- open-output-pass-file.
- open output pass-file with lock
- move "open output" to file-action
- perform check-pass-file
- .
-
- *> **********************
- open-extend-pass-file.
- open extend pass-file with lock
- move "open extend" to file-action
- perform check-pass-file
- .
-
- *> **********************
- open-input-pass-file.
- open input pass-file
- move "open input" to file-action
- perform check-pass-file
- .
-
- *> **********************
- close-pass-file.
- close pass-file
- move "closing" to file-action
- perform check-pass-file
- .
-
- *> **********************
- write-pass-record.
- set total-length to 1
- set pass-length to :LRECL:
- string
- account delimited by space
- colon
- password delimited by space
- colon
- trim(uid leading) delimited by size
- colon
- trim(gid leading) delimited by size
- colon
- trim(fullname trailing) delimited by size
- comma-mark
- trim(office trailing) delimited by size
- comma-mark
- trim(extension trailing) delimited by size
- comma-mark
- trim(homephone trailing) delimited by size
- comma-mark
- email delimited by space
- colon
- trim(homedir trailing) delimited by size
- colon
- trim(shell trailing) delimited by size
- into fd-pass-record with pointer total-length
- on overflow
- display "error: fd-pass-record truncated at "
- total-length upon syserr
- end-string
- set pass-length to total-length
- set pass-length down by 1
-
- write fd-pass-record
- move "writing" to file-action
- perform check-pass-file
- .
-
- *> **********************
- read-pass-file.
- read pass-file
- move "reading" to file-action
- perform check-pass-with-eof
- .
-
- *> **********************
- show-records.
- perform open-input-pass-file
-
- perform read-pass-file
- perform until eof-pass
- perform show-pass-record
- perform read-pass-file
- end-perform
-
- perform close-pass-file
- .
-
- *> **********************
- show-pass-record.
- display fd-pass-record
- .
-
- *> **********************
- verify-append.
- perform open-input-pass-file
-
- move 0 to tally
- perform read-pass-file
- perform until eof-pass
- add 1 to tally
- unstring fd-pass-record delimited by colon
- into account
- if key-account then exit perform end-if
- perform read-pass-file
- end-perform
- if (key-account and tally not > 2) or (not key-account) then
- display
- "error: appended record not found in correct position"
- upon syserr
- else
- display "Appended record: " with no advancing
- perform show-pass-record
- end-if
-
- perform close-pass-file
- .
-
- end program append.
diff --git a/Task/Append-a-record-to-the-end-of-a-text-file/PowerShell/append-a-record-to-the-end-of-a-text-file-1.psh b/Task/Append-a-record-to-the-end-of-a-text-file/PowerShell/append-a-record-to-the-end-of-a-text-file-1.psh
deleted file mode 100644
index a512fd4292..0000000000
--- a/Task/Append-a-record-to-the-end-of-a-text-file/PowerShell/append-a-record-to-the-end-of-a-text-file-1.psh
+++ /dev/null
@@ -1,163 +0,0 @@
-function Test-FileLock
-{
- Param
- (
- [parameter(Mandatory=$true)]
- [string]
- $Path
- )
-
- $outFile = New-Object System.IO.FileInfo $Path
-
- if (-not(Test-Path -Path $Path))
- {
- return $false
- }
-
- try
- {
- $outStream = $outFile.Open([System.IO.FileMode]::Open, [System.IO.FileAccess]::ReadWrite, [System.IO.FileShare]::None)
-
- if ($outStream)
- {
- $outStream.Close()
- }
-
- return $false
- }
- catch
- {
- # File is locked by a process.
- return $true
- }
-}
-
-function New-Record
-{
- Param
- (
- [string]$Account,
- [string]$Password,
- [int]$UID,
- [int]$GID,
- [string]$FullName,
- [string]$Office,
- [string]$Extension,
- [string]$HomePhone,
- [string]$Email,
- [string]$Directory,
- [string]$Shell
- )
-
- $GECOS = [PSCustomObject]@{
- FullName = $FullName
- Office = $Office
- Extension = $Extension
- HomePhone = $HomePhone
- Email = $Email
- }
-
- [PSCustomObject]@{
- Account = $Account
- Password = $Password
- UID = $UID
- GID = $GID
- GECOS = $GECOS
- Directory = $Directory
- Shell = $Shell
- }
-}
-
-
-function Import-File
-{
- Param
- (
- [Parameter(Mandatory=$false,
- ValueFromPipeline=$true,
- ValueFromPipelineByPropertyName=$true)]
- [string]
- $Path = ".\passwd.txt"
- )
-
- if (-not(Test-Path $Path))
- {
- throw [System.IO.FileNotFoundException]
- }
-
- $header = "Account","Password","UID","GID","GECOS","Directory","Shell"
-
- $csv = Import-Csv -Path $Path -Delimiter ":" -Header $header -Encoding ASCII
- $csv | ForEach-Object {
- New-Record -Account $_.Account `
- -Password $_.Password `
- -UID $_.UID `
- -GID $_.GID `
- -FullName $_.GECOS.Split(",")[0] `
- -Office $_.GECOS.Split(",")[1] `
- -Extension $_.GECOS.Split(",")[2] `
- -HomePhone $_.GECOS.Split(",")[3] `
- -Email $_.GECOS.Split(",")[4] `
- -Directory $_.Directory `
- -Shell $_.Shell
- }
-}
-
-
-function Export-File
-{
- [CmdletBinding()]
- Param
- (
- [Parameter(Mandatory=$true,
- ValueFromPipeline=$true,
- ValueFromPipelineByPropertyName=$true)]
- $InputObject,
-
- [Parameter(Mandatory=$false,
- ValueFromPipeline=$true,
- ValueFromPipelineByPropertyName=$true)]
- [string]
- $Path = ".\passwd.txt"
- )
-
- Begin
- {
- if (-not(Test-Path $Path))
- {
- New-Item -Path . -Name $Path -ItemType File | Out-Null
- }
-
- [string]$recordString = "{0}:{1}:{2}:{3}:{4}:{5}:{6}"
- [string]$gecosString = "{0},{1},{2},{3},{4}"
- [string[]]$lines = @()
- [string[]]$file = Get-Content $Path
- }
- Process
- {
- foreach ($object in $InputObject)
- {
- $lines += $recordString -f $object.Account,
- $object.Password,
- $object.UID,
- $object.GID,
- $($gecosString -f $object.GECOS.FullName,
- $object.GECOS.Office,
- $object.GECOS.Extension,
- $object.GECOS.HomePhone,
- $object.GECOS.Email),
- $object.Directory,
- $object.Shell
- }
- }
- End
- {
- foreach ($line in $lines)
- {
- if (-not ($line -in $file))
- {
- $line | Out-File -FilePath $Path -Encoding ASCII -Append
- }
- }
- }
-}
diff --git a/Task/Append-a-record-to-the-end-of-a-text-file/PowerShell/append-a-record-to-the-end-of-a-text-file-2.psh b/Task/Append-a-record-to-the-end-of-a-text-file/PowerShell/append-a-record-to-the-end-of-a-text-file-2.psh
deleted file mode 100644
index 47fd84d242..0000000000
--- a/Task/Append-a-record-to-the-end-of-a-text-file/PowerShell/append-a-record-to-the-end-of-a-text-file-2.psh
+++ /dev/null
@@ -1,25 +0,0 @@
-$records = @()
-
-$records+= New-Record -Account 'jsmith' `
- -Password 'x' `
- -UID 1001 `
- -GID 1000 `
- -FullName 'Joe Smith' `
- -Office 'Room 1007' `
- -Extension '(234)555-8917' `
- -HomePhone '(234)555-0077' `
- -Email 'jsmith@rosettacode.org' `
- -Directory '/home/jsmith' `
- -Shell '/bin/bash'
-
-$records+= New-Record -Account 'jdoe' `
- -Password 'x' `
- -UID 1002 `
- -GID 1000 `
- -FullName 'Jane Doe' `
- -Office 'Room 1004' `
- -Extension '(234)555-8914' `
- -HomePhone '(234)555-0044' `
- -Email 'jdoe@rosettacode.org' `
- -Directory '/home/jdoe' `
- -Shell '/bin/bash'
diff --git a/Task/Append-a-record-to-the-end-of-a-text-file/PowerShell/append-a-record-to-the-end-of-a-text-file-3.psh b/Task/Append-a-record-to-the-end-of-a-text-file/PowerShell/append-a-record-to-the-end-of-a-text-file-3.psh
deleted file mode 100644
index 7a06667901..0000000000
--- a/Task/Append-a-record-to-the-end-of-a-text-file/PowerShell/append-a-record-to-the-end-of-a-text-file-3.psh
+++ /dev/null
@@ -1 +0,0 @@
-$records | Format-Table -AutoSize
diff --git a/Task/Append-a-record-to-the-end-of-a-text-file/PowerShell/append-a-record-to-the-end-of-a-text-file-4.psh b/Task/Append-a-record-to-the-end-of-a-text-file/PowerShell/append-a-record-to-the-end-of-a-text-file-4.psh
deleted file mode 100644
index cda47a797f..0000000000
--- a/Task/Append-a-record-to-the-end-of-a-text-file/PowerShell/append-a-record-to-the-end-of-a-text-file-4.psh
+++ /dev/null
@@ -1,4 +0,0 @@
-if (-not(Test-FileLock -Path ".\passwd.txt"))
-{
- $records | Export-File -Path ".\passwd.txt"
-}
diff --git a/Task/Append-a-record-to-the-end-of-a-text-file/PowerShell/append-a-record-to-the-end-of-a-text-file-5.psh b/Task/Append-a-record-to-the-end-of-a-text-file/PowerShell/append-a-record-to-the-end-of-a-text-file-5.psh
deleted file mode 100644
index ff8cd63b12..0000000000
--- a/Task/Append-a-record-to-the-end-of-a-text-file/PowerShell/append-a-record-to-the-end-of-a-text-file-5.psh
+++ /dev/null
@@ -1 +0,0 @@
-Get-Content -Path ".\passwd.txt"
diff --git a/Task/Append-a-record-to-the-end-of-a-text-file/PowerShell/append-a-record-to-the-end-of-a-text-file-6.psh b/Task/Append-a-record-to-the-end-of-a-text-file/PowerShell/append-a-record-to-the-end-of-a-text-file-6.psh
deleted file mode 100644
index 1661e68a11..0000000000
--- a/Task/Append-a-record-to-the-end-of-a-text-file/PowerShell/append-a-record-to-the-end-of-a-text-file-6.psh
+++ /dev/null
@@ -1,11 +0,0 @@
-$records+= New-Record -Account 'xyz' `
- -Password 'x' `
- -UID 1003 `
- -GID 1000 `
- -FullName 'X Yz' `
- -Office 'Room 1003' `
- -Extension '(234)555-8913' `
- -HomePhone '(234)555-0033' `
- -Email 'xyz@rosettacode.org' `
- -Directory '/home/xyz' `
- -Shell '/bin/bash'
diff --git a/Task/Append-a-record-to-the-end-of-a-text-file/PowerShell/append-a-record-to-the-end-of-a-text-file-7.psh b/Task/Append-a-record-to-the-end-of-a-text-file/PowerShell/append-a-record-to-the-end-of-a-text-file-7.psh
deleted file mode 100644
index c22086c11f..0000000000
--- a/Task/Append-a-record-to-the-end-of-a-text-file/PowerShell/append-a-record-to-the-end-of-a-text-file-7.psh
+++ /dev/null
@@ -1 +0,0 @@
-$records | Sort-Object { $_.GECOS.FullName.Split(" ")[1] } | Format-Table -AutoSize
diff --git a/Task/Append-a-record-to-the-end-of-a-text-file/PowerShell/append-a-record-to-the-end-of-a-text-file-8.psh b/Task/Append-a-record-to-the-end-of-a-text-file/PowerShell/append-a-record-to-the-end-of-a-text-file-8.psh
deleted file mode 100644
index cda47a797f..0000000000
--- a/Task/Append-a-record-to-the-end-of-a-text-file/PowerShell/append-a-record-to-the-end-of-a-text-file-8.psh
+++ /dev/null
@@ -1,4 +0,0 @@
-if (-not(Test-FileLock -Path ".\passwd.txt"))
-{
- $records | Export-File -Path ".\passwd.txt"
-}
diff --git a/Task/Append-a-record-to-the-end-of-a-text-file/PowerShell/append-a-record-to-the-end-of-a-text-file-9.psh b/Task/Append-a-record-to-the-end-of-a-text-file/PowerShell/append-a-record-to-the-end-of-a-text-file-9.psh
deleted file mode 100644
index ff8cd63b12..0000000000
--- a/Task/Append-a-record-to-the-end-of-a-text-file/PowerShell/append-a-record-to-the-end-of-a-text-file-9.psh
+++ /dev/null
@@ -1 +0,0 @@
-Get-Content -Path ".\passwd.txt"
diff --git a/Task/Apply-a-callback-to-an-array/Ada/apply-a-callback-to-an-array.ada b/Task/Apply-a-callback-to-an-array/Ada/apply-a-callback-to-an-array.ada
deleted file mode 100644
index 6708e131a6..0000000000
--- a/Task/Apply-a-callback-to-an-array/Ada/apply-a-callback-to-an-array.ada
+++ /dev/null
@@ -1,37 +0,0 @@
-with Ada.Text_Io;
- with Ada.Integer_text_IO;
-
- procedure Call_Back_Example is
- -- Purpose: Apply a callback to an array
- -- Output: Prints the squares of an integer array to the console
-
- -- Define the callback procedure
- procedure Display(Location : Positive; Value : Integer) is
- begin
- Ada.Text_Io.Put("array(");
- Ada.Integer_Text_Io.Put(Item => Location, Width => 1);
- Ada.Text_Io.Put(") = ");
- Ada.Integer_Text_Io.Put(Item => Value * Value, Width => 1);
- Ada.Text_Io.New_Line;
- end Display;
-
- -- Define an access type matching the signature of the callback procedure
- type Call_Back_Access is access procedure(L : Positive; V : Integer);
-
- -- Define an unconstrained array type
- type Value_Array is array(Positive range <>) of Integer;
-
- -- Define the procedure performing the callback
- procedure Map(Values : Value_Array; Worker : Call_Back_Access) is
- begin
- for I in Values'range loop
- Worker(I, Values(I));
- end loop;
- end Map;
-
- -- Define and initialize the actual array
- Sample : Value_Array := (5,4,3,2,1);
-
- begin
- Map(Sample, Display'access);
- end Call_Back_Example;
diff --git a/Task/Apply-a-callback-to-an-array/Bracmat/apply-a-callback-to-an-array.bracmat b/Task/Apply-a-callback-to-an-array/Bracmat/apply-a-callback-to-an-array.bracmat
deleted file mode 100644
index 0319a41993..0000000000
--- a/Task/Apply-a-callback-to-an-array/Bracmat/apply-a-callback-to-an-array.bracmat
+++ /dev/null
@@ -1,29 +0,0 @@
-( ( callbackFunction1
- = location value
- . !arg:(?location,?value)
- & out$(str$(array[ !location "] = " !!value))
- )
-& ( callbackFunction2
- = location value
- . !arg:(?location,?value)
- & !!value^2:?!value
- )
-& ( mapar
- = arr len callback i
- . !arg:(?arr,?len,?callback)
- & 0:?i
- & whl
- ' ( !i:>SOURCE FORMAT IS FREE
-IDENTIFICATION DIVISION.
-PROGRAM-ID. map.
-
-DATA DIVISION.
-LOCAL-STORAGE SECTION.
-01 i USAGE IS INDEX.
-01 table-size CONSTANT AS 30.
-LINKAGE SECTION.
-01 table-param.
- 03 table-values USAGE IS FLOAT-LONG, OCCURS table-size TIMES.
-01 func-ptr USAGE IS PROGRAM-POINTER.
-
-PROCEDURE DIVISION USING BY REFERENCE table-param, BY VALUE func-ptr.
- PERFORM VARYING i FROM 1 BY 1 UNTIL i IS GREATER THAN table-size
- CALL func-ptr USING BY REFERENCE table-values(i)
- END-PERFORM
- GOBACK.
-
-END PROGRAM map.
diff --git a/Task/Apply-a-callback-to-an-array/Elena/apply-a-callback-to-an-array.elena b/Task/Apply-a-callback-to-an-array/Elena/apply-a-callback-to-an-array.elena
index fde9614ade..a36b6c9013 100644
--- a/Task/Apply-a-callback-to-an-array/Elena/apply-a-callback-to-an-array.elena
+++ b/Task/Apply-a-callback-to-an-array/Elena/apply-a-callback-to-an-array.elena
@@ -2,7 +2,7 @@ import system'routines;
PrintSecondPower(n){ console.writeLine(n * n) }
-public program()
+public Program()
{
new int[]{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}.forEach(PrintSecondPower)
}
diff --git a/Task/Apply-a-callback-to-an-array/Euphoria/apply-a-callback-to-an-array.ex b/Task/Apply-a-callback-to-an-array/Euphoria/apply-a-callback-to-an-array.ex
deleted file mode 100644
index c8c703c9a6..0000000000
--- a/Task/Apply-a-callback-to-an-array/Euphoria/apply-a-callback-to-an-array.ex
+++ /dev/null
@@ -1,18 +0,0 @@
-function apply_to_all(sequence s, integer f)
- -- apply a function to all elements of a sequence
- sequence result
- result = {}
- for i = 1 to length(s) do
- -- we can call add1() here although it comes later in the program
- result = append(result, call_func(f, {s[i]}))
- end for
- return result
-end function
-
-function add1(atom x)
- return x + 1
-end function
-
--- add1() is visible here, so we can ask for its routine id
-? apply_to_all({1, 2, 3}, routine_id("add1"))
--- displays {2,3,4}
diff --git a/Task/Apply-a-callback-to-an-array/Haxe/apply-a-callback-to-an-array.haxe b/Task/Apply-a-callback-to-an-array/Haxe/apply-a-callback-to-an-array.haxe
deleted file mode 100644
index da0f9b93f7..0000000000
--- a/Task/Apply-a-callback-to-an-array/Haxe/apply-a-callback-to-an-array.haxe
+++ /dev/null
@@ -1,10 +0,0 @@
-class Main {
- static function main() {
- var numbers = [1, 2, 3, 4, 5];
-
- var squared = (i) -> i * i;
-
- trace(numbers);
- trace(numbers.map(squared));
- }
-}
diff --git a/Task/Apply-a-callback-to-an-array/PowerShell/apply-a-callback-to-an-array-1.psh b/Task/Apply-a-callback-to-an-array/PowerShell/apply-a-callback-to-an-array-1.psh
deleted file mode 100644
index 86ee892761..0000000000
--- a/Task/Apply-a-callback-to-an-array/PowerShell/apply-a-callback-to-an-array-1.psh
+++ /dev/null
@@ -1 +0,0 @@
-1..5 | ForEach-Object { $_ * $_ }
diff --git a/Task/Apply-a-callback-to-an-array/PowerShell/apply-a-callback-to-an-array-2.psh b/Task/Apply-a-callback-to-an-array/PowerShell/apply-a-callback-to-an-array-2.psh
deleted file mode 100644
index 86836c5ecd..0000000000
--- a/Task/Apply-a-callback-to-an-array/PowerShell/apply-a-callback-to-an-array-2.psh
+++ /dev/null
@@ -1,4 +0,0 @@
-function map ([array] $a, [scriptblock] $s) {
- $a | ForEach-Object $s
-}
-map (1..5) { $_ * $_ }
diff --git a/Task/Apply-a-callback-to-an-array/REBOL/apply-a-callback-to-an-array.rebol b/Task/Apply-a-callback-to-an-array/REBOL/apply-a-callback-to-an-array.rebol
deleted file mode 100644
index ec06fa4564..0000000000
--- a/Task/Apply-a-callback-to-an-array/REBOL/apply-a-callback-to-an-array.rebol
+++ /dev/null
@@ -1,26 +0,0 @@
-REBOL [
- Title: "Array Callback"
- URL: http://rosettacode.org/wiki/Apply_a_callback_to_an_Array
-]
-
-map: func [
- "Apply a function across an array."
- f [native! function!] "Function to apply to each element of array."
- a [block!] "Array to process."
- /local x
-][x: copy [] forall a [append x do [f a/1]] x]
-
-square: func [x][x * x]
-
-; Tests:
-
-assert: func [code][print [either do code [" ok"]["FAIL"] mold code]]
-
-print "Simple loop, modify in place:"
-assert [[1 100 81] = (a: [1 10 9] forall a [a/1: square a/1] a)]
-
-print [crlf "Functional style with 'map':"]
-assert [[4 16 36] = map :square [2 4 6]]
-
-print [crlf "Applying native function with 'map':"]
-assert [[2 4 6] = map :square-root [4 16 36]]
diff --git a/Task/Apply-a-callback-to-an-array/REXX/apply-a-callback-to-an-array.rexx b/Task/Apply-a-callback-to-an-array/REXX/apply-a-callback-to-an-array.rexx
index a73f3a1322..391603e556 100644
--- a/Task/Apply-a-callback-to-an-array/REXX/apply-a-callback-to-an-array.rexx
+++ b/Task/Apply-a-callback-to-an-array/REXX/apply-a-callback-to-an-array.rexx
@@ -1,23 +1,52 @@
-/*REXX program applies a callback to an array (using factorials for a demonstration).*/
-numeric digits 100 /*be able to display some huge numbers.*/
-parse arg # . /*obtain an optional value from the CL.*/
-a.= /*initialize the array A to all nulls*/
-if #=='' | #=="," then #= 12 /*Not assigned? Then use default value*/
- do j=0 to #; a.j= j /*assign the integer J ───► A.j */
- end /*j*/ /*array A will have N values: 0 ──► #*/
+-- 8 Sep 2025
+include Setting
-call listA 'before callback' /*display A array before the callback*/
-say /*display a blank line for readability.*/
-say ' ··· applying callback to array A ···' /*display what is about to happen to B.*/
-say /*display a blank line for readability.*/
-call bangit 'a' /*factorialize (the values) of A array.*/
- /* store the results ───► array B.*/
-call listA ' after callback' /*display A array after the callback.*/
-exit 0 /*stick a fork in it, we're all done. */
-/*──────────────────────────────────────────────────────────────────────────────────────*/
-bangit: do v=0; $= value(arg(1)'.'v); if $=='' then return /*No value? Then return*/
- call value arg(1)'.'v, fact($) /*assign a value (a factorial) to array*/
- end /*i*/
-/*──────────────────────────────────────────────────────────────────────────────────────*/
-fact: procedure; arg x; != 1; do f=2 to x; != !*f; end; /*f*/; return !
-listA: do k=0 while a.k\==''; say arg(1) 'a.'k"=" a.k; end /*k*/; return
+say 'APPLY A CALLBACK TO AN ARRAY'
+say version
+say
+call Task 'x'
+call Task ''
+call Task 'Sqrt(x)'
+call Task 'Sin(x)'
+call Task 'Exp(x)'
+exit
+
+Task:
+-- Get function to apply
+parse arg function
+-- Example array with x-values
+array.=0; n=10
+do i = 1 to n
+ array.i=i
+end
+array.0 = n
+if function = '' then do
+-- Apply fixed function to each element
+ do i = 1 to array.0
+ array.i=Square(array.i)
+ end
+ function='Square(x)'
+end
+else do
+-- Apply dynamic function to each element
+ do i = 1 to array.0
+ array.i=Std(Eval(function,array.i)/1)
+ end
+end
+-- Show after callback
+call Show
+return
+
+Show:
+say ' x' function
+do i = 1 to n
+ say Right(i,2) array.i
+end
+say
+return
+
+Square:
+arg xx
+return xx**2
+
+include Math
diff --git a/Task/Apply-a-callback-to-an-array/VBScript/apply-a-callback-to-an-array-1.vb b/Task/Apply-a-callback-to-an-array/VBScript/apply-a-callback-to-an-array-1.vb
deleted file mode 100644
index 6738d7f40e..0000000000
--- a/Task/Apply-a-callback-to-an-array/VBScript/apply-a-callback-to-an-array-1.vb
+++ /dev/null
@@ -1,16 +0,0 @@
-class callback
- dim sRule
-
- public property let rule( x )
- sRule = x
- end property
-
- public default function applyTo(a)
- dim p1
- for i = lbound( a ) to ubound( a )
- p1 = a( i )
- a( i ) = eval( sRule )
- next
- applyTo = a
- end function
-end class
diff --git a/Task/Apply-a-callback-to-an-array/VBScript/apply-a-callback-to-an-array-2.vb b/Task/Apply-a-callback-to-an-array/VBScript/apply-a-callback-to-an-array-2.vb
deleted file mode 100644
index 00043062ce..0000000000
--- a/Task/Apply-a-callback-to-an-array/VBScript/apply-a-callback-to-an-array-2.vb
+++ /dev/null
@@ -1,13 +0,0 @@
-dim a1
-dim cb
-set cb = new callback
-
-cb.rule = "ucase(p1)"
-a1 = split("my dog has fleas", " " )
-cb.applyTo a1
-wscript.echo join( a1, " " )
-
-cb.rule = "p1 ^ p1"
-a1 = array(1,2,3,4,5,6,7,8,9,10)
-cb.applyto a1
-wscript.echo join( a1, ", " )
diff --git a/Task/Apply-a-digital-filter-direct-form-II-transposed-/Ada/apply-a-digital-filter-direct-form-ii-transposed-.ada b/Task/Apply-a-digital-filter-direct-form-II-transposed-/Ada/apply-a-digital-filter-direct-form-ii-transposed-.ada
deleted file mode 100644
index b9ec71a55e..0000000000
--- a/Task/Apply-a-digital-filter-direct-form-II-transposed-/Ada/apply-a-digital-filter-direct-form-ii-transposed-.ada
+++ /dev/null
@@ -1,60 +0,0 @@
-with Ada.Text_IO;
-
-procedure Apply_Filter is
-
- generic
- type Num is digits <>;
- type Num_Array is array (Natural range <>) of Num;
- A : Num_Array;
- B : Num_Array;
- package Direct_Form_II_Transposed is
- pragma Assert (A'First = 0 and B'First = 0);
- pragma Assert (A'Last = B'Last);
- pragma Assert (A (0) = 1.000);
-
- function Filter (X : in Num) return Num;
- end Direct_Form_II_Transposed;
-
- package body Direct_Form_II_Transposed
- is
- W : Num_Array (A'Range) := (others => 0.0);
-
- function Filter (X : in Num) return Num is
- Y : constant Num := X * B (0) + W (0);
- begin
- -- Calculate delay line for next sample
- for I in 1 .. W'Last loop
- W (I - 1) := X * B (I) - Y * A (I) + W (I);
- end loop;
- return Y;
- end Filter;
-
- end Direct_Form_II_Transposed;
-
- type Coeff_Array is array (Natural range <>) of Float;
-
- package Butterworth is
- new Direct_Form_II_Transposed (Float, Coeff_Array,
- A => (1.000000000000, -2.77555756e-16,
- 3.33333333e-01, -1.85037171e-17),
- B => (0.16666667, 0.50000000,
- 0.50000000, 0.16666667));
-
- subtype Signal_Array is Coeff_Array;
-
- X_Signal : constant Signal_Array :=
- (-0.917843918645, 0.141984778794, 1.20536903482, 0.190286794412, -0.662370894973,
- -1.00700480494, -0.404707073677, 0.800482325044, 0.743500089861, 1.01090520172,
- 0.741527555207, 0.277841675195, 0.400833448236, -0.2085993586, -0.172842103641,
- -0.134316096293, 0.0259303398477, 0.490105989562, 0.549391221511, 0.9047198589);
-
- package Float_IO is
- new Ada.Text_IO.Float_IO (Float);
- Y : Float;
-begin
- for Sample of X_Signal loop
- Y := Butterworth.Filter (Sample);
- Float_IO.Put (Y, Exp => 0, Aft => 6);
- Ada.Text_IO.New_Line;
- end loop;
-end Apply_Filter;
diff --git a/Task/Approximate-equality/Ada/approximate-equality.ada b/Task/Approximate-equality/Ada/approximate-equality.ada
deleted file mode 100644
index f027f481c1..0000000000
--- a/Task/Approximate-equality/Ada/approximate-equality.ada
+++ /dev/null
@@ -1,46 +0,0 @@
-with Ada.Text_IO; use Ada.Text_IO;
-with Ada.Numerics.Generic_Elementary_Functions;
-
-procedure Main is
- type Real is digits 18;
- package Real_Funcs is new Ada.Numerics.Generic_Elementary_Functions(Real);
- use Real_Funcs;
- package Real_IO is new Ada.Text_IO.Float_IO(Real);
- use Real_IO;
-
- function Approx_Equal (Left : Real; Right : Real) return Boolean is
-
- -- Calculate an epsilon value based upon the magnitude of the
- -- maximum value of the two parameters
- eps : Real := Real'Max(Left, Right) * 1.0e-9;
- begin
- if left > Right then
- return Left - Right < eps;
- else
- return Right - Left < eps;
- end if;
- end Approx_Equal;
-
- Type Index is (Left, Right);
- type Pairs_List is array (Index) of Real;
- type Pairs_Table is array(1..8) of Pairs_List;
- Table : Pairs_Table;
-
-begin
- Table := ((100000000000000.01, 100000000000000.011),
- (100.01, 100.011),
- (10000000000000.001 / 10000.0, 1000000000.0000001000),
- (0.001, 0.0010000001),
- (0.000000000000000000000101, 0.0),
- (sqrt(2.0) * sqrt(2.0), 2.0),
- (-sqrt(2.0) * sqrt(2.0), -2.0),
- (3.14159265358979323846, 3.14159265358979324));
-
- for Pair of Table loop
- Put(Item => Pair(Left), Exp => 0, Aft => 16, Fore => 6);
- Put(" ");
- Put(Item => Pair(Right), Exp => 0, Aft => 16, Fore => 6);
- Put_Line(" " & Boolean'Image(Approx_Equal(Pair(Left), Pair(Right))));
- end loop;
-
-end Main;
diff --git a/Task/Approximate-equality/ReScript/approximate-equality.re b/Task/Approximate-equality/ReScript/approximate-equality.re
deleted file mode 100644
index 827729d2dd..0000000000
--- a/Task/Approximate-equality/ReScript/approximate-equality.re
+++ /dev/null
@@ -1,19 +0,0 @@
-let approx_eq = (v1, v2, epsilon) => {
- abs_float (v1 -. v2) < epsilon
-}
-
-let test = (a, b) => {
- let epsilon = 1e-18
- Printf.printf("%g, %g => %b\n", a, b, approx_eq(a, b, epsilon))
-}
-
-{
- test(100000000000000.01, 100000000000000.011)
- test(100.01, 100.011)
- test(10000000000000.001 /. 10000.0, 1000000000.0000001000)
- test(0.001, 0.0010000001)
- test(0.000000000000000000000101, 0.0)
- test(sqrt(2.0) *. sqrt(2.0), 2.0)
- test(-. sqrt(2.0) *. sqrt(2.0), (-2.0))
- test(3.14159265358979323846, 3.14159265358979324)
-}
diff --git a/Task/Arbitrary-precision-integers-included-/Ada/arbitrary-precision-integers-included-.ada b/Task/Arbitrary-precision-integers-included-/Ada/arbitrary-precision-integers-included-.ada
deleted file mode 100644
index 838bfb5fec..0000000000
--- a/Task/Arbitrary-precision-integers-included-/Ada/arbitrary-precision-integers-included-.ada
+++ /dev/null
@@ -1,16 +0,0 @@
-with Ada.Text_IO; use Ada.Text_IO;
-with GNATCOLL.GMP; use GNATCOLL.GMP;
-with GNATCOLL.GMP.Integers; use GNATCOLL.GMP.Integers;
-procedure ArbitraryInt is
- type stracc is access String;
- BigInt : Big_Integer;
- len : Natural;
- str : stracc;
-begin
- Set (BigInt, 5);
- Raise_To_N (BigInt, Unsigned_Long (4**(3**2)));
- str := new String'(Image (BigInt));
- len := str'Length;
- Put_Line ("Size is:"& Natural'Image (len));
- Put_Line (str (1 .. 20) & "....." & str (len - 19 .. len));
-end ArbitraryInt;
diff --git a/Task/Arbitrary-precision-integers-included-/COBOL/arbitrary-precision-integers-included-.cobol b/Task/Arbitrary-precision-integers-included-/COBOL/arbitrary-precision-integers-included-.cobol
deleted file mode 100644
index a89dbd222b..0000000000
--- a/Task/Arbitrary-precision-integers-included-/COBOL/arbitrary-precision-integers-included-.cobol
+++ /dev/null
@@ -1,133 +0,0 @@
- identification division.
- program-id. arbitrary-precision-integers.
- remarks. Uses opaque libgmp internals that are built into libcob.
-
- data division.
- working-storage section.
- 01 gmp-number.
- 05 mp-alloc usage binary-long.
- 05 mp-size usage binary-long.
- 05 mp-limb usage pointer.
- 01 gmp-build.
- 05 mp-alloc usage binary-long.
- 05 mp-size usage binary-long.
- 05 mp-limb usage pointer.
-
- 01 the-int usage binary-c-long unsigned.
- 01 the-exponent usage binary-c-long unsigned.
- 01 valid-exponent usage binary-long value 1.
- 88 cant-use value 0 when set to false 1.
-
- 01 number-string usage pointer.
- 01 number-length usage binary-long.
-
- 01 window-width constant as 20.
- 01 limit-width usage binary-long.
- 01 number-buffer pic x(window-width) based.
-
- procedure division.
- arbitrary-main.
-
- *> calculate 10 ** 19
- perform initialize-integers.
- display "10 ** 19 : " with no advancing
- move 10 to the-int
- move 19 to the-exponent
- perform raise-pow-accrete-exponent
- perform show-all-or-portion
- perform clean-up
-
- *> calculate 12345 ** 9
- perform initialize-integers.
- display "12345 ** 9 : " with no advancing
- move 12345 to the-int
- move 9 to the-exponent
- perform raise-pow-accrete-exponent
- perform show-all-or-portion
- perform clean-up
-
- *> calculate 5 ** 4 ** 3 ** 2
- perform initialize-integers.
- display "5 ** 4 ** 3 ** 2: " with no advancing
- move 3 to the-int
- move 2 to the-exponent
- perform raise-pow-accrete-exponent
- move 4 to the-int
- perform raise-pow-accrete-exponent
- move 5 to the-int
- perform raise-pow-accrete-exponent
- perform show-all-or-portion
- perform clean-up
- goback.
- *> **************************************************************
-
- initialize-integers.
- call "__gmpz_init" using gmp-number returning omitted
- call "__gmpz_init" using gmp-build returning omitted
- .
-
- raise-pow-accrete-exponent.
- *> check before using previously overflowed exponent intermediate
- if cant-use then
- display "Error: intermediate overflow occured at "
- the-exponent upon syserr
- goback
- end-if
- call "__gmpz_set_ui" using gmp-number by value 0
- returning omitted
- call "__gmpz_set_ui" using gmp-build by value the-int
- returning omitted
- call "__gmpz_pow_ui" using gmp-number gmp-build
- by value the-exponent
- returning omitted
- call "__gmpz_set_ui" using gmp-build by value 0
- returning omitted
- call "__gmpz_get_ui" using gmp-number returning the-exponent
- call "__gmpz_fits_ulong_p" using gmp-number
- returning valid-exponent
- .
-
- *> get string representation, base 10
- show-all-or-portion.
- call "__gmpz_sizeinbase" using gmp-number
- by value 10
- returning number-length
- display "GMP length: " number-length ", " with no advancing
-
- call "__gmpz_get_str" using null by value 10
- by reference gmp-number
- returning number-string
- call "strlen" using by value number-string
- returning number-length
- display "strlen: " number-length
-
- *> slide based string across first and last of buffer
- move window-width to limit-width
- set address of number-buffer to number-string
- if number-length <= window-width then
- move number-length to limit-width
- display number-buffer(1:limit-width)
- else
- display number-buffer with no advancing
- subtract window-width from number-length
- move function max(0, number-length) to number-length
- if number-length <= window-width then
- move number-length to limit-width
- else
- display "..." with no advancing
- end-if
- set address of number-buffer up by
- function max(window-width, number-length)
- display number-buffer(1:limit-width)
- end-if
- .
-
- clean-up.
- call "free" using by value number-string returning omitted
- call "__gmpz_clear" using gmp-number returning omitted
- call "__gmpz_clear" using gmp-build returning omitted
- set address of number-buffer to null
- set cant-use to false
- .
-
- end program arbitrary-precision-integers.
diff --git a/Task/Arbitrary-precision-integers-included-/Emacs-Lisp/arbitrary-precision-integers-included--1.l b/Task/Arbitrary-precision-integers-included-/Emacs-Lisp/arbitrary-precision-integers-included--1.l
deleted file mode 100644
index e7fdbf36cc..0000000000
--- a/Task/Arbitrary-precision-integers-included-/Emacs-Lisp/arbitrary-precision-integers-included--1.l
+++ /dev/null
@@ -1,10 +0,0 @@
-(let* ((integer-width (* 65536 16)) ; raise bignum limit from 65536 bits to avoid overflow error
- (answer (number-to-string (expt 5 (expt 4 (expt 3 2)))))
- (length (length answer)))
- (message "%s has %d digits"
- (if (> length 40)
- (format "%s...%s"
- (substring answer 0 20)
- (substring answer (- length 20) length))
- answer)
- length))
diff --git a/Task/Arbitrary-precision-integers-included-/Emacs-Lisp/arbitrary-precision-integers-included--2.l b/Task/Arbitrary-precision-integers-included-/Emacs-Lisp/arbitrary-precision-integers-included--2.l
deleted file mode 100644
index 1d6a049d06..0000000000
--- a/Task/Arbitrary-precision-integers-included-/Emacs-Lisp/arbitrary-precision-integers-included--2.l
+++ /dev/null
@@ -1,9 +0,0 @@
-(let* ((answer (calc-eval "5**4**3**2"))
- (length (length answer)))
- (message "%s has %d digits"
- (if (> length 40)
- (format "%s...%s"
- (substring answer 0 20)
- (substring answer (- length 20) length))
- answer)
- length))
diff --git a/Task/Arbitrary-precision-integers-included-/M2000-Interpreter/arbitrary-precision-integers-included-.m2000 b/Task/Arbitrary-precision-integers-included-/M2000-Interpreter/arbitrary-precision-integers-included-.m2000
index 5869a47e0f..5129ac8f4c 100644
--- a/Task/Arbitrary-precision-integers-included-/M2000-Interpreter/arbitrary-precision-integers-included-.m2000
+++ b/Task/Arbitrary-precision-integers-included-/M2000-Interpreter/arbitrary-precision-integers-included-.m2000
@@ -1,17 +1,18 @@
module checkit {
z=4^(3^2)
z1=z/1024-1
- m=Biginteger("5")
- with m, "ToString" as m.ToString
- p=Biginteger("1024")
+ m=5u 'Biginteger("5")
+ ' with m, "ToString" as m.ToString
+ p=1024u 'Biginteger("1024")
method m, "intpower", p as m1
m=m1
for i=1 to z1
- method m1, "multiply", m as m
- ? len(m.tostring), i
+ ' method m1, "multiply", m as m
+ m*=m1
+ print len(""+m), i ' len(m.tostring), i
refresh
next
- a=m.tostring
+ a=""+m ' m.tostring
Print left$(a, 20)+"..."+Right$(a,20)
}
checkit
diff --git a/Task/Arbitrary-precision-integers-included-/Pluto/arbitrary-precision-integers-included-.pluto b/Task/Arbitrary-precision-integers-included-/Pluto/arbitrary-precision-integers-included-.pluto
index 4a5147f062..44728725e0 100644
--- a/Task/Arbitrary-precision-integers-included-/Pluto/arbitrary-precision-integers-included-.pluto
+++ b/Task/Arbitrary-precision-integers-included-/Pluto/arbitrary-precision-integers-included-.pluto
@@ -1,10 +1,11 @@
-local bigint = require "bigint"
+require "bignum"
local fmt = require "fmt"
+
local p = bigint.new(3) ^ bigint.new(2)
p = bigint.new(4) ^ p
p = bigint.new(5) ^ p
-
-local s = p:tostring()
+mpz.init()
+local s = mpz.tostring(p)
fmt.print("5 ^ 4 ^ 3 ^ 2 has %s digits.\n", fmt.int(#s))
print("The first twenty and last twenty are: ")
print(fmt.abridge(s, 20))
diff --git a/Task/Arbitrary-precision-integers-included-/PowerShell/arbitrary-precision-integers-included-.psh b/Task/Arbitrary-precision-integers-included-/PowerShell/arbitrary-precision-integers-included-.psh
deleted file mode 100644
index 5189b471ad..0000000000
--- a/Task/Arbitrary-precision-integers-included-/PowerShell/arbitrary-precision-integers-included-.psh
+++ /dev/null
@@ -1,9 +0,0 @@
-# Perform calculation
-$BigNumber = [BigInt]::Pow( 5, [BigInt]::Pow( 4, [BigInt]::Pow( 3, 2 ) ) )
-
-# Display first and last 20 digits
-$BigNumberString = [string]$BigNumber
-$BigNumberString.Substring( 0, 20 ) + "..." + $BigNumberString.Substring( $BigNumberString.Length - 20, 20 )
-
-# Display number of digits
-$BigNumberString.Length
diff --git a/Task/Arbitrary-precision-integers-included-/REXX/arbitrary-precision-integers-included--1.rexx b/Task/Arbitrary-precision-integers-included-/REXX/arbitrary-precision-integers-included--1.rexx
deleted file mode 100644
index be724a0151..0000000000
--- a/Task/Arbitrary-precision-integers-included-/REXX/arbitrary-precision-integers-included--1.rexx
+++ /dev/null
@@ -1,15 +0,0 @@
-/*REXX program calculates and demonstrates arbitrary precision numbers (using powers). */
-numeric digits 200000 /*two hundred thousand decimal digits. */
-
- # = 5 ** (4 ** (3 ** 2) ) /*calculate multiple exponentiations. */
-
-true=62060698786608744707...92256259918212890625 /*what answer is supposed to look like.*/
-rexx= left(#, 20)'...'right(#, 20) /*the left and right 20 decimal digits.*/
-
-say ' true:' true /*show what the "true" answer is. */
-say ' REXX:' rexx /* " " " REXX " " */
-say 'digits:' length(#) /* " " " length of answer is. */
-say
-if true == rexx then say 'passed!' /*either it passed, ··· */
- else say 'failed!' /* or it didn't. */
- /*stick a fork in it, we're all done. */
diff --git a/Task/Arbitrary-precision-integers-included-/REXX/arbitrary-precision-integers-included--2.rexx b/Task/Arbitrary-precision-integers-included-/REXX/arbitrary-precision-integers-included--2.rexx
deleted file mode 100644
index 07e2654a98..0000000000
--- a/Task/Arbitrary-precision-integers-included-/REXX/arbitrary-precision-integers-included--2.rexx
+++ /dev/null
@@ -1,22 +0,0 @@
-/*REXX program calculates and demonstrates arbitrary precision numbers (using powers). */
-numeric digits 5 /*just use enough digits for 1st time. */
-
- #=5** (4** (3** 2) ) /*calculate multiple exponentiations. */
-
-parse var # 'E' pow . /*POW might be null, so N is OK. */
-
-if pow\=='' then do /*general case: POW might be < zero.*/
- numeric digits abs(pow) + 9 /*recalculate with more decimal digits.*/
- #=5** (4** (3** 2) ) /*calculate multiple exponentiations. */
- end /* [↑] calculation is the real McCoy. */
-
-true=62060698786608744707...92256259918212890625 /*what answer is supposed to look like.*/
-rexx= left(#, 20)'...'right(#, 20) /*the left and right 20 decimal digits.*/
-
-say ' true:' true /*show what the "true" answer is. */
-say ' REXX:' rexx /* " " " REXX " " */
-say 'digits:' length(#) /* " " " length of answer is. */
-say
-if true == rexx then say 'passed!' /*either it passed, ··· */
- else say 'failed!' /* or it didn't. */
- /*stick a fork in it, we're all done. */
diff --git a/Task/Arbitrary-precision-integers-included-/Tcl/arbitrary-precision-integers-included-.tcl b/Task/Arbitrary-precision-integers-included-/Tcl/arbitrary-precision-integers-included-.tcl
deleted file mode 100644
index 71fdc22752..0000000000
--- a/Task/Arbitrary-precision-integers-included-/Tcl/arbitrary-precision-integers-included-.tcl
+++ /dev/null
@@ -1,7 +0,0 @@
-set bigValue [expr {5**4**3**2}]
-puts "5**4**3**2 has [string length $bigValue] digits"
-if {[string match "62060698786608744707*92256259918212890625" $bigValue]} {
- puts "Value starts with 62060698786608744707, ends with 92256259918212890625"
-} else {
- puts "Value does not match 62060698786608744707...92256259918212890625"
-}
diff --git a/Task/Archimedean-spiral/Ada/archimedean-spiral.ada b/Task/Archimedean-spiral/Ada/archimedean-spiral.ada
deleted file mode 100644
index e949fa2f1f..0000000000
--- a/Task/Archimedean-spiral/Ada/archimedean-spiral.ada
+++ /dev/null
@@ -1,77 +0,0 @@
-with Ada.Numerics.Elementary_Functions;
-
-with SDL.Video.Windows.Makers;
-with SDL.Video.Rectangles;
-with SDL.Video.Renderers.Makers;
-with SDL.Events.Events;
-
-procedure Archimedean_Spiral is
-
- Width : constant := 800;
- Height : constant := 800;
- A : constant := 4.2;
- B : constant := 3.2;
- T_First : constant := 4.0;
- T_Last : constant := 100.0;
-
- Window : SDL.Video.Windows.Window;
- Renderer : SDL.Video.Renderers.Renderer;
- Event : SDL.Events.Events.Events;
-
- procedure Draw_Archimedean_Spiral is
- use type SDL.C.int;
- use Ada.Numerics.Elementary_Functions;
- Pi : constant := Ada.Numerics.Pi;
- Step : constant := 0.002;
- T : Float;
- R : Float;
- begin
- T := T_First;
- loop
- R := A + B * T;
- Renderer.Draw
- (Point =>
- SDL.Video.Rectangles.Point'
- (X => Width / 2 + SDL.C.int (R * Cos (T, 2.0 * Pi)),
- Y => Height / 2 - SDL.C.int (R * Sin (T, 2.0 * Pi))));
- exit when T >= T_Last;
- T := T + Step;
- end loop;
- end Draw_Archimedean_Spiral;
-
- procedure Wait is
- use type SDL.Events.Event_Types;
- begin
- loop
- while SDL.Events.Events.Poll (Event) loop
- if Event.Common.Event_Type = SDL.Events.Quit then
- return;
- end if;
- end loop;
- end loop;
- end Wait;
-
-begin
- if not SDL.Initialise (Flags => SDL.Enable_Screen) then
- return;
- end if;
-
- SDL.Video.Windows.Makers.Create
- (Win => Window,
- Title => "Archimedean spiral",
- Position => SDL.Natural_Coordinates'(X => 10, Y => 10),
- Size => SDL.Positive_Sizes'(Width, Height),
- Flags => 0);
- SDL.Video.Renderers.Makers.Create (Renderer, Window.Get_Surface);
- Renderer.Set_Draw_Colour ((0, 0, 0, 255));
- Renderer.Fill
- (Rectangle => SDL.Video.Rectangles.Rectangle'(0, 0, Width, Height));
- Renderer.Set_Draw_Colour ((0, 220, 0, 255));
-
- Draw_Archimedean_Spiral;
- Window.Update_Surface;
-
- Wait;
- Window.Finalize;
- SDL.Finalise;
-end Archimedean_Spiral;
diff --git a/Task/Arena-storage-pool/Ada/arena-storage-pool-1.ada b/Task/Arena-storage-pool/Ada/arena-storage-pool-1.ada
deleted file mode 100644
index 9f1210e1f4..0000000000
--- a/Task/Arena-storage-pool/Ada/arena-storage-pool-1.ada
+++ /dev/null
@@ -1,2 +0,0 @@
-type My_Pointer is access My_Object;
-for My_Pointer'Storage_Pool use My_Pool;
diff --git a/Task/Arena-storage-pool/Ada/arena-storage-pool-2.ada b/Task/Arena-storage-pool/Ada/arena-storage-pool-2.ada
deleted file mode 100644
index d63b12b564..0000000000
--- a/Task/Arena-storage-pool/Ada/arena-storage-pool-2.ada
+++ /dev/null
@@ -1,27 +0,0 @@
-with System.Storage_Elements; use System.Storage_Elements;
-with System.Storage_Pools; use System.Storage_Pools;
-
-package Arena_Pools is
- type Arena (Size : Storage_Count) is new Root_Storage_Pool with private;
- overriding
- procedure Allocate
- ( Pool : in out Arena;
- Address : out System.Address;
- Size : Storage_Count;
- Alignment : Storage_Count
- );
- overriding
- procedure Deallocate
- ( Pool : in out Arena;
- Address : System.Address;
- Size : Storage_Count;
- Alignment : Storage_Count
- ) is null;
- overriding
- function Storage_Size (Pool : Arena) return Storage_Count;
-private
- type Arena (Size : Storage_Count) is new Root_Storage_Pool with record
- Free : Storage_Offset := 1;
- Core : Storage_Array (1..Size);
- end record;
-end Arena_Pools;
diff --git a/Task/Arena-storage-pool/Ada/arena-storage-pool-3.ada b/Task/Arena-storage-pool/Ada/arena-storage-pool-3.ada
deleted file mode 100644
index d53b54d02a..0000000000
--- a/Task/Arena-storage-pool/Ada/arena-storage-pool-3.ada
+++ /dev/null
@@ -1,22 +0,0 @@
-package body Arena_Pools is
- procedure Allocate
- ( Pool : in out Arena;
- Address : out System.Address;
- Size : Storage_Count;
- Alignment : Storage_Count
- ) is
- Free : constant Storage_Offset :=
- Pool.Free + Alignment - Pool.Core (Pool.Free)'Address mod Alignment + Size;
- begin
- if Free - 1 > Pool.Size then
- raise Storage_Error;
- end if;
- Pool.Free := Free;
- Address := Pool.Core (Pool.Free - Size)'Address;
- end Allocate;
-
- function Storage_Size (Pool : Arena) return Storage_Count is
- begin
- return Pool.Size;
- end Storage_Size;
-end Arena_Pools;
diff --git a/Task/Arena-storage-pool/Ada/arena-storage-pool-4.ada b/Task/Arena-storage-pool/Ada/arena-storage-pool-4.ada
deleted file mode 100644
index 3b86cec89b..0000000000
--- a/Task/Arena-storage-pool/Ada/arena-storage-pool-4.ada
+++ /dev/null
@@ -1,15 +0,0 @@
-with Arena_Pools;
-use Arena_Pools;
-
-procedure Test_Allocator is
- Pool : Arena_Pools.Arena (1024);
- type Integer_Ptr is access Integer;
- for Integer_Ptr'Storage_Pool use Pool;
-
- X : Integer_Ptr := new Integer'(1);
- Y : Integer_Ptr := new Integer'(2);
- Z : Integer_Ptr;
-begin
- Z := new Integer;
- Z.all := X.all + Y.all;
-end Test_Allocator;
diff --git a/Task/Arena-storage-pool/Phix/arena-storage-pool-1.phix b/Task/Arena-storage-pool/Phix/arena-storage-pool-1.phix
index 8a21d19c1d..94d9bb219c 100644
--- a/Task/Arena-storage-pool/Phix/arena-storage-pool-1.phix
+++ b/Task/Arena-storage-pool/Phix/arena-storage-pool-1.phix
@@ -1,4 +1,2 @@
-(notonline)-->
- without js
- atom mem = allocate ( size , true )
-
- without js
- sequence ap = {}
- function ap_allocate ( integer size )
- -- allocate some memory and add it to the arena pool 'ap' for later release
- atom res = allocate ( size )
- ap = append ( ap , res )
- return res
- end function
- procedure ap_free ()
- -- free all memory allocated in arena pool 'ap'
- free ( ap )
- ap = {}
- end procedure
-
- -- demo\rosetta\ArithComplex.exw
- with javascript_semantics
- include complex . e
- complex a = complex_new ( 1 , 1 ), -- (or just {1,1})
- b = complex_new ( 3.14159 , 1.25 ),
- c = complex_new ( 1 , 0 ),
- d = complex_new ( 0 , 1 )
- printf ( 1 , "a = %s\n" ,{ complex_sprint ( a )})
- printf ( 1 , "b = %s\n" ,{ complex_sprint ( b )})
- printf ( 1 , "c = %s\n" ,{ complex_sprint ( c )})
- printf ( 1 , "d = %s\n" ,{ complex_sprint ( d )})
- printf ( 1 , "a+b = %s\n" ,{ complex_sprint ( complex_add ( a , b ))})
- printf ( 1 , "a*b = %s\n" ,{ complex_sprint ( complex_mul ( a , b ))})
- printf ( 1 , "1/a = %s\n" ,{ complex_sprint ( complex_inv ( a ))})
- printf ( 1 , "c/a = %s\n" ,{ complex_sprint ( complex_div ( c , a ))})
- printf ( 1 , "c-a = %s\n" ,{ complex_sprint ( complex_sub ( c , a ))})
- printf ( 1 , "d-a = %s\n" ,{ complex_sprint ( complex_sub ( d , a ))})
- printf ( 1 , "-a = %s\n" ,{ complex_sprint ( complex_neg ( a ))})
- printf ( 1 , "conj a = %s\n" ,{ complex_sprint ( complex_conjugate ( a ))})
-
- with javascript_semantics
- sequence arithmetic = { 1 }
- integer composite = 0
+with javascript_semantics
+sequence arithmetic = {1}
+integer composite = 0
- function get_arithmetic ( integer nth )
- integer n = arithmetic [$]+ 1
- while length ( arithmetic )< nth do
- sequence divs = factors ( n , 1 )
- if remainder ( sum ( divs ), length ( divs ))= 0 then
- composite += length ( divs )> 2
- arithmetic &= n
- end if
- n += 1
- end while
- return arithmetic [ nth ]
- end function
+procedure get_arithmetics(integer nth)
+ integer n = arithmetic[$]+1
+ while length(arithmetic)2
+ arithmetic &= n
+ end if
+ n += 1
+ end while
+end procedure
- {} = get_arithmetic ( 100 )
- printf ( 1 , "The first 100 arithmetic numbers are:\n%s\n" ,
- { join_by ( arithmetic , 1 , 10 , " " , fmt := "%3d" )})
- constant fmt = "The %,dth arithmetic number is %,d up to which %,d are composite.\n"
- for n in { 1e3 , 1e4 , 1e5 , 1e6 } do
- integer nth = get_arithmetic ( n )
- printf ( 1 , fmt ,{ n , nth , composite })
- end for
-
- constant MAX = 20 ,
- ITER = 1000000
+with javascript_semantics
+constant MAX = 20,
+ ITER = 1000000
- function expected ( integer n )
- atom sum = 0
- for i = 1 to n do
- sum += factorial ( n ) / power ( n , i ) / factorial ( n - i )
- end for
- return sum
- end function
+function expected(integer n)
+ atom res = 0
+ for i=1 to n do
+ res += factorial(n)/power(n,i)/factorial(n-i)
+ end for
+ return res
+end function
- function test ( integer n )
- integer count = 0 , x , bits
- for i = 1 to ITER do
- x = 1
- bits = 0
- while not and_bits ( bits , x ) do
- count += 1
- bits = or_bits ( bits , x )
- x = power ( 2 , rand ( n )- 1 )
- end while
- end for
- return count / ITER
- end function
+function test(integer n)
+ integer count = 0
+ for i=1 to ITER do
+ integer x = 1, bits = 0
+ while not and_bits(bits,x) do
+ count += 1
+ bits = or_bits(bits,x)
+ x = power(2,rand(n)-1)
+ end while
+ end for
+ return count/ITER
+end function
- atom av , ex
- puts ( 1 , " n avg. exp. (error%)\n" );
- puts ( 1 , "== ====== ====== ========\n" );
- for n = 1 to MAX do
- av = test ( n )
- ex = expected ( n )
- printf ( 1 , "%2d %8.4f %8.4f (%5.3f%%)\n" , { n , av , ex , abs ( 1 - av / ex )* 100 })
- end for
-
- with javascript_semantics
- function MeanAngle ( sequence angles )
- atom x = 0 , y = 0
- for i = 1 to length ( angles ) do
- atom ai_rad = angles [ i ]* PI / 180
- x += cos ( ai_rad )
- y += sin ( ai_rad )
- end for
- if abs ( x )< 1e-16 then return "not meaningful" end if
- return sprintf ( "%g" , round ( atan2 ( y , x )* 180 / PI , 1e10 ))
- end function
+with javascript_semantics
+function MeanAngle(sequence angles)
+ atom x = 0, y = 0
+ for a in sq_mul(angles,PI/180) do
+ x += cos(a)
+ y += sin(a)
+ end for
+ if abs(x)<1e-15 then return "not meaningful" end if
+ return sprintf("%g",round(atan2(y,x)*180/PI,1e10))
+end function
- constant AngleLists = {{ 350 , 10 },{ 90 , 180 , 270 , 360 },{ 10 , 20 , 30 },{ 180 },{ 0 , 180 }}
- for i = 1 to length ( AngleLists ) do
- sequence ai = AngleLists [ i ]
- printf ( 1 , "%16V: Mean Angle is %s\n" ,{ ai , MeanAngle ( ai )})
- end for
-
- with javascript_semantics
- function MeanAngle ( sequence angles )
- atom x = 0 , y = 0
- for i = 1 to length ( angles ) do
- atom ai_rad = angles [ i ]* PI / 180
- x += cos ( ai_rad )
- y += sin ( ai_rad )
- end for
- if abs ( x )< 1e-16 then return "not meaningful" end if
- return atan2 ( y , x )* 180 / PI
- end function
+with javascript_semantics
+function MeanAngle(sequence angles)
+ atom x = 0, y = 0
+ for i=1 to length(angles) do
+ atom ai_rad = angles[i]*PI/180
+ x += cos(ai_rad)
+ y += sin(ai_rad)
+ end for
+ if abs(x)<1e-16 then return "not meaningful" end if
+ return atan2(y,x)*180/PI
+end function
- function toSecAngle ( integer hours , integer minutes , integer seconds )
- return (( hours * 60 + minutes )* 60 + seconds )/( 24 * 60 * 60 )* 360
- end function
+function toSecAngle(integer hours, integer minutes, integer seconds)
+ return ((hours*60+minutes)*60+seconds)/(24*60*60)*360
+end function
- constant Times = { toSecAngle ( 23 , 00 , 17 ),
- toSecAngle ( 23 , 40 , 20 ),
- toSecAngle ( 00 , 12 , 45 ),
- toSecAngle ( 00 , 17 , 19 )}
+constant Times = {toSecAngle(23,00,17),
+ toSecAngle(23,40,20),
+ toSecAngle(00,12,45),
+ toSecAngle(00,17,19)}
- function toHMS ( object s )
- if not string ( s ) then
- if s < 0 then s += 360 end if
- s = 24 * 60 * 60 * s / 360
- atom hours = floor ( s / 3600 ),
- mins = floor ( remainder ( s , 3600 )/ 60 ),
- secs = remainder ( s , 60 )
- s = sprintf ( "%02d:%02d:%02d" ,{ hours , mins , secs })
- end if
- return s
- end function
+function toHMS(object s)
+ if not string(s) then
+ if s<0 then s+=360 end if
+ s = 24*60*60*s/360
+ atom hours = floor(s/3600),
+ mins = floor(remainder(s,3600)/60),
+ secs = remainder(s,60)
+ s = sprintf("%02d:%02d:%02d",{hours,mins,secs})
+ end if
+ return s
+end function
- printf ( 1 , "Mean Time is %s\n" ,{ toHMS ( MeanAngle ( Times ))})
-
- function mode ( sequence s )
- -- returns a list of the most common values, each of which occurs the same number of times
- integer nxt = 1 , count = 1 , maxc = 1
- sequence res = {}
- if length ( s )!= 0 then
- s = sort ( s )
- object prev = s [ 1 ]
- for i = 2 to length ( s ) do
- if s [ i ]!= prev then
- s [ nxt ] = { count , prev }
- nxt += 1
- prev = s [ i ]
- count = 1
- else
- count += 1
- if count > maxc then
- maxc = count
- end if
- end if
- end for
- s [ nxt ] = { count , prev }
- res = ""
- for i = 1 to nxt do
- if s [ i ][ 1 ]= maxc then
- res = append ( res , s [ i ][ 2 ])
- end if
- end for
- end if
- return res
- end function
+with javascript_semantics
+function mode(sequence s)
+-- returns a list of the most common values, each of which occurs the same number of times
+ integer nxt = 1, count = 1, maxc = 1
+ sequence res = {}
+ if length(s)!=0 then
+ s = sort(s)
+ object prev = s[1]
+ for i=2 to length(s) do
+ if s[i]!=prev then
+ s[nxt] = {count,prev}
+ nxt += 1
+ prev = s[i]
+ count = 1
+ else
+ count += 1
+ if count>maxc then
+ maxc = count
+ end if
+ end if
+ end for
+ s[nxt] = {count,prev}
+ res = ""
+ for i=1 to nxt do
+ if s[i][1]=maxc then
+ res = append(res,s[i][2])
+ end if
+ end for
+ end if
+ return res
+end function
- ? mode ({ 1 , 2 , 5 , - 5 , - 9.5 , 3.14159 })
- ? mode ({ 1 , "blue" , 2 , 7.5 , 5 , "green" , "red" , 5 , 2 , "blue" , "white" })
- ? mode ({ 1 , 2 , 3 , 1 , 2 , 4 , 2 , 5 , 2 , 3 , 3 , 1 , 3 , 6 })
- ? mode ({. 2 , . 7 , . 1 , . 8 , . 2 })
- ? mode ({ "two" , 7 , 1 , 8 , "two" , 8 })
- ? mode ( "Hello there world" )
- ? mode ({})
- {} = wait_key ()
-
- with javascript_semantics
- sequence sma = {} -- ((period,history,circnxt)) (private to sma.e)
- integer sma_free = 0
-
- global function new_sma ( integer period )
- integer res
- if sma_free then
- res = sma_free
- sma_free = sma [ sma_free ]
- sma [ res ] = { period ,{}, 0 }
- else
- sma = append ( sma ,{ period ,{}, 0 })
- res = length ( sma )
- end if
- return res
- end function
-
- global procedure add_sma ( integer sidx , atom val )
- integer period , circnxt
- sequence history
- { period , history , circnxt } = sma [ sidx ]
- sma [ sidx ][ 2 ] = 0 -- (kill refcount)
- if length ( history )< period then
- history = append ( history , val )
- else
- circnxt += 1
- if circnxt > period then
- circnxt = 1
- end if
- sma [ sidx ][ 3 ] = circnxt
- history [ circnxt ] = val
- end if
- sma [ sidx ][ 2 ] = history
- end procedure
-
- global function get_sma_average ( integer sidx )
- sequence history = sma [ sidx ][ 2 ]
- integer l = length ( history )
- if l = 0 then return 0 end if
- return sum ( history )/ l
- end function
-
- global function moving_average ( integer sidx , atom val )
- add_sma ( sidx , val )
- return get_sma_average ( sidx )
- end function
-
- global procedure free_sma ( integer sidx )
- sma [ sidx ] = sma_free
- sma_free = sidx
- end procedure
-
- with javascript_semantics
- include sma . e
-
- constant sma3 = new_sma ( 3 )
- constant sma5 = new_sma ( 5 )
- constant s = { 1 , 2 , 3 , 4 , 5 , 5 , 4 , 3 , 2 , 1 }
- integer si
-
- for i = 1 to length ( s ) do
- si = s [ i ]
- printf ( 1 , "%2g: sma3=%8g, sma5=%8g\n" ,{ si , moving_average ( sma3 , si ), moving_average ( sma5 , si )})
- end for
- [].
balanced_brackets -->
- ['['],
- balanced_brackets,
- [']'].
+ ['['],
+ balanced_brackets,
+ [']'].
balanced_brackets -->
- ['[',']'],
- balanced_brackets.
+ ['[',']'],
+ balanced_brackets.
% generator of random brackets
gen_bracket(0) --> [].
gen_bracket(N) -->
- {N1 is N - 1,
- R is random(2)},
- bracket(R),
- gen_bracket(N1).
+ {N1 is N - 1,
+ R is random(2)},
+ bracket(R),
+ gen_bracket(N1).
bracket(0) --> ['['].
bracket(1) --> [']'].
diff --git a/Task/Balanced-brackets/Red/balanced-brackets.red b/Task/Balanced-brackets/Red/balanced-brackets.red
index a5fc247878..40d773a9f3 100644
--- a/Task/Balanced-brackets/Red/balanced-brackets.red
+++ b/Task/Balanced-brackets/Red/balanced-brackets.red
@@ -5,18 +5,18 @@ balanced?: func [str][parse str rule]
; Tests
tests: [
- good: ["" "[]" "[][]" "[[]]" "[[][]]" "[[[[[]]][][[]]]]"]
- bad: ["[" "]" "][" "[[]" "[]]" "[]][[]" "[[[[[[]]]]]]]"]
+ good: ["" "[]" "[][]" "[[]]" "[[][]]" "[[[[[]]][][[]]]]"]
+ bad: ["[" "]" "][" "[[]" "[]]" "[]][[]" "[[[[[[]]]]]]]"]
]
foreach str tests/good [
- if not balanced? str [print [mold str "failed!"]]
+ if not balanced? str [print [mold str "failed!"]]
]
foreach str tests/bad [
- if balanced? str [print [mold str "failed!"]]
+ if balanced? str [print [mold str "failed!"]]
]
repeat i 10 [
- str: random copy/part "[][][][][][][][][][]" i * 2
- print [mold str "is" either balanced? str ["balanced"]["unbalanced"]]
+ str: random copy/part "[][][][][][][][][][]" i * 2
+ print [mold str "is" either balanced? str ["balanced"]["unbalanced"]]
]
diff --git a/Task/Balanced-brackets/Stata/balanced-brackets.stata b/Task/Balanced-brackets/Stata/balanced-brackets.stata
index ce238f97e3..83eedcefc9 100644
--- a/Task/Balanced-brackets/Stata/balanced-brackets.stata
+++ b/Task/Balanced-brackets/Stata/balanced-brackets.stata
@@ -1,12 +1,12 @@
mata
function random_brackets(n) {
- return(invtokens(("[","]")[runiformint(1,2*n,1,2)],""))
+ return(invtokens(("[","]")[runiformint(1,2*n,1,2)],""))
}
function is_balanced(s) {
- n = strlen(s)
- if (n==0) return(1)
- a = runningsum(92:-ascii(s))
- return(all(a:>=0) & a[n]==0)
+ n = strlen(s)
+ if (n==0) return(1)
+ a = runningsum(92:-ascii(s))
+ return(all(a:>=0) & a[n]==0)
}
end
diff --git a/Task/Balanced-brackets/Tcl/balanced-brackets-1.tcl b/Task/Balanced-brackets/Tcl/balanced-brackets-1.tcl
index 82d7ece066..2e2beb8e8f 100644
--- a/Task/Balanced-brackets/Tcl/balanced-brackets-1.tcl
+++ b/Task/Balanced-brackets/Tcl/balanced-brackets-1.tcl
@@ -3,9 +3,9 @@ proc generate {n} {
set l [lrepeat $n "\[" "\]"]
set len [llength $l]
while {$len} {
- set tmp [lindex $l [set i [expr {int($len * rand())}]]]
- lset l $i [lindex $l [incr len -1]]
- lset l $len $tmp
+ set tmp [lindex $l [set i [expr {int($len * rand())}]]]
+ lset l $i [lindex $l [incr len -1]]
+ lset l $len $tmp
}
return [join $l ""]
}
@@ -13,11 +13,11 @@ proc generate {n} {
proc balanced s {
set n 0
foreach c [split $s ""] {
- # Everything unmatched is ignored, which is what we want
- switch -exact -- $c {
- "\[" {incr n}
- "\]" {if {[incr n -1] < 0} {return false}}
- }
+ # Everything unmatched is ignored, which is what we want
+ switch -exact -- $c {
+ "\[" {incr n}
+ "\]" {if {[incr n -1] < 0} {return false}}
+ }
}
expr {!$n}
}
diff --git a/Task/Balanced-brackets/Tcl/balanced-brackets-2.tcl b/Task/Balanced-brackets/Tcl/balanced-brackets-2.tcl
index f01beac2ea..e0e4f4a0b7 100644
--- a/Task/Balanced-brackets/Tcl/balanced-brackets-2.tcl
+++ b/Task/Balanced-brackets/Tcl/balanced-brackets-2.tcl
@@ -1,8 +1,8 @@
proc constructBalancedString {n} {
set s ""
for {set i 0} {$i < $n} {incr i} {
- set x [expr {int(rand() * ([string length $s] + 1))}]
- set s "[string range $s 0 [expr {$x-1}]]\[\][string range $s $x end]"
+ set x [expr {int(rand() * ([string length $s] + 1))}]
+ set s "[string range $s 0 [expr {$x-1}]]\[\][string range $s $x end]"
}
return $s
}
diff --git a/Task/Balanced-brackets/VBScript/balanced-brackets-1.vb b/Task/Balanced-brackets/VBScript/balanced-brackets-1.vb
deleted file mode 100644
index 8a458a26f4..0000000000
--- a/Task/Balanced-brackets/VBScript/balanced-brackets-1.vb
+++ /dev/null
@@ -1,36 +0,0 @@
-For n = 1 To 10
- sequence = Generate_Sequence(n)
- WScript.Echo sequence & " is " & Check_Balance(sequence) & "."
-Next
-
-Function Generate_Sequence(n)
- For i = 1 To n
- j = Round(Rnd())
- If j = 0 Then
- Generate_Sequence = Generate_Sequence & "["
- Else
- Generate_Sequence = Generate_Sequence & "]"
- End If
- Next
-End Function
-
-Function Check_Balance(s)
- Set Stack = CreateObject("System.Collections.Stack")
- For i = 1 To Len(s)
- char = Mid(s,i,1)
- If i = 1 Or char = "[" Then
- Stack.Push(char)
- ElseIf Stack.Count <> 0 Then
- If char = "]" And Stack.Peek = "[" Then
- Stack.Pop
- End If
- Else
- Stack.Push(char)
- End If
- Next
- If Stack.Count > 0 Then
- Check_Balance = "Not Balanced"
- Else
- Check_Balance = "Balanced"
- End If
-End Function
diff --git a/Task/Balanced-brackets/VBScript/balanced-brackets-2.vb b/Task/Balanced-brackets/VBScript/balanced-brackets-2.vb
deleted file mode 100644
index cb0beeaef5..0000000000
--- a/Task/Balanced-brackets/VBScript/balanced-brackets-2.vb
+++ /dev/null
@@ -1,40 +0,0 @@
-option explicit
-
-function do_brackets(bal)
- dim s,i,cnt,r
- if bal then s="[":cnt=1 else s="":cnt=0
- for i=1 to 20
- if (rnd>0.7) then r=not r
- if not r then
- s=s+"[" :cnt=cnt+1
- else
- if not bal or (bal and cnt>0) then s=s+"]":cnt=cnt-1
- end if
- next
- if bal and cnt<>0 then s=s&string(cnt,"]")
- if not bal and cnt=0 then s=s&"]"
- do_brackets=s
-end function
-
-function isbalanced(s)
- dim s1,i,cnt: cnt=0
- for i=1 to len(s)
- s1=mid(s,i,1)
- if s1="[" then cnt=cnt+1
- if s1="]" then cnt=cnt-1
- if cnt<0 then isbalanced=false:exit function
- next
- isbalanced=(cnt=0)
-end function
-
-function iif(a,b,c): if a then iif=b else iif=c end if : end function
-
-randomize timer
-dim i,s,bal,bb
-for i=1 to 10
- bal=(rnd>.5)
- s=do_brackets(bal)
- bb=isbalanced(s)
- wscript.echo iif (bal,"","un")& "balanced string " &vbtab _
- & s & vbtab & " Checks as " & iif(bb,"","un")&"balanced"
-next
diff --git a/Task/Balanced-brackets/XBS/balanced-brackets.xbs b/Task/Balanced-brackets/XBS/balanced-brackets.xbs
index 3bccd7da4a..11305dd643 100644
--- a/Task/Balanced-brackets/XBS/balanced-brackets.xbs
+++ b/Task/Balanced-brackets/XBS/balanced-brackets.xbs
@@ -1,17 +1,17 @@
const Chars:[string] = ["[","]"];
func GenerateString(Amount:number=4):string{
- set Result:string = "";
- <|(*1..Amount)=>Result+=Chars[math.random(0,?Chars-1)];
- send Result;
+ set Result:string = "";
+ <|(*1..Amount)=>Result+=Chars[math.random(0,?Chars-1)];
+ send Result;
}
func IsBalanced(String:string):boolean{
- set Pairs:number = 0;
- <|(*(0..(?String-1)))=>(String::at(_)=="[")?(Pairs<0)?=>send false,Pairs++,=>Pairs--;
- send (Opens==Closes)&(Pairs==0);
+ set Pairs:number = 0;
+ <|(*(0..(?String-1)))=>(String::at(_)=="[")?(Pairs<0)?=>send false,Pairs++,=>Pairs--;
+ send (Opens==Closes)&(Pairs==0);
}
repeat 10 {
- set s = GenerateString(math.random(2,4)*2);
- log(`{s}: {IsBalanced(s)}`);
+ set s = GenerateString(math.random(2,4)*2);
+ log(`{s}: {IsBalanced(s)}`);
}
diff --git a/Task/Balanced-brackets/Ya/balanced-brackets.ya b/Task/Balanced-brackets/Ya/balanced-brackets.ya
index 0b3e76f880..40698505e5 100644
--- a/Task/Balanced-brackets/Ya/balanced-brackets.ya
+++ b/Task/Balanced-brackets/Ya/balanced-brackets.ya
@@ -4,34 +4,34 @@
// definition of anything new is prefixed by \, like \MakeNew_[]s and \len
// MakeNew_[]s is Ok ident in Ya: _ starts sign part of ident, which must be ended by _ or alphanum
`Char[^] \MakeNew_[]s(`Int+ \len) // `Char[^] and `Char[=] are arrays that owns their items, like it's usally in other langs;
- // yet in assignment of `Char[^] to `Char[=] the allocated memory is moved from old to new owner, and old string becomes empty
- // there are tabs at starts of many lines; these tabs specify what in C++ is {} blocks, just like in Python
- len & 1 ==0 ! // it's a call to postfix function '!' which is an assert: len must be even
- `Char[=] \r(len) // allocate new string of length len
- // most statements are analogous to C++ but written starting by capital letter: For If Switch Ret
- For `Char[] \eye = r; eye // // `Char[] is a simplest array of chars, which does not hold a memory used by array items; inc part of For loop is missed: it's Ok, and condition and init could also be missed
- *eye++ = '['; *eye++ = '[' // fill r by "[][][]...". The only place with ; as statement delemiter: required because the statement is not started at new line.
- // below is a shuffle of "[][][]..." array
- For `Char[] \eye = r; ++eye // var eye is already defined, but being the same `Char[] it's Ok by using already exisiting var. ++eye is used: it allows use of eye[-1] inside
- `Int+ \at = Random(eye/Length) // `Int+ is C++'s unsigned int. eye/Length: / is used for access to field, like in file path
- eye[-1],eye[at] = eye[at],eye[-1] // swap using tuples; eye[-1] accesses char that is out of current array, yet it's allowed
- Ret r // Ret is C's return
+ // yet in assignment of `Char[^] to `Char[=] the allocated memory is moved from old to new owner, and old string becomes empty
+ // there are tabs at starts of many lines; these tabs specify what in C++ is {} blocks, just like in Python
+ len & 1 ==0 ! // it's a call to postfix function '!' which is an assert: len must be even
+ `Char[=] \r(len) // allocate new string of length len
+ // most statements are analogous to C++ but written starting by capital letter: For If Switch Ret
+ For `Char[] \eye = r; eye // // `Char[] is a simplest array of chars, which does not hold a memory used by array items; inc part of For loop is missed: it's Ok, and condition and init could also be missed
+ *eye++ = '['; *eye++ = '[' // fill r by "[][][]...". The only place with ; as statement delemiter: required because the statement is not started at new line.
+ // below is a shuffle of "[][][]..." array
+ For `Char[] \eye = r; ++eye // var eye is already defined, but being the same `Char[] it's Ok by using already exisiting var. ++eye is used: it allows use of eye[-1] inside
+ `Int+ \at = Random(eye/Length) // `Int+ is C++'s unsigned int. eye/Length: / is used for access to field, like in file path
+ eye[-1],eye[at] = eye[at],eye[-1] // swap using tuples; eye[-1] accesses char that is out of current array, yet it's allowed
+ Ret r // Ret is C's return
`Bool \AreBalanced(`Char[] \brackets)
- `Int+ \extra = 0
- For ;brackets ;++brackets
- Switch *brackets
- '[' // it's a C++'s 'case': both 'case' and ':' are skipped being of no value; but the code for a case should be in block, which is here specifyed by tabs at next line start
- ++extra
- ']'
- If !!extra // '!!' is `Bool not, like all other `Bool ops: && || ^^
- Ret No // No and False are C's false; Yes and True are C's true
- --extra
- // There is no default case, which is written as ':' - so if no case is Ok then it will fail just like if being written as on the next line
- // : { 0! } // C's default: assert(0);
- Ret extra == 0
+ `Int+ \extra = 0
+ For ;brackets ;++brackets
+ Switch *brackets
+ '[' // it's a C++'s 'case': both 'case' and ':' are skipped being of no value; but the code for a case should be in block, which is here specifyed by tabs at next line start
+ ++extra
+ ']'
+ If !!extra // '!!' is `Bool not, like all other `Bool ops: && || ^^
+ Ret No // No and False are C's false; Yes and True are C's true
+ --extra
+ // There is no default case, which is written as ':' - so if no case is Ok then it will fail just like if being written as on the next line
+ // : { 0! } // C's default: assert(0);
+ Ret extra == 0
// function ala 'main' is not used: all global code from all modules are executed; so below is what typically is in ala 'main'
For `Int \n=10; n; --n
- // below note that new var 'brackets' is created inside args of func call
- //@Std/StdIO/ is used here to use Print function; else it maybe changed to Use @Std/StdIO at global level before this For loop
- @Std/StdIO/Print(; "%s : %s\n" ;`Char[=] \brackets = MakeNew_[]s(10) /* all bracket strings are of length 10 */; AreBalanced(brackets) ? "Ok" : "bad")
- // note that starting arg of Print is missed by using ';' - default arg value is allowed to use for any arg, even if next args are written
+ // below note that new var 'brackets' is created inside args of func call
+ //@Std/StdIO/ is used here to use Print function; else it maybe changed to Use @Std/StdIO at global level before this For loop
+ @Std/StdIO/Print(; "%s : %s\n" ;`Char[=] \brackets = MakeNew_[]s(10) /* all bracket strings are of length 10 */; AreBalanced(brackets) ? "Ok" : "bad")
+ // note that starting arg of Print is missed by using ';' - default arg value is allowed to use for any arg, even if next args are written
diff --git a/Task/Balanced-brackets/Yabasic/balanced-brackets.basic b/Task/Balanced-brackets/Yabasic/balanced-brackets.basic
index f92e2488aa..f318913bce 100644
--- a/Task/Balanced-brackets/Yabasic/balanced-brackets.basic
+++ b/Task/Balanced-brackets/Yabasic/balanced-brackets.basic
@@ -1,6 +1,6 @@
sub check_brackets(s$)
local level, i
-
+
for i = 1 to len(s$)
switch mid$(s$, i, 1)
case "[": level = level + 1 : break
diff --git a/Task/Balanced-ternary/Ada/balanced-ternary-1.ada b/Task/Balanced-ternary/Ada/balanced-ternary-1.ada
deleted file mode 100644
index dd4c353d57..0000000000
--- a/Task/Balanced-ternary/Ada/balanced-ternary-1.ada
+++ /dev/null
@@ -1,47 +0,0 @@
-with Ada.Finalization;
-
-package BT is
-
- type Balanced_Ternary is private;
-
- -- conversions
- function To_Balanced_Ternary (Num : Integer) return Balanced_Ternary;
- function To_Balanced_Ternary (Str : String) return Balanced_Ternary;
- function To_Integer (Num : Balanced_Ternary) return Integer;
- function To_string (Num : Balanced_Ternary) return String;
-
- -- Arithmetics
- -- unary minus
- function "-" (Left : in Balanced_Ternary)
- return Balanced_Ternary;
-
- -- subtraction
- function "-" (Left, Right : in Balanced_Ternary)
- return Balanced_Ternary;
-
- -- addition
- function "+" (Left, Right : in Balanced_Ternary)
- return Balanced_Ternary;
- -- multiplication
- function "*" (Left, Right : in Balanced_Ternary)
- return Balanced_Ternary;
-
-private
- -- a balanced ternary number is a unconstrained array of (1,0,-1)
- -- dinamically allocated, least significant trit leftmost
- type Trit is range -1..1;
- type Trit_Array is array (Positive range <>) of Trit;
- pragma Pack(Trit_Array);
-
- type Trit_Access is access Trit_Array;
-
- type Balanced_Ternary is new Ada.Finalization.Controlled
- with record
- Ref : Trit_access;
- end record;
-
- procedure Initialize (Object : in out Balanced_Ternary);
- procedure Adjust (Object : in out Balanced_Ternary);
- procedure Finalize (Object : in out Balanced_Ternary);
-
-end BT;
diff --git a/Task/Balanced-ternary/Ada/balanced-ternary-2.ada b/Task/Balanced-ternary/Ada/balanced-ternary-2.ada
deleted file mode 100644
index dd743e2dec..0000000000
--- a/Task/Balanced-ternary/Ada/balanced-ternary-2.ada
+++ /dev/null
@@ -1,181 +0,0 @@
-with Ada.Unchecked_Deallocation;
-
-package body BT is
-
- procedure Free is new Ada.Unchecked_Deallocation (Trit_Array, Trit_Access);
-
- -- Conversions
- -- String to BT
- function To_Balanced_Ternary (Str: String) return Balanced_Ternary is
- J : Positive := 1;
- Tmp : Trit_Access;
- begin
- Tmp := new Trit_Array (1..Str'Last);
- for I in reverse Str'Range loop
- case Str(I) is
- when '+' => Tmp (J) := 1;
- when '-' => Tmp (J) := -1;
- when '0' => Tmp (J) := 0;
- when others => raise Constraint_Error;
- end case;
- J := J + 1;
- end loop;
- return (Ada.Finalization.Controlled with Ref => Tmp);
- end To_Balanced_Ternary;
-
- -- Integer to BT
- function To_Balanced_Ternary (Num: Integer) return Balanced_Ternary is
- K : Integer := 0;
- D : Integer;
- Value : Integer := Num;
- Tmp : Trit_Array(1..19); -- 19 trits is enough to contain
- -- a 32 bits signed integer
- begin
- loop
- D := (Value mod 3**(K+1))/3**K;
- if D = 2 then D := -1; end if;
- Value := Value - D*3**K;
- K := K + 1;
- Tmp(K) := Trit(D);
- exit when Value = 0;
- end loop;
- return (Ada.Finalization.Controlled
- with Ref => new Trit_Array'(Tmp(1..K)));
- end To_Balanced_Ternary;
-
- -- BT to Integer --
- -- If the BT number is too large Ada will raise CONSTRAINT ERROR
- function To_Integer (Num : Balanced_Ternary) return Integer is
- Value : Integer := 0;
- Pos : Integer := 1;
- begin
- for I in Num.Ref.all'Range loop
- Value := Value + Integer(Num.Ref(I)) * Pos;
- Pos := Pos * 3;
- end loop;
- return Value;
- end To_Integer;
-
- -- BT to String --
- function To_String (Num : Balanced_Ternary) return String is
- I : constant Integer := Num.Ref.all'Last;
- Result : String (1..I);
- begin
- for J in Result'Range loop
- case Num.Ref(I-J+1) is
- when 0 => Result(J) := '0';
- when -1 => Result(J) := '-';
- when 1 => Result(J) := '+';
- end case;
- end loop;
- return Result;
- end To_String;
-
- -- unary minus --
- function "-" (Left : in Balanced_Ternary)
- return Balanced_Ternary is
- Result : constant Balanced_Ternary := Left;
- begin
- for I in Result.Ref.all'Range loop
- Result.Ref(I) := - Result.Ref(I);
- end loop;
- return Result;
- end "-";
-
- -- addition --
- Carry : Trit;
-
- function Add (Left, Right : in Trit)
- return Trit is
- begin
- if Left /= Right then
- Carry := 0;
- return Left + Right;
- else
- Carry := Left;
- return -Right;
- end if;
- end Add;
- pragma Inline (Add);
-
- function "+" (Left, Right : in Trit_Array)
- return Balanced_Ternary is
- Max_Size : constant Integer :=
- Integer'Max(Left'Last, Right'Last);
- Tmp_Left, Tmp_Right : Trit_Array(1..Max_Size) := (others => 0);
- Result : Trit_Array(1..Max_Size+1) := (others => 0);
- begin
- Tmp_Left (1..Left'Last) := Left;
- Tmp_Right(1..Right'Last) := Right;
- for I in Tmp_Left'Range loop
- Result(I) := Add (Result(I), Tmp_Left(I));
- Result(I+1) := Carry;
- Result(I) := Add(Result(I), Tmp_Right(I));
- Result(I+1) := Add(Result(I+1), Carry);
- end loop;
- -- remove trailing zeros
- for I in reverse Result'Range loop
- if Result(I) /= 0 then
- return (Ada.Finalization.Controlled
- with Ref => new Trit_Array'(Result(1..I)));
- end if;
- end loop;
- return (Ada.Finalization.Controlled
- with Ref => new Trit_Array'(1 => 0));
- end "+";
-
- function "+" (Left, Right : in Balanced_Ternary)
- return Balanced_Ternary is
- begin
- return Left.Ref.all + Right.Ref.all;
- end "+";
-
- -- Subtraction
- function "-" (Left, Right : in Balanced_Ternary)
- return Balanced_Ternary is
- begin
- return Left + (-Right);
- end "-";
-
- -- multiplication
- function "*" (Left, Right : in Balanced_Ternary)
- return Balanced_Ternary is
- A, B : Trit_Access;
- Result : Balanced_Ternary;
- begin
- if Left.Ref.all'Length > Right.Ref.all'Length then
- A := Right.Ref; B := Left.Ref;
- else
- B := Right.Ref; A := Left.Ref;
- end if;
- for I in A.all'Range loop
- if A(I) /= 0 then
- declare
- Tmp_Result : Trit_Array (1..I+B.all'Length-1) := (others => 0);
- begin
- for J in B.all'Range loop
- Tmp_Result(I+J-1) := B(J) * A(I);
- end loop;
- Result := Result.Ref.all + Tmp_Result;
- end;
- end if;
- end loop;
- return Result;
- end "*";
-
- procedure Adjust (Object : in out Balanced_Ternary) is
- begin
- Object.Ref := new Trit_Array'(Object.Ref.all);
- end Adjust;
-
- procedure Finalize (Object : in out Balanced_Ternary) is
- begin
- Free (Object.Ref);
- end Finalize;
-
- procedure Initialize (Object : in out Balanced_Ternary) is
- begin
- Object.Ref := new Trit_Array'(1 => 0);
- end Initialize;
-
-end BT;
diff --git a/Task/Balanced-ternary/Ada/balanced-ternary-3.ada b/Task/Balanced-ternary/Ada/balanced-ternary-3.ada
deleted file mode 100644
index 309de4f858..0000000000
--- a/Task/Balanced-ternary/Ada/balanced-ternary-3.ada
+++ /dev/null
@@ -1,19 +0,0 @@
-with Ada.Text_Io; use Ada.Text_Io;
-with Ada.Integer_Text_Io; use Ada.Integer_Text_Io;
-with BT; use BT;
-
-procedure TestBT is
- Result, A, B, C : Balanced_Ternary;
-begin
- A := To_Balanced_Ternary("+-0++0+");
- B := To_Balanced_Ternary(-436);
- C := To_Balanced_Ternary("+-++-");
-
- Result := A * (B - C);
-
- Put("a = "); Put(To_integer(A), 4); New_Line;
- Put("b = "); Put(To_integer(B), 4); New_Line;
- Put("c = "); Put(To_integer(C), 4); New_Line;
- Put("a * (b - c) = "); Put(To_integer(Result), 4);
- Put_Line (" " & To_String(Result));
-end TestBT;
diff --git a/Task/Barnsley-fern/Ada/barnsley-fern.ada b/Task/Barnsley-fern/Ada/barnsley-fern.ada
deleted file mode 100644
index 3d9631cbec..0000000000
--- a/Task/Barnsley-fern/Ada/barnsley-fern.ada
+++ /dev/null
@@ -1,94 +0,0 @@
-with Ada.Numerics.Discrete_Random;
-
-with SDL.Video.Windows.Makers;
-with SDL.Video.Renderers.Makers;
-with SDL.Events.Events;
-
-procedure Barnsley_Fern is
-
- Iterations : constant := 1_000_000;
- Width : constant := 500;
- Height : constant := 750;
- Scale : constant := 70.0;
-
- type Percentage is range 1 .. 100;
- package Random_Percentages is
- new Ada.Numerics.Discrete_Random (Percentage);
-
- Gen : Random_Percentages.Generator;
- Window : SDL.Video.Windows.Window;
- Renderer : SDL.Video.Renderers.Renderer;
- Event : SDL.Events.Events.Events;
-
- procedure Draw_Barnsley_Fern is
- use type SDL.C.int;
- subtype F1_Range is Percentage range Percentage'First .. Percentage'First;
- subtype F2_Range is Percentage range F1_Range'Last + 1 .. F1_Range'Last + 85;
- subtype F3_Range is Percentage range F2_Range'Last + 1 .. F2_Range'Last + 7;
- subtype F4_Range is Percentage range F3_Range'Last + 1 .. F3_Range'Last + 7;
-
- X0, Y0 : Float := 0.00;
- X1, Y1 : Float;
- begin
- for I in 1 .. Iterations loop
- case Random_Percentages.Random (Gen) is
-
- when F1_Range =>
- X1 := 0.00;
- Y1 := 0.16 * Y0;
-
- when F2_Range =>
- X1 := 0.85 * X0 + 0.04 * Y0;
- Y1 := -0.04 * X0 + 0.85 * Y0 + 1.60;
-
- when F3_Range =>
- X1 := 0.20 * X0 - 0.26 * Y0;
- Y1 := 0.23 * X0 + 0.22 * Y0 + 1.60;
-
- when F4_Range =>
- X1 := -0.15 * X0 + 0.28 * Y0;
- Y1 := 0.26 * X0 + 0.24 * Y0 + 0.44;
-
- end case;
- Renderer.Draw (Point => (X => Width / 2 + SDL.C.int (Scale * X1),
- Y => Height - SDL.C.int (Scale * Y1)));
- X0 := X1; Y0 := Y1;
-
- end loop;
- end Draw_Barnsley_Fern;
-
- procedure Wait is
- use type SDL.Events.Event_Types;
- begin
- loop
- while SDL.Events.Events.Poll (Event) loop
- if Event.Common.Event_Type = SDL.Events.Quit then
- return;
- end if;
- end loop;
- end loop;
- end Wait;
-
-begin
- if not SDL.Initialise (Flags => SDL.Enable_Screen) then
- return;
- end if;
-
- SDL.Video.Windows.Makers.Create (Win => Window,
- Title => "Barnsley Fern",
- Position => SDL.Natural_Coordinates'(X => 10, Y => 10),
- Size => SDL.Positive_Sizes'(Width, Height),
- Flags => 0);
- SDL.Video.Renderers.Makers.Create (Renderer, Window.Get_Surface);
- Renderer.Set_Draw_Colour ((0, 0, 0, 255));
- Renderer.Fill (Rectangle => (0, 0, Width, Height));
- Renderer.Set_Draw_Colour ((0, 220, 0, 255));
-
- Random_Percentages.Reset (Gen);
- Draw_Barnsley_Fern;
- Window.Update_Surface;
-
- Wait;
- Window.Finalize;
- SDL.Finalise;
-end Barnsley_Fern;
diff --git a/Task/Barnsley-fern/EasyLang/barnsley-fern.easy b/Task/Barnsley-fern/EasyLang/barnsley-fern.easy
index 4176e236d7..b326a0836e 100644
--- a/Task/Barnsley-fern/EasyLang/barnsley-fern.easy
+++ b/Task/Barnsley-fern/EasyLang/barnsley-fern.easy
@@ -1,5 +1,6 @@
-gcolor 060
-for i = 1 to 200000
+gbackground 000
+gcolor 263
+for i = 1 to 100000
r = randomf
if r < 0.01
nx = 0
diff --git a/Task/Barnsley-fern/Emacs-Lisp/barnsley-fern.l b/Task/Barnsley-fern/Emacs-Lisp/barnsley-fern.l
deleted file mode 100644
index 88f31ac7ce..0000000000
--- a/Task/Barnsley-fern/Emacs-Lisp/barnsley-fern.l
+++ /dev/null
@@ -1,54 +0,0 @@
-; Barnsley fern
-
-(defun make-array (size)
- "Create an empty array with size*size elements."
- (setq m-array (make-vector size nil))
- (dotimes (i size)
- (setf (aref m-array i) (make-vector size 0)))
- m-array)
-
-(defun barnsley-next (p)
- "Return the next Barnsley fern coordinates."
- (let ((r (random 100))
- (x (car p))
- (y (cdr p)))
- (cond ((< r 2) (setq nx 0) (setq ny (* 0.16 y)))
- ((< r 9) (setq nx (- (* 0.2 x) (* 0.26 y)))
- (setq ny (+ 1.6 (* 0.23 x) (* 0.22 y))))
- ((< r 16) (setq nx (+ (* -0.15 x) (* 0.28 y)))
- (setq ny (+ 0.44 (* 0.26 x) (* 0.24 y))))
- (t (setq nx (+ (* 0.85 x) (* 0.04 y)))
- (setq ny (+ 1.6 (* -0.04 x) (* 0.85 y)))))
- (cons nx ny)))
-
-(defun barnsley-lines (arr size)
- "Turn array into a string for XPM conversion."
- (setq all "")
- (dotimes (y size)
- (setq line "")
- (dotimes (x size)
- (setq line (concat line (if (= (elt (elt arr y) x) 1) "*" "."))))
- (setq all (concat all "\"" line "\",\n")))
- all)
-
-(defun barnsley-show (arr size)
- "Convert size*size array to XPM image and show it."
- (insert-image (create-image (concat (format "/* XPM */
-static char * barnsley[] = {
-\"%i %i 2 1\",
-\". c #000000\",
-\"* c #00ff00\"," size size)
- (barnsley-lines arr size) "};") 'xpm t)))
-
-(defun barnsley (size scale max-iter)
- "Plot the Barnsley fern."
- (let ((arr (make-array size))
- (p (cons 0 0)))
- (dotimes (it max-iter)
- (setq p (barnsley-next p))
- (setq x (round (+ (/ size 2) (* scale (car p)))))
- (setq y (round (- size (* scale (cdr p)) 1)))
- (setf (elt (elt arr y) x) 1))
- (barnsley-show arr size)))
-
-(barnsley 400 35 100000)
diff --git a/Task/Base64-decode-data/Ada/base64-decode-data.ada b/Task/Base64-decode-data/Ada/base64-decode-data.ada
deleted file mode 100644
index 8c35fb5a21..0000000000
--- a/Task/Base64-decode-data/Ada/base64-decode-data.ada
+++ /dev/null
@@ -1,14 +0,0 @@
-with Ada.Text_IO;
-
-with AWS.Translator;
-
-procedure Decode_AWS is
- Input : constant String :=
- "VG8gZXJyIGlzIGh1bWFuLCBidXQgdG8gcmVhbGx5IGZvdWwgdGhpbmdzIHVw" &
- "IHlvdSBuZWVkIGEgY29tcHV0ZXIuCiAgICAtLSBQYXVsIFIuIEVocmxpY2g=";
- Result : constant String := AWS.Translator.Base64_Decode (Input);
-begin
- Ada.Text_IO.Put_Line (Input);
- Ada.Text_IO.New_Line;
- Ada.Text_IO.Put_Line (Result);
-end Decode_AWS;
diff --git a/Task/Base64-decode-data/Haxe/base64-decode-data.haxe b/Task/Base64-decode-data/Haxe/base64-decode-data.haxe
deleted file mode 100644
index bcba8367c2..0000000000
--- a/Task/Base64-decode-data/Haxe/base64-decode-data.haxe
+++ /dev/null
@@ -1,9 +0,0 @@
-class Main {
- static function main() {
- var data = "VG8gZXJyIGlzIGh1bWFuLCBidXQgdG8gcmVhbGx5IGZvdWwgdGhpbmdzIHVw" +
- "IHlvdSBuZWVkIGEgY29tcHV0ZXIuCiAgICAtLSBQYXVsIFIuIEVocmxpY2g=";
- Sys.println('$data\n');
- var decoded = haxe.crypto.Base64.decode(data);
- Sys.println(decoded);
- }
-}
diff --git a/Task/Base64-decode-data/M2000-Interpreter/base64-decode-data-1.m2000 b/Task/Base64-decode-data/M2000-Interpreter/base64-decode-data-1.m2000
index 5ede834f8d..1229d1d3e8 100644
--- a/Task/Base64-decode-data/M2000-Interpreter/base64-decode-data-1.m2000
+++ b/Task/Base64-decode-data/M2000-Interpreter/base64-decode-data-1.m2000
@@ -5,7 +5,7 @@ uCiAgICAtLSBQYXVsIFIuIEVocmxpY2g=
}
tmp$=tempname$
open tmp$ for wide output as #f
- print #f, string$(inp$ as decode64);
+ print #f, string$(inp$ as decode64);
close #f
document a$
load.doc a$, tmp$
diff --git a/Task/Base64-decode-data/Swift/base64-decode-data.swift b/Task/Base64-decode-data/Swift/base64-decode-data.swift
index 88b8b847f8..bc056552f2 100644
--- a/Task/Base64-decode-data/Swift/base64-decode-data.swift
+++ b/Task/Base64-decode-data/Swift/base64-decode-data.swift
@@ -6,5 +6,5 @@ VG8gZXJyIGlzIGh1bWFuLCBidXQgdG8gcmVhbGx5IGZvdWwgdGhpbmdzIHVwIHlvdSBuZWVkIGEgY29t
if let decoded = Data(base64Encoded: input),
let str = String(data: decoded, encoding: .utf8) {
- print( str )
+ print( str )
}
diff --git a/Task/Base64-decode-data/Zkl/base64-decode-data-1.zkl b/Task/Base64-decode-data/Zkl/base64-decode-data-1.zkl
index d8d7d8dc96..365675c755 100644
--- a/Task/Base64-decode-data/Zkl/base64-decode-data-1.zkl
+++ b/Task/Base64-decode-data/Zkl/base64-decode-data-1.zkl
@@ -1,7 +1,7 @@
var [const] MsgHash=Import("zklMsgHash"), Curl=Import("zklCurl");
icon:=Curl().get("http://rosettacode.org/favicon.ico"); //-->(Data(4,331),693,0)
-icon=icon[0][icon[1],*]; // remove header
+icon=icon[0][icon[1],*]; // remove header
iconEncoded:=MsgHash.base64encode(icon);
iconDecoded:=MsgHash.base64decode(iconEncoded);
File("rosettaCodeIcon.ico","wb").write(iconDecoded); # eyeball checking says good
diff --git a/Task/Bell-numbers/ANSI-BASIC/bell-numbers.basic b/Task/Bell-numbers/ANSI-BASIC/bell-numbers.basic
index f164dbfea7..b2d2b6c711 100644
--- a/Task/Bell-numbers/ANSI-BASIC/bell-numbers.basic
+++ b/Task/Bell-numbers/ANSI-BASIC/bell-numbers.basic
@@ -1,7 +1,7 @@
100 REM Bell numbers
-110 LET MaxN = 14
-120 OPTION BASE 0
-130 DIM A(13) ! i.e. DIM A(MaxN - 1), ANSI BASIC does not allow expressions in the bound arguments.
+110 OPTION BASE 0
+120 DIM A(13)
+130 LET MaxN = UBOUND(A) + 1
140 FOR I = 0 TO MaxN - 1
150 LET A(I) = 0
160 NEXT I
diff --git a/Task/Bell-numbers/Ada/bell-numbers.ada b/Task/Bell-numbers/Ada/bell-numbers.ada
deleted file mode 100644
index ffb0e2190e..0000000000
--- a/Task/Bell-numbers/Ada/bell-numbers.ada
+++ /dev/null
@@ -1,59 +0,0 @@
-with Ada.Text_IO; use Ada.Text_IO;
-procedure Main is
- type Bell_Triangle is array(Positive range <>, Positive range <>) of Natural;
-
-
- procedure Print_Rows (Row : in Positive; Triangle : in Bell_Triangle) is
- begin
- if Row in Triangle'Range(1) then
- for I in Triangle'First(1) .. Row loop
- Put_Line (Triangle (I, 1)'Image);
- end loop;
- end if;
- end Print_Rows;
-
- procedure Print_Triangle (Num : in Positive; Triangle : in Bell_Triangle) is
- begin
- if Num in Triangle'Range then
- for I in Triangle'First(1) .. Num loop
- for J in Triangle'First(2) .. Num loop
- if Triangle (I, J) /= 0 then
- Put (Triangle (I, J)'Image);
- end if;
- end loop;
- New_Line;
- end loop;
- end if;
- end Print_Triangle;
-
- procedure Bell_Numbers is
- Triangle : Bell_Triangle(1..15, 1..15) := (Others => (Others => 0));
- Temp : Positive := 1;
- begin
-
- Triangle (1, 1) := 1;
-
- for I in Triangle'First(1) + 1 .. Triangle'Last(1) loop
- Triangle (I, 1) := Temp;
-
- for J in Triangle'First(2) .. Triangle'Last(2) - 1 loop
- if Triangle (I - 1, J) /= 0 then
- Triangle (I, J + 1) := Triangle (I, J) + Triangle (I - 1, J);
- else
- Temp := Triangle (I, J);
- exit;
- end if;
- end loop;
- end loop;
-
- Put_Line ("First 15 Bell numbers:");
- Print_Rows (15, Triangle);
-
- New_Line;
-
- Put_Line ("First 10 rows of the Bell triangle:");
- Print_Triangle (10, Triangle);
- end Bell_Numbers;
-begin
- Bell_Numbers;
-end Main;
diff --git a/Task/Bell-numbers/Pascal/bell-numbers.pas b/Task/Bell-numbers/Pascal/bell-numbers.pas
deleted file mode 100644
index 731ee0520a..0000000000
--- a/Task/Bell-numbers/Pascal/bell-numbers.pas
+++ /dev/null
@@ -1,121 +0,0 @@
-program BellNumbers;
-{$Ifdef FPC}
- {$optimization on,all}
-{$ElseIf}
- {Apptype console}
-{$EndIf}
-uses
- sysutils,gmp;
-var
- T0 :TDateTime;
-procedure BellNumbersUint64(OnlyBellNumbers:Boolean);
-var
- BList : array[0..24] of Uint64;
- BellNum : Uint64;
- BListLenght,i :nativeUInt;
-begin
- IF OnlyBellNUmbers then
- Begin
- writeln('Bell triangles ');
- writeln(' 1 = 1');
- end
- else
- Begin
- writeln('Bell numbers');
- writeln(' 1 = 1');
- writeln(' 2 = 1');
- end;
-
- BList[0]:= 1;
- BListLenght := 1;
- BellNum := 1;
- repeat
-// For i := BListLenght downto 1 do BList[i] := BList[i-1]; or
- move(Blist[0],Blist[1],BListLenght*SizeOf(Blist[0]));
- BList[0] := BellNum;
- For i := 1 to BListLenght do
- Begin
- BellNum += BList[i];
- BList[i] := BellNum;
- end;
-
-// Output
- IF OnlyBellNUmbers then
- Begin
- IF BListLenght<=9 then
- Begin
- write(BListLenght+1:3,' = ');
- For i := 0 to BListLenght do
- write(BList[i]:7);
- writeln;
- end
- ELSE
- BREAK;
- end
- else
- writeln(BListLenght+2:3,' = ',BellNum);
-
- inc(BListLenght);
- until BListLenght >= 25;
- writeln;
-end;
-
-procedure BellNumbersMPInteger;
-const
- MaxIndex = 5000;//must be > 0
-var
-//MPInteger as alternative to mpz_t -> selfcleaning
- BList : array[0..MaxIndex] of MPInteger;
- BellNum : MPInteger;
- BListLenght,i :nativeUInt;
- BellNumStr : AnsiString;
-Begin
- BellNumStr := '';
- z_init(BellNum);
- z_ui_pow_ui(BellNum,10,32767);
- BListLenght := z_size(BellNum);
- writeln('init length ',BListLenght);
- For i := 0 to MaxIndex do
- Begin
-// z_init2_set(BList[i],BListLenght);
- z_add_ui( BList[i],i);
- end;
- writeln('init length ',z_size(BList[0]));
-
- T0 := now;
- BListLenght := 1;
- z_set_ui(BList[0],1);
- z_set_ui(BellNum,1);
- repeat
- //Move does not fit moving interfaces // call fpc_intf_assign
- For i := BListLenght downto 1 do BList[i] := BList[i-1];
- z_set(BList[0],BellNum);
- For i := 1 to BListLenght do
- Begin
- BellNum := z_add(BellNum,BList[i]);
- z_set(BList[i],BellNum);
- end;
- inc(BListLenght);
- if (BListLenght+1) MOD 100 = 0 then
- Begin
- BellNumStr:= z_get_str(10,BellNum);
- //z_sizeinbase (BellNum, 10) is not exact :-(
- write('Bell(',(IntToStr(BListLenght)):6,') has ',
- (IntToStr(Length(BellNumStr))):6,' decimal digits');
- writeln(FormatDateTime(' NN:SS.ZZZ',now-T0),'s');
- end;
- until BListLenght>=MaxIndex;
- BellNumStr:= z_get_str(10,BellNum);
- writeln(BListLenght:6,'.th ',Length(BellNumStr):8);
-
-//clean up ;-)
- BellNumStr := '';
- z_clear(BellNum);
- For i := MaxIndex downto 0 do
- z_clear(BList[i]);
-end;
-
-BEGIN
- BellNumbersUint64(True);BellNumbersUint64(False);
- BellNumbersMPInteger;
-END.
diff --git a/Task/Benfords-law/Ada/benfords-law-1.ada b/Task/Benfords-law/Ada/benfords-law-1.ada
deleted file mode 100644
index b11e243437..0000000000
--- a/Task/Benfords-law/Ada/benfords-law-1.ada
+++ /dev/null
@@ -1,49 +0,0 @@
-with Ada.Text_IO, Ada.Numerics.Generic_Elementary_Functions;
-
-procedure Benford is
-
- subtype Nonzero_Digit is Natural range 1 .. 9;
- function First_Digit(S: String) return Nonzero_Digit is
- (if S(S'First) in '1' .. '9'
- then Nonzero_Digit'Value(S(S'First .. S'First))
- else First_Digit(S(S'First+1 .. S'Last)));
-
- package N_IO is new Ada.Text_IO.Integer_IO(Natural);
-
- procedure Print(D: Nonzero_Digit; Counted, Sum: Natural) is
- package Math is new Ada.Numerics.Generic_Elementary_Functions(Float);
- package F_IO is new Ada.Text_IO.Float_IO(Float);
- Actual: constant Float := Float(Counted) / Float(Sum);
- Expected: constant Float := Math.Log(1.0 + 1.0 / Float(D), Base => 10.0);
- Deviation: constant Float := abs(Expected-Actual);
- begin
- N_IO.Put(D, 5);
- N_IO.Put(Counted, 14);
- F_IO.Put(Float(Sum)*Expected, Fore => 16, Aft => 1, Exp => 0);
- F_IO.Put(100.0*Actual, Fore => 9, Aft => 2, Exp => 0);
- F_IO.Put(100.0*Expected, Fore => 11, Aft => 2, Exp => 0);
- F_IO.Put(100.0*Deviation, Fore => 13, Aft => 2, Exp => 0);
- end Print;
-
- Cnt: array(Nonzero_Digit) of Natural := (1 .. 9 => 0);
- D: Nonzero_Digit;
- Sum: Natural := 0;
- Counter: Positive;
-
-begin
- while not Ada.Text_IO.End_Of_File loop
- -- each line in the input file holds Counter, followed by Fib(Counter)
- N_IO.Get(Counter);
- -- Counter and skip it, we just don't need it
- D := First_Digit(Ada.Text_IO.Get_Line);
- -- read the rest of the line and extract the first digit
- Cnt(D) := Cnt(D)+1;
- Sum := Sum + 1;
- end loop;
- Ada.Text_IO.Put_Line(" Digit Found[total] Expected[total] Found[%]"
- & " Expected[%] Difference[%]");
- for I in Nonzero_Digit loop
- Print(I, Cnt(I), Sum);
- Ada.Text_IO.New_Line;
- end loop;
-end Benford;
diff --git a/Task/Benfords-law/Ada/benfords-law-2.ada b/Task/Benfords-law/Ada/benfords-law-2.ada
deleted file mode 100644
index e041c0ce41..0000000000
--- a/Task/Benfords-law/Ada/benfords-law-2.ada
+++ /dev/null
@@ -1 +0,0 @@
- -- N_IO.Get(Counter);
diff --git a/Task/Benfords-law/EasyLang/benfords-law.easy b/Task/Benfords-law/EasyLang/benfords-law.easy
index 3a1d767aa2..7f84888fa7 100644
--- a/Task/Benfords-law/EasyLang/benfords-law.easy
+++ b/Task/Benfords-law/EasyLang/benfords-law.easy
@@ -1,7 +1,9 @@
func$ add a$ b$ .
- for i to higher len a$ len b$
+ if len a$ < len b$ : swap a$ b$
+ for i to len a$
a = number substr a$ i 1
- b = number substr b$ i 1
+ b = 0
+ if i <= len b$ : b = number substr b$ i 1
r = a + b + c
c = r div 10
r$ &= r mod 10
@@ -9,7 +11,6 @@ func$ add a$ b$ .
if c > 0 : r$ &= c
return r$
.
-#
len fibdist[] 9
proc mkfibdist .
# generate 1000 fibonacci numbers as
@@ -36,7 +37,7 @@ mkfibdist
len benfdist[] 9
proc mkbenfdist .
for i to 9
- benfdist[i] = log10 (1 + 1.0 / i)
+ benfdist[i] = log (1 + 1 / i) 10
.
.
mkbenfdist
diff --git a/Task/Benfords-law/PowerShell/benfords-law.psh b/Task/Benfords-law/PowerShell/benfords-law.psh
deleted file mode 100644
index 32add2876b..0000000000
--- a/Task/Benfords-law/PowerShell/benfords-law.psh
+++ /dev/null
@@ -1,16 +0,0 @@
-$url = "https://oeis.org/A000045/b000045.txt"
-$file = "$env:TEMP\FibonacciNumbers.txt"
-(New-Object System.Net.WebClient).DownloadFile($url, $file)
-
-$benford = Get-Content -Path $file |
- Select-Object -Skip 1 -First 1000 |
- ForEach-Object {(($_ -split " ")[1].ToString().ToCharArray())[0]} |
- Group-Object |
- Select-Object -Property @{Name="Digit" ; Expression={[int]($_.Name)}},
- Count,
- @{Name="Actual" ; Expression={$_.Count/1000}},
- @{Name="Expected"; Expression={[double]("{0:f5}" -f [Math]::Log10(1 + 1 / $_.Name))}}
-
-$benford | Sort-Object -Property Digit | Format-Table -AutoSize
-
-Remove-Item -Path $file -Force -ErrorAction SilentlyContinue
diff --git a/Task/Bernoulli-numbers/Ada/bernoulli-numbers.ada b/Task/Bernoulli-numbers/Ada/bernoulli-numbers.ada
deleted file mode 100644
index 2bcbe560fe..0000000000
--- a/Task/Bernoulli-numbers/Ada/bernoulli-numbers.ada
+++ /dev/null
@@ -1,32 +0,0 @@
-WITH GMP.Rationals, GMP.Integers, Ada.Text_IO, Ada.Strings.Fixed, Ada.Strings;
-USE GMP.Rationals, GMP.Integers, Ada.Text_IO, Ada.Strings.Fixed, Ada.Strings;
-
-PROCEDURE Main IS
-
- FUNCTION Bernoulli_Number (N : Natural) RETURN Unbounded_Fraction IS
- FUNCTION "/" (Left, Right : Natural) RETURN Unbounded_Fraction IS
- (To_Unbounded_Integer (Left) / To_Unbounded_Integer (Right));
- A : ARRAY (0 .. N) OF Unbounded_Fraction;
- BEGIN
- FOR M IN 0 .. N LOOP
- A (M) := 1 / (M + 1);
- FOR J IN REVERSE 1 .. M LOOP
- A (J - 1) := (J / 1 ) * (A (J - 1) - A (J));
- END LOOP;
- END LOOP;
- RETURN A (0);
- END Bernoulli_Number;
-
-BEGIN
- FOR I IN 0 .. 60 LOOP
- IF I MOD 2 = 0 OR I = 1 THEN
- DECLARE
- B : Unbounded_Fraction := Bernoulli_Number (I);
- S : String := Image (GMP.Rationals.Numerator (B));
- BEGIN
- Put_Line ("B (" & (IF I < 10 THEN " " ELSE "") & Trim (I'Img, Left)
- & ")=" & (44 - S'Length) * " " & Image (B));
- END;
- END IF;
- END LOOP;
-END Main;
diff --git a/Task/Bernoulli-numbers/REXX/bernoulli-numbers.rexx b/Task/Bernoulli-numbers/REXX/bernoulli-numbers.rexx
index 83184fac1f..0fa77e3ed1 100644
--- a/Task/Bernoulli-numbers/REXX/bernoulli-numbers.rexx
+++ b/Task/Bernoulli-numbers/REXX/bernoulli-numbers.rexx
@@ -1,5 +1,5 @@
--- 30 Jul 2025
-include Settings
+-- 23 Aug 2025
+include Setting
numeric digits 16
arg xx
if xx = '' then
@@ -10,29 +10,25 @@ say 'BERNOULLI NUMBERS'
say version
say
-call Time('r')
call Rational1 xx
if ss then
call ShowFractions xx
-call Timer
+call Timer 'R'
-call Time('r')
call Rational2 xx
if ss then
call ShowFractions xx
-call Timer
+call Timer 'R'
-call Time('r')
call Decimal1 xx
if ss then
call ShowDecimals xx
-call Timer
+call Timer 'R'
-call Time('r')
call Decimal2 xx
if ss then
call ShowDecimals xx
-call Timer
+call Timer 'R'
exit
Rational1:
diff --git a/Task/Best-shuffle/Ada/best-shuffle.ada b/Task/Best-shuffle/Ada/best-shuffle.ada
deleted file mode 100644
index 37b1b32286..0000000000
--- a/Task/Best-shuffle/Ada/best-shuffle.ada
+++ /dev/null
@@ -1,50 +0,0 @@
-with Ada.Text_IO;
-with Ada.Strings.Unbounded;
-
-procedure Best_Shuffle is
-
- function Best_Shuffle (S : String) return String;
-
- function Best_Shuffle (S : String) return String is
- T : String (S'Range) := S;
- Tmp : Character;
- begin
- for I in S'Range loop
- for J in S'Range loop
- if I /= J and S (I) /= T (J) and S (J) /= T (I) then
- Tmp := T (I);
- T (I) := T (J);
- T (J) := Tmp;
- end if;
- end loop;
- end loop;
- return T;
- end Best_Shuffle;
-
- Test_Cases : constant array (1 .. 6)
- of Ada.Strings.Unbounded.Unbounded_String :=
- (Ada.Strings.Unbounded.To_Unbounded_String ("abracadabra"),
- Ada.Strings.Unbounded.To_Unbounded_String ("seesaw"),
- Ada.Strings.Unbounded.To_Unbounded_String ("elk"),
- Ada.Strings.Unbounded.To_Unbounded_String ("grrrrrr"),
- Ada.Strings.Unbounded.To_Unbounded_String ("up"),
- Ada.Strings.Unbounded.To_Unbounded_String ("a"));
-
-begin -- main procedure
- for Test_Case in Test_Cases'Range loop
- declare
- Original : constant String := Ada.Strings.Unbounded.To_String
- (Test_Cases (Test_Case));
- Shuffle : constant String := Best_Shuffle (Original);
- Score : Natural := 0;
- begin
- for I in Original'Range loop
- if Original (I) = Shuffle (I) then
- Score := Score + 1;
- end if;
- end loop;
- Ada.Text_IO.Put_Line (Original & ", " & Shuffle & ", (" &
- Natural'Image (Score) & " )");
- end;
- end loop;
-end Best_Shuffle;
diff --git a/Task/Best-shuffle/Elena/best-shuffle.elena b/Task/Best-shuffle/Elena/best-shuffle.elena
index 2cbdf0b886..19abfc3e25 100644
--- a/Task/Best-shuffle/Elena/best-shuffle.elena
+++ b/Task/Best-shuffle/Elena/best-shuffle.elena
@@ -35,7 +35,7 @@ extension op
}
}
-public program()
+public Program()
{
new string[]{"abracadabra", "seesaw", "grrrrrr", "pop", "up", "a"}.forEach::(s)
{
diff --git a/Task/Best-shuffle/PowerShell/best-shuffle-1.psh b/Task/Best-shuffle/PowerShell/best-shuffle-1.psh
deleted file mode 100644
index 0bab21590c..0000000000
--- a/Task/Best-shuffle/PowerShell/best-shuffle-1.psh
+++ /dev/null
@@ -1,52 +0,0 @@
-# Calculate best possible shuffle score for a given string
-# (Split out into separate function so we can use it separately in our output)
-function Get-BestScore ( [string]$String )
- {
- # Convert to array of characters, group identical characters,
- # sort by frequecy, get size of first group
- $MostRepeats = $String.ToCharArray() |
- Group |
- Sort Count -Descending |
- Select -First 1 -ExpandProperty Count
-
- # Return count of most repeated character minus all other characters (math simplified)
- return [math]::Max( 0, 2 * $MostRepeats - $String.Length )
- }
-
-function Get-BestShuffle ( [string]$String )
- {
- # Convert to arrays of characters, one for comparison, one for manipulation
- $S1 = $String.ToCharArray()
- $S2 = $String.ToCharArray()
-
- # Calculate best possible score as our goal
- $BestScore = Get-BestScore $String
-
- # Unshuffled string has score equal to number of characters
- $Length = $String.Length
- $Score = $Length
-
- # While still striving for perfection...
- While ( $Score -gt $BestScore )
- {
- # For each character
- ForEach ( $i in 0..($Length-1) )
- {
- # If the shuffled character still matches the original character...
- If ( $S1[$i] -eq $S2[$i] )
- {
- # Swap it with a random character
- # (Random character $j may be the same as or may even be
- # character $i. The minor impact on speed was traded for
- # a simple solution to guarantee randomness.)
- $j = Get-Random -Maximum $Length
- $S2[$i], $S2[$j] = $S2[$j], $S2[$i]
- }
- }
- # Count the number of indexes where the two arrays match
- $Score = ( 0..($Length-1) ).Where({ $S1[$_] -eq $S2[$_] }).Count
- }
- # Put it back into a string
- $Shuffle = ( [string[]]$S2 -join '' )
- return $Shuffle
- }
diff --git a/Task/Best-shuffle/PowerShell/best-shuffle-2.psh b/Task/Best-shuffle/PowerShell/best-shuffle-2.psh
deleted file mode 100644
index 3a491b67ff..0000000000
--- a/Task/Best-shuffle/PowerShell/best-shuffle-2.psh
+++ /dev/null
@@ -1,6 +0,0 @@
-ForEach ( $String in ( 'abracadabra', 'seesaw', 'elk', 'grrrrrr', 'up', 'a' ) )
- {
- $Shuffle = Get-BestShuffle $String
- $Score = Get-BestScore $String
- "$String, $Shuffle, ($Score)"
- }
diff --git a/Task/Best-shuffle/VBScript/best-shuffle.vb b/Task/Best-shuffle/VBScript/best-shuffle.vb
deleted file mode 100644
index 8d21c6236c..0000000000
--- a/Task/Best-shuffle/VBScript/best-shuffle.vb
+++ /dev/null
@@ -1,52 +0,0 @@
-'Best Shuffle Task
-'VBScript Implementation
-
-Function bestshuffle(s)
- Dim arr:Redim arr(Len(s)-1)
-
- 'The Following Does the toCharArray() Functionality
- For i = 0 To Len(s)-1
- arr(i) = Mid(s, i + 1, 1)
- Next
-
- arr = shuffler(arr) 'Make this line a comment for deterministic solution
- For i = 0 To UBound(arr):Do
- If arr(i) <> Mid(s, i + 1, 1) Then Exit Do
- For j = 0 To UBound(arr)
- If arr(i) <> arr(j) And arr(i) <> Mid(s, j + 1, 1) And arr(j) <> Mid(s, i + 1, 1) Then
- tmp = arr(i)
- arr(i) = arr(j)
- arr(j) = tmp
- End If
- Next
- Loop While False:Next
-
- shuffled_word = Join(arr,"")
-
- 'This section is the scorer
- score = 0
- For k = 1 To Len(s)
- If Mid(s,k,1) = Mid(shuffled_word,k,1) Then
- score = score + 1
- End If
- Next
-
- bestshuffle = shuffled_word & ",(" & score & ")"
-End Function
-
-Function shuffler(array)
- Set rand = CreateObject("System.Random")
- For i = UBound(array) to 0 Step -1
- r = rand.next_2(0, i + 1)
- tmp = array(i)
- array(i) = array(r)
- array(r) = tmp
- Next
- shuffler = array
-End Function
-
-'Testing the function
-word_list = Array("abracadabra","seesaw","elk","grrrrrr","up","a")
-For Each word In word_list
- WScript.StdOut.WriteLine word & "," & bestshuffle(word)
-Next
diff --git a/Task/Bifid-cipher/Ada/bifid-cipher.ada b/Task/Bifid-cipher/Ada/bifid-cipher.ada
deleted file mode 100644
index c066bfefe4..0000000000
--- a/Task/Bifid-cipher/Ada/bifid-cipher.ada
+++ /dev/null
@@ -1,30 +0,0 @@
--- Bifid cipher
--- J. Carter 2023 May
--- The Bifid cipher is included as part of the PragmAda Reusable Components (https://github.com/jrcarter/PragmARC)
-
-with Ada.Text_IO;
-with PragmARC.Encryption.Bifid;
-
-procedure Bifid_Test is
- package Bifid renames PragmARC.Encryption.Bifid;
-
- Key_1 : constant Bifid.Square_Layout := ("ABCDE", "FGHIK", "LMNOP", "QRSTU", "VWXYZ");
- Key_2 : constant Bifid.Square_Layout := ("BGWKZ", "QPNDS", "IOAXE", "FCLUM", "THYVR");
-
- Msg_1 : constant String := "ATTACKATDAWN";
- Msg_2 : constant String := "FLEEATONCE";
- Msg_3 : constant String := "THEINVASIONWILLSTARTONTHEFIRSTOFJANUARY";
-
- Crypt_1 : String (Msg_1'Range);
- Crypt_2 : String (Msg_2'Range);
- Crypt_3 : String (Msg_3'Range);
-begin -- Bifid_Test
- Crypt_1 := Bifid.Encrypt (Msg_1, Key_1);
- Ada.Text_IO.Put_Line (Item => Msg_1 & " => " & Crypt_1 & " => " & Bifid.Decrypt (Crypt_1, Key_1) );
- Crypt_2 := Bifid.Encrypt (Msg_2, Key_2);
- Ada.Text_IO.Put_Line (Item => Msg_2 & " => " & Crypt_2 & " => " & Bifid.Decrypt (Crypt_2, Key_2) );
- Crypt_1 := Bifid.Encrypt (Msg_1, Key_2);
- Ada.Text_IO.Put_Line (Item => Msg_1 & " => " & Crypt_1 & " => " & Bifid.Decrypt (Crypt_1, Key_2) );
- Crypt_3 := Bifid.Encrypt (Msg_3, Key_2);
- Ada.Text_IO.Put_Line (Item => Msg_3 & " => " & Crypt_3 & " => " & Bifid.Decrypt (Crypt_3, Key_2) );
-end Bifid_Test;
diff --git a/Task/Bifid-cipher/Jq/bifid-cipher-2.jq b/Task/Bifid-cipher/Jq/bifid-cipher-2.jq
index 9d4b6f076c..6eabe468da 100644
--- a/Task/Bifid-cipher/Jq/bifid-cipher-2.jq
+++ b/Task/Bifid-cipher/Jq/bifid-cipher-2.jq
@@ -48,7 +48,7 @@ def task:
| ($encrypted | decrypt(polys[$i] )) as $decrypted
| "Message : \(.)",
"Encrypted : \($encrypted)",
- "Decrypted : \($decrypted)"
+ "Decrypted : \($decrypted)",
"" ;
task
diff --git a/Task/Bifid-cipher/Phix/bifid-cipher.phix b/Task/Bifid-cipher/Phix/bifid-cipher.phix
index 57af305806..e1aa112fda 100644
--- a/Task/Bifid-cipher/Phix/bifid-cipher.phix
+++ b/Task/Bifid-cipher/Phix/bifid-cipher.phix
@@ -1,41 +1,39 @@
-(phixonline)-->
- with javascript_semantics
- enum encrypt , decrypt
- function bifid ( string msg , polybius , sequence p , integer n , ed )
- string res = ""
- sequence dx = {}, dy = {}, dxy
- for i = 1 to length ( msg ) do
- integer k = find ( msg [ i ], polybius )- 1
- dx &= floor ( k / n )+ 1
- dy &= remainder ( k , n )+ 1
- end for
- if ed = encrypt then
- dxy = split_by ( dx & dy , 2 )
- else
- -- "simply reversing these steps" - yeah, right...
- dxy = columnize ( split_by ( flatten ( columnize ({ dx , dy })), length ( dx )))
- end if
- for i = 1 to length ( dxy ) do
- integer { x , y } = dxy [ i ]
- res &= p [ x ][ y ]
- end for
- return res
- end function
+with javascript_semantics
+enum encrypt,decrypt
+function bifid(string msg, polybius, sequence p, integer n, ed)
+ string res = ""
+ sequence dx = {}, dy = {}, dxy
+ for i=1 to length(msg) do
+ integer k = find(msg[i],polybius)-1
+ dx &= floor(k/n)+1
+ dy &= remainder(k,n)+1
+ end for
+ if ed=encrypt then
+ dxy = split_by(dx&dy,2)
+ else
+ -- "simply reversing these steps" - yeah, right...
+ dxy = columnize(split_by(flatten(columnize({dx,dy})),length(dx)))
+ end if
+ for i=1 to length(dxy) do
+ integer {x,y} = dxy[i]
+ res &= p[x][y]
+ end for
+ return res
+end function
- procedure test ( string msg , polybius )
- integer n = sqrt ( length ( polybius ))
- if n = 5 then msg = substitute ( upper ( msg ), "J" , "I" ) end if
- sequence p = split_by ( polybius , n )
- string enc = bifid ( msg , polybius , p , n , encrypt ),
- dec = bifid ( enc , polybius , p , n , decrypt )
- printf ( 1 , "For %dx%d polybius %s\n\n" ,{ n , n , join ( p , "\n " )})
- printf ( 1 , "Message : %s\nEncrypted: %s\nDecrypted: %s\n\n" ,{ msg , enc , dec })
- end procedure
+procedure test(string msg, polybius)
+ integer n = sqrt(length(polybius))
+ if n=5 then msg = substitute(upper(msg),"J","I") end if
+ sequence p = split_by(polybius,n)
+ string enc = bifid(msg,polybius,p,n,encrypt),
+ dec = bifid(enc,polybius,p,n,decrypt)
+ printf(1,"For %dx%d polybius %s\n\n",{n,n,join(p,"\n ")})
+ printf(1,"Message : %s\nEncrypted: %s\nDecrypted: %s\n\n",{msg,enc,dec})
+end procedure
- constant polybii = { tagstart ( 'A' , 'J' - 'A' )& tagstart ( 'K' , 'Z' - 'J' ),
- "BGWKZQPNDSIOAXEFCLUMTHYVR" ,
- " ." & tagstart ( 'A' , 26 )& tagstart ( 'a' , 26 )& tagstart ( '0' , 10 )},
- messages = { "ATTACKATDAWN" , "FLEEATONCE" ,
- "The invasion will start on the first of January 2023." }
- for t = 1 to 3 do test ( messages [ t ], polybii [ t ]) end for
-
- with javascript_semantics
- function bin_it ( sequence limits , data )
- -- Bin data according to (ascending) limits.
- sequence bins = repeat ( 0 , length ( limits )+ 1 ) -- adds under/over range bins too
- for i = 1 to length ( data ) do
- integer bdx = binary_search ( data [ i ], limits )
- bdx = abs ( bdx )+( bdx > 0 )
- bins [ bdx ] += 1
- end for
- return bins
- end function
+with javascript_semantics
+function bin_it(sequence limits, data)
+ -- Bin data according to (ascending) limits.
+ sequence bins = repeat(0,length(limits)+1) -- adds under/over range bins too
+ for i=1 to length(data) do
+ integer bdx = binary_search(data[i],limits)
+ bdx = abs(bdx)+(bdx>0)
+ bins[bdx] += 1
+ end for
+ return bins
+end function
- procedure bin_print ( sequence limits , bins )
- printf ( 1 , " < %3d := %3d\n" ,{ limits [ 1 ], bins [ 1 ]})
- for i = 2 to length ( limits ) do
- printf ( 1 , ">= %3d and < %3d := %3d\n" ,{ limits [ i - 1 ], limits [ i ], bins [ i ]})
- end for
- printf ( 1 , ">= %3d := %3d\n\n" ,{ limits [$], bins [$]})
- end procedure
+procedure bin_print(sequence limits, bins)
+ printf(1," < %3d := %3d\n",{limits[1],bins[1]})
+ for i=2 to length(limits) do
+ printf(1,">= %3d and < %3d := %3d\n",{limits[i-1],limits[i],bins[i]})
+ end for
+ printf(1,">= %3d := %3d\n\n",{limits[$],bins[$]})
+end procedure
- sequence limits , data
- printf ( 1 , "Example 1:\n" )
- limits = { 23 , 37 , 43 , 53 , 67 , 83 }
- data = { 95 , 21 , 94 , 12 , 99 , 4 , 70 , 75 , 83 , 93 , 52 , 80 , 57 , 5 , 53 , 86 , 65 , 17 , 92 , 83 , 71 , 61 , 54 , 58 , 47 ,
- 16 , 8 , 9 , 32 , 84 , 7 , 87 , 46 , 19 , 30 , 37 , 96 , 6 , 98 , 40 , 79 , 97 , 45 , 64 , 60 , 29 , 49 , 36 , 43 , 55 }
- bin_print ( limits , bin_it ( limits , data ))
+sequence limits, data
+printf(1,"Example 1:\n")
+limits = {23, 37, 43, 53, 67, 83}
+data = {95,21,94,12,99,4,70,75,83,93,52,80,57,5,53,86,65,17,92,83,71,61,54,58,47,
+ 16, 8, 9,32,84,7,87,46,19,30,37,96,6,98,40,79,97,45,64,60,29,49,36,43,55}
+bin_print(limits, bin_it(limits, data))
- printf ( 1 , "Example 2:\n" )
- limits = { 14 , 18 , 249 , 312 , 389 , 392 , 513 , 591 , 634 , 720 }
- data = { 445 , 814 , 519 , 697 , 700 , 130 , 255 , 889 , 481 , 122 , 932 , 77 , 323 , 525 , 570 , 219 , 367 , 523 , 442 , 933 ,
- 416 , 589 , 930 , 373 , 202 , 253 , 775 , 47 , 731 , 685 , 293 , 126 , 133 , 450 , 545 , 100 , 741 , 583 , 763 , 306 ,
- 655 , 267 , 248 , 477 , 549 , 238 , 62 , 678 , 98 , 534 , 622 , 907 , 406 , 714 , 184 , 391 , 913 , 42 , 560 , 247 ,
- 346 , 860 , 56 , 138 , 546 , 38 , 985 , 948 , 58 , 213 , 799 , 319 , 390 , 634 , 458 , 945 , 733 , 507 , 916 , 123 ,
- 345 , 110 , 720 , 917 , 313 , 845 , 426 , 9 , 457 , 628 , 410 , 723 , 354 , 895 , 881 , 953 , 677 , 137 , 397 , 97 ,
- 854 , 740 , 83 , 216 , 421 , 94 , 517 , 479 , 292 , 963 , 376 , 981 , 480 , 39 , 257 , 272 , 157 , 5 , 316 , 395 ,
- 787 , 942 , 456 , 242 , 759 , 898 , 576 , 67 , 298 , 425 , 894 , 435 , 831 , 241 , 989 , 614 , 987 , 770 , 384 , 692 ,
- 698 , 765 , 331 , 487 , 251 , 600 , 879 , 342 , 982 , 527 , 736 , 795 , 585 , 40 , 54 , 901 , 408 , 359 , 577 , 237 ,
- 605 , 847 , 353 , 968 , 832 , 205 , 838 , 427 , 876 , 959 , 686 , 646 , 835 , 127 , 621 , 892 , 443 , 198 , 988 , 791 ,
- 466 , 23 , 707 , 467 , 33 , 670 , 921 , 180 , 991 , 396 , 160 , 436 , 717 , 918 , 8 , 374 , 101 , 684 , 727 , 749 }
- bin_print ( limits , bin_it ( limits , data ))
-
- with javascript_semantics
- string s = "abc"
- s = x"ef bb bf" -- explicit binary string (the utf8 BOM)
- s [ 2 ] = 0
- s [ 3 ] = 'z'
- if s = "\#EF\0z" then puts ( 1 , "ok\n" ) end if
- string t = s
- t [ 1 .. 2 ] = "xy" -- s remains unaltered
- ? t -- "xyz"
- t = "food" ? t
- t [ 2 .. 3 ] = 'e' ? t -- "feed"
- t [ 3 .. 2 ] = "ast" ? t -- "feasted"
- t [ 3 ..- 2 ] = "" ? t -- "fed"
- if length ( t )= 0 then puts ( 1 , "t is empty\n" ) end if
- if t != "" then puts ( 1 , "t is not empty\n" ) end if
- t = "be"
- t &= 't' ? t -- bet
- t = 'a' & t ? t -- abet
- ? t [ 2 .. 3 ] -- be
- ? substitute ( t , "be" , "bbo" ) -- abbot
- ? substitute ( t , "be" , "dep" ) -- adept
- t = substitute ( t , "be" , "dep" ) -- to actually modify t
- ? join ({ "abc" , "def" , "ghi" }) -- "abc def ghi"
- ? join ({ "abc" , "def" , "ghi" }, "" ) -- "abcdefghi"
- ? join ({ "abc" , "def" , "ghi" }, "\n" ) -- "abc\ndef\nghi"
- DNA
-
-{def base_count
- {def base_count.r
- {lambda {:dna :b :n :i :count}
- {if {> :i :n}
- then :count
- else {base_count.r :dna :b :n {+ :i 1}
- {if {W.equal? {W.get :i :dna} :b}
- then {+ :count 1}
- else :count}} }}}
- {lambda {:dna :b}
- {base_count.r :dna :b {- {W.length :dna} 1} 0 0} }}
--> base_count
-
-{def S {S.map {base_count {DNA}}} A C G T}}
--> S
-[A C G T] = (129 97 119 155)
-
-A+C+G+T = {+ {S}}
--> A+C+G+T = 500
diff --git a/Task/Bioinformatics-base-count/Lua/bioinformatics-base-count.lua b/Task/Bioinformatics-base-count/Lua/bioinformatics-base-count.lua
deleted file mode 100644
index 13dc7d2a11..0000000000
--- a/Task/Bioinformatics-base-count/Lua/bioinformatics-base-count.lua
+++ /dev/null
@@ -1,27 +0,0 @@
-function prettyprint(seq) -- approx DDBJ format
- seq = seq:gsub("%A",""):lower()
- local sums, n = { a=0, c=0, g=0, t=0 }, 1
- seq:gsub("(%a)", function(c) sums[c]=sums[c]+1 end)
- local function printf(s,...) io.write(s:format(...)) end
- printf("LOCUS AB000000 %12d bp mRNA linear HUM 01-JAN-2001\n", #seq)
- printf(" BASE COUNT %12d a %12d c %12d g %12d t\n", sums.a, sums.c, sums.g, sums.t)
- printf("ORIGIN\n")
- while n < #seq do
- local sub60 = seq:sub(n,n+59)
- printf("%9d %s\n", n, sub60:gsub("(..........)","%1 "))
- n = n + #sub60
- end
-end
-
-prettyprint[[
-CGTAAAAAATTACAACGTCCTTTGGCTATCTCTTAAACTCCTGCTAAATG
-CTCGTGCTTTCCAATTATGTAAGCGTTCCGAGACGGGGTGGTCGATTCTG
-AGGACAAAGGTCAAGATGGAGCGCATCGAACGCAATAAGGATCATTTGAT
-GGGACGTTTCGTCGACAAAGTCTTGTTTCGAGAGTAACGGCTACCGTCTT
-CGATTCTGCTTATAACACTATGTTCTTATGAAATGGATGTTCTGAGTTGG
-TCAGTCCCAATGTGCGGGGTTTCTTTTAGTACGTCGGGAGTGGTATTATA
-TTTAATTTTTCTATATAGCGATCTGTATTTAAGCAATTCATTTAGGTTAT
-CGCCGCGATGCTCGGTTCGGACCGCCAAGCATCTGGCTCCACTGCTAGTG
-TCCTAAATTTGAATGGCAAACACAAATAAGATTTAGCAATTCGTGTAGAC
-GACCGGGGACTTGCATGATGGGAGCAGCTTTGTTAAACTACGAACGTAAT
-]]
diff --git a/Task/Bioinformatics-base-count/M2000-Interpreter/bioinformatics-base-count.m2000 b/Task/Bioinformatics-base-count/M2000-Interpreter/bioinformatics-base-count.m2000
deleted file mode 100644
index ad0dda3e8e..0000000000
--- a/Task/Bioinformatics-base-count/M2000-Interpreter/bioinformatics-base-count.m2000
+++ /dev/null
@@ -1,39 +0,0 @@
-Module Bioinformatics_base_count (f){
- a$={
- CGTAAAAAATTACAACGTCCTTTGGCTATCTCTTAAACTCCTGCTAAATG
- CTCGTGCTTTCCAATTATGTAAGCGTTCCGAGACGGGGTGGTCGATTCTG
- AGGACAAAGGTCAAGATGGAGCGCATCGAACGCAATAAGGATCATTTGAT
- GGGACGTTTCGTCGACAAAGTCTTGTTTCGAGAGTAACGGCTACCGTCTT
- CGATTCTGCTTATAACACTATGTTCTTATGAAATGGATGTTCTGAGTTGG
- TCAGTCCCAATGTGCGGGGTTTCTTTTAGTACGTCGGGAGTGGTATTATA
- TTTAATTTTTCTATATAGCGATCTGTATTTAAGCAATTCATTTAGGTTAT
- CGCCGCGATGCTCGGTTCGGACCGCCAAGCATCTGGCTCCACTGCTAGTG
- TCCTAAATTTGAATGGCAAACACAAATAAGATTTAGCAATTCGTGTAGAC
- GACCGGGGACTTGCATGATGGGAGCAGCTTTGTTAAACTACGAACGTAAT
- }
- Data "A", "C","G","T"
- a$=filter$(a$," "+chr$(13)+chr$(10)+chr$(9))
- tot=len(a$)
- k=1
- print #f, "SEQUENCE:"
- for i=50 to len(a$) step 50
- Print #f, str$(k,"000: ");mid$(a$, k, 50)
- k=i
- next
- Print #f, "BASECOUNT:"
- while not empty
- read t$
- b$=filter$(a$, t$)
- Print #f, " "+t$+": ";len(a$)-len(b$)
- swap a$, b$
- end while
- Print #f, "Tot:";tot
-}
-
-open "" for wide output as #f
-Bioinformatics_base_count f
-close #f
-open "outtext.txt" for wide output as #f
-Bioinformatics_base_count f
-close #f
-win "outtext.txt"
diff --git a/Task/Bioinformatics-base-count/MATLAB/bioinformatics-base-count.m b/Task/Bioinformatics-base-count/MATLAB/bioinformatics-base-count.m
deleted file mode 100644
index 12c2f553f4..0000000000
--- a/Task/Bioinformatics-base-count/MATLAB/bioinformatics-base-count.m
+++ /dev/null
@@ -1,13 +0,0 @@
-function r = base_count(f)
- fid = fopen(f,'r');
- nn=[0,0,0,0];
- while ~feof(fid)
- s = fgetl(fid);
- fprintf(1,'%5d :%s\n', sum(nn), s(s=='A'|s=='C'|s=='G'|s=='T'));
- nn = nn+[sum(s=='A'),sum(s=='C'),sum(s=='G'),sum(s=='T')];
- end
- fclose(fid);
-
- fprintf(1, '\nBases:\n\n A : %d\n C : %d\n G : %d\n T : %d\n', nn);
- fprintf(1, '\nTotal: %d\n\n', sum(nn));
-end;
diff --git a/Task/Bioinformatics-base-count/Mathematica/bioinformatics-base-count.math b/Task/Bioinformatics-base-count/Mathematica/bioinformatics-base-count.math
deleted file mode 100644
index c4ace88df1..0000000000
--- a/Task/Bioinformatics-base-count/Mathematica/bioinformatics-base-count.math
+++ /dev/null
@@ -1,14 +0,0 @@
-seq = "CGTAAAAAATTACAACGTCCTTTGGCTATCTCTTAAACTCCTGCTAAATGCTCGTGCTTTCCA\
-ATTATGTAAGCGTTCCGAGACGGGGTGGTCGATTCTGAGGACAAAGGTCAAGATGGAGCGCATCGAACGC\
-AATAAGGATCATTTGATGGGACGTTTCGTCGACAAAGTCTTGTTTCGAGAGTAACGGCTACCGTCTTCGA\
-TTCTGCTTATAACACTATGTTCTTATGAAATGGATGTTCTGAGTTGGTCAGTCCCAATGTGCGGGGTTTC\
-TTTTAGTACGTCGGGAGTGGTATTATATTTAATTTTTCTATATAGCGATCTGTATTTAAGCAATTCATTT\
-AGGTTATCGCCGCGATGCTCGGTTCGGACCGCCAAGCATCTGGCTCCACTGCTAGTGTCCTAAATTTGAA\
-TGGCAAACACAAATAAGATTTAGCAATTCGTGTAGACGACCGGGGACTTGCATGATGGGAGCAGCTTTGT\
-TAAACTACGAACGTAAT";
-size = 70;
-parts = StringPartition[seq, UpTo[size]];
-begins = Most[Accumulate[Prepend[StringLength /@ parts, 1]]];
-ends = Rest[Accumulate[Prepend[StringLength /@ parts, 0]]];
-StringRiffle[MapThread[ToString[#1] <> "-" <> ToString[#2] <> ": " <> #3 &, {begins, ends, parts}], "\n"]
-StringRiffle[#1 <> ": " <> ToString[#2] & @@@ Tally[Characters[seq]], "\n"]
diff --git a/Task/Bioinformatics-base-count/Nim/bioinformatics-base-count.nim b/Task/Bioinformatics-base-count/Nim/bioinformatics-base-count.nim
deleted file mode 100644
index db0e61d7be..0000000000
--- a/Task/Bioinformatics-base-count/Nim/bioinformatics-base-count.nim
+++ /dev/null
@@ -1,59 +0,0 @@
-import strformat
-import strutils
-
-const Source = "CGTAAAAAATTACAACGTCCTTTGGCTATCTCTTAAACTCCTGCTAAATG" &
- "CTCGTGCTTTCCAATTATGTAAGCGTTCCGAGACGGGGTGGTCGATTCTG" &
- "AGGACAAAGGTCAAGATGGAGCGCATCGAACGCAATAAGGATCATTTGAT" &
- "GGGACGTTTCGTCGACAAAGTCTTGTTTCGAGAGTAACGGCTACCGTCTT" &
- "CGATTCTGCTTATAACACTATGTTCTTATGAAATGGATGTTCTGAGTTGG" &
- "TCAGTCCCAATGTGCGGGGTTTCTTTTAGTACGTCGGGAGTGGTATTATA" &
- "TTTAATTTTTCTATATAGCGATCTGTATTTAAGCAATTCATTTAGGTTAT" &
- "CGCCGCGATGCTCGGTTCGGACCGCCAAGCATCTGGCTCCACTGCTAGTG" &
- "TCCTAAATTTGAATGGCAAACACAAATAAGATTTAGCAATTCGTGTAGAC" &
- "GACCGGGGACTTGCATGATGGGAGCAGCTTTGTTAAACTACGAACGTAAT"
-
-# Enumeration type for bases.
-type Base* {.pure.} = enum A, C, G, T, Other = "other"
-
-proc display*(dnaSeq: string) =
- ## Display a DNA sequence using EMBL format.
-
- var counts: array[Base, Natural] # Count of bases.
- for c in dnaSeq:
- inc counts[parseEnum[Base]($c, Other)] # Use Other as default value.
-
- # Display the SQ line.
- var sqline = fmt"SQ {dnaSeq.len} BP; "
- for (base, count) in counts.pairs:
- sqline &= fmt"{count} {base}; "
- echo sqline
-
- # Display the sequence.
- var idx = 0
- var row = newStringOfCap(80)
- var remaining = dnaSeq.len
-
- while remaining > 0:
- row.setLen(0)
- row.add(" ")
-
- # Add groups of 10 bases.
- for group in 1..6:
- let nextIdx = idx + min(10, remaining)
- row.add(dnaSeq[idx..8}")
- echo row
-
- # Add termination.
- echo "//"
-
-
-when isMainModule:
- Source.display()
diff --git a/Task/Bioinformatics-base-count/Pascal/bioinformatics-base-count-1.pas b/Task/Bioinformatics-base-count/Pascal/bioinformatics-base-count-1.pas
deleted file mode 100644
index 541e8e1eca..0000000000
--- a/Task/Bioinformatics-base-count/Pascal/bioinformatics-base-count-1.pas
+++ /dev/null
@@ -1,77 +0,0 @@
-program DNA_Base_Count;
-{$IFDEF FPC}
- {$MODE DELPHI}//String = AnsiString
-{$ELSE}
- {$APPTYPE CONSOLE}
-{$ENDIF}
-const
- dna =
- 'CGTAAAAAATTACAACGTCCTTTGGCTATCTCTTAAACTCCTGCTAAATG' +
- 'CTCGTGCTTTCCAATTATGTAAGCGTTCCGAGACGGGGTGGTCGATTCTG' +
- 'AGGACAAAGGTCAAGATGGAGCGCATCGAACGCAATAAGGATCATTTGAT' +
- 'GGGACGTTTCGTCGACAAAGTCTTGTTTCGAGAGTAACGGCTACCGTCTT' +
- 'CGATTCTGCTTATAACACTATGTTCTTATGAAATGGATGTTCTGAGTTGG' +
- 'TCAGTCCCAATGTGCGGGGTTTCTTTTAGTACGTCGGGAGTGGTATTATA' +
- 'TTTAATTTTTCTATATAGCGATCTGTATTTAAGCAATTCATTTAGGTTAT' +
- 'CGCCGCGATGCTCGGTTCGGACCGCCAAGCATCTGGCTCCACTGCTAGTG' +
- 'TCCTAAATTTGAATGGCAAACACAAATAAGATTTAGCAATTCGTGTAGAC' +
- 'GACCGGGGACTTGCATGATGGGAGCAGCTTTGTTAAACTACGAACGTAAT';
-var
- CntIdx : array of NativeUint;
- DNABases : String;
- SumBaseTotal : NativeInt;
-
-procedure OutFormatBase(var DNA: String;colWidth:NativeInt);
-var
- j: NativeInt;
-Begin
- j := 0;
- Writeln(' DNA base sequence');
- While jx.key).Println.Sum(x->x.value);
-Print('total,',t);
diff --git a/Task/Bioinformatics-base-count/Perl/bioinformatics-base-count.pl b/Task/Bioinformatics-base-count/Perl/bioinformatics-base-count.pl
deleted file mode 100644
index 97668e2411..0000000000
--- a/Task/Bioinformatics-base-count/Perl/bioinformatics-base-count.pl
+++ /dev/null
@@ -1,28 +0,0 @@
-use strict;
-use warnings;
-use feature 'say';
-
-my %cnt;
-my $total = 0;
-
-while ($_ = ) {
- chomp;
- printf "%4d: %s\n", $total+1, s/(.{10})/$1 /gr;
- $total += length;
- $cnt{$_}++ for split //
-}
-
-say "\nTotal bases: $total";
-say "$_: " . ($cnt{$_}//0) for ;
-
-__DATA__
-CGTAAAAAATTACAACGTCCTTTGGCTATCTCTTAAACTCCTGCTAAATG
-CTCGTGCTTTCCAATTATGTAAGCGTTCCGAGACGGGGTGGTCGATTCTG
-AGGACAAAGGTCAAGATGGAGCGCATCGAACGCAATAAGGATCATTTGAT
-GGGACGTTTCGTCGACAAAGTCTTGTTTCGAGAGTAACGGCTACCGTCTT
-CGATTCTGCTTATAACACTATGTTCTTATGAAATGGATGTTCTGAGTTGG
-TCAGTCCCAATGTGCGGGGTTTCTTTTAGTACGTCGGGAGTGGTATTATA
-TTTAATTTTTCTATATAGCGATCTGTATTTAAGCAATTCATTTAGGTTAT
-CGCCGCGATGCTCGGTTCGGACCGCCAAGCATCTGGCTCCACTGCTAGTG
-TCCTAAATTTGAATGGCAAACACAAATAAGATTTAGCAATTCGTGTAGAC
-GACCGGGGACTTGCATGATGGGAGCAGCTTTGTTAAACTACGAACGTAAT
diff --git a/Task/Bioinformatics-base-count/Phix/bioinformatics-base-count.phix b/Task/Bioinformatics-base-count/Phix/bioinformatics-base-count.phix
deleted file mode 100644
index ff060d39d4..0000000000
--- a/Task/Bioinformatics-base-count/Phix/bioinformatics-base-count.phix
+++ /dev/null
@@ -1,24 +0,0 @@
-(phixonline)-->
- constant dna = substitute ( """
- CGTAAAAAATTACAACGTCCTTTGGCTATCTCTTAAACTCCTGCTAAATG
- CTCGTGCTTTCCAATTATGTAAGCGTTCCGAGACGGGGTGGTCGATTCTG
- AGGACAAAGGTCAAGATGGAGCGCATCGAACGCAATAAGGATCATTTGAT
- GGGACGTTTCGTCGACAAAGTCTTGTTTCGAGAGTAACGGCTACCGTCTT
- CGATTCTGCTTATAACACTATGTTCTTATGAAATGGATGTTCTGAGTTGG
- TCAGTCCCAATGTGCGGGGTTTCTTTTAGTACGTCGGGAGTGGTATTATA
- TTTAATTTTTCTATATAGCGATCTGTATTTAAGCAATTCATTTAGGTTAT
- CGCCGCGATGCTCGGTTCGGACCGCCAAGCATCTGGCTCCACTGCTAGTG
- TCCTAAATTTGAATGGCAAACACAAATAAGATTTAGCAATTCGTGTAGAC
- GACCGGGGACTTGCATGATGGGAGCAGCTTTGTTAAACTACGAACGTAAT
- """ , "\n" , "" )
- sequence acgt = repeat ( 0 , 5 )
- for i = 1 to length ( dna ) do
- acgt [ find ( dna [ i ], "ACGT" )] += 1
- end for
- acgt [$] = sum ( acgt )
- sequence s = split ( trim ( join_by ( split ( join_by ( dna , 1 , 10 , "" ), "\n" ), 1 , 5 , " " )), "\n" )
- for i = 1 to length ( s ) do
- printf ( 1 , "%3d: %s\n" ,{( i - 1 )* 50 + 1 , s [ i ]})
- end for
- printf ( 1 , "\nBase counts: A:%d, C:%d, G:%d, T:%d, total:%d\n" , acgt )
- $ )
-
- [ 0 swap
- [ dup $ "" != while
- cr over number$
- 4 justify echo$
- 5 times
- [ dup $ "" = iff
- conclude done
- sp
- 10 split swap echo$ ]
- dip [ 50 + ] again ]
- 2drop ] is prettyprint ( $ --> )
-
- [ stack ] is adenine ( --> s )
- [ stack ] is cytosine ( --> s )
- [ stack ] is guanine ( --> s )
- [ stack ] is thymine ( --> s )
-
- [ table
- adenine cytosine
- guanine thymine ] is bases ( --> [ )
-
- [ 4 times
- [ 0 i^ bases put ]
- witheach
- [ $ "ACGT" find bases
- 1 swap tally ]
- 4 times
- [ sp
- i^ bases dup echo
- sp share echo cr ]
- 0 4 times
- [ i^ bases take + ]
- cr say " total " echo ] is tallybases ( [ --> )
-
- $ "CGTAAAAAATTACAACGTCCTTTGGCTATCTCTTAAACTCCTGCTAAATG"
- $ "CTCGTGCTTTCCAATTATGTAAGCGTTCCGAGACGGGGTGGTCGATTCTG" join
- $ "AGGACAAAGGTCAAGATGGAGCGCATCGAACGCAATAAGGATCATTTGAT" join
- $ "GGGACGTTTCGTCGACAAAGTCTTGTTTCGAGAGTAACGGCTACCGTCTT" join
- $ "CGATTCTGCTTATAACACTATGTTCTTATGAAATGGATGTTCTGAGTTGG" join
- $ "TCAGTCCCAATGTGCGGGGTTTCTTTTAGTACGTCGGGAGTGGTATTATA" join
- $ "TTTAATTTTTCTATATAGCGATCTGTATTTAAGCAATTCATTTAGGTTAT" join
- $ "CGCCGCGATGCTCGGTTCGGACCGCCAAGCATCTGGCTCCACTGCTAGTG" join
- $ "TCCTAAATTTGAATGGCAAACACAAATAAGATTTAGCAATTCGTGTAGAC" join
- $ "GACCGGGGACTTGCATGATGGGAGCAGCTTTGTTAAACTACGAACGTAAT" join
-
- dup prettyprint cr cr tallybases
diff --git a/Task/Bioinformatics-base-count/R/bioinformatics-base-count.r b/Task/Bioinformatics-base-count/R/bioinformatics-base-count.r
deleted file mode 100644
index 7a6b6c1221..0000000000
--- a/Task/Bioinformatics-base-count/R/bioinformatics-base-count.r
+++ /dev/null
@@ -1,42 +0,0 @@
-#Data
-gene1 <- "CGTAAAAAATTACAACGTCCTTTGGCTATCTCTTAAACTCCTGCTAAATG
-CTCGTGCTTTCCAATTATGTAAGCGTTCCGAGACGGGGTGGTCGATTCTG
-AGGACAAAGGTCAAGATGGAGCGCATCGAACGCAATAAGGATCATTTGAT
-GGGACGTTTCGTCGACAAAGTCTTGTTTCGAGAGTAACGGCTACCGTCTT
-CGATTCTGCTTATAACACTATGTTCTTATGAAATGGATGTTCTGAGTTGG
-TCAGTCCCAATGTGCGGGGTTTCTTTTAGTACGTCGGGAGTGGTATTATA
-TTTAATTTTTCTATATAGCGATCTGTATTTAAGCAATTCATTTAGGTTAT
-CGCCGCGATGCTCGGTTCGGACCGCCAAGCATCTGGCTCCACTGCTAGTG
-TCCTAAATTTGAATGGCAAACACAAATAAGATTTAGCAATTCGTGTAGAC
-GACCGGGGACTTGCATGATGGGAGCAGCTTTGTTAAACTACGAACGTAAT"
-
-#Analysis:
-gene2 <- gsub("\n", "", gene1) #remove \n chars
-gene3 <- strsplit(gene2, split = character(0)) #split into list
-gene4 <- gene3[[1]] #pull out character vector from list
-basecounts <- as.data.frame(table(gene4)) #make table of base counts
-
-#quick helper function to print table results
-print_row <- function(df, row){paste0(df$gene[row],": ", df$Freq[row])}
-
-#Print Function for Data with Results:
-cat(" Data: \n",
- " 1:",substring(gene2, 1, 50),"\n",
- " 51:",substring(gene2, 51, 100),"\n",
- "101:",substring(gene2, 101, 150),"\n",
- "151:",substring(gene2, 151, 200),"\n",
- "201:",substring(gene2, 201, 250),"\n",
- "251:",substring(gene2, 251, 300),"\n",
- "301:",substring(gene2, 301, 350),"\n",
- "351:",substring(gene2, 351, 400),"\n",
- "401:",substring(gene2, 401, 450),"\n",
- "451:",substring(gene2, 451, 500),"\n",
- "\n",
- "Base Count Results: \n",
- print_row(basecounts,1), "\n",
- print_row(basecounts,2), "\n",
- print_row(basecounts,3), "\n",
- print_row(basecounts,4), "\n",
- "\n",
- "Total Base Count:", paste(length(gene4))
- )
diff --git a/Task/Bioinformatics-base-count/REXX/bioinformatics-base-count.rexx b/Task/Bioinformatics-base-count/REXX/bioinformatics-base-count.rexx
deleted file mode 100644
index 99c88e767b..0000000000
--- a/Task/Bioinformatics-base-count/REXX/bioinformatics-base-count.rexx
+++ /dev/null
@@ -1,36 +0,0 @@
-/*REXX program finds the number of each base in a DNA string */
-/* (along with a total). */
-Parse Arg dna .
-If dna==''|dna==',' Then
- dna='cgtaaaaaattacaacgtcctttggctatctcttaaactcctgctaaatg',
- 'ctcgtgctttccaattatgtaagcgttccgagacggggtggtcgattctg',
- 'aggacaaaggtcaagatggagcgcatcgaacgcaataaggatcatttgat',
- 'gggacgtttcgtcgacaaagtcttgtttcgagagtaacggctaccgtctt',
- 'cgattctgcttataacactatgttcttatgaaatggatgttctgagttgg',
- 'tcagtcccaatgtgcggggtttcttttagtacgtcgggagtggtattata',
- 'tttaatttttctatatagcgatctgtatttaagcaattcatttaggttat',
- 'cgccgcgatgctcggttcggaccgccaagcatctggctccactgctagtg',
- 'tcctaaatttgaatggcaaacacaaataagatttagcaattcgtgtagac',
- 'gaccggggacttgcatgatgggagcagctttgttaaactacgaacgtaat'
-dna=translate(space(dna,0)) /* elide blanks from DNA; uppercas*/
-Say '--------length of the DNA string: ' length(dna)
-count.=0 /* initialize the count for all bases*/
-w=1 /* the maximum width of a base count */
-names='' /* list of all names */
-Do j=1 To length(dna) /* traipse through the DNA string */
- name=substr(dna,j,1) /* obtain a base name from the DNA */
- If pos(name,names)==0 Then
- names=names||name /* if not found, add it to the list */
- count.name=count.name+1 /* bump the count of this base. */
- w=max(w,length(count.name)) /* compute the maximum number width */
- End
-Say
-Do k=0 To 255
- z=d2c(k) /* traipse through all possibilities */
- If pos(z,names)>0 Then Do
- Say ' base ' z ' has a basecount of: ' right(count.z,w)
- count.tot=count.tot+count.z /* add to a grand total to verify */
- End
- End
-Say
-Say '--------total for all basecounts:' right(count.tot,w+1)
diff --git a/Task/Bioinformatics-base-count/Racket/bioinformatics-base-count.rkt b/Task/Bioinformatics-base-count/Racket/bioinformatics-base-count.rkt
deleted file mode 100644
index b0614e6269..0000000000
--- a/Task/Bioinformatics-base-count/Racket/bioinformatics-base-count.rkt
+++ /dev/null
@@ -1,55 +0,0 @@
-#lang racket
-
-(define (fold-sequence seq kons #:finalise (finalise (λ x (apply values x))) . k0s)
- (define (recur seq . ks)
- (if (null? seq)
- (call-with-values (λ () (apply finalise ks)) (λ vs (apply values vs)))
- (call-with-values (λ () (apply kons (car seq) ks)) (λ ks+ (apply recur (cdr seq) ks+)))))
- (apply recur (if (string? seq) (string->list (regexp-replace* #px"[^ACGT]" seq "")) seq) k0s))
-
-(define (sequence->pretty-printed-string seq)
- (define (fmt idx cs-rev) (format "~a: ~a" (~a idx #:width 3 #:align 'right) (list->string (reverse cs-rev))))
- (fold-sequence
- seq
- (λ (b n start-idx lns-rev cs-rev)
- (if (zero? (modulo n 50))
- (values (+ n 1) n (if (pair? cs-rev) (cons (fmt start-idx cs-rev) lns-rev) lns-rev) (cons b null))
- (values (+ n 1) start-idx lns-rev (cons b cs-rev))))
- 0 0 null null
- #:finalise (λ (n idx lns-rev cs-rev)
- (string-join (reverse (if (null? cs-rev) lns-rev (cons (fmt idx cs-rev) lns-rev))) "\n"))))
-
-(define (count-bases b as cs gs ts n)
- (values (+ as (if (eq? b #\A) 1 0))
- (+ cs (if (eq? b #\C) 1 0))
- (+ gs (if (eq? b #\T) 1 0))
- (+ ts (if (eq? b #\G) 1 0))
- (add1 n)))
-
-(define (bioinformatics-Base_count s)
- (define-values (as cs gs ts n) (fold-sequence s count-bases 0 0 0 0 0))
- (printf "SEQUENCE:~%~%~a~%~%" (sequence->pretty-printed-string s))
- (printf "BASE COUNT:~%-----------~%~%~a~%~%"
- (string-join (map (λ (c n) (format " ~a :~a" c (~a #:width 4 #:align 'right n)))
- '(A T C G)
- (list as ts cs gs)) "\n"))
- (newline)
- (printf "TOTAL: ~a~%" n))
-
-(module+
- main
- (define the-string
- #< = base_count.iter().collect(); // HashMaps can't be sorted, so collect into Vec
- base_count.sort_by_key(|bc| bc.0); // Sort bases alphabetically
- for (base, count) in base_count.iter() {
- println!(" {}: {:3}", base, count);
- }
- println!();
- println!("Total: {}", total_count);
-}
diff --git a/Task/Bioinformatics-base-count/Swift/bioinformatics-base-count.swift b/Task/Bioinformatics-base-count/Swift/bioinformatics-base-count.swift
deleted file mode 100644
index 22b27dd044..0000000000
--- a/Task/Bioinformatics-base-count/Swift/bioinformatics-base-count.swift
+++ /dev/null
@@ -1,22 +0,0 @@
-import Foundation
-
-let dna = """
- CGTAAAAAATTACAACGTCCTTTGGCTATCTCTTAAACTCCTGCTAAATG
- CTCGTGCTTTCCAATTATGTAAGCGTTCCGAGACGGGGTGGTCGATTCTG
- AGGACAAAGGTCAAGATGGAGCGCATCGAACGCAATAAGGATCATTTGAT
- GGGACGTTTCGTCGACAAAGTCTTGTTTCGAGAGTAACGGCTACCGTCTT
- CGATTCTGCTTATAACACTATGTTCTTATGAAATGGATGTTCTGAGTTGG
- TCAGTCCCAATGTGCGGGGTTTCTTTTAGTACGTCGGGAGTGGTATTATA
- TTTAATTTTTCTATATAGCGATCTGTATTTAAGCAATTCATTTAGGTTAT
- CGCCGCGATGCTCGGTTCGGACCGCCAAGCATCTGGCTCCACTGCTAGTG
- TCCTAAATTTGAATGGCAAACACAAATAAGATTTAGCAATTCGTGTAGAC
- GACCGGGGACTTGCATGATGGGAGCAGCTTTGTTAAACTACGAACGTAAT
- """
-
-print("input:\n\(dna)\n")
-
-let counts =
- dna.replacingOccurrences(of: "\n", with: "").reduce(into: [:], { $0[$1, default: 0] += 1 })
-
-print("Counts: \(counts)")
-print("Total: \(counts.values.reduce(0, +))")
diff --git a/Task/Bioinformatics-base-count/Tcl/bioinformatics-base-count.tcl b/Task/Bioinformatics-base-count/Tcl/bioinformatics-base-count.tcl
deleted file mode 100644
index 0d691e71c8..0000000000
--- a/Task/Bioinformatics-base-count/Tcl/bioinformatics-base-count.tcl
+++ /dev/null
@@ -1,28 +0,0 @@
-namespace path ::tcl::mathop
-
-proc process {data {width 50}} {
- set len [string length $data]
- set addrwidth [string length [* [/ $len $width] $width]]
- for {set i 0} {$i < $len} {incr i $width} {
- puts "[format %${addrwidth}u $i] [string range $data $i $i+[- $width 1]]"
- }
- puts "\nBase count:"
- foreach base {A C G T} {
- puts "$base [regexp -all $base $data]"
- }
- puts "Total $len"
-}
-
-
-set test [string cat \
- CGTAAAAAATTACAACGTCCTTTGGCTATCTCTTAAACTCCTGCTAAATG \
- CTCGTGCTTTCCAATTATGTAAGCGTTCCGAGACGGGGTGGTCGATTCTG \
- AGGACAAAGGTCAAGATGGAGCGCATCGAACGCAATAAGGATCATTTGAT \
- GGGACGTTTCGTCGACAAAGTCTTGTTTCGAGAGTAACGGCTACCGTCTT \
- CGATTCTGCTTATAACACTATGTTCTTATGAAATGGATGTTCTGAGTTGG \
- TCAGTCCCAATGTGCGGGGTTTCTTTTAGTACGTCGGGAGTGGTATTATA \
- TTTAATTTTTCTATATAGCGATCTGTATTTAAGCAATTCATTTAGGTTAT \
- CGCCGCGATGCTCGGTTCGGACCGCCAAGCATCTGGCTCCACTGCTAGTG \
- TCCTAAATTTGAATGGCAAACACAAATAAGATTTAGCAATTCGTGTAGAC \
- GACCGGGGACTTGCATGATGGGAGCAGCTTTGTTAAACTACGAACGTAAT]
-process $test 50
diff --git a/Task/Bioinformatics-base-count/Uxntal/bioinformatics-base-count.uxnatl b/Task/Bioinformatics-base-count/Uxntal/bioinformatics-base-count.uxnatl
deleted file mode 100644
index c40f9b70d9..0000000000
--- a/Task/Bioinformatics-base-count/Uxntal/bioinformatics-base-count.uxnatl
+++ /dev/null
@@ -1,80 +0,0 @@
-%\n { 0a } %\s { 20 } %\0 { 00 }
-%newline { [ LIT2 \n -Console/write ] DEO }
-
-|18 @Console/write
-
-|100
-
-;data base-count
-
-BRK
-
-@base-count ( data* -- )
- LDAk
- DUP #0a NEQ ?{ !/next }
- DUP [ LIT "A ] NEQ ?{
- [ LIT2 &adenine $2 ] INC2 ,/adenine STR2 !/resume }
- DUP [ LIT "C ] NEQ ?{
- [ LIT2 &cytosine $2 ] INC2 ,/cytosine STR2 !/resume }
- DUP [ LIT "G ] NEQ ?{
- [ LIT2 &guanine $2 ] INC2 ,/guanine STR2 !/resume }
- DUP [ LIT "T ] NEQ ?{
- [ LIT2 &thymine $2 ] INC2 ,/thymine STR2 }
-
- &resume
- [ LIT2 &total $2 ] INC2 ,/total STR2
-
- &next
- POP
- INC2 LDAk ?base-count
-
- POP2
-
- ;msgs/sequence print/str
- ;data print/str
- ;msgs/header print/str
- ;msgs/adenine print/str ,/adenine LDR2 print/dec newline
- ;msgs/cytosine print/str ,/cytosine LDR2 print/dec newline
- ;msgs/guanine print/str ,/guanine LDR2 print/dec newline
- ;msgs/thymine print/str ,/thymine LDR2 print/dec newline
- ;msgs/total print/str ,/total LDR2 print/dec newline
-
- JMP2r
-
-@print/str ( str* -- )
- LDAk .Console/write DEO
- INC2 LDAk ?/str
- POP2 JMP2r
-
-@print/dec ( short* -- )
- #000a SWP2 [ LITr ff ]
-
- &dec/get
- SWP2k DIV2k MUL2 SUB2 STH
- POP OVR2 DIV2 ORAk ?/dec/get
- POP2 POP2
-
- &dec/put
- STHr INCk ?{ POP JMP2r }
- [ LIT "0 ] ADD .Console/write DEO !/dec/put
-
-@data [
- "CGTAAAAAATTACAACGTCCTTTGG "CTATCTCTTAAACTCCTGCTAAATG \n
- "CTCGTGCTTTCCAATTATGTAAGCG "TTCCGAGACGGGGTGGTCGATTCTG \n
- "AGGACAAAGGTCAAGATGGAGCGCA "TCGAACGCAATAAGGATCATTTGAT \n
- "GGGACGTTTCGTCGACAAAGTCTTG "TTTCGAGAGTAACGGCTACCGTCTT \n
- "CGATTCTGCTTATAACACTATGTTC "TTATGAAATGGATGTTCTGAGTTGG \n
- "TCAGTCCCAATGTGCGGGGTTTCTT "TTAGTACGTCGGGAGTGGTATTATA \n
- "TTTAATTTTTCTATATAGCGATCTG "TATTTAAGCAATTCATTTAGGTTAT \n
- "CGCCGCGATGCTCGGTTCGGACCGC "CAAGCATCTGGCTCCACTGCTAGTG \n
- "TCCTAAATTTGAATGGCAAACACAA "ATAAGATTTAGCAATTCGTGTAGAC \n
- "GACCGGGGACTTGCATGATGGGAGC "AGCTTTGTTAAACTACGAACGTAAT \n \0 ]
-
-@msgs [
- &header \n "BASE \s "COUNT: \n \0
- &sequence "SEQUENCE: \n \0
- &adenine \s \s \s "Adenine: \s \0
- &cytosine \s \s "Cytosine: \s \0
- &guanine \s \s \s "Guanine: \s \0
- &thymine \s \s \s "Thymine: \s \0
- &total \s \s \s \s \s "Total: \s \0 ]
diff --git a/Task/Bioinformatics-base-count/V-(Vlang)/bioinformatics-base-count.v b/Task/Bioinformatics-base-count/V-(Vlang)/bioinformatics-base-count.v
deleted file mode 100644
index 36e3777cd4..0000000000
--- a/Task/Bioinformatics-base-count/V-(Vlang)/bioinformatics-base-count.v
+++ /dev/null
@@ -1,37 +0,0 @@
-fn main() {
- dna := "" +
- "CGTAAAAAATTACAACGTCCTTTGGCTATCTCTTAAACTCCTGCTAAATG" +
- "CTCGTGCTTTCCAATTATGTAAGCGTTCCGAGACGGGGTGGTCGATTCTG" +
- "AGGACAAAGGTCAAGATGGAGCGCATCGAACGCAATAAGGATCATTTGAT" +
- "GGGACGTTTCGTCGACAAAGTCTTGTTTCGAGAGTAACGGCTACCGTCTT" +
- "CGATTCTGCTTATAACACTATGTTCTTATGAAATGGATGTTCTGAGTTGG" +
- "TCAGTCCCAATGTGCGGGGTTTCTTTTAGTACGTCGGGAGTGGTATTATA" +
- "TTTAATTTTTCTATATAGCGATCTGTATTTAAGCAATTCATTTAGGTTAT" +
- "CGCCGCGATGCTCGGTTCGGACCGCCAAGCATCTGGCTCCACTGCTAGTG" +
- "TCCTAAATTTGAATGGCAAACACAAATAAGATTTAGCAATTCGTGTAGAC" +
- "GACCGGGGACTTGCATGATGGGAGCAGCTTTGTTAAACTACGAACGTAAT"
-
- println("SEQUENCE:")
- le := dna.len
- for i := 0; i < le; i += 50 {
- mut k := i + 50
- if k > le {
- k = le
- }
- println("${i:5}: ${dna[i..k]}")
- }
- mut base_map := map[byte]int{} // allows for 'any' base
- for i in 0..le {
- base_map[dna[i]]++
- }
- mut bases := base_map.keys()
- bases.sort()
-
- println("\nBASE COUNT:")
- for base in bases {
- println(" $base: ${base_map[base]:3}")
- }
- println(" ------")
- println(" Σ: $le")
- println(" ======")
-}
diff --git a/Task/Bioinformatics-base-count/VBScript/bioinformatics-base-count.vb b/Task/Bioinformatics-base-count/VBScript/bioinformatics-base-count.vb
deleted file mode 100644
index 422d98cd55..0000000000
--- a/Task/Bioinformatics-base-count/VBScript/bioinformatics-base-count.vb
+++ /dev/null
@@ -1,31 +0,0 @@
-b=_
-"CGTAAAAAATTACAACGTCCTTTGGCTATCTCTTAAACTCCTGCTAAATG" &_
-"CTCGTGCTTTCCAATTATGTAAGCGTTCCGAGACGGGGTGGTCGATTCTG" &_
-"AGGACAAAGGTCAAGATGGAGCGCATCGAACGCAATAAGGATCATTTGAT" &_
-"GGGACGTTTCGTCGACAAAGTCTTGTTTCGAGAGTAACGGCTACCGTCTT" &_
-"CGATTCTGCTTATAACACTATGTTCTTATGAAATGGATGTTCTGAGTTGG" &_
-"TCAGTCCCAATGTGCGGGGTTTCTTTTAGTACGTCGGGAGTGGTATTATA" &_
-"TTTAATTTTTCTATATAGCGATCTGTATTTAAGCAATTCATTTAGGTTAT" &_
-"CGCCGCGATGCTCGGTTCGGACCGCCAAGCATCTGGCTCCACTGCTAGTG" &_
-"TCCTAAATTTGAATGGCAAACACAAATAAGATTTAGCAATTCGTGTAGAC" &_
-"GACCGGGGACTTGCATGATGGGAGCAGCTTTGTTAAACTACGAACGTAAT"
-
-s="SEQUENCE:"
-acnt=0:ccnt=0:gcnt=0:tcnt=0
-
-for i=0 to len(b)-1
- if (i mod 30)=0 then s = s & vbcrlf & right(" "& i+1,3)&": "
- if (i mod 5)=0 then s=s& " "
- m=mid(b,i+1,1)
- s=s & m
- select case m
- case "A":acnt=acnt+1
- case "C":ccnt=ccnt+1
- case "G":gcnt=gcnt+1
- case "T":tcnt=tcnt+1
- case else
- wscript.echo "error at ",i+1, m
- end select
-next
-wscript.echo s & vbcrlf
-wscript.echo "Count: A="&acnt & " C=" & ccnt & " G=" & gcnt & " T=" & tcnt
diff --git a/Task/Bioinformatics-base-count/Wren/bioinformatics-base-count.wren b/Task/Bioinformatics-base-count/Wren/bioinformatics-base-count.wren
deleted file mode 100644
index e8b0e06487..0000000000
--- a/Task/Bioinformatics-base-count/Wren/bioinformatics-base-count.wren
+++ /dev/null
@@ -1,38 +0,0 @@
-import "./fmt" for Fmt
-import "./sort" for Sort
-import "./iterate" for Stepped
-
-var dna = "CGTAAAAAATTACAACGTCCTTTGGCTATCTCTTAAACTCCTGCTAAATG" +
- "CTCGTGCTTTCCAATTATGTAAGCGTTCCGAGACGGGGTGGTCGATTCTG" +
- "AGGACAAAGGTCAAGATGGAGCGCATCGAACGCAATAAGGATCATTTGAT" +
- "GGGACGTTTCGTCGACAAAGTCTTGTTTCGAGAGTAACGGCTACCGTCTT" +
- "CGATTCTGCTTATAACACTATGTTCTTATGAAATGGATGTTCTGAGTTGG" +
- "TCAGTCCCAATGTGCGGGGTTTCTTTTAGTACGTCGGGAGTGGTATTATA" +
- "TTTAATTTTTCTATATAGCGATCTGTATTTAAGCAATTCATTTAGGTTAT" +
- "CGCCGCGATGCTCGGTTCGGACCGCCAAGCATCTGGCTCCACTGCTAGTG" +
- "TCCTAAATTTGAATGGCAAACACAAATAAGATTTAGCAATTCGTGTAGAC" +
- "GACCGGGGACTTGCATGATGGGAGCAGCTTTGTTAAACTACGAACGTAAT"
-
-System.print("SEQUENCE:")
-var le = dna.count
-for (i in Stepped.new(0...le, 50)) {
- var k = i + 50
- if (k > le) k = le
- System.print("%(Fmt.d(5, i)): %(dna[i...k])")
-}
-var baseMap = {} // allows for 'any' base
-for (i in 0...le) {
- var d = dna[i]
- var v = baseMap[d]
- baseMap[d] = !v ? 1 : v + 1
-}
-var bases = baseMap.keys.toList
-Sort.quick(bases)
-
-System.print("\nBASE COUNT:")
-for (base in bases) {
- System.print(" %(base): %(Fmt.d(3, baseMap[base]))")
-}
-System.print(" ------")
-System.print(" Σ: %(le)")
-System.print(" ======")
diff --git a/Task/Bioinformatics-base-count/XPL0/bioinformatics-base-count.xpl0 b/Task/Bioinformatics-base-count/XPL0/bioinformatics-base-count.xpl0
deleted file mode 100644
index 2f6adbf6f4..0000000000
--- a/Task/Bioinformatics-base-count/XPL0/bioinformatics-base-count.xpl0
+++ /dev/null
@@ -1,35 +0,0 @@
-char Bases;
-int Counts(256), Cnt, I, Ch;
-[Bases:= "
-CGTAAAAAATTACAACGTCCTTTGGCTATCTCTTAAACTCCTGCTAAATG
-CTCGTGCTTTCCAATTATGTAAGCGTTCCGAGACGGGGTGGTCGATTCTG
-AGGACAAAGGTCAAGATGGAGCGCATCGAACGCAATAAGGATCATTTGAT
-GGGACGTTTCGTCGACAAAGTCTTGTTTCGAGAGTAACGGCTACCGTCTT
-CGATTCTGCTTATAACACTATGTTCTTATGAAATGGATGTTCTGAGTTGG
-TCAGTCCCAATGTGCGGGGTTTCTTTTAGTACGTCGGGAGTGGTATTATA
-TTTAATTTTTCTATATAGCGATCTGTATTTAAGCAATTCATTTAGGTTAT
-CGCCGCGATGCTCGGTTCGGACCGCCAAGCATCTGGCTCCACTGCTAGTG
-TCCTAAATTTGAATGGCAAACACAAATAAGATTTAGCAATTCGTGTAGAC
-GACCGGGGACTTGCATGATGGGAGCAGCTTTGTTAAACTACGAACGTAATx ";
-
-for I:= 0 to 255 do Counts(I):= 0;
-Format(5, 0);
-Cnt:= 0;
-I:= 0;
-loop [repeat Ch:= Bases(I);
- I:= I+1;
- if Ch = ^x then quit;
- Counts(Ch):= Counts(Ch)+1;
- ChOut(0, Ch);
- until Ch = \LF\$0A;
- RlOut(0, float(Cnt)); Text(0, ": ");
- Cnt:= Cnt + 50;
- ];
-CrLf(0); CrLf(0);
-Text(0, "Base counts A: "); IntOut(0, Counts(^A));
-Text(0, " C: "); IntOut(0, Counts(^C));
-Text(0, " G: "); IntOut(0, Counts(^G));
-Text(0, " T: "); IntOut(0, Counts(^T));
-Text(0, "
-Total: "); IntOut(0, Cnt); CrLf(0);
-]
diff --git a/Task/Bioinformatics-base-count/Zkl/bioinformatics-base-count.zkl b/Task/Bioinformatics-base-count/Zkl/bioinformatics-base-count.zkl
deleted file mode 100644
index 51481d619d..0000000000
--- a/Task/Bioinformatics-base-count/Zkl/bioinformatics-base-count.zkl
+++ /dev/null
@@ -1,19 +0,0 @@
-bases:=
-#<<<"
-CGTAAAAAATTACAACGTCCTTTGGCTATCTCTTAAACTCCTGCTAAATG
-CTCGTGCTTTCCAATTATGTAAGCGTTCCGAGACGGGGTGGTCGATTCTG
-AGGACAAAGGTCAAGATGGAGCGCATCGAACGCAATAAGGATCATTTGAT
-GGGACGTTTCGTCGACAAAGTCTTGTTTCGAGAGTAACGGCTACCGTCTT
-CGATTCTGCTTATAACACTATGTTCTTATGAAATGGATGTTCTGAGTTGG
-TCAGTCCCAATGTGCGGGGTTTCTTTTAGTACGTCGGGAGTGGTATTATA
-TTTAATTTTTCTATATAGCGATCTGTATTTAAGCAATTCATTTAGGTTAT
-CGCCGCGATGCTCGGTTCGGACCGCCAAGCATCTGGCTCCACTGCTAGTG
-TCCTAAATTTGAATGGCAAACACAAATAAGATTTAGCAATTCGTGTAGAC
-GACCGGGGACTTGCATGATGGGAGCAGCTTTGTTAAACTACGAACGTAAT" - " \n";
-#<<<
-
-[0..*,50].zipWith(fcn(n,bases){ println("%6d: %s".fmt(n,bases.concat())) },
- bases.walker().walk.fp(50)).pump(Void); // .pump forces the iterator
-
-println("\nBase Counts: ", bases.counts().pump(String,Void.Read,"%s: %d ".fmt));
-println("Total: ",bases.len());
diff --git a/Task/Biorhythms/11l/biorhythms.11l b/Task/Biorhythms/11l/biorhythms.11l
index d38daa2837..5e64e6837e 100644
--- a/Task/Biorhythms/11l/biorhythms.11l
+++ b/Task/Biorhythms/11l/biorhythms.11l
@@ -21,7 +21,7 @@ F biorhythms(birthdate_str, targetdate_str)
V cycle_lengths = [23, 28, 33]
V quadrants = [(‘up and rising’, ‘peak’), (‘up but falling’, ‘transition’), (‘down and falling’, ‘valley’), (‘down but rising’, ‘transition’)]
- L(i) 3
+ L(i) 0.<3
V label = cycle_labels[i]
V length = cycle_lengths[i]
V position = days % length
diff --git a/Task/Biorhythms/Ada/biorhythms.ada b/Task/Biorhythms/Ada/biorhythms.ada
deleted file mode 100644
index 8f1fb796b8..0000000000
--- a/Task/Biorhythms/Ada/biorhythms.ada
+++ /dev/null
@@ -1,65 +0,0 @@
-with Ada.Calendar;
-with Ada.Calendar.Arithmetic;
-with Ada.Calendar.Formatting;
-with Ada.Command_Line;
-with Ada.Numerics;
-with Ada.Numerics.Elementary_Functions;
-with Ada.Text_IO;
-
-use Ada.Calendar;
-use Ada.Calendar.Arithmetic;
-use Ada.Calendar.Formatting;
-use Ada.Command_Line;
-use Ada.Numerics;
-use Ada.Numerics.Elementary_Functions;
-use Ada.Text_IO;
-
-procedure Biorhythms is
- Birth_Date : Time := Value (Argument (1) & " 00:00:00");
- Target_Date : Time := Value (Argument (2) & " 00:00:00");
- Days : Day_Count := Target_Date - Birth_Date;
-
- -- There's not much point having types for these for such a short
- -- problem, but in a big program this would be useful to prevent
- -- accidentally assigning wrong values.
- type Physical_Type is mod 23;
- type Emotional_Type is mod 28;
- type Mental_Type is mod 33;
- type Biorhythm_Type is
- record
- Physical : Physical_Type;
- Emotional : Emotional_Type;
- Mental : Mental_Type;
- end record;
-
- function To_Biorhythm (D : Day_Count) return Biorhythm_Type is
- (
- Physical_Type (D mod Physical_Type'Modulus),
- Emotional_Type (D mod Emotional_Type'Modulus),
- Mental_Type (D mod Mental_Type'Modulus)
- );
-
- Biorhythm : Biorhythm_Type := To_Biorhythm (Days);
-
- package Float_IO is new Ada.Text_IO.Float_IO (Float);
- use Float_IO;
-
- function To_Percent (F : Float) return Float is
- (100.0 * Sin (2.0 * Pi * F));
-
- procedure Report_Biorhythm (B : Biorhythm_Type) is
- PFrac : Float := Float (B.Physical) / Float (Physical_Type'Modulus);
- EFrac : Float := Float (B.Emotional) / Float (Emotional_Type'Modulus);
- MFrac : Float := Float (B.Mental) / Float (Mental_Type'Modulus);
- Physical : Float := To_Percent (PFrac);
- Emotional : Float := To_Percent (EFrac);
- Mental : Float := To_Percent (MFrac);
- begin
- Put_Line ("Age in days: " & Days'Image);
- Put ("Physical cycle: "); Put (Physical, 3, 1, 0); Put ("%"); New_Line;
- Put ("Emotional cycle: "); Put (Emotional, 3, 1, 0); Put ("%"); New_Line;
- Put ("Mental cycle: "); Put (Mental, 3, 1, 0); Put ("%"); New_Line;
- end Report_Biorhythm;
-begin
- Report_Biorhythm (Biorhythm);
-end Biorhythms;
diff --git a/Task/Biorhythms/COBOL/biorhythms-1.cobol b/Task/Biorhythms/COBOL/biorhythms-1.cobol
deleted file mode 100644
index 5d2dc28202..0000000000
--- a/Task/Biorhythms/COBOL/biorhythms-1.cobol
+++ /dev/null
@@ -1,144 +0,0 @@
- identification division.
- program-id. bio.
- environment division.
- *************************************************************
- **** To execute on command line enter program name followed
- **** by birth date ccyymmdd and then target date.
- **** Example: bio 18090102 18631117
- **** Will display the three cycles:
- **** Physcial 23 days, Emotional 28 days, Mental 33 days
- **** for that date.
- ****
- *************************************************************
- configuration section.
- source-computer.
- System76
- * with debugging mode
- .
- repository.
- function all intrinsic.
-
- data division.
- working-storage section.
- 01 w-d1 pic x(08).
- 01 w-d2 pic x(08).
- 01 n-d1 pic 9(08).
- 01 n-d2 pic 9(08).
- 01 w-i1 comp-x pic x(04).
- 01 w-i2 comp-x pic x(04).
- 01 w-days pic 9(07).
- 01 arg-knt comp-5 pic x(01).
- 01 bx pic 9.
- 01 bio-tbl value 'Physical 23Emotional28Mental 33'.
- 05 bio-entry occurs 3 times.
- 10 bio-cyc pic x(09).
- 10 bio-lth pic 9(02).
- 01 bio-data occurs 3 times.
- 05 bio-mod pic 9(02).
- 05 bio-sin pic s999v9.
- 05 bio-dsc pic x(09).
-
- procedure division.
- accept arg-knt from argument-number
- if arg-knt <> 2
- then
- display 'two arguments are required:' upon SYSERR
- display ' 1. first date ccyymmdd' upon SYSERR
- display ' 2. second date ccyymmdd' upon SYSERR
- stop run returning -1
- end-if
- accept w-d1 from argument-value
- if w-d1 not numeric
- display ' first date not numeric ' upon syserr
- move 2 to return-code
- stop run
- end-if
- move w-d1 to n-d1
- if (n-d1 > 99991231)
- display ' first date must be less than 99991232'
- upon syserr
- move 3 to return-code
- stop run
- end-if
- if (n-d1 < 16010101)
- display ' first date must be greater than 16010100'
- upon syserr
- move 4 to return-code
- stop run
- end-if
- if ((n-d1(5:2) = '00')
- or
- (n-d1(5:2) > '12'))
- display ' invalid month for first date ' upon syserr
- move 5 to return-code
- stop run
- end-if
- if ((n-d1(7:2) = '00')
- or
- (n-d1(7:2) > '31'))
- display ' invalid day for first date ' upon syserr
- move 6 to return-code
- stop run
- end-if
- accept w-d2 from argument-value
- if w-d2 not numeric
- display 'second date not numeric ' upon syserr
- move 12 to return-code
- stop run
- end-if
- move w-d2 to n-d2
- if (n-d2 > 99991231)
- display ' second date must be less than 99991232'
- upon syserr
- move 13 to return-code
- stop run
- end-if
- if (n-d2 < 16010101)
- display ' second date must be greater than 16010100'
- upon syserr
- move 14 to return-code
- stop run
- end-if
- if ((n-d2(5:2) = '00')
- or
- (n-d2(5:2) > '12'))
- display ' invalid month for second date ' upon syserr
- move 15 to return-code
- stop run
- end-if
- if ((n-d2(7:2) = '00')
- or
- (n-d2(7:2) > '31'))
- display ' invalid day for second date ' upon syserr
- move 16 to return-code
- stop run
- end-if
- move w-d1 to n-d1
- move w-d2 to n-d2
- move integer-of-date(n-d1) to w-i1
- move integer-of-date(n-d2) to w-i2
- compute w-days = w-i1 - w-i2
- display w-days
- perform varying bx from 1 by 1 until bx greater than 3
- move mod(w-days, bio-lth(bx)) to bio-mod(bx)
- compute bio-sin(bx) rounded
- = 100 * sin(2 * PI * bio-mod(bx) / bio-lth(bx))
- end-compute
- display bio-cyc(bx) " "
- bio-mod(bx) ":"
- bio-sin(bx) "%" with no advancing
- end-display
- if bio-sin(bx) > 95
- move " peak" to bio-dsc(bx)
- end-if
- if bio-sin(bx) < -95
- move " valley" to bio-dsc(bx)
- end-if
- if abs(bio-sin(bx)) < 5
- move " critical" to bio-dsc(bx)
- end-if
- display bio-dsc(bx)
- end-perform
- move 0 to return-code
- goback
- .
diff --git a/Task/Biorhythms/COBOL/biorhythms-2.cobol b/Task/Biorhythms/COBOL/biorhythms-2.cobol
deleted file mode 100644
index 104223a73c..0000000000
--- a/Task/Biorhythms/COBOL/biorhythms-2.cobol
+++ /dev/null
@@ -1,9 +0,0 @@
-Compile and Test
-C:\GnuCOBOL>
-C:\GnuCOBOL>cobc -x bio.cbl
-
-C:\GnuCOBOL>bio 18090112 18631119
-0020034
-Physical 01:+027.0%
-Emotional 14:+000.0% critical
-Mental 03:+054.1%
diff --git a/Task/Biorhythms/Emacs-Lisp/biorhythms.l b/Task/Biorhythms/Emacs-Lisp/biorhythms.l
deleted file mode 100644
index 1165910d29..0000000000
--- a/Task/Biorhythms/Emacs-Lisp/biorhythms.l
+++ /dev/null
@@ -1,15 +0,0 @@
-(require 'calendar)
-
-(setq biorhythm-birthdate '(3 16 1953))
-
-(defun biorhythm ()
- "Show today's biorhythm."
- (interactive)
- (let* ((diff (abs (- (string-to-number (calendar-astro-date-string
- biorhythm-birthdate)) (string-to-number
- (calendar-astro-date-string)))))
- (rhyt '(23 28 33))
- (perc (mapcar (lambda (x) (round (* 100 (sin
- (* 2 pi diff (/ 1.0 x)))))) rhyt)))
- (message "age: %i physical: %i%% emotional: %i%% intellectual: %i%%"
- diff (car perc) (cadr perc) (caddr perc))))
diff --git a/Task/Biorhythms/V-(Vlang)/biorhythms.v b/Task/Biorhythms/V-(Vlang)/biorhythms.v
index cc0e0331a8..86ab4b69de 100644
--- a/Task/Biorhythms/V-(Vlang)/biorhythms.v
+++ b/Task/Biorhythms/V-(Vlang)/biorhythms.v
@@ -11,9 +11,9 @@ const quadrants = [
]
// Parameters assumed to be in YYYY-MM-DD format.
-fn biorhythms(birth_date string, target_date string) ? {
- bd := time.parse_iso8601(birth_date)?
- td := time.parse_iso8601(target_date)?
+fn biorhythms(birth_date string, target_date string) ! {
+ bd := time.parse_iso8601(birth_date)!
+ td := time.parse_iso8601(target_date)!
days := int((td-bd).hours() / 24)
println("Born $birth_date, Target $target_date")
println("Day $days")
@@ -51,6 +51,6 @@ fn main() {
["1809-02-12", "1863-11-19"], // correct DOB for Abraham Lincoln
]
for date_pair in date_pairs {
- biorhythms(date_pair[0], date_pair[1])?
+ biorhythms(date_pair[0], date_pair[1])!
}
}
diff --git a/Task/Bitcoin-address-validation/Ada/bitcoin-address-validation.ada b/Task/Bitcoin-address-validation/Ada/bitcoin-address-validation.ada
deleted file mode 100644
index ff99481d0e..0000000000
--- a/Task/Bitcoin-address-validation/Ada/bitcoin-address-validation.ada
+++ /dev/null
@@ -1,128 +0,0 @@
-with Ada.Exceptions, Interfaces;
-with Ada.Streams;
-use Ada.Exceptions, Interfaces;
-use Ada.Streams;
-
-package Bitcoin is
- subtype BT_Raw_Addr is Stream_Element_Array(1..25);
- subtype BT_Checksum is Stream_Element_Array(1..4);
- subtype BT_Addr is String(1..34);
- subtype Sha256String is String(1..64);
- Invalid_Address_Error : Exception;
-
- function Double_Sha256(S : Stream_Element_Array) return BT_Checksum;
- function Is_Valid(A : BT_Raw_Addr) return Boolean;
- procedure Base58_Decode(S : BT_Addr; A : out BT_Raw_Addr) ;
-private
- Base58 : constant String := "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz";
- function Hex_Val (C, C2 : Character) return Stream_Element;
-end Bitcoin;
-
-
-with GNAT.SHA256, Ada.Strings.Fixed;
-use GNAT.SHA256, Ada.Strings.Fixed;
-
-package body Bitcoin is
-
-function Hex_Val (C, C2 : Character) return Stream_Element is
- subtype Nibble is Integer range 0..15;
- HEX : array (0..255) of Nibble := (
- 48=>0, 49=>1, 50=>2, 51=>3, 52=>4, 53=>5, 54=>6, 55=>7, 56=>8, 57=>9
- , 65=>10, 66=>11, 67=>12, 68 =>13, 69 =>14, 70 =>15
- , 97=>10, 98=>11, 99=>12, 100=>13, 101=>14, 102=>15
- , Others=>0
- );
-begin
- return Stream_Element(HEX(Character'Pos(C)) * 16 + HEX(Character'Pos(C2)));
-end Hex_Val;
-
-function Double_Sha256(S : Stream_Element_Array) return BT_Checksum is
- Ctx : Context := Initial_Context;
- D : Message_Digest;
- S2 : Stream_Element_Array(1..32);
- Ctx2 : Context := Initial_Context;
- C : BT_Checksum;
-begin
- Update(Ctx, S);
- D := Digest(Ctx);
- for I in S2'Range loop
- S2(I) := Hex_Val(D(Integer(I)*2-1), D(Integer(I)*2));
- end loop;
- Update(Ctx2, S2);
- D := Digest(Ctx2);
- for I in C'Range loop
- C(I) := Hex_Val(D(Integer(I)*2-1), D(Integer(I)*2));
- end loop;
- return C;
-
-end Double_Sha256;
-
-
---------------------------------------------------------------------------------
--- Summary of Base58: --
--- We decode S into a 200 bit unsigned integer. --
--- We could use a BigNum library, but choose to go without. --
---------------------------------------------------------------------------------
-procedure Base58_Decode(S : BT_Addr; A : out BT_Raw_Addr) is
-begin
- A := (Others => 0);
- for I in S'Range loop
- declare
- P : Natural := Index(Base58, String(S(I..I)));
- C : Natural;
- begin
- if P = 0 then
- raise Invalid_Address_Error;
- end if;
- C := P - 1;
- for J in reverse A'Range loop
- C := C + Natural(A(J)) * 58;
- A(J) := Stream_Element(Unsigned_32(C) and 255); -- 0x00FF
- C := Natural(Shift_Right(Unsigned_32(C),8) and 255); -- 0xFF00
- end loop;
- if C /= 0 then
- raise Invalid_Address_Error;
- end if;
- end;
- end loop;
-end Base58_Decode;
-
-
-function Is_Valid(A : BT_Raw_Addr) return Boolean is
-begin
- return A(1) = 0 and A(22..25) = Double_Sha256(A(1..21));
-end Is_Valid;
-
-
-end Bitcoin;
-
-with Ada.Text_IO, Bitcoin;
-use Ada.Text_IO, Bitcoin;
-
-procedure Bitcoin_Addr_Validate is
-begin
- declare
- BTs : array (positive range <>) of BT_Addr := (
- "1AGNa15ZQXAZUgFiqJ2i7Z2DPU2J6hW62i" -- VALID
- , "1Q1pE5vPGEEMqRcVRMbtBK842Y6Pzo6nK9" -- VALID
- , "1AGNa15ZQXAZUgFiqJ2i7Z2DPU2J6hW62X" -- checksum changed, original data.
- , "1ANNa15ZQXAZUgFiqJ2i7Z2DPU2J6hW62i" -- data changed, original checksum.
- , "1A Na15ZQXAZUgFiqJ2i7Z2DPU2J6hW62i" -- invalid chars
- );
- begin
- for I in Bts'Range loop
- declare
- A : BT_Raw_Addr;
- Valid : Boolean;
- begin
- Put(BTs(I) & " validity: ");
- Base58_Decode(BTs(I), A);
- Valid := Is_Valid(A);
- Put_Line(Boolean'Image(Valid));
- exception
- when E : Invalid_Address_Error =>
- Put_Line ("*** Error: Invalid BT address.");
- end;
- end loop;
- end;
-end Bitcoin_Addr_Validate;
diff --git a/Task/Bitmap-B-zier-curves-Cubic/Ada/bitmap-b-zier-curves-cubic-1.ada b/Task/Bitmap-B-zier-curves-Cubic/Ada/bitmap-b-zier-curves-cubic-1.ada
deleted file mode 100644
index 520ce6f248..0000000000
--- a/Task/Bitmap-B-zier-curves-Cubic/Ada/bitmap-b-zier-curves-cubic-1.ada
+++ /dev/null
@@ -1,24 +0,0 @@
-procedure Cubic_Bezier
- ( Picture : in out Image;
- P1, P2, P3, P4 : Point;
- Color : Pixel;
- N : Positive := 20
- ) is
- Points : array (0..N) of Point;
-begin
- for I in Points'Range loop
- declare
- T : constant Float := Float (I) / Float (N);
- A : constant Float := (1.0 - T)**3;
- B : constant Float := 3.0 * T * (1.0 - T)**2;
- C : constant Float := 3.0 * T**2 * (1.0 - T);
- D : constant Float := T**3;
- begin
- Points (I).X := Positive (A * Float (P1.X) + B * Float (P2.X) + C * Float (P3.X) + D * Float (P4.X));
- Points (I).Y := Positive (A * Float (P1.Y) + B * Float (P2.Y) + C * Float (P3.Y) + D * Float (P4.Y));
- end;
- end loop;
- for I in Points'First..Points'Last - 1 loop
- Line (Picture, Points (I), Points (I + 1), Color);
- end loop;
-end Cubic_Bezier;
diff --git a/Task/Bitmap-B-zier-curves-Cubic/Ada/bitmap-b-zier-curves-cubic-2.ada b/Task/Bitmap-B-zier-curves-Cubic/Ada/bitmap-b-zier-curves-cubic-2.ada
deleted file mode 100644
index 7e2a86272d..0000000000
--- a/Task/Bitmap-B-zier-curves-Cubic/Ada/bitmap-b-zier-curves-cubic-2.ada
+++ /dev/null
@@ -1,5 +0,0 @@
- X : Image (1..16, 1..16);
-begin
- Fill (X, White);
- Cubic_Bezier (X, (16, 1), (1, 4), (3, 16), (15, 11), Black);
- Print (X);
diff --git a/Task/Bitmap-B-zier-curves-Quadratic/Ada/bitmap-b-zier-curves-quadratic-1.ada b/Task/Bitmap-B-zier-curves-Quadratic/Ada/bitmap-b-zier-curves-quadratic-1.ada
deleted file mode 100644
index 8d3a3f83ce..0000000000
--- a/Task/Bitmap-B-zier-curves-Quadratic/Ada/bitmap-b-zier-curves-quadratic-1.ada
+++ /dev/null
@@ -1,23 +0,0 @@
-procedure Quadratic_Bezier
- ( Picture : in out Image;
- P1, P2, P3 : Point;
- Color : Pixel;
- N : Positive := 20
- ) is
- Points : array (0..N) of Point;
-begin
- for I in Points'Range loop
- declare
- T : constant Float := Float (I) / Float (N);
- A : constant Float := (1.0 - T)**2;
- B : constant Float := 2.0 * T * (1.0 - T);
- C : constant Float := T**2;
- begin
- Points (I).X := Positive (A * Float (P1.X) + B * Float (P2.X) + C * Float (P3.X));
- Points (I).Y := Positive (A * Float (P1.Y) + B * Float (P2.Y) + C * Float (P3.Y));
- end;
- end loop;
- for I in Points'First..Points'Last - 1 loop
- Line (Picture, Points (I), Points (I + 1), Color);
- end loop;
-end Quadratic_Bezier;
diff --git a/Task/Bitmap-B-zier-curves-Quadratic/Ada/bitmap-b-zier-curves-quadratic-2.ada b/Task/Bitmap-B-zier-curves-Quadratic/Ada/bitmap-b-zier-curves-quadratic-2.ada
deleted file mode 100644
index 1c346c9eaa..0000000000
--- a/Task/Bitmap-B-zier-curves-Quadratic/Ada/bitmap-b-zier-curves-quadratic-2.ada
+++ /dev/null
@@ -1,5 +0,0 @@
- X : Image (1..16, 1..16);
-begin
- Fill (X, White);
- Quadratic_Bezier (X, (8, 2), (13, 8), (2, 15), Black);
- Print (X);
diff --git a/Task/Bitmap-Bresenhams-line-algorithm/Ada/bitmap-bresenhams-line-algorithm-1.ada b/Task/Bitmap-Bresenhams-line-algorithm/Ada/bitmap-bresenhams-line-algorithm-1.ada
deleted file mode 100644
index ae513fcfc4..0000000000
--- a/Task/Bitmap-Bresenhams-line-algorithm/Ada/bitmap-bresenhams-line-algorithm-1.ada
+++ /dev/null
@@ -1,40 +0,0 @@
-procedure Line (Picture : in out Image; Start, Stop : Point; Color : Pixel) is
- DX : constant Float := abs Float (Stop.X - Start.X);
- DY : constant Float := abs Float (Stop.Y - Start.Y);
- Err : Float;
- X : Positive := Start.X;
- Y : Positive := Start.Y;
- Step_X : Integer := 1;
- Step_Y : Integer := 1;
-begin
- if Start.X > Stop.X then
- Step_X := -1;
- end if;
- if Start.Y > Stop.Y then
- Step_Y := -1;
- end if;
- if DX > DY then
- Err := DX / 2.0;
- while X /= Stop.X loop
- Picture (X, Y) := Color;
- Err := Err - DY;
- if Err < 0.0 then
- Y := Y + Step_Y;
- Err := Err + DX;
- end if;
- X := X + Step_X;
- end loop;
- else
- Err := DY / 2.0;
- while Y /= Stop.Y loop
- Picture (X, Y) := Color;
- Err := Err - DX;
- if Err < 0.0 then
- X := X + Step_X;
- Err := Err + DY;
- end if;
- Y := Y + Step_Y;
- end loop;
- end if;
- Picture (X, Y) := Color; -- Ensure dots to be drawn
-end Line;
diff --git a/Task/Bitmap-Bresenhams-line-algorithm/Ada/bitmap-bresenhams-line-algorithm-2.ada b/Task/Bitmap-Bresenhams-line-algorithm/Ada/bitmap-bresenhams-line-algorithm-2.ada
deleted file mode 100644
index 9fa0a0abaf..0000000000
--- a/Task/Bitmap-Bresenhams-line-algorithm/Ada/bitmap-bresenhams-line-algorithm-2.ada
+++ /dev/null
@@ -1,8 +0,0 @@
- X : Image (1..16, 1..16);
-begin
- Fill (X, White);
- Line (X, ( 1, 8), ( 8,16), Black);
- Line (X, ( 8,16), (16, 8), Black);
- Line (X, (16, 8), ( 8, 1), Black);
- Line (X, ( 8, 1), ( 1, 8), Black);
- Print (X);
diff --git a/Task/Bitmap-Bresenhams-line-algorithm/AutoIt/bitmap-bresenhams-line-algorithm.autoit b/Task/Bitmap-Bresenhams-line-algorithm/AutoIt/bitmap-bresenhams-line-algorithm.autoit
deleted file mode 100644
index 60a2debaef..0000000000
--- a/Task/Bitmap-Bresenhams-line-algorithm/AutoIt/bitmap-bresenhams-line-algorithm.autoit
+++ /dev/null
@@ -1,23 +0,0 @@
-Local $var = drawBresenhamLine(2, 3, 2, 6)
-
-Func drawBresenhamLine($iX0, $iY0, $iX1, $iY1)
- Local $iDx = Abs($iX1 - $iX0)
- Local $iSx = $iX0 < $iX1 ? 1 : -1
- Local $iDy = Abs($iY1 - $iY0)
- Local $iSy = $iY0 < $iY1 ? 1 : -1
- Local $iErr = ($iDx > $iDy ? $iDx : -$iDy) / 2, $e2
-
- While $iX0 <= $iX1
- ConsoleWrite("plot( $x=" & $iX0 & ", $y=" & $iY0 & " )" & @LF)
- If ($iX0 = $iX1) And ($iY0 = $iY1) Then Return
- $e2 = $iErr
- If ($e2 > -$iDx) Then
- $iErr -= $iDy
- $iX0 += $iSx
- EndIf
- If ($e2 < $iDy) Then
- $iErr += $iDx
- $iY0 += $iSy
- EndIf
- WEnd
-EndFunc ;==>drawBresenhamLine
diff --git a/Task/Bitmap-Bresenhams-line-algorithm/Euphoria/bitmap-bresenhams-line-algorithm.ex b/Task/Bitmap-Bresenhams-line-algorithm/Euphoria/bitmap-bresenhams-line-algorithm.ex
deleted file mode 100644
index 279a27aa62..0000000000
--- a/Task/Bitmap-Bresenhams-line-algorithm/Euphoria/bitmap-bresenhams-line-algorithm.ex
+++ /dev/null
@@ -1,115 +0,0 @@
-include std/console.e
-include std/graphics.e
-include std/math.e
-
--- the new_image function and related code in the 25 or so
--- lines below are from http://rosettacode.org/wiki/Basic_bitmap_storage#Euphoria
--- as of friday, march 2, 2012
-
--- Some color constants:
-constant
- black = #000000,
- white = #FFFFFF,
- red = #FF0000,
- green = #00FF00,
- blue = #0000FF
-
--- Create new image filled with some color
-function new_image(integer width, integer height, atom fill_color)
- return repeat(repeat(fill_color,height),width)
-end function
-
---grid used for drawing lines in this program
-sequence screenData = new_image(16,16,black)
-
---the line algorithm
-function bresLine(sequence screenData, integer x0, integer y0, integer x1, integer y1, integer color)
-
- integer deltaX = abs(x1 - x0), deltaY = abs(y1 - y0)
- integer stepX, stepY, lineError, error2
-
- if x0 < x1 then
- stepX = 1
- else
- stepX = -1
- end if
-
- if y0 < y1 then
- stepY = 1
- else
- stepY = -1
- end if
-
- if deltaX > deltaY then
- lineError = deltaX
- else
- lineError = -deltaY
- end if
-
- lineError = round(lineError / 2, 1)
-
- while 1 do
-
- screenData[x0][y0] = color
-
- if (x0 = x1 and y0 = y1) then
- exit
- end if
-
- error2 = lineError
-
- if error2 > -deltaX then
- lineError -= deltaY
- x0 += stepX
- end if
- if error2 < deltaY then
- lineError += deltaX
- y0 += stepY
- end if
- end while
- return screenData -- return modified version of the screenData sequence
-end function
-
---prevents console output wrapping to next line if it is too big for the screen
-wrap(0)
---outer diamond
-screenData = bresLine(screenData,8,1,16,8,white)
-screenData = bresLine(screenData,16,8,8,16,white)
-screenData = bresLine(screenData,8,16,1,8,white)
-screenData = bresLine(screenData,1,8,8,1,white)
---inner diamond
-screenData = bresLine(screenData,8,4,12,8,white)
-screenData = bresLine(screenData,12,8,8,12,white)
-screenData = bresLine(screenData,8,12,4,8,white)
-screenData = bresLine(screenData,4,8,8,4,white)
--- center lines drawing from left to right, and the next from right to left.
-screenData = bresLine(screenData,7,7,9,7,white)
-screenData = bresLine(screenData,9,9,7,9,white)
---center dot
-screenData = bresLine(screenData,8,8,8,8,white)
-
---print to the standard console output
-for i = 1 to 16 do
- puts(1,"\n")
- for j = 1 to 16 do
- if screenData[j][i] = black then
- printf(1, "%s", ".")
- else
- printf(1, "%s", "#")
- end if
- end for
-end for
-
-puts(1,"\n\n")
-any_key()
-
---/*
---output was edited to replace the color's hex digits for clearer output graphics.
---to output all the hex digits, use printf(1,"%06x", screenData[j][i])
---to output 'shortened' hex digits, use :
---printf(1, "%x", ( abs( ( (screenData[j][i] / #FFFFF) - 1 ) ) - 1 ) )
---and
---printf(1,"%x", abs( ( (screenData[j][i] / #FFFFF) - 1 ) ) )
---
---,respectively in the last if check.
---*/
diff --git a/Task/Bitmap-Bresenhams-line-algorithm/Pluto/bitmap-bresenhams-line-algorithm.pluto b/Task/Bitmap-Bresenhams-line-algorithm/Pluto/bitmap-bresenhams-line-algorithm.pluto
deleted file mode 100644
index 8ab23127e7..0000000000
--- a/Task/Bitmap-Bresenhams-line-algorithm/Pluto/bitmap-bresenhams-line-algorithm.pluto
+++ /dev/null
@@ -1,27 +0,0 @@
-local canvas = require "canvas"
-
-local function line(c, x0, y0, x1, y1, col)
- local dx = math.abs(x1 - x0)
- local dy = math.abs(y1 - y0)
- local sx = (x0 < x1) ? 1 : -1
- local sy = (y0 < y1) ? 1 : -1
- local err = (dx > dy ? dx : - dy) // 2
- while true do
- c:set(x0, y0, col)
- if x0 == x1 and y0 == y1 then break end
- local e2 = err
- if e2 > -dx then
- err -= dy
- x0 += sx
- end
- if e2 < dy then
- err += dx
- y0 += sy
- end
- end
-end
-
-local c = canvas.new(400, 400)
-c:fill(0xffffff) -- white background
-line(c, 0, 0, 399, 399, 0x0000ff) -- draw a red diagonal
-io.contents("mybmp.bmp", c:tobmp()) -- save to a bitmap file
diff --git a/Task/Bitmap-Bresenhams-line-algorithm/VBScript/bitmap-bresenhams-line-algorithm.vb b/Task/Bitmap-Bresenhams-line-algorithm/VBScript/bitmap-bresenhams-line-algorithm.vb
deleted file mode 100644
index ae619cc394..0000000000
--- a/Task/Bitmap-Bresenhams-line-algorithm/VBScript/bitmap-bresenhams-line-algorithm.vb
+++ /dev/null
@@ -1,53 +0,0 @@
-'Bitmap/Bresenham's line algorithm - VBScript - 13/05/2019
- Dim map(48,40), list(10), ox, oy
- data=Array(1,8, 8,16, 16,8, 8,1, 1,8)
- For i=0 To UBound(map,1): For j=0 To UBound(map,2)
- map(i,j)="."
- Next: Next 'j, i
- points=(UBound(data)+1)/2
- For p=1 To points
- x=data((p-1)*2)
- y=data((p-1)*2+1)
- list(p)=Array(x,y)
- If p=1 Then minX=x: maxX=x: minY=y: maxY=y
- If xmaxX Then maxX=x
- If ymaxY Then maxY=y
- Next 'p
- border=2
- minX=minX-border*2 : maxX=maxX+border*2
- minY=minY-border : maxY=maxY+border
- ox =-minX : oy =-minY
- wx=UBound(map,1)-ox : If maxX>wx Then maxX=wx
- wy=UBound(map,2)-oy : If maxY>wy Then maxY=wy
- For x=minX To maxX: map(x+ox,0+oy)="-": Next 'x
- For y=minY To maxY: map(0+ox,y+oy)="|": Next 'y
- map(ox,oy)="+"
- For p=1 To points-1
- draw_line list(p), list(p+1)
- Next 'p
- For y=maxY To minY Step -1
- line=""
- For x=minX To maxX
- line=line & map(x+ox,y+oy)
- Next 'x
- Wscript.Echo line
- Next 'y
-
-Sub draw_line(p1, p2)
- Dim x,y,xf,yf,dx,dy,sx,sy,err,err2
- x =p1(0) : y =p1(1)
- xf=p2(0) : yf=p2(1)
- dx=Abs(xf-x) : dy=Abs(yf-y)
- If x-dy Then err=err-dy: x=x+sx
- If err2< dx Then err=err+dx: y=y+sy
- Loop
-End Sub 'draw_line
diff --git a/Task/Bitmap-Flood-fill/Ada/bitmap-flood-fill-1.ada b/Task/Bitmap-Flood-fill/Ada/bitmap-flood-fill-1.ada
deleted file mode 100644
index 3ed634e0a2..0000000000
--- a/Task/Bitmap-Flood-fill/Ada/bitmap-flood-fill-1.ada
+++ /dev/null
@@ -1,106 +0,0 @@
-procedure Flood_Fill
- ( Picture : in out Image;
- From : Point;
- Fill : Pixel;
- Replace : Pixel;
- Distance : Luminance := 20
- ) is
- function Diff (A, B : Luminance) return Luminance is
- pragma Inline (Diff);
- begin
- if A > B then
- return A - B;
- else
- return B - A;
- end if;
- end Diff;
-
- function "-" (A, B : Pixel) return Luminance is
- pragma Inline ("-");
- begin
- return Luminance'Max (Luminance'Max (Diff (A.R, B.R), Diff (A.G, B.G)), Diff (A.B, B.B));
- end "-";
- procedure Column (From : Point);
- procedure Row (From : Point);
-
- Visited : array (Picture'Range (1), Picture'Range (2)) of Boolean :=
- (others => (others => False));
-
- procedure Column (From : Point) is
- X1 : Positive := From.X;
- X2 : Positive := From.X;
- begin
- Visited (From.X, From.Y) := True;
- for X in reverse Picture'First (1)..From.X - 1 loop
- exit when Visited (X, From.Y);
- declare
- Color : Pixel renames Picture (X, From.Y);
- begin
- Visited (X, From.Y) := True;
- exit when Color - Replace > Distance;
- Color := Fill;
- X1 := X;
- end;
- end loop;
- for X in From.X + 1..Picture'Last (1) loop
- exit when Visited (X, From.Y);
- declare
- Color : Pixel renames Picture (X, From.Y);
- begin
- Visited (X, From.Y) := True;
- exit when Color - Replace > Distance;
- Color := Fill;
- X2 := X;
- end;
- end loop;
- for X in X1..From.X - 1 loop
- Row ((X, From.Y));
- end loop;
- for X in From.X + 1..X2 loop
- Row ((X, From.Y));
- end loop;
- end Column;
-
- procedure Row (From : Point) is
- Y1 : Positive := From.Y;
- Y2 : Positive := From.Y;
- begin
- Visited (From.X, From.Y) := True;
- for Y in reverse Picture'First (2)..From.Y - 1 loop
- exit when Visited (From.X, Y);
- declare
- Color : Pixel renames Picture (From.X, Y);
- begin
- Visited (From.X, Y) := True;
- exit when Color - Replace > Distance;
- Color := Fill;
- Y1 := Y;
- end;
- end loop;
- for Y in From.Y + 1..Picture'Last (2) loop
- exit when Visited (From.X, Y);
- declare
- Color : Pixel renames Picture (From.X, Y);
- begin
- Visited (From.X, Y) := True;
- exit when Color - Replace > Distance;
- Color := Fill;
- Y2 := Y;
- end;
- end loop;
- for Y in Y1..From.Y - 1 loop
- Column ((From.X, Y));
- end loop;
- for Y in From.Y + 1..Y2 loop
- Column ((From.X, Y));
- end loop;
- end Row;
-
- Color : Pixel renames Picture (From.X, From.Y);
-begin
- if Color - Replace <= Distance then
- Visited (From.X, From.Y) := True;
- Color := Fill;
- Column (From);
- end if;
-end Flood_Fill;
diff --git a/Task/Bitmap-Flood-fill/Ada/bitmap-flood-fill-2.ada b/Task/Bitmap-Flood-fill/Ada/bitmap-flood-fill-2.ada
deleted file mode 100644
index 3c1295d8e5..0000000000
--- a/Task/Bitmap-Flood-fill/Ada/bitmap-flood-fill-2.ada
+++ /dev/null
@@ -1,19 +0,0 @@
-declare
- File : File_Type;
-begin
- Open (File, In_File, "Unfilledcirc.ppm");
- declare
- Picture : Image := Get_PPM (File);
- begin
- Close (File);
- Flood_Fill
- ( Picture => Picture,
- From => (122, 30),
- Fill => (255,0,0),
- Replace => White
- );
- Create (File, Out_File, "Filledcirc.ppm");
- Put_PPM (File, Picture);
- Close (File);
- end;
-end;
diff --git a/Task/Bitmap-Histogram/Ada/bitmap-histogram-1.ada b/Task/Bitmap-Histogram/Ada/bitmap-histogram-1.ada
deleted file mode 100644
index 34aea24b09..0000000000
--- a/Task/Bitmap-Histogram/Ada/bitmap-histogram-1.ada
+++ /dev/null
@@ -1,17 +0,0 @@
-type Pixel_Count is mod 2**64;
-type Histogram is array (Luminance) of Pixel_Count;
-
-function Get_Histogram (Picture : Grayscale_Image) return Histogram is
- Result : Histogram := (others => 0);
-begin
- for I in Picture'Range (1) loop
- for J in Picture'Range (2) loop
- declare
- Count : Pixel_Count renames Result (Picture (I, J));
- begin
- Count := Count + 1;
- end;
- end loop;
- end loop;
- return Result;
-end Get_Histogram;
diff --git a/Task/Bitmap-Histogram/Ada/bitmap-histogram-2.ada b/Task/Bitmap-Histogram/Ada/bitmap-histogram-2.ada
deleted file mode 100644
index 2a0092b9c2..0000000000
--- a/Task/Bitmap-Histogram/Ada/bitmap-histogram-2.ada
+++ /dev/null
@@ -1,17 +0,0 @@
-function Median (H : Histogram) return Luminance is
- From : Luminance := Luminance'First;
- To : Luminance := Luminance'Last;
- Left : Pixel_Count := H (From);
- Right : Pixel_Count := H (To);
-begin
- while From /= To loop
- if Left < Right then
- From := From + 1;
- Left := Left + H (From);
- else
- To := To - 1;
- Right := Right + H (To);
- end if;
- end loop;
- return From;
-end Median;
diff --git a/Task/Bitmap-Histogram/Ada/bitmap-histogram-3.ada b/Task/Bitmap-Histogram/Ada/bitmap-histogram-3.ada
deleted file mode 100644
index 684e132fe5..0000000000
--- a/Task/Bitmap-Histogram/Ada/bitmap-histogram-3.ada
+++ /dev/null
@@ -1,22 +0,0 @@
- F1, F2 : File_Type;
-begin
- Open (F1, In_File, "city.ppm");
- declare
- X : Image := Get_PPM (F1);
- Y : Grayscale_Image := Grayscale (X);
- T : Luminance := Median (Get_Histogram (Y));
- begin
- Close (F1);
- Create (F2, Out_File, "city_art.ppm");
- for I in Y'Range (1) loop
- for J in Y'Range (2) loop
- if Y (I, J) < T then
- X (I, J) := Black;
- else
- X (I, J) := White;
- end if;
- end loop;
- end loop;
- Put_PPM (F2, X);
- end;
- Close (F2);
diff --git a/Task/Bitmap-Midpoint-circle-algorithm/Ada/bitmap-midpoint-circle-algorithm-1.ada b/Task/Bitmap-Midpoint-circle-algorithm/Ada/bitmap-midpoint-circle-algorithm-1.ada
deleted file mode 100644
index c6f1f9c0e7..0000000000
--- a/Task/Bitmap-Midpoint-circle-algorithm/Ada/bitmap-midpoint-circle-algorithm-1.ada
+++ /dev/null
@@ -1,35 +0,0 @@
-procedure Circle
- ( Picture : in out Image;
- Center : Point;
- Radius : Natural;
- Color : Pixel
- ) is
- F : Integer := 1 - Radius;
- ddF_X : Integer := 0;
- ddF_Y : Integer := -2 * Radius;
- X : Integer := 0;
- Y : Integer := Radius;
-begin
- Picture (Center.X, Center.Y + Radius) := Color;
- Picture (Center.X, Center.Y - Radius) := Color;
- Picture (Center.X + Radius, Center.Y) := Color;
- Picture (Center.X - Radius, Center.Y) := Color;
- while X < Y loop
- if F >= 0 then
- Y := Y - 1;
- ddF_Y := ddF_Y + 2;
- F := F + ddF_Y;
- end if;
- X := X + 1;
- ddF_X := ddF_X + 2;
- F := F + ddF_X + 1;
- Picture (Center.X + X, Center.Y + Y) := Color;
- Picture (Center.X - X, Center.Y + Y) := Color;
- Picture (Center.X + X, Center.Y - Y) := Color;
- Picture (Center.X - X, Center.Y - Y) := Color;
- Picture (Center.X + Y, Center.Y + X) := Color;
- Picture (Center.X - Y, Center.Y + X) := Color;
- Picture (Center.X + Y, Center.Y - X) := Color;
- Picture (Center.X - Y, Center.Y - X) := Color;
- end loop;
-end Circle;
diff --git a/Task/Bitmap-Midpoint-circle-algorithm/Ada/bitmap-midpoint-circle-algorithm-2.ada b/Task/Bitmap-Midpoint-circle-algorithm/Ada/bitmap-midpoint-circle-algorithm-2.ada
deleted file mode 100644
index 2965984410..0000000000
--- a/Task/Bitmap-Midpoint-circle-algorithm/Ada/bitmap-midpoint-circle-algorithm-2.ada
+++ /dev/null
@@ -1,5 +0,0 @@
- X : Image (1..16, 1..16);
-begin
- Fill (X, White);
- Circle (X, (8, 8), 5, Black);
- Print (X);
diff --git a/Task/Bitmap-Midpoint-circle-algorithm/Pluto/bitmap-midpoint-circle-algorithm.pluto b/Task/Bitmap-Midpoint-circle-algorithm/Pluto/bitmap-midpoint-circle-algorithm.pluto
deleted file mode 100644
index c0d4f3ed9c..0000000000
--- a/Task/Bitmap-Midpoint-circle-algorithm/Pluto/bitmap-midpoint-circle-algorithm.pluto
+++ /dev/null
@@ -1,33 +0,0 @@
-local canvas = require "canvas"
-
-local function trunc(x) return x >= 0 ? math.floor(x) : math.ceil(x) end
-
-local function circle(c, cx, cy, r, col)
- local d = trunc((5 - r * 4) / 4)
- local x = 0
- local y = r
- repeat
- c:set(cx + x, cy + y, col)
- c:set(cx + x, cy - y, col)
- c:set(cx - x, cy + y, col)
- c:set(cx - x, cy - y, col)
- c:set(cx + y, cy + x, col)
- c:set(cx + y, cy - x, col)
- c:set(cx - y, cy + x, col)
- c:set(cx - y, cy - x, col)
- if d < 0 then
- d += 2 * x + 1
- else
- d += 2 * (x - y) + 1
- y -= 1
- end
- ++x
- until x > y
-end
-
-local c = canvas.new(400, 400)
-c:fill(0xffffff) -- white background
-
--- Draw a blue circle with centre at (200, 200) and radius 100.
-circle(c, 200, 200, 100, 0xff0000)
-io.contents("mybmp.bmp", c:tobmp()) -- save to a bitmap file
diff --git a/Task/Bitmap-Read-a-PPM-file/Ada/bitmap-read-a-ppm-file-1.ada b/Task/Bitmap-Read-a-PPM-file/Ada/bitmap-read-a-ppm-file-1.ada
deleted file mode 100644
index f65e4e307b..0000000000
--- a/Task/Bitmap-Read-a-PPM-file/Ada/bitmap-read-a-ppm-file-1.ada
+++ /dev/null
@@ -1,70 +0,0 @@
-with Ada.Characters.Latin_1; use Ada.Characters.Latin_1;
-with Ada.Integer_Text_IO; use Ada.Integer_Text_IO;
-with Ada.Streams.Stream_IO; use Ada.Streams.Stream_IO;
-
-function Get_PPM (File : File_Type) return Image is
- use Ada.Characters.Latin_1;
- use Ada.Integer_Text_IO;
-
- function Get_Line return String is -- Skips comments
- Byte : Character;
- Buffer : String (1..80);
- begin
- loop
- for I in Buffer'Range loop
- Character'Read (Stream (File), Byte);
- if Byte = LF then
- exit when Buffer (1) = '#';
- return Buffer (1..I - 1);
- end if;
- Buffer (I) := Byte;
- end loop;
- if Buffer (1) /= '#' then
- raise Data_Error;
- end if;
- end loop;
- end Get_Line;
-
- Height : Integer;
- Width : Integer;
-begin
- if Get_Line /= "P6" then
- raise Data_Error;
- end if;
- declare
- Line : String := Get_Line;
- Start : Integer := Line'First;
- Last : Positive;
- begin
- Get (Line, Width, Last); Start := Start + Last;
- Get (Line (Start..Line'Last), Height, Last); Start := Start + Last;
- if Start <= Line'Last then
- raise Data_Error;
- end if;
- if Width < 1 or else Height < 1 then
- raise Data_Error;
- end if;
- end;
- if Get_Line /= "255" then
- raise Data_Error;
- end if;
- declare
- Result : Image (1..Height, 1..Width);
- Buffer : String (1..Width * 3);
- Index : Positive;
- begin
- for I in Result'Range (1) loop
- String'Read (Stream (File), Buffer);
- Index := Buffer'First;
- for J in Result'Range (2) loop
- Result (I, J) :=
- ( R => Luminance (Character'Pos (Buffer (Index))),
- G => Luminance (Character'Pos (Buffer (Index + 1))),
- B => Luminance (Character'Pos (Buffer (Index + 2)))
- );
- Index := Index + 3;
- end loop;
- end loop;
- return Result;
- end;
-end Get_PPM;
diff --git a/Task/Bitmap-Read-a-PPM-file/Ada/bitmap-read-a-ppm-file-2.ada b/Task/Bitmap-Read-a-PPM-file/Ada/bitmap-read-a-ppm-file-2.ada
deleted file mode 100644
index 2c362394f4..0000000000
--- a/Task/Bitmap-Read-a-PPM-file/Ada/bitmap-read-a-ppm-file-2.ada
+++ /dev/null
@@ -1,9 +0,0 @@
-declare
- F1, F2 : File_Type;
-begin
- Open (F1, In_File, "city.ppm");
- Create (F2, Out_File, "city_grayscale.ppm");
- Put_PPM (F2, Color (Grayscale (Get_PPM (F1))));
- Close (F1);
- Close (F2);
-end;
diff --git a/Task/Bitmap-Read-a-PPM-file/Euphoria/bitmap-read-a-ppm-file-1.ex b/Task/Bitmap-Read-a-PPM-file/Euphoria/bitmap-read-a-ppm-file-1.ex
deleted file mode 100644
index 43a403152e..0000000000
--- a/Task/Bitmap-Read-a-PPM-file/Euphoria/bitmap-read-a-ppm-file-1.ex
+++ /dev/null
@@ -1,41 +0,0 @@
-include get.e
-
-function get2(integer fn)
- sequence temp
- temp = get(fn)
- return temp[2] - temp[1]*temp[1]
-end function
-
-function read_ppm(sequence filename)
- sequence image, line
- integer dimx, dimy, maxcolor
- atom fn
- fn = open(filename, "rb")
- if fn < 0 then
- return -1 -- unable to open
- end if
- line = gets(fn)
- if not equal(line,"P6\n") then
- return -1 -- only ppm6 files are supported
- end if
- dimx = get2(fn)
- if dimx < 0 then
- return -1
- end if
- dimy = get2(fn)
- if dimy < 0 then
- return -1
- end if
- maxcolor = get2(fn)
- if maxcolor != 255 then
- return -1 -- maxcolors other then 255 are not supported
- end if
- image = repeat(repeat(0,dimy),dimx)
- for y = 1 to dimy do
- for x = 1 to dimx do
- image[x][y] = getc(fn)*#10000 + getc(fn)*#100 + getc(fn)
- end for
- end for
- close(fn)
- return image
-end function
diff --git a/Task/Bitmap-Read-a-PPM-file/Euphoria/bitmap-read-a-ppm-file-2.ex b/Task/Bitmap-Read-a-PPM-file/Euphoria/bitmap-read-a-ppm-file-2.ex
deleted file mode 100644
index e23aa5fafd..0000000000
--- a/Task/Bitmap-Read-a-PPM-file/Euphoria/bitmap-read-a-ppm-file-2.ex
+++ /dev/null
@@ -1,5 +0,0 @@
-sequence image
-image = read_ppm("image.ppm")
-image = to_gray(image)
-image = to_color(image)
-write_ppm("image_gray.ppm",image)
diff --git a/Task/Bitmap-Write-a-PPM-file/Ada/bitmap-write-a-ppm-file.ada b/Task/Bitmap-Write-a-PPM-file/Ada/bitmap-write-a-ppm-file.ada
deleted file mode 100644
index c3611189b3..0000000000
--- a/Task/Bitmap-Write-a-PPM-file/Ada/bitmap-write-a-ppm-file.ada
+++ /dev/null
@@ -1,29 +0,0 @@
-with Ada.Characters.Latin_1;
-with Ada.Streams.Stream_IO; use Ada.Streams.Stream_IO;
-
-with Bitmap_Store; use Bitmap_Store;
--- This package is defined in the Bitmap task.
-
-procedure Put_PPM (File : File_Type; Picture : Image) is
- use Ada.Characters.Latin_1;
- Size : constant String := Integer'Image (Picture'Length (2)) & Integer'Image (Picture'Length (1));
- Buffer : String (1..Picture'Length (2) * 3);
- Color : Pixel;
- Index : Positive;
-begin
- String'Write (Stream (File), "P6" & LF);
- String'Write (Stream (File), Size (2..Size'Last) & LF);
- String'Write (Stream (File), "255" & LF);
- for I in Picture'Range (1) loop
- Index := Buffer'First;
- for J in Picture'Range (2) loop
- Color := Picture (I, J);
- Buffer (Index) := Character'Val (Color.R);
- Buffer (Index + 1) := Character'Val (Color.G);
- Buffer (Index + 2) := Character'Val (Color.B);
- Index := Index + 3;
- end loop;
- String'Write (Stream (File), Buffer);
- end loop;
- Character'Write (Stream (File), LF);
-end Put_PPM;
diff --git a/Task/Bitmap-Write-a-PPM-file/Euphoria/bitmap-write-a-ppm-file-1.ex b/Task/Bitmap-Write-a-PPM-file/Euphoria/bitmap-write-a-ppm-file-1.ex
deleted file mode 100644
index b7ab37e6f8..0000000000
--- a/Task/Bitmap-Write-a-PPM-file/Euphoria/bitmap-write-a-ppm-file-1.ex
+++ /dev/null
@@ -1,15 +0,0 @@
-constant dimx = 800, dimy = 800
-constant fn = open("first.ppm","wb") -- b - binary mode
-sequence color
-printf(fn, "P6\n%d %d\n255\n", {dimx,dimy})
-for j = 0 to dimy-1 do
- for i = 0 to dimx-1 do
- color = {
- remainder(i,256), -- red
- remainder(j,256), -- green
- remainder(i*j,256) -- blue
- }
- puts(fn,color)
- end for
-end for
-close(fn)
diff --git a/Task/Bitmap-Write-a-PPM-file/Euphoria/bitmap-write-a-ppm-file-2.ex b/Task/Bitmap-Write-a-PPM-file/Euphoria/bitmap-write-a-ppm-file-2.ex
deleted file mode 100644
index 4a3c444ae5..0000000000
--- a/Task/Bitmap-Write-a-PPM-file/Euphoria/bitmap-write-a-ppm-file-2.ex
+++ /dev/null
@@ -1,14 +0,0 @@
-procedure write_ppm(sequence filename, sequence image)
- integer fn,dimx,dimy
- dimy = length(image[1])
- dimx = length(image)
- fn = open(filename,"wb")
- printf(fn, "P6\n%d %d\n255\n", {dimx,dimy})
- for y = 1 to dimy do
- for x = 1 to dimx do
- puts(fn, and_bits(image[x][y], {#FF0000,#FF00,#FF}) /
- {#010000,#0100,#01}) -- unpack color triple
- end for
- end for
- close(fn)
-end procedure
diff --git a/Task/Bitmap/Ada/bitmap-1.ada b/Task/Bitmap/Ada/bitmap-1.ada
deleted file mode 100644
index c239196025..0000000000
--- a/Task/Bitmap/Ada/bitmap-1.ada
+++ /dev/null
@@ -1,17 +0,0 @@
-package Bitmap_Store is
- type Luminance is mod 2**8;
- type Pixel is record
- R, G, B : Luminance := Luminance'First;
- end record;
- Black : constant Pixel := (others => Luminance'First);
- White : constant Pixel := (others => Luminance'Last);
- type Image is array (Positive range <>, Positive range <>) of Pixel;
-
- procedure Fill (Picture : in out Image; Color : Pixel);
-
- procedure Print (Picture : Image);
-
- type Point is record
- X, Y : Positive;
- end record;
-end Bitmap_Store;
diff --git a/Task/Bitmap/Ada/bitmap-2.ada b/Task/Bitmap/Ada/bitmap-2.ada
deleted file mode 100644
index 72c9941cf1..0000000000
--- a/Task/Bitmap/Ada/bitmap-2.ada
+++ /dev/null
@@ -1,20 +0,0 @@
-with Ada.Text_IO; use Ada.Text_IO;
-
-package body Bitmap_Store is
-
- procedure Fill (Picture : in out Image; Color : Pixel) is
- begin
- for p of Picture loop x:= Color;end loop;
- end Fill;
-
- procedure Print (Picture : Image) is
- begin
- for I in Picture'Range (1) loop
- for J in Picture'Range (2) loop
- Put (if Picture (I, J) = White then ' ' else 'H');
- end loop;
- New_Line;
- end loop;
- end Print;
-
-end Bitmap_Store;
diff --git a/Task/Bitmap/Ada/bitmap-3.ada b/Task/Bitmap/Ada/bitmap-3.ada
deleted file mode 100644
index 440209b31c..0000000000
--- a/Task/Bitmap/Ada/bitmap-3.ada
+++ /dev/null
@@ -1,7 +0,0 @@
-use Bitmap_Store; with Bitmap_Store;
- ...
- X : Image (1..64, 1..64);
-begin
- Fill (X, (255, 255, 255));
- X (1, 2) := (R => 255, others => 0);
- X (3, 4) := X (1, 2);
diff --git a/Task/Bitmap/Crystal/bitmap.cr b/Task/Bitmap/Crystal/bitmap.cr
deleted file mode 100644
index fb4b8d9952..0000000000
--- a/Task/Bitmap/Crystal/bitmap.cr
+++ /dev/null
@@ -1,36 +0,0 @@
-class RGBColor
- getter red, green, blue
-
- def initialize(@red = 0_u8, @green = 0_u8, @blue = 0_u8)
- end
-
- RED = new(red: 255_u8)
- GREEN = new(green: 255_u8)
- BLUE = new(blue: 255_u8)
- BLACK = new
- WHITE = new(255_u8, 255_u8, 255_u8)
-end
-
-class Pixmap
- getter width, height
- @data : Array(Array(RGBColor))
-
- def initialize(@width : Int32, @height : Int32)
- @data = Array.new(@width) { Array.new(@height, RGBColor::WHITE) }
- end
-
- def fill(color)
- @data.each &.fill(color)
- end
-
- def [](x, y)
- @data[x][y]
- end
-
- def []=(x, y, color)
- @data[x][y] = color
- end
-end
-
-bmap = Pixmap.new(5, 5)
-pp bmap
diff --git a/Task/Bitmap/Euphoria/bitmap.ex b/Task/Bitmap/Euphoria/bitmap.ex
deleted file mode 100644
index e27c170c4e..0000000000
--- a/Task/Bitmap/Euphoria/bitmap.ex
+++ /dev/null
@@ -1,23 +0,0 @@
--- Some color constants:
-constant
- black = #000000,
- white = #FFFFFF,
- red = #FF0000,
- green = #00FF00,
- blue = #0000FF
-
--- Create new image filled with some color
-function new_image(integer width, integer height, atom fill_color)
- return repeat(repeat(fill_color,height),width)
-end function
-
--- Usage example:
-sequence image
-image = new_image(800,600,black)
-
--- Set pixel color:
-image[400][300] = red
-
--- Get pixel color
-atom color
-color = image[400][300] -- Now color is #FF0000
diff --git a/Task/Bitmap/Pluto/bitmap.pluto b/Task/Bitmap/Pluto/bitmap.pluto
deleted file mode 100644
index 8901f27d06..0000000000
--- a/Task/Bitmap/Pluto/bitmap.pluto
+++ /dev/null
@@ -1,23 +0,0 @@
-local canvas = require "canvas"
-
--- Create a new canvas object: 400 pixels wide and 400 pixels high.
-local c = canvas.new(400, 400)
-
--- Color the whole canvas blue.
-c:fill(0xff0000)
-
--- Draw a red square in the middle.
-for i = 1, 51 do
- for j = 1, 51 do
- c:set(174 + i, 174 + j, 0x0000ff)
- end
-end
-
--- Print to the terminal the color (as an integer) of a pixel.
-print(c:get(200, 200)) -- 255
-
--- Convert the canvas to a BMP image.
-local image = c:tobmp()
-
--- Save the image to a file.
-io.contents("mybmp.bmp", image)
diff --git a/Task/Bitwise-IO/Ada/bitwise-io-1.ada b/Task/Bitwise-IO/Ada/bitwise-io-1.ada
deleted file mode 100644
index f91b32ddf9..0000000000
--- a/Task/Bitwise-IO/Ada/bitwise-io-1.ada
+++ /dev/null
@@ -1,20 +0,0 @@
-with Ada.Streams; use Ada.Streams;
-with Ada.Finalization;
-
-package Bit_Streams is
- type Bit is range 0..1;
- type Bit_Array is array (Positive range <>) of Bit;
- type Bit_Stream (Channel : not null access Root_Stream_Type'Class) is limited private;
- procedure Read (Stream : in out Bit_Stream; Data : out Bit_Array);
- procedure Write (Stream : in out Bit_Stream; Data : Bit_Array);
-private
- type Bit_Stream (Channel : not null access Root_Stream_Type'Class) is
- new Ada.Finalization.Limited_Controlled with
- record
- Read_Count : Natural := 0;
- Write_Count : Natural := 0;
- Input : Stream_Element_Array (1..1);
- Output : Stream_Element_Array (1..1);
- end record;
- overriding procedure Finalize (Stream : in out Bit_Stream);
-end Bit_Streams;
diff --git a/Task/Bitwise-IO/Ada/bitwise-io-2.ada b/Task/Bitwise-IO/Ada/bitwise-io-2.ada
deleted file mode 100644
index 0468988655..0000000000
--- a/Task/Bitwise-IO/Ada/bitwise-io-2.ada
+++ /dev/null
@@ -1,33 +0,0 @@
-package body Bit_Streams is
- procedure Finalize (Stream : in out Bit_Stream) is
- begin
- if Stream.Write_Count > 0 then
- Stream.Output (1) := Stream.Output (1) * 2**(Stream_Element'Size - Stream.Write_Count);
- Stream.Channel.Write (Stream.Output);
- end if;
- end Finalize;
- procedure Read (Stream : in out Bit_Stream; Data : out Bit_Array) is
- Last : Stream_Element_Offset;
- begin
- for Index in Data'Range loop
- if Stream.Read_Count = 0 then
- Stream.Channel.Read (Stream.Input, Last);
- Stream.Read_Count := Stream_Element'Size;
- end if;
- Data (Index) := Bit (Stream.Input (1) / 2**(Stream_Element'Size - 1));
- Stream.Input (1) := Stream.Input (1) * 2;
- Stream.Read_Count := Stream.Read_Count - 1;
- end loop;
- end Read;
- procedure Write (Stream : in out Bit_Stream; Data : Bit_Array) is
- begin
- for Index in Data'Range loop
- if Stream.Write_Count = Stream_Element'Size then
- Stream.Channel.Write (Stream.Output);
- Stream.Write_Count := 0;
- end if;
- Stream.Output (1) := Stream.Output (1) * 2 or Stream_Element (Data (Index));
- Stream.Write_Count := Stream.Write_Count + 1;
- end loop;
- end Write;
-end Bit_Streams;
diff --git a/Task/Bitwise-IO/Ada/bitwise-io-3.ada b/Task/Bitwise-IO/Ada/bitwise-io-3.ada
deleted file mode 100644
index a2db2756aa..0000000000
--- a/Task/Bitwise-IO/Ada/bitwise-io-3.ada
+++ /dev/null
@@ -1,33 +0,0 @@
-with Ada.Streams.Stream_IO; use Ada.Streams.Stream_IO;
-with Bit_Streams; use Bit_Streams;
-
-procedure Test_Bit_Streams is
- File : File_Type;
- ABACUS : Bit_Array :=
- ( 1,0,0,0,0,0,1, -- A, big endian
- 1,0,0,0,0,1,0, -- B
- 1,0,0,0,0,0,1, -- A
- 1,0,0,0,0,1,1, -- C
- 1,0,1,0,1,0,1, -- U
- 1,0,1,0,0,1,1 -- S
- );
- Data : Bit_Array (ABACUS'Range);
-begin
- Create (File, Out_File, "abacus.dat");
- declare
- Bits : Bit_Stream (Stream (File));
- begin
- Write (Bits, ABACUS);
- end;
- Close (File);
- Open (File, In_File, "abacus.dat");
- declare
- Bits : Bit_Stream (Stream (File));
- begin
- Read (Bits, Data);
- end;
- Close (File);
- if Data /= ABACUS then
- raise Data_Error;
- end if;
-end Test_Bit_Streams;
diff --git a/Task/Bitwise-operations/Ada/bitwise-operations.ada b/Task/Bitwise-operations/Ada/bitwise-operations.ada
deleted file mode 100644
index c81c073512..0000000000
--- a/Task/Bitwise-operations/Ada/bitwise-operations.ada
+++ /dev/null
@@ -1,23 +0,0 @@
-with Ada.Text_IO, Interfaces;
-use Ada.Text_IO, Interfaces;
-
-procedure Bitwise is
- subtype Byte is Unsigned_8;
- package Byte_IO is new Ada.Text_Io.Modular_IO (Byte);
-
- A : constant Byte := 2#00011110#;
- B : constant Byte := 2#11110100#;
- X : constant Byte := 128;
- N : constant Natural := 1;
-begin
- Put ("A and B = "); Byte_IO.Put (Item => A and B, Base => 2); New_Line;
- Put ("A or B = "); Byte_IO.Put (Item => A or B, Base => 2); New_Line;
- Put ("A xor B = "); Byte_IO.Put (Item => A xor B, Base => 2); New_Line;
- Put ("not A = "); Byte_IO.Put (Item => not A, Base => 2); New_Line;
- New_Line (2);
- Put_Line (Unsigned_8'Image (Shift_Left (X, N)));
- Put_Line (Unsigned_8'Image (Shift_Right (X, N)));
- Put_Line (Unsigned_8'Image (Shift_Right_Arithmetic (X, N)));
- Put_Line (Unsigned_8'Image (Rotate_Left (X, N)));
- Put_Line (Unsigned_8'Image (Rotate_Right (X, N)));
-end Bitwise;
diff --git a/Task/Bitwise-operations/AutoIt/bitwise-operations.autoit b/Task/Bitwise-operations/AutoIt/bitwise-operations.autoit
deleted file mode 100644
index 0428a6ff04..0000000000
--- a/Task/Bitwise-operations/AutoIt/bitwise-operations.autoit
+++ /dev/null
@@ -1,12 +0,0 @@
-bitwise(255, 5)
-Func bitwise($a, $b)
- MsgBox(1, '', _
- $a & " AND " & $b & ": " & BitAND($a, $b) & @CRLF & _
- $a & " OR " & $b & ": " & BitOR($a, $b) & @CRLF & _
- $a & " XOR " & $b & ": " & BitXOR($a, $b) & @CRLF & _
- "NOT " & $a & ": " & BitNOT($a) & @CRLF & _
- $a & " SHL " & $b & ": " & BitShift($a, $b * -1) & @CRLF & _
- $a & " SHR " & $b & ": " & BitShift($a, $b) & @CRLF & _
- $a & " ROL " & $b & ": " & BitRotate($a, $b) & @CRLF & _
- $a & " ROR " & $b & ": " & BitRotate($a, $b * -1) & @CRLF )
-EndFunc
diff --git a/Task/Bitwise-operations/COBOL/bitwise-operations-1.cobol b/Task/Bitwise-operations/COBOL/bitwise-operations-1.cobol
deleted file mode 100644
index 2c7db9603d..0000000000
--- a/Task/Bitwise-operations/COBOL/bitwise-operations-1.cobol
+++ /dev/null
@@ -1,55 +0,0 @@
- IDENTIFICATION DIVISION.
- PROGRAM-ID. bitwise-ops.
-
- DATA DIVISION.
- LOCAL-STORAGE SECTION.
- 01 a PIC 1(32) USAGE BIT.
- 01 b PIC 1(32) USAGE BIT.
- 01 result PIC 1(32) USAGE BIT.
- 01 result-disp REDEFINES result
- PIC S9(9) USAGE COMPUTATIONAL.
- LINKAGE SECTION.
- 01 a-int USAGE BINARY-LONG.
- 01 b-int USAGE BINARY-LONG.
-
- PROCEDURE DIVISION USING a-int, b-int.
- MOVE FUNCTION BOOLEAN-OF-INTEGER(a-int, 32) TO a
- MOVE FUNCTION BOOLEAN-OF-INTEGER(b-int, 32) TO b
-
- COMPUTE result = a B-AND b
- DISPLAY "a and b is " result-disp
-
- COMPUTE result = a B-OR b
- DISPLAY "a or b is " result-disp
-
- COMPUTE result = B-NOT a
- DISPLAY "Not a is " result-disp
-
- COMPUTE result = a B-XOR b
- DISPLAY "a exclusive-or b is " result-disp
-
- *> More complex operations can be constructed from these.
-
- COMPUTE result = B-NOT (a B-XOR b)
- DISPLAY "Logical equivalence of a and b is " result-disp
-
- COMPUTE result = (B-NOT a) B-AND b
- DISPLAY "Logical implication of a and b is " result-disp
-
- *> Shift and rotation operators were only added in COBOL 2023.
-
- COMPUTE result = a B-SHIFT-L b
- DISPLAY "a shifted left by b is " result-disp
-
- COMPUTE result = b B-SHIFT-R a
- DISPLAY "b shifted right by a is " result-disp
-
- COMPUTE result = a B-SHIFT-LC b
- DISPLAY "a rotated left by b is " result-disp
-
- COMPUTE result = b B-SHIFT-RC a
- DISPLAY "b rotated right by a is " result-disp
-
- GOBACK.
-
- END PROGRAM bitwise-ops.
diff --git a/Task/Bitwise-operations/COBOL/bitwise-operations-2.cobol b/Task/Bitwise-operations/COBOL/bitwise-operations-2.cobol
deleted file mode 100644
index 08d7cdc4d6..0000000000
--- a/Task/Bitwise-operations/COBOL/bitwise-operations-2.cobol
+++ /dev/null
@@ -1,41 +0,0 @@
- IDENTIFICATION DIVISION.
- PROGRAM-ID. mf-bitwise-ops.
-
- DATA DIVISION.
- LOCAL-STORAGE SECTION.
- 01 result USAGE BINARY-LONG.
- 78 arg-len VALUE LENGTH OF result.
-
- LINKAGE SECTION.
- 01 a USAGE BINARY-LONG.
- 01 b USAGE BINARY-LONG.
-
- PROCEDURE DIVISION USING a, b.
- main-line.
- MOVE b TO result
- CALL "CBL_AND" USING a, result, VALUE arg-len
- DISPLAY "a and b is " result
-
- MOVE b TO result
- CALL "CBL_OR" USING a, result, VALUE arg-len
- DISPLAY "a or b is " result
-
- MOVE a TO result
- CALL "CBL_NOT" USING result, VALUE arg-len
- DISPLAY "Not a is " result
-
- MOVE b TO result
- CALL "CBL_XOR" USING a, result, VALUE arg-len
- DISPLAY "a exclusive-or b is " result
-
- MOVE b TO result
- CALL "CBL_EQ" USING a, result, VALUE arg-len
- DISPLAY "Logical equivalence of a and b is " result
-
- MOVE b TO result
- CALL "CBL_IMP" USING a, result, VALUE arg-len
- DISPLAY "Logical implication of a and b is " result
-
- GOBACK.
-
- END PROGRAM mf-bitwise-ops.
diff --git a/Task/Bitwise-operations/Elena/bitwise-operations.elena b/Task/Bitwise-operations/Elena/bitwise-operations.elena
index 7c1422857a..d176f667cd 100644
--- a/Task/Bitwise-operations/Elena/bitwise-operations.elena
+++ b/Task/Bitwise-operations/Elena/bitwise-operations.elena
@@ -13,7 +13,7 @@ extension testOp
}
}
-public program()
+public Program()
{
Console.loadLineTo(new Integer()).bitwiseTest(Console.loadLineTo(new Integer()))
}
diff --git a/Task/Bitwise-operations/PowerShell/bitwise-operations-1.psh b/Task/Bitwise-operations/PowerShell/bitwise-operations-1.psh
deleted file mode 100644
index d16e1bfbb0..0000000000
--- a/Task/Bitwise-operations/PowerShell/bitwise-operations-1.psh
+++ /dev/null
@@ -1,4 +0,0 @@
-$X -band $Y
-$X -bor $Y
-$X -bxor $Y
--bnot $X
diff --git a/Task/Bitwise-operations/PowerShell/bitwise-operations-2.psh b/Task/Bitwise-operations/PowerShell/bitwise-operations-2.psh
deleted file mode 100644
index b316ff6efa..0000000000
--- a/Task/Bitwise-operations/PowerShell/bitwise-operations-2.psh
+++ /dev/null
@@ -1,6 +0,0 @@
-$X -shl $Y
-# Arithmetic right shift
-$X -shr $Y
-
-# Requires quite a stretch of the imagination to call this "native" support of right rotate, but it works
-[System.Security.Cryptography.SHA256Managed].GetMethod('RotateRight', 'NonPublic, Static', $null, @([UInt32], [Int32]), $null).Invoke($null, @([uint32]$X, $Y))
diff --git a/Task/Blum-integer/Ada/blum-integer.ada b/Task/Blum-integer/Ada/blum-integer.ada
deleted file mode 100644
index 5c8e2c59ca..0000000000
--- a/Task/Blum-integer/Ada/blum-integer.ada
+++ /dev/null
@@ -1,89 +0,0 @@
-with Ada.Text_IO; use Ada.Text_IO;
-with Ada.Integer_Text_IO; use Ada.Integer_Text_IO;
-with Ada.Float_Text_IO; use Ada.Float_Text_IO;
-
-procedure Blum is
-
- Inc : Constant array (1 .. 8) of Integer := (4, 2, 4, 2, 4, 6, 2, 6);
-
- function Is_Prime (N : Integer) return Boolean is
- D : Integer := 5;
- begin
- if N < 2 then return False; end if;
- if N mod 2 = 0 then return N = 2; end if;
- if N mod 3 = 0 then return N = 3; end if;
-
- while D * D <= N loop
- if N mod D = 0 then return False; end if;
- D := D + 2;
- if N mod D = 0 then return False; end if;
- D := D + 4;
- end loop;
-
- return True;
- end Is_Prime;
-
- function First_Prime_Factor (N : Integer) return Integer is
- D : Integer := 7;
- I : Integer := 1;
- begin
- if N = 1 then return 1; end if;
- if N mod 3 = 0 then return 3; end if;
- if N mod 5 = 0 then return 5; end if;
-
- while D * D <= N loop
- if N mod D = 0 then
- return D;
- end if;
- D := D + Inc(I);
- I := (I mod 8) + 1;
- end loop;
-
- return N;
- end First_Prime_Factor;
-
- I, Blum_Count : Integer := 1;
- J, P, Q : Integer;
- Blums : Array (1 .. 50) of Integer;
- Counts : Array (1 .. 4) of Integer := (others => 0);
- Final_Digits : Array (1 .. 4) of Integer := (1, 3, 7, 9);
-
-begin
- loop
- P := First_Prime_Factor(I);
- if P mod 4 = 3 then
- Q := I / P;
- if Q /= P and Q mod 4 = 3 and Is_Prime(Q) then
- if Blum_Count < 51 then Blums(Blum_Count) := I; end if;
- Counts(((I mod 10) / 3) + 1) := Counts(((I mod 10) / 3) + 1) + 1;
- Blum_Count := Blum_Count + 1;
- if Blum_Count = 51 then
- Put("First 50 Blum Integers:"); New_Line;
- for J in Integer range 1 .. 50 loop
- Put(Item => Blums(J), Width => 3); Put(" ");
- if J mod 10 = 0 then New_Line; end if;
- end loop;
- New_Line;
- elsif Blum_Count = 26829 or Blum_Count mod 100000 = 1 then
- Put("The "); Put(Item => Blum_Count, Width => 7);
- Put("th Blum Integer is: "); Put(Item => I, Width => 9);
- New_Line;
- if Blum_Count = 400001 then
- New_Line; Put("% Distribution of the First 400,000 Blum Integers:"); New_Line;
- for J in Integer range 1 .. 4 loop
- Put(" "); Put(Item => Float(Counts(J)) / 4000.0, Fore => 2, Aft => 3, Exp => 0);
- Put("% end in "); Put(Item => Final_Digits(J), Width => 1);
- New_Line;
- end loop;
- exit;
- end if;
- end if;
- end if;
- end if;
- if I mod 5 = 3 then
- I := I + 4;
- else
- I := I + 2;
- end if;
- end loop;
-end Blum;
diff --git a/Task/Boolean-values/Ada/boolean-values.ada b/Task/Boolean-values/Ada/boolean-values.ada
deleted file mode 100644
index 9316e2af11..0000000000
--- a/Task/Boolean-values/Ada/boolean-values.ada
+++ /dev/null
@@ -1 +0,0 @@
- type Boolean is (False, True);
diff --git a/Task/Boolean-values/Arturo/boolean-values.arturo b/Task/Boolean-values/Arturo/boolean-values.arturo
index 9a3129bc14..aa612af29c 100644
--- a/Task/Boolean-values/Arturo/boolean-values.arturo
+++ b/Task/Boolean-values/Arturo/boolean-values.arturo
@@ -1,7 +1,7 @@
a: true
b: false
-if? a [ print "yep" ] else [ print "nope" ]
+switch a [ print "yep" ][ print "nope" ]
-if? b -> print "nope"
-else -> print "yep"
+switch b -> print "nope"
+ -> print "yep"
diff --git a/Task/Boolean-values/COBOL/boolean-values-1.cobol b/Task/Boolean-values/COBOL/boolean-values-1.cobol
deleted file mode 100644
index d5f1241abb..0000000000
--- a/Task/Boolean-values/COBOL/boolean-values-1.cobol
+++ /dev/null
@@ -1 +0,0 @@
- 01 some-bool PIC 1 BIT.
diff --git a/Task/Boolean-values/COBOL/boolean-values-2.cobol b/Task/Boolean-values/COBOL/boolean-values-2.cobol
deleted file mode 100644
index 39dd3a3df5..0000000000
--- a/Task/Boolean-values/COBOL/boolean-values-2.cobol
+++ /dev/null
@@ -1,4 +0,0 @@
- 01 X PIC 9.
- 88 X-Is-One VALUE 1.
- 88 X-Is-Even VALUE 0 2 4 6 8.
- 88 X-Larger-Than-5 VALUE 6 THRU 9.
diff --git a/Task/Boolean-values/COBOL/boolean-values-3.cobol b/Task/Boolean-values/COBOL/boolean-values-3.cobol
deleted file mode 100644
index bb411f5080..0000000000
--- a/Task/Boolean-values/COBOL/boolean-values-3.cobol
+++ /dev/null
@@ -1,28 +0,0 @@
- PROGRAM-ID. Condition-Example.
-
- DATA DIVISION.
- WORKING-STORAGE SECTION.
- 01 Foo PIC 9 VALUE 5.
- 88 Is-Not-Zero VALUE 1 THRU 9
- WHEN SET TO FALSE IS 0.
-
- PROCEDURE DIVISION.
- Main.
- PERFORM Is-Foo-Zero
-
- SET Is-Not-Zero TO FALSE
- PERFORM Is-Foo-Zero
-
- SET Is-Not-Zero TO TRUE
- PERFORM Is-Foo-Zero
-
- GOBACK
- .
-
- Is-Foo-Zero.
- IF Is-Not-Zero
- DISPLAY "Foo is not zero, it is " Foo "."
- ELSE
- DISPLAY "Foo is zero."
- END-IF
- .
diff --git a/Task/Boolean-values/Crystal/boolean-values.cr b/Task/Boolean-values/Crystal/boolean-values.cr
index e07aedd7a8..02755b55d3 100644
--- a/Task/Boolean-values/Crystal/boolean-values.cr
+++ b/Task/Boolean-values/Crystal/boolean-values.cr
@@ -2,7 +2,7 @@ if false
puts "false"
elsif nil
puts "nil"
-elsif Pointer(Nil).new 0
+elsif Pointer(Nil).new 0_u64
puts "null pointer"
elsif true && "any other value"
puts "finally true!"
diff --git a/Task/Boolean-values/Haxe/boolean-values.haxe b/Task/Boolean-values/Haxe/boolean-values.haxe
deleted file mode 100644
index c2f8a2ed4c..0000000000
--- a/Task/Boolean-values/Haxe/boolean-values.haxe
+++ /dev/null
@@ -1,8 +0,0 @@
-class Main {
- static public function main():Void {
- var t = true;
- var f = false;
- $type(t);
- $type(f);
- }
-}
diff --git a/Task/Boolean-values/PowerShell/boolean-values.psh b/Task/Boolean-values/PowerShell/boolean-values.psh
deleted file mode 100644
index 4d06109c52..0000000000
--- a/Task/Boolean-values/PowerShell/boolean-values.psh
+++ /dev/null
@@ -1,2 +0,0 @@
-$true
-$false
diff --git a/Task/Boolean-values/VBScript/boolean-values.vb b/Task/Boolean-values/VBScript/boolean-values.vb
deleted file mode 100644
index d4db3e03a4..0000000000
--- a/Task/Boolean-values/VBScript/boolean-values.vb
+++ /dev/null
@@ -1,6 +0,0 @@
-a = True
-b = False
-Randomize Timer
-x = Int(Rnd * 2) <> 0
-y = Int(Rnd * 2) = 0
-MsgBox a & " " & b & " " & x & " " & y
diff --git a/Task/Box-the-compass/11l/box-the-compass.11l b/Task/Box-the-compass/11l/box-the-compass.11l
index 7ff6f201ec..ff86715b26 100644
--- a/Task/Box-the-compass/11l/box-the-compass.11l
+++ b/Task/Box-the-compass/11l/box-the-compass.11l
@@ -17,7 +17,7 @@ F degrees2compasspoint(=d)
R q[minorindex].replace(‘N’, p1).replace(‘E’, p2).capitalize()
:start:
-L(i) 33
+L(i) 0.<33
V d = i * 11.25
S i % 3
1
diff --git a/Task/Box-the-compass/Ada/box-the-compass.ada b/Task/Box-the-compass/Ada/box-the-compass.ada
deleted file mode 100644
index 6396c3b50b..0000000000
--- a/Task/Box-the-compass/Ada/box-the-compass.ada
+++ /dev/null
@@ -1,66 +0,0 @@
-with Ada.Text_IO;
-
-procedure Box_The_Compass is
-
- type Degrees is digits 5 range 0.00 .. 359.99;
- type Index_Type is mod 32;
-
- function Long_Name(Short: String) return String is
-
- function Char_To_Name(Char: Character) return String is
- begin
- case Char is
- when 'N' | 'n' => return Char & "orth";
- when 'S' | 's' => return Char & "outh";
- when 'E' | 'e' => return Char & "ast";
- when 'W' | 'w' => return Char & "est";
- when 'b' => return " by ";
- when '-' => return "-";
- when others => raise Constraint_Error;
- end case;
- end Char_To_Name;
-
- begin
- if Short'Length = 0 or else Short(Short'First)=' ' then
- return "";
- else
- return Char_To_Name(Short(Short'First))
- & Long_Name(Short(Short'First+1 .. Short'Last));
- end if;
- end Long_Name;
-
- procedure Put_Line(Angle: Degrees) is
-
- function Index(D: Degrees) return Index_Type is
- begin
- return Index_Type(Integer(Degrees'Rounding(D/11.25)) mod 32);
- end Index;
-
- I: Integer := Integer(Index(Angle))+1;
- package DIO is new Ada.Text_IO.Float_IO(Degrees);
- Abbr: constant array(Index_Type) of String(1 .. 4)
- := ("N ", "Nbe ", "N-ne", "Nebn", "Ne ", "Nebe", "E-ne", "Ebn ",
- "E ", "Ebs ", "E-se", "Sebe", "Se ", "Sebs", "S-se", "Sbe ",
- "S ", "Sbw ", "S-sw", "Swbs", "Sw ", "Swbw", "W-sw", "Wbs ",
- "W ", "Wbn ", "W-nw", "Nwbw", "Nw ", "Nwbn", "N-nw", "Nbw ");
-
- begin
- DIO.Put(Angle, Fore => 3, Aft => 2, Exp => 0); -- format "zzx.xx"
- Ada.Text_IO.Put(" |");
- if I <= 9 then
- Ada.Text_IO.Put(" ");
- end if;
- Ada.Text_IO.Put_Line(" " & Integer'Image(I) & " | "
- & Long_Name(Abbr(Index(Angle))));
- end Put_Line;
-
- Difference: constant array(0..2) of Degrees'Base
- := (0=> 0.0, 1=> +5.62, 2=> - 5.62);
-
-begin
- Ada.Text_IO.Put_Line(" angle | box | compass point");
- Ada.Text_IO.Put_Line(" ---------------------------------");
- for I in 0 .. 32 loop
- Put_Line(Degrees(Degrees'Base(I) * 11.25 + Difference(I mod 3)));
- end loop;
-end Box_The_Compass;
diff --git a/Task/Box-the-compass/AutoIt/box-the-compass.autoit b/Task/Box-the-compass/AutoIt/box-the-compass.autoit
deleted file mode 100644
index 7049c0455f..0000000000
--- a/Task/Box-the-compass/AutoIt/box-the-compass.autoit
+++ /dev/null
@@ -1,18 +0,0 @@
-Local $avArray[33] = [0.0, 16.87, 16.88, 33.75, 50.62, 50.63, 67.5, 84.37, 84.38, 101.25, 118.12, 118.13, 135.0, _
- 151.87, 151.88, 168.75, 185.62, 185.63, 202.5, 219.37, 219.38, 236.25, 253.12, 253.13, 270.0, 286.87, 286.88, _
- 303.75, 320.62, 320.63, 337.5, 354.37, 354.38]
-
-For $i = 0 To UBound($avArray) - 1
- Boxing_the_compass($avArray[$i])
-Next
-
-Func Boxing_the_compass($Degree)
- Local $namearray[33] = ["North", "North by east", "North-northeast", "Northeast by north", "Northeast", _
- "Northeast by east", "East-northeast", "East by north", "East", "East by south", "East-southeast", _
- "Southeast by east", "Southeast", "Southeast by south", "South-southeast", "South by east", "South", _
- "South by west", "South-southwest", "Southwest by south", "Southwest", "Southwest by west", "West-southwest", _
- "West by south", "West", "West by north", "West-northwest", "Northwest by west", "Northwest", "Northwest by north", _
- "North-northwest", "North by west", "North"]
- ConsoleWrite(StringFormat("%-2s", Mod(Floor($Degree / 11.25 + 0.5), 32)) & " : " & _
- StringFormat("%-20s", $namearray[Mod(Floor($Degree / 11.25 + 0.5), 32)]) & " : " & $Degree & @CRLF)
-EndFunc ;==>Boxing_the_compass
diff --git a/Task/Box-the-compass/COBOL/box-the-compass.cobol b/Task/Box-the-compass/COBOL/box-the-compass.cobol
deleted file mode 100644
index 697e53d2db..0000000000
--- a/Task/Box-the-compass/COBOL/box-the-compass.cobol
+++ /dev/null
@@ -1,67 +0,0 @@
- identification division.
- program-id. box-compass.
- data division.
- working-storage section.
- 01 point pic 99.
- 01 degrees usage float-short.
- 01 degrees-rounded pic 999v99.
- 01 show-degrees pic zz9.99.
- 01 box pic z9.
- 01 fudge pic 9.
- 01 compass pic x(4).
- 01 compass-point pic x(18).
- 01 shortform pic x.
- 01 short-names.
- 05 short-name pic x(4) occurs 33 times.
- 01 overlay.
- 05 value "N " & "NbE " & "N-NE" & "NEbN" & "NE " &
- "NEbE" & "E-NE" & "EbN " & "E " & "EbS " &
- "E-SE" & "SEbE" & "SE " & "SEbS" & "S-SE" &
- "SbE " & "S " & "SbW " & "S-SW" & "SWbS" &
- "SW " & "SWbW" & "W-SW" & "WbS " & "W " &
- "WbN " & "W-NW" & "NWbW" & "NW " & "NWbN" &
- "N-NW" & "NbW " & "N ".
-
- procedure division.
- display "Index Compass point Degree"
-
- move overlay to short-names.
- perform varying point from 0 by 1 until point > 32
- compute box = function mod(point 32) + 1
- compute degrees = point * 11.25
- compute fudge = function mod(point 3)
- evaluate fudge
- when equal 1
- add 5.62 to degrees
- when equal 2
- subtract 5.62 from degrees
- end-evaluate
-
- compute degrees-rounded rounded = degrees
- move degrees-rounded to show-degrees
- inspect show-degrees replacing trailing '00' by '0 '
- inspect show-degrees replacing trailing '50' by '5 '
-
- move short-name(point + 1) to compass
- move spaces to compass-point
- display space box space space space with no advancing
- perform varying tally from 1 by 1 until tally > 4
- move compass(tally:1) to shortform
- move function concatenate(function trim(compass-point),
- function substitute(shortform,
- "N", "North",
- "E", "East",
- "S", "South",
- "W", "West",
- "b", " byZ",
- "-", "-"))
- to compass-point
- end-perform
- move function substitute(compass-point, "Z", " ")
- to compass-point
- move function lower-case(compass-point) to compass-point
- move function upper-case(compass-point(1:1))
- to compass-point(1:1)
- display compass-point space show-degrees
- end-perform
- goback.
diff --git a/Task/Box-the-compass/Euphoria/box-the-compass.ex b/Task/Box-the-compass/Euphoria/box-the-compass.ex
deleted file mode 100644
index 89204975e6..0000000000
--- a/Task/Box-the-compass/Euphoria/box-the-compass.ex
+++ /dev/null
@@ -1,23 +0,0 @@
-constant names = {"North","North by east","North-northeast","Northeast by north",
- "Northeast","Northeast by east","East-northeast","East by north","East",
- "East by south","East-southeast","Southeast by east","Southeast","Southeast by south",
- "South-southeast","South by east","South","South by west","South-southwest",
- "Southwest by south","Southwest","Southwest by west","West-southwest",
- "West by south","West","West by north","West-northwest","Northwest by west",
- "Northwest","Northwest by north","North-northwest","North by west"}
-
-function deg2ind(atom degree)
- return remainder(floor(degree*32/360+.5),32)+1
-end function
-
-sequence degrees
-degrees = {}
-for i = 0 to 32 do
- degrees &= i*11.25 + 5.62*(remainder(i+1,3)-1)
-end for
-
-integer j
-for i = 1 to length(degrees) do
- j = deg2ind(degrees[i])
- printf(1, "%6.2f %2d %-22s\n", {degrees[i], j, names[j]})
-end for
diff --git a/Task/Box-the-compass/Icon/box-the-compass.icon b/Task/Box-the-compass/Icon/box-the-compass.icon
index c1f1f16e6a..f9d3562942 100644
--- a/Task/Box-the-compass/Icon/box-the-compass.icon
+++ b/Task/Box-the-compass/Icon/box-the-compass.icon
@@ -7,7 +7,7 @@ every heading := 11.25 * (i := 0 to 32) do {
1: heading +:= 5.62
2: heading -:= 5.62
}
- write(right(i+1,3)," ",left(direction(heading),20)," ",fix(heading,,7,2))
+ write(right(i%32+1,3)," ",left(direction(heading),20)," ",fix(heading,,7,2))
}
end
@@ -17,10 +17,10 @@ initial {
every put(dirs := [],
replacem(!["N","NbE","N-NE","NEbN","NE","NEbE","E-NE","EbN",
"E","EbS","E-SE","SEbE","SE","SEbS","S-SE","SbE",
- "S","SbW","S-SW","SWbS","SW","SWbW","W-SW","WbS",
- "W","WbN","W-NW","NWbW","NW","NWbN","N-NW","NbW"],
+ "S","SbW","S-SW","SWbS","SW","SWbW","W-SW","WbS",
+ "W","WbN","W-NW","NWbW","NW","NWbN","N-NW","NbW"],
"N","north","E","east","W","west","S","south","b"," by "))
}
- return dirs[round(((((d%360)+360)%360)/11.25)%32 + 1)]
+ return dirs[round(((((d%360)+360)%360)/11.25))%32 + 1]
end
diff --git a/Task/Box-the-compass/Phix/box-the-compass-1.phix b/Task/Box-the-compass/Phix/box-the-compass-1.phix
index 4377ed54b4..8710cca852 100644
--- a/Task/Box-the-compass/Phix/box-the-compass-1.phix
+++ b/Task/Box-the-compass/Phix/box-the-compass-1.phix
@@ -1,48 +1,46 @@
-(phixonline)-->
- with javascript_semantics
- function get225 ( integer d , string p1 , string p2 , string p4 )
- string p3 = p1 & '-' & lower ( p2 )
- p2 &= " by " & lower ( p1 )
- p1 &= " by " & lower ( p4 )
- if d then
- return { p1 , p3 , p2 } -- eg {North by east,North-northeast,Northeast by north}
- else
- return { p2 , p3 , p1 } -- eg {Northeast by east,East-northeast,East by north}
- end if
- end function
+with javascript_semantics
+function get225(integer d, string p1, string p2, string p4)
+ string p3 = p1&'-'&lower(p2)
+ p2 &= " by "&lower(p1)
+ p1 &= " by "&lower(p4)
+ if d then
+ return {p1,p3,p2} -- eg {North by east,North-northeast,Northeast by north}
+ else
+ return {p2,p3,p1} -- eg {Northeast by east,East-northeast,East by north}
+ end if
+end function
- function get45 ( sequence res , integer d , string p1 , string p2 )
- string p3
- res = append ( res , p1 ) -- North/East/South/West
- if d then
- p3 = p1 & lower ( p2 ) -- Northeast/Southwest
- else
- p3 = p2 & lower ( p1 ) -- Southeast/Northwest
- end if
- res &= get225 ( 1 , p1 , p3 , p2 ) -- eg get225(1,North,Northeast,East)
- -- -> {North by east,North-northeast,Northeast by north}
- res = append ( res , p3 ) -- Northeast/Southeast/Southwest/Northwest
- res &= get225 ( 0 , p2 , p3 , p1 ) -- eg get225(0,East,Northeast,North)
- -- -> {Northeast by east,East-northeast,East by north}
- return res
- end function
+function get45(sequence res, integer d, string p1, string p2)
+ string p3
+ res = append(res,p1) -- North/East/South/West
+ if d then
+ p3 = p1&lower(p2) -- Northeast/Southwest
+ else
+ p3 = p2&lower(p1) -- Southeast/Northwest
+ end if
+ res &= get225(1,p1,p3,p2) -- eg get225(1,North,Northeast,East)
+ -- -> {North by east,North-northeast,Northeast by north}
+ res = append(res,p3) -- Northeast/Southeast/Southwest/Northwest
+ res &= get225(0,p2,p3,p1) -- eg get225(0,East,Northeast,North)
+ -- -> {Northeast by east,East-northeast,East by north}
+ return res
+end function
- function get90 ( sequence points )
- sequence res = {}
- for i = 1 to length ( points ) do
- res = get45 ( res , remainder ( i , 2 ), points [ i ], points [ remainder ( i , 4 )+ 1 ])
- end for -- ie get45(1,North,East)
- -- get45(0,East,South)
- -- get45(1,South,West)
- -- get45(0,West,North)
- return res
- end function
+function get90(sequence points)
+ sequence res = {}
+ for i=1 to length(points) do
+ res = get45(res,remainder(i,2),points[i],points[remainder(i,4)+1])
+ end for -- ie get45(1,North,East)
+ -- get45(0,East,South)
+ -- get45(1,South,West)
+ -- get45(0,West,North)
+ return res
+end function
- constant compass_points = get90 ({ "North" , "East" , "South" , "West" })
+constant compass_points = get90({"North","East","South","West"})
- for i = 1 to 33 do
- atom test_point = ( i - 1 )* 11.25 + 5.62 *( remainder ( i , 3 )- 1 )
- integer compass_point = remainder ( floor ( test_point * 32 / 360 + 0.5 ), 32 )+ 1
- printf ( 1 , "%2d %-22s %6.2f\n" , { compass_point , compass_points [ compass_point ], test_point })
- end for
-
- with javascript_semantics
- constant compass_points = { "North" , "North by east" , "North-northeast" , "Northeast by north" ,
- "Northeast" , "Northeast by east" , "East-northeast" , "East by north" ,
- "East" , "East by south" , "East-southeast" , "Southeast by east" ,
- "Southeast" , "Southeast by south" , "South-southeast" , "South by east" ,
- "South" , "South by west" , "South-southwest" , "Southwest by south" ,
- "Southwest" , "Southwest by west" , "West-southwest" , "West by south" ,
- "West" , "West by north" , "West-northwest" , "Northwest by west" ,
- "Northwest" , "Northwest by north" , "North-northwest" , "North by west" },
- test_points = { 0.0 , 16.87 , 16.88 , 33.75 , 50.62 , 50.63 , 67.5 , 84.37 , 84.38 , 101.25 , 118.12 ,
- 118.13 , 135.0 , 151.87 , 151.88 , 168.75 , 185.62 , 185.63 , 202.5 , 219.37 , 219.38 , 236.25 ,
- 253.12 , 253.13 , 270.0 , 286.87 , 286.88 , 303.75 , 320.62 , 320.63 , 337.5 , 354.37 , 354.38 }
- for i = 1 to length ( test_points ) do
- integer compass_point = remainder ( floor ( test_points [ i ]* 32 / 360 + 0.5 ), 32 )+ 1
- printf ( 1 , "%2d %-22s %6.2f\n" , { compass_point , compass_points [ compass_point ], test_points [ i ]})
- end for
-
- --
- -- demo\rosetta\BoyerMoore.exw
- -- ===========================
- --
- -- based on https://www-igm.univ-mlv.fr/~lecroq/string/node14.html
- --
- with javascript_semantics
- function preBmBc ( string pat )
- integer m = length ( pat )
- sequence bmBc = repeat ( m , 255 )
- for i = 1 to m - 1 do
- bmBc [ pat [ i ]] = m - i
- end for
- return bmBc
- end function
+-- demo\rosetta\BoyerMoore.exw
+-- based on https://www-igm.univ-mlv.fr/~lecroq/string/node14.html
+with javascript_semantics
+function preBmBc(string pat)
+ integer m = length(pat)
+ sequence bmBc = repeat(m,255)
+ for i=1 to m-1 do
+ bmBc[pat[i]] = m - i
+ end for
+ return bmBc
+end function
- function suffixes ( string pat )
- integer m = length ( pat ), g = m , f
- sequence suff = repeat ( 0 , m )
- suff [ m ] = m ;
- for i = m - 1 to 1 by - 1 do
- if i > g and suff [ i + m - f ] < i - g then
- suff [ i ] = suff [ i + m - f ]
- else
- if i < g then g = i end if
- f = i
- while g >= 1 and pat [ g ] == pat [ g + m - f ] do
- g -= 1 ;
- end while
- suff [ i ] = f - g
- end if
- end for
- return suff
- end function
+function suffixes(string pat)
+ integer m = length(pat), g = m, f
+ sequence suff = repeat(0,m)
+ suff[m] = m;
+ for i=m-1 to 1 by -1 do
+ if i > g and suff[i + m - f] < i - g then
+ suff[i] = suff[i + m - f]
+ else
+ if i < g then g = i end if
+ f = i
+ while g >= 1 and pat[g] == pat[g + m - f] do
+ g -= 1;
+ end while
+ suff[i] = f - g
+ end if
+ end for
+ return suff
+end function
- function preBmGs ( string pat )
- integer m = length ( pat ), j = 1
- sequence suff = suffixes ( pat ),
- bmGs = repeat ( m , m )
- for i = m to 1 by - 1 do
- if ( suff [ i ] == i ) then
- while j < m - i do
- if ( bmGs [ j ] == m ) then
- bmGs [ j ] = m - i ;
- end if
- j += 1
- end while
- end if
- end for
- for i = 1 to m - 1 do
- bmGs [ m - suff [ i ]] = m - i ;
- end for
- return bmGs
- end function
+function preBmGs(string pat)
+ integer m = length(pat), j = 1
+ sequence suff = suffixes(pat),
+ bmGs = repeat(m,m)
+ for i=m to 1 by -1 do
+ if (suff[i] == i) then
+ while j < m - i do
+ if (bmGs[j] == m) then
+ bmGs[j] = m - i;
+ end if
+ j += 1
+ end while
+ end if
+ end for
+ for i=1 to m-1 do
+ bmGs[m - suff[i]] = m - i;
+ end for
+ return bmGs
+end function
- procedure BM ( string pat , s , bool case_insensitive = false )
- string pins = sprintf ( "`%s` in `%s`" ,{ pat , shorten ( s , "characters" , 10 )})
- if case_insensitive then
- pat = lower ( pat )
- s = lower ( s )
- end if
- /* Preprocessing */
- sequence bmGs = preBmGs ( pat ),
- bmBc = preBmBc ( pat )
- /* Searching */
- sequence res = {}
- integer i , j = 0 ,
- n = length ( s ),
- m = length ( pat ),
- cc = 0
- while j <= n - m do
- for i = m to 1 by - 1 do
- cc += 1
- if pat [ i ]!= s [ i + j ] then exit end if
- end for
- if i < 1 then
- res &= j + 1
- j += bmGs [ 1 ];
- else
- j += max ( bmGs [ i ], bmBc [ s [ i + j ]] - m + i );
- end if
- end while
- string ccs = sprintf ( "(%d character comparisons)" , cc )
- if length ( res ) then
- string many = ordinant ( length ( res ))
- printf ( 1 , "Found %s %s at %v %s\n" ,{ pins , many , res , ccs })
- else
- printf ( 1 , "No %s %s\n" ,{ pins , ccs })
- end if
- end procedure
+procedure BM(string pat, s, bool case_insensitive = false)
+ string pins = sprintf("`%s` in `%s`",{pat,shorten(s,"characters",10)})
+ if case_insensitive then
+ pat = lower(pat)
+ s = lower(s)
+ end if
+ /* Preprocessing */
+ sequence bmGs = preBmGs(pat),
+ bmBc = preBmBc(pat)
+ /* Searching */
+ sequence res = {}
+ integer i, j = 0,
+ n = length(s),
+ m = length(pat),
+ cc = 0
+ while j <= n - m do
+ for i=m to 1 by -1 do
+ cc += 1
+ if pat[i]!=s[i+j] then exit end if
+ end for
+ if i<1 then
+ res &= j+1
+ j += bmGs[1];
+ else
+ j += max(bmGs[i], bmBc[s[i + j]] - m + i);
+ end if
+ end while
+ string ccs = sprintf("(%d character comparisons)",cc)
+ if length(res) then
+ string many = ordinant(length(res))
+ printf(1,"Found %s %s at %v %s\n",{pins,many,res,ccs})
+ else
+ printf(1,"No %s %s\n",{pins,ccs})
+ end if
+end procedure
- BM ( "GCAGAGAG" , "GCATCGCAGAGAGTATACAGTACG" )
- BM ( "TCTA" , "GCTAGCTCTACGAGTCTA" )
- BM ( "TAATAAA" , "GGCTATAATGCGTA" )
- BM ( "word" , "there would have been a time for such a word" )
- BM ( "needle" , "needle need noodle needle" )
- constant book = "InhisbookseriesTheArtofComputerProgrammingpublishedbyAddisonWesley" &
- "DKnuthusesanimaginarycomputertheMIXanditsassociatedmachinecodeand" &
- "assemblylanguagestoillustratetheconceptsandalgorithmsastheyarepresented"
- BM ( "put" , book )
- BM ( "and" , book )
- constant farm = "Nearby farms grew a half acre of alfalfa on the dairy's behalf, with " &
- "bales of all that alfalfa exchanged for milk."
- BM ( "alfalfa" , farm )
- --BM("aLfAlfa",farm) -- none
- --BM("aLfAlfa",farm,true) -- as -2
-
- with javascript_semantics
- function same_digits ( integer n , b )
- integer f = remainder ( n , b )
- n = floor ( n / b )
- while n > 0 do
- if remainder ( n , b )!= f then return false end if
- n = floor ( n / b )
- end while
- return true
- end function
+with javascript_semantics
+function same_digits(integer n, b)
+ integer f = remainder(n,b)
+ n = floor(n/b)
+ while n>0 do
+ if remainder(n,b)!=f then return false end if
+ n = floor(n/b)
+ end while
+ return true
+end function
- function is_brazilian ( integer n )
- if n >= 7 then
- if remainder ( n , 2 )= 0 then return true end if
- for b = 2 to n - 2 do
- if same_digits ( n , b ) then return true end if
- end for
- end if
- return false
- end function
+function is_brazilian(integer n)
+ if n>=7 then
+ if remainder(n,2)=0 then return true end if
+ for b=2 to n-2 do
+ if same_digits(n,b) then return true end if
+ end for
+ end if
+ return false
+end function
- constant kinds = { " " , " odd " , " prime " }
- for i = 1 to length ( kinds ) do
- printf ( 1 , "First 20%sBrazilian numbers:\n" , { kinds [ i ]})
- integer c = 0 , n = 7 , p = 4
- while true do
- if is_brazilian ( n ) then
- printf ( 1 , "%d " , n )
- c += 1
- if c == 20 then
- printf ( 1 , "\n\n" )
- exit
- end if
- end if
- switch i
- case 1 : n += 1
- case 2 : n += 2
- case 3 : p += 1 ; n = get_prime ( p )
- end switch
- end while
- end for
+constant kinds = {" ", " odd ", " prime "}
+for i=1 to length(kinds) do
+ printf(1,"First 20%sBrazilian numbers:\n", {kinds[i]})
+ integer c = 0, n = 7, p = 4
+ while true do
+ if is_brazilian(n) then
+ printf(1,"%d ",n)
+ c += 1
+ if c==20 then
+ printf(1,"\n\n")
+ exit
+ end if
+ end if
+ switch i
+ case 1: n += 1
+ case 2: n += 2
+ case 3: p += 1; n = get_prime(p)
+ end switch
+ end while
+end for
- integer n = 7 , c = 0
- atom t0 = time (), t1 = time ()+ 1
- while c < 100000 do
- if platform ()!= JS and time ()> t1 then
- printf ( 1 , "checking %d [count:%d]...\r" ,{ n , c })
- t1 = time ()+ 1
- end if
- c += is_brazilian ( n )
- n += 1
- end while
- printf ( 1 , "The %,dth Brazilian number: %d\n" , { c , n - 1 })
- ? elapsed ( time ()- t0 )
-
- without js -- (no class under p2js)
- class test
- private string msg = "this is a test"
- procedure show () ? this . msg end procedure
- end class
- test t = new ()
- t . show ()
- --?t.msg -- illegal
- --t.msg = "this is broken" -- illegal
- include builtins \ structs . e as structs
- constant ctx = routine_id ( "test" ) -- magic/context
- --constant ctx = "test" -- also works
- --constant ctx = test -- also works
- ? structs : fetch_field ( t , "msg" , ctx )& " (with some magic)"
- structs : store_field ( t , "msg" , "this breaks privacy" , ctx )
- t . show ()
-
- --
- -- demo\rosetta\BrilliantNumbers.exw
- -- =================================
- --
- with javascript_semantics
- requires ( "1.0.2" ) -- (for in)
- atom t0 = time ()
+with javascript_semantics
+requires("1.0.2") -- (for in)
+atom t0 = time()
- function get_primes_by_digits ( integer limit )
- sequence primes = get_primes_le ( power ( 10 , limit )),
- primes_by_digits = {}
- integer p = 10
- while length ( primes ) do
- integer pi = abs ( binary_search ( p , primes ))- 1
- primes_by_digits &= { primes [ 1 .. pi ]}
- primes = primes [ pi + 1 ..$]
- p *= 10
- end while
- return primes_by_digits
- end function
- sequence primes_by_digits = get_primes_by_digits ( 8 )
+function get_primes_by_digits(integer limit)
+ sequence primes = get_primes_le(power(10,limit)),
+ primes_by_digits = {}
+ integer p = 10
+ while length(primes) do
+ integer pi = abs(binary_search(p,primes))-1
+ primes_by_digits &= {primes[1..pi]}
+ primes = primes[pi+1..$]
+ p*= 10
+ end while
+ return primes_by_digits
+end function
+sequence primes_by_digits = get_primes_by_digits(8)
- procedure first100 ()
- sequence brilliant_numbers = {}
- for primes in primes_by_digits do
- for i = 1 to length ( primes ) do
- --see talk page
- -- for j=i to length(primes) do
- for j = 1 to i do
- brilliant_numbers &= primes [ i ]* primes [ j ]
- end for
- end for
- if length ( brilliant_numbers )>= 100 then exit end if
- end for
- brilliant_numbers = sort ( brilliant_numbers )[ 1 .. 100 ]
- sequence j100 = join_by ( brilliant_numbers , 1 , 10 , " " , "\n" , "%,5d" )
- printf ( 1 , "First 100 brilliant numbers:\n%s\n\n" ,{ j100 })
- end procedure
- first100 ()
+procedure first100()
+ sequence brilliant_numbers = {}
+ for primes in primes_by_digits do
+ for i=1 to length(primes) do
+--see talk page
+-- for j=i to length(primes) do
+ for j=1 to i do
+ brilliant_numbers &= primes[i]*primes[j]
+ end for
+ end for
+ if length(brilliant_numbers)>=100 then exit end if
+ end for
+ brilliant_numbers = sort(brilliant_numbers)[1..100]
+ sequence j100 = join_by(brilliant_numbers,1,10," ","\n","%,5d")
+ printf(1,"First 100 brilliant numbers:\n%s\n\n",{j100})
+end procedure
+first100()
- atom pwr = 10 , count = 0
- for p = 1 to 2 * length ( primes_by_digits )- 1 do
- sequence primes = primes_by_digits [ floor ( p / 2 )+ 1 ]
- atom pos = count + 1 ,
- min_product = 0
- for i = 1 to length ( primes ) do
- integer p1 = primes [ i ],
- j = abs ( binary_search ( floor (( pwr + p1 - 1 )/ p1 ), primes , i ))
- if j <= length ( primes ) then -- (always is, I think)
- integer p2 = primes [ j ]
- atom prod = p1 * p2
- if min_product = 0 or prod < min_product then
- min_product = prod
- end if
- pos += j - i
- if p1 >= p2 then exit end if
- end if
- end for
- printf ( 1 , "First brilliant number >= 10^%d is %,d at position %,d\n" , { p , min_product , pos })
- pwr *= 10 ;
- if odd ( p ) then
- integer size = length ( primes )
- count += size * ( size + 1 ) / 2 ;
- end if
- end for
- ? elapsed ( time ()- t0 )
- {} = wait_key ()
-
- -- demo\rosetta\burrows_wheeler.exw
- --/*
- The traditional method:
+-- demo\rosetta\burrows_wheeler.exw
+--/*
+The traditional method:
- 7 banana$ $banana 6
- 6 $banana ===> a$banan 5
- 5 a$banan ana$ban 3
- 4 na$bana sort anana$b 1
- 3 ana$ban banana$ 7
- 2 nana$ba ===> na$bana 4
- 1 anana$b nana$ba 2
- ^ desired answer == "annb$aa"
+ 7 banana$ $banana 6
+ 6 $banana ===> a$banan 5
+ 5 a$banan ana$ban 3
+ 4 na$bana sort anana$b 1
+ 3 ana$ban banana$ 7
+ 2 nana$ba ===> na$bana 4
+ 1 anana$b nana$ba 2
+ ^ desired answer == "annb$aa"
- First ignore the numbers: the desired answer is found by creating a table of all
- rotations of "banana$", sorting it, and then extracting the right-hand column.
+First ignore the numbers: the desired answer is found by creating a table of all
+rotations of "banana$", sorting it, and then extracting the right-hand column.
- However, there is no need to actually create such a table, which could be very
- expensive for long strings, instead just number them logically (admittedly that
- was somewhat arbitrarily chosen to get the indexes to work out nicely, I picked
- the original index of the last character), and perform a custom sort on those.
+However, there is no need to actually create such a table, which could be very
+expensive for long strings, instead just number them logically (admittedly that
+was somewhat arbitrarily chosen to get the indexes to work out nicely, I picked
+the original index of the last character), and perform a custom sort on those.
- The latter effectively just recreates the rotations one character at a time until
- there is a mismatch (which there always will be since there is only one $).
- The left hand column is my arbitrary numbering scheme and the right hand column
- is those sorted into order, which is also the indexes to the original string of
- the characters that we want.
+The latter effectively just recreates the rotations one character at a time until
+there is a mismatch (which there always will be since there is only one $).
+The left hand column is my arbitrary numbering scheme and the right hand column
+is those sorted into order, which is also the indexes to the original string of
+the characters that we want.
- The code below uses $ as the terminator, but eg 1 (== '\#01') should be fine,
- except of course for the display of that on a console.
- --*/
- with javascript_semantics
- constant terminator = '$'
+The code below uses $ as the terminator, but eg 1 (== '\#01') should be fine,
+except of course for the display of that on a console.
+--*/
+with javascript_semantics
+constant terminator = '$'
- function rot_sort ( integer i , j , sequence s )
- -- i,j are indexes of the last character, so bump before first compare.
- -- eg/ie rot_sort(i,j,s) should yield compare(rotate(s,i),rotate(s,j)),
- -- as in rot_sort(7,6,"banana$") == compare("banana$","$banana")
- -- - but one character at a time rather than constructing both.
- integer l = length ( s )
- while true do
- i = mod ( i , l )+ 1
- j = mod ( j , l )+ 1
- integer c = compare ( s [ i ], s [ j ])
- if c != 0 then return c end if
- end while
- end function
+function rot_sort(integer i,j, sequence s)
+-- i,j are indexes of the last character, so bump before first compare.
+-- eg/ie rot_sort(i,j,s) should yield compare(rotate(s,i),rotate(s,j)),
+-- as in rot_sort(7,6,"banana$") == compare("banana$","$banana")
+-- - but one character at a time rather than constructing both.
+ integer l = length(s)
+ while true do
+ i = mod(i,l)+1
+ j = mod(j,l)+1
+ integer c = compare(s[i],s[j])
+ if c!=0 then return c end if
+ end while
+end function
- function burrows_wheeler_transform ( string s )
- if find ( terminator , s ) then return "error" end if
- s &= terminator
- integer l = length ( s )
- sequence t = custom_sort ( routine_id ( "rot_sort" ), tagset ( l ),{ s })
- string res = repeat ( ' ' , l )
- for i = 1 to l do
- res [ i ] = s [ t [ i ]]
- end for
- return res
- end function
+function burrows_wheeler_transform(string s)
+ if find(terminator,s) then return "error" end if
+ s &= terminator
+ integer l = length(s)
+ sequence t = custom_sort(routine_id("rot_sort"),tagset(l),{s})
+ string res = repeat(' ',l)
+ for i=1 to l do
+ res[i] = s[t[i]]
+ end for
+ return res
+end function
- --/*
- Inversion. The traditional method is add column and sort, seven times,
- to reconstruct the table above, then pick the entry that ends with the
- marker. Showing that technique in full detail here is not helpful, and
- like above that would be hideously inefficient for large strings.
+--/*
+Inversion. The traditional method is add column and sort, seven times,
+to reconstruct the table above, then pick the entry that ends with the
+marker. Showing that technique in full detail here is not helpful, and
+like above that would be hideously inefficient for large strings.
- $banana 1 $ (1 ) a 2
- a$banan 2 a ( 1) n 6
- ana$ban 3 a ( 2) n 7
- anana$b 4 a ( 3) b 5
- banana$ 5 b $ 1
- na$bana 6 n (2 ) a 3
- nana$ba 7 n (3 ) a 4
- ^ ^ ^ ^ ^
- f l f l t
+ $banana 1 $ (1 ) a 2
+ a$banan 2 a ( 1) n 6
+ ana$ban 3 a ( 2) n 7
+ anana$b 4 a ( 3) b 5
+ banana$ 5 b $ 1
+ na$bana 6 n (2 ) a 3
+ nana$ba 7 n (3 ) a 4
+ ^ ^ ^ ^ ^
+ f l f l t
- However, we already have the last column, and the first is just that
- sorted alphabetically, and with just those two, we have all possible
- character pairings of the original message. The trick is in figuring
- out how to stitch them together in the right order. If you carefully
- study the three that end in a, and the three that start in a, notice
- the $banan,na$ban,nana$b parts are sorted in the same order, whether
- they are prefixed with a or not. That is, the middle (parenthesised)
- matching numbers are both 123, not 123 and say 231. It is quite hard
- to see that being useful, but eventually the penny should drop. The
- right-hand 1 with an a rotated right gives the left-hand 1, and the
- same goes for 2 and 3: they are in fact links to the prior pairing.
+However, we already have the last column, and the first is just that
+sorted alphabetically, and with just those two, we have all possible
+character pairings of the original message. The trick is in figuring
+out how to stitch them together in the right order. If you carefully
+study the three that end in a, and the three that start in a, notice
+the $banan,na$ban,nana$b parts are sorted in the same order, whether
+they are prefixed with a or not. That is, the middle (parenthesised)
+matching numbers are both 123, not 123 and say 231. It is quite hard
+to see that being useful, but eventually the penny should drop. The
+right-hand 1 with an a rotated right gives the left-hand 1, and the
+same goes for 2 and 3: they are in fact links to the prior pairing.
- In other words the first a in l always corresponds to the first in f,
- the second to the second, and so on, and that (amazingly) forms the
- order in which the pairings need to be daisy-chained together.
+In other words the first a in l always corresponds to the first in f,
+the second to the second, and so on, and that (amazingly) forms the
+order in which the pairings need to be daisy-chained together.
- Try following (1->)2a->6n->3a->7n->4a->5b->$, == reverse("banana"),
- in the above f and t tables.
+Try following (1->)2a->6n->3a->7n->4a->5b->$, == reverse("banana"),
+in the above f and t tables.
- The code below builds a queue of 'a' ({1,6,7}, built backwards) then
- we pop {2,3,4} into those slots in t as we find 'a' in f, likewise
- for all other letters, forming the links for each pairing as shown.
- See the trivial step 3 scan below, then go back and stare at f and
- t as shown above, and once again, eventually the penny should drop.
- I will admit I had to read ten or so explanations before I got it.
- --*/
+The code below builds a queue of 'a' ({1,6,7}, built backwards) then
+we pop {2,3,4} into those slots in t as we find 'a' in f, likewise
+for all other letters, forming the links for each pairing as shown.
+See the trivial step 3 scan below, then go back and stare at f and
+t as shown above, and once again, eventually the penny should drop.
+I will admit I had to read ten or so explanations before I got it.
+--*/
- function inverse_burrows_wheeler ( string s )
- if find ( '\0' , s ) then ? 9 / 0 end if -- (doable, but needs some +1s)
- integer l = length ( s ), c
- string f = sort ( s )
- sequence q = repeat ( 0 , 256 ), -- queue heads (per char)
- x = repeat ( 0 , l ), -- queue links
- t = repeat ( 0 , l ) -- reformed/pairing links
- -- Step 1. discover/build queues (backwards)
- for i = l to 1 by - 1 do
- c = s [ i ]
- x [ i ] = q [ c ]
- q [ c ] = i
- end for
- -- Step 2. reform/pop char queues into pairing links
- for i = 1 to l do
- c = f [ i ]
- t [ q [ c ]] = i
- q [ c ] = x [ q [ c ]]
- end for
- -- Step 3. rebuild (backwards)
- c = find ( terminator , f )
- if c = 0 then return "error" end if
- string res = repeat ( ' ' , l - 1 )
- for i = l - 1 to 1 by - 1 do
- c = t [ c ] -- (first time in, skip the end marker)
- res [ i ] = f [ c ]
- end for
- return res
- end function
+function inverse_burrows_wheeler(string s)
+ if find('\0',s) then ?9/0 end if -- (doable, but needs some +1s)
+ integer l = length(s), c
+ string f = sort(s)
+ sequence q = repeat(0,256), -- queue heads (per char)
+ x = repeat(0,l), -- queue links
+ t = repeat(0,l) -- reformed/pairing links
+ -- Step 1. discover/build queues (backwards)
+ for i=l to 1 by -1 do
+ c = s[i]
+ x[i] = q[c]
+ q[c] = i
+ end for
+ -- Step 2. reform/pop char queues into pairing links
+ for i=1 to l do
+ c = f[i]
+ t[q[c]] = i
+ q[c] = x[q[c]]
+ end for
+ -- Step 3. rebuild (backwards)
+ c = find(terminator,f)
+ if c=0 then return "error" end if
+ string res = repeat(' ',l-1)
+ for i=l-1 to 1 by -1 do
+ c = t[c] -- (first time in, skip the end marker)
+ res[i] = f[c]
+ end for
+ return res
+end function
- procedure test ( string src )
- string enc = burrows_wheeler_transform ( src ),
- dec = inverse_burrows_wheeler ( enc )
- src = shorten ( src , "characters" )
- enc = shorten ( enc , "characters" )
- dec = shorten ( dec , "characters" )
- printf ( 1 , "original: %s --> %s\n inverse: %s\n" ,{ src , enc , dec })
- end procedure
+procedure test(string src)
+string enc = burrows_wheeler_transform(src),
+ dec = inverse_burrows_wheeler(enc)
+ src = shorten(src,"characters")
+ enc = shorten(enc,"characters")
+ dec = shorten(dec,"characters")
+ printf(1,"original: %s --> %s\n inverse: %s\n",{src,enc,dec})
+end procedure
- test ( "banana" )
- test ( "dogwood" )
- test ( "TO BE OR NOT TO BE OR WANT TO BE OR NOT?" )
- test ( "SIX.MIXED.PIXIES.SIFT.SIXTY.PIXIE.DUST.BOXES" )
- ("$dogwood","d$dogwoo","dogwood$",...)
table.filter1("%s*".fmt(special).glob)[1,*]; // str[0]==$, often first element
}
diff --git a/Task/CRC-32/11l/crc-32.11l b/Task/CRC-32/11l/crc-32.11l
index c73b4661a0..62304e3579 100644
--- a/Task/CRC-32/11l/crc-32.11l
+++ b/Task/CRC-32/11l/crc-32.11l
@@ -1,5 +1,5 @@
V crc_table = [0] * 256
-L(i) 256
+L(i) 0.<256
UInt32 rem = i
L 8
I rem [&] 1 != 0
diff --git a/Task/CRC-32/ALGOL-68/crc-32.alg b/Task/CRC-32/ALGOL-68/crc-32.alg
index 6e949b4d94..3020332f39 100644
--- a/Task/CRC-32/ALGOL-68/crc-32.alg
+++ b/Task/CRC-32/ALGOL-68/crc-32.alg
@@ -32,7 +32,7 @@ PROC update_crc = (BITS crc, STRING buf) BITS:
PROC hex = (BITS x) STRING :
BEGIN
- PROC hexdig = (BITS x) CHAR: REPR (IF ABS x ≤ 9 THEN ABS x + ABS "0"
+ PROC hexdig = (BITS x) CHAR: REPR (IF ABS x <= 9 THEN ABS x + ABS "0"
ELSE ABS x - 10 + ABS "a"
FI);
STRING h := "";
@@ -40,7 +40,7 @@ PROC update_crc = (BITS crc, STRING buf) BITS:
h := "0"
ELSE
BITS n := x;
- WHILE h := hexdig (n AND 16rf) + h; n ≠ 16r0 DO
+ WHILE h := hexdig (n AND 16rf) + h; n /= 16r0 DO
n := n SHR 4
OD
FI;
diff --git a/Task/CRC-32/Ada/crc-32.ada b/Task/CRC-32/Ada/crc-32.ada
deleted file mode 100644
index 1346ffd67a..0000000000
--- a/Task/CRC-32/Ada/crc-32.ada
+++ /dev/null
@@ -1,14 +0,0 @@
-with Ada.Text_IO; use Ada.Text_IO;
-with GNAT.CRC32; use GNAT.CRC32;
-with Interfaces; use Interfaces;
-procedure TestCRC is
- package IIO is new Ada.Text_IO.Modular_IO (Unsigned_32);
- crc : CRC32;
- num : Unsigned_32;
- str : String := "The quick brown fox jumps over the lazy dog";
-begin
- Initialize (crc);
- Update (crc, str);
- num := Get_Value (crc);
- IIO.Put (num, Base => 16); New_Line;
-end TestCRC;
diff --git a/Task/CRC-32/COBOL/crc-32.cobol b/Task/CRC-32/COBOL/crc-32.cobol
deleted file mode 100644
index 0b843fd7ad..0000000000
--- a/Task/CRC-32/COBOL/crc-32.cobol
+++ /dev/null
@@ -1,37 +0,0 @@
- *> tectonics: cobc -xj crc32-zlib.cob -lz
- identification division.
- program-id. rosetta-crc32.
-
- environment division.
- configuration section.
- repository.
- function all intrinsic.
-
- data division.
- working-storage section.
- 01 crc32-initial usage binary-c-long.
- 01 crc32-result usage binary-c-long unsigned.
- 01 crc32-input.
- 05 value "The quick brown fox jumps over the lazy dog".
- 01 crc32-hex usage pointer.
-
- procedure division.
- crc32-main.
-
- *> libz crc32
- call "crc32" using
- by value crc32-initial
- by reference crc32-input
- by value length(crc32-input)
- returning crc32-result
- on exception
- display "error: no crc32 zlib linkage" upon syserr
- end-call
- call "printf" using "checksum: %lx" & x"0a" by value crc32-result
-
- *> GnuCOBOL pointers are displayed in hex by default
- set crc32-hex up by crc32-result
- display 'crc32 of "' crc32-input '" is ' crc32-hex
-
- goback.
- end program rosetta-crc32.
diff --git a/Task/CRC-32/EasyLang/crc-32.easy b/Task/CRC-32/EasyLang/crc-32.easy
index a324f48c5d..35d2803aa5 100644
--- a/Task/CRC-32/EasyLang/crc-32.easy
+++ b/Task/CRC-32/EasyLang/crc-32.easy
@@ -1,4 +1,5 @@
-func crc32 buf$[] .
+global table[] .
+proc mktable .
for i = 0 to 0xff
rem = i
for j to 8
@@ -10,13 +11,15 @@ func crc32 buf$[] .
.
table[] &= rem
.
+.
+func crc32 s$ .
crc = 0xffffffff
- for c$ in buf$[]
+ for c$ in strchars s$
c = strcode c$
crb = bitxor bitand crc 0xff c
crc = bitxor (bitshift crc -8) table[crb + 1]
.
- return bitnot crc
+ return bitand bitnot crc 0xffffffff
.
-s$ = "The quick brown fox jumps over the lazy dog"
-print crc32 strchars s$
+mktable
+print crc32 "The quick brown fox jumps over the lazy dog"
diff --git a/Task/CRC-32/Haxe/crc-32.haxe b/Task/CRC-32/Haxe/crc-32.haxe
deleted file mode 100644
index d1259bb95e..0000000000
--- a/Task/CRC-32/Haxe/crc-32.haxe
+++ /dev/null
@@ -1,9 +0,0 @@
-using StringTools;
-
-class Main {
- static function main() {
- var data = haxe.io.Bytes.ofString("The quick brown fox jumps over the lazy dog");
- var crc = haxe.crypto.Crc32.make(data);
- Sys.println(crc.hex());
- }
-}
diff --git a/Task/CRC-32/Julia/crc-32-2.jl b/Task/CRC-32/Julia/crc-32-2.jl
index fb6e0e6953..0c99a75649 100644
--- a/Task/CRC-32/Julia/crc-32-2.jl
+++ b/Task/CRC-32/Julia/crc-32-2.jl
@@ -1,31 +1,31 @@
function crc32(crc::Int, str::String)
- table = zeros(UInt32, 256)
+ table = zeros(UInt32, 256)
- for i in 0:255
- tmp = i
- for j in 0:7
- if tmp & 1 == 1
- tmp >>= 1
- tmp ⊻= 0xedb88320
- else
- tmp >>= 1
- end
- end
+ for i in 0:255
+ tmp = i
+ for j in 0:7
+ if tmp & 1 == 1
+ tmp >>= 1
+ tmp ⊻= 0xedb88320
+ else
+ tmp >>= 1
+ end
+ end
- table[i + 1] = tmp
- end
+ table[i+1] = tmp
+ end
- crc ⊻= 0xffffffff
+ crc ⊻= 0xffffffff
- for i in UInt32.(collect(str))
- crc = (crc >> 8) ⊻ table[(crc & 0xff) ⊻ i + 1]
- end
+ for i in UInt32.(collect(str))
+ crc = (crc >> 8) ⊻ table[(crc&0xff)⊻i+1]
+ end
- crc ⊻ 0xffffffff
+ crc ⊻ 0xffffffff
end
str = "The quick brown fox jumps over the lazy dog"
crc = crc32(0, str)
-assert(crc == 0x414fa339)
+@assert(crc == 0x414fa339)
println("Message: ", str)
-println("Checksum: ", hex(crc))
+println("Checksum: ", string(crc, base = 16))
diff --git a/Task/CRC-32/Python/crc-32-1.py b/Task/CRC-32/Python/crc-32-1.py
index 5cc64560d7..ff585a4368 100644
--- a/Task/CRC-32/Python/crc-32-1.py
+++ b/Task/CRC-32/Python/crc-32-1.py
@@ -1,8 +1,8 @@
>>> s = 'The quick brown fox jumps over the lazy dog'
>>> import zlib
->>> hex(zlib.crc32(s))
+>>> hex(zlib.crc32(s.encode()))
'0x414fa339'
>>> import binascii
->>> hex(binascii.crc32(s))
+>>> hex(binascii.crc32(s.encode()))
'0x414fa339'
diff --git a/Task/CRC-32/VBScript/crc-32.vb b/Task/CRC-32/VBScript/crc-32.vb
deleted file mode 100644
index 7f74ce3533..0000000000
--- a/Task/CRC-32/VBScript/crc-32.vb
+++ /dev/null
@@ -1,32 +0,0 @@
-dim crctbl(255)
-const crcc =&hEDB88320
-
-sub gencrctable
-for i= 0 to 255
- k=i
- for j=1 to 8
- if k and 1 then
- k=(k and &h7fffffff)\2 or (&h40000000 and ((k and &h80000000)<>0))
- k=k xor crcc
- else
- k=(k and &h7fffffff)\2 or (&h40000000 and ((k and &h80000000)<>0))
- end if
- next ' j
- crctbl(i)=k
- next
-end sub
-
- function crc32 (buf)
- dim r,r1,i
- r=&hffffffff
- for i=1 to len(buf)
- r1=(r and &h7fffffff)\&h100 or (&h800000 and (r and &h80000000)<>0)
- r=r1 xor crctbl((asc(mid(buf,i,1))xor r) and 255)
- next
- crc32=r xor &hffffffff
-end function
-
-
-'414FA339
-gencrctable
-wscript.stdout.writeline hex(crc32("The quick brown fox jumps over the lazy dog"))
diff --git a/Task/CSV-data-manipulation/ALGOL-68/csv-data-manipulation.alg b/Task/CSV-data-manipulation/ALGOL-68/csv-data-manipulation.alg
index 749c7da413..97c2d04278 100644
--- a/Task/CSV-data-manipulation/ALGOL-68/csv-data-manipulation.alg
+++ b/Task/CSV-data-manipulation/ALGOL-68/csv-data-manipulation.alg
@@ -3,8 +3,8 @@ PROC char count = (CHAR c, STRING str) INT:
BEGIN
INT count := 0;
FOR i TO UPB str DO
- IF c = str[i] THEN count +:= 1
- FI
+ IF c = str[i] THEN count +:= 1
+ FI
OD;
count
END;
@@ -17,9 +17,9 @@ PROC char split = (STRING str, CHAR sep) FLEX[]STRING :
INT start := 1;
[char count (sep, str) + 1] STRING list;
WHILE start <= strlen ANDF char in string (sep, p, str[start:]) DO
- p +:= start - 1;
- list[cnt +:= 1] := str[start:p-1];
- start := p + 1
+ p +:= start - 1;
+ list[cnt +:= 1] := str[start:p-1];
+ start := p + 1
OD;
IF cnt = 0 THEN list[cnt +:= 1] := str
ELIF start <= UPB str + 1 THEN list[cnt +:= 1] := str[start:]
@@ -31,7 +31,7 @@ PROC join = ([]STRING words, STRING sep) STRING:
IF UPB words > 0 THEN
STRING str := words [1];
FOR i FROM 2 TO UPB words DO
- str +:= sep + words[i]
+ str +:= sep + words[i]
OD;
str
ELSE
@@ -60,10 +60,10 @@ OP TOINT = (STRING str) INT:
BEGIN
INT n := 0, sign := 1;
FOR i TO UPB str WHILE sign /= 0 DO
- IF is digit (str[i]) THEN n := n * 10 + ABS str[i] - ABS "0"
- ELIF i = 1 AND str[i] = "-" THEN sign := -1
- ELIF i /= 1 OR str[i] /= "+" THEN sign := 0
- FI
+ IF is digit (str[i]) THEN n := n * 10 + ABS str[i] - ABS "0"
+ ELIF i = 1 AND str[i] = "-" THEN sign := -1
+ ELIF i /= 1 OR str[i] /= "+" THEN sign := 0
+ FI
OD;
n * sign
END;
diff --git a/Task/CSV-data-manipulation/AWK/csv-data-manipulation.awk b/Task/CSV-data-manipulation/AWK/csv-data-manipulation.awk
index f45946981e..5f148a16dd 100644
--- a/Task/CSV-data-manipulation/AWK/csv-data-manipulation.awk
+++ b/Task/CSV-data-manipulation/AWK/csv-data-manipulation.awk
@@ -6,7 +6,7 @@ NR==1 {
}
{
sum = 0
- for (i=1; i<=NF; i++) {
+ for (i=1; i<=NF; i++) {
sum += $i
}
print $0, sum
diff --git a/Task/CSV-data-manipulation/Ada/csv-data-manipulation-1.ada b/Task/CSV-data-manipulation/Ada/csv-data-manipulation-1.ada
deleted file mode 100644
index 66d0814c1a..0000000000
--- a/Task/CSV-data-manipulation/Ada/csv-data-manipulation-1.ada
+++ /dev/null
@@ -1,19 +0,0 @@
-package CSV is
-
- type Row(<>) is tagged private;
-
- function Line(S: String; Separator: Character := ',') return Row;
- function Next(R: in out Row) return Boolean;
- -- if there is still an item in R, Next advances to it and returns True
- function Item(R: Row) return String;
- -- after calling R.Next i times, this returns the i'th item (if any)
-
-private
- type Row(Length: Natural) is tagged record
- Str: String(1 .. Length);
- Fst: Positive;
- Lst: Natural;
- Nxt: Positive;
- Sep: Character;
- end record;
-end CSV;
diff --git a/Task/CSV-data-manipulation/Ada/csv-data-manipulation-2.ada b/Task/CSV-data-manipulation/Ada/csv-data-manipulation-2.ada
deleted file mode 100644
index d3be3a211f..0000000000
--- a/Task/CSV-data-manipulation/Ada/csv-data-manipulation-2.ada
+++ /dev/null
@@ -1,24 +0,0 @@
-package body CSV is
-
- function Line(S: String; Separator: Character := ',')
- return Row is
- (Length => S'Length, Str => S,
- Fst => S'First, Lst => S'Last, Nxt => S'First, Sep => Separator);
-
- function Item(R: Row) return String is
- (R.Str(R.Fst .. R.Lst));
-
- function Next(R: in out Row) return Boolean is
- Last: Natural := R.Nxt;
- begin
- R.Fst := R.Nxt;
- while Last <= R.Str'Last and then R.Str(Last) /= R.Sep loop
- -- find Separator
- Last := Last + 1;
- end loop;
- R.Lst := Last - 1;
- R.Nxt := Last + 1;
- return (R.Fst <= R.Str'Last);
- end Next;
-
-end CSV;
diff --git a/Task/CSV-data-manipulation/Ada/csv-data-manipulation-3.ada b/Task/CSV-data-manipulation/Ada/csv-data-manipulation-3.ada
deleted file mode 100644
index f402572d3f..0000000000
--- a/Task/CSV-data-manipulation/Ada/csv-data-manipulation-3.ada
+++ /dev/null
@@ -1,19 +0,0 @@
-with CSV, Ada.Text_IO; use Ada.Text_IO;
-
-procedure CSV_Data_Manipulation is
- Header: String := Get_Line;
-begin
- Put_Line(Header & ", SUM");
- while not End_Of_File loop
- declare
- R: CSV.Row := CSV.Line(Get_Line);
- Sum: Integer := 0;
- begin
- while R.Next loop
- Sum := Sum + Integer'Value(R.Item);
- Put(R.Item & ",");
- end loop;
- Put_Line(Integer'Image(Sum));
- end;
- end loop;
-end CSV_Data_Manipulation;
diff --git a/Task/CSV-data-manipulation/C/csv-data-manipulation-1.c b/Task/CSV-data-manipulation/C/csv-data-manipulation-1.c
index 060dd21931..6f6b83c3bc 100644
--- a/Task/CSV-data-manipulation/C/csv-data-manipulation-1.c
+++ b/Task/CSV-data-manipulation/C/csv-data-manipulation-1.c
@@ -16,10 +16,10 @@
typedef struct {
- char * delim;
- unsigned int rows;
- unsigned int cols;
- char ** table;
+ char * delim;
+ unsigned int rows;
+ unsigned int cols;
+ char ** table;
} CSV;
@@ -27,28 +27,28 @@ typedef struct {
* Utility function to trim whitespaces from left & right of a string
*/
int trim(char ** str) {
- int trimmed;
- int n;
- int len;
-
- len = strlen(*str);
- n = len - 1;
- /* from right */
- while((n>=0) && isspace((*str)[n])) {
- (*str)[n] = '\0';
- trimmed += 1;
- n--;
- }
+ int trimmed;
+ int n;
+ int len;
- /* from left */
- n = 0;
- while((n < len) && (isspace((*str)[0]))) {
- (*str)[0] = '\0';
- *str = (*str)+1;
- trimmed += 1;
- n++;
- }
- return trimmed;
+ len = strlen(*str);
+ n = len - 1;
+ /* from right */
+ while((n>=0) && isspace((*str)[n])) {
+ (*str)[n] = '\0';
+ trimmed += 1;
+ n--;
+ }
+
+ /* from left */
+ n = 0;
+ while((n < len) && (isspace((*str)[0]))) {
+ (*str)[0] = '\0';
+ *str = (*str)+1;
+ trimmed += 1;
+ n++;
+ }
+ return trimmed;
}
@@ -56,11 +56,11 @@ int trim(char ** str) {
* De-allocate csv structure
*/
int csv_destroy(CSV * csv) {
- if (csv == NULL) { return 0; }
- if (csv->table != NULL) { free(csv->table); }
- if (csv->delim != NULL) { free(csv->delim); }
- free(csv);
- return 0;
+ if (csv == NULL) { return 0; }
+ if (csv->table != NULL) { free(csv->table); }
+ if (csv->delim != NULL) { free(csv->delim); }
+ free(csv);
+ return 0;
}
@@ -68,23 +68,23 @@ int csv_destroy(CSV * csv) {
* Allocate memory for a CSV structure
*/
CSV * csv_create(unsigned int cols, unsigned int rows) {
- CSV * csv;
-
- csv = malloc(sizeof(CSV));
- csv->rows = rows;
- csv->cols = cols;
- csv->delim = strdup(",");
+ CSV * csv;
- csv->table = malloc(sizeof(char *) * cols * rows);
- if (csv->table == NULL) { goto error; }
+ csv = malloc(sizeof(CSV));
+ csv->rows = rows;
+ csv->cols = cols;
+ csv->delim = strdup(",");
- memset(csv->table, 0, sizeof(char *) * cols * rows);
+ csv->table = malloc(sizeof(char *) * cols * rows);
+ if (csv->table == NULL) { goto error; }
- return csv;
+ memset(csv->table, 0, sizeof(char *) * cols * rows);
+
+ return csv;
error:
- csv_destroy(csv);
- return NULL;
+ csv_destroy(csv);
+ return NULL;
}
@@ -92,9 +92,9 @@ error:
* Get value in CSV table at COL, ROW
*/
char * csv_get(CSV * csv, unsigned int col, unsigned int row) {
- unsigned int idx;
- idx = col + (row * csv->cols);
- return csv->table[idx];
+ unsigned int idx;
+ idx = col + (row * csv->cols);
+ return csv->table[idx];
}
@@ -102,84 +102,84 @@ char * csv_get(CSV * csv, unsigned int col, unsigned int row) {
* Set value in CSV table at COL, ROW
*/
int csv_set(CSV * csv, unsigned int col, unsigned int row, char * value) {
- unsigned int idx;
- idx = col + (row * csv->cols);
- csv->table[idx] = value;
- return 0;
+ unsigned int idx;
+ idx = col + (row * csv->cols);
+ csv->table[idx] = value;
+ return 0;
}
void csv_display(CSV * csv) {
- int row, col;
- char * content;
- if ((csv->rows == 0) || (csv->cols==0)) {
- printf("[Empty table]\n");
- return ;
- }
+ int row, col;
+ char * content;
+ if ((csv->rows == 0) || (csv->cols==0)) {
+ printf("[Empty table]\n");
+ return ;
+ }
- printf("\n[Table cols=%d rows=%d]\n", csv->cols, csv->rows);
- for (row=0; rowrows; row++) {
- printf("[|");
- for (col=0; colcols; col++) {
- content = csv_get(csv, col, row);
+ printf("\n[Table cols=%d rows=%d]\n", csv->cols, csv->rows);
+ for (row=0; rowrows; row++) {
+ printf("[|");
+ for (col=0; colcols; col++) {
+ content = csv_get(csv, col, row);
printf("%s\t|", content);
- }
+ }
printf("]\n");
- }
- printf("\n");
+ }
+ printf("\n");
}
/**
* Resize CSV table
*/
int csv_resize(CSV * old_csv, unsigned int new_cols, unsigned int new_rows) {
- unsigned int cur_col,
- cur_row,
- max_cols,
- max_rows;
- CSV * new_csv;
- char * content;
- bool in_old, in_new;
+ unsigned int cur_col,
+ cur_row,
+ max_cols,
+ max_rows;
+ CSV * new_csv;
+ char * content;
+ bool in_old, in_new;
- /* Build a new (fake) csv */
- new_csv = csv_create(new_cols, new_rows);
- if (new_csv == NULL) { goto error; }
+ /* Build a new (fake) csv */
+ new_csv = csv_create(new_cols, new_rows);
+ if (new_csv == NULL) { goto error; }
- new_csv->rows = new_rows;
- new_csv->cols = new_cols;
+ new_csv->rows = new_rows;
+ new_csv->cols = new_cols;
- max_cols = (new_cols > old_csv->cols)? new_cols : old_csv->cols;
- max_rows = (new_rows > old_csv->rows)? new_rows : old_csv->rows;
+ max_cols = (new_cols > old_csv->cols)? new_cols : old_csv->cols;
+ max_rows = (new_rows > old_csv->rows)? new_rows : old_csv->rows;
- for (cur_col=0; cur_colcols) && (cur_row < old_csv->rows);
- in_new = (cur_col < new_csv->cols) && (cur_row < new_csv->rows);
+ for (cur_col=0; cur_colcols) && (cur_row < old_csv->rows);
+ in_new = (cur_col < new_csv->cols) && (cur_row < new_csv->rows);
- if (in_old && in_new) {
- /* re-link data */
- content = csv_get(old_csv, cur_col, cur_row);
- csv_set(new_csv, cur_col, cur_row, content);
- } else if (in_old) {
- /* destroy data */
- content = csv_get(old_csv, cur_col, cur_row);
- free(content);
- } else { /* skip */ }
- }
- }
- /* on rows */
- free(old_csv->table);
- old_csv->rows = new_rows;
- old_csv->cols = new_cols;
- old_csv->table = new_csv->table;
- new_csv->table = NULL;
- csv_destroy(new_csv);
+ if (in_old && in_new) {
+ /* re-link data */
+ content = csv_get(old_csv, cur_col, cur_row);
+ csv_set(new_csv, cur_col, cur_row, content);
+ } else if (in_old) {
+ /* destroy data */
+ content = csv_get(old_csv, cur_col, cur_row);
+ free(content);
+ } else { /* skip */ }
+ }
+ }
+ /* on rows */
+ free(old_csv->table);
+ old_csv->rows = new_rows;
+ old_csv->cols = new_cols;
+ old_csv->table = new_csv->table;
+ new_csv->table = NULL;
+ csv_destroy(new_csv);
- return 0;
+ return 0;
error:
- printf("Unable to resize CSV table: error %d - %s\n", errno, strerror(errno));
- return -1;
+ printf("Unable to resize CSV table: error %d - %s\n", errno, strerror(errno));
+ return -1;
}
@@ -187,42 +187,42 @@ error:
* Open CSV file and load its content into provided CSV structure
**/
int csv_open(CSV * csv, char * filename) {
- FILE * fp;
- unsigned int m_rows;
- unsigned int m_cols, cols;
- char line[2048];
- char * lineptr;
- char * token;
+ FILE * fp;
+ unsigned int m_rows;
+ unsigned int m_cols, cols;
+ char line[2048];
+ char * lineptr;
+ char * token;
- fp = fopen(filename, "r");
- if (fp == NULL) { goto error; }
+ fp = fopen(filename, "r");
+ if (fp == NULL) { goto error; }
- m_rows = 0;
- m_cols = 0;
- while(fgets(line, sizeof(line), fp) != NULL) {
- m_rows += 1;
- cols = 0;
- lineptr = line;
- while ((token = strtok(lineptr, csv->delim)) != NULL) {
- lineptr = NULL;
- trim(&token);
+ m_rows = 0;
+ m_cols = 0;
+ while(fgets(line, sizeof(line), fp) != NULL) {
+ m_rows += 1;
+ cols = 0;
+ lineptr = line;
+ while ((token = strtok(lineptr, csv->delim)) != NULL) {
+ lineptr = NULL;
+ trim(&token);
cols += 1;
- if (cols > m_cols) { m_cols = cols; }
+ if (cols > m_cols) { m_cols = cols; }
csv_resize(csv, m_cols, m_rows);
csv_set(csv, cols-1, m_rows-1, strdup(token));
}
- }
+ }
- fclose(fp);
- csv->rows = m_rows;
- csv->cols = m_cols;
- return 0;
+ fclose(fp);
+ csv->rows = m_rows;
+ csv->cols = m_cols;
+ return 0;
error:
- fclose(fp);
- printf("Unable to open %s for reading.", filename);
- return -1;
+ fclose(fp);
+ printf("Unable to open %s for reading.", filename);
+ return -1;
}
@@ -230,22 +230,22 @@ error:
* Open CSV file and save CSV structure content into it
**/
int csv_save(CSV * csv, char * filename) {
- FILE * fp;
- int row, col;
- char * content;
+ FILE * fp;
+ int row, col;
+ char * content;
- fp = fopen(filename, "w");
- for (row=0; rowrows; row++) {
- for (col=0; colcols; col++) {
- content = csv_get(csv, col, row);
+ fp = fopen(filename, "w");
+ for (row=0; rowrows; row++) {
+ for (col=0; colcols; col++) {
+ content = csv_get(csv, col, row);
fprintf(fp, "%s%s", content,
- ((col == csv->cols-1) ? "" : csv->delim) );
- }
+ ((col == csv->cols-1) ? "" : csv->delim) );
+ }
fprintf(fp, "\n");
- }
+ }
- fclose(fp);
- return 0;
+ fclose(fp);
+ return 0;
}
@@ -253,23 +253,23 @@ int csv_save(CSV * csv, char * filename) {
* Test
*/
int main(int argc, char ** argv) {
- CSV * csv;
+ CSV * csv;
- printf("%s\n%s\n\n",TITLE, URL);
+ printf("%s\n%s\n\n",TITLE, URL);
- csv = csv_create(0, 0);
- csv_open(csv, "fixtures/csv-data-manipulation.csv");
- csv_display(csv);
+ csv = csv_create(0, 0);
+ csv_open(csv, "fixtures/csv-data-manipulation.csv");
+ csv_display(csv);
- csv_set(csv, 0, 0, "Column0");
- csv_set(csv, 1, 1, "100");
- csv_set(csv, 2, 2, "200");
- csv_set(csv, 3, 3, "300");
- csv_set(csv, 4, 4, "400");
- csv_display(csv);
+ csv_set(csv, 0, 0, "Column0");
+ csv_set(csv, 1, 1, "100");
+ csv_set(csv, 2, 2, "200");
+ csv_set(csv, 3, 3, "300");
+ csv_set(csv, 4, 4, "400");
+ csv_display(csv);
- csv_save(csv, "tmp/csv-data-manipulation.result.csv");
- csv_destroy(csv);
+ csv_save(csv, "tmp/csv-data-manipulation.result.csv");
+ csv_destroy(csv);
- return 0;
+ return 0;
}
diff --git a/Task/CSV-data-manipulation/COBOL/csv-data-manipulation.cobol b/Task/CSV-data-manipulation/COBOL/csv-data-manipulation.cobol
deleted file mode 100644
index c35b4d5f9e..0000000000
--- a/Task/CSV-data-manipulation/COBOL/csv-data-manipulation.cobol
+++ /dev/null
@@ -1,93 +0,0 @@
- IDENTIFICATION DIVISION.
- PROGRAM-ID. CSV.
- AUTHOR. Bill Gunshannon.
- INSTALLATION. Home.
- DATE-WRITTEN. 19 December 2021.
- ************************************************************
- ** Program Abstract:
- ** CSVs are something COBOL does pretty well.
- ** The commented out CONCATENATE statements are a
- ** second method other than the STRING method.
- ************************************************************
-
- ENVIRONMENT DIVISION.
- CONFIGURATION SECTION.
- REPOSITORY.
- FUNCTION ALL INTRINSIC.
-
- INPUT-OUTPUT SECTION.
- FILE-CONTROL.
- SELECT CSV-File ASSIGN TO "csv.txt"
- ORGANIZATION IS LINE SEQUENTIAL.
- SELECT Out-File ASSIGN TO "new.csv.txt"
- ORGANIZATION IS LINE SEQUENTIAL.
-
-
- DATA DIVISION.
-
- FILE SECTION.
-
- FD CSV-File
- DATA RECORD IS CSV-Record.
- 01 CSV-Record.
- 05 Field1 PIC X(64).
-
- FD Out-File
- DATA RECORD IS Out-Line.
- 01 Out-Line PIC X(80).
-
- WORKING-STORAGE SECTION.
-
- 01 Eof PIC X VALUE 'F'.
-
- 01 CSV-Data.
- 05 CSV-Col1 PIC 9(5).
- 05 CSV-Col2 PIC 9(5).
- 05 CSV-Col3 PIC 9(5).
- 05 CSV-Col4 PIC 9(5).
- 05 CSV-Col5 PIC 9(5).
-
- 01 CSV-Sum PIC ZZZ9.
- 01 CSV-Sum-Alpha
- REDEFINES CSV-Sum PIC X(4).
-
- PROCEDURE DIVISION.
-
- Main-Program.
- OPEN INPUT CSV-File
- OPEN OUTPUT Out-File
- PERFORM Read-a-Record
- PERFORM Build-Header
- PERFORM UNTIL Eof = 'T'
- PERFORM Read-a-Record
- IF Eof NOT EQUAL 'T' PERFORM Process-a-Record
- END-PERFORM
- CLOSE CSV-File
- CLOSE Out-File
- STOP RUN.
-
- Read-a-Record.
- READ CSV-File
- AT END MOVE 'T' TO Eof
- END-READ.
-
- Build-Header.
- ** MOVE CONCATENATE(TRIM(CSV-Record), ",SUM"
- ** TO Out-Line.
- STRING TRIM(CSV-Record), ",SUM" INTO Out-Line.
- WRITE Out-Line.
- MOVE SPACES TO Out-Line.
-
- Process-a-Record.
- UNSTRING CSV-Record DELIMITED BY ',' INTO
- CSV-Col1 CSV-Col2 CSV-Col3 CSV-Col4 CSV-Col5.
- COMPUTE CSV-Sum =
- CSV-Col1 + CSV-Col2 + CSV-Col3 + CSV-Col4 + CSV-Col5.
- ** MOVE CONCATENATE(TRIM(CSV-Record), "," TRIM(CSV-Sum-Alpha))
- ** TO Out-Line.
- STRING TRIM(CSV-Record), "," TRIM(CSV-Sum-Alpha)
- INTO Out-Line.
- WRITE Out-Line.
- MOVE SPACES TO Out-Line.
-
- END-PROGRAM.
diff --git a/Task/CSV-data-manipulation/ECL/csv-data-manipulation.ecl b/Task/CSV-data-manipulation/ECL/csv-data-manipulation.ecl
index b69c763781..1e1feac64c 100644
--- a/Task/CSV-data-manipulation/ECL/csv-data-manipulation.ecl
+++ b/Task/CSV-data-manipulation/ECL/csv-data-manipulation.ecl
@@ -5,7 +5,7 @@ STRING Field2;
STRING Field3;
STRING Field4;
STRING Field5;
-END;
+END;
MyDataset := DATASET ('~Rosetta::myCSVFile', MyFileLayout,CSV(SEPARATOR(',')));
diff --git a/Task/CSV-data-manipulation/EchoLisp/csv-data-manipulation-1.l b/Task/CSV-data-manipulation/EchoLisp/csv-data-manipulation-1.l
index 9afa63c6bb..d621e254ba 100644
--- a/Task/CSV-data-manipulation/EchoLisp/csv-data-manipulation-1.l
+++ b/Task/CSV-data-manipulation/EchoLisp/csv-data-manipulation-1.l
@@ -10,12 +10,10 @@
(define (task file)
(let*
- ((table (csv->table file))
- (header (first table))
- (rows (rest table)))
-
- (table->csv
- (append header "SUM") ;; add last column
- (for/list ((row rows)) (append row (apply + row))))))
+ ((table (csv->table file))
+ (header (first table))
+ (rows (rest table)))
-
+ (table->csv
+ (append header "SUM") ;; add last column
+ (for/list ((row rows)) (append row (apply + row))))))
diff --git a/Task/CSV-data-manipulation/Euphoria/csv-data-manipulation.ex b/Task/CSV-data-manipulation/Euphoria/csv-data-manipulation.ex
deleted file mode 100644
index 85ed288be0..0000000000
--- a/Task/CSV-data-manipulation/Euphoria/csv-data-manipulation.ex
+++ /dev/null
@@ -1,91 +0,0 @@
---- Read CSV file and add columns headed with 'SUM'
---- with trace
--- trace(0)
-
-include get.e
-include std/text.e
-
-function split(sequence s, integer c)
- sequence removables = " \t\n\r\x05\u0234\" "
- sequence out
- integer first, delim
- out = {}
- first = 1
- while first <= length(s) do
- delim = find_from(c,s,first)
- if delim = 0 then
- delim = length(s)+1
- end if
- out = append(out,trim(s[first..delim-1],removables))
- first = delim + 1
- end while
- return out
-end function
-
-procedure main()
- integer fn -- the file number
- integer fn2 -- the output file number
- integer e -- the number of lines read
- object line -- the next line from the file
- sequence data = {} -- parsed csv data row
- sequence headerNames = {} -- array saving column names
- atom sum = 0.0 -- sum for each row
- sequence var -- holds numerical data read
-
- -- First we try to open the file called "data.csv".
- fn = open("data.csv", "r")
- if fn = -1 then
- puts(1, "Can't open data.csv\n")
- -- abort();
- end if
-
- -- Then we create an output file for processed data.
- fn2 = open("newdata.csv", "w")
- if fn2 = -1 then
- puts(1, "Can't create newdata.csv\n")
- end if
-
- -- By successfully opening the file we have established that
- -- the file exists, and open() gives us a file number (or "handle")
- -- that we can use to perform operations on the file.
-
- e = 1
- while 1 do
- line = gets(fn)
- if atom(line) then
- exit
- end if
- data = split(line, ',')
-
- if (e=1) then
- -- Save the header labels and
- -- write them to output file.
- headerNames = data
- for i=1 to length(headerNames) do
- printf(fn2, "%s,", {headerNames[i]})
- end for
- printf(fn2, "SUM\n")
- end if
-
- -- Run a sum for the numerical data.
- if (e >= 2) then
- for i=1 to length(data) do
- printf(fn2, "%s,", {data[i]})
- var = value(data[i])
- if var[1] = 0 then
- -- data read is numerical
- -- add to sum
- sum = sum + var[2]
- end if
- end for
- printf(fn2, "%g\n", {sum})
- sum = 0.0
- end if
- e = e + 1
- end while
-
- close(fn)
- close(fn2)
-end procedure
-
-main()
diff --git a/Task/CSV-data-manipulation/Fortran/csv-data-manipulation-2.f b/Task/CSV-data-manipulation/Fortran/csv-data-manipulation-2.f
index ef63969cbc..6e400d25ef 100644
--- a/Task/CSV-data-manipulation/Fortran/csv-data-manipulation-2.f
+++ b/Task/CSV-data-manipulation/Fortran/csv-data-manipulation-2.f
@@ -1,20 +1,20 @@
Copies a file with 5 comma-separated values to a line, appending a column holding their sum.
- INTEGER N !Instead of littering the source with "5"
- PARAMETER (N = 5) !Provide some provenance.
- CHARACTER*6 HEAD(N) !A perfect size?
- INTEGER X(N) !Integers suffice.
- INTEGER LINPR,IN !I/O unit numbers.
- LINPR = 6 !Standard output via this unit number.
- IN = 10 !Some unit number for the input file.
- OPEN (IN,FILE="CSVtest.csv",STATUS="OLD",ACTION="READ") !For formatted input.
+ INTEGER N !Instead of littering the source with "5"
+ PARAMETER (N = 5) !Provide some provenance.
+ CHARACTER*6 HEAD(N) !A perfect size?
+ INTEGER X(N) !Integers suffice.
+ INTEGER LINPR,IN !I/O unit numbers.
+ LINPR = 6 !Standard output via this unit number.
+ IN = 10 !Some unit number for the input file.
+ OPEN (IN,FILE="CSVtest.csv",STATUS="OLD",ACTION="READ") !For formatted input.
- READ (IN,*) HEAD !The first line has texts as column headings.
- WRITE (LINPR,1) (TRIM(HEAD(I)), I = 1,N),"Sum" !Append a "Sum" column.
- 1 FORMAT (666(A:",")) !The : sez "stop if no list element awaits".
- 2 READ (IN,*,END = 10) X !Read a line's worth of numbers, separated by commas or spaces.
- WRITE (LINPR,3) X,SUM(X) !Write, with a total appended.
- 3 FORMAT (666(I0:",")) !I0 editing uses only as many columns as are needed.
- GO TO 2 !Do it again.
+ READ (IN,*) HEAD !The first line has texts as column headings.
+ WRITE (LINPR,1) (TRIM(HEAD(I)), I = 1,N),"Sum" !Append a "Sum" column.
+ 1 FORMAT (666(A:",")) !The : sez "stop if no list element awaits".
+ 2 READ (IN,*,END = 10) X !Read a line's worth of numbers, separated by commas or spaces.
+ WRITE (LINPR,3) X,SUM(X) !Write, with a total appended.
+ 3 FORMAT (666(I0:",")) !I0 editing uses only as many columns as are needed.
+ GO TO 2 !Do it again.
- 10 CLOSE (IN) !All done.
- END !That's all.
+ 10 CLOSE (IN) !All done.
+ END !That's all.
diff --git a/Task/CSV-data-manipulation/FunL/csv-data-manipulation.funl b/Task/CSV-data-manipulation/FunL/csv-data-manipulation.funl
index 17cee74435..2bb6312e7a 100644
--- a/Task/CSV-data-manipulation/FunL/csv-data-manipulation.funl
+++ b/Task/CSV-data-manipulation/FunL/csv-data-manipulation.funl
@@ -34,7 +34,7 @@ def updateRow( header, row, updates ) =
updates( r )
vector( r(f) | f <- header )
-def update( table, updates ) =
+def update( table, updates ) =
Table( table.header, (updateRow(table.header, r, updates) | r <- table.rows).toList() )
def addColumn( table, column, updates ) =
diff --git a/Task/CSV-data-manipulation/Go/csv-data-manipulation.go b/Task/CSV-data-manipulation/Go/csv-data-manipulation.go
index d6adc29b82..b893656760 100644
--- a/Task/CSV-data-manipulation/Go/csv-data-manipulation.go
+++ b/Task/CSV-data-manipulation/Go/csv-data-manipulation.go
@@ -1,58 +1,58 @@
package main
import (
- "encoding/csv"
- "log"
- "os"
- "strconv"
+ "encoding/csv"
+ "log"
+ "os"
+ "strconv"
)
func main() {
- rows := readSample()
- appendSum(rows)
- writeChanges(rows)
+ rows := readSample()
+ appendSum(rows)
+ writeChanges(rows)
}
func readSample() [][]string {
- f, err := os.Open("sample.csv")
- if err != nil {
- log.Fatal(err)
- }
- rows, err := csv.NewReader(f).ReadAll()
- f.Close()
- if err != nil {
- log.Fatal(err)
- }
- return rows
+ f, err := os.Open("sample.csv")
+ if err != nil {
+ log.Fatal(err)
+ }
+ rows, err := csv.NewReader(f).ReadAll()
+ f.Close()
+ if err != nil {
+ log.Fatal(err)
+ }
+ return rows
}
func appendSum(rows [][]string) {
- rows[0] = append(rows[0], "SUM")
- for i := 1; i < len(rows); i++ {
- rows[i] = append(rows[i], sum(rows[i]))
- }
+ rows[0] = append(rows[0], "SUM")
+ for i := 1; i < len(rows); i++ {
+ rows[i] = append(rows[i], sum(rows[i]))
+ }
}
func sum(row []string) string {
- sum := 0
- for _, s := range row {
- x, err := strconv.Atoi(s)
- if err != nil {
- return "NA"
- }
- sum += x
- }
- return strconv.Itoa(sum)
+ sum := 0
+ for _, s := range row {
+ x, err := strconv.Atoi(s)
+ if err != nil {
+ return "NA"
+ }
+ sum += x
+ }
+ return strconv.Itoa(sum)
}
func writeChanges(rows [][]string) {
- f, err := os.Create("output.csv")
- if err != nil {
- log.Fatal(err)
- }
- err = csv.NewWriter(f).WriteAll(rows)
- f.Close()
- if err != nil {
- log.Fatal(err)
- }
+ f, err := os.Create("output.csv")
+ if err != nil {
+ log.Fatal(err)
+ }
+ err = csv.NewWriter(f).WriteAll(rows)
+ f.Close()
+ if err != nil {
+ log.Fatal(err)
+ }
}
diff --git a/Task/CSV-data-manipulation/Logo/csv-data-manipulation-1.logo b/Task/CSV-data-manipulation/Logo/csv-data-manipulation-1.logo
index f04a62f4a7..c8936190c7 100644
--- a/Task/CSV-data-manipulation/Logo/csv-data-manipulation-1.logo
+++ b/Task/CSV-data-manipulation/Logo/csv-data-manipulation-1.logo
@@ -1,19 +1,19 @@
to csv.data.manipulation :in :out
local [header line list sum]
- openread :in
- setread :in
- openwrite :out
- setwrite :out
- make "header readword
+ openread :in
+ setread :in
+ openwrite :out
+ setwrite :out
+ make "header readword
print word :header ",SUM
- while [not eofp] [
- make "line readword
- make "list parse map [ifelse equalp ? ", ["\ ] [?]] :line
- make "sum apply "sum :list
- print (word :line "\, :sum)
- ]
- close :in
- setread []
- close :out
- setwrite []
+ while [not eofp] [
+ make "line readword
+ make "list parse map [ifelse equalp ? ", ["\ ] [?]] :line
+ make "sum apply "sum :list
+ print (word :line "\, :sum)
+ ]
+ close :in
+ setread []
+ close :out
+ setwrite []
end
diff --git a/Task/CSV-data-manipulation/Lua/csv-data-manipulation-1.lua b/Task/CSV-data-manipulation/Lua/csv-data-manipulation-1.lua
index 38f23efa69..8296349d52 100644
--- a/Task/CSV-data-manipulation/Lua/csv-data-manipulation-1.lua
+++ b/Task/CSV-data-manipulation/Lua/csv-data-manipulation-1.lua
@@ -3,11 +3,9 @@
print(io.read"l" .. ",SUM")
for line in io.lines() do
- local fields, sum = {}, 0
- for field in line:gmatch"[^,]+" do
- table.insert(fields, field)
- sum = sum + field
- end
- table.insert(fields, sum)
- print(table.concat(fields,","))
+ local sum = 0
+ for field in line:gmatch"[^,]+" do
+ sum = sum + field
+ end
+ print(line .. "," .. sum)
end
diff --git a/Task/CSV-data-manipulation/MATLAB/csv-data-manipulation-1.m b/Task/CSV-data-manipulation/MATLAB/csv-data-manipulation-1.m
index 16512a1db4..ad5d27aed9 100644
--- a/Task/CSV-data-manipulation/MATLAB/csv-data-manipulation-1.m
+++ b/Task/CSV-data-manipulation/MATLAB/csv-data-manipulation-1.m
@@ -7,7 +7,7 @@ X = dlmread(filename,',',1,0);
fid = fopen('data.out.csv','w+');
fprintf(fid,'%s,sum\n',header);
for k=1:size(X,1),
- fprintf(fid,"%i,",X(k,:));
- fprintf(fid,"%i\n",sum(X(k,:)));
+ fprintf(fid,"%i,",X(k,:));
+ fprintf(fid,"%i\n",sum(X(k,:)));
end;
fclose(fid);
diff --git a/Task/CSV-data-manipulation/PowerShell/csv-data-manipulation.psh b/Task/CSV-data-manipulation/PowerShell/csv-data-manipulation.psh
deleted file mode 100644
index 3623ef05e8..0000000000
--- a/Task/CSV-data-manipulation/PowerShell/csv-data-manipulation.psh
+++ /dev/null
@@ -1,33 +0,0 @@
-## Create a CSV file
-@"
-C1,C2,C3,C4,C5
-1,5,9,13,17
-2,6,10,14,18
-3,7,11,15,19
-4,8,12,16,20
-"@ -split "`r`n" | Out-File -FilePath .\Temp.csv -Force
-
-## Import each line of the CSV file into an array of PowerShell objects
-$records = Import-Csv -Path .\Temp.csv
-
-## Sum the values of the properties of each object
-$sums = $records | ForEach-Object {
- [int]$sum = 0
- foreach ($field in $_.PSObject.Properties.Name)
- {
- $sum += $_.$field
- }
- $sum
-}
-
-## Add a column (Sum) and its value to each object in the array
-$records = for ($i = 0; $i -lt $sums.Count; $i++)
-{
- $records[$i] | Select-Object *,@{Name='Sum';Expression={$sums[$i]}}
-}
-
-## Export the array of modified objects to the CSV file
-$records | Export-Csv -Path .\Temp.csv -Force
-
-## Display the object in tabular form
-$records | Format-Table -AutoSize
diff --git a/Task/CSV-data-manipulation/Prolog/csv-data-manipulation.pro b/Task/CSV-data-manipulation/Prolog/csv-data-manipulation.pro
index 028345fd11..4f86884d47 100644
--- a/Task/CSV-data-manipulation/Prolog/csv-data-manipulation.pro
+++ b/Task/CSV-data-manipulation/Prolog/csv-data-manipulation.pro
@@ -2,21 +2,21 @@ test :- augment('test.csv', 'test.out.csv').
% augment( +InFileName, +OutFileName)
augment(InFile, OutFile) :-
- open(OutFile, write, OutStream),
- ( ( csv_read_file_row(InFile, Row, [line(Line)]),
- % Row is of the form row( Item1, Item2, ....).
- addrow(Row, Out),
- csv_write_stream(OutStream, [Out], []),
- fail
- )
- ; close(OutStream)
- ).
+ open(OutFile, write, OutStream),
+ ( ( csv_read_file_row(InFile, Row, [line(Line)]),
+ % Row is of the form row( Item1, Item2, ....).
+ addrow(Row, Out),
+ csv_write_stream(OutStream, [Out], []),
+ fail
+ )
+ ; close(OutStream)
+ ).
% If the first item in a row is an integer, then append the sum;
% otherwise append 'SUM':
addrow( Term, NewTerm ) :-
- Term =.. [F | List],
- List = [X|_],
- (integer(X) -> sum_list(List, Sum) ; Sum = 'SUM'),
- append(List, [Sum], NewList),
- NewTerm =.. [F | NewList].
+ Term =.. [F | List],
+ List = [X|_],
+ (integer(X) -> sum_list(List, Sum) ; Sum = 'SUM'),
+ append(List, [Sum], NewList),
+ NewTerm =.. [F | NewList].
diff --git a/Task/CSV-data-manipulation/Red/csv-data-manipulation-2.red b/Task/CSV-data-manipulation/Red/csv-data-manipulation-2.red
index caf8b0fc9d..c48fba572d 100644
--- a/Task/CSV-data-manipulation/Red/csv-data-manipulation-2.red
+++ b/Task/CSV-data-manipulation/Red/csv-data-manipulation-2.red
@@ -1,6 +1,6 @@
>>forall data [either (index? data) = 1[
- append data/1 "SUM"
+ append data/1 "SUM"
][
- append data/1 to string!
- (to integer! data/1/1) + (to integer! data/1/2) + (to integer! data/1/3) + (to integer! data/1/4) + (to integer! data/1/5)
+ append data/1 to string!
+ (to integer! data/1/1) + (to integer! data/1/2) + (to integer! data/1/3) + (to integer! data/1/4) + (to integer! data/1/5)
]]
diff --git a/Task/CSV-data-manipulation/Scala/csv-data-manipulation.scala b/Task/CSV-data-manipulation/Scala/csv-data-manipulation.scala
index 634a37b191..2abe9cda6f 100644
--- a/Task/CSV-data-manipulation/Scala/csv-data-manipulation.scala
+++ b/Task/CSV-data-manipulation/Scala/csv-data-manipulation.scala
@@ -3,10 +3,10 @@ import scala.io.Source
object parseCSV extends App {
val rawData = """|C1,C2,C3,C4,C5
- |1,5,9,13,17
- |2,6,10,14,18
- |3,7,11,15,19
- |20,21,22,23,24""".stripMargin
+ |1,5,9,13,17
+ |2,6,10,14,18
+ |3,7,11,15,19
+ |20,21,22,23,24""".stripMargin
val data = Seq((Source.fromString(rawData).getLines()).map(_.split(",")).toSeq: _*)
diff --git a/Task/CSV-data-manipulation/SenseTalk/csv-data-manipulation.sensetalk b/Task/CSV-data-manipulation/SenseTalk/csv-data-manipulation.sensetalk
index da0e4ef1f9..8278882de7 100644
--- a/Task/CSV-data-manipulation/SenseTalk/csv-data-manipulation.sensetalk
+++ b/Task/CSV-data-manipulation/SenseTalk/csv-data-manipulation.sensetalk
@@ -14,7 +14,7 @@ insert "SUM" into item 1 of csvData -- add a new column heading
// Go through all of the data rows to add the sum
repeat with rowNum= 2 to the number of items in csvData
- insert the sum of item rowNum of csvData into item rowNum of csvData
+ insert the sum of item rowNum of csvData into item rowNum of csvData
end repeat
put csvData -- see the modified data as a list of lists
diff --git a/Task/CSV-data-manipulation/Tcl/csv-data-manipulation-1.tcl b/Task/CSV-data-manipulation/Tcl/csv-data-manipulation-1.tcl
index 9d26066be0..ad39da5984 100644
--- a/Task/CSV-data-manipulation/Tcl/csv-data-manipulation-1.tcl
+++ b/Task/CSV-data-manipulation/Tcl/csv-data-manipulation-1.tcl
@@ -13,9 +13,9 @@ proc addSumColumn {filename {title "SUM"}} {
set sumcol [$m columns]
$m add column $title
for {set i 1} {$i < [$m rows]} {incr i} {
- # Fill out a dummy value
- $m set cell $sumcol $i 0
- $m set cell $sumcol $i [tcl::mathop::+ {*}[$m get row $i]]
+ # Fill out a dummy value
+ $m set cell $sumcol $i 0
+ $m set cell $sumcol $i [tcl::mathop::+ {*}[$m get row $i]]
}
# Write the CSV out
diff --git a/Task/CSV-data-manipulation/Tcl/csv-data-manipulation-2.tcl b/Task/CSV-data-manipulation/Tcl/csv-data-manipulation-2.tcl
index e863925092..328e7512b6 100644
--- a/Task/CSV-data-manipulation/Tcl/csv-data-manipulation-2.tcl
+++ b/Task/CSV-data-manipulation/Tcl/csv-data-manipulation-2.tcl
@@ -1,6 +1,6 @@
set f [open example.csv r]
puts "[gets $f],SUM"
while { [gets $f row] > 0 } {
- puts "$row,[expr [string map {, +} $row]]"
+ puts "$row,[expr [string map {, +} $row]]"
}
close $f
diff --git a/Task/CSV-data-manipulation/VBScript/csv-data-manipulation.vb b/Task/CSV-data-manipulation/VBScript/csv-data-manipulation.vb
deleted file mode 100644
index da5502ec55..0000000000
--- a/Task/CSV-data-manipulation/VBScript/csv-data-manipulation.vb
+++ /dev/null
@@ -1,35 +0,0 @@
-'Instatiate FSO.
-Set objFSO = CreateObject("Scripting.FileSystemObject")
-'Open the CSV file for reading. The file is in the same folder as the script and named csv_sample.csv.
-Set objInCSV = objFSO.OpenTextFile(objFSO.GetParentFolderName(WScript.ScriptFullName) & "\csv_sample.csv",1,False)
-'Set header status to account for the first line as the column headers.
-IsHeader = True
-'Initialize the var for the output string.
-OutTxt = ""
-'Read each line of the file.
-Do Until objInCSV.AtEndOfStream
- line = objInCSV.ReadLine
- If IsHeader Then
- OutTxt = OutTxt & line & ",SUM" & vbCrLf
- IsHeader = False
- Else
- OutTxt = OutTxt & line & "," & AddElements(line) & vbCrLf
- End If
-Loop
-'Close the file.
-objInCSV.Close
-'Open the same file for writing.
-Set objOutCSV = objFSO.OpenTextFile(objFSO.GetParentFolderName(WScript.ScriptFullName) & "\csv_sample.csv",2,True)
-'Write the var OutTxt to the file overwriting existing contents.
-objOutCSV.Write OutTxt
-'Close the file.
-objOutCSV.Close
-Set objFSO = Nothing
-
-'Routine to add each element in a row.
-Function AddElements(s)
- arr = Split(s,",")
- For i = 0 To UBound(arr)
- AddElements = AddElements + CInt(arr(i))
- Next
-End Function
diff --git a/Task/CSV-to-HTML-translation/Ada/csv-to-html-translation-1.ada b/Task/CSV-to-HTML-translation/Ada/csv-to-html-translation-1.ada
deleted file mode 100644
index 158e12fe06..0000000000
--- a/Task/CSV-to-HTML-translation/Ada/csv-to-html-translation-1.ada
+++ /dev/null
@@ -1,40 +0,0 @@
-with Ada.Strings.Fixed;
-with Ada.Text_IO;
-with Templates_Parser;
-
-procedure Csv2Html is
- use type Templates_Parser.Vector_Tag;
-
- Chars : Templates_Parser.Vector_Tag;
- Speeches : Templates_Parser.Vector_Tag;
-
- CSV_File : Ada.Text_IO.File_Type;
-begin
- -- read the csv data
- Ada.Text_IO.Open (File => CSV_File,
- Mode => Ada.Text_IO.In_File,
- Name => "data.csv");
-
- -- fill the tags
- while not Ada.Text_IO.End_Of_File (CSV_File) loop
- declare
- Whole_Line : String := Ada.Text_IO.Get_Line (CSV_File);
- Comma_Pos : Natural := Ada.Strings.Fixed.Index (Whole_Line, ",");
- begin
- Chars := Chars & Whole_Line (Whole_Line'First .. Comma_Pos - 1);
- Speeches := Speeches & Whole_Line (Comma_Pos + 1 .. Whole_Line'Last);
- end;
- end loop;
-
- Ada.Text_IO.Close (CSV_File);
-
- -- build translation table and output html
- declare
- Translations : constant Templates_Parser.Translate_Table :=
- (1 => Templates_Parser.Assoc ("CHAR", Chars),
- 2 => Templates_Parser.Assoc ("SPEECH", Speeches));
- begin
- Ada.Text_IO.Put_Line
- (Templates_Parser.Parse ("table.tmplt", Translations));
- end;
-end Csv2Html;
diff --git a/Task/CSV-to-HTML-translation/Ada/csv-to-html-translation-2.ada b/Task/CSV-to-HTML-translation/Ada/csv-to-html-translation-2.ada
deleted file mode 100644
index 4126ce0394..0000000000
--- a/Task/CSV-to-HTML-translation/Ada/csv-to-html-translation-2.ada
+++ /dev/null
@@ -1,8 +0,0 @@
-
-@@TABLE@@
-
- @_WEB_ESCAPE:CHAR_@
- @_WEB_ESCAPE:SPEECH_@
-
-@@END_TABLE@@
-
diff --git a/Task/CSV-to-HTML-translation/Ada/csv-to-html-translation-3.ada b/Task/CSV-to-HTML-translation/Ada/csv-to-html-translation-3.ada
deleted file mode 100644
index 4238d95db6..0000000000
--- a/Task/CSV-to-HTML-translation/Ada/csv-to-html-translation-3.ada
+++ /dev/null
@@ -1,26 +0,0 @@
-
-
- Character
- Speech
-
-
- The multitude
- The messiah! Show us the messiah!
-
-
- Brians mother
- <angry>Now you listen here! He's not the messiah; he's a very naughty boy! Now go away!</angry>
-
-
- The multitude
- Who are you?
-
-
- Brians mother
- I'm his mother; that's who!
-
-
- The multitude
- Behold his mother! Behold his mother!
-
-
diff --git a/Task/CSV-to-HTML-translation/AutoIt/csv-to-html-translation.autoit b/Task/CSV-to-HTML-translation/AutoIt/csv-to-html-translation.autoit
deleted file mode 100644
index a7f613cb1e..0000000000
--- a/Task/CSV-to-HTML-translation/AutoIt/csv-to-html-translation.autoit
+++ /dev/null
@@ -1,28 +0,0 @@
- Local $ascarray[4] = [34,38,60,62]
- $String = "Character,Speech" & @CRLF
- $String &= "The multitude,The messiah! Show us the messiah!" & @CRLF
- $String &= "Brians mother,Now you listen here! He's not the messiah; he's a very naughty boy! Now go away! " & @CRLF
- $String &= "The multitude,Who are you?" & @CRLF
- $String &= "Brians mother,I'm his mother; that's who!" & @CRLF
- $String &= "The multitude,Behold his mother! Behold his mother!"
- For $i = 0 To UBound($ascarray) -1
- $String = Stringreplace($String, chr($ascarray[$i]), "&#"&$ascarray[$i]&";")
- Next
- $newstring = "" & @CRLF
- $crlfsplit = StringSplit($String, @CRLF, 1)
- For $i = 1 To $crlfsplit[0]
- If $i = 1 Then $newstring &= "" & @CRLF
- $newstring &= "" & @CRLF
- $komsplit = StringSplit($crlfsplit[$i], ",")
- For $k = 1 To $komsplit[0]
- If $i = 1 Then
- $newstring &= "" &$komsplit[$k] & " " & @CRLF
- Else
- $newstring &= "" &$komsplit[$k] & " " & @CRLF
- EndIf
- Next
- $newstring &= " " & @CRLF
- If $i = 1 Then $newstring &= " " & @CRLF
- Next
- $newstring &= "
"
- ConsoleWrite('@@ Debug(' & @ScriptLineNumber & ') : $newstring = ' & $newstring & @crlf & '>Error code: ' & @error & @crlf) ;### Debug Console
diff --git a/Task/CSV-to-HTML-translation/C++/csv-to-html-translation-1.cpp b/Task/CSV-to-HTML-translation/C++/csv-to-html-translation-1.cpp
index aa156642cd..3d37c4ac15 100644
--- a/Task/CSV-to-HTML-translation/C++/csv-to-html-translation-1.cpp
+++ b/Task/CSV-to-HTML-translation/C++/csv-to-html-translation-1.cpp
@@ -7,10 +7,10 @@ std::string csvToHTML( const std::string & ) ;
int main( ) {
std::string text = "Character,Speech\n"
"The multitude,The messiah! Show us the messiah!\n"
- "Brians mother,Now you listen here! He's not the messiah; he's a very naughty boy! Now go away! \n"
- "The multitude,Who are you?\n"
- "Brians mother,I'm his mother; that's who!\n"
- "The multitude,Behold his mother! Behold his mother!\n" ;
+ "Brians mother,Now you listen here! He's not the messiah; he's a very naughty boy! Now go away! \n"
+ "The multitude,Who are you?\n"
+ "Brians mother,I'm his mother; that's who!\n"
+ "The multitude,Behold his mother! Behold his mother!\n" ;
std::cout << csvToHTML( text ) ;
return 0 ;
}
diff --git a/Task/CSV-to-HTML-translation/C-sharp/csv-to-html-translation-4.cs b/Task/CSV-to-HTML-translation/C-sharp/csv-to-html-translation-4.cs
index 57a1a95782..0f5c4a0ec4 100644
--- a/Task/CSV-to-HTML-translation/C-sharp/csv-to-html-translation-4.cs
+++ b/Task/CSV-to-HTML-translation/C-sharp/csv-to-html-translation-4.cs
@@ -1,26 +1,26 @@
-
- Character
- Speech
-
-
- The multitude
- The messiah! Show us the messiah!
-
-
- Brians mother
- <angry>Now you listen here! He's not the messiah; he's a very naughty boy! Now go away!</angry>
-
-
- The multitude
- Who are you?
-
-
- Brians mother
- I'm his mother; that's who!
-
-
- The multitude
- Behold his mother! Behold his mother!
-
+
+ Character
+ Speech
+
+
+ The multitude
+ The messiah! Show us the messiah!
+
+
+ Brians mother
+ <angry>Now you listen here! He's not the messiah; he's a very naughty boy! Now go away!</angry>
+
+
+ The multitude
+ Who are you?
+
+
+ Brians mother
+ I'm his mother; that's who!
+
+
+ The multitude
+ Behold his mother! Behold his mother!
+
diff --git a/Task/CSV-to-HTML-translation/C/csv-to-html-translation-1.c b/Task/CSV-to-HTML-translation/C/csv-to-html-translation-1.c
index 226784fac0..a4931a238c 100644
--- a/Task/CSV-to-HTML-translation/C/csv-to-html-translation-1.c
+++ b/Task/CSV-to-HTML-translation/C/csv-to-html-translation-1.c
@@ -1,29 +1,29 @@
#include
const char *input =
- "Character,Speech\n"
- "The multitude,The messiah! Show us the messiah!\n"
- "Brians mother,Now you listen here! He's not the messiah; "
- "he's a very naughty boy! Now go away! \n"
- "The multitude,Who are you?\n"
- "Brians mother,I'm his mother; that's who!\n"
- "The multitude,Behold his mother! Behold his mother!";
+ "Character,Speech\n"
+ "The multitude,The messiah! Show us the messiah!\n"
+ "Brians mother,Now you listen here! He's not the messiah; "
+ "he's a very naughty boy! Now go away! \n"
+ "The multitude,Who are you?\n"
+ "Brians mother,I'm his mother; that's who!\n"
+ "The multitude,Behold his mother! Behold his mother!";
int main()
{
- const char *s;
- printf("\n");
- for (s = input; *s; s++) {
- switch(*s) {
- case '\n': printf(" "); break;
- case ',': printf(" "); break;
- case '<': printf("<"); break;
- case '>': printf(">"); break;
- case '&': printf("&"); break;
- default: putchar(*s);
- }
- }
- puts("
");
+ const char *s;
+ printf("\n");
+ for (s = input; *s; s++) {
+ switch(*s) {
+ case '\n': printf(" "); break;
+ case ',': printf(" "); break;
+ case '<': printf("<"); break;
+ case '>': printf(">"); break;
+ case '&': printf("&"); break;
+ default: putchar(*s);
+ }
+ }
+ puts("
");
- return 0;
+ return 0;
}
diff --git a/Task/CSV-to-HTML-translation/CoffeeScript/csv-to-html-translation-1.coffee b/Task/CSV-to-HTML-translation/CoffeeScript/csv-to-html-translation-1.coffee
index ed257aadae..3d1193f8f7 100644
--- a/Task/CSV-to-HTML-translation/CoffeeScript/csv-to-html-translation-1.coffee
+++ b/Task/CSV-to-HTML-translation/CoffeeScript/csv-to-html-translation-1.coffee
@@ -1,8 +1,8 @@
String::__defineGetter__ 'escaped', () ->
- this.replace(/&/g, '&')
- .replace(//g, '>')
- .replace(/"/g, '"') // rosettacode doesn't like "
+ this.replace(/&/g, '&')
+ .replace(//g, '>')
+ .replace(/"/g, '"') // rosettacode doesn't like "
text = '''
Character,Speech
@@ -19,21 +19,21 @@ header = lines.shift()
console.log """
-
- #{header[0]}
- #{header[1]}
-
-
+
+ #{header[0]}
+ #{header[1]}
+
+
"""
for line in lines
- [character, speech] = line
- console.log """
- #{character}
- #{speech.escaped}
- """
+ [character, speech] = line
+ console.log """
+ #{character}
+ #{speech.escaped}
+ """
console.log """
-
+
- """
+ """
diff --git a/Task/CSV-to-HTML-translation/Common-Lisp/csv-to-html-translation-1.lisp b/Task/CSV-to-HTML-translation/Common-Lisp/csv-to-html-translation-1.lisp
index db8c7f95f8..b61d81aa92 100644
--- a/Task/CSV-to-HTML-translation/Common-Lisp/csv-to-html-translation-1.lisp
+++ b/Task/CSV-to-HTML-translation/Common-Lisp/csv-to-html-translation-1.lisp
@@ -8,9 +8,9 @@ The multitude,Behold his mother! Behold his mother!")
(defun split-string (string delim-char)
(let ((result '()))
(do* ((start 0 (1+ end))
- (end (position delim-char string)
- (position delim-char string :start start)))
- ((not end) (reverse (cons (subseq string start) result)))
+ (end (position delim-char string)
+ (position delim-char string :start start)))
+ ((not end) (reverse (cons (subseq string start) result)))
(push (subseq string start end) result))))
;;; HTML escape code modified from:
@@ -27,27 +27,27 @@ The multitude,Behold his mother! Behold his mother!")
(let ((to-escape "<>&"))
(flet ((needs-escape-p (char) (find char to-escape)))
(with-output-to-string (out)
- (loop for start = 0 then (1+ pos)
- for pos = (position-if #'needs-escape-p in :start start)
- do (write-sequence in out :start start :end pos)
- when pos do (write-sequence (escape-char (char in pos)) out)
- while pos)))))
+ (loop for start = 0 then (1+ pos)
+ for pos = (position-if #'needs-escape-p in :start start)
+ do (write-sequence in out :start start :end pos)
+ when pos do (write-sequence (escape-char (char in pos)) out)
+ while pos)))))
(defun html-row (values headerp)
(let ((tag (if headerp "th" "td")))
(with-output-to-string (out)
(write-string "" out)
(dolist (val values)
- (format out "<~A>~A" tag (escape val) tag))
+ (format out "<~A>~A" tag (escape val) tag))
(write-string " " out))))
(defun csv->html (csv)
(let* ((lines (split-string csv #\Newline))
- (cols (split-string (first lines) #\,))
- (rows (mapcar (lambda (row) (split-string row #\,)) (rest lines))))
+ (cols (split-string (first lines) #\,))
+ (rows (mapcar (lambda (row) (split-string row #\,)) (rest lines))))
(with-output-to-string (html)
(format html "~C" #\Newline)
(format html "~C~A~C" #\Tab (html-row cols t) #\Newline)
(dolist (row rows)
- (format html "~C~A~C" #\Tab (html-row row nil) #\Newline))
+ (format html "~C~A~C" #\Tab (html-row row nil) #\Newline))
(write-string "
" html))))
diff --git a/Task/CSV-to-HTML-translation/Common-Lisp/csv-to-html-translation-2.lisp b/Task/CSV-to-HTML-translation/Common-Lisp/csv-to-html-translation-2.lisp
index 66cb3587a8..06570481c8 100644
--- a/Task/CSV-to-HTML-translation/Common-Lisp/csv-to-html-translation-2.lisp
+++ b/Task/CSV-to-HTML-translation/Common-Lisp/csv-to-html-translation-2.lisp
@@ -1,8 +1,8 @@
- Character Speech The multitude The messiah! Show us the messiah! Brians mother <angry>Now you listen here! He's not the messiah; he's a very naughty boy! Now go away!</angry> The multitude Who are you? Brians mother I'm his mother; that's who! The multitude Behold his mother! Behold his mother! Character Speech The multitude The messiah! Show us the messiah! Brians mother <angry>Now you listen here! He's not the messiah; he's a very naughty boy! Now go away!</angry> The multitude Who are you? Brians mother I'm his mother; that's who! The multitude Behold his mother! Behold his mother!
diff --git a/Task/CSV-to-HTML-translation/EchoLisp/csv-to-html-translation-1.l b/Task/CSV-to-HTML-translation/EchoLisp/csv-to-html-translation-1.l
index a7a16c05df..d19889b08f 100644
--- a/Task/CSV-to-HTML-translation/EchoLisp/csv-to-html-translation-1.l
+++ b/Task/CSV-to-HTML-translation/EchoLisp/csv-to-html-translation-1.l
@@ -5,25 +5,25 @@
;; LISTS->HTML
(define html 'html)
(define (emit-tag tag html-proc content )
- (if (style tag)
- (push html (format "<%s style='%a'>" tag (style tag)))
- (push html (format "<%s>" tag )))
- (html-proc content)
- (push html (format " " tag )))
-
+ (if (style tag)
+ (push html (format "<%s style='%a'>" tag (style tag)))
+ (push html (format "<%s>" tag )))
+ (html-proc content)
+ (push html (format " " tag )))
+
;; html procs : 1 tag, 1 proc
(define (h-raw content)
- (push html (format "%s" content)))
+ (push html (format "%s" content)))
(define (h-header headers)
- (for ((h headers)) (emit-tag 'th h-raw h)))
+ (for ((h headers)) (emit-tag 'th h-raw h)))
(define (h-row row)
- (for ((item row)) (emit-tag 'td h-raw item)))
+ (for ((item row)) (emit-tag 'td h-raw item)))
(define (h-table table )
- (emit-tag 'tr h-header (first table))
- (for ((row (rest table))) (emit-tag 'tr h-row row)))
-
+ (emit-tag 'tr h-header (first table))
+ (for ((row (rest table))) (emit-tag 'tr h-row row)))
+
(define (html-dump) (string-join (stack->list html) " "))
-
+
;; STYLES
(style 'td "text-align:left")
(style 'table "border-spacing: 10px;border:28px ridge orange") ;; special biblical border
diff --git a/Task/CSV-to-HTML-translation/EchoLisp/csv-to-html-translation-2.l b/Task/CSV-to-HTML-translation/EchoLisp/csv-to-html-translation-2.l
index 777daf9665..72ca8f6071 100644
--- a/Task/CSV-to-HTML-translation/EchoLisp/csv-to-html-translation-2.l
+++ b/Task/CSV-to-HTML-translation/EchoLisp/csv-to-html-translation-2.l
@@ -9,9 +9,9 @@
>>#)
(define (task speech)
- (define table (csv->table speech))
- (stack html)
- (emit-tag 'table h-table table)
- (html-dump))
-
+ (define table (csv->table speech))
+ (stack html)
+ (emit-tag 'table h-table table)
+ (html-dump))
+
(task MontyPython)
diff --git a/Task/CSV-to-HTML-translation/Erlang/csv-to-html-translation.erl b/Task/CSV-to-HTML-translation/Erlang/csv-to-html-translation.erl
index b319341dbb..31bfd905e1 100644
--- a/Task/CSV-to-HTML-translation/Erlang/csv-to-html-translation.erl
+++ b/Task/CSV-to-HTML-translation/Erlang/csv-to-html-translation.erl
@@ -3,9 +3,9 @@
-export( [table_translation/1, task/0] ).
table_translation( CSV ) ->
- [Headers | Contents] = [string:tokens(X, ",") || X <- string:tokens( CSV, "\n")],
- Table = create_html_table:html_table( [{border, "1"}, {cellpadding, "10"}], Headers, Contents ),
- create_html_table:external_format( Table ).
+ [Headers | Contents] = [string:tokens(X, ",") || X <- string:tokens( CSV, "\n")],
+ Table = create_html_table:html_table( [{border, "1"}, {cellpadding, "10"}], Headers, Contents ),
+ create_html_table:external_format( Table ).
task() -> table_translation( csv() ).
diff --git a/Task/CSV-to-HTML-translation/Euphoria/csv-to-html-translation-1.ex b/Task/CSV-to-HTML-translation/Euphoria/csv-to-html-translation-1.ex
deleted file mode 100644
index 6ab63d1683..0000000000
--- a/Task/CSV-to-HTML-translation/Euphoria/csv-to-html-translation-1.ex
+++ /dev/null
@@ -1,20 +0,0 @@
-constant input = "Character,Speech\n" &
- "The multitude,The messiah! Show us the messiah!\n" &
- "Brians mother,Now you listen here! He's not the messiah; " &
- "he's a very naughty boy! Now go away! \n" &
- "The multitude,Who are you?\n" &
- "Brians mother,I'm his mother; that's who!\n" &
- "The multitude,Behold his mother! Behold his mother!"
-
-puts(1,"\n")
-for i = 1 to length(input) do
- switch input[i] do
- case '\n' then puts(1," ")
- case ',' then puts(1," ")
- case '<' then puts(1,"<")
- case '>' then puts(1,">")
- case '&' then puts(1,"&")
- case else puts(1,input[i])
- end switch
-end for
-puts(1,"
")
diff --git a/Task/CSV-to-HTML-translation/Euphoria/csv-to-html-translation-2.ex b/Task/CSV-to-HTML-translation/Euphoria/csv-to-html-translation-2.ex
deleted file mode 100644
index 0964db10ff..0000000000
--- a/Task/CSV-to-HTML-translation/Euphoria/csv-to-html-translation-2.ex
+++ /dev/null
@@ -1,8 +0,0 @@
-
-Character Speech The multitude The messiah! Show us the messiah! Brians mother <angry>Now you listen here! He's not the messiah; he's a very naughty boy! Now go away!</angry> The multitude Who are you? Brians mother I'm his mother; that's who! The multitude Behold his mother! Behold his mother!
diff --git a/Task/CSV-to-HTML-translation/Forth/csv-to-html-translation-1.fth b/Task/CSV-to-HTML-translation/Forth/csv-to-html-translation-1.fth
index b59459c399..9bf8d4b906 100644
--- a/Task/CSV-to-HTML-translation/Forth/csv-to-html-translation-1.fth
+++ b/Task/CSV-to-HTML-translation/Forth/csv-to-html-translation-1.fth
@@ -5,18 +5,18 @@
: END-ROW END-COLUMN ." " CR ;
: CSV2HTML
- ." " CR BEGIN-ROW
- BEGIN KEY DUP #EOF <> WHILE
- CASE
- 10 OF END-ROW BEGIN-ROW ENDOF
- [CHAR] , OF END-COLUMN BEGIN-COLUMN ENDOF
- [CHAR] < OF ." <" ENDOF
- [CHAR] > OF ." >" ENDOF
- [CHAR] & OF ." &" ENDOF
- DUP EMIT
- ENDCASE
- REPEAT
- END-ROW ."
" CR
+ ." " CR BEGIN-ROW
+ BEGIN KEY DUP #EOF <> WHILE
+ CASE
+ 10 OF END-ROW BEGIN-ROW ENDOF
+ [CHAR] , OF END-COLUMN BEGIN-COLUMN ENDOF
+ [CHAR] < OF ." <" ENDOF
+ [CHAR] > OF ." >" ENDOF
+ [CHAR] & OF ." &" ENDOF
+ DUP EMIT
+ ENDCASE
+ REPEAT
+ END-ROW ."
" CR
;
CSV2HTML BYE
diff --git a/Task/CSV-to-HTML-translation/Fortran/csv-to-html-translation.f b/Task/CSV-to-HTML-translation/Fortran/csv-to-html-translation.f
index 73683283d8..99aae70f36 100644
--- a/Task/CSV-to-HTML-translation/Fortran/csv-to-html-translation.f
+++ b/Task/CSV-to-HTML-translation/Fortran/csv-to-html-translation.f
@@ -1,71 +1,71 @@
- SUBROUTINE CSVTEXT2HTML(FNAME,HEADED) !Does not recognise quoted strings.
+ SUBROUTINE CSVTEXT2HTML(FNAME,HEADED) !Does not recognise quoted strings.
Converts without checking field counts, or noting special characters.
- CHARACTER*(*) FNAME !Names the input file.
- LOGICAL HEADED !Perhaps its first line is to be a heading.
- INTEGER MANY !How long is a piece of string?
- PARAMETER (MANY=666) !This should suffice.
- CHARACTER*(MANY) ALINE !A scratchpad for the input.
- INTEGER MARK(0:MANY + 1) !Fingers the commas on a line.
- INTEGER I,L,N !Assistants.
- CHARACTER*2 WOT(2) !I don't see why a "table datum" could not be for either.
- PARAMETER (WOT = (/"th","td"/)) !A table heding or a table datum
- INTEGER IT !But, one must select appropriately.
- INTEGER KBD,MSG,IN !A selection.
- COMMON /IOUNITS/ KBD,MSG,IN !The caller thus avoids collisions.
- OPEN(IN,FILE=FNAME,STATUS="OLD",ACTION="READ",ERR=661) !Go for the file.
- WRITE (MSG,1) !Start the blather.
- 1 FORMAT ("") !By stating that a table follows.
- MARK(0) = 0 !Syncopation for the comma fingers.
- N = 0 !No records read.
+ CHARACTER*(*) FNAME !Names the input file.
+ LOGICAL HEADED !Perhaps its first line is to be a heading.
+ INTEGER MANY !How long is a piece of string?
+ PARAMETER (MANY=666) !This should suffice.
+ CHARACTER*(MANY) ALINE !A scratchpad for the input.
+ INTEGER MARK(0:MANY + 1) !Fingers the commas on a line.
+ INTEGER I,L,N !Assistants.
+ CHARACTER*2 WOT(2) !I don't see why a "table datum" could not be for either.
+ PARAMETER (WOT = (/"th","td"/)) !A table heding or a table datum
+ INTEGER IT !But, one must select appropriately.
+ INTEGER KBD,MSG,IN !A selection.
+ COMMON /IOUNITS/ KBD,MSG,IN !The caller thus avoids collisions.
+ OPEN(IN,FILE=FNAME,STATUS="OLD",ACTION="READ",ERR=661) !Go for the file.
+ WRITE (MSG,1) !Start the blather.
+ 1 FORMAT ("") !By stating that a table follows.
+ MARK(0) = 0 !Syncopation for the comma fingers.
+ N = 0 !No records read.
- 10 READ (IN,11,END = 20) L,ALINE(1:MIN(L,MANY)) !Carefully acquire some text.
- 11 FORMAT (Q,A) !Q = number of characters yet to read, A = characters.
- N = N + 1 !So, a record has been read.
- IF (L.GT.MANY) THEN !Perhaps it is rather long?
- WRITE (MSG,12) N,L,MANY !Alas!
- 12 FORMAT ("Line ",I0," has length ",I0,"! My limit is ",I0) !Squawk/
- L = MANY !The limit actually read.
- END IF !So much for paranoia.
- IF (N.EQ.1 .AND. HEADED) THEN !Is the first line to be treated specially?
- WRITE (MSG,*) "" !Yep. Nominate a heading.
- IT = 1 !And select "th" rather than "td".
- ELSE !But mostly,
- IT = 2 !Just another row for the table.
- END IF !So much for the first line.
- NCOLS = 0 !No commas have been seen.
- DO I = 1,L !So scan the text for them.
- IF (ICHAR(ALINE(I:I)).EQ.ICHAR(",")) THEN !Here?
- NCOLS = NCOLS + 1 !Yes!
- MARK(NCOLS) = I !The texts are between commas.
- END IF !So much for that character.
- END DO !On to the next.
- NCOLS = NCOLS + 1 !This is why the + 1 for the size of MARK.
- MARK(NCOLS) = L + 1 !End-of-line is as if a comma was one further along.
- WRITE (MSG,13) !Now roll all the texts.
- 1 (WOT(IT), !This starting a cell,
- 2 ALINE(MARK(I - 1) + 1:MARK(I) - 1), !This being the text between the commas,
- 3 WOT(IT), !And this ending each cell.
- 4 I = 1,NCOLS), !For this number of columns.
- 5 "/tr" !And this ends the row.
- 13 FORMAT (" ",666("<",A,">",A,"")) !How long is a piece of string?
- IF (N.EQ.1 .AND. HEADED) WRITE (MSG,*) " " !Finish the possible header.
- GO TO 10 !And try for another record.
+ 10 READ (IN,11,END = 20) L,ALINE(1:MIN(L,MANY)) !Carefully acquire some text.
+ 11 FORMAT (Q,A) !Q = number of characters yet to read, A = characters.
+ N = N + 1 !So, a record has been read.
+ IF (L.GT.MANY) THEN !Perhaps it is rather long?
+ WRITE (MSG,12) N,L,MANY !Alas!
+ 12 FORMAT ("Line ",I0," has length ",I0,"! My limit is ",I0) !Squawk/
+ L = MANY !The limit actually read.
+ END IF !So much for paranoia.
+ IF (N.EQ.1 .AND. HEADED) THEN !Is the first line to be treated specially?
+ WRITE (MSG,*) "" !Yep. Nominate a heading.
+ IT = 1 !And select "th" rather than "td".
+ ELSE !But mostly,
+ IT = 2 !Just another row for the table.
+ END IF !So much for the first line.
+ NCOLS = 0 !No commas have been seen.
+ DO I = 1,L !So scan the text for them.
+ IF (ICHAR(ALINE(I:I)).EQ.ICHAR(",")) THEN !Here?
+ NCOLS = NCOLS + 1 !Yes!
+ MARK(NCOLS) = I !The texts are between commas.
+ END IF !So much for that character.
+ END DO !On to the next.
+ NCOLS = NCOLS + 1 !This is why the + 1 for the size of MARK.
+ MARK(NCOLS) = L + 1 !End-of-line is as if a comma was one further along.
+ WRITE (MSG,13) !Now roll all the texts.
+ 1 (WOT(IT), !This starting a cell,
+ 2 ALINE(MARK(I - 1) + 1:MARK(I) - 1), !This being the text between the commas,
+ 3 WOT(IT), !And this ending each cell.
+ 4 I = 1,NCOLS), !For this number of columns.
+ 5 "/tr" !And this ends the row.
+ 13 FORMAT (" ",666("<",A,">",A,"")) !How long is a piece of string?
+ IF (N.EQ.1 .AND. HEADED) WRITE (MSG,*) " " !Finish the possible header.
+ GO TO 10 !And try for another record.
- 20 CLOSE (IN) !Finished with input.
- WRITE (MSG,21) !And finished with output.
- 21 FORMAT ("
") !This writes starting at column one.
- RETURN !Done!
+ 20 CLOSE (IN) !Finished with input.
+ WRITE (MSG,21) !And finished with output.
+ 21 FORMAT ("
") !This writes starting at column one.
+ RETURN !Done!
Confusions.
- 661 WRITE (MSG,*) "Can't open file ",FNAME !Alas.
- END !So much for the conversion.
+ 661 WRITE (MSG,*) "Can't open file ",FNAME !Alas.
+ END !So much for the conversion.
INTEGER KBD,MSG,IN
COMMON /IOUNITS/ KBD,MSG,IN
- KBD = 5 !Standard input.
- MSG = 6 !Standard output.
- IN = 10 !Some unspecial number.
+ KBD = 5 !Standard input.
+ MSG = 6 !Standard output.
+ IN = 10 !Some unspecial number.
- CALL CSVTEXT2HTML("Text.csv",.FALSE.) !The first line is not special.
+ CALL CSVTEXT2HTML("Text.csv",.FALSE.) !The first line is not special.
WRITE (MSG,*)
- CALL CSVTEXT2HTML("Text.csv",.TRUE.) !The first line is a heading.
+ CALL CSVTEXT2HTML("Text.csv",.TRUE.) !The first line is a heading.
END
diff --git a/Task/CSV-to-HTML-translation/Haskell/csv-to-html-translation-2.hs b/Task/CSV-to-HTML-translation/Haskell/csv-to-html-translation-2.hs
index e1a1189b39..19062de634 100644
--- a/Task/CSV-to-HTML-translation/Haskell/csv-to-html-translation-2.hs
+++ b/Task/CSV-to-HTML-translation/Haskell/csv-to-html-translation-2.hs
@@ -6,6 +6,6 @@ main = interact (\csv -> "\n" ++
(unlines $ map ((\cols -> "\n" ++
(concatMap (\x -> " " ++ concatMap (\c ->
case c of {'<' -> "<"; '>' -> ">";
- '&' -> "&"; '"' -> """; _ -> [c]}) x
+ '&' -> "&"; '"' -> """; _ -> [c]}) x
++ " \n") cols)
++ " ") . split (==',')) $ lines csv) ++ "
")
diff --git a/Task/CSV-to-HTML-translation/Java/csv-to-html-translation-2.java b/Task/CSV-to-HTML-translation/Java/csv-to-html-translation-2.java
index 348dee6b96..854a68e627 100644
--- a/Task/CSV-to-HTML-translation/Java/csv-to-html-translation-2.java
+++ b/Task/CSV-to-HTML-translation/Java/csv-to-html-translation-2.java
@@ -4,83 +4,83 @@ import java.io.PrintStream;
class Csv2Html {
- public static String escapeChars(String lineIn) {
- StringBuilder sb = new StringBuilder();
- int lineLength = lineIn.length();
- for (int i = 0; i < lineLength; i++) {
- char c = lineIn.charAt(i);
- switch (c) {
- case '"':
- sb.append(""");
- break;
- case '&':
- sb.append("&");
- break;
- case '\'':
- sb.append("'");
- break;
- case '<':
- sb.append("<");
- break;
- case '>':
- sb.append(">");
- break;
- default: sb.append(c);
- }
- }
- return sb.toString();
- }
+ public static String escapeChars(String lineIn) {
+ StringBuilder sb = new StringBuilder();
+ int lineLength = lineIn.length();
+ for (int i = 0; i < lineLength; i++) {
+ char c = lineIn.charAt(i);
+ switch (c) {
+ case '"':
+ sb.append(""");
+ break;
+ case '&':
+ sb.append("&");
+ break;
+ case '\'':
+ sb.append("'");
+ break;
+ case '<':
+ sb.append("<");
+ break;
+ case '>':
+ sb.append(">");
+ break;
+ default: sb.append(c);
+ }
+ }
+ return sb.toString();
+ }
- public static void tableHeader(PrintStream ps, String[] columns) {
- ps.print("");
- for (int i = 0; i < columns.length; i++) {
- ps.print("");
- ps.print(columns[i]);
- ps.print(" ");
- }
- ps.println(" ");
- }
-
- public static void tableRow(PrintStream ps, String[] columns) {
- ps.print("");
- for (int i = 0; i < columns.length; i++) {
- ps.print("");
- ps.print(columns[i]);
- ps.print(" ");
- }
- ps.println(" ");
- }
-
- public static void main(String[] args) throws Exception {
- boolean withTableHeader = (args.length != 0);
-
- InputStreamReader isr = new InputStreamReader(System.in);
- BufferedReader br = new BufferedReader(isr);
- PrintStream stdout = System.out;
-
- stdout.println("");
- stdout.println("");
- stdout.println("Csv2Html ");
- stdout.println("");
- stdout.println("Csv2Html ");
+ public static void tableHeader(PrintStream ps, String[] columns) {
+ ps.print("");
+ for (int i = 0; i < columns.length; i++) {
+ ps.print("");
+ ps.print(columns[i]);
+ ps.print(" ");
+ }
+ ps.println(" ");
+ }
- stdout.println("");
- String stdinLine;
- boolean firstLine = true;
- while ((stdinLine = br.readLine()) != null) {
- String[] columns = escapeChars(stdinLine).split(",");
- if (withTableHeader == true && firstLine == true) {
- tableHeader(stdout, columns);
- firstLine = false;
- } else {
- tableRow(stdout, columns);
- }
- }
- stdout.println("
");
- }
+ public static void tableRow(PrintStream ps, String[] columns) {
+ ps.print("");
+ for (int i = 0; i < columns.length; i++) {
+ ps.print("");
+ ps.print(columns[i]);
+ ps.print(" ");
+ }
+ ps.println(" ");
+ }
+
+ public static void main(String[] args) throws Exception {
+ boolean withTableHeader = (args.length != 0);
+
+ InputStreamReader isr = new InputStreamReader(System.in);
+ BufferedReader br = new BufferedReader(isr);
+ PrintStream stdout = System.out;
+
+ stdout.println("");
+ stdout.println("");
+ stdout.println("Csv2Html ");
+ stdout.println("");
+ stdout.println("Csv2Html ");
+
+ stdout.println("");
+ String stdinLine;
+ boolean firstLine = true;
+ while ((stdinLine = br.readLine()) != null) {
+ String[] columns = escapeChars(stdinLine).split(",");
+ if (withTableHeader == true && firstLine == true) {
+ tableHeader(stdout, columns);
+ firstLine = false;
+ } else {
+ tableRow(stdout, columns);
+ }
+ }
+ stdout.println("
");
+ }
}
diff --git a/Task/CSV-to-HTML-translation/JavaScript/csv-to-html-translation-1.js b/Task/CSV-to-HTML-translation/JavaScript/csv-to-html-translation-1.js
index 216911471c..c3c985804f 100644
--- a/Task/CSV-to-HTML-translation/JavaScript/csv-to-html-translation-1.js
+++ b/Task/CSV-to-HTML-translation/JavaScript/csv-to-html-translation-1.js
@@ -1,9 +1,9 @@
var csv = "Character,Speech\n" +
- "The multitude,The messiah! Show us the messiah!\n" +
- "Brians mother,Now you listen here! He's not the messiah; he's a very naughty boy! Now go away! \n" +
- "The multitude,Who are you?\n" +
- "Brians mother,I'm his mother; that's who!\n" +
- "The multitude,Behold his mother! Behold his mother!";
+ "The multitude,The messiah! Show us the messiah!\n" +
+ "Brians mother,Now you listen here! He's not the messiah; he's a very naughty boy! Now go away! \n" +
+ "The multitude,Who are you?\n" +
+ "Brians mother,I'm his mother; that's who!\n" +
+ "The multitude,Behold his mother! Behold his mother!";
var lines = csv.replace(/&/g, '&')
.replace(/
-
- Character Speech
-
- The multitude The messiah! Show us the messiah! Brians mother <angry>Now you listen here! He's not the messiah; he's a very naughty boy! Now go away!</angry> The multitude Who are you? Brians mother I'm his mother; that's who! The multitude Behold his mother! Behold his mother!
+
+ Character Speech
+
+ The multitude The messiah! Show us the messiah! Brians mother <angry>Now you listen here! He's not the messiah; he's a very naughty boy! Now go away!</angry> The multitude Who are you? Brians mother I'm his mother; that's who! The multitude Behold his mother! Behold his mother!
diff --git a/Task/CSV-to-HTML-translation/M2000-Interpreter/csv-to-html-translation.m2000 b/Task/CSV-to-HTML-translation/M2000-Interpreter/csv-to-html-translation.m2000
index af515e282b..446db07183 100644
--- a/Task/CSV-to-HTML-translation/M2000-Interpreter/csv-to-html-translation.m2000
+++ b/Task/CSV-to-HTML-translation/M2000-Interpreter/csv-to-html-translation.m2000
@@ -1,72 +1,72 @@
module csv2html {
- nl$={
- }
- Repl$=lambda$ (a$) ->{
- a$=replace$("&", "&",a$)
- a$=replace$(">", ">",a$)
- a$=replace$("""", """,a$)
- // add any other replacement here
- =replace$("<", "<",a$)
- }
- Tag$=lambda$ nl$, repl$ (a$, b$, n=4)->{
- if n>0 then
- a$=rtrim$(replace$(nl$, nl$+string$(" ", n), nl$+a$))
- if right$(a$,2)<>nl$ then a$+=nl$
- else
- if right$(a$, 2)=nl$ then if left$(a$,2)<>nl$ then a$=nl$+a$
- end if
- prop=(,) : Read ? prop // forth parameter optional (we have to initalize first with an empty array)
- p=each(prop) : prop$="" // p is an iteration object.
- while p
- prop$+=" "+repl$(prop#val$(p^))+"="+quote$(repl$(prop#val$(p^+1)))
- p=each(prop,p^+2) // start new from p^+2 (p^ is the internal counter)
- end while
- ="<"+b$+prop$+">"+a$+""+nl$
- }
-
- // Prepare FILE csv
- tofile$={Character,Speech
- The multitude,The messiah! Show us the messiah!
- Brians mother,Now you listen here! He's not the messiah; he's a very naughty boy! Now go away!
- The multitude,Who are you?
- Brians mother,I'm his mother; that's who!
- The multitude,Behold his mother! Behold his mother!
- }
- open "forHtml.csv" for wide output as #f
- Print #f, tofile$;
- close #f
- // prepare the input style for Input from file statement
- // "," - we use comma between fields
- // "." - for numbers we use dot for decimal separator
- // false - we didn't read json style strings to normal strings (so \n convert to code 13, \t to code 9)
- // true - we read strings unquote
- input with ",",".",false, true
-
- // Read csv file
- i=1
- document export$=""
- Open "forHtml.csv" for wide input as #f
- while not eof(#f)
- input #f, a$, b$
- a$=repl$(a$)
- b$=repl$(b$)
- if i=1 then
- export$+=tag$(tag$(a$, "th", 0)+tag$(b$,"th", 0), "tr", 4)
- else
- export$+=tag$(tag$(a$, "td", 0)+tag$(b$,"td", 0), "tr", 4)
- end if
- i++
- end while
- close #f
- style$=tag$({TD {background-color:#ddddff; }
- thead TD {background-color:#ddffdd; text-align:center; }
- },"style",4,("type", "text/css"))
- title$= tag$("CSV to HTML translation - Extra Credit","title",0)
- Head$= tag$(title$+ style$,"head")
- html$={}+nl$+tag$(head$+tag$(tag$(export$, "table"), "body"), "html")
- clipboard html$
- Report html$
- Print "Press Esc to exit browser"
- browser "about: "+html$
+ nl$={
+ }
+ Repl$=lambda$ (a$) ->{
+ a$=replace$("&", "&",a$)
+ a$=replace$(">", ">",a$)
+ a$=replace$("""", """,a$)
+ // add any other replacement here
+ =replace$("<", "<",a$)
+ }
+ Tag$=lambda$ nl$, repl$ (a$, b$, n=4)->{
+ if n>0 then
+ a$=rtrim$(replace$(nl$, nl$+string$(" ", n), nl$+a$))
+ if right$(a$,2)<>nl$ then a$+=nl$
+ else
+ if right$(a$, 2)=nl$ then if left$(a$,2)<>nl$ then a$=nl$+a$
+ end if
+ prop=(,) : Read ? prop // forth parameter optional (we have to initalize first with an empty array)
+ p=each(prop) : prop$="" // p is an iteration object.
+ while p
+ prop$+=" "+repl$(prop#val$(p^))+"="+quote$(repl$(prop#val$(p^+1)))
+ p=each(prop,p^+2) // start new from p^+2 (p^ is the internal counter)
+ end while
+ ="<"+b$+prop$+">"+a$+""+nl$
+ }
+
+ // Prepare FILE csv
+ tofile$={Character,Speech
+ The multitude,The messiah! Show us the messiah!
+ Brians mother,Now you listen here! He's not the messiah; he's a very naughty boy! Now go away!
+ The multitude,Who are you?
+ Brians mother,I'm his mother; that's who!
+ The multitude,Behold his mother! Behold his mother!
+ }
+ open "forHtml.csv" for wide output as #f
+ Print #f, tofile$;
+ close #f
+ // prepare the input style for Input from file statement
+ // "," - we use comma between fields
+ // "." - for numbers we use dot for decimal separator
+ // false - we didn't read json style strings to normal strings (so \n convert to code 13, \t to code 9)
+ // true - we read strings unquote
+ input with ",",".",false, true
+
+ // Read csv file
+ i=1
+ document export$=""
+ Open "forHtml.csv" for wide input as #f
+ while not eof(#f)
+ input #f, a$, b$
+ a$=repl$(a$)
+ b$=repl$(b$)
+ if i=1 then
+ export$+=tag$(tag$(a$, "th", 0)+tag$(b$,"th", 0), "tr", 4)
+ else
+ export$+=tag$(tag$(a$, "td", 0)+tag$(b$,"td", 0), "tr", 4)
+ end if
+ i++
+ end while
+ close #f
+ style$=tag$({TD {background-color:#ddddff; }
+ thead TD {background-color:#ddffdd; text-align:center; }
+ },"style",4,("type", "text/css"))
+ title$= tag$("CSV to HTML translation - Extra Credit","title",0)
+ Head$= tag$(title$+ style$,"head")
+ html$={}+nl$+tag$(head$+tag$(tag$(export$, "table"), "body"), "html")
+ clipboard html$
+ Report html$
+ Print "Press Esc to exit browser"
+ browser "about: "+html$
}
csv2html
diff --git a/Task/CSV-to-HTML-translation/MATLAB/csv-to-html-translation-3.m b/Task/CSV-to-HTML-translation/MATLAB/csv-to-html-translation-3.m
index fc8d987cac..26001f6ada 100644
--- a/Task/CSV-to-HTML-translation/MATLAB/csv-to-html-translation-3.m
+++ b/Task/CSV-to-HTML-translation/MATLAB/csv-to-html-translation-3.m
@@ -1,25 +1,25 @@
-
- Character
- Speech
-
- The multitude
- The messiah! Show us the messiah!
-
-
- Brians mother
- <angry>Now you listen here! He's not the messiah; he's a very naughty boy! Now go away!</angry>
-
-
- The multitude
- Who are you?
-
-
- Brians mother
- I'm his mother; that's who!
-
-
- The multitude
- Behold his mother! Behold his mother!
-
+
+ Character
+ Speech
+
+ The multitude
+ The messiah! Show us the messiah!
+
+
+ Brians mother
+ <angry>Now you listen here! He's not the messiah; he's a very naughty boy! Now go away!</angry>
+
+
+ The multitude
+ Who are you?
+
+
+ Brians mother
+ I'm his mother; that's who!
+
+
+ The multitude
+ Behold his mother! Behold his mother!
+
diff --git a/Task/CSV-to-HTML-translation/Maple/csv-to-html-translation.maple b/Task/CSV-to-HTML-translation/Maple/csv-to-html-translation.maple
index 5b6d65d7eb..0203f01f0d 100644
--- a/Task/CSV-to-HTML-translation/Maple/csv-to-html-translation.maple
+++ b/Task/CSV-to-HTML-translation/Maple/csv-to-html-translation.maple
@@ -1,10 +1,10 @@
#A translation of the C code posted
html_table := proc(str)
- local char;
+ local char;
printf("\n");
for char in str do
if char = "\n" then
- printf(" ")
+ printf(" ")
elif char = "," then
printf(" ")
elif char = "<" then
@@ -12,7 +12,7 @@ html_table := proc(str)
elif char = ">" then
printf(">")
elif char = "&" then
- printf("&")
+ printf("&")
else
printf(char)
end if;
diff --git a/Task/CSV-to-HTML-translation/Nanoquery/csv-to-html-translation.nanoquery b/Task/CSV-to-HTML-translation/Nanoquery/csv-to-html-translation.nanoquery
index 1421fc83b6..7af517fddc 100644
--- a/Task/CSV-to-HTML-translation/Nanoquery/csv-to-html-translation.nanoquery
+++ b/Task/CSV-to-HTML-translation/Nanoquery/csv-to-html-translation.nanoquery
@@ -1,13 +1,13 @@
// a method that converts a csv row into a html table row as a string
def toHtmlRow(record, tag)
- htmlrow = "\t \n"
+ htmlrow = "\t \n"
- // loop through the values in the current csv row
- for i in range(1, len(record))
- htmlrow = htmlrow + "\t\t<" + tag + ">" + (record ~ i) + "\n"
- end for
+ // loop through the values in the current csv row
+ for i in range(1, len(record))
+ htmlrow = htmlrow + "\t\t<" + tag + ">" + (record ~ i) + "\n"
+ end for
- return htmlrow + "\t \n"
+ return htmlrow + "\t\n"
end def
// get the name of the csv file then open it
@@ -23,7 +23,7 @@ htmltable = (htmltable + toHtmlRow(#0, "th"))
// add all other rows to the table
for i in range(1, $dbsize)
- htmltable = (htmltable + toHtmlRow(#i, "td"))
+ htmltable = (htmltable + toHtmlRow(#i, "td"))
end for
// close the html table
diff --git a/Task/CSV-to-HTML-translation/OpenEdge-Progress/csv-to-html-translation-2.openedge b/Task/CSV-to-HTML-translation/OpenEdge-Progress/csv-to-html-translation-2.openedge
index 0a1dc0c135..5d586a5912 100644
--- a/Task/CSV-to-HTML-translation/OpenEdge-Progress/csv-to-html-translation-2.openedge
+++ b/Task/CSV-to-HTML-translation/OpenEdge-Progress/csv-to-html-translation-2.openedge
@@ -1,28 +1,28 @@
-
-
- Character
- Speech
-
-
- The multitude
- The messiah! Show us the messiah!
-
-
- Brians mother
- <angry>Now you listen here! He's not the messiah; he's a very naughty boy! Now go away!</angry>
-
-
- The multitude
- Who are you?
-
-
- Brians mother
- I'm his mother; that's who!
-
-
- The multitude
- Behold his mother! Behold his mother!
-
-
+
+
+ Character
+ Speech
+
+
+ The multitude
+ The messiah! Show us the messiah!
+
+
+ Brians mother
+ <angry>Now you listen here! He's not the messiah; he's a very naughty boy! Now go away!</angry>
+
+
+ The multitude
+ Who are you?
+
+
+ Brians mother
+ I'm his mother; that's who!
+
+
+ The multitude
+ Behold his mother! Behold his mother!
+
+
diff --git a/Task/CSV-to-HTML-translation/PowerShell/csv-to-html-translation-1.psh b/Task/CSV-to-HTML-translation/PowerShell/csv-to-html-translation-1.psh
deleted file mode 100644
index 41bdd3067e..0000000000
--- a/Task/CSV-to-HTML-translation/PowerShell/csv-to-html-translation-1.psh
+++ /dev/null
@@ -1 +0,0 @@
-Import-Csv -Path .\csv_html_test.csv | ConvertTo-Html -Fragment | Out-File .\csv_html_test.html
diff --git a/Task/CSV-to-HTML-translation/PowerShell/csv-to-html-translation-2.psh b/Task/CSV-to-HTML-translation/PowerShell/csv-to-html-translation-2.psh
deleted file mode 100644
index 30d5135ea8..0000000000
--- a/Task/CSV-to-HTML-translation/PowerShell/csv-to-html-translation-2.psh
+++ /dev/null
@@ -1,13 +0,0 @@
-
-
-
-Character Speech The multitude The messiah! Show us the messiah! Brians mother <angry>Now you listen here! He's not the messiah; he's a very naughty boy! Now go away!</angry> The multitude Who are you? Brians mother I'm his mother; that's who! The multitude Behold his mother! Behold his mother!
diff --git a/Task/CSV-to-HTML-translation/PowerShell/csv-to-html-translation-3.psh b/Task/CSV-to-HTML-translation/PowerShell/csv-to-html-translation-3.psh
deleted file mode 100644
index 0d58c33260..0000000000
--- a/Task/CSV-to-HTML-translation/PowerShell/csv-to-html-translation-3.psh
+++ /dev/null
@@ -1,9 +0,0 @@
-$htmlformat = 'Csv to Html '
-$htmlformat += ''
-Import-Csv -Path .\csv_html_test.csv | ConvertTo-Html -Head $htmlformat -Body 'Csv to Html ' | Out-File .\csv_html_test.html
-Invoke-Expression .\csv_html_test.html
diff --git a/Task/CSV-to-HTML-translation/PowerShell/csv-to-html-translation-4.psh b/Task/CSV-to-HTML-translation/PowerShell/csv-to-html-translation-4.psh
deleted file mode 100644
index 0eae705991..0000000000
--- a/Task/CSV-to-HTML-translation/PowerShell/csv-to-html-translation-4.psh
+++ /dev/null
@@ -1,21 +0,0 @@
-
-
-
-Csv to Html
-
-Csv to Html
-
-
-
-Character Speech The multitude The messiah! Show us the messiah! Brians mother <angry>Now you listen here! He's not the messiah; he's a very naughty boy! Now go away!</angry> The multitude Who are you? Brians mother I'm his mother; that's who! The multitude Behold his mother! Behold his mother!
-
diff --git a/Task/CSV-to-HTML-translation/Prolog/csv-to-html-translation-1.pro b/Task/CSV-to-HTML-translation/Prolog/csv-to-html-translation-1.pro
index 06bf8c825f..735abd10f0 100644
--- a/Task/CSV-to-HTML-translation/Prolog/csv-to-html-translation-1.pro
+++ b/Task/CSV-to-HTML-translation/Prolog/csv-to-html-translation-1.pro
@@ -1,52 +1,52 @@
csv_html :-
- L = "Character,Speech
+ L = "Character,Speech
The multitude,The messiah! Show us the messiah!
Brians mother,Now you listen here! He's not the messiah; he's a very naughty boy! Now go away!
The multitude,Who are you?
Brians mother,I'm his mother; that's who!
The multitude,Behold his mother! Behold his mother!",
- csv_html(L, Out, []),
- string_to_list(Str, Out),
- writeln(Str).
+ csv_html(L, Out, []),
+ string_to_list(Str, Out),
+ writeln(Str).
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% simple HTML
%
csv_html(L) -->
- "".
+ "".
csv_tr([]) --> [].
csv_tr(L) -->
- "\n",
- csv_td(L, S),
- "\n \n",
- csv_tr(S).
+ "\n",
+ csv_td(L, S),
+ "\n \n",
+ csv_tr(S).
csv_td(L, S) -->
- "",
- csv_td_in(L, S),
- " ".
+ "",
+ csv_td_in(L, S),
+ " ".
csv_td_in([], []) --> [].
csv_td_in([10|L], L) --> [].
csv_td_in([44|L], S) -->
- "",
- csv_td_in(L,S).
+ " ",
+ csv_td_in(L,S).
csv_td_in([60|T], S) -->
- "<",
- csv_td_in(T, S).
+ "<",
+ csv_td_in(T, S).
csv_td_in([62|T], S) -->
- ">",
- csv_td_in(T, S).
+ ">",
+ csv_td_in(T, S).
csv_td_in([H|T], S) -->
- [H],
- csv_td_in(T, S).
+ [H],
+ csv_td_in(T, S).
diff --git a/Task/CSV-to-HTML-translation/Prolog/csv-to-html-translation-3.pro b/Task/CSV-to-HTML-translation/Prolog/csv-to-html-translation-3.pro
index c5c27aeaa0..317040a50e 100644
--- a/Task/CSV-to-HTML-translation/Prolog/csv-to-html-translation-3.pro
+++ b/Task/CSV-to-HTML-translation/Prolog/csv-to-html-translation-3.pro
@@ -1,5 +1,5 @@
csv_html_plus :-
- L =
+ L =
"Character,Speech
The multitude,The messiah! Show us the messiah!
Brians mother,Now you listen here! He's not the messiah; he's a very naughty boy! Now go away!
@@ -7,84 +7,84 @@ The multitude,Who are you?
Brians mother,I'm his mother; that's who!
The multitude,Behold his mother! Behold his mother!",
- csv_html_plus(L, Out1, []),
- string_to_list(Str1, Out1),
- writeln(Str1).
+ csv_html_plus(L, Out1, []),
+ string_to_list(Str1, Out1),
+ writeln(Str1).
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% HTML +
%
csv_html_plus(L) -->
- "\n",
- csv_head(L, R),
- csv_body(R),
- "
".
+ "\n",
+ csv_head(L, R),
+ csv_body(R),
+ "
".
csv_head(L, R) -->
- "\n",
- csv_head_tr(L, R),
- " \n".
+ "\n",
+ csv_head_tr(L, R),
+ " \n".
csv_head_tr(L, R) -->
- " \n",
- csv_head_th(L, R),
- "\n \n".
+ "\n",
+ csv_head_th(L, R),
+ "\n \n".
csv_head_th(L, S) -->
- "",
- csv_head_th_in(L, S),
- " ".
+ "",
+ csv_head_th_in(L, S),
+ " ".
csv_head_th_in([], []) --> [].
csv_head_th_in([10|L], L) --> [].
csv_head_th_in([44|L], S) -->
- "",
- csv_head_th_in(L,S).
+ " ",
+ csv_head_th_in(L,S).
csv_head_th_in([H|T], S) -->
- [H],
- csv_head_th_in(T, S).
+ [H],
+ csv_head_th_in(T, S).
csv_body(L) -->
- " \n",
- csv_body_tr(L),
- " \n".
+ "\n",
+ csv_body_tr(L),
+ " \n".
csv_body_tr([]) --> [].
csv_body_tr(L) -->
- "\n",
- csv_body_td(L, S),
- "\n \n",
- csv_body_tr(S).
+ "\n",
+ csv_body_td(L, S),
+ "\n \n",
+ csv_body_tr(S).
csv_body_td(L, S) -->
- "",
- csv_body_td_in(L, S),
- " ".
+ "",
+ csv_body_td_in(L, S),
+ " ".
csv_body_td_in([], []) --> [].
csv_body_td_in([10|L], L) --> [].
csv_body_td_in([44|L], S) -->
- "",
- csv_body_td_in(L,S).
+ " ",
+ csv_body_td_in(L,S).
csv_body_td_in([60|T], S) -->
- "<",
- csv_body_td_in(T, S).
+ "<",
+ csv_body_td_in(T, S).
csv_body_td_in([62|T], S) -->
- ">",
- csv_body_td_in(T, S).
+ ">",
+ csv_body_td_in(T, S).
csv_body_td_in([H|T], S) -->
- [H],
- csv_body_td_in(T, S).
+ [H],
+ csv_body_td_in(T, S).
diff --git a/Task/CSV-to-HTML-translation/Raku/csv-to-html-translation-1.raku b/Task/CSV-to-HTML-translation/Raku/csv-to-html-translation-1.raku
index c171689eae..f6bfab0ad8 100644
--- a/Task/CSV-to-HTML-translation/Raku/csv-to-html-translation-1.raku
+++ b/Task/CSV-to-HTML-translation/Raku/csv-to-html-translation-1.raku
@@ -25,4 +25,4 @@ printf
# that / at the end is just an unspace, you can omit it, but then you have to delete
# all whitespace and comments between split(…) and .map
.map({tag 'td', $^cell}))})\ # map those cells as td
- .join("\n"); # append a newline for nicer output
+ .join("\n"); # append a newline for nicer output
diff --git a/Task/CSV-to-HTML-translation/Run-BASIC/csv-to-html-translation.basic b/Task/CSV-to-HTML-translation/Run-BASIC/csv-to-html-translation.basic
index 4fa25a5ea3..41e53b8200 100644
--- a/Task/CSV-to-HTML-translation/Run-BASIC/csv-to-html-translation.basic
+++ b/Task/CSV-to-HTML-translation/Run-BASIC/csv-to-html-translation.basic
@@ -5,7 +5,7 @@ The multitude,Who are you?
Brians mother,I'm his mother; that's who!
The multitude,Behold his mother! Behold his mother!"
-k = instr(csv$,",") ' 2 exra lines to get heading
+k = instr(csv$,",") ' 2 exra lines to get heading
csv$ = left$(csv$,k - 1) + " + mid$(csv$,k + 1)
csv$ = strRep$(csv$,","," ")
@@ -15,10 +15,10 @@ wait
' string replace rep str with
' --------------------------------
FUNCTION strRep$(strRep$,rep$,with$)
-ln = len(rep$)
-k = instr(strRep$,rep$)
+ln = len(rep$)
+k = instr(strRep$,rep$)
while k
- strRep$ = left$(strRep$,k - 1) + with$ + mid$(strRep$,k + ln)
- k = instr(strRep$,rep$)
+ strRep$ = left$(strRep$,k - 1) + with$ + mid$(strRep$,k + ln)
+ k = instr(strRep$,rep$)
WEND
END FUNCTION
diff --git a/Task/CSV-to-HTML-translation/Tcl/csv-to-html-translation-1.tcl b/Task/CSV-to-HTML-translation/Tcl/csv-to-html-translation-1.tcl
index 6b41ae0db4..2761df41e6 100644
--- a/Task/CSV-to-HTML-translation/Tcl/csv-to-html-translation-1.tcl
+++ b/Task/CSV-to-HTML-translation/Tcl/csv-to-html-translation-1.tcl
@@ -18,7 +18,7 @@ html::init
puts [subst {
[html::openTag table {summary="csv2html program output"}]
[html::while {[rows size]} {
- [html::row {*}[html::quoteFormValue [rows get]]]
+ [html::row {*}[html::quoteFormValue [rows get]]]
}]
[html::closeTag]
}]
diff --git a/Task/CSV-to-HTML-translation/Tcl/csv-to-html-translation-2.tcl b/Task/CSV-to-HTML-translation/Tcl/csv-to-html-translation-2.tcl
index 748d62eea4..18c6bcdfff 100644
--- a/Task/CSV-to-HTML-translation/Tcl/csv-to-html-translation-2.tcl
+++ b/Task/CSV-to-HTML-translation/Tcl/csv-to-html-translation-2.tcl
@@ -37,9 +37,9 @@ foreach line [split $csvData "\n"] {
# Generate the output
puts [subst {
[table {
- [tr [html::quoteFormValue [rows get]] {bgcolor="yellow"}]
- [html::while {[rows size]} {
- [tr [html::quoteFormValue [rows get]]]
- }]
+ [tr [html::quoteFormValue [rows get]] {bgcolor="yellow"}]
+ [html::while {[rows size]} {
+ [tr [html::quoteFormValue [rows get]]]
+ }]
}]
}]
diff --git a/Task/CSV-to-HTML-translation/VBScript/csv-to-html-translation.vb b/Task/CSV-to-HTML-translation/VBScript/csv-to-html-translation.vb
deleted file mode 100644
index 2eadb9ed6f..0000000000
--- a/Task/CSV-to-HTML-translation/VBScript/csv-to-html-translation.vb
+++ /dev/null
@@ -1,33 +0,0 @@
-Set objfso = CreateObject("Scripting.FileSystemObject")
-
-parent_folder = objfso.GetParentFolderName(WScript.ScriptFullName) & "\"
-
-Set objcsv = objfso.OpenTextFile(parent_folder & "in.csv",1,False)
-Set objhtml = objfso.OpenTextFile(paren_folder & "out.html",2,True)
-
-objhtml.Write(csv_to_html(objcsv.ReadAll))
-
-objcsv.Close
-objhtml.Close
-Set objfso = Nothing
-
-Function csv_to_html(s)
- row = Split(s,vbCrLf)
- 'write the header
- tmp = " "
- For i = 0 To UBound(row)
- field = Split(row(i),",")
- If i = 0 Then
- tmp = tmp & "" & replace_chars(field(0)) & " " & replace_chars(field(1)) & " "
- Else
- tmp = tmp & " " & replace_chars(field(0)) & " " & replace_chars(field(1)) & " "
- End If
- Next
- 'write the footer
- tmp = tmp & "
"
- csv_to_html = tmp
-End Function
-
-Function replace_chars(s)
- replace_chars = Replace(Replace(s,"<","<"),">",">")
-End Function
diff --git a/Task/CUSIP/11l/cusip.11l b/Task/CUSIP/11l/cusip.11l
index 3728e24945..c3bafa6306 100644
--- a/Task/CUSIP/11l/cusip.11l
+++ b/Task/CUSIP/11l/cusip.11l
@@ -4,7 +4,7 @@ F cusip_check(=cusip)
cusip = cusip.uppercase()
V total = 0
- L(i) 8
+ L(i) 0.<8
V v = 0
V c = cusip[i]
I c.is_digit()
diff --git a/Task/CUSIP/ALGOL-68/cusip.alg b/Task/CUSIP/ALGOL-68/cusip.alg
index 32d1c0bad0..95cae39ff8 100644
--- a/Task/CUSIP/ALGOL-68/cusip.alg
+++ b/Task/CUSIP/ALGOL-68/cusip.alg
@@ -1,44 +1,35 @@
-BEGIN
- # returns TRUE if cusip is a valid CUSIP code #
- OP ISCUSIP = ( STRING cusip )BOOL:
- IF ( UPB cusip - LWB cusip ) /= 8
- THEN
- # code is wrong length #
- FALSE
- ELSE
- # string is 9 characters long - check it is valid #
- STRING cusip digits = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ*@#"[ AT 0 ];
- INT check digit := 0;
- IF NOT char in string( cusip[ UPB cusip ], check digit, cusip digits )
- THEN
- # invalid check digit #
- FALSE
- ELSE
- # OK so far compare the calculated check sum to the supplied one #
- INT sum := 0;
- INT c pos := LWB cusip - 1;
- FOR i TO 8 DO
- INT digit := 0;
- IF NOT char in string( cusip[ i + c pos ], digit, cusip digits )
- THEN
- # invalid digit #
- digit := -999
- FI;
- IF NOT ODD i
- THEN
- # even digit #
- digit *:= 2
- FI;
- sum +:= ( digit OVER 10 ) + ( digit MOD 10 )
- OD;
- ( 10 - ( sum MOD 10 ) ) MOD 10 = check digit
- FI
- FI ; # ISCUSIP #
+BEGIN # validate CUSIP codes #
+
+ # returns TRUE if cusip string is a valid CUSIP code, FALSE otherwise #
+ OP ISCUSIP = ( STRING cusip string )BOOL:
+ IF UPB cusip string - LWB cusip string /= 8
+ THEN FALSE # CUSIP code is not 9 characters long #
+ ELSE # CUSIP code has the correct length #
+
+ # returns the base 39 digit corresponding to a character of a CUSIP code #
+ PROC cusip digit = ( CHAR c char )INT:
+ IF STRING cusip digits = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ*@#"[ AT 0 ];
+ INT digit := 0;
+ char in string( c char, digit, cusip digits )
+ THEN digit
+ ELSE -999 # invalid digit #
+ FI # cusip digit # ;
+
+ []CHAR cusip = cusip string[ AT 1 ];
+ INT sum := 0;
+ INT check digit = cusip digit( cusip[ UPB cusip ] );
+ FOR c pos TO UPB cusip - 1 DO
+ INT digit := cusip digit( cusip[ c pos ] );
+ IF NOT ODD c pos THEN digit *:= 2 FI;
+ sum +:= ( digit OVER 10 ) + ( digit MOD 10 )
+ OD;
+ ( 10 - ( sum MOD 10 ) ) MOD 10 = check digit
+ FI # is cusip # ;
# task test cases #
PROC test cusip = ( STRING cusip )VOID:
- print( ( cusip, IF ISCUSIP cusip THEN " valid" ELSE " invalid" FI, newline ) );
+ print( ( cusip, IF ISCUSIP cusip THEN " valid" ELSE " invalid" FI, newline ) );
test cusip( "037833100" );
test cusip( "17275R102" );
diff --git a/Task/CUSIP/Ada/cusip.ada b/Task/CUSIP/Ada/cusip.ada
deleted file mode 100644
index 8ca355afe8..0000000000
--- a/Task/CUSIP/Ada/cusip.ada
+++ /dev/null
@@ -1,54 +0,0 @@
-with Ada.Text_IO;
-
-procedure Cusip_Test is
- use Ada.Text_IO;
-
- subtype Cusip is String (1 .. 9);
-
- function Check_Cusip (Code : Cusip) return Boolean is
- Sum : Integer := 0;
- V : Integer;
-
- begin
- for I in Code'First .. Code'Last - 1 loop
- case Code (I) is
- when '0' .. '9' =>
- V := Character'Pos (Code (I)) - Character'Pos ('0');
- when 'A' .. 'Z' =>
- V := Character'Pos (Code (I)) - Character'Pos ('A') + 10;
- when '*' => V := 36;
- when '@' => V := 37;
- when '#' => V := 38;
- when others => return False;
- end case;
-
- if I mod 2 = 0 then
- V := V * 2;
- end if;
-
- Sum := Sum + V / 10 + (V mod 10);
- end loop;
-
- return (10 - (Sum mod 10)) mod 10 =
- Character'Pos (Code (Code'Last)) - Character'Pos ('0');
- end Check_Cusip;
-
- type Cusip_Array is array (Natural range <>) of Cusip;
-
- Test_Array : Cusip_Array :=
- ("037833100",
- "17275R102",
- "38259P508",
- "594918104",
- "68389X106",
- "68389X105");
-begin
- for I in Test_Array'Range loop
- Put (Test_Array (I) & ": ");
- if Check_Cusip (Test_Array (I)) then
- Put_Line ("valid");
- else
- Put_Line ("not valid");
- end if;
- end loop;
-end Cusip_Test;
diff --git a/Task/CUSIP/Arturo/cusip.arturo b/Task/CUSIP/Arturo/cusip.arturo
index b8615d3d49..bde0bd1ddc 100644
--- a/Task/CUSIP/Arturo/cusip.arturo
+++ b/Task/CUSIP/Arturo/cusip.arturo
@@ -1,17 +1,17 @@
validCUSIP?: function [cusip][
s: 0
- alpha: `A`..`Z`
+ alpha: 'A'..'Z'
loop.with:'i chop cusip 'c [
v: 0
- case ø
- when? [numeric? c] -> v: to :integer to :string c
- when? [in? c alpha] -> v: (index alpha c) + 1 + 9
- when? [c = `*`] -> v: 36
- when? [c = `@`] -> v: 37
- when? [c = `#`] -> v: 38
- else []
+ when.has: c [
+ [|numeric?] -> v: to :integer to :string c
+ [|in? alpha] -> v: (index alpha c) + 1 + 9
+ [= '*'] -> v: 36
+ [= '@'] -> v: 37
+ [= '#'] -> v: 38
+ ]
if odd? i -> v: 2 * v
diff --git a/Task/CUSIP/EasyLang/cusip.easy b/Task/CUSIP/EasyLang/cusip.easy
index f9ebc73bfc..574de473d0 100644
--- a/Task/CUSIP/EasyLang/cusip.easy
+++ b/Task/CUSIP/EasyLang/cusip.easy
@@ -12,12 +12,10 @@ func check inp$ .
elif c = 35
v = 38
.
- if i mod 2 = 0
- v *= 2
- .
+ if i mod 2 = 0 : v *= 2
sum += v div 10 + v mod 10
.
- return if (10 - (sum mod 10)) mod 10 = number substr inp$ 9 1
+ return if (10 - sum mod 10) mod 10 = number substr inp$ 9 1
.
for s$ in [ "037833100" "17275R102" "38259P508" "594918104" "68389X106" "68389X105" ]
write s$ & " is "
diff --git a/Task/CUSIP/Langur/cusip-1.langur b/Task/CUSIP/Langur/cusip-1.langur
index df07bf5a9d..69451c3430 100644
--- a/Task/CUSIP/Langur/cusip-1.langur
+++ b/Task/CUSIP/Langur/cusip-1.langur
@@ -1,7 +1,5 @@
-val isCusip = fn(s) {
- if s is not string or len(s) != 9 {
- return false
- }
+val isCusip = fn(s string) {
+ if len(s) != 9 : return false
val basechars = '0'..'9' ~ 'A'..'Z' ~ "*@#"
diff --git a/Task/CUSIP/Langur/cusip-2.langur b/Task/CUSIP/Langur/cusip-2.langur
index ce7d178e29..ed2dd39a3f 100644
--- a/Task/CUSIP/Langur/cusip-2.langur
+++ b/Task/CUSIP/Langur/cusip-2.langur
@@ -1,7 +1,5 @@
-val isCusip = fn(s) {
- if s is not string or len(s) != 9 {
- return false
- }
+val isCusip = fn(s string) {
+ if len(s) != 9 : return false
val basechars = '0'..'9' ~ 'A'..'Z' ~ "*@#"
diff --git a/Task/CUSIP/Phix/cusip.phix b/Task/CUSIP/Phix/cusip.phix
index 4db8980c3d..e0bfdfac32 100644
--- a/Task/CUSIP/Phix/cusip.phix
+++ b/Task/CUSIP/Phix/cusip.phix
@@ -1,42 +1,40 @@
-(phixonline)-->
- sequence cch = {}
+sequence cch = {}
- function CusipCheckDigit ( string cusip )
- integer s = 0 , c , v
- if length ( cch )= 0 then
- cch = repeat (- 1 , 256 )
- for i = '0' to '9' do
- cch [ i ] = i - '0'
- end for
- for i = 'A' to 'Z' do
- cch [ i ] = i - 55
- end for
- cch [ '*' ] = 36
- cch [ '@' ] = 37
- cch [ '#' ] = 38
- end if
- if length ( cusip )!= 9 or find ( '\0' , cusip ) then return 0 end if
- for i = 1 to 8 do
- c := cusip [ i ]
- v := cch [ c ]
- if v =- 1 then return 0 end if
- if remainder ( i , 2 )= 0 then
- v *= 2
- end if
- s += floor ( v / 10 )+ mod ( v , 10 )
- end for
- return cusip [ 9 ]= mod ( 10 - mod ( s , 10 ), 10 )+ '0'
- end function
+function CusipCheckDigit(string cusip)
+integer s = 0, c, v
+ if length(cch)=0 then
+ cch = repeat(-1,256)
+ for i='0' to '9' do
+ cch[i] = i-'0'
+ end for
+ for i='A' to 'Z' do
+ cch[i] = i-55
+ end for
+ cch['*'] = 36
+ cch['@'] = 37
+ cch['#'] = 38
+ end if
+ if length(cusip)!=9 or find('\0',cusip) then return 0 end if
+ for i=1 to 8 do
+ c := cusip[i]
+ v := cch[c]
+ if v=-1 then return 0 end if
+ if remainder(i,2)=0 then
+ v *= 2
+ end if
+ s += floor(v/10)+mod(v,10)
+ end for
+ return cusip[9]=mod(10-mod(s,10),10)+'0'
+end function
- sequence tests = { "037833100" , -- Apple Incorporated
- "17275R102" , -- Cisco Systems
- "38259P508" , -- Google Incorporated
- "594918104" , -- Microsoft Corporation
- "68389X106" , -- Oracle Corporation (incorrect)
- "68389X105" } -- Oracle Corporation
+sequence tests = {"037833100", -- Apple Incorporated
+ "17275R102", -- Cisco Systems
+ "38259P508", -- Google Incorporated
+ "594918104", -- Microsoft Corporation
+ "68389X106", -- Oracle Corporation (incorrect)
+ "68389X105"} -- Oracle Corporation
- for i = 1 to length ( tests ) do
- string ti = tests [ i ]
- printf ( 1 , "%s : %s\n" ,{ ti ,{ "invalid" , "valid" }[ CusipCheckDigit ( ti )+ 1 ]})
- end for
-
- with javascript_semantics
- requires ( "1.0.2" ) -- (builtin constant E renamed as EULER)
- atom e0 = 0 , e = 2 , n = 0 , fact = 1
- while abs ( e - e0 )>= 1e-15 do
- e0 = e
- n += 1
- fact *= 2 * n *( 2 * n + 1 )
- e += ( 2 * n + 2 )/ fact
- end while
- printf ( 1 , "Computed e = %.15f\n" , e )
- printf ( 1 , " Real e = %.15f\n" , EULER )
- printf ( 1 , " Error = %g\n" , EULER - e )
- printf ( 1 , "Number of iterations = %d\n" , n )
-
- without js -- not from a browser, mate!
- string { libname , funcname } = iff ( platform ()= WINDOWS ?{ "user32" , "CharLowerA" }:{ "libc" , "tolower" })
- atom lib = open_dll ( libname )
- integer func = define_c_func ( lib , funcname ,{ C_INT }, C_INT )
- if func =- 1 then
- ?{{ lower ( 'A' )}} -- (you don't //have// to crash!)
- else
- ? c_func ( func ,{ 'A' }) -- ('A'==65)
- end if
-
- without js -- (no class in p2js)
- class test
- string msg = "this is a test"
- procedure show () ? this . msg end procedure
- procedure inst () ? "this is dynamic" end procedure
- end class
- test t = new ()
- t . show () -- prints "this is a test"
- t . inst () -- prints "this is dynamic"
- t . inst = t . show
- t . inst () -- prints "this is a test"
-
- with javascript_semantics
- function to_snake_case ( string s )
- string snake = substitute ( trim ( s ), " " , "_" )
- for i = length ( snake ) to 1 by - 1 do
- if isupper ( snake [ i ]) then
- snake [ i .. i ] = '_' & lower ( snake [ i ])
- end if
- end for
- return snake
- end function
+with javascript_semantics
+function to_snake_case(string s)
+ string snake = substitute(trim(s)," ","_")
+ for i=length(snake) to 1 by -1 do
+ if isupper(snake[i]) then
+ snake[i..i] = '_'&lower(snake[i])
+ end if
+ end for
+ return snake
+end function
- function toCamelCase ( string s )
- string camel = substitute_all ( trim ( s ), "- " , "__" )
- for i = length ( camel )- 1 to 1 by - 1 do
- if camel [ i ]= '_' then
- camel [ i .. i + 1 ] = upper ( camel [ i + 1 .. i + 1 ])
- end if
- end for
- return camel
- end function
+function toCamelCase(string s)
+ string camel = substitute_all(trim(s),"- ","__")
+ for i=length(camel)-1 to 1 by -1 do
+ if camel[i]='_' then
+ camel[i..i+1] = upper(camel[i+1..i+1])
+ end if
+ end for
+ return camel
+end function
- constant tests = { "snakeCase" , "snake_case" , "variable_10_case" , "variable10Case" , "ergo rE tHis" ,
- "hurry-up-joe!" , "c://my-docs/happy_Flag-Day/12.doc" , " spaces " }
- procedure test ( string title , integer fn )
- printf ( 1 , title )
- for i = 1 to length ( tests ) do
- printf ( 1 , "%33s ===> %s\n" , { tests [ i ], fn ( tests [ i ])})
- end for
- end procedure
- test ( " === to_snake_case ===\n" , to_snake_case )
- test ( "\n === toCamelCase ===\n" , toCamelCase )
-
- with javascript_semantics -- (not likely useful)
- function canonicalize_cidr ( string cidr )
- cidr = substitute ( cidr , "." , " " ) -- (else %d eats 0.0 etc)
- if not find ( '/' , cidr ) then cidr &= "/32" end if
- sequence res = scanf ( cidr , "%d %d %d %d/%d" )
- if length ( res )= 1 then
- integer { a , b , c , d , m } = res [ 1 ]
- if a >= 0 and a <= 255
- and b >= 0 and b <= 255
- and c >= 0 and c <= 255
- and d >= 0 and d <= 255
- and m >= 1 and m <= 32 then
- atom mask = power ( 2 , 32 - m )- 1 ,
- addr = bytes_to_int ({ d , c , b , a })
- addr -= and_bits ( addr , mask )
- { d , c , b , a } = int_to_bytes ( addr )
- return sprintf ( "%d.%d.%d.%d/%d" ,{ a , b , c , d , m })
- end if
- end if
- return "???"
- end function
+with javascript_semantics
+function canonicalize_cidr(string cidr)
+ cidr = substitute(cidr,"."," ") -- (else %d eats 0.0 etc)
+ if not find('/',cidr) then cidr &= "/32" end if
+ sequence res = scanf(cidr,"%d %d %d %d/%d")
+ if length(res)=1 then
+ integer {a,b,c,d,m} = res[1]
+ if a>=0 and a<=255
+ and b>=0 and b<=255
+ and c>=0 and c<=255
+ and d>=0 and d<=255
+ and m>=1 and m<=32 then
+ atom mask = power(2,32-m)-1,
+ addr = bytes_to_int({d,c,b,a})
+ addr -= and_bits(addr,mask)
+ {d,c,b,a} = int_to_bytes(addr)
+ return sprintf("%d.%d.%d.%d/%d",{a,b,c,d,m})
+ end if
+ end if
+ return "???"
+end function
- constant tests = { "87.70.141.1/22" ,
- "36.18.154.103/12" ,
- "62.62.197.11/29" ,
- "67.137.119.181/4" ,
- "161.214.74.21/24" ,
- "184.232.176.184/18" }
-
- for i = 1 to length ( tests ) do
- string ti = tests [ i ]
- printf ( 1 , "%-18s -> %s\n" ,{ ti , canonicalize_cidr ( ti )})
- end for
-
- integer n = 5 ,
- w = power ( 3 , n - 1 ),
- len = w
- string line = repeat ( '#' , w )& "\n"
-
- while 1 do
- puts ( 1 , line )
- if len = 1 then exit end if
- len /= 3
- integer pos = 1
- while pos <( w - len ) do
- pos += len
- line [ pos .. pos + len - 1 ] = ' '
- pos += len
- end while
- end while
-
- with javascript_semantics
- integer count = 0
- for p1 = 1 to 61 do
- if is_prime ( p1 ) then
- for h3 = 1 to p1 do
- atom h3p1 = h3 + p1
- for d = 1 to h3p1 - 1 do
- if mod ( h3p1 *( p1 - 1 ), d )= 0
- and mod (-( p1 * p1 ), h3 ) = mod ( d , h3 ) then
- atom p2 := 1 + floor ((( p1 - 1 )* h3p1 )/ d ),
- p3 := 1 + floor ( p1 * p2 / h3 )
- if is_prime ( p2 )
- and is_prime ( p3 )
- and mod ( p2 * p3 , p1 - 1 )= 1 then
- if count < 5 or count > 65 then
- printf ( 1 , "%d * %d * %d = %d\n" ,{ p1 , p2 , p3 , p1 * p2 * p3 })
- elsif count = 35 then puts ( 1 , "...\n" ) end if
- count += 1
- end if
- end if
- end for
- end for
- end if
- end for
- printf ( 1 , "%d Carmichael numbers found\n" , count )
-
- constant N = 15 -- accurate to 30, nan/inf for anything over 514 (gmp version is below).
- sequence catalan = {}, -- (>=1 only)
- p = repeat ( 1 , N + 1 )
- atom p1
- for i = 1 to N do
- p1 = p [ 1 ]* 2
- catalan = append ( catalan , p1 - p [ 2 ])
- for j = 1 to N - i + 1 do
- p1 += p [ j + 1 ]
- p [ j ] = p1
- end for
- -- ?p[1..N-i+1]
- end for
- ? catalan
-
- with javascript_semantics
- include builtins \ mpfr . e
+with javascript_semantics
+include builtins\mpfr.e
- function catalanB ( integer n ) -- very very fast!
- sequence catalan = mpz_inits ( n ),
- p = mpz_inits ( n + 1 , 1 )
- mpz p1 = mpz_init ( 1 )
- if n = 0 then return p1 end if
- for i = 1 to n do
- mpz_mul_si ( p1 , p [ 1 ], 2 )
- mpz_sub ( catalan [ i ], p1 , p [ 2 ])
- for j = 1 to n - i + 1 do
- mpz_add ( p1 , p1 , p [ j + 1 ])
- mpz_set ( p [ j ], p1 )
- end for
- end for
- return catalan [ n ]
- end function
+function catalanB(integer n) -- very very fast!
+sequence catalan = mpz_inits(n),
+ p = mpz_inits(n+1,1)
+mpz p1 = mpz_init(1)
+ if n=0 then return p1 end if
+ for i=1 to n do
+ mpz_mul_si(p1,p[1],2)
+ mpz_sub(catalan[i],p1,p[2])
+ for j=1 to n-i+1 do
+ mpz_add(p1,p1,p[j+1])
+ mpz_set(p[j],p1)
+ end for
+ end for
+ return catalan[n]
+end function
- printf ( 1 , "%d: %s\n" ,{ 100 , shorten ( mpz_get_str ( catalanB ( 100 )))})
- printf ( 1 , "%d: %s\n" ,{ 250 , shorten ( mpz_get_str ( catalanB ( 250 )))})
-
- with javascript_semantics
- -- returns inf/-nan for n>85, and needs the rounding for n>=14, accurate to n=29
- function catalan1 ( integer n )
- return floor ( factorial ( 2 * n )/( factorial ( n + 1 )* factorial ( n ))+ 0.5 )
- end function
+with javascript_semantics
+-- returns inf/-nan for n>85, and needs the rounding for n>=14, accurate to n=29
+function catalan1(integer n)
+ return round(factorial(2*n)/(factorial(n+1)*factorial(n)))
+end function
- -- returns inf for n>519, accurate to n=30:
- function catalan2 ( integer n ) -- NB: very slow!
- atom res = not n
- n -= 1
- for i = 0 to n do
- res += catalan2 ( i )* catalan2 ( n - i )
- end for
- return res
- end function
+-- returns inf for n>519, accurate to n=30:
+function catalan2(integer n) -- NB: very slow!
+atom res = not n
+ n -= 1
+ for i=0 to n do
+ res += catalan2(i)*catalan2(n-i)
+ end for
+ return res
+end function
- -- returns inf for n>514, accurate to n=30:
- function catalan3 ( integer n )
- if n = 0 then return 1 end if
- return 2 *( 2 * n - 1 )/( 1 + n )* catalan3 ( n - 1 )
- end function
+-- returns inf for n>514, accurate to n=30:
+function catalan3(integer n)
+ if n=0 then return 1 end if
+ return 2*(2*n-1)/(1+n)*catalan3(n-1)
+end function
- sequence res = repeat ( repeat ( 0 , 4 ), 16 ),
- times = repeat ( 0 , 3 )
- for t = 1 to 4 do
- atom t0 = time ()
- for i = 0 to 15 do
- switch t do
- case 1 : res [ i + 1 ][ 2 ] = catalan1 ( i )
- case 2 : res [ i + 1 ][ 3 ] = catalan2 ( i )
- case 3 : res [ i + 1 ][ 4 ] = catalan3 ( i )
- case 4 : res [ i + 1 ][ 1 ] = i ; printf ( 1 , "%2d: %10d %10d %10d\n" , res [ i + 1 ])
- end switch
- end for
- if t = 4 then exit end if
- times [ t ] = elapsed ( time ()- t0 )
- end for
- printf ( 1 , "times:%8s %10s %10s\n" , times )
-
- with javascript_semantics
- include builtins \ mpfr . e
+with javascript_semantics
+include builtins\mpfr.e
- sequence c2cache = {}
+sequence c2cache = {}
- function catalan2m ( integer n ) -- very fast!
- object r -- result (a [cached/shared] mpz)
- -- (nb: modifying result will mess up cache)
- if n <= 0 then return mpz_init ( 1 ) end if
- if n <= length ( c2cache ) then
- r = c2cache [ n ]
- if r != 0 then return r end if
- else
- c2cache &= repeat ( 0 , n - length ( c2cache ))
- end if
- r = mpz_init ( 0 )
- mpz t = mpz_init ()
- for i = 0 to n - 1 do
- mpz_mul ( t , catalan2m ( i ), catalan2m ( n - 1 - i ))
- mpz_add ( r , r , t )
- end for
- t = mpz_free ( t )
- c2cache [ n ] = r
- return r
- end function
+function catalan2m(integer n) -- very fast!
+object r -- result (a [cached/shared] mpz)
+ -- (nb: modifying result will mess up cache)
+ if n<=0 then return mpz_init(1) end if
+ if n<=length(c2cache) then
+ r = c2cache[n]
+ if r!=0 then return r end if
+ else
+ c2cache &= repeat(0,n-length(c2cache))
+ end if
+ r = mpz_init(0)
+ mpz t = mpz_init()
+ for i=0 to n-1 do
+ mpz_mul(t,catalan2m(i),catalan2m(n-1-i))
+ mpz_add(r,r,t)
+ end for
+ t = mpz_free(t)
+ c2cache[n] = r
+ return r
+end function
- sequence s = {}
- for i = 0 to 15 do s = append ( s , mpz_get_str ( catalan2m ( i ))) end for
- printf ( 1 , "0..15: %s\n" , join ( s , "," ))
- printf ( 1 , "100: %s\n" ,{ mpz_get_str ( catalan2m ( 100 ))})
-
- without js -- (no input redirection in a browser!)
- printf ( 1 , "stdin:%t, stdout:%t, stderr:%t\n" ,{ isatty ( 0 ), isatty ( 1 ), isatty ( 2 )})
-
- without js -- (no input or output redirection in a browser!)
- printf ( 1 , "stdin:%t, stdout:%t, stderr:%t\n" ,{ isatty ( 0 ), isatty ( 1 ), isatty ( 2 )})
-
- with javascript_semantics
- function chernick_carmichael_factors ( integer n , m )
- sequence res = { 6 * m + 1 , 12 * m + 1 }
- for i = 1 to n - 2 do
- res &= power ( 2 , i ) * 9 * m + 1
- end for
- return res
- end function
-
- include mpfr . e
- mpz p = mpz_init ()
-
- function m_prime ( atom a )
- mpz_set_d ( p , a )
- return mpz_prime ( p )
- end function
-
- function is_chernick_carmichael ( integer n , m )
- return iff ( n == 2 ? m_prime ( 6 * m + 1 ) and m_prime ( 12 * m + 1 )
- : m_prime ( power ( 2 , n - 2 ) * 9 * m + 1 ) and
- is_chernick_carmichael ( n - 1 , m ))
- end function
-
- function chernick_carmichael_number ( integer n )
- integer m = iff ( n > 4 ? power ( 2 , n - 4 ) : 1 ), mm = m
- while not is_chernick_carmichael ( n , mm ) do mm += m end while
- return { chernick_carmichael_factors ( n , mm ), mm }
- end function
-
- for n = 3 to 9 do
- { sequence f , integer m } = chernick_carmichael_number ( n )
- mpz_set_si ( p , 1 )
- for i = 1 to length ( f ) do
- mpz_mul_d ( p , p , f [ i ])
- f [ i ] = sprintf ( "%d" , f [ i ])
- end for
- printf ( 1 , "U(%d,%d): %s = %s\n" ,{ n , m , mpz_get_str ( p ), join ( f , " * " )})
- end for
-
- with javascript_semantics
- include mpfr . e
- sequence ppp = { 3 , 5 , 7 , 11 , 13 , 17 , 19 , 23 }
- function primality_pretest ( atom k )
- for i = 1 to length ( ppp ) do
- if remainder ( k , ppp [ i ])= 0 then return ( k <= 23 ) end if
- end for
- return true
- end function
-
- function probprime ( atom k , mpz n )
- mpz_set_d ( n , k )
- return mpz_prime ( n )
- end function
-
- function is_chernick ( integer n , atom m , mpz z )
- atom t = 9 * m ;
- if primality_pretest ( 6 * m + 1 ) == false then return false end if
- if primality_pretest ( 12 * m + 1 ) == false then return false end if
- for i = 1 to n - 3 do
- if primality_pretest ( t * power ( 2 , i ) + 1 ) == false then return false end if
- end for
- if probprime ( 6 * m + 1 , z ) == false then return false end if
- if probprime ( 12 * m + 1 , z ) == false then return false end if
- for i = 1 to n - 2 do
- if probprime ( t * power ( 2 , i ) + 1 , z ) == false then return false end if
- end for
- return true
- end function
-
- procedure main ()
- atom t0 = time ()
- mpz z = mpz_init ( 0 )
-
- for n = 3 to 10 do
- atom multiplier = iff ( n > 4 ? power ( 2 , n - 4 ) : 1 ), k = 1
- if n > 5 then multiplier *= 5 end if
-
- while true do
- if n = 10 then k += 12564168 end if -- cheat!
- atom m = k * multiplier ;
- if is_chernick ( n , m , z ) then
- printf ( 1 , "a(%d) has m = %d\n" , { n , m })
- exit
- end if
- k += 1
- end while
- end for
- ? elapsed ( time ()- t0 )
- end procedure
- main ()
-
- with javascript_semantics
- constant animals = { "Rat" , "Ox" , "Tiger" , "Rabbit" , "Dragon" , "Snake" , "Horse" , "Goat" , "Monkey" , "Rooster" , "Dog" , "Pig" },
- elements = { "Wood" , "Fire" , "Earth" , "Metal" , "Water" },
- yinyang = { "yang" , "yin" },
- years = { 1935 , 1938 , 1968 , 1972 , 1976 , 2018 }
+with javascript_semantics
+constant animals = {"Rat","Ox","Tiger","Rabbit","Dragon","Snake","Horse","Goat","Monkey","Rooster","Dog","Pig"},
+ elements = {"Wood","Fire","Earth","Metal","Water"},
+ yinyang = {"yang","yin"},
+ years = {1935,1938,1968,1972,1976,2018}
- for i = 1 to length ( years ) do
- integer year = years [ i ],
- cycle = mod ( year - 4 , 60 )
- string element = elements [ floor ( mod ( cycle , 10 )/ 2 )+ 1 ],
- animal = animals [ mod ( cycle , 12 )+ 1 ],
- yy = yinyang [ mod ( cycle , 2 )+ 1 ]
- printf ( 1 , "%d: %s %s; %s, year %d of the cycle.\n" ,
- { year , element , animal , yy , cycle + 1 })
- end for
-
- with javascript_semantics
+with javascript_semantics
- type church ( object c )
- -- eg {r_add,1,{a,b}}
- return sequence ( c ) and length ( c )= 3
- and integer ( c [ 1 ]) and integer ( c [ 2 ])
- and sequence ( c [ 3 ]) and length ( c [ 3 ])= 2
- end type
+type church(object c)
+-- eg {r_add,1,{a,b}}
+ return sequence(c) and length(c)=3
+ and integer(c[1]) and integer(c[2])
+ and sequence(c[3]) and length(c[3])=2
+end type
- function succ ( church c )
- -- eg {r_add,1,{a,b}} => {r_add,2,{a,b}} aka a+b -> a+b+b
- c = deep_copy ( c )
- c [ 2 ] += 1
- return c
- end function
+function succ(church c)
+-- eg {add,1,{a,b}} => {add,2,{a,b}} aka a+b => a+b+b
+ c = deep_copy(c)
+ c[2] += 1
+ return c
+end function
- -- three normal integer-handling routines...
- function add ( integer n , a , b )
- for i = 1 to n do
- a += b
- end for
- return a
- end function
- constant r_add = routine_id ( "add" )
+-- three normal integer-handling routines...
+function add(integer n, a, b)
+ for i=1 to n do
+ a += b
+ end for
+ return a
+end function
- function mul ( integer n , a , b )
- for i = 1 to n do
- a *= b
- end for
- return a
- end function
- constant r_mul = routine_id ( "mul" )
+function mul(integer n, a, b)
+ for i=1 to n do
+ a *= b
+ end for
+ return a
+end function
- function pow ( integer n , a , b )
- for i = 1 to n do
- a = power ( a , b )
- end for
- return a
- end function
- constant r_pow = routine_id ( "pow" )
+function pow(integer n, a, b)
+ for i=1 to n do
+ a = power(a,b)
+ end for
+ return a
+end function
- -- ...and three church constructors to match
- -- (no maths here, just pure static data)
- function addch ( church c , d )
- church res = { r_add , 1 ,{ c , d }}
- return res
- end function
+-- ...and three church constructors to match
+-- (no maths here, just pure static data)
+function addch(church c, d)
+ church res = {add,1,{c,d}}
+ return res
+end function
- function mulch ( church c , d )
- church res = { r_mul , 1 ,{ c , d }}
- return res
- end function
+function mulch(church c, d)
+ church res = {mul,1,{c,d}}
+ return res
+end function
- function powch ( church c , d )
- church res = { r_pow , 1 ,{ c , d }}
- return res
- end function
+function powch(church c, d)
+ church res = {pow,1,{c,d}}
+ return res
+end function
- function tointch ( church c )
- -- note this is where the bulk of any processing happens
- { integer rid , integer n , object x } = c
- x = deep_copy ( x )
- for i = 1 to length ( x ) do
- if church ( x [ i ]) then x [ i ] = tointch ( x [ i ]) end if
- end for
- -- return call_func(rid,n&x)
- x = deep_copy ({ n })& deep_copy ( x )
- return call_func ( rid , x )
- end function
+function tointch(church c)
+-- note this is where the bulk of any processing happens
+ {integer rid, integer n, object x} = c
+ x = deep_copy(x)
+ for i=1 to length(x) do
+ if church(x[i]) then x[i] = tointch(x[i]) end if
+ end for
+-- return call_func(rid,n&x)
+ x = deep_copy({n})&deep_copy(x)
+ return call_func(rid,x)
+end function
- constant church zero = { r_add , 0 ,{ 0 , 1 }}
+constant church zero = {add,0,{0,1}}
- function inttoch ( integer i )
- if i = 0 then
- return zero
- else
- return succ ( inttoch ( i - 1 ))
- end if
- end function
+function inttoch(integer i)
+ if i=0 then
+ return zero
+ else
+ return succ(inttoch(i-1))
+ end if
+end function
- church three = succ ( succ ( succ ( zero ))),
- four = succ ( three )
- printf ( 1 , "three -> %d\n" , tointch ( three ))
- printf ( 1 , "four -> %d\n" , tointch ( four ))
- printf ( 1 , "three + four -> %d\n" , tointch ( addch ( three , four )))
- printf ( 1 , "three * four -> %d\n" , tointch ( mulch ( three , four )))
- printf ( 1 , "three ^ four -> %d\n" , tointch ( powch ( three , four )))
- printf ( 1 , "four ^ three -> %d\n" , tointch ( powch ( four , three )))
- printf ( 1 , "5 -> five -> %d\n" , tointch ( inttoch ( 5 )))
-
- with javascript_semantics
- constant tests = {{ 0.1234 , 0.9876 , 0.8765 , 0.2345 , 2.0 },
- { 0.0000 , 2.0000 , 0.0000 , 0.0000 , 1.0 },
- { 0.1234 , 0.9876 , 0.1234 , 0.9876 , 2.0 },
- { 0.1234 , 0.9876 , 0.8765 , 0.2345 , 0.5 },
- { 0.1234 , 0.9876 , 0.1234 , 0.9876 , 0.0 }}
- for i = 1 to length ( tests ) do
- atom { x1 , y1 , x2 , y2 , r } = tests [ i ],
- xd = x2 - x1 , yd = y1 - y2 ,
- s2 = xd * xd + yd * yd , sep = sqrt ( s2 ),
- xh = ( x1 + x2 )/ 2 , yh = ( y1 + y2 )/ 2
- string txt
- if sep = 0 then
- txt = "same points/" & iff ( r = 0 ? "radius is zero" : "infinite solutions" )
- elsif sep = 2 * r then
- txt = sprintf ( "opposite ends of diameter with centre {%.4f,%.4f}" ,{ xh , yh })
- elsif sep > 2 * r then
- txt = sprintf ( "too far apart (%.4f > %.4f)" ,{ sep , 2 * r })
- else
- atom md = sqrt ( r * r - s2 / 4 ), xs = md * xd / sep , ys = md * yd / sep
- txt = sprintf ( "{%.4f,%.4f} and {%.4f,%.4f}" ,{ xh + ys , yh + xs , xh - ys , yh - xs })
- end if
- printf ( 1 , "points {%.4f,%.4f}, {%.4f,%.4f} with radius %.1f ==> %s\n" ,{ x1 , y1 , x2 , y2 , r , txt })
- end for
-
- with javascript_semantics
- function circular ( integer p )
- integer len = length ( sprintf ( "%d" , p )),
- pow = power ( 10 , len - 1 ),
- p0 = p
- for i = 1 to len - 1 do
- p = pow * remainder ( p , 10 )+ floor ( p / 10 )
- if p < p0 or not is_prime ( p ) then return false end if
- end for
- return true
- end function
+with javascript_semantics
+function circular(integer p)
+ integer len = length(sprintf("%d",p)),
+ pow = power(10,len-1),
+ p0 = p
+ for i=1 to len-1 do
+ p = pow*remainder(p,10)+floor(p/10)
+ if psequence c = {}
- integer n = 1
- while length ( c )< 19 do
- integer p = get_prime ( n )
- if circular ( p ) then c &= p end if
- n += 1
- end while
- printf ( 1 , "The first 19 circular primes are:\n%v\n\n" ,{ c })
+sequence c = {}
+integer n = 1
+while length(c)<19 do
+ integer p = get_prime(n)
+ if circular(p) then c &= p end if
+ n += 1
+end while
+printf(1,"The first 19 circular primes are:\n%v\n\n",{c})
- include mpfr . e
- procedure repunit ( mpz z , integer n )
- mpz_set_str ( z , repeat ( '1' , n ))
- end procedure
-
- c = {}
- n = 7
- mpz z = mpz_init ()
- while length ( c )< 4 do
- repunit ( z , n )
- if mpz_prime ( z ) then
- c = append ( c , sprintf ( "R(%d)" , n ))
- end if
- n += 1
- end while
- printf ( 1 , "The next 4 circular primes, in repunit format, are:\n%s\n\n" ,{ join ( c )})
-
- constant t = { 5003 , 9887 , 15073 , 25031 , 35317 , 49081 }
- printf ( 1 , "The following repunits are probably circular primes:\n" )
- for i = 1 to length ( t ) do
- integer ti = t [ i ]
- atom t0 = time ()
- repunit ( z , ti )
- bool bPrime = mpz_prime ( z , 1 )
- printf ( 1 , "R(%d) : %t (%s)\n" , { ti , bPrime , elapsed ( time ()- t0 )})
- end for
-
- with javascript_semantics
- function colourful ( integer n )
- if n < 10 then return n >= 0 end if
- sequence digits = sq_sub ( sprintf ( "%d" , n ), '0' ),
- ud = unique ( deep_copy ( digits ))
- integer ln = length ( digits )
- if ud [ 1 ]<= 1 or length ( ud )!= ln then return false end if
- for i = 1 to ln - 1 do
- for j = i + 1 to ln do
- atom prod = product ( digits [ i .. j ])
- if find ( prod , ud ) then return false end if
- ud &= prod
- end for
- end for
- return true
- end function
+with javascript_semantics
+function colourful(integer n)
+ if n<10 then return n>=0 end if
+ sequence digits = sq_sub(sprintf("%d",n),'0'),
+ ud = unique(deep_copy(digits))
+ integer ln = length(digits)
+ if ud[1]<=1 or length(ud)!=ln then return false end if
+ for i=1 to ln-1 do
+ for j=i+1 to ln do
+ atom prod = product(digits[i..j])
+ if find(prod,ud) then return false end if
+ ud &= prod
+ end for
+ end for
+ return true
+end function
- atom t0 = time ()
- sequence cn = apply ( true , sprintf ,{{ "%2d" }, filter ( tagset ( 100 , 0 ), colourful )})
- printf ( 1 , "The %d colourful numbers less than 100 are:\n%s\n" ,
- { length ( cn ), join_by ( cn , 1 , 10 , " " )})
+atom t0 = time()
+sequence cn = apply(true,sprintf,{{"%2d"},filter(tagset(100,0),colourful)})
+printf(1,"The %d colourful numbers less than 100 are:\n%s\n",
+ {length(cn),join_by(cn,1,10," ")})
- sequence count = repeat ( 0 , 8 ),
- used = repeat ( false , 10 )
- integer largestcn = 0
+sequence count = repeat(0,8),
+ used = repeat(false,10)
+integer largestcn = 0
- procedure count_colourful ( integer taken = 0 , string n = "" )
- if taken = 0 then
- for digit = '0' to '9' do
- integer dx = digit - '0' + 1
- used [ dx ] = true
- count_colourful ( iff ( digit < '2' ? 9 : 1 ), "" & digit )
- used [ dx ] = false
- end for
- else
- integer nn = to_integer ( n )
- if colourful ( nn ) then
- integer ln = length ( n )
- count [ ln ] += 1
- if nn > largestcn then largestcn = nn end if
- end if
- if taken < 9 then
- for digit = '2' to '9' do
- integer dx = digit - '0' + 1
- if not used [ dx ] then
- used [ dx ] = true
- count_colourful ( taken + 1 , n & digit )
- used [ dx ] = false
- end if
- end for
- end if
- end if
- end procedure
- count_colourful ()
- printf ( 1 , "The largest possible colourful number is: %,d\n\n" , largestcn )
- atom pow = 10
- for dc = 1 to length ( count ) do
- printf ( 1 , " %d digit colourful number count: %,6d - %7.3f%%\n" ,
- { dc , count [ dc ], 100 * count [ dc ]/ pow })
- pow = iff ( pow = 10 ? 90 : pow * 10 )
- end for
- printf ( 1 , "\nTotal colourful numbers: %,d\n" , sum ( count ))
- ? elapsed ( time ()- t0 )
-
- with javascript_semantics
- function allsame ( sequence s )
- for i = 2 to length ( s ) do
- if s [ i ]!= s [ 1 ] then return false end if
- end for
- return true
- end function
+with javascript_semantics
+function allsame(sequence s)
+ for i=2 to length(s) do
+ if s[i]!=s[1] then return false end if
+ end for
+ return true
+end function
- function strict_order ( sequence s )
- for i = 2 to length ( s ) do
- if s [ i ]<= s [ i - 1 ] then return false end if
- end for
- return true
- end function
+function strict_order(sequence s)
+ for i=2 to length(s) do
+ if s[i]<=s[i-1] then return false end if
+ end for
+ return true
+end function
- procedure test ( sequence s )
- printf ( 1 , "%-22V allsame:%5t, strict_order:%5t\n" ,{ s , allsame ( s ), strict_order ( s )})
- end procedure
+procedure test(sequence s)
+ printf(1,"%-22V allsame:%5t, strict_order:%5t\n",{s,allsame(s),strict_order(s)})
+end procedure
- test ({ "AA" , "BB" , "CC" })
- test ({ "AA" , "AA" , "AA" })
- test ({ "AA" , "CC" , "BB" })
- test ({ "AA" , "ACB" , "BB" , "CC" })
- test ({ "single_element" })
-
- integer a , b
- a = 10 * 9 * 8 * 7 * 6 * 5 * 4 * 3 * 2 * 1
- b = factorial ( 10 )
- ?{ a , b }
-
- --
- -- demo\rosetta\Compiler\interp.exw
- -- ================================
- --
- with javascript_semantics
- include parse . e
+-- demo\rosetta\Compiler\interp.exw
+with javascript_semantics
+include parse.e
- sequence vars = {},
- vals = {}
+sequence vars = {},
+ vals = {}
- function var_idx ( sequence inode )
- if inode [ 1 ]!= tk_Identifier then ? 9 / 0 end if
- string ident = inode [ 2 ]
- integer n = find ( ident , vars )
- if n = 0 then
- vars = append ( vars , ident )
- vals = append ( vals , 0 )
- n = length ( vars )
- end if
- return n
- end function
+function var_idx(sequence inode)
+ if inode[1]!=tk_Identifier then ?9/0 end if
+ string ident = inode[2]
+ integer n = find(ident,vars)
+ if n=0 then
+ vars = append(vars,ident)
+ vals = append(vals,0)
+ n = length(vars)
+ end if
+ return n
+end function
- function interp ( object t )
- if t != NULL then
- integer ntype = t [ 1 ]
- object t2 = t [ 2 ],
- t3 = iff ( length ( t )= 3 ? t [ 3 ]: 0 )
- switch ntype do
- case tk_Sequence : {} = interp ( t2 ) {} = interp ( t3 )
- case tk_assign : vals [ var_idx ( t2 )] = interp ( t3 )
- case tk_Identifier : return vals [ var_idx ( t )]
- case tk_Integer : return t2
- case tk_String : return t2
- case tk_lt : return interp ( t2 ) < interp ( t3 )
- case tk_add : return interp ( t2 ) + interp ( t3 )
- case tk_sub : return interp ( t2 ) - interp ( t3 )
- case tk_while : while interp ( t2 ) do {} = interp ( t3 ) end while
- case tk_Prints : puts ( 1 , interp ( t2 ))
- case tk_Printi : printf ( 1 , "%d" , interp ( t2 ))
- case tk_putc : printf ( 1 , "%c" , interp ( t2 ))
- case tk_and : return interp ( t2 ) and interp ( t3 )
- case tk_or : return interp ( t2 ) or interp ( t3 )
- case tk_le : return interp ( t2 ) <= interp ( t3 )
- case tk_ge : return interp ( t2 ) >= interp ( t3 )
- case tk_ne : return interp ( t2 ) != interp ( t3 )
- case tk_gt : return interp ( t2 ) > interp ( t3 )
- case tk_mul : return interp ( t2 ) * interp ( t3 )
- case tk_div : return trunc ( interp ( t2 )/ interp ( t3 ))
- case tk_mod : return remainder ( interp ( t2 ), interp ( t3 ))
- case tk_if : {} = interp ( t3 [ iff ( interp ( t2 )? 2 : 3 )])
- case tk_not : return not interp ( t2 )
- case tk_neg : return - interp ( t2 )
- else
- error ( "unknown node type" )
- end switch
- end if
- return NULL
- end function
+function interp(object t)
+ if t!=NULL then
+ integer ntype = t[1]
+ object t2 = t[2],
+ t3 = iff(length(t)=3?t[3]:0)
+ switch ntype do
+ case tk_Sequence: {} = interp(t2) {} = interp(t3)
+ case tk_assign: vals[var_idx(t2)] = interp(t3)
+ case tk_Identifier: return vals[var_idx(t)]
+ case tk_Integer: return t2
+ case tk_String: return t2
+ case tk_lt: return interp(t2) < interp(t3)
+ case tk_add: return interp(t2) + interp(t3)
+ case tk_sub: return interp(t2) - interp(t3)
+ case tk_while: while interp(t2) do {} = interp(t3) end while
+ case tk_Prints: puts(1,interp(t2))
+ case tk_Printi: printf(1,"%d",interp(t2))
+ case tk_putc: printf(1,"%c",interp(t2))
+ case tk_and: return interp(t2) and interp(t3)
+ case tk_or: return interp(t2) or interp(t3)
+ case tk_le: return interp(t2) <= interp(t3)
+ case tk_ge: return interp(t2) >= interp(t3)
+ case tk_ne: return interp(t2) != interp(t3)
+ case tk_gt: return interp(t2) > interp(t3)
+ case tk_mul: return interp(t2) * interp(t3)
+ case tk_div: return trunc(interp(t2)/interp(t3))
+ case tk_mod: return remainder(interp(t2),interp(t3))
+ case tk_if: {} = interp(t3[iff(interp(t2)?2:3)])
+ case tk_not: return not interp(t2)
+ case tk_neg: return - interp(t2)
+ else
+ error("unknown node type")
+ end switch
+ end if
+ return NULL
+end function
- procedure main ( sequence cl )
- open_files ( cl )
- toks = lex ()
- object t = parse ()
- {} = interp ( t )
- close_files ()
- end procedure
+procedure main(sequence cl)
+ open_files(cl)
+ toks = lex()
+ object t = parse()
+ {} = interp(t)
+ close_files()
+end procedure
- --main(command_line())
- main ({ 0 , 0 , "primes.c" })
-
- --
- -- demo\rosetta\Compiler\cgen.e
- -- ============================
- --
- -- The reusable part of cgen.exw
- --
- without js -- (machine code!)
- include parse . e
+-- demo\rosetta\Compiler\cgen.e
+-- The reusable part of cgen.exw
+without js -- (machine code!)
+include parse.e
- global sequence vars = {},
- strings = {},
- stringptrs = {}
+global sequence vars = {},
+ strings = {},
+ stringptrs = {}
- global integer chain = 0
- global sequence code = {}
+global integer chain = 0
+global sequence code = {}
- function var_idx ( sequence inode )
- if inode [ 1 ]!= tk_Identifier then ? 9 / 0 end if
- string ident = inode [ 2 ]
- integer n = find ( ident , vars )
- if n = 0 then
- vars = append ( vars , ident )
- n = length ( vars )
- end if
- return n
- end function
+function var_idx(sequence inode)
+ if inode[1]!=tk_Identifier then ?9/0 end if
+ string ident = inode[2]
+ integer n = find(ident,vars)
+ if n=0 then
+ vars = append(vars,ident)
+ n = length(vars)
+ end if
+ return n
+end function
- function string_idx ( sequence inode )
- if inode [ 1 ]!= tk_String then ? 9 / 0 end if
- string s = inode [ 2 ]
- integer n = find ( s , strings )
- if n = 0 then
- strings = append ( strings , s )
- stringptrs = append ( stringptrs , 0 )
- n = length ( strings )
- end if
- return n
- end function
+function string_idx(sequence inode)
+ if inode[1]!=tk_String then ?9/0 end if
+ string s = inode[2]
+ integer n = find(s,strings)
+ if n=0 then
+ strings = append(strings,s)
+ stringptrs = append(stringptrs,0)
+ n = length(strings)
+ end if
+ return n
+end function
- function gen_size ( object t )
- -- note: must be kept precisely in sync with gen_rec!
- -- (relentlessly tested via estsize/actsize)
- integer size = 0
- if t != NULL then
- integer n_type = t [ 1 ]
- string node_type = tkNames [ n_type ]
- switch n_type do
- case tk_Sequence :
- size += gen_size ( t [ 2 ])
- size += gen_size ( t [ 3 ])
- case tk_assign :
- size += gen_size ( t [ 3 ])+ 6
- case tk_Integer :
- size += 5
- case tk_Identifier :
- size += 6
- case tk_String :
- size += 5
- case tk_while :
- -- emit: @@:<condition><topjmp(@f)><body><tailjmp(@b)>@@:
- size += gen_size ( t [ 2 ])+ 3
- integer body = gen_size ( t [ 3 ])
- integer stail = iff ( size + body + 2 > 128 ? 5 : 2 )
- integer stop = iff ( body + stail > 127 ? 6 : 2 )
- size += stop + body + stail
- case tk_lt :
- case tk_le :
- case tk_ne :
- case tk_eq :
- case tk_gt :
- case tk_ge :
- size += gen_size ( t [ 2 ])
- size += gen_size ( t [ 3 ])
- size += 10
- case tk_and :
- case tk_or :
- size += gen_size ( t [ 2 ])
- size += gen_size ( t [ 3 ])
- size += 15
- case tk_add :
- case tk_sub :
- size += gen_size ( t [ 2 ])
- size += gen_size ( t [ 3 ])
- size += 4
- case tk_mul :
- size += gen_size ( t [ 2 ])
- size += gen_size ( t [ 3 ])
- size += 5
- case tk_div :
- case tk_mod :
- size += gen_size ( t [ 2 ])
- size += gen_size ( t [ 3 ])
- size += 6
- case tk_putc :
- case tk_Printi :
- case tk_Prints :
- size += gen_size ( t [ 2 ])
- size += 5
- case tk_if :
- size += gen_size ( t [ 2 ])+ 3
- if t [ 3 ][ 1 ]!= tk_if then ? 9 / 0 end if
- integer truesize = gen_size ( t [ 3 ][ 2 ])
- integer falsesize = gen_size ( t [ 3 ][ 3 ])
- integer elsejmp = iff ( falsesize = 0 ? 0 : iff ( falsesize > 127 ? 5 : 2 ))
- integer mainjmp = iff ( truesize + elsejmp > 127 ? 6 : 2 )
- size += mainjmp + truesize + elsejmp + falsesize
- case tk_not :
- size += gen_size ( t [ 2 ])
- size += 9
- case tk_neg :
- size += gen_size ( t [ 2 ])
- size += 4
- else :
- ? 9 / 0
- end switch
- end if
- return size
- end function
+function gen_size(object t)
+-- note: must be kept precisely in sync with gen_rec!
+-- (relentlessly tested via estsize/actsize)
+integer size = 0
+ if t!=NULL then
+ integer n_type = t[1]
+ string node_type = tkNames[n_type]
+ switch n_type do
+ case tk_Sequence:
+ size += gen_size(t[2])
+ size += gen_size(t[3])
+ case tk_assign:
+ size += gen_size(t[3])+6
+ case tk_Integer:
+ size += 5
+ case tk_Identifier:
+ size += 6
+ case tk_String:
+ size += 5
+ case tk_while:
+ -- emit: @@:@@:
+ size += gen_size(t[2])+3
+ integer body = gen_size(t[3])
+ integer stail = iff(size+body+2>128?5:2)
+ integer stop = iff(body+stail >127?6:2)
+ size += stop+body+stail
+ case tk_lt:
+ case tk_le:
+ case tk_ne:
+ case tk_eq:
+ case tk_gt:
+ case tk_ge:
+ size += gen_size(t[2])
+ size += gen_size(t[3])
+ size += 10
+ case tk_and:
+ case tk_or:
+ size += gen_size(t[2])
+ size += gen_size(t[3])
+ size += 15
+ case tk_add:
+ case tk_sub:
+ size += gen_size(t[2])
+ size += gen_size(t[3])
+ size += 4
+ case tk_mul:
+ size += gen_size(t[2])
+ size += gen_size(t[3])
+ size += 5
+ case tk_div:
+ case tk_mod:
+ size += gen_size(t[2])
+ size += gen_size(t[3])
+ size += 6
+ case tk_putc:
+ case tk_Printi:
+ case tk_Prints:
+ size += gen_size(t[2])
+ size += 5
+ case tk_if:
+ size += gen_size(t[2])+3
+ if t[3][1]!=tk_if then ?9/0 end if
+ integer truesize = gen_size(t[3][2])
+ integer falsesize = gen_size(t[3][3])
+ integer elsejmp = iff(falsesize=0?0:iff(falsesize>127?5:2))
+ integer mainjmp = iff(truesize+elsejmp>127?6:2)
+ size += mainjmp+truesize+elsejmp+falsesize
+ case tk_not:
+ size += gen_size(t[2])
+ size += 9
+ case tk_neg:
+ size += gen_size(t[2])
+ size += 4
+ else:
+ ?9/0
+ end switch
+ end if
+ return size
+end function
- procedure gen_rec ( object t )
- -- the recursive part of code_gen
- if t != NULL then
- integer initsize = length ( code )
- integer estsize = gen_size ( t ) -- (test the gen_size function)
- integer n_type = t [ 1 ]
- string node_type = tkNames [ n_type ]
- switch n_type do
- case tk_Sequence :
- gen_rec ( t [ 2 ])
- gen_rec ( t [ 3 ])
- case tk_assign :
- integer n = var_idx ( t [ 2 ])
- gen_rec ( t [ 3 ])
- code &= { 0o217 , 0o005 , chain , 1 , n , 0 } -- pop [i]
- chain = length ( code )- 3
- case tk_Integer :
- integer n = t [ 2 ]
- code &= 0o150 & int_to_bytes ( n ) -- push imm32
- case tk_while :
- -- emit: @@:<condition><topjmp(@f)><body><tailjmp(@b)>@@:
- integer looptop = length ( code )
- gen_rec ( t [ 2 ])
- code &= { 0o130 , -- pop eax
- 0o205 , 0o300 } -- test eax,eax
- integer bodysize = gen_size ( t [ 3 ])
- -- can we use short jumps?
- -- disclaimer: size calcs are not heavily tested; if in
- -- doubt reduce 128/7 by 8, and if that works
- -- then yep, you just found a boundary case.
- integer stail = iff ( length ( code )+ bodysize + 4 - looptop > 128 ? 5 : 2 )
- integer offset = bodysize + stail
- integer stop = iff ( offset > 127 ? 6 : 2 )
- if stop = 2 then
- code &= { 0o164 , offset } -- jz (short) end
- else
- code &= { 0o017 , 0o204 }& int_to_bytes ( offset ) -- jz (long) end
- end if
- gen_rec ( t [ 3 ])
- offset = looptop -( length ( code )+ stail )
- if stail = 2 then
- code &= 0o353 & offset -- jmp looptop (short)
- else
- code &= 0o351 & int_to_bytes ( offset ) -- jmp looptop (long)
- end if
- case tk_lt :
- case tk_le :
- case tk_gt :
- case tk_ge :
- case tk_ne :
- case tk_eq :
- gen_rec ( t [ 2 ])
- gen_rec ( t [ 3 ])
- integer xrm
- if n_type = tk_ne then xrm = 0o225 -- (#95)
- elsif n_type = tk_lt then xrm = 0o234 -- (#9C)
- elsif n_type = tk_ge then xrm = 0o235 -- (#9D)
- elsif n_type = tk_le then xrm = 0o236 -- (#9E)
- elsif n_type = tk_gt then xrm = 0o237 -- (#9F)
- else ? 9 / 0
- end if
- code &= { 0o061 , 0o300 , -- xor eax,eax
- 0o132 , -- pop edx
- 0o131 , -- pop ecx
- 0o071 , 0o321 , -- cmp ecx,edx
- 0o017 , xrm , 0o300 , -- setcc al
- 0o120 } -- push eax
- case tk_or :
- case tk_and :
- gen_rec ( t [ 2 ])
- gen_rec ( t [ 3 ])
- integer op = find ( n_type ,{ tk_or , 0 , 0 , tk_and })
- op *= 0o010
- code &= { 0o130 , -- pop eax
- 0o131 , -- pop ecx
- 0o205 , 0o300 , -- test eax,eax
- 0o017 , 0o225 , 0o300 , -- setne al
- 0o205 , 0o311 , -- test ecx,ecx
- 0o017 , 0o225 , 0o301 , -- setne cl
- op , 0o310 , -- or/and al,cl
- 0o120 } -- push eax
- case tk_add :
- case tk_sub :
- gen_rec ( t [ 2 ])
- gen_rec ( t [ 3 ])
- integer op = find ( n_type ,{ tk_add , 0 , 0 , 0 , 0 , tk_sub })
- op = 0o001 + ( op - 1 )* 0o010
- code &= { 0o130 , -- pop eax
- op , 0o004 , 0o044 } -- add/or/and/sub [esp],eax
- case tk_mul :
- gen_rec ( t [ 2 ])
- gen_rec ( t [ 3 ])
- code &= { 0o131 , -- pop ecx
- 0o130 , -- pop eax
- 0o367 , 0o341 , -- mul ecx
- 0o120 } -- push eax
- case tk_div :
- case tk_mod :
- gen_rec ( t [ 2 ])
- gen_rec ( t [ 3 ])
- integer push = 0o120 +( n_type = tk_mod )* 2
- code &= { 0o131 , -- pop ecx
- 0o130 , -- pop eax
- 0o231 , -- cdq (eax -> edx:eax)
- 0o367 , 0o371 , -- idiv ecx
- push } -- push eax|edx
- case tk_Identifier :
- integer n = var_idx ( t )
- code &= { 0o377 , 0o065 , chain , 1 , n , 0 } -- push [n]
- chain = length ( code )- 3
- case tk_putc :
- case tk_Printi :
- case tk_Prints :
- gen_rec ( t [ 2 ])
- integer n = find ( n_type ,{ tk_putc , tk_Printi , tk_Prints })
- code &= { 0o350 , chain , 3 , n , 0 } -- call :printc/i/s
- chain = length ( code )- 3
- case tk_String :
- integer n = string_idx ( t )
- code &= { 0o150 , chain , 2 , n , 0 } -- push RawStringPtr(string)
- chain = length ( code )- 3
- case tk_if :
- -- emit: <condition><mainjmp><truepart>[<elsejmp><falsepart>]
- gen_rec ( t [ 2 ])
- code &= { 0o130 , -- pop eax
- 0o205 , 0o300 } -- test eax,eax
- if t [ 3 ][ 1 ]!= tk_if then ? 9 / 0 end if
- integer truesize = gen_size ( t [ 3 ][ 2 ])
- integer falsesize = gen_size ( t [ 3 ][ 3 ])
- integer elsejmp = iff ( falsesize = 0 ? 0 : iff ( falsesize > 127 ? 5 : 2 ))
- integer offset = truesize + elsejmp
- integer mainjmp = iff ( offset > 127 ? 6 : 2 )
- if mainjmp = 2 then
- code &= { 0o164 , offset } -- jz (short) else/end
- else
- code &= { 0o017 , 0o204 }& int_to_bytes ( offset ) -- jz (long) else/end
- end if
- gen_rec ( t [ 3 ][ 2 ])
- if falsesize != 0 then
- offset = falsesize
- if elsejmp = 2 then
- code &= 0o353 & offset -- jmp end if (short)
- else
- code &= 0o351 & int_to_bytes ( offset ) -- jmp end if (long)
- end if
- gen_rec ( t [ 3 ][ 3 ])
- end if
- case tk_not :
- gen_rec ( t [ 2 ])
- code &= { 0o132 , -- pop edx
- 0o061 , 0o300 , -- xor eax,eax
- 0o205 , 0o322 , -- test edx,edx
- 0o017 , 0o224 , 0o300 , -- setz al
- 0o120 } -- push eax
- case tk_neg :
- gen_rec ( t [ 2 ])
- code &= { 0o130 , -- pop eax
- 0o367 , 0o330 , -- neg eax
- 0o120 } -- push eax
- else :
- error ( "error in code generator - found %d, expecting operator\n" , { n_type })
- end switch
- integer actsize = length ( code )
- if initsize + estsize != actsize then ? "9/0" end if -- (test gen_size)
- end if
- end procedure
+procedure gen_rec(object t)
+-- the recursive part of code_gen
+ if t!=NULL then
+ integer initsize = length(code)
+ integer estsize = gen_size(t) -- (test the gen_size function)
+ integer n_type = t[1]
+ string node_type = tkNames[n_type]
+ switch n_type do
+ case tk_Sequence:
+ gen_rec(t[2])
+ gen_rec(t[3])
+ case tk_assign:
+ integer n = var_idx(t[2])
+ gen_rec(t[3])
+ code &= {0o217,0o005,chain,1,n,0} -- pop [i]
+ chain = length(code)-3
+ case tk_Integer:
+ integer n = t[2]
+ code &= 0o150&int_to_bytes(n) -- push imm32
+ case tk_while:
+ -- emit: @@:@@:
+ integer looptop = length(code)
+ gen_rec(t[2])
+ code &= {0o130, -- pop eax
+ 0o205,0o300} -- test eax,eax
+ integer bodysize = gen_size(t[3])
+ -- can we use short jumps?
+ -- disclaimer: size calcs are not heavily tested; if in
+ -- doubt reduce 128/7 by 8, and if that works
+ -- then yep, you just found a boundary case.
+ integer stail = iff(length(code)+bodysize+4-looptop>128?5:2)
+ integer offset = bodysize+stail
+ integer stop = iff(offset>127?6:2)
+ if stop=2 then
+ code &= {0o164,offset} -- jz (short) end
+ else
+ code &= {0o017,0o204}&int_to_bytes(offset) -- jz (long) end
+ end if
+ gen_rec(t[3])
+ offset = looptop-(length(code)+stail)
+ if stail=2 then
+ code &= 0o353&offset -- jmp looptop (short)
+ else
+ code &= 0o351&int_to_bytes(offset) -- jmp looptop (long)
+ end if
+ case tk_lt:
+ case tk_le:
+ case tk_gt:
+ case tk_ge:
+ case tk_ne:
+ case tk_eq:
+ gen_rec(t[2])
+ gen_rec(t[3])
+ integer xrm
+ if n_type=tk_ne then xrm = 0o225 -- (#95)
+ elsif n_type=tk_lt then xrm = 0o234 -- (#9C)
+ elsif n_type=tk_ge then xrm = 0o235 -- (#9D)
+ elsif n_type=tk_le then xrm = 0o236 -- (#9E)
+ elsif n_type=tk_gt then xrm = 0o237 -- (#9F)
+ else ?9/0
+ end if
+ code &= { 0o061,0o300, -- xor eax,eax
+ 0o132, -- pop edx
+ 0o131, -- pop ecx
+ 0o071,0o321, -- cmp ecx,edx
+ 0o017,xrm,0o300, -- setcc al
+ 0o120} -- push eax
+ case tk_or:
+ case tk_and:
+ gen_rec(t[2])
+ gen_rec(t[3])
+ integer op = find(n_type,{tk_or,0,0,tk_and})
+ op *= 0o010
+ code &= { 0o130, -- pop eax
+ 0o131, -- pop ecx
+ 0o205,0o300, -- test eax,eax
+ 0o017,0o225,0o300, -- setne al
+ 0o205,0o311, -- test ecx,ecx
+ 0o017,0o225,0o301, -- setne cl
+ op,0o310, -- or/and al,cl
+ 0o120} -- push eax
+ case tk_add:
+ case tk_sub:
+ gen_rec(t[2])
+ gen_rec(t[3])
+ integer op = find(n_type,{tk_add,0,0,0,0,tk_sub})
+ op = 0o001 + (op-1)*0o010
+ code &= { 0o130, -- pop eax
+ op,0o004,0o044} -- add/or/and/sub [esp],eax
+ case tk_mul:
+ gen_rec(t[2])
+ gen_rec(t[3])
+ code &= { 0o131, -- pop ecx
+ 0o130, -- pop eax
+ 0o367,0o341, -- mul ecx
+ 0o120} -- push eax
+ case tk_div:
+ case tk_mod:
+ gen_rec(t[2])
+ gen_rec(t[3])
+ integer push = 0o120+(n_type=tk_mod)*2
+ code &= { 0o131, -- pop ecx
+ 0o130, -- pop eax
+ 0o231, -- cdq (eax -> edx:eax)
+ 0o367,0o371, -- idiv ecx
+ push} -- push eax|edx
+ case tk_Identifier:
+ integer n = var_idx(t)
+ code &= {0o377,0o065,chain,1,n,0} -- push [n]
+ chain = length(code)-3
+ case tk_putc:
+ case tk_Printi:
+ case tk_Prints:
+ gen_rec(t[2])
+ integer n = find(n_type,{tk_putc,tk_Printi,tk_Prints})
+ code &= {0o350,chain,3,n,0} -- call :printc/i/s
+ chain = length(code)-3
+ case tk_String:
+ integer n = string_idx(t)
+ code &= {0o150,chain,2,n,0} -- push RawStringPtr(string)
+ chain = length(code)-3
+ case tk_if:
+ -- emit: []
+ gen_rec(t[2])
+ code &= {0o130, -- pop eax
+ 0o205,0o300} -- test eax,eax
+ if t[3][1]!=tk_if then ?9/0 end if
+ integer truesize = gen_size(t[3][2])
+ integer falsesize = gen_size(t[3][3])
+ integer elsejmp = iff(falsesize=0?0:iff(falsesize>127?5:2))
+ integer offset = truesize+elsejmp
+ integer mainjmp = iff(offset>127?6:2)
+ if mainjmp=2 then
+ code &= {0o164,offset} -- jz (short) else/end
+ else
+ code &= {0o017,0o204}&int_to_bytes(offset) -- jz (long) else/end
+ end if
+ gen_rec(t[3][2])
+ if falsesize!=0 then
+ offset = falsesize
+ if elsejmp=2 then
+ code &= 0o353&offset -- jmp end if (short)
+ else
+ code &= 0o351&int_to_bytes(offset) -- jmp end if (long)
+ end if
+ gen_rec(t[3][3])
+ end if
+ case tk_not:
+ gen_rec(t[2])
+ code &= {0o132, -- pop edx
+ 0o061,0o300, -- xor eax,eax
+ 0o205,0o322, -- test edx,edx
+ 0o017,0o224,0o300, -- setz al
+ 0o120} -- push eax
+ case tk_neg:
+ gen_rec(t[2])
+ code &= {0o130, -- pop eax
+ 0o367,0o330, -- neg eax
+ 0o120} -- push eax
+ else:
+ error("error in code generator - found %d, expecting operator\n", {n_type})
+ end switch
+ integer actsize = length(code)
+ if initsize+estsize!=actsize then ?"9/0" end if -- (test gen_size)
+ end if
+end procedure
- global procedure code_gen ( object t )
- --
- -- Generates proper machine code.
- --
- -- Example: i=10; print "\n"; print i; print "\n"
- -- Result in vars, strings, chain, code (declared above)
- -- where vars is: {"i"},
- -- strings is {"\n"},
- -- code is { 0o150,#0A,#00,#00,#00, -- 1: push 10
- -- 0o217,0o005,0,1,1,0 -- 6: pop [i]
- -- 0o150,8,2,1,0, -- 12: push ("\n")
- -- 0o350,13,3,3,0, -- 17: call :prints
- -- 0o377,0o065,18,1,1,0, -- 22: push [i]
- -- 0o350,24,3,2,0, -- 28: call :printi
- -- 0o150,29,2,1,0, -- 33: push ("\n")
- -- 0o350,34,3,3,0, -- 38: call :prints
- -- 0o303} -- 43: ret
- -- and chain is 39 (->34->29->24->18->13->8->0)
- -- The chain connects all places where we need an actual address before
- -- the code is executed, with the byte after the link differentiating
- -- between var(1), string(2), and builtin(3), and the byte after that
- -- determining the instance of the given type - not that any of them
- -- are actually limited to a byte in the above intermediate form, and
- -- of course the trailing 0 of each {link,type,id,0} is just there to
- -- reserve the space we will need.
- --
- gen_rec ( t )
- code = append ( code , 0o303 ) -- ret (0o303=#C3)
- end procedure
+global procedure code_gen(object t)
+--
+-- Generates proper machine code.
+--
+-- Example: i=10; print "\n"; print i; print "\n"
+-- Result in vars, strings, chain, code (declared above)
+-- where vars is: {"i"},
+-- strings is {"\n"},
+-- code is { 0o150,#0A,#00,#00,#00, -- 1: push 10
+-- 0o217,0o005,0,1,1,0 -- 6: pop [i]
+-- 0o150,8,2,1,0, -- 12: push ("\n")
+-- 0o350,13,3,3,0, -- 17: call :prints
+-- 0o377,0o065,18,1,1,0, -- 22: push [i]
+-- 0o350,24,3,2,0, -- 28: call :printi
+-- 0o150,29,2,1,0, -- 33: push ("\n")
+-- 0o350,34,3,3,0, -- 38: call :prints
+-- 0o303} -- 43: ret
+-- and chain is 39 (->34->29->24->18->13->8->0)
+-- The chain connects all places where we need an actual address before
+-- the code is executed, with the byte after the link differentiating
+-- between var(1), string(2), and builtin(3), and the byte after that
+-- determining the instance of the given type - not that any of them
+-- are actually limited to a byte in the above intermediate form, and
+-- of course the trailing 0 of each {link,type,id,0} is just there to
+-- reserve the space we will need.
+--
+ gen_rec(t)
+ code = append(code,0o303) -- ret (0o303=#C3)
+end procedure
- include builtins / VM / puts1 . e -- low-level console i/o routines
+include builtins/VM/puts1.e -- low-level console i/o routines
- function setbuiltins ()
- atom printc , printi , prints
- #ilASM{
- jmp :setbuiltins
- ::printc
- lea edi,[esp+4]
- mov esi,1
- call :%puts1ediesi -- (edi=raw text, esi=length)
- ret 4
- ::printi
- mov eax,[esp+4]
- push 0 -- no cr
- call :%putsint -- (nb limited to +/-9,999,999,999)
- ret 4
- ::prints
- mov edi,[esp+4]
- mov esi,[edi-12]
- call :%puts1ediesi -- (edi=raw text, esi=length)
- ret 4
- ::setbuiltins
- mov eax,:printc
- lea edi,[printc]
- call :%pStoreMint
- mov eax,:printi
- lea edi,[printi]
- call :%pStoreMint
- mov eax,:prints
- lea edi,[prints]
- call :%pStoreMint
- }
- return { printc , printi , prints }
- end function
+function setbuiltins()
+atom printc,printi,prints
+ #ilASM{
+ jmp :setbuiltins
+ ::printc
+ lea edi,[esp+4]
+ mov esi,1
+ call :%puts1ediesi -- (edi=raw text, esi=length)
+ ret 4
+ ::printi
+ mov eax,[esp+4]
+ push 0 -- no cr
+ call :%putsint -- (nb limited to +/-9,999,999,999)
+ ret 4
+ ::prints
+ mov edi,[esp+4]
+ mov esi,[edi-12]
+ call :%puts1ediesi -- (edi=raw text, esi=length)
+ ret 4
+ ::setbuiltins
+ mov eax,:printc
+ lea edi,[printc]
+ call :%pStoreMint
+ mov eax,:printi
+ lea edi,[printi]
+ call :%pStoreMint
+ mov eax,:prints
+ lea edi,[prints]
+ call :%pStoreMint
+ }
+ return {printc,printi,prints}
+end function
- global constant builtin_names = { "printc" , "printi" , "prints" }
- global constant builtins = setbuiltins ()
+global constant builtin_names = {"printc","printi","prints"}
+global constant builtins = setbuiltins()
- global atom var_mem , code_mem
+global atom var_mem, code_mem
- function RawStringPtr ( integer n ) -- (based on IupRawStringPtr from pGUI.e)
- --
- -- Returns a raw string pointer for s, somewhat like allocate_string(s), but using the existing memory.
- -- NOTE: The return is only valid as long as the value passed as the parameter remains in existence.
- --
- atom res
- string s = strings [ n ]
- #ilASM{
- mov eax,[s]
- lea edi,[res]
- shl eax,2
- call :%pStoreMint
- }
- stringptrs [ n ] = res
- return res
- end function
+function RawStringPtr(integer n) -- (based on IupRawStringPtr from pGUI.e)
+--
+-- Returns a raw string pointer for s, somewhat like allocate_string(s), but using the existing memory.
+-- NOTE: The return is only valid as long as the value passed as the parameter remains in existence.
+--
+atom res
+ string s = strings[n]
+ #ilASM{
+ mov eax,[s]
+ lea edi,[res]
+ shl eax,2
+ call :%pStoreMint
+ }
+ stringptrs[n] = res
+ return res
+end function
- global procedure fixup ()
- var_mem = allocate ( length ( vars )* 4 )
- mem_set ( var_mem , 0 , length ( vars )* 4 )
- code_mem = allocate ( length ( code ))
- poke ( code_mem , code )
- while chain != 0 do
- integer this = chain
- chain = code [ this ]
- integer ftype = code [ this + 1 ]
- integer id = code [ this + 2 ]
- switch ftype do
- case 1 : -- vars
- poke4 ( code_mem + this - 1 , var_mem +( id - 1 )* 4 )
- case 2 : -- strings
- poke4 ( code_mem + this - 1 , RawStringPtr ( id ))
- case 3 : -- builtins
- poke4 ( code_mem + this - 1 , builtins [ id ]-( code_mem + this + 3 ))
- end switch
- end while
- end procedure
-
- --
- -- demo\rosetta\Compiler\cgen.exw
- -- ==============================
- --
- -- Generates 32-bit machine code (see note in vm.exw)
- --
- without js -- (machine code!)
- include cgen . e
+-- demo\rosetta\Compiler\cgen.exw
+-- Generates 32-bit machine code (see note in vm.exw)
+without js -- (machine code!)
+include cgen.e
- function get_var_name ( atom addr )
- integer n = ( addr - var_mem )/ 4 + 1
- if n < 1 or n > length ( vars ) then ? 9 / 0 end if
- return vars [ n ]
- end function
+function get_var_name(atom addr)
+ integer n = (addr-var_mem)/4+1
+ if n<1 or n>length(vars) then ?9/0 end if
+ return vars[n]
+end function
- function hxl ( integer pc , object oh , string fmt , sequence args ={})
- -- helper routine to display the octal/hex bytes just decoded,
- -- along with the code offset and the human-readable text.
- if length ( args ) then fmt = sprintf ( fmt , args ) end if
- sequence octhex = {}
- atom base = code_mem + pc
- integer len = 0
- if integer ( oh ) then -- all octal
- for i = 1 to oh do
- octhex = append ( octhex , sprintf ( "0o%03o" , peek ( base )))
- base += 1
- end for
- len = oh
- else -- some octal and some hex
- for i = 1 to length ( oh ) by 2 do
- for j = 1 to oh [ i ] do
- octhex = append ( octhex , sprintf ( "0o%03o" , peek ( base )))
- base += 1
- end for
- len += oh [ i ]
- for j = 1 to oh [ i + 1 ] do
- octhex = append ( octhex , sprintf ( "#%02x" , peek ( base )))
- base += 1
- end for
- len += oh [ i + 1 ]
- end for
- end if
- printf ( output_file , "%4d: %-30s %s\n" ,{ pc + 1 , join ( octhex , "," ), fmt })
- return len
- end function
+function hxl(integer pc, object oh, string fmt, sequence args={})
+-- helper routine to display the octal/hex bytes just decoded,
+-- along with the code offset and the human-readable text.
+ if length(args) then fmt = sprintf(fmt,args) end if
+ sequence octhex = {}
+ atom base = code_mem+pc
+ integer len = 0
+ if integer(oh) then -- all octal
+ for i=1 to oh do
+ octhex = append(octhex,sprintf("0o%03o",peek(base)))
+ base += 1
+ end for
+ len = oh
+ else -- some octal and some hex
+ for i=1 to length(oh) by 2 do
+ for j=1 to oh[i] do
+ octhex = append(octhex,sprintf("0o%03o",peek(base)))
+ base += 1
+ end for
+ len += oh[i]
+ for j=1 to oh[i+1] do
+ octhex = append(octhex,sprintf("#%02x",peek(base)))
+ base += 1
+ end for
+ len += oh[i+1]
+ end for
+ end if
+ printf(output_file,"%4d: %-30s %s\n",{pc+1,join(octhex,","),fmt})
+ return len
+end function
- constant cccodes = { "o?" , "no?" , "b?" , "ae?" , "z" , "ne" , "be?" , "a?" ,
- -- 0 , 1 , 2 , 3 , 4 , 5 , 6 , 7 ,
- "s?" , "ns?" , "pe?" , "po?" , "l" , "ge" , "le" , "g" }
- -- 8 , 9 , 10 , 11 , 12 , 13 , 14 , 15
+constant cccodes = {"o?" ,"no?","b?" ,"ae?","z" ,"ne" ,"be?","a?",
+-- 0 , 1 , 2 , 3 , 4 , 5 , 6 , 7 ,
+ "s?" ,"ns?","pe?","po?","l" ,"ge" ,"le" ,"g" }
+-- 8 , 9 , 10 , 11 , 12 , 13 , 14 , 15
- constant regs = { "eax" , "ecx" , "edx" } -- (others as/when needed)
+constant regs = {"eax","ecx","edx"} -- (others as/when needed)
- procedure decode ()
- -- for a much more complete (and better organised) disassembler, see p2asm.e
- integer pc = 0 , -- nb 0-based
- opcode , xrm
+procedure decode()
+-- for a much more complete (and better organised) disassembler, see p2asm.e
+integer pc = 0, -- nb 0-based
+ opcode, xrm
- while pc < length ( code ) do
- opcode = peek ( code_mem + pc )
- xrm = - 1
- switch opcode do
- case 0o150 :
- atom vaddr = peek4s ( code_mem + pc + 1 )
- integer n = find ( vaddr , stringptrs )
- object arg = iff ( n ? enquote ( strings [ n ])
- : sprintf ( "%d" , vaddr ))
- pc += hxl ( pc ,{ 1 , 4 }, "push %s" ,{ arg })
- case 0o217 :
- case 0o377 :
- integer n = find ( opcode ,{ 0o217 , 0o377 })
- string op = { "pop" , "push" }[ n ]
- xrm = peek ( code_mem + pc + 1 )
- if n != find ( xrm ,{ 0o005 , 0o065 }) then exit end if
- atom addr = peek4u ( code_mem + pc + 2 )
- pc += hxl ( pc ,{ 2 , 4 }, "%s [%s]" ,{ op , get_var_name ( addr )})
- case 0o061 :
- case 0o071 :
- case 0o205 :
- integer n = find ( opcode ,{ 0o061 , 0o071 , 0o205 })
- string op = { "xor" , "cmp" , "test" }[ n ]
- xrm = peek ( code_mem + pc + 1 )
- if and_bits ( xrm , 0o300 )!= 0o300 then exit end if
- string r1 = regs [ and_bits ( xrm , 0o070 )/ 0o010 + 1 ]
- string r2 = regs [ and_bits ( xrm , 0o007 )+ 1 ]
- pc += hxl ( pc , 2 , "%s %s,%s" ,{ op , r1 , r2 })
- case 0o017 :
- xrm = peek ( code_mem + pc + 1 )
- switch xrm do
- case 0o224 :
- case 0o225 :
- case 0o234 :
- case 0o235 :
- case 0o236 :
- case 0o237 :
- string cc = cccodes [ and_bits ( xrm , 0o017 )+ 1 ]
- xrm = peek ( code_mem + pc + 2 )
- if xrm = 0o300 then
- pc += hxl ( pc , 3 , "set%s al" ,{ cc })
- elsif xrm = 0o301 then
- pc += hxl ( pc , 3 , "set%s cl" ,{ cc })
- else
- exit
- end if
- case 0o204 :
- integer offset = peek4s ( code_mem + pc + 2 )
- pc += hxl ( pc ,{ 2 , 4 }, "jz %d" ,{ pc + 6 + offset + 1 })
- else
- exit
- end switch
- case 0o010 :
- case 0o040 :
- xrm = peek ( code_mem + pc + 1 )
- if xrm = 0o310 then
- string lop = { "or" , "and" }[ find ( opcode ,{ 0o010 , 0o040 })]
- pc += hxl ( pc , 2 , "%s al,cl" ,{ lop })
- else
- exit
- end if
- case 0o120 :
- case 0o122 :
- case 0o130 :
- case 0o131 :
- case 0o132 :
- string op = { "push" , "pop" }[ find ( and_bits ( opcode , 0o070 ),{ 0o020 , 0o030 })]
- string reg = regs [ and_bits ( opcode , 0o007 )+ 1 ]
- pc += hxl ( pc , 1 , "%s %s" ,{ op , reg })
- case 0o231 :
- pc += hxl ( pc , 1 , "cdq" )
- case 0o164 :
- case 0o353 :
- string jop = iff ( opcode = 0o164 ? "jz" : "jmp" )
- integer offset = peek1s ( code_mem + pc + 1 )
- pc += hxl ( pc ,{ 1 , 1 }, "%s %d" ,{ jop , pc + 2 + offset + 1 })
- case 0o351 :
- integer offset = peek4s ( code_mem + pc + 1 )
- pc += hxl ( pc ,{ 1 , 4 }, "jmp %d" ,{ pc + 5 + offset + 1 })
- case 0o303 :
- pc += hxl ( pc , 1 , "ret" )
- case 0o350 :
- integer offset = peek4s ( code_mem + pc + 1 )
- atom addr = offset + code_mem + pc + 5
- integer n = find ( addr , builtins )
- pc += hxl ( pc ,{ 1 , 4 }, "call :%s" ,{ builtin_names [ n ]})
- case 0o001 :
- case 0o041 :
- case 0o051 :
- integer n = find ( opcode ,{ 0o001 , 0o041 , 0o051 })
- string op = { "add" , "and" , "sub" }[ n ]
- xrm = peek ( code_mem + pc + 1 )
- switch xrm do
- case 0o004 :
- if peek ( code_mem + pc + 2 )= 0o044 then
- pc += hxl ( pc , 3 , "%s [esp],eax" ,{ op })
- else
- exit
- end if
- else
- exit
- end switch
- case 0o367 :
- xrm = peek ( code_mem + pc + 1 )
- if and_bits ( xrm , 0o300 )!= 0o300 then exit end if
- integer n = find ( and_bits ( xrm , 0o070 ),{ 0o030 , 0o040 , 0o070 })
- if n = 0 then exit end if
- string op = { "neg" , "mul" , "idiv" }[ n ]
- string reg = regs [ and_bits ( xrm , 0o007 )+ 1 ]
- pc += hxl ( pc , 2 , "%s %s" ,{ op , reg })
- else
- exit
- end switch
- end while
- if pc < length ( code ) then
- ? "incomplete:"
- if xrm =- 1 then
- ?{ pc + 1 , sprintf ( "0o%03o" , opcode )}
- else
- ?{ pc + 1 , sprintf ( "0o%03o 0o%03o" ,{ opcode , xrm })}
- end if
- end if
- end procedure
+ while pcprocedure main ( sequence cl )
- open_files ( cl )
- toks = lex ()
- object t = parse ()
- code_gen ( t )
- fixup ()
- decode ()
- free ({ var_mem , code_mem })
- close_files ()
- end procedure
+procedure main(sequence cl)
+ open_files(cl)
+ toks = lex()
+ object t = parse()
+ code_gen(t)
+ fixup()
+ decode()
+ free({var_mem,code_mem})
+ close_files()
+end procedure
- --main(command_line())
- main ({ 0 , 0 , "gcd.c" })
-
- --
- -- demo\rosetta\Compiler\core.e
- -- ============================
- --
- -- Standard declarations and routines used by lex.exw, parse.exw, cgen.exw, and interp.exw
- -- (included in distribution as above, which contains some additional sanity checks)
- --
- with javascript_semantics
- global constant EOF = - 1 , STDIN = 0 , STDOUT = 1
+-- demo\rosetta\Compiler\core.e
+-- Standard declarations and routines used by lex.exw, parse.exw, cgen.exw, and interp.exw
+-- (included in distribution as above, which contains some additional sanity checks)
+with javascript_semantics
+global constant EOF = -1, STDIN = 0, STDOUT = 1
- global enum NONE = 0 , UNARY = 1 , BINARY = 2
- global type nary ( integer n ) return n = NONE or n = UNARY or n = BINARY end type
+global enum NONE=0, UNARY=1, BINARY=2
+global type nary(integer n) return n=NONE or n=UNARY or n=BINARY end type
- global sequence tkNames = {} -- eg/ie {"Op_multiply","Op_divide",..}
- global sequence precedences = {}
- global sequence narys = {} -- NONE/UNARY/BINARY
- global sequence operators = {} -- eg/ie {"*","/","+","-","<","<=",..}
- global sequence opcodes = {} -- idx to tkNames, matching operators
+global sequence tkNames = {} -- eg/ie {"Op_multiply","Op_divide",..}
+global sequence precedences = {}
+global sequence narys = {} -- NONE/UNARY/BINARY
+global sequence operators = {} -- eg/ie {"*","/","+","-","<","<=",..}
+global sequence opcodes = {} -- idx to tkNames, matching operators
- global constant KEYWORDS = new_dict () -- eg/ie {"if"=>idx to tkNames}
+global constant KEYWORDS = new_dict() -- eg/ie {"if"=>idx to tkNames}
- global enum OPERATOR = 1 , DIGIT , LETTER -- character classes
+global enum OPERATOR=1, DIGIT, LETTER -- character classes
- global sequence charmap = repeat ( 0 , 255 )
- charmap [ '0' .. '9' ] = DIGIT
- charmap [ 'A' .. 'Z' ] = LETTER
- charmap [ 'a' .. 'z' ] = LETTER
- charmap [ '_' ] = LETTER
+global sequence charmap = repeat(0,255)
+ charmap['0'..'9'] = DIGIT
+ charmap['A'..'Z'] = LETTER
+ charmap['a'..'z'] = LETTER
+ charmap['_'] = LETTER
- function tkName ( string s , nary n = NONE , integer precedence = - 1 )
- tkNames = append ( tkNames , s )
- narys = append ( narys , n )
- precedences = append ( precedences , precedence )
- return length ( tkNames )
- end function
+function tkName(string s, nary n = NONE, integer precedence = -1)
+ tkNames = append(tkNames,s)
+ narys = append(narys,n)
+ precedences = append(precedences,precedence)
+ return length(tkNames)
+end function
- function tkOp ( string s , string op , nary n , integer precedence )
- integer res = tkName ( s , n , precedence )
- operators = append ( operators , op )
- opcodes = append ( opcodes , res )
- for i = 1 to length ( op ) do
- charmap [ op [ i ]] = OPERATOR
- end for
- return res
- end function
+function tkOp(string s, string op, nary n, integer precedence)
+ integer res = tkName(s, n, precedence)
+ operators = append(operators,op)
+ opcodes = append(opcodes,res)
+ for i=1 to length(op) do
+ charmap[op[i]] = OPERATOR
+ end for
+ return res
+end function
- function tkKw ( string s , string keyword )
- integer res = tkName ( s )
- putd ( keyword , res , KEYWORDS )
- return res
- end function
+function tkKw(string s, string keyword)
+ integer res = tkName(s)
+ putd(keyword, res, KEYWORDS)
+ return res
+end function
- global constant
- tk_EOI = tkName ( "End_of_input" ), --1
- tk_mul = tkOp ( "Op_multiply" , "*" , BINARY , 13 ), --2
- tk_div = tkOp ( "Op_divide" , "/" , BINARY , 13 ), --3
- tk_mod = tkOp ( "Op_mod" , "%" , BINARY , 13 ), --4
- tk_add = tkOp ( "Op_add" , "+" , BINARY , 12 ), --5
- tk_sub = tkOp ( "Op_subtract" , "-" , BINARY , 12 ), --6
- tk_neg = tkName ( "Op_negate" , UNARY , 14 ), --7
- tk_not = tkOp ( "Op_not" , "!" , UNARY , 14 ), --8
- tk_lt = tkOp ( "Op_less" , "<" , BINARY , 10 ), --9
- tk_le = tkOp ( "Op_lessequal" , "<=" , BINARY , 10 ), --10
- tk_gt = tkOp ( "Op_greater" , ">" , BINARY , 10 ), --11
- tk_ge = tkOp ( "Op_greaterequal" , ">=" , BINARY , 10 ), --12
- tk_eq = tkOp ( "Op_equal" , "==" , BINARY , 9 ), --13
- tk_ne = tkOp ( "Op_notequal" , "!=" , BINARY , 9 ), --14
- tk_assign = tkOp ( "Op_assign" , "=" , NONE , - 1 ), --15
- tk_and = tkOp ( "Op_and" , "&&" , BINARY , 5 ), --16
- tk_or = tkOp ( "Op_or" , "||" , BINARY , 4 ), --17
- tk_if = tkKw ( "Keyword_if" , "if" ), --18
- tk_else = tkKw ( "Keyword_else" , "else" ), --19
- tk_while = tkKw ( "Keyword_while" , "while" ), --20
- tk_print = tkKw ( "Keyword_print" , "print" ), --21
- tk_putc = tkKw ( "Keyword_putc" , "putc" ), --22
- tk_LeftParen = tkOp ( "LeftParen" , "(" , NONE , - 1 ), --23
- tk_RightParen = tkOp ( "RightParen" , ")" , NONE , - 1 ), --24
- tk_LeftBrace = tkOp ( "LeftBrace" , "{" , NONE , - 1 ), --25
- tk_RightBrace = tkOp ( "RightBrace" , "}" , NONE , - 1 ), --26
- tk_Semicolon = tkOp ( "Semicolon" , ";" , NONE , - 1 ), --27
- tk_Comma = tkOp ( "Comma" , "," , NONE , - 1 ), --28
- tk_Identifier = tkName ( "Identifier" ), --29
- tk_Integer = tkName ( "Integer" ), --30
- tk_String = tkName ( "String" ), --31
- tk_Sequence = tkName ( "Sequence" ), --32
- tk_Prints = tkName ( "tk_Prints" ), --33
- tk_Printi = tkName ( "tk_Printi" ) --34
+global constant
+ tk_EOI = tkName("End_of_input"), --1
+ tk_mul = tkOp("Op_multiply", "*", BINARY,13), --2
+ tk_div = tkOp("Op_divide", "/", BINARY,13), --3
+ tk_mod = tkOp("Op_mod", "%", BINARY,13), --4
+ tk_add = tkOp("Op_add", "+", BINARY,12), --5
+ tk_sub = tkOp("Op_subtract", "-", BINARY,12), --6
+ tk_neg = tkName("Op_negate", UNARY, 14), --7
+ tk_not = tkOp("Op_not", "!", UNARY, 14), --8
+ tk_lt = tkOp("Op_less", "<", BINARY,10), --9
+ tk_le = tkOp("Op_lessequal", "<=",BINARY,10), --10
+ tk_gt = tkOp("Op_greater", ">", BINARY,10), --11
+ tk_ge = tkOp("Op_greaterequal", ">=",BINARY,10), --12
+ tk_eq = tkOp("Op_equal", "==",BINARY, 9), --13
+ tk_ne = tkOp("Op_notequal", "!=",BINARY, 9), --14
+ tk_assign = tkOp("Op_assign", "=", NONE, -1), --15
+ tk_and = tkOp("Op_and", "&&",BINARY, 5), --16
+ tk_or = tkOp("Op_or", "||",BINARY, 4), --17
+ tk_if = tkKw("Keyword_if", "if"), --18
+ tk_else = tkKw("Keyword_else", "else"), --19
+ tk_while = tkKw("Keyword_while","while"), --20
+ tk_print = tkKw("Keyword_print","print"), --21
+ tk_putc = tkKw("Keyword_putc", "putc"), --22
+ tk_LeftParen = tkOp("LeftParen", "(", NONE, -1), --23
+ tk_RightParen = tkOp("RightParen", ")", NONE, -1), --24
+ tk_LeftBrace = tkOp("LeftBrace", "{", NONE, -1), --25
+ tk_RightBrace = tkOp("RightBrace", "}", NONE, -1), --26
+ tk_Semicolon = tkOp("Semicolon", ";", NONE, -1), --27
+ tk_Comma = tkOp("Comma", ",", NONE, -1), --28
+ tk_Identifier = tkName("Identifier"), --29
+ tk_Integer = tkName("Integer"), --30
+ tk_String = tkName("String"), --31
+ tk_Sequence = tkName("Sequence"), --32
+ tk_Prints = tkName("tk_Prints"), --33
+ tk_Printi = tkName("tk_Printi") --34
- global integer input_file = STDIN ,
- output_file = STDOUT
+global integer input_file = STDIN,
+ output_file = STDOUT
- type strint ( object o )
- return string ( o ) or integer ( o )
- end type
+type strint(object o)
+ return string(o) or integer(o)
+end type
- global strint tok_line , -- save of line/col at the start of
- tok_col -- token/comment, for result/errors
+global strint tok_line, -- save of line/col at the start of
+ tok_col -- token/comment, for result/errors
- global object oneline = ""
+global object oneline = ""
- constant errfmt = "Line %s column %s:\n%s%s"
+constant errfmt = "Line %s column %s:\n%s%s"
- function errline ()
- oneline = substitute ( trim ( oneline , "\r\n" ), '\t' , ' ' )
- string padding = repeat ( ' ' , tok_col )
- return sprintf ( "%s\n%s^ " ,{ oneline , padding })
- end function
+function errline()
+ oneline = substitute(trim(oneline,"\r\n"),'\t',' ')
+ string padding = repeat(' ',tok_col)
+ return sprintf("%s\n%s^ ",{oneline,padding})
+end function
- global procedure error ( sequence msg , sequence args ={})
- if length ( args ) then
- msg = sprintf ( msg , args )
- end if
- string el = iff ( atom ( oneline )? "" : errline ())
- if integer ( tok_line ) then tok_line = sprintf ( "%d" , tok_line ) end if
- if integer ( tok_col ) then tok_col = sprintf ( "%d" , tok_col ) end if
- printf ( STDOUT , errfmt ,{ tok_line , tok_col , el , msg })
- {} = wait_key ()
- abort ( 1 )
- end procedure
+global procedure error(sequence msg, sequence args={})
+ if length(args) then
+ msg = sprintf(msg,args)
+ end if
+ string el = iff(atom(oneline)?"":errline())
+ if integer(tok_line) then tok_line = sprintf("%d",tok_line) end if
+ if integer(tok_col) then tok_col = sprintf("%d",tok_col) end if
+ printf(STDOUT,errfmt,{tok_line,tok_col,el,msg})
+ {} = wait_key()
+ abort(1)
+end procedure
- include js_io . e -- fake file i/o for running under pwa/p2js
+include js_io.e -- fake file i/o for running under pwa/p2js
- function open_file ( string file_name , string mode )
- integer fn = iff ( platform ()= JS ? js_open ( file_name )
- : open ( file_name , mode ))
- if fn <= 0 then
- printf ( STDOUT , "Could not open %s" , { file_name })
- {} = wait_key ()
- abort ( 1 )
- end if
- return fn
- end function
+function open_file(string file_name, string mode)
+ integer fn = iff(platform()=JS?js_open(file_name)
+ :open(file_name, mode))
+ if fn<=0 then
+ printf(STDOUT, "Could not open %s", {file_name})
+ {} = wait_key()
+ abort(1)
+ end if
+ return fn
+end function
- global procedure open_files ( sequence cl )
- if length ( cl )> 2 then
- input_file = open_file ( cl [ 3 ], "r" )
- if length ( cl )> 3 then
- output_file = open_file ( cl [ 4 ], "w" )
- end if
- end if
- end procedure
+global procedure open_files(sequence cl)
+ if length(cl)>2 then
+ input_file = open_file(cl[3],"r")
+ if length(cl)>3 then
+ output_file = open_file(cl[4],"w")
+ end if
+ end if
+end procedure
- global procedure close_files ()
- if platform ()!= JS then
- if input_file != STDIN then close ( input_file ) end if
- if output_file != STDOUT then close ( output_file ) end if
- end if
- end procedure
+global procedure close_files()
+ if platform()!=JS then
+ if input_file!=STDIN then close(input_file) end if
+ if output_file!=STDOUT then close(output_file) end if
+ end if
+end procedure
- global function enquote ( string s )
- return sprintf ( `"%s"` , substitute ( s , "\n" , "\\n" ))
- end function
+global function enquote(string s)
+ return sprintf(`"%s"`,substitute(s,"\n","\\n"))
+end function
- global function unquote ( string s )
- if s [ 1 ]!= '\"' then ? 9 / 0 end if
- if s [$]!= '\"' then ? 9 / 0 end if
- s = substitute ( s [ 2 ..- 2 ], "\\n" , "\n" )
- return s
- end function
-
- --
- -- demo\rosetta\Compiler\js_io.e
- -- =============================
- --
- -- Fake file i/o for running under pwa/p2js in a browser
- -- Does not cover the human readable reload parts of extra.e
- --
- with javascript_semantics
- sequence { known_files , kfc } = columnize ({
- { "test3.c" , split ( """
- /*
- All lexical tokens - not syntactically correct, but that will
- have to wait until syntax analysis
- */
- /* Print */ print /* Sub */ -
- /* Putc */ putc /* Lss */ <
- /* If */ if /* Gtr */ >
- /* Else */ else /* Leq */ <=
- /* While */ while /* Geq */ >=
- /* Lbrace */ { /* Eq */ ==
- /* Rbrace */ } /* Neq */ !=
- /* Lparen */ ( /* And */ &&
- /* Rparen */ ) /* Or */ ||
- /* Uminus */ - /* Semi */ ;
- /* Not */ ! /* Comma */ ,
- /* Mul */ * /* Assign */ =
- /* Div */ / /* Integer */ 42
- /* Mod */ % /* String */ "String literal"
- /* Add */ + /* Ident */ variable_name
- /* character literal */ '\n'
- /* character literal **/ '\\'
- /* character literal */ ' '
- """ , "\n" )},
- { "test4.c" , split ( """
- /*** test printing, embedded \n and comments with lots of '*' ***/
- print(42);
- print("\nHello World\nGood Bye\nok\n");
- print("Print a slash n - \\n.\n");
- """ , "\n" )},
- { "primes.c" , split ( """
- /*
- Simple prime number generator
- */
- count = 1;
- n = 1;
- limit = 100;
- while (n < limit) {
- k=3;
- p=1;
- n=n+2;
- while ((k*k<=n) && (p)) {
- p=n/k*k!=n;
- k=k+2;
- }
- if (p) {
- print(n, " is prime\n");
- count = count + 1;
- }
- }
- print("Total primes found: ", count, "\n");
- """ , "\n" )},
- { "gcd.c" , split ( """
- /* Compute the gcd of 1071, 1029: 21 */
+-- demo\rosetta\Compiler\js_io.e
+-- Fake file i/o for running under pwa/p2js in a browser
+-- Does not cover the human readable reload parts of extra.e
+with javascript_semantics
+sequence {known_files,kfc} = columnize({
+{"test3.c",split(`
+/*
+ All lexical tokens - not syntactically correct, but that will
+ have to wait until syntax analysis
+ */
+/* Print */ print /* Sub */ -
+/* Putc */ putc /* Lss */ <
+/* If */ if /* Gtr */ >
+/* Else */ else /* Leq */ <=
+/* While */ while /* Geq */ >=
+/* Lbrace */ { /* Eq */ ==
+/* Rbrace */ } /* Neq */ !=
+/* Lparen */ ( /* And */ &&
+/* Rparen */ ) /* Or */ ||
+/* Uminus */ - /* Semi */ ;
+/* Not */ ! /* Comma */ ,
+/* Mul */ * /* Assign */ =
+/* Div */ / /* Integer */ 42
+/* Mod */ % /* String */ "String literal"
+/* Add */ + /* Ident */ variable_name
+/* character literal */ '\n'
+/* character literal **/ '\\'
+/* character literal */ ' '
+`,"\n")},
+{"test4.c",split(`
+/*** test printing, embedded \n and comments with lots of '*' ***/
+print(42);
+print("\nHello World\nGood Bye\nok\n");
+print("Print a slash n - \\n.\n");
+`,"\n")},
+{"primes.c",split(`
+/*
+ Simple prime number generator
+ */
+count = 1;
+n = 1;
+limit = 100;
+while (n < limit) {
+ k=3;
+ p=1;
+ n=n+2;
+ while ((k*k<=n) && (p)) {
+ p=n/k*k!=n;
+ k=k+2;
+ }
+ if (p) {
+ print(n, " is prime\n");
+ count = count + 1;
+ }
+}
+print("Total primes found: ", count, "\n");
+`,"\n")},
+{"gcd.c",split(`
+/* Compute the gcd of 1071, 1029: 21 */
- a = 1071;
- b = 1029;
+a = 1071;
+b = 1029;
- while (b != 0) {
- new_a = b;
- b = a % b;
- a = new_a;
- }
- print(a);
- """ , "\n" )},
- { "Header.h" , split ( """
- #define area(h, w) h * w
- """ , "\n" )},
- { "Source.t" , split ( """
- #include "Header.h"
- #define width 5
- #define height 6
- area = #area(height, width)#;
- """ , "\n" )}})
+while (b != 0) {
+ new_a = b;
+ b = a % b;
+ a = new_a;
+}
+print(a);
+`,"\n")},
+{"Header.h",split(`
+#define area(h, w) h * w
+`,"\n")},
+{"Source.t",split(`
+#include "Header.h"
+#define width 5
+#define height 6
+area = #area(height, width)#;
+`,"\n")}})
- sequence linenos = repeat (- 1 , length ( known_files ))
+sequence linenos = repeat(-1,length(known_files))
- global function js_open ( string filename )
- integer fn = find ( filename , known_files )
- assert ( fn != 0 )
- linenos [ fn ] = 0
- return fn
- end function
+global function js_open(string filename)
+ integer fn = find(filename,known_files)
+ assert(fn!=0)
+ linenos[fn] = 0
+ return fn
+end function
- global function js_gets ( integer fn )
- integer lineno = linenos [ fn ]+ 1
- if lineno <= length ( kfc [ fn ]) then
- linenos [ fn ] = lineno
- return kfc [ fn ][ lineno ]
- end if
- return EOF
- end function
-
- --
- -- demo\\rosetta\\Compiler\\lex.e
- -- ==============================
- --
- -- The reusable part of lex.exw
- -- This is only kept separate from core.e for consistency with later modules.
+-- demo\\rosetta\\Compiler\\lex.e
+-- The reusable part of lex.exw
+-- This is only kept separate from core.e for consistency with later modules.
+with javascript_semantics
+include core.e
- with javascript_semantics
- include core . e
+integer ch = ' ',
+ line = 0,
+ col = 0
- integer ch = ' ' ,
- line = 0 ,
- col = 0
+procedure eof(string s)
+ error("%s in %s literal",{iff(ch=EOF?"EOF":"EOL"),s})
+end procedure
- procedure eof ( string s )
- error ( "%s in %s literal" ,{ iff ( ch = EOF ? "EOF" : "EOL" ), s })
- end procedure
+function next_ch()
+ while 1 do
+ col += 1
+ if oneline=EOF then
+ ch = EOF
+ exit
+ elsif col>length(oneline) then
+ line += 1
+ col = 0
+ oneline = iff(platform()=JS?js_gets(input_file)
+ :gets(input_file))
+ else
+ ch = oneline[col]
+ exit
+ end if
+ end while
+ return ch
+end function
- function next_ch ()
- while 1 do
- col += 1
- if oneline = EOF then
- ch = EOF
- exit
- elsif col > length ( oneline ) then
- line += 1
- col = 0
- oneline = iff ( platform ()= JS ? js_gets ( input_file )
- : gets ( input_file ))
- else
- ch = oneline [ col ]
- exit
- end if
- end while
- return ch
- end function
+-- for pwa/p2js (JavaScript *really* dislikes tabs in strings):
+--constant whitespace = " \t\r\n\x0B\xA0"
+constant whitespace = {' ','\t','\r','\n',#0B,#A0}
+-- (0x0B is Vertical Tab, 0xA0 is Non-breaking space)
- -- for pwa/p2js (JavaScript *really* dislikes tabs in strings):
- --constant whitespace = " \t\r\n\x0B\xA0"
- constant whitespace = { ' ' , '\t' , '\r' , '\n' , #0B , #A0 }
- -- (0x0B is Vertical Tab, 0xA0 is Non-breaking space)
+procedure skipspacesandcomments()
+ while 1 do
+ if not find(ch,whitespace) then
+ if ch='/' and colprocedure skipspacesandcomments ()
- while 1 do
- if not find ( ch , whitespace ) then
- if ch = '/' and col < length ( oneline ) and oneline [ col + 1 ]= '*' then
- tok_line = line -- (in case of EOF error)
- tok_col = col
- ch = next_ch () -- (can be EOF)
- ch = next_ch () -- ( "" )
- while 1 do
- if ch = '*' then
- ch = next_ch ()
- if ch = '/' then exit end if
- elsif ch = EOF then
- error ( "EOF in comment" )
- else
- ch = next_ch ()
- end if
- end while
- else
- exit
- end if
- end if
- ch = next_ch ()
- end while
- end procedure
+function escape_char(string s)
+ ch = next_ch() -- (discard the '\\')
+ if ch='n' then
+ ch = '\n'
+ elsif ch='\\' then
+ ch = '\\'
+ elsif ch=EOF
+ or ch='\n' then
+ eof(s)
+ else
+ error(`unknown escape sequence \%c`, {ch})
+ end if
+ return ch
+end function
- function escape_char ( string s )
- ch = next_ch () -- (discard the '\\')
- if ch = 'n' then
- ch = '\n'
- elsif ch = '\\' then
- ch = '\\'
- elsif ch = EOF
- or ch = '\n' then
- eof ( s )
- else
- error ( `unknown escape sequence \%c` , { ch })
- end if
- return ch
- end function
+function char_lit()
+ integer startch = ch,
+ res = next_ch() -- (skip opening quote, save res)
+ if ch=startch then
+ error("empty character constant")
+ elsif ch='\\' then
+ res = escape_char("character")
+ end if
+ ch = next_ch()
+ if ch=EOF
+ or ch='\n' then
+ eof("character")
+ elsif ch!=startch then
+ error("multi-character constant")
+ end if
+ ch = next_ch()
+ return {tk_Integer, res}
+end function
- function char_lit ()
- integer startch = ch ,
- res = next_ch () -- (skip opening quote, save res)
- if ch = startch then
- error ( "empty character constant" )
- elsif ch = '\\' then
- res = escape_char ( "character" )
- end if
- ch = next_ch ()
- if ch = EOF
- or ch = '\n' then
- eof ( "character" )
- elsif ch != startch then
- error ( "multi-character constant" )
- end if
- ch = next_ch ()
- return { tk_Integer , res }
- end function
+function string_lit()
+ integer startch = ch
+ string text = ""
+ while next_ch()!=startch do
+ if ch=EOF
+ or ch='\n' then
+ eof("string")
+ elsif ch='\\' then
+ ch = escape_char("string")
+ end if
+ text &= ch
+ end while
+ ch = next_ch()
+ return {tk_String, text}
+end function
- function string_lit ()
- integer startch = ch
- string text = ""
- while next_ch ()!= startch do
- if ch = EOF
- or ch = '\n' then
- eof ( "string" )
- elsif ch = '\\' then
- ch = escape_char ( "string" )
- end if
- text &= ch
- end while
- ch = next_ch ()
- return { tk_String , text }
- end function
+function get_op()
+-- sequence operator = {ch}
+ string operator = ""&ch
+ ch = next_ch()
+ while charmap[ch]=OPERATOR
+ and find(operator&ch,operators) do
+ -- (^ ie/eg merge ">=", but not ");")
+ operator &= ch
+ ch = next_ch()
+ end while
+ integer k = find(operator,operators)
+ if k=0 then error("unknown operator") end if
+ return {opcodes[k], 0} -- (0 unused)
+end function
- function get_op ()
- -- sequence operator = {ch}
- string operator = "" & ch
- ch = next_ch ()
- while charmap [ ch ]= OPERATOR
- and find ( operator & ch , operators ) do
- -- (^ ie/eg merge ">=", but not ");")
- operator &= ch
- ch = next_ch ()
- end while
- integer k = find ( operator , operators )
- if k = 0 then error ( "unknown operator" ) end if
- return { opcodes [ k ], 0 } -- (0 unused)
- end function
+function get_int()
+ integer i = 0
+ while charmap[ch]=DIGIT do
+ i = i*10 + (ch-'0')
+ ch = next_ch()
+ end while
+ if charmap[ch]=LETTER then
+ error("invalid number")
+ end if
+ return {tk_Integer, i}
+end function
- function get_int ()
- integer i = 0
- while charmap [ ch ]= DIGIT do
- i = i * 10 + ( ch - '0' )
- ch = next_ch ()
- end while
- if charmap [ ch ]= LETTER then
- error ( "invalid number" )
- end if
- return { tk_Integer , i }
- end function
+function get_ident()
+ string text = ""
+ while find(charmap[ch],{LETTER,DIGIT}) do
+ text &= ch
+ ch = next_ch()
+ end while
+ integer keyword = getd(text,KEYWORDS)
+ if keyword!=NULL then
+ return {keyword, 0} -- (0 unused)
+ end if
+ return {tk_Identifier, text}
+end function
- function get_ident ()
- string text = ""
- while find ( charmap [ ch ],{ LETTER , DIGIT }) do
- text &= ch
- ch = next_ch ()
- end while
- integer keyword = getd ( text , KEYWORDS )
- if keyword != NULL then
- return { keyword , 0 } -- (0 unused)
- end if
- return { tk_Identifier , text }
- end function
+function get_token()
+ skipspacesandcomments()
+ tok_line = line
+ tok_col = col
+ switch ch do
+ case EOF then return {tk_EOI, 0} -- (0 unused)
+ case '\'' then return char_lit()
+ case '"' then return string_lit()
+ else
+ switch charmap[ch] do
+ case OPERATOR then return get_op()
+ case DIGIT then return get_int()
+ case LETTER then return get_ident()
+ else error("unrecognized character: (%d)", {ch})
+ end switch
+ end switch
+end function
- function get_token ()
- skipspacesandcomments ()
- tok_line = line
- tok_col = col
- switch ch do
- case EOF then return { tk_EOI , 0 } -- (0 unused)
- case '\'' then return char_lit ()
- case '"' then return string_lit ()
- else
- switch charmap [ ch ] do
- case OPERATOR then return get_op ()
- case DIGIT then return get_int ()
- case LETTER then return get_ident ()
- else error ( "unrecognized character: (%d)" , { ch })
- end switch
- end switch
- end function
-
- global function lex ()
- sequence toks = {}
- integer tok = - 1
- object v
- while tok != tk_EOI do
- { tok , v } = get_token ()
- toks = append ( toks ,{ tok_line , tok_col , tok , v })
- end while
- return toks
- end function
-
- --
- -- demo\rosetta\Compiler\extra.e
- -- =============================
- --
- -- Routines to reload human-readable files (deviation from task requirement)
- --
- without js -- (file i/o)
+-- demo\rosetta\Compiler\extra.e
+-- Routines to reload human-readable files (deviation from task requirement)
+without js -- (file i/o)
- --The following can be used to load .lex files, as created by lex.exw:
- -- (in place of the existing get_tok() in parse.e)
- function get_tok ()
- string line = trim ( gets ( input_file ))
- sequence tok = split ( line , ' ' , limit := 4 , no_empty := 1 )
- integer k = find ( tok [ 3 ], tkNames )
- if k = 0 then ? 9 / 0 end if
- tok [ 3 ] = k
- return tok
- end function
+--The following can be used to load .lex files, as created by lex.exw:
+-- (in place of the existing get_tok() in parse.e)
+function get_tok()
+ string line = trim(gets(input_file))
+ sequence tok = split(line,' ',limit:=4,no_empty:=1)
+ integer k = find(tok[3],tkNames)
+ if k=0 then ?9/0 end if
+ tok[3] = k
+ return tok
+end function
- --The following can be used to load .ast files, as created by parse.exw:
- -- (in place of the existing lex()/parse() pairs in cgen.exw and interp.exw)
- function load_ast ()
- string line = trim ( gets ( input_file ))
- -- Each line has at least one token
- sequence node = split ( line , ' ' , limit := 2 , no_empty := 1 )
+--The following can be used to load .ast files, as created by parse.exw:
+-- (in place of the existing lex()/parse() pairs in cgen.exw and interp.exw)
+function load_ast()
+ string line = trim(gets(input_file))
+ -- Each line has at least one token
+ sequence node = split(line,' ',limit:=2,no_empty:=1)
- string node_type = node [ 1 ]
+ string node_type = node[1]
- if node_type == ";" then -- a terminal node
- return NULL
- end if
+ if node_type == ";" then -- a terminal node
+ return NULL
+ end if
- integer n_type = find ( node_type , tkNames )
- if n_type = 0 then ? 9 / 0 end if
+ integer n_type = find(node_type,tkNames)
+ if n_type=0 then ?9/0 end if
- -- A line with two tokens is a leaf node
- -- Leaf nodes are: Identifier, Integer, String
- -- The 2nd token is the value
- if length ( node )> 1 then
- node [ 1 ] = n_type
- if n_type = tk_Integer then
- node [ 2 ] = to_integer ( node [ 2 ])
- elsif n_type = tk_String then
- node [ 2 ] = unquote ( node [ 2 ])
- end if
- return node
- end if
- object left = load_ast ()
- object right = load_ast ()
- return { n_type , left , right }
- end function
-
- --
- -- demo\rosetta\Compiler\lex.exw
- -- =============================
- --
- with javascript_semantics
- include lex . e
+-- demo\rosetta\Compiler\lex.exw
+with javascript_semantics
+include lex.e
- procedure main ( sequence cl )
- open_files ( cl )
- sequence toks = lex ()
- integer tok
- object v
- for i = 1 to length ( toks ) do
- { tok_line , tok_col , tok , v } = toks [ i ]
- switch tok do
- case tk_Identifier : v = sprintf ( " %s" , v )
- case tk_Integer : v = sprintf ( " %5d" , v )
- case tk_String : v = sprintf ( " %s" , enquote ( v ))
- else v = ""
- end switch
- printf ( output_file , "%5d %5d %-10s%s\n" , { tok_line , tok_col , tkNames [ tok ], v })
- end for
- close_files ()
- end procedure
+procedure main(sequence cl)
+ open_files(cl)
+ sequence toks = lex()
+ integer tok
+ object v
+ for i=1 to length(toks) do
+ {tok_line,tok_col,tok,v} = toks[i]
+ switch tok do
+ case tk_Identifier: v = sprintf(" %s",v)
+ case tk_Integer: v = sprintf(" %5d",v)
+ case tk_String: v = sprintf(" %s",enquote(v))
+ else v = ""
+ end switch
+ printf(output_file, "%5d %5d %-10s%s\n", {tok_line,tok_col,tkNames[tok],v})
+ end for
+ close_files()
+end procedure
- --main(command_line())
- main ({ 0 , 0 , "test4.c" })
-
- --
- -- demo\rosetta\Compiler\parse.e
- -- =============================
- --
- -- The reusable part of parse.exw
- --
- with javascript_semantics
- include lex . e
+-- demo\rosetta\Compiler\parse.e
+-- The reusable part of parse.exw
+with javascript_semantics
+include lex.e
- sequence tok
+sequence tok
- procedure errd ( sequence msg , sequence args ={})
- { tok_line , tok_col } = tok
- error ( msg , args )
- end procedure
+procedure errd(sequence msg, sequence args={})
+ {tok_line,tok_col} = tok
+ error(msg,args)
+end procedure
- global sequence toks
- integer next_tok = 1
+global sequence toks
+integer next_tok = 1
- function get_tok ()
- sequence tok = toks [ next_tok ]
- next_tok += 1
- return tok
- end function
+function get_tok()
+ sequence tok = toks[next_tok]
+ next_tok += 1
+ return tok
+end function
- procedure expect ( string msg , integer s )
- integer tk = tok [ 3 ]
- if tk != s then
- errd ( "%s: Expecting '%s', found '%s'\n" , { msg , tkNames [ s ], tkNames [ tk ]})
- end if
- tok = get_tok ()
- end procedure
+procedure expect(string msg, integer s)
+ integer tk = tok[3]
+ if tk!=s then
+ errd("%s: Expecting '%s', found '%s'\n", {msg, tkNames[s], tkNames[tk]})
+ end if
+ tok = get_tok()
+end procedure
- function expr ( integer p )
- object x = NULL , node
- integer op = tok [ 3 ]
+function expr(integer p)
+ object x = NULL, node
+ integer op = tok[3]
- switch op do
- case tk_LeftParen :
- tok = get_tok ()
- x = expr ( 0 )
- expect ( "expr" , tk_RightParen )
- case tk_sub :
- case tk_add :
- tok = get_tok ()
- node = expr ( precedences [ tk_neg ]);
- x = iff ( op == tk_sub ?{ tk_neg , node , NULL }: node )
- case tk_not :
- tok = get_tok ();
- x = { tk_not , expr ( precedences [ tk_not ]), NULL }
- case tk_Identifier :
- x = { tk_Identifier , tok [ 4 ]}
- tok = get_tok ();
- case tk_Integer :
- x = { tk_Integer , tok [ 4 ]}
- tok = get_tok ();
- default :
- errd ( "Expecting a primary, found: %s\n" , tkNames [ op ])
- end switch
+ switch op do
+ case tk_LeftParen:
+ tok = get_tok()
+ x = expr(0)
+ expect("expr",tk_RightParen)
+ case tk_sub:
+ case tk_add:
+ tok = get_tok()
+ node = expr(precedences[tk_neg]);
+ x = iff(op==tk_sub?{tk_neg, node, NULL}:node)
+ case tk_not:
+ tok = get_tok();
+ x = {tk_not, expr(precedences[tk_not]), NULL}
+ case tk_Identifier:
+ x = {tk_Identifier, tok[4]}
+ tok = get_tok();
+ case tk_Integer:
+ x = {tk_Integer, tok[4]}
+ tok = get_tok();
+ default:
+ errd("Expecting a primary, found: %s\n", tkNames[op])
+ end switch
- op = tok [ 3 ]
- while narys [ op ]= BINARY
- and precedences [ op ]>= p do
- tok = get_tok ()
- x = { op , x , expr ( precedences [ op ]+ 1 )}
- op = tok [ 3 ]
- end while
- return x ;
- end function
+ op = tok[3]
+ while narys[op]=BINARY
+ and precedences[op]>=p do
+ tok = get_tok()
+ x = {op, x, expr(precedences[op]+1)}
+ op = tok[3]
+ end while
+ return x;
+end function
- function paren_expr ( string msg )
- expect ( msg , tk_LeftParen );
- object t = expr ( 0 )
- expect ( msg , tk_RightParen );
- return t
- end function
+function paren_expr(string msg)
+ expect(msg, tk_LeftParen);
+ object t = expr(0)
+ expect(msg, tk_RightParen);
+ return t
+end function
- function stmt ()
- object t = NULL , e , s
+function stmt()
+ object t = NULL, e, s
- switch tok [ 3 ] do
- case tk_if :
- tok = get_tok ();
- object condition = paren_expr ( "If-cond" );
- object ifblock = stmt ();
- object elseblock = NULL ;
- if tok [ 3 ] == tk_else then
- tok = get_tok ();
- elseblock = stmt ();
- end if
- t = { tk_if , condition , { tk_if , ifblock , elseblock }}
- case tk_putc :
- tok = get_tok ();
- e = paren_expr ( "Prtc" )
- t = { tk_putc , e , NULL }
- expect ( "Putc" , tk_Semicolon );
- case tk_print :
- tok = get_tok ();
- expect ( "Print" , tk_LeftParen )
- while 1 do
- if tok [ 3 ] == tk_String then
- e = { tk_Prints , { tk_String , tok [ 4 ]}, NULL }
- tok = get_tok ();
- else
- e = { tk_Printi , expr ( 0 ), NULL }
- end if
- t = { tk_Sequence , t , e }
- if tok [ 3 ]!= tk_Comma then exit end if
- expect ( "Print" , tk_Comma )
- end while
- expect ( "Print" , tk_RightParen );
- expect ( "Print" , tk_Semicolon );
- case tk_Semicolon :
- tok = get_tok ();
- case tk_Identifier :
- object v
- v = { tk_Identifier , tok [ 4 ]}
- tok = get_tok ();
- expect ( "assign" , tk_assign );
- e = expr ( 0 );
- t = { tk_assign , v , e }
- expect ( "assign" , tk_Semicolon );
- case tk_while :
- tok = get_tok ();
- e = paren_expr ( "while" );
- s = stmt ();
- t = { tk_while , e , s }
- case tk_LeftBrace : /* {stmt} */
- expect ( "LeftBrace" , tk_LeftBrace )
- while not find ( tok [ 3 ],{ tk_RightBrace , tk_EOI }) do
- t = { tk_Sequence , t , stmt ()}
- end while
- expect ( "LeftBrace" , tk_RightBrace );
- break ;
- case tk_EOI :
- break ;
- default :
- errd ( "expecting start of statement, found '%s'\n" , tkNames [ tok [ 3 ]]);
- end switch
- return t
- end function
+ switch tok[3] do
+ case tk_if:
+ tok = get_tok();
+ object condition = paren_expr("If-cond");
+ object ifblock = stmt();
+ object elseblock = NULL;
+ if tok[3] == tk_else then
+ tok = get_tok();
+ elseblock = stmt();
+ end if
+ t = {tk_if, condition, {tk_if, ifblock, elseblock}}
+ case tk_putc:
+ tok = get_tok();
+ e = paren_expr("Prtc")
+ t = {tk_putc, e, NULL}
+ expect("Putc", tk_Semicolon);
+ case tk_print:
+ tok = get_tok();
+ expect("Print",tk_LeftParen)
+ while 1 do
+ if tok[3] == tk_String then
+ e = {tk_Prints, {tk_String, tok[4]}, NULL}
+ tok = get_tok();
+ else
+ e = {tk_Printi, expr(0), NULL}
+ end if
+ t = {tk_Sequence, t, e}
+ if tok[3]!=tk_Comma then exit end if
+ expect("Print", tk_Comma)
+ end while
+ expect("Print", tk_RightParen);
+ expect("Print", tk_Semicolon);
+ case tk_Semicolon:
+ tok = get_tok();
+ case tk_Identifier:
+ object v
+ v = {tk_Identifier, tok[4]}
+ tok = get_tok();
+ expect("assign", tk_assign);
+ e = expr(0);
+ t = {tk_assign, v, e}
+ expect("assign", tk_Semicolon);
+ case tk_while:
+ tok = get_tok();
+ e = paren_expr("while");
+ s = stmt();
+ t = {tk_while, e, s}
+ case tk_LeftBrace: /* {stmt} */
+ expect("LeftBrace", tk_LeftBrace)
+ while not find(tok[3],{tk_RightBrace,tk_EOI}) do
+ t = {tk_Sequence, t, stmt()}
+ end while
+ expect("LeftBrace", tk_RightBrace);
+ break;
+ case tk_EOI:
+ break;
+ default:
+ errd("expecting start of statement, found '%s'\n", tkNames[tok[3]]);
+ end switch
+ return t
+end function
- global function parse ()
- object t = NULL
- tok = get_tok ()
- while 1 do
- object s = stmt ()
- if s = NULL then exit end if
- t = { tk_Sequence , t , s }
- end while
- return t
- end function
-
- --
- -- demo\rosetta\Compiler\parse.exw
- -- ===============================
- --
- with javascript_semantics
- include parse . e
+-- demo\rosetta\Compiler\parse.exw
+with javascript_semantics
+include parse.e
- procedure print_ast ( object t )
- if t == NULL then
- printf ( output_file , ";\n" )
- else
- integer ttype = t [ 1 ]
- printf ( output_file , tkNames [ ttype ])
- if ttype = tk_Identifier then
- printf ( output_file , " %s\n" , t [ 2 ])
- elsif ttype = tk_Integer then
- printf ( output_file , " %d\n" , t [ 2 ])
- elsif ttype = tk_String then
- printf ( output_file , " %s\n" , enquote ( t [ 2 ]))
- else
- printf ( output_file , "\n" )
- print_ast ( t [ 2 ])
- print_ast ( t [ 3 ])
- end if
- end if
- end procedure
+procedure print_ast(object t)
+ if t == NULL then
+ printf(output_file,";\n")
+ else
+ integer ttype = t[1]
+ printf(output_file,tkNames[ttype])
+ if ttype=tk_Identifier then
+ printf(output_file," %s\n",t[2])
+ elsif ttype=tk_Integer then
+ printf(output_file," %d\n",t[2])
+ elsif ttype=tk_String then
+ printf(output_file," %s\n",enquote(t[2]))
+ else
+ printf(output_file,"\n")
+ print_ast(t[2])
+ print_ast(t[3])
+ end if
+ end if
+end procedure
- function ptree ( object t )
- if sequence ( t ) then
- integer t1 = t [ 1 ]
- t = deep_copy ( t )
- t [ 1 ] = tkNames [ t1 ]
- if not find ( t1 ,{ tk_Identifier , tk_String }) then
- for i = 2 to length ( t ) do
- if t1 = tk_Sequence and t [ i ]= NULL then
- t [ i ] = "NULL"
- else
- t [ i ] = ptree ( t [ i ])
- end if
- end for
- end if
- end if
- return t
- end function
+function ptree(object t)
+ if sequence(t) then
+ integer t1 = t[1]
+ t = deep_copy(t)
+ t[1] = tkNames[t1]
+ if not find(t1,{tk_Identifier,tk_String}) then
+ for i=2 to length(t) do
+ if t1=tk_Sequence and t[i]=NULL then
+ t[i] = "NULL"
+ else
+ t[i] = ptree(t[i])
+ end if
+ end for
+ end if
+ end if
+ return t
+end function
- procedure main ( sequence cl )
- open_files ( cl )
- toks = lex ()
- object t = parse ()
- print_ast ( t )
- pp ( ptree ( t ),{ pp_Nest , 10 , pp_Pause , 0 , pp_IntCh , false })
- close_files ()
- end procedure
+procedure main(sequence cl)
+ open_files(cl)
+ toks = lex()
+ object t = parse()
+ print_ast(t)
+pp(ptree(t),{pp_Nest,10,pp_Pause,0,pp_IntCh,false})
+ close_files()
+end procedure
- --main(command_line())
- main ({ 0 , 0 , "test3.c" }) -- not parseable!
- --main({0,0,"primes.c"}) -- as Algol, C, Python (apart from spacing)
- --main({0,0,"count.c"}) -- as AWK ( "" )
-
- --
- -- demo\rosetta\Compiler\vm.exw
- -- ============================
- --
- -- Since we have generated executable machine code, the virtual machine, such as it is, is just
- -- the higher level implementations of printc/i/s, see setbuiltins() in cgen.e
- -- Otherwise the only difference between this and cgen.exw is call(code_mem) instead of decode().
- --
- -- A quick test (calculating fib(44) 10^6 times) suggests ~500 times faster than interp.exw -
- -- which is to be expected given that a single add instruction (1 clock) here is implemented as
- -- at least three (and quite possibly five!) resursive calls to interp() in the other.
+-- demo\rosetta\Compiler\vm.exw
+-- Since we have generated executable machine code, the virtual machine, such as it is, is just
+-- the higher level implementations of printc/i/s, see setbuiltins() in cgen.e
+-- Otherwise the only difference between this and cgen.exw is call(code_mem) instead of decode().
+-- A quick test (calculating fib(44) 10^6 times) suggests ~500 times faster than interp.exw -
+-- which is to be expected given that a single add instruction (1 clock) here is implemented as
+-- at least three (and quite possibly five!) resursive calls to interp() in the other.
+format PE32
+--format ELF32
+-- Note: cgen generates 32-bit machine code, which cannot be executed directly from a 64-bit interpreter.
+-- You can however, via the magic of either the above format directives, use a 64-bit version of
+-- Phix to compile this (just add a -c command line option) to a 32-bit executable, which can.
+-- It would not be particularly difficult to emit 32 or 64 bit code, but some source code files
+-- would, fairly obviously, then be very nearly twice as long, and a fair bit harder to read.
+without js -- (machine code!)
+include cgen.e
- format PE32
- --format ELF32
- -- Note: cgen generates 32-bit machine code, which cannot be executed directly from a 64-bit interpreter.
- -- You can however, via the magic of either the above format directives, use a 64-bit version of
- -- Phix to compile this (just add a -c command line option) to a 32-bit executable, which can.
- -- It would not be particularly difficult to emit 32 or 64 bit code, but some source code files
- -- would, fairly obviously, then be very nearly twice as long, and a fair bit harder to read.
+procedure main(sequence cl)
+ open_files(cl)
+ toks = lex()
+ object t = parse()
+ code_gen(t)
+ fixup()
+ if machine_bits()=32 then
+ -- ^ as per note above
+ call(code_mem)
+ end if
+ free({var_mem,code_mem})
+ close_files()
+end procedure
- without js -- (machine code!)
- include cgen . e
-
- procedure main ( sequence cl )
- open_files ( cl )
- toks = lex ()
- object t = parse ()
- code_gen ( t )
- fixup ()
- if machine_bits ()= 32 then
- -- ^ as per note above
- call ( code_mem )
- end if
- free ({ var_mem , code_mem })
- close_files ()
- end procedure
-
- --main(command_line())
- main ({ 0 , 0 , "count.c" })
-
- without js -- (threads)
- procedure echo ( string s )
- sleep ( rand ( 100 )/ 100 )
- enter_cs ()
- puts ( 1 , s )
- puts ( 1 , '\n' )
- leave_cs ()
- end procedure
+without js -- (threads)
+procedure echo(string s)
+ sleep(rand(100)/100)
+ enter_cs()
+ puts(1,s)
+ puts(1,'\n')
+ leave_cs()
+end procedure
- constant threads = { create_thread ( routine_id ( "echo" ),{ "Enjoy" }),
- create_thread ( routine_id ( "echo" ),{ "Rosetta" }),
- create_thread ( routine_id ( "echo" ),{ "Code" })}
+constant threads = {create_thread(routine_id("echo"),{"Enjoy"}),
+ create_thread(routine_id("echo"),{"Rosetta"}),
+ create_thread(routine_id("echo"),{"Code"})}
- wait_thread ( threads )
- puts ( 1 , "done" )
- {} = wait_key ()
-
- with javascript_semantics
- constant precision = 10000
+with javascript_semantics
+constant precision = 10000
- function continued_fraction ( integer f , steps = precision )
- atom a , b , res = 0
- for n = steps to 1 by - 1 do
- { a , b } = f ( n )
- res := b / ( a + res )
- end for
- { a } = f ( 0 )
- return a + res
- end function
+function continued_fraction(integer f, steps=precision)
+ atom a, b, res = 0
+ for n=steps to 1 by -1 do
+ {a, b} = f(n)
+ res := b / (a + res)
+ end for
+ {a} = f(0)
+ return a + res
+end function
- function sqr2 ( integer n ) return { iff ( n = 0 ? 1 : 2 ), 1 } end function
+function sqr2(integer n) return {iff(n=0?1:2),1} end function
- function nap ( integer n ) return { iff ( n = 0 ? 2 : n ), iff ( n = 1 ? 1 : n - 1 )} end function
+function nap(integer n) return {iff(n=0?2:n),iff(n=1?1:n-1)} end function
- function pi ( integer n ) return { iff ( n = 0 ? 3 : 6 ), power ( 2 * n - 1 , 2 )} end function
+function pi(integer n) return {iff(n=0?3:6),power(2*n-1,2)} end function
- printf ( 1 , "Precision: %d\n" , { precision })
- printf ( 1 , "Sqr(2): %.10g\n" , { continued_fraction ( sqr2 )})
- printf ( 1 , "Napier: %.10g\n" , { continued_fraction ( nap )})
- printf ( 1 , "Pi: %.10g\n" , { continued_fraction ( pi )})
-
- without js
- while true do
- integer ch = wait_key ()
- if ch = #1B then exit end if
- puts ( 1 , ch )
- end while
-
- with javascript_semantics
- procedure factorise ( integer n )
- sequence res = prime_factors ( n , true )
- res = join ( apply ( res , sprint ), " x " )
- printf ( 1 , "%2d: %s\n" ,{ n , res })
- end procedure
+with javascript_semantics
+procedure factorise(integer n)
+ sequence res = prime_factors(n,true,-1)
+ printf(1,"%2d: %s\n",{n,join(res," x ",fmt:="%d")})
+end procedure
- papply ( tagset ( 10 )&{ 2144 , 1000000000 }, factorise )
-
- sequence tests = {{ "the three truths" , "th" },
- { "ababababab" , "abab" },
- { "ababababab" , "aba" },
- { "ababababab" , "ab" },
- { "ababababab" , "a" },
- { "ababababab" , "" }}
- integer start , count
- string test , substring
- for i = 1 to length ( tests ) do
- start = 1
- count = 0
- { test , substring } = tests [ i ]
- while 1 do
- start = match ( substring , test , start )
- if start = 0 then exit end if
- start += length ( substring )
- count += 1
- end while
- printf ( 1 , "The string \"%s\" occurs as a non-overlapping substring %d times in \"%s\"\n" ,{ substring , count , test })
- end for
-') !Disclaiming responsibility...
- INDEEP = 1 !Finishing the content of the header.
- CALL HTML("") !Enough of that.
- CALL HTML("") !A fresh line seems polite.
- INDEEP = 2 !Its content follows..
- END SUBROUTINE HTMLSTART !Others will follow on. Hopefully, correctly.
- SUBROUTINE HTMLSTOP !And hopefully, this will be a good closure.
+ CALL HTML('') !Not displayed, but potentially used by non-display agencies...
- INDEEP = INDEEP + 1 !Another level dug.
+ SUBROUTINE HTMLTSTART(B,SUMMARY) !Start a table.
+ INTEGER B !Border thickness.
+ CHARACTER*(*) SUMMARY !Some well-chosen words.
+ CALL HTML("') !Not displayed, but potentially used by non-display agencies...
+ INDEEP = INDEEP + 1 !Another level dug.
END SUBROUTINE HTMLTSTART!That part was easy.
- SUBROUTINE HTMLTSTOP !And the ending is easy too.
- INDEEP = INDEEP - 1 !Withdraw a level.
- CALL HTML("
") !Hopefully, aligning.
- END SUBROUTINE HTMLTSTOP !The bounds are easy.
+ SUBROUTINE HTMLTSTOP !And the ending is easy too.
+ INDEEP = INDEEP - 1 !Withdraw a level.
+ CALL HTML("
") !Hopefully, aligning.
+ END SUBROUTINE HTMLTSTOP !The bounds are easy.
- SUBROUTINE HTMLTHEADSTART !Start a table's heading.
- CALL HTML("") !Thus.
- INDEEP = INDEEP + 1 !Dig deeper.
- END SUBROUTINE HTMLTHEADSTART !Content should follow.
- SUBROUTINE HTMLTHEADSTOP !And now, enough.
- INDEEP = INDEEP - 1 !Retreat a level.
- CALL HTML(" ") !And end the head.
- END SUBROUTINE HTMLTHEADSTOP !At the neck of the body?
+ SUBROUTINE HTMLTHEADSTART !Start a table's heading.
+ CALL HTML("") !Thus.
+ INDEEP = INDEEP + 1 !Dig deeper.
+ END SUBROUTINE HTMLTHEADSTART !Content should follow.
+ SUBROUTINE HTMLTHEADSTOP !And now, enough.
+ INDEEP = INDEEP - 1 !Retreat a level.
+ CALL HTML(" ") !And end the head.
+ END SUBROUTINE HTMLTHEADSTOP !At the neck of the body?
- SUBROUTINE HTMLTHEAD(N,TEXT) !Cast forth a whole-span table heading.
- INTEGER N !The count of columns to be spanned.
- CHARACTER*(*) TEXT !A brief description to place there.
- CALL HTML3("',"") !Start the specification.
- CALL HTML3("",TEXT(1:LSTNB(TEXT))," ',"") !Start the specification.
+ CALL HTML3("",TEXT(1:LSTNB(TEXT))," ') !And I don't think much of the "comment" formalism, either.
- INDEEP = INDEEP + 1 !Anyway, we're ready with the alignment.
- END SUBROUTINE HTMLTBODYSTART !Others will provide the body.
- SUBROUTINE HTMLTBODYSTOP !And, they've had enough.
- INDEEP = INDEEP - 1 !So, up out of the hole.
- CALL HTML(" ") !Take a breath.
- END SUBROUTINE HTMLTBODYSTOP !And wander off.
- SUBROUTINE HTMLTROWTEXT(TEXT,N) !Roll a row of column headings.
- CHARACTER*(*) TEXT(:) !The headings.
- INTEGER N !Their number.
- INTEGER I,L !Assistants.
- CALL HTML3("","","") !Start a row of headings-to-come, and don't end the line.
- DO I = 1,N !Step through the headings.
- L = LSTNB(TEXT(I)) !Trailing spaces are to be ignored.
- IF (L.LE.0) THEN !Thus discovering blank texts.
- CALL HTML3(""," ","") !This prevents the cell being collapsed.
- ELSE !But for those with text,
- CALL HTML3("",""//TEXT(I)(1:L)//" ","") !Roll it.
- END IF !So much for that text.
- END DO !On to the next.
- CALL HTML3("",""," ") !Finish the row, and thus the line.
- END SUBROUTINE HTMLTROWTEXT !So much for texts.
- SUBROUTINE HTMLTROWINTEGER(V,N) !Now for all integers.
- INTEGER V(:) !The integers.
- INTEGER N !Their number.
- INTEGER I !A stepper.
- CALL HTML3('',"","") !Start a row of entries.
- DO I = 1,N !Work through the row's values.
- CALL HTML3("",""//I8FMT(V(I))//" ","") !One by one.
- END DO !On to the next.
- CALL HTML3("",""," ") !Finish the row, and thus the line.
- END SUBROUTINE HTMLTROWINTEGER !All the same type is not troublesome.
- END MODULE HTMLSTUFF !Enough already.
+ SUBROUTINE HTMLTBODYSTART !Start on the table body.
+ CALL HTML(' ') !And I don't think much of the "comment" formalism, either.
+ INDEEP = INDEEP + 1 !Anyway, we're ready with the alignment.
+ END SUBROUTINE HTMLTBODYSTART !Others will provide the body.
+ SUBROUTINE HTMLTBODYSTOP !And, they've had enough.
+ INDEEP = INDEEP - 1 !So, up out of the hole.
+ CALL HTML(" ") !Take a breath.
+ END SUBROUTINE HTMLTBODYSTOP !And wander off.
+ SUBROUTINE HTMLTROWTEXT(TEXT,N) !Roll a row of column headings.
+ CHARACTER*(*) TEXT(:) !The headings.
+ INTEGER N !Their number.
+ INTEGER I,L !Assistants.
+ CALL HTML3("","","") !Start a row of headings-to-come, and don't end the line.
+ DO I = 1,N !Step through the headings.
+ L = LSTNB(TEXT(I)) !Trailing spaces are to be ignored.
+ IF (L.LE.0) THEN !Thus discovering blank texts.
+ CALL HTML3(""," ","") !This prevents the cell being collapsed.
+ ELSE !But for those with text,
+ CALL HTML3("",""//TEXT(I)(1:L)//" ","") !Roll it.
+ END IF !So much for that text.
+ END DO !On to the next.
+ CALL HTML3("",""," ") !Finish the row, and thus the line.
+ END SUBROUTINE HTMLTROWTEXT !So much for texts.
+ SUBROUTINE HTMLTROWINTEGER(V,N) !Now for all integers.
+ INTEGER V(:) !The integers.
+ INTEGER N !Their number.
+ INTEGER I !A stepper.
+ CALL HTML3('',"","") !Start a row of entries.
+ DO I = 1,N !Work through the row's values.
+ CALL HTML3("",""//I8FMT(V(I))//" ","") !One by one.
+ END DO !On to the next.
+ CALL HTML3("",""," ") !Finish the row, and thus the line.
+ END SUBROUTINE HTMLTROWINTEGER !All the same type is not troublesome.
+ END MODULE HTMLSTUFF !Enough already.
PROGRAM MAKETABLE
USE PARAMETERS
USE ASSISTANCE
USE HTMLSTUFF
INTEGER KBD,MSG
- INTEGER NCOLS !The usage of V must conform to this!
- PARAMETER (NCOLS = 4) !Specified number of columns.
- CHARACTER*3 COLNAME(NCOLS) !And they have names.
- PARAMETER (COLNAME = (/"","X","Y","Z"/)) !As specified.
- INTEGER V(NCOLS) !A scratchpad for a line's worth.
- COMMON KBD,MSG !I/O units.
- KBD = 5 !Keyboard.
- MSG = 6 !Screen.
- CALL GETLOG(USERCODE) !Who has poked me into life?
- LUSERCODE = LSTNB(USERCODE) !Ah, text gnashing.
+ INTEGER NCOLS !The usage of V must conform to this!
+ PARAMETER (NCOLS = 4) !Specified number of columns.
+ CHARACTER*3 COLNAME(NCOLS) !And they have names.
+ PARAMETER (COLNAME = (/"","X","Y","Z"/)) !As specified.
+ INTEGER V(NCOLS) !A scratchpad for a line's worth.
+ COMMON KBD,MSG !I/O units.
+ KBD = 5 !Keyboard.
+ MSG = 6 !Screen.
+ CALL GETLOG(USERCODE) !Who has poked me into life?
+ LUSERCODE = LSTNB(USERCODE) !Ah, text gnashing.
- CALL HTMLSTART(MSG,"Powers","Table of integer powers") !Output to the screen will do.
- CALL HTMLTSTART(1,"Successive powers of successive integers") !Start the table.
- CALL HTMLTHEADSTART !The table heading.
- CALL HTMLTHEAD(NCOLS,"Successive powers") !A full-width heading.
- CALL HTMLTROWTEXT(COLNAME,NCOLS) !Headings for each column.
- CALL HTMLTHEADSTOP !So much for the heading.
- CALL HTMLTBODYSTART !Now for the content.
- DO I = 1,10 !This should be enough.
- V(1) = I !The unheaded row number.
- V(2) = I**2 !Its square.
- V(3) = I**3 !Cube.
- V(4) = I**4 !Fourth power.
- CALL HTMLTROWINTEGER(V,NCOLS) !Show a row's worth..
- END DO !On to the next line.
- CALL HTMLTBODYSTOP !No more content.
- CALL HTMLTSTOP !End the table.
+ CALL HTMLSTART(MSG,"Powers","Table of integer powers") !Output to the screen will do.
+ CALL HTMLTSTART(1,"Successive powers of successive integers") !Start the table.
+ CALL HTMLTHEADSTART !The table heading.
+ CALL HTMLTHEAD(NCOLS,"Successive powers") !A full-width heading.
+ CALL HTMLTROWTEXT(COLNAME,NCOLS) !Headings for each column.
+ CALL HTMLTHEADSTOP !So much for the heading.
+ CALL HTMLTBODYSTART !Now for the content.
+ DO I = 1,10 !This should be enough.
+ V(1) = I !The unheaded row number.
+ V(2) = I**2 !Its square.
+ V(3) = I**3 !Cube.
+ V(4) = I**4 !Fourth power.
+ CALL HTMLTROWINTEGER(V,NCOLS) !Show a row's worth..
+ END DO !On to the next line.
+ CALL HTMLTBODYSTOP !No more content.
+ CALL HTMLTSTOP !End the table.
CALL HTMLSTOP
END
diff --git a/Task/Create-an-HTML-table/Java/create-an-html-table-3.java b/Task/Create-an-HTML-table/Java/create-an-html-table-3.java
index f5306aa7ac..3c85302f31 100644
--- a/Task/Create-an-HTML-table/Java/create-an-html-table-3.java
+++ b/Task/Create-an-HTML-table/Java/create-an-html-table-3.java
@@ -1,25 +1,25 @@
public class HTML {
- public static String array2HTML(Object[][] array){
- StringBuilder html = new StringBuilder(
- "");
- for(Object elem:array[0]){
- html.append("" + elem.toString() + " ");
- }
- for(int i = 1; i < array.length; i++){
- Object[] row = array[i];
- html.append("");
- for(Object elem:row){
- html.append("" + elem.toString() + " ");
- }
- html.append(" ");
- }
- html.append("
");
- return html.toString();
- }
-
- public static void main(String[] args){
- Object[][] ints = {{"","X","Y","Z"},{1,1,2,3},{2,4,5,6},{3,7,8,9},{4,10,11,12}};
- System.out.println(array2HTML(ints));
- }
+ public static String array2HTML(Object[][] array){
+ StringBuilder html = new StringBuilder(
+ "");
+ for(Object elem:array[0]){
+ html.append("" + elem.toString() + " ");
+ }
+ for(int i = 1; i < array.length; i++){
+ Object[] row = array[i];
+ html.append("");
+ for(Object elem:row){
+ html.append("" + elem.toString() + " ");
+ }
+ html.append(" ");
+ }
+ html.append("
");
+ return html.toString();
+ }
+
+ public static void main(String[] args){
+ Object[][] ints = {{"","X","Y","Z"},{1,1,2,3},{2,4,5,6},{3,7,8,9},{4,10,11,12}};
+ System.out.println(array2HTML(ints));
+ }
}
diff --git a/Task/Create-an-HTML-table/JavaScript/create-an-html-table-1.js b/Task/Create-an-HTML-table/JavaScript/create-an-html-table-1.js
index 02d28e0f6d..9ba8c08860 100644
--- a/Task/Create-an-HTML-table/JavaScript/create-an-html-table-1.js
+++ b/Task/Create-an-HTML-table/JavaScript/create-an-html-table-1.js
@@ -4,32 +4,32 @@
Node.prototype.a = function (e) { this.appendChild(e); return this }
function ce(tag, txt) {
- var x = document.createElement(tag);
- x.textContent = (txt === undefined) ? '' : txt;
- return x;
+ var x = document.createElement(tag);
+ x.textContent = (txt === undefined) ? '' : txt;
+ return x;
}
function make_table(cols, rows) {
- var tbl = ce('table', ''), tr = ce('tr'), th;
+ var tbl = ce('table', ''), tr = ce('tr'), th;
- tbl.a(tr.a(ce('th')));
+ tbl.a(tr.a(ce('th')));
- var z = 'Z'.charCodeAt(0);
- for (var l = z - cols + 1; l <= z; l++)
- tr.a(ce('th', String.fromCharCode(l)));
+ var z = 'Z'.charCodeAt(0);
+ for (var l = z - cols + 1; l <= z; l++)
+ tr.a(ce('th', String.fromCharCode(l)));
- for (var r = 1; r <= rows; r++) {
- tbl.a(tr = ce('tr').a(ce('th', r)));
- for (var c = 0; c < cols; c++)
- tr.a(ce('td', Math.floor(Math.random() * 10000)));
- }
+ for (var r = 1; r <= rows; r++) {
+ tbl.a(tr = ce('tr').a(ce('th', r)));
+ for (var c = 0; c < cols; c++)
+ tr.a(ce('td', Math.floor(Math.random() * 10000)));
+ }
- document.body
- .a(ce('style',
- 'td, th {border: 1px solid #696;' +
- 'padding:.4ex} td {text-align: right }' +
- 'table { border-collapse: collapse}'))
- .a(tbl);
+ document.body
+ .a(ce('style',
+ 'td, th {border: 1px solid #696;' +
+ 'padding:.4ex} td {text-align: right }' +
+ 'table { border-collapse: collapse}'))
+ .a(tbl);
}